Free inertial processes driven by Gaussian noise: Probability distributions, anomalous diffusion and fractal behavior

We study the motion of an unbound particle under the influence of a random force modeled as Gaussian colored noise with an arbitrary correlation function. We derive exact equations for the joint and marginal probability density functions and find the associated solutions. We analyze in detail anomalous diffusion behaviors along with the fractal structure of the trajectories of the particle and explore possible connections between dynamical exponents of the variance and the fractal dimension of the trajectories.

Discriminant ECOC: a heuristic method for application dependent design of error correcting output codes

We present a heuristic method for learning error correcting output codes matrices based on a hierarchical partition of the class space that maximizes a discriminative criterion. To achieve this goal, the optimal codeword separation is sacrificed in favor of a maximum class discrimination in the partitions. The creation of the hierarchical partition set is performed using a binary tree. As a result, a compact matrix with high discrimination power is obtained. Our method is validated using the UCI database and applied to a real problem, the classification of traffic sign images.

Subclass problem-dependent design for error-correcting output codes

A common way to model multiclass classification problems is by means of Error-Correcting Output Codes (ECOCs). Given a multiclass problem, the ECOC technique designs a code word for each class, where each position of the code identifies the membership of the class for a given binary problem. A classification decision is obtained by assigning the label of the class with the closest code. One of the main requirements of the ECOC design is that the base classifier is capable of splitting each subgroup of classes from each binary problem. However, we cannot guarantee that a linear classifier model convex regions. Furthermore, nonlinear classifiers also fail to manage some type of surfaces. In this paper, we present a novel strategy to model multiclass classification problems using subclass information in the ECOC framework. Complex problems are solved by splitting the original set of classes into subclasses and embedding the binary problems in a problem-dependent ECOC design. Experimental results show that the proposed splitting procedure yields a better performance when the class overlap or the distribution of the training objects conceal the decision boundaries for the base classifier. The results are even more significant when one has a sufficiently large training size.

Growth rate of fractal copper electrodeposits: Potential and concentration effects

Experiments are reported on fractal copper electrodeposits. An electrochemical cell was designed in order to obtain a potentiostatic control on the quasi-two-dimensional electrodeposition process. The aim was focused on the analysis of the growth rate of the electrodeposited phase, in particular its dependence on the electrode potential and electrolyte concentration.

Performance Analysis of Two Quantum Reaction Dynamics Codes: Time-Dependent and Time-Independent Strategies

The computer simulation of reaction dynamics has nowadays reached a remarkable degree of accuracy. Triatomic elementary reactions are rigorously studied with great detail on a straightforward basis using a considerable variety of Quantum Dynamics computational tools available to the scientific community. In our contribution we compare the performance of two quantum scattering codes in the computation of reaction cross sections of a triatomic benchmark reaction such as the gas phase reaction Ne + H2+ %12. NeH++ H. The computational codes are selected as representative of time-dependent (Real Wave Packet [ ]) and time-independent (ABC [ ]) methodologies. The main conclusion to be drawn from our study is that both strategies are, to a great extent, not competing but rather complementary. While time-dependent calculations advantages with respect to the energy range that can be covered in a single simulation, time-independent approaches offer much more detailed information from each single energy calculation. Further details such as the calculation of reactivity at very low collision energies or the computational effort related to account for the Coriolis couplings are analyzed in this paper.

Product Perfect Codes and Steganography

A new coding technique to be used in steganography is evaluated. The performanceof this new technique is computed and comparisons with the well-known theoreticalupper bound, Hamming upper bound and basic LSB are established.

Comments on "On the relationship between fractal dimension and the performance of multi-resonant dipole antennas using Koch curves"

Comentaris referits a l'article següent: K. J. Vinoy, J. K. Abraham, and V. K. Varadan, “On the relationshipbetween fractal dimension and the performance of multi-resonant dipoleantennas using Koch curves,” IEEE Transactions on Antennas and Propagation, 2003, vol. 51, p. 2296–2303.

Construction and performance of network codes

El principal objectiu d'aquest treball és implementar i exposar una descripció teòrica per a diferents esquemes de Physical Layer Network Coding. Utilitzant un esquema bàsic com a punt de partida, el projecte presenta la construcció i l'anàlisis de diferents esquemes de comunicació on la complexitat va augmentant a mesura que anem avançant en el projecte. El treball està estructurat en diferents parts: primer, es presenta una introducció a Physical Layer Network Coding i a Lattice Network Codes. A continuació, s'introdueixen les eines matemàtiques necessàries per entendre el CF System. Després, s'analitza i implementa el primer esquema bàsic. A partir del qual, implementem una versió vectorial del CF System i una versió codificada amb un Hamming q-ari. Finalment, s'estudien i implementen diferents estratègies per millorar la matriu de coeficients A.

Performance Analysis of Two Quantum Reaction Dynamics Codes: Time-Dependent and Time-Independent Strategies

The computer simulation of reaction dynamics has nowadays reached a remarkable degree of accuracy. Triatomic elementary reactions are rigorously studied with great detail on a straightforward basis using a considerable variety of Quantum Dynamics computational tools available to the scientific community. In our contribution we compare the performance of two quantum scattering codes in the computation of reaction cross sections of a triatomic benchmark reaction such as the gas phase reaction Ne + H2+ %12. NeH++ H. The computational codes are selected as representative of time-dependent (Real Wave Packet [ ]) and time-independent (ABC [ ]) methodologies. The main conclusion to be drawn from our study is that both strategies are, to a great extent, not competing but rather complementary. While time-dependent calculations advantages with respect to the energy range that can be covered in a single simulation, time-independent approaches offer much more detailed information from each single energy calculation. Further details such as the calculation of reactivity at very low collision energies or the computational effort related to account for the Coriolis couplings are analyzed in this paper.

Adquisició de les codes complexes finals del català per part d'alumnat panjabi: el mètode experimental

En aquest treball estudiem l’adquisició del català per part de parlants que tenen el panjabi com a primera llengua, concretament en relació amb les codes complexes de final de mot, per a aprenents d’un nivell inicial de català

Propagation through fractal media: The Sierpinski gasket and the Koch curve

We present new analytical tools able to predict the averaged behavior of fronts spreading through self-similar spatial systems starting from reaction-diffusion equations. The averaged speed for these fronts is predicted and compared with the predictions from a more general equation (proposed in a previous work of ours) and simulations. We focus here on two fractals, the Sierpinski gasket (SG) and the Koch curve (KC), for two reasons, i.e. i) they are widely known structures and ii) they are deterministic fractals, so the analytical study of them turns out to be more intuitive. These structures, despite their simplicity, let us observe several characteristics of fractal fronts. Finally, we discuss the usefulness and limitations of our approa

Z2Z4-Additive Perdect Codes in Steganography

Steganography is an information hiding application which aims tohide secret data imperceptibly into a cover object. In this paper, we describe anovel coding method based on Z2Z4-additive codes in which data is embeddedby distorting each cover symbol by one unit at most (+-1-steganography). Thismethod is optimal and solves the problem encountered by the most e cientmethods known today, concerning the treatment of boundary values. Theperformance of this new technique is compared with that of the mentionedmethods and with the well-known rate-distortion upper bound to conclude thata higher payload can be obtained for a given distortion by using the proposedmethod.