ﻻ يوجد ملخص باللغة العربية
We present here a new approach of the partial control method, which is a useful control technique applied to transient chaotic dynamics affected by a bounded noise. Usually we want to avoid the escape of these chaotic transients outside a certain region $Q$ of the phase space. For that purpose, there exists a control bound such that for controls smaller than this bound trajectories are kept in a special subset of $Q$ called the safe set. The aim of this new approach is to go further, and to compute for every point of $Q$ the minimal control bound that would keep it in $Q$. This defines a special function that we call the safety function, which can provide the necessary information to compute the safe set once we choose a particular value of the control bound. This offers a generalized method where previous known cases are included, and its use encompasses more diverse scenarios.
We show that the synchronized states of two systems of identical chaotic maps subject to either, a common drive that acts with a probability p in time or to the same drive acting on a fraction p of the maps, are similar. The synchronization behavior
We introduce a new paradigm of 2D (electromagnetic) ray-chaos, featuring both guided and scattered rays in a dielectric layer with exponentially tapered refraction index backed by an undulated conductive surface, and illustrate its relevant features.
We explain in detail the definition, construction and generalisation of the Galois group of Chebyshev polynomials of high degree to the Galois group of chaotic chains. The calculations in this paper are performed for Chebyshev polynomials and chaotic
Two deterministic models for Brownian motion are investigated by means of numerical simulations and kinetic theory arguments. The first model consists of a heavy hard disk immersed in a rarefied gas of smaller and lighter hard disks acting as a therm
This paper analyzes the security of a recent cryptosystem based on the ergodicity property of chaotic maps. It is shown how to obtain the secret key using a chosen-ciphertext attack. Some other design weaknesses are also shown.