Time-delayed reaction-diffusion fronts

A time-delayed second-order approximation for the front speed in reaction-dispersion systems was obtained by Fort and Méndez [Phys. Rev. Lett. 82, 867 (1999)]. Here we show that taking proper care of the effect of the time delay on the reactive process yields a different evolution equation and, therefore, an alternate equation for the front speed. We apply the new equation to the Neolithic transition. For this application the new equation yields speeds about 10% slower than the previous one

Time-delayed fronts from biased random walks

We generalize a previous model of time-delayed reaction–diffusion fronts (Fort and Méndez 1999 Phys. Rev. Lett. 82 867) to allow for a bias in the microscopic random walk of particles or individuals. We also present a second model which takes the time order of events (diffusion and reproduction) into account. As an example, we apply them to the human invasion front across the USA in the 19th century. The corrections relative to the previous model are substantial. Our results are relevant to physical and biological systems with anisotropic fronts, including particle diffusion in disordered lattices, population invasions, the spread of epidemics, etc

Time-Delayed Theory of the Neolithic Transition in Europe

The classical wave-of-advance model of the neolithic transition (i.e., the shift from hunter-gatherer to agricultural economies) is based on Fisher's reaction-diffusion equation. Here we present an extension of Einstein's approach to Fickian diffusion, incorporating reaction terms. On this basis we show that second-order terms in the reaction-diffusion equation, which have been neglected up to now, are not in fact negligible but can lead to important corrections. The resulting time-delayed model agrees quite well with observations

Time-Delayed Spread of Viruses in Growing Plaques

The spread of viruses in growing plaques predicted by classical models is greater than that measured experimentally. There is a widespread belief that this discrepancy is due to biological factors. Here we show that the observed speeds can be satisfactorily predicted by a purely physical model that takes into account the delay time due to virus reproduction inside infected cells. No free or adjustable parameters are used

Probabilistically analysable real-time systems (PROARTIS)

Critical real-time ebedded (CRTE) Systems require safe and tight worst-case execution time (WCET) estimations to provide required safety levels and keep costs low. However, CRTE Systems require increasing performance to satisfy performance needs of existing and new features. Such performance can be only achieved by means of more agressive hardware architectures, which are much harder to analyze from a WCET perspective. The main features considered include cache memòries and multi-core processors.Thus, althoug such features provide higher performance, corrent WCET analysis methods are unable to provide tight WCET estimations. In fact, WCET estimations become worse than for simple rand less powerful hardware. The main reason is the fact that hardware behavior is deterministic but unknown and, therefore, the worst-case behavior must be assumed most of the time, leading to large WCET estimations. The purpose of this project is developing new hardware designs together with WCET analysis tools able to provide tight and safe WCET estimations. In order to do so, those pieces of hardware whose behavior is not easily analyzable due to lack of accurate information during WCET analysis will be enhanced to produce a probabilistically analyzable behavior. Thus, even if the worst-case behavior cannot be removed, its probabilty can be bounded, and hence, a safe and tight WCET can be provided for a particular safety level in line with the safety levels of the remaining components of the system. During the first year the project we have developed molt of the evaluation infraestructure as well as the techniques hardware techniques to analyze cache memories. During the second year those techniques have been evaluated, and new purely-softwar techniques have been developed.

Space Competition and Time Delays in Human Range Expansions. Application to the Neolithic Transition

Space competition effects are well-known in many microbiological and ecological systems. Here we analyze such an effectin human populations. The Neolithic transition (change from foraging to farming) was mainly the outcome of a demographic process that spread gradually throughout Europe from the Near East. In Northern Europe, archaeological data show a slowdown on the Neolithic rate of spread that can be related to a high indigenous (Mesolithic) population density hindering the advance as a result of the space competition between the two populations. We measure this slowdown from a database of 902 Early Neolithic sites and develop a time-delayed reaction-diffusion model with space competition between Neolithic and Mesolithic populations, to predict the observed speeds. The comparison of the predicted speed with the observations and with a previous non-delayed model show that both effects, the time delay effect due to the generation lag and the space competition between populations, are crucial in order to understand the observations

Speed of wave-front solutions to hyperbolic reaction-diffusion equations

The asymptotic speed problem of front solutions to hyperbolic reaction-diffusion (HRD) equations is studied in detail. We perform linear and variational analyses to obtain bounds for the speed. In contrast to what has been done in previous work, here we derive upper bounds in addition to lower ones in such a way that we can obtain improved bounds. For some functions it is possible to determine the speed without any uncertainty. This is also achieved for some systems of HRD (i.e., time-delayed Lotka-Volterra) equations that take into account the interaction among different species. An analytical analysis is performed for several systems of biological interest, and we find good agreement with the results of numerical simulations as well as with available observations for a system discussed recently

Mean first-passage times for systems driven by equilibrium persistent-periodic dichotomous noise

In a recent paper, [J. M. Porrà, J. Masoliver, and K. Lindenberg, Phys. Rev. E 48, 951 (1993)], we derived the equations for the mean first-passage time for systems driven by the coin-toss square wave, a particular type of dichotomous noisy signal, to reach either one of two boundaries. The coin-toss square wave, which we here call periodic-persistent dichotomous noise, is a random signal that can only change its value at specified time points, where it changes its value with probability q or retains its previous value with probability p=1-q. These time points occur periodically at time intervals t. Here we consider the stationary version of this signal, that is, equilibrium periodic-persistent noise. We show that the mean first-passage time for systems driven by this stationary noise does not show either the discontinuities or the oscillations found in the case of nonstationary noise. We also discuss the existence of discontinuities in the mean first-passage time for random one-dimensional stochastic maps.

The Role of the Delay Time in the Modeling of Biological Range Expansions

The time interval between successive migrations of biological species causes a delay time in the reaction-diffusion equations describing their space-time dynamics. This lowers the predicted speed of the waves of advance, as compared to classical models. It has been shown that this delay-time effect improves the modeling of human range expansions. Here, we demonstrate that it can also be important for other species. We present two new examples where the predictions of the time-delayed and the classical (Fisher) approaches are compared to experimental data. No free or adjustable parameters are used. We show that the importance of the delay effect depends on the dimensionless product of the initial growth rate and the delay time. We argue that the delay effect should be taken into account in the modeling of range expansions for biological species

Speed of travelling fronts: Two-dimensional and ballistic dispersal probability distributions

The speed of traveling fronts for a two-dimensional model of a delayed reactiondispersal process is derived analytically and from simulations of molecular dynamics. We show that the one-dimensional (1D) and two-dimensional (2D) versions of a given kernel do not yield always the same speed. It is also shown that the speeds of time-delayed fronts may be higher than those predicted by the corresponding non-delayed models. This result is shown for systems with peaked dispersal kernels which lead to ballistic transport

Anàlisi del sistema operatiu RTLinux e implementació d'un entorn de desenvolupament de tasques en temps real (aplicat al control de processos)

El projecte "Anàlisi del sistema operatiu RTLinux i implementació d'un entorn de desenvolupament de tasques en temps real" analitza la possibilitat de crear un entorn de desenvolupament de tasques en temps real per poder crear sistemes de control complex, tot això mitjançant codi lliure. Inicialment es fa un aprenentatge sobre el concepte de temps real, després s'elegeix el sistema operatiu en temps real RTLinux per a crear l'entorn de desenvolupament utilitzant el llenguatge de programació Tcl/Tk. Es creen un conjunt d'aplicacions (pel control computacional) per estudiar la viabilitat de la construcció de l'entorn desitjat per facilitar la tasca de l'usuari final. Aquest projecte obre multitud de possibles camins a continuar: comunicació remota, implementació de planificadors, estudi de controladors, etc.

Coupling and monotonicity of queueing processes

The main purpose of this work is to give a survey of main monotonicity properties of queueing processes based on the coupling method. The literature on this topic is quite extensive, and we do not consider all aspects of this topic. Our more concrete goal is to select the most interesting basic monotonicity results and give simple and elegant proofs. Also we give a few new (or revised) proofs of a few important monotonicity properties for the queue-size and workload processes both in single-server and multi- server systems. The paper is organized as follows. In Section 1, the basic notions and results on coupling method are given. Section 2 contains known coupling results for renewal processes with focus on construction of synchronized renewal instants for a superposition of independent renewal processes. In Section 3, we present basic monotonicity results for the queue-size and workload processes. We consider both discrete-and continuous-time queueing systems with single and multi servers. Less known results on monotonicity of queueing processes with dependent service times and interarrival times are also presented. Section 4 is devoted to monotonicity of general Jackson-type queueing networks with Markovian routing. This section is based on the notable paper [17]. Finally, Section 5 contains elements of stability analysis of regenerative queues and networks, where coupling and monotonicity results play a crucial role to establish minimal suficient stability conditions. Besides, we present some new monotonicity results for tandem networks.

Redefinición del interfaz del Centro de Tráfico Centralizado (CTC) de una explotación ferroviaria

En aquest projecte, es mira de reflectir la necessitat d'utilitzar l'enginyeria i la facilitat d'ús per millorar els sistemes de control en temps real que es fan servir avui dia per a controlar processos crítics.

Speed of reaction-transport processes

We present an approach to determining the speed of wave-front solutions to reaction-transport processes. This method is more accurate than previous ones. This is explicitly shown for several cases of practical interest: (i) the anomalous diffusion reaction, (ii) reaction diffusion in an advective field, and (iii) time-delayed reaction diffusion. There is good agreement with the results of numerical simulations

Linux com a sistema operatiu de temps real

Avaluació de les capacitats d'assolir requeriments de temps real de la línia principal de nucli de Linux.