Cascades with coupled map lattices in preferential attachment community networks

In this paper, cascading failure is studied by coupled map lattice （CML） methods in preferential attachment community networks. It is found that external perturbation R is increasing with modularity Q growing by simulation. In particular, the large modularity Q can hold off the cascading failure dynamic process in community networks. Furthermore, different attack strategies also greatly affect the cascading failure dynamic process. It is particularly significant to control cascading failure process in real community networks.

Feedback control scheme of traffic jams based on the coupled map car-following model

Based on the pioneering work of Konishi et al. [Phys. Rev. E （1999） 60 4000], a new feedback control scheme is presented to suppress traffic jams based on the coupled map car-following model under the open boundary condition. The effect of the safe headway on the traffic system is considered. According to the control theory, the condition under which traffic jams can be suppressed is analyzed. The results are compared with the previous results concerning congestion control. The simulations show that the suppression performance of our scheme on traffic jams is better than those of the previous schemes, although all the schemes can suppress traffic jams. The simulation results are consistent with theoretical analyses.

A new coupled map car-following model considering drivers' steady desired speed

Based on the pioneering work of Konishi et al., in consideration of the influence of drivers＇ steady desired speed ef/ect on the traffic flow, we develop a new coupled map car-following model in the real world. By use of the control theory, the stability condition of our model is derived. The validity of the present theoretical scheme is verified via numerical simulation, confirming the correctness of our theoretical analysis.

Tolerance of edge cascades with coupled map lattices methods

This paper studies the cascading failure on random networks and scale-free networks by introducing the tolerance parameter of edge based on the coupled map lattices methods. The whole work focuses on investigating some indices including the number of failed edges, dynamic edge tolerance capacity and the perturbation of edge. In general, it assumes that the perturbation is attributed to the normal distribution in adopted simulations. By investigating the effectiveness of edge tolerance in scale-free and random networks, it finds that the larger tolerance parameter λ can more efficiently delay the cascading failure process for scale-free networks than random networks. These results indicate that the cascading failure process can be effectively controlled by increasing the tolerance parameter λ. Moreover, the simulations also show that, larger variance of perturbation can easily trigger the cascading failures than the smaller one. This study may be useful for evaluating efficiency of whole traffic systems, and for alleviating cascading failure in such systems.

A control method for congested traffic in the coupled map car-following model

Based on the pioneer work of Konishi et al, a new control method is presented to suppress the traffic congestion in the coupled map （CM） car-following model under an open boundary. A control signal concluding the velocity differences of the two vehicles in front is put forward. The condition under which the traffic jam can be contained is analyzed. The results axe compared with that presented by Konishi et al [Phys. Rev. 1999 E 60 4000-4007]. The simulation results show that the temporal behavior obtained by our method is better than that by the Konishi＇s et al. method, although both the methods could suppress the traffic jam. The simulation results are consistent with the theoretical analysis.

Partial and complete periodic synchronization in coupled discontinuous map lattices

The partial and complete periodic synchronization in coupled discontinuous map lattices consisting of both discon- tinuous and non-invertible maps are discussed. We classify three typical types of periodic synchronization states, which give rise to different spatiotemporal patterns including static partial periodic synchronization, dynamically periodic syn- chronization, and complete periodic synchronization patterns. A special prelude dynamics of partial and complete periodic synchronization motion, which is shown by five separated concave curves in the time series plots of the order parameters, is observed. The detailed analysis shows that the special prelude dynamics is induced by the competition between two synchronized clusters, and the analytical expression for the corresponding order parameter is obtained.

A new coupled-map car-following model based on a transportation supernetwork framework

A new car-following model is proposed by considering information from a number of preceding vehicles with intervehicle communication. A supernetwork architecture is first described, which has two layers： a traffic network and a communication network. The two networks interact with and depend on each other. The error dynamic system around the steady state of the model is theoretically analyzed and some nonjam criteria are derived. A simple control signal is added to the model to analyze the criteria of suppressing traffic jams. The corresponding numerical simulations confirm the correctness of the theoretical analysis. Compared with previous studies concerning coupled map models, the controlled model proposed in this paper is more reasonable and also more effective in the sense that it takes into account the formation of traffic congestion.

Modified coupled map car-following model and its delayed feedback control scheme

A modified coupled map car-following model is proposed, in which two successive vehicle headways in front of the considering vehicle is incorporated into the optimal velocity function. The steady state under certain conditions is obtained. An error system around the steady state is studied further. Moreover, the condition for the state having no traffic jam is derived. A new control scheme is presented to suppress the traffic jam in the modified coupled map car-following model under the open boundary. A control signal including the velocity differences between the following and the considering vehicles, and between the preceding and the considering vehicles is used. The condition under which the traffic jam can be well suppressed is analysed. The results are compared with that presented by t^onishi et al. （the KKH model）. The simulation results show that the temporal behaviour obtained in our model is better than that in the KKH model. The simulation results are in good agreement with the theoretical analysis.

Cognitive radio resource allocation based on coupled chaotic genetic algorithm

A coupled chaotic genetic algorithm for cognitive radio resource allocation which is based on genetic algorithm and coupled Logistic map is proposed. A fitness function for cognitive radio resource allocation is provided. Simulations are conducted for cognitive radio resource allocation by using the coupled chaotic genetic algorithm, simple genetic algorithm and dynamic allocation algorithm respectively. The simulation results show that, compared with simple genetic and dynamic allocation algorithm, coupled chaotic genetic algorithm reduces the total transmission power and bit error rate in cognitive radio system, and has faster convergence speed.

A numerical study of coupled maps representing energy exchange processes between two environmental interfaces regarded as biophysical complex systems

The field of environmental sciences is abundant with various interfaces and is the right place for the application of new fundamental approaches leading towards a better understanding of environmental phenomena. Following the definition of environmental interface by Mihailovic and Bala? [1], such interface can be, for example, placed between: human or animal bodies and surrounding air, aquatic species and water and air around them, and natural or artificially built surfaces (vegetation, ice, snow, barren soil, water, urban communities) and the atmosphere, cells and surrounding environment, etc. Complex environmental interface systems are (i) open and hierarchically organised (ii) interactions between their constituent parts are nonlinear, and (iii) their interaction with the surrounding environment is noisy. These systems are therefore very sensitive to initial conditions, deterministic external perturbations and random fluctuations always present in nature. The study of noisy non-equilibrium processes is fundamental for modelling the dynamics of environmental interface regarded as biophysical complex system and for understanding the mechanisms of spatio-temporal pattern formation in contemporary environmental sciences. In this paper we will investigate an aspect of dynamics of energy flow based on the energy balance equation. The energy exchange between interacting environmen- tal interfaces regarded as biophysical complex systems can be represented by coupled maps. Therefore, we will numerically investigate coupled maps representing that exchange. In ana- lysis of behaviour of these maps we applied Lyapunov exponent and cross sample entropy.

CONVECTIVE COUPLED MAP FOR SIMULATING SPATIOTEMPORAL CHAOS IN FLOWS

A coupled map lattices with convective nonlinearity or, for short, Convective Coupled Map (CCM) is proposed in this paper to simulate spatiotemporal chaos in fluid hows. It is found that the parameter region of spatiotemporal chaos can be determined by the maximal Liapunov exponent of its complexity time series. This simple model implies a similar physical mechanism for turbulence such that the route to spatiotemporal chaos in fluid hows can be envisaged.

A method of recovering the initial vectors of globally coupled map lattices based on symbolic dynamics

Based on symbolic dynamics, a novel computationally efficient algorithm is proposed to estimate the unknown initial vectors of globally coupled map lattices （CMLs）. It is proved that not all inverse chaotic mapping functions are satisfied for contraction mapping. It is found that the values in phase space do not always converge on their initial values with respect to sufficient backward iteration of the symbolic vectors in terms of global convergence or divergence （CD）. Both CD property and the coupling strength are directly related to the mapping function of the existing CML. Furthermore, the CD properties of Logistic, Bernoulli, and Tent chaotic mapping functions are investigated and compared. Various simulation results and the performances of the initial vector estimation with different signal-to- noise ratios （SNRs） are also provided to confirm the proposed algorithm. Finally, based on the spatiotemporal chaotic characteristics of the CML, the conditions of estimating the initial vectors usiug symbolic dynamics are discussed. The presented method provides both theoretical and experimental results for better understanding and characterizing the behaviours of spatiotemporal chaotic systems.

PERIODIC SOLUTIONS IN ONE-DIMENSIONAL COUPLED MAP LATTICES

It is proven that the existence of nonlinear solutions with time period in one-dimensional coupled map lattice with nearest neighbor coupling. This is a class of systems whose behavior can be regarded as infinite array of coupled oscillators. A method for estimating the critical coupling strength below which these solutions with time period persist is given. For some particular nonlinear solutions with time period,exponential decay in space is proved.

A method of estimating initial conditions of coupled map lattices based on time-varying symbolic dynamics

A novel computationally efficient algorithm in terms of the time-varying symbolic dynamic method is proposed to estimate the unknown initial conditions of coupled map lattices （CMLs）. The presented method combines symbolic dynamics with time-varying control parameters to develop a time-varying scheme for estimating the initial condition of multi-dimensional spatiotemporal chaotic signals. The performances of the presented time-varying estimator in both noiseless and noisy environments are analysed and compared with the common time-invariant estimator. Simulations are carried out and the obtained results show that the proposed method provides an efficient estimation of the initial condition of each lattice in the coupled system. The algorithm cannot yield an asymptotically unbiased estimation due to the effect of the coupling term, but the estimation with the time-varying algorithm is closer to the Cramer-Rao lower bound （CRLB） than that with the time-invariant estimation method, especially at high signal-to-noise ratios （SNRs）.

Some Chaotic Properties of a Kind of Coupled Map Lattices

This paper is concerned with some chaotic properties of a kind of coupled map lattices, which is proposed by Kaneko. First, this research discussed the sensitivity, infinite sensitivity, transitivity, accessibility, densely Li-Yorke sensitivity and exact of coupled map lattices. Then, some sufficient conditions under which <img src="Edit_c0fc315a-d176-4c9e-9e41-5cb6bc6d679d.bmp" alt="" /> is Kato chaotic, positive entropy chaotic and Ruelle-Takens chaos are obtained.

Control Chaos of a Unidirectionally Traffic Coupled Map Lattice Model

Spatiotemporal chaos is studied by using the unidirectional traffic coupled lattice model with hyperbolic tangent local map. The coupled map lattice (CML) model can simulate the complex traffic flow phenomenon which is similar to the traditional traffic flow model. The nonlinear feedback method is used to study the control of the chaotic system of the unidirectionally traffic coupled map lattice model. The stability of spatiotemporal chaos in the coupled map lattice is realized. The results of numerical simulation show that there is a relationship between control results and control parameters when controlling spatiotemporal chaos to a uniform stable state in a certain phase space compression parameter region.

A Secure Watermarking Algorithm Based on Coupled Map Lattice

Based on the nonlinear theory, a secure watermarking algorithm using wavelet transform and coupled map lattice is presented. The chaos is sensitive to initial conditions and has a good non-relevant correlation property, but the finite precision effect limits its application in practical digital watermarking system. To overcome the undesirable short period of chaos mapping and improve the security level of watermarking, the hyper-chaotic sequence is adopted in this algorithm. The watermark is mixed with the hyper-chaotic sequence and embedded in the wavelet domain of the host image. Experimental results and analysis are given to demonstrate that the proposed watermarking algorithm is transparent, robust and secure.

A novel image block cryptosystem based on a spatiotemporal chaotic system and a chaotic neural network

In this paper, we propose a novel block cryptographic scheme based on a spatiotemporal chaotic system and a chaotic neural network （CNN）. The employed CNN comprises a 4-neuron layer called a chaotic neuron layer （CNL）, where the spatiotemporal chaotic system participates in generating its weight matrix and other parameters. The spatiotemporal chaotic system used in our scheme is the typical coupled map lattice （CML）, which can be easily implemented in parallel by hard- ware. A 160-bit-long binary sequence is used to generate the initial conditions of the CML. The decryption process is symmetric relative to the encryption process. Theoretical analysis and experimental results prove that the block cryptosys- tem is secure and practical, and suitable for image encryption.

An image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree

This paper proposes an image encryption algorithm based on spatiotemporal chaos and middle order traversal of a binary tree.Firstly,other programming software is used to perform the middle order traversal,and the plaintext image is sorted according to the middle order traversal sequence on the permutation.Secondly,the chaotic sequence is generated using the coupled map lattice to set the chaotic interference value.Finally,the XOR operation between the adjacent pixel values of the replacement image is completed to generate the ciphertext matrix.The simulation and experimental results show that the proposed algorithm can resist typical attacks and has good robustness.

Evaluating the dynamical coupling between spatiotemporally chaotic signals via an information theory approach

An information-theoretic measure is introduced for evaluating the dynamical coupling of spatiotemporally chaotic signals produced by extended systems. The measure of the one-way coupled map lattices and the one-dimensional, homogeneous, diffusively coupled map lattices is computed with the symbolic analysis method. The numerical results show that the information measure is applicable to determining the dynamical coupling between two directly coupled or indirectly coupled chaotic signals.