Protecting, Enhancing and Reviving Entanglement

We propose a strategies not only to protect but also to enhance and revive the entanglement in a double Jaynes-Cummings model. We show that such surprising features arises when Zeno-like measurements are performed during the dynamical process

Local vs. long-range infection in unidimensional epidemics

We study the effects of local and distance interactions in the unidimensional contact process (CP). In the model, each site of a lattice is occupied by an individual, which can be healthy or infected. As in the standard CP, each infected individual spreads the disease to one of its first-neighbors with rate $\lambda$, and with unitary rate, it becomes healthy. However, in our model, an infected individual can transmit the disease to an individual at a distance $\ell$ apart. This step mimics a vector-mediated transmission. We observe the host-host interactions do not alter the critical exponents significantly in comparison to a process with only L\'evy-type interactions. Our results confirm, numerically, early field-theoretic predictions.Comment: 8 pages, 6 figures, to appear on Frontiers in Physic

Demographic growth and the distribution of language sizes

It is argued that the present log-normal distribution of language sizes is, to a large extent, a consequence of demographic dynamics within the population of speakers of each language. A two-parameter stochastic multiplicative process is proposed as a model for the population dynamics of individual languages, and applied over a period spanning the last ten centuries. The model disregards language birth and death. A straightforward fitting of the two parameters, which statistically characterize the population growth rate, predicts a distribution of language sizes in excellent agreement with empirical data. Numerical simulations, and the study of the size distribution within language families, validate the assumptions at the basis of the model.Comment: To appear in Int. J. Mod. Phys. C (2008

New Algorithms for Computing a Single Component of the Discrete Fourier Transform

This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general, than the well known Goertzel Algorithm.Comment: 4 pages, 3 figures, 1 table. In: 10th International Symposium on Communication Theory and Applications, Ambleside, U