Avalanche dynamics of fiber bundle models

We present a detailed analytical and numerical study of the avalanche distributions of the continuous damage fiber bundle model CDFBM . Linearly elastic fibers undergo a series of partial failure events which give rise to a gradual degradation of their stiffness. We show that the model reproduces a wide range of mechanical behaviors. We find that macroscopic hardening and plastic responses are characterized by avalanche distributions, which exhibit an algebraic decay with exponents between 5/2 and 2 different from those observed in mean-field fiber bundle models. We also derive analytically the phase diagram of a family of CDFBM which covers a large variety of potential avalanche size distributions. Our results provide a unified view of the statistics of breaking avalanches in fiber bundle models

Dynamical features of reaction-diffusion fronts in fractals

The speed of front propagation in fractals is studied by using (i) the reduction of the reaction-transport equation into a Hamilton-Jacobi equation and (ii) the local-equilibrium approach. Different equations proposed for describing transport in fractal media, together with logistic reaction kinetics, are considered. Finally, we analyze the main features of wave fronts resulting from this dynamic process, i.e., why they are accelerated and what is the exact form of this acceleration

Effect of initial conditions on the speed of reaction-diffusion fronts

The effect of initial conditions on the speed of propagating fronts in reaction-diffusion equations is examined in the framework of the Hamilton-Jacobi theory. We study the transition between quenched and nonquenched fronts both analytically and numerically for parabolic and hyperbolic reaction diffusion. Nonhomogeneous media are also analyzed and the effect of algebraic initial conditions is also discussed

Epidemic models with an infected-infectious period

The introduction of an infective-infectious period on the geographic spread of epidemics is considered in two different models. The classical evolution equations arising in the literature are generalized and the existence of epidemic wave fronts is revised. The asymptotic speed is obtained and improves previous results for the Black Death plague

Global and local connectivity changes in schizophrenia investigated by diffusion connectome

Background: New ways of representing diffusion data emerged recently and achieved to create structural connectivitymaps in healthy brains (Hagmann P et al. (2008)). These maps have the capacity to study alterations over the entire brain at the connection and network level. This is of high interest in complex disconnection diseases like schizophrenia. In this Pathology where multiple lines of evidence suggest the association of the pathology with abnormalities in neural circuitry and impaired structural connectivity, the diffusion imaging has been widely applied. Despite the large findings, most of the research using the diffusion just uses some scalar map derived from diffusion to show that some markers of white matter integrity are diminished in several areas of the brain (Kyriakopoulos M et al (2008)). Thanks to the structural connectionmatrix constructed by the whole brain tractography, we report in this work the network connectivity alterations in the schizophrenic patients. Methods: We investigated 13 schizophrenic patients as assessed by the DIGS (Diagnostic Interview for genetic studies, DSM IV criteria) and 13 healthy controls. We have got from each volunteer a DT-MRI as well as Qball imaging dataset and a high resolution anatomic T1 performed during the same session; with a 3 T clinical MRI scanner. The controls were matched on age, gender, handedness, and parental social economic-status. For all the subjects, a low resolution connection matrix is obtained by dividing the cortex into 66 gyral based ROIs. A higher resolution matrix is constructed using 250 ROIs as described in Hagmann P et al. (2008). These ROIs are respectively used jointly with the diffusion tractography to construct the high and low resolution densities connection matrices for each subject. In a first step the matrices of the groups are compared in term of connectivity, and not in term of density to check if the pathological group shows a loss of global connectivity. In this context the density connection matrices were binarized. As some local connectivity changes were also suspected, especially in frontal and temporal areas, we have also looked for the areas where the connectivity showed significant changes. Results: The statistical analysis revealed a significant loss of global connectivity in the schizophrenic's brains at level 5%. Furthermore, by constructing specific statistics which represent local connectivity within the anatomical regions (66 ROIs) using the data obtained by the finest resolution (250 ROIs) to improve the robustness, we found the regions that cause this significant loss of connectivity. The significance is observed after multiple testing corrections by the False Discovery Rate. Discussion: The detected regions are almost the same as those reported in the literature as the involved regions in schizophrenia. Most of the connectivity decreases are noted in both hemispheres in the fronto-frontal and temporo-temporal regions as well as some temporal ROIs with their adjacent ROIs in parietal and occipital lobes.

PSyscal: disseny i implementació d'un sistema paral·lel per al calibratge automàtic de models P-Sistema

Es tracta d'un projecte que proposa una aplicació per al calibratge automàtic de models P-sistema. Per a fer-ho primer es farà un estudi sobre els models P-sistema i el procediment seguit pels investigadors per desenvolupar aquest tipus de models. Es desenvoluparà una primera solució sèrie per al problema, i s'analitzaran els seus punts febles. Seguidament es proposarà una versió paral·lela que millori significativament el temps d'execució, tot mantenint una alta eficiència i escalabilitat.

Disseny i implementació d'una API en Python per el processament de models de poblacions simulats mitjançant PlinguaCore

En aquest projecte, tractarem de crear una aplicació que ens permeti d'una forma ràpida i eficient, el processament dels resultats obtinguts per un eina de simulació d'ecosistemes naturals anomenada PlinguaCore .L'objectiu d'aquest tractament és doble. En primer lloc, dissenyar una API que ens permeti de forma eficient processar la gran quantitat de dades generades per simulador d'ecosistemes PlinguaCore. En segon lloc, fer que aquesta API es pugui integrar en altres aplicacions, tant de tractament de dades, com de cal·libració dels models.

Anisotropic dispersion, space competition, and the slowdown of the Neolithic transition

The front speed of the Neolithic (farmer) spread in Europe decreased as it reached Northern latitudes, where the Mesolithic (huntergatherer) population density was higher. Here, we describe a reaction diffusion model with (i) an anisotropic dispersion kernel depending on the Mesolithicpopulation density gradient and (ii) a modified population growth equation. Both effects are related to the space available for the Neolithic population. The model is able to explain the slowdown of the Neolithic front as observed from archaeological data

Predictions from information-theoretical models of nonequilibrium radiation

The radiation distribution function used by Domínguez and Jou [Phys. Rev. E 51, 158 (1995)] has been recently modified by Domínguez-Cascante and Faraudo [Phys. Rev. E 54, 6933 (1996)]. However, in these studies neither distribution was written in terms of directly measurable quantities. Here a solution to this problem is presented, and we also propose an experiment that may make it possible to determine the distribution function of nonequilibrium radiation experimentally. The results derived do not depend on a specific distribution function for the matter content of the system

Speed of reaction-diffusion fronts in spatially heterogeneous media

The front speed problem for nonuniform reaction rate and diffusion coefficient is studied by using singular perturbation analysis, the geometric approach of Hamilton-Jacobi dynamics, and the local speed approach. Exact and perturbed expressions for the front speed are obtained in the limit of large times. For linear and fractal heterogeneities, the analytic results have been compared with numerical results exhibiting a good agreement. Finally we reach a general expression for the speed of the front in the case of smooth and weak heterogeneities

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

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

Tree-based message diffusion for managing replicated data in unreliable and resource-constrained peer-to-peer environment

Abstract This thesis proposes a set of adaptive broadcast solutions and an adaptive data replication solution to support the deployment of P2P applications. P2P applications are an emerging type of distributed applications that are running on top of P2P networks. Typical P2P applications are video streaming, file sharing, etc. While interesting because they are fully distributed, P2P applications suffer from several deployment problems, due to the nature of the environment on which they perform. Indeed, defining an application on top of a P2P network often means defining an application where peers contribute resources in exchange for their ability to use the P2P application. For example, in P2P file sharing application, while the user is downloading some file, the P2P application is in parallel serving that file to other users. Such peers could have limited hardware resources, e.g., CPU, bandwidth and memory or the end-user could decide to limit the resources it dedicates to the P2P application a priori. In addition, a P2P network is typically emerged into an unreliable environment, where communication links and processes are subject to message losses and crashes, respectively. To support P2P applications, this thesis proposes a set of services that address some underlying constraints related to the nature of P2P networks. The proposed services include a set of adaptive broadcast solutions and an adaptive data replication solution that can be used as the basis of several P2P applications. Our data replication solution permits to increase availability and to reduce the communication overhead. The broadcast solutions aim, at providing a communication substrate encapsulating one of the key communication paradigms used by P2P applications: broadcast. Our broadcast solutions typically aim at offering reliability and scalability to some upper layer, be it an end-to-end P2P application or another system-level layer, such as a data replication layer. Our contributions are organized in a protocol stack made of three layers. In each layer, we propose a set of adaptive protocols that address specific constraints imposed by the environment. Each protocol is evaluated through a set of simulations. The adaptiveness aspect of our solutions relies on the fact that they take into account the constraints of the underlying system in a proactive manner. To model these constraints, we define an environment approximation algorithm allowing us to obtain an approximated view about the system or part of it. This approximated view includes the topology and the components reliability expressed in probabilistic terms. To adapt to the underlying system constraints, the proposed broadcast solutions route messages through tree overlays permitting to maximize the broadcast reliability. Here, the broadcast reliability is expressed as a function of the selected paths reliability and of the use of available resources. These resources are modeled in terms of quotas of messages translating the receiving and sending capacities at each node. To allow a deployment in a large-scale system, we take into account the available memory at processes by limiting the view they have to maintain about the system. Using this partial view, we propose three scalable broadcast algorithms, which are based on a propagation overlay that tends to the global tree overlay and adapts to some constraints of the underlying system. At a higher level, this thesis also proposes a data replication solution that is adaptive both in terms of replica placement and in terms of request routing. At the routing level, this solution takes the unreliability of the environment into account, in order to maximize reliable delivery of requests. At the replica placement level, the dynamically changing origin and frequency of read/write requests are analyzed, in order to define a set of replica that minimizes communication cost.