Dynamical models for computer viruses propagation

Nowadays, digital computer systems and networks are the main engineering tools, being used in planning, design, operation, and control of all sizes of building, transportation, machinery, business, and life maintaining devices. Consequently, computer viruses became one of the most important sources of uncertainty, contributing to decrease the reliability of vital activities. A lot of antivirus programs have been developed, but they are limited to detecting and removing infections, based on previous knowledge of the virus code. In spite of having good adaptation capability, these programs work just as vaccines against diseases and are not able to prevent new infections based on the network state. Here, a trial on modeling computer viruses propagation dynamics relates it to other notable events occurring in the network permitting to establish preventive policies in the network management. Data from three different viruses are collected in the Internet and two different identification techniques, autoregressive and Fourier analyses, are applied showing that it is possible to forecast the dynamics of a new virus propagation by using the data collected from other viruses that formerly infected the network. Copyright (c) 2008 J. R. C. Piqueira and F. B. Cesar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Probability currents and entropy production in nonequilibrium lattice systems

The structure of probability currents is studied for the dynamical network after consecutive contraction on two-state, nonequilibrium lattice systems. This procedure allows us to investigate the transition rates between configurations on small clusters and highlights some relevant effects of lattice symmetries on the elementary transitions that are responsible for entropy production. A method is suggested to estimate the entropy production for different levels of approximations (cluster sizes) as demonstrated in the two-dimensional contact process with mutation.

Dynamical Conductivity at the Dirty Superconductor-Metal Quantum Phase Transition

We study the transport properties of ultrathin disordered nanowires in the neighborhood of the superconductor-metal quantum phase transition. To this end we combine numerical calculations with analytical strong-disorder renormalization group results. The quantum critical conductivity at zero temperature diverges logarithmically as a function of frequency. In the metallic phase, it obeys activated scaling associated with an infinite-randomness quantum critical point. We extend the scaling theory to higher dimensions and discuss implications for experiments.

Recursive linear estimation for general discrete-time descriptor systems

This paper considers the optimal linear estimates recursion problem for discrete-time linear systems in its more general formulation. The system is allowed to be in descriptor form, rectangular, time-variant, and with the dynamical and measurement noises correlated. We propose a new expression for the filter recursive equations which presents an interesting simple and symmetric structure. Convergence of the associated Riccati recursion and stability properties of the steady-state filter are provided. (C) 2010 Elsevier Ltd. All rights reserved.

Mutually connected phase-locked loop networks: dynamical models and design parameters

Distribution of timing signals is an essential factor for the development of digital systems for telecommunication networks, integrated circuits and manufacturing automation. Originally, this distribution was implemented by using the master-slave architecture with a precise master clock generator sending signals to phase-locked loops (PLL) working as slave oscillators. Nowadays, wireless networks with dynamical connectivity and the increase in size and operation frequency of the integrated circuits suggest that the distribution of clock signals could be more efficient if mutually connected architectures were used. Here, mutually connected PLL networks are studied and conditions for synchronous states existence are analytically derived, depending on individual node parameters and network connectivity, considering that the nodes are nonlinear oscillators with nonlinear coupling conditions. An expression for the network synchronisation frequency is obtained. The lock-in range and the transmission error bounds are analysed providing hints to the design of this kind of clock distribution system.

Pitfalls driven by the sole use of local updates in dynamical

The recent claim that the exit probability (EP) of a slightly modified version of the Sznadj model is a continuous function of the initial magnetization is questioned. This result has been obtained analytically and confirmed by Monte Carlo simulations, simultaneously and independently by two different groups (EPL, 82 (2008) 18006; 18007). It stands at odds with an earlier result which yielded a step function for the EP (Europhys. Lett., 70 (2005) 705). The dispute is investigated by proving that the continuous shape of the EP is a direct outcome of a mean-field treatment for the analytical result. As such, it is most likely to be caused by finite-size effects in the simulations. The improbable alternative would be a signature of the irrelevance of fluctuations in this system. Indeed, evidence is provided in support of the stepwise shape as going beyond the mean-field level. These findings yield new insight in the physics of one-dimensional systems with respect to the validity of a true equilibrium state when using solely local update rules. The suitability and the significance to perform numerical simulations in those cases is discussed. To conclude, a great deal of caution is required when applying updates rules to describe any system especially social systems. Copyright (C) EPLA, 2011

A Dynamical Modeling to Study the Adaptive Immune System and the Influence of Antibodies in the Immune Memory

Immunological systems have been an abundant inspiration to contemporary computer scientists. Problem solving strategies, stemming from known immune system phenomena, have been successfully applied to chall enging problems of modem computing. Simulation systems and mathematical modeling are also beginning use to answer more complex immunological questions as immune memory process and duration of vaccines, where the regulation mechanisms are not still known sufficiently (Lundegaard, Lund, Kesmir, Brunak, Nielsen, 2007). In this article we studied in machina a approach to simulate the process of antigenic mutation and its implications for the process of memory. Our results have suggested that the durability of the immune memory is affected by the process of antigenic mutation.and by populations of soluble antibodies in the blood. The results also strongly suggest that the decrease of the production of antibodies favors the global maintenance of immune memory.

Dynamic portrait of the planetary 2/1 mean-motion resonance - I. Systems with a more massive outer planet

We analyse the global structure of the phase space of the planar planetary 2/1 mean-motion resonance in cases where the outer planet is more massive than its inner companion. Inside the resonant domain, we show the existence of two families of periodic orbits, one associated to the librational motion of resonant angle (sigma-family) and the other related to the circulatory motion of the difference in longitudes of pericentre (Delta pi-family). The well-known apsidal corotation resonances (ACR) appear as intersections between both families. A complex web of secondary resonances is also detected for low eccentricities, whose strengths and positions are dependent on the individual masses and spatial scale of the system. The construction of dynamical maps for various values of the total angular momentum shows the evolution of the families of stable motion with the eccentricities, identifying possible configurations suitable for exoplanetary systems. For low-moderate eccentricities, several different stable modes exist outside the ACR. For larger eccentricities, however, all stable solutions are associated to oscillations around the stationary solutions. Finally, we present a possible link between these stable families and the process of resonance capture, identifying the most probable routes from the secular region to the resonant domain, and discussing how the final resonant configuration may be affected by the extension of the chaotic layer around the resonance region.

Dynamic portrait of the planetary 2/1 mean-motion resonance - II. Systems with a more massive inner planet

This paper presents the second part in our study of the global structure of the planar phase space of the planetary three-body problem, when both planets lie in the vicinity of a 2/1 mean-motion resonance. While Paper I was devoted to cases where the outer planet is the more massive body, the present work is devoted to the cases where the more massive body is the inner planet. As before, outside the well-known Apsidal Corotation Resonances (ACR), the phase space shows a complex picture marked by the presence of several distinct regimes of resonant and non-resonant motion, crossed by families of periodic orbits and separated by chaotic zones. When the chosen values of the integrals of motion lead to symmetric ACR, the global dynamics are generally similar to the structure presented in Paper I. However, for asymmetric ACR the resonant phase space is strikingly different and shows a galore of distinct dynamical states. This structure is shown with the help of dynamical maps constructed on two different representative planes, one centred on the unstable symmetric ACR and the other on the stable asymmetric equilibrium solution. Although the study described in the work may be applied to any mass ratio, we present a detailed analysis for mass values similar to the Jupiter-Saturn case. Results give a global view of the different dynamical states available to resonant planets with these characteristics. Some of these dynamical paths could have marked the evolution of the giant planets of our Solar system, assuming they suffered a temporary capture in the 2/1 resonance during the latest stages of the formation of our Solar system.

Prediction of dynamical, nonlinear, and unstable process behavior

Process scheduling techniques consider the current load situation to allocate computing resources. Those techniques make approximations such as the average of communication, processing, and memory access to improve the process scheduling, although processes may present different behaviors during their whole execution. They may start with high communication requirements and later just processing. By discovering how processes behave over time, we believe it is possible to improve the resource allocation. This has motivated this paper which adopts chaos theory concepts and nonlinear prediction techniques in order to model and predict process behavior. Results confirm the radial basis function technique which presents good predictions and also low processing demands show what is essential in a real distributed environment.

UNIVERSAL COVERING OF DRIFTLESS CONTROL SYSTEMS

Let M be a finite-dimensional manifold and Sigma be a driftless control system on M of full rank. We prove that for a given initial state x epsilon M, the covering space Gamma(Sigma, x) for a monotonic homotopy of trajectories of Sigma which is recently constructed in [1] coincides with the simply connected universal covering manifold of M and that the terminal projection epsilon(x) : Gamma(Sigma, x) -> M given by epsilon(x) ([alpha]) = alpha(1) is a covering mapping.

UNIFORM DISSIPATIVENESS, ROBUST SYNCHRONIZATION AND LOCATION OF THE ATTRACTOR OF PARAMETRIZED NONAUTONOMOUS DISCRETE SYSTEMS

In this series of papers, we study issues related to the synchronization of two coupled chaotic discrete systems arising from secured communication. The first part deals with uniform dissipativeness with respect to parameter variation via the Liapunov direct method. We obtain uniform estimates of the global attractor for a general discrete nonautonomous system, that yields a uniform invariance principle in the autonomous case. The Liapunov function is allowed to have positive derivative along solutions of the system inside a bounded set, and this reduces substantially the difficulty of constructing a Liapunov function for a given system. In particular, we develop an approach that incorporates the classical Lagrange multiplier into the Liapunov function method to naturally extend those Liapunov functions from continuous dynamical system to their discretizations, so that the corresponding uniform dispativeness results are valid when the step size of the discretization is small. Applications to the discretized Lorenz system and the discretization of a time-periodic chaotic system are given to illustrate the general results. We also show how to obtain uniform estimation of attractors for parametrized linear stable systems with nonlinear perturbation.

Critical discontinuous phase transition in the threshold contact process

We analyze a threshold contact process on a square lattice in which particles are created on empty sites with at least two neighboring particles and are annihilated spontaneously. We show by means of Monte Carlo simulations that the process undergoes a discontinuous phase transition at a definite value of the annihilation parameter, in accordance with the Gibbs phase rule, and that the discontinuous transition exhibits critical behavior. The simulations were performed by using boundary conditions in which the sites of the border of the lattice are permanently occupied by particles.

Conservative ensembles for nonequilibrium lattice-gas systems

We show how to set up a constant particle ensemble for the steady state of nonequilibrium lattice-gas systems which originally are defined on a constant rate ensemble. We focus on nonequilibrium systems in which particles are created and annihilated on the sites of a lattice and described by a master equation. We consider also the case in which a quantity other than the number of particle is conserved. The conservative ensembles can be useful in the study of phase transitions and critical phenomena particularly discontinuous phase transitions.

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.