Studies on the universal parameters and onset of chaos in dissipative systems

It has become clear over the last few years that many deterministic dynamical systems described by simple but nonlinear equations with only a few variables can behave in an irregular or random fashion. This phenomenon, commonly called deterministic chaos, is essentially due to the fact that we cannot deal with infinitely precise numbers. In these systems trajectories emerging from nearby initial conditions diverge exponentially as time evolves)and therefore)any small error in the initial measurement spreads with time considerably, leading to unpredictable and chaotic behaviour The thesis work is mainly centered on the asymptotic behaviour of nonlinear and nonintegrable dissipative dynamical systems. It is found that completely deterministic nonlinear differential equations describing such systems can exhibit random or chaotic behaviour. Theoretical studies on this chaotic behaviour can enhance our understanding of various phenomena such as turbulence, nonlinear electronic circuits, erratic behaviour of heart and brain, fundamental molecular reactions involving DNA, meteorological phenomena, fluctuations in the cost of materials and so on. Chaos is studied mainly under two different approaches - the nature of the onset of chaos and the statistical description of the chaotic state.

Analytical properties of horizontal visibility graphs in the Feigenbaum scenario

Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [B. Luque et al., PLoS ONE 6, 9 (2011)] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here, we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree distributions, mean distances, clustering coefficients, etc., associated to the bifurcation cascades and their accumulation points. We describe how the resultant families of graphs can be framed into a renormalization group scheme in which fixed-point graphs reveal their scaling properties. These fixed points are then re-derived from an entropy optimization process defined for the graph sets, confirming a suggested connection between renormalization group and entropy optimization. Finally, we provide analytical and numerical results for the graph entropy and show that it emulates the Lyapunov exponent of the map independently of its sign.

Topological Complexity and Predictability in the Dynamics of a Tumor Growth Model with Shilnikov's Chaos

Dynamical systems modeling tumor growth have been investigated to determine the dynamics between tumor and healthy cells. Recent theoretical investigations indicate that these interactions may lead to different dynamical outcomes, in particular to homoclinic chaos. In the present study, we analyze both topological and dynamical properties of a recently characterized chaotic attractor governing the dynamics of tumor cells interacting with healthy tissue cells and effector cells of the immune system. By using the theory of symbolic dynamics, we first characterize the topological entropy and the parameter space ordering of kneading sequences from one-dimensional iterated maps identified in the dynamics, focusing on the effects of inactivation interactions between both effector and tumor cells. The previous analyses are complemented with the computation of the spectrum of Lyapunov exponents, the fractal dimension and the predictability of the chaotic attractors. Our results show that the inactivation rate of effector cells by the tumor cells has an important effect on the dynamics of the system. The increase of effector cells inactivation involves an inverse Feigenbaum (i.e. period-halving bifurcation) scenario, which results in the stabilization of the dynamics and in an increase of dynamics predictability. Our analyses also reveal that, at low inactivation rates of effector cells, tumor cells undergo strong, chaotic fluctuations, with the dynamics being highly unpredictable. Our findings are discussed in the context of tumor cells potential viability.

Object transportation by multiple mobile robots controlled by attractor dynamics: theory and implementation

Dynamical systems theory is used as a theoretical language and tool to design a distributed control architecture for teams of mobile robots, that must transport a large object and simultaneously avoid collisions with (either static or dynamic) obstacles. Here we demonstrate in simulations and implementations in real robots that it is possible to simplify the architectures presented in previous work and to extend the approach to teams of n robots. The robots have no prior knowledge of the environment. The motion of each robot is controlled by a time series of asymptotical stable states. The attractor dynamics permits the integration of information from various sources in a graded manner. As a result, the robots show a strikingly smooth an stable team behaviour.

Using attractor dynamics to generate decentralized motion control of two mobile robots transporting a long object in coordination

Dynamical systems theory is used here as a theoretical language and tool to design a distributed control architecture for a team of two mobile robots that must transport a long object and simultaneously avoid obstacles. In this approach the level of modeling is at the level of behaviors. A “dynamics” of behavior is defined over a state space of behavioral variables (heading direction and path velocity). The environment is also modeled in these terms by representing task constraints as attractors (i.e. asymptotically stable states) or reppelers (i.e. unstable states) of behavioral dynamics. For each robot attractors and repellers are combined into a vector field that governs the behavior. The resulting dynamical systems that generate the behavior of the robots may be nonlinear. By design the systems are tuned so that the behavioral variables are always very close to one attractor. Thus the behavior of each robot is controled by a time series of asymptotically stable states. Computer simulations support the validity of our dynamic model architectures.

The potential field method and the nonlinear attractor dynamics approach: what are the differences?

One of the most popular approaches to path planning and control is the potential field method. This method is particularly attractive because it is suitable for on-line feedback control. In this approach the gradient of a potential field is used to generate the robot's trajectory. Thus, the path is generated by the transient solutions of a dynamical system. On the other hand, in the nonlinear attractor dynamic approach the path is generated by a sequence of attractor solutions. This way the transient solutions of the potential field method are replaced by a sequence of attractor solutions (i.e., asymptotically stable states) of a dynamical system. We discuss at a theoretical level some of the main differences of these two approaches.

Bistable attractor dynamics in neuromorphic aVLSI chips

Magdeburg, Univ., Fak. für Elektrotechnik und Informationstechnik, Diss., 2014

Estimating Attractor Dimension on the Nonlinear Pendulum Time Series

Chaotic dynamical systems exhibit trajectories in their phase space that converges to a strange attractor. The strangeness of the chaotic attractor is associated with its dimension in which instance it is described by a noninteger dimension. This contribution presents an overview of the main definitions of dimension discussing their evaluation from time series employing the correlation and the generalized dimension. The investigation is applied to the nonlinear pendulum where signals are generated by numerical integration of the mathematical model, selecting a single variable of the system as a time series. In order to simulate experimental data sets, a random noise is introduced in the time series. State space reconstruction and the determination of attractor dimensions are carried out regarding periodic and chaotic signals. Results obtained from time series analyses are compared with a reference value obtained from the analysis of mathematical model, estimating noise sensitivity. This procedure allows one to identify the best techniques to be applied in the analysis of experimental data.

An analogue of the logistic map in two dimensions

This is a sequel to our earlier work on the modulated logistic map. Here, we first show that the map comes under the universality class of Feigenbaum. We then give evidence for the fact that our model can generate strange attractors in the unit square for an uncountable number of parameter values in the range μ∞<μ<1. Numerical plots of the attractor for several values of μ are given and the self-similar structure is explicity shown in one case. The fractal and information dimensions of the attractors for many values of μ are shown to be greater than one and the variation in their structure is analysed using the two Lyapunov exponents of the system. Our results suggest that the map can be considered as an analogue of the logistic map in two dimensions and may be useful in describing certain higher dimensional chaotic phenomena.

A non-autonomous strongly damped wave equation: Existence and continuity of the pullback attractor

In this paper we consider the strongly damped wave equation with time-dependent terms u(tt) - Delta u - gamma(t)Delta u(t) + beta(epsilon)(t)u(t) = f(u), in a bounded domain Omega subset of R(n), under some restrictions on beta(epsilon)(t), gamma(t) and growth restrictions on the nonlinear term f. The function beta(epsilon)(t) depends on a parameter epsilon, beta(epsilon)(t) -> 0. We will prove, under suitable assumptions, local and global well-posedness (using the uniform sectorial operators theory), the existence and regularity of pullback attractors {A(epsilon)(t) : t is an element of R}, uniform bounds for these pullback attractors, characterization of these pullback attractors and their upper and lower semicontinuity at epsilon = 0. (C) 2010 Elsevier Ltd. All rights reserved.

Global attractor for a model of extensible beam with nonlinear damping and source terms

This paper is concerned with the existence of a global attractor for the nonlinear beam equation, with nonlinear damping and source terms, u(tt) + Delta(2)u -M (integral(Omega)vertical bar del u vertical bar(2)dx) Delta u + f(u) + g(u(t)) = h in Omega x R(+), where Omega is a bounded domain of R(N), M is a nonnegative real function and h is an element of L(2)(Omega). The nonlinearities f(u) and g(u(t)) are essentially vertical bar u vertical bar(rho) u - vertical bar u vertical bar(sigma) u and vertical bar u(t)vertical bar(r) u(t) respectively, with rho, sigma, r > 0 and sigma < rho. This kind of problem models vibrations of extensible beams and plates. (C) 2010 Elsevier Ltd. All rights reserved.

Regularity of solutions on the global attractor for a semilinear damped wave equation

We consider attractors A(eta), eta epsilon [0, 1], corresponding to a singularly perturbed damped wave equation u(tt) + 2 eta A(1/2)u(t) + au(t) + Au = f (u) in H-0(1)(Omega) x L-2 (Omega), where Omega is a bounded smooth domain in R-3. For dissipative nonlinearity f epsilon C-2(R, R) satisfying vertical bar f ``(s)vertical bar <= c(1 + vertical bar s vertical bar) with some c > 0, we prove that the family of attractors {A(eta), eta >= 0} is upper semicontinuous at eta = 0 in H1+s (Omega) x H-s (Omega) for any s epsilon (0, 1). For dissipative f epsilon C-3 (R, R) satisfying lim(vertical bar s vertical bar) (->) (infinity) f ``(s)/s = 0 we prove that the attractor A(0) for the damped wave equation u(tt) + au(t) + Au = f (u) (case eta = 0) is bounded in H-4(Omega) x H-3(Omega) and thus is compact in the Holder spaces C2+mu ((Omega) over bar) x C1+mu((Omega) over bar) for every mu epsilon (0, 1/2). As a consequence of the uniform bounds we obtain that the family of attractors {A(eta), eta epsilon [0, 1]} is upper and lower semicontinuous in C2+mu ((Omega) over bar) x C1+mu ((Omega) over bar) for every mu epsilon (0, 1/2). (c) 2007 Elsevier Inc. All rights reserved.

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.

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.

A Mismatch-Based Model for Memory Reconsolidation and Extinction in Attractor Networks

OSAN, R. , TORT, A. B. L. , AMARAL, O. B. . A mismatch-based model for memory reconsolidation and extinction in attractor networks. Plos One, v. 6, p. e23113, 2011.