We investigate collective motion in high dimensional chaos, where all elements in a population behaves chaotically and incoherently in appearance. Numerical experiments for globally coupled tent maps show the existence of a quasi-periodic collective motion even under slight interaction. It is found that the amplitude of the collective motion F is scaled as, KF ∝ exp(−K−1), by the coupling stren...

UAV route planning is the key issue for application of in real-world scenarios. Compared with traditional methods, although intelligent optimization algorithm has stronger applicability and performance, it also problem poor convergence accuracy easy to fall into local optimization. Therefore, an method based on chaotic random opposition-based learning cauchy mutation improved Moth-flame (OLTC-M...

Chaotic scattering in open Hamiltonian systems is relevant for different problems in physics. Particles in such kind of systems can exhibit both bounded or unbounded motions for which escapes from the scattering region can take place. This paper analyzes how to control the escape of the particles from the scattering region in the presence of noise. For that purpose, we apply the partial control...

We test a Markov chain approximation to the segment description (Li, 2007) of chaos (and turbulence) on a tent map, the Minea system, the Hénon map, and the Lorenz system. For the tent map, we compute the probability transition matrix of the Markov chain on the segments for segment time length (iterations) T = 1, 2, 3, 100. The matrix has 1, 2, 4 tents corresponding to T = 1, 2, 3; and is almos...

We study a simple, nonautonomous, three-dimensional, incompressible flow corresponding to sequentially active two-dimensional rolls with distinct axes. A feature of the model is that an analytical map is obtained. We show that when the roll axes are orthogonal, motion is confined to two-dimensional topological spheres. The dynamics on each surface ranges from nearly regular to largely chaotic. ...

Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two...

In Japan, cramming of too much knowledge into students was criticized and more relaxed education policy has been introduced to develop the individuality of each student. If students can afford to study carefully, creativity of the individual is fostered. We consider that it is very important to pay attention to “Affordable” concept in the field of engineering. In our previous research, we have ...

We study binary state contagion dynamics on a social network where nodes act in response to the average state of their neighborhood. We model the competing tendencies of imitation and nonconformity by incorporating an off-threshold into standard threshold models of behavior. In this way, we attempt to capture important aspects of fashions and general societal trends. Allowing varying amounts of...

We study binary state dynamics on a social network, where nodes act according to individual response functions of the average state of their neighborhood. These response functions model the competing tendencies of imitation and non-conformity by incorporating an “off-threshold” into standard threshold models of behavior. In this way, we attempt to capture important aspects of fashions and gener...

This paper studies the security of a recently proposed chaos-based cryptosystem. It is shown that the encryption architecture of this cryptosystem possesses some important problems related to its implementation and its robustness against noise. Some security problems are also highlighted.