Green function for the diffusion limit of one-dimensional continuous time random walks

It is shown how the fractional probability density diffusion equation for the diffusion limit of one-dimensional continuous time random walks may be derived from a generalized Markovian Chapman-Kolmogorov equation. The non-Markovian behaviour is incorporated into the Markovian Chapman-Kolmogorov equation by postulating a Levy like distribution of waiting times as a kernel. The Chapman-Kolmogorov equation so generalised then takes on the form of a convolution integral. The dependence on the initial conditions typical of a non-Markovian process is treated by adding a time dependent term involving the survival probability to the convolution integral. In the diffusion limit these two assumptions about the past history of the process are sufficient to reproduce anomalous diffusion and relaxation behaviour of the Cole-Cole type. The Green function in the diffusion limit is calculated using the fact that the characteristic function is the Mittag-Leffler function. Fourier inversion of the characteristic function yields the Green function in terms of a Wright function. The moments of the distribution function are evaluated from the Mittag-Leffler function using the properties of characteristic functions and a relation between the powers of the second moment and higher order even moments is derived. (C) 2004 Elsevier B.V. All rights reserved.

Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems

A new search-space-updating technique for genetic algorithms is proposed for continuous optimisation problems. Other than gradually reducing the search space during the evolution process with a fixed reduction rate set ‘a priori’, the upper and the lower boundaries for each variable in the objective function are dynamically adjusted based on its distribution statistics. To test the effectiveness, the technique is applied to a number of benchmark optimisation problems in comparison with three other techniques, namely the genetic algorithms with parameter space size adjustment (GAPSSA) technique [A.B. Djurišic, Elite genetic algorithms with adaptive mutations for solving continuous optimization problems – application to modeling of the optical constants of solids, Optics Communications 151 (1998) 147–159], successive zooming genetic algorithm (SZGA) [Y. Kwon, S. Kwon, S. Jin, J. Kim, Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Computers and Structures 81 (2003) 1715–1725] and a simple GA. The tests show that for well-posed problems, existing search space updating techniques perform well in terms of convergence speed and solution precision however, for some ill-posed problems these techniques are statistically inferior to a simple GA. All the tests show that the proposed new search space update technique is statistically superior to its counterparts.

Continuous assessment activities - correlation with final exam grades and effect on final grades. A business studies experience

In this paper we analyze the partial grades – of continuous assessment activities including the final exam – and the final grades – computed as a weighted average of partial grades – for nine subjects taught in the third year of Business Administration Degree. On one hand, results show that there is a significant positive correlation between the grades of continuous assessment activities (excluded the final exam) and final exam in seven subjects. On the other hand, overall we find that students’ grades in continuous assessment activities (excluded the final exam) help in the improvement of their final grades (i.e., students’ final grades exceed the grades that they would obtain by only taking into account their final exam grades). The results are consistent when the analysis is carried out over each subject area as well as over the grades of the students who registered for the nine subjects.

Accumulation of entanglement in a continuous variable memory

We study entanglement accumulation in a memory built out of two continuous variable systems interacting with a qubit that mediates their indirect coupling. We show that, in contrast with the case of bidimensional Hilbert spaces, entanglement superior to one ebit can be accumulated in the memory, even though no entangled resource is used. The protocol is immediately implementable and we assess the role of the main imperfections.