Search

This paper introduces a methodology for computing expected values associated with compression networks resulting from the application of compression algorithms to independent and identically distributed random time series. Our analysis establishes a robust correspondence between the calculated expected values and empirically derived results obtained from constructing networks using nondeterministic time series. Notably, the ratio of the average indegree of a network to the computed expected indegree for stochastic time series serves as a versatile metric. It enables the assessment of inherent randomness in time series and facilitates the distinction between nondeterministic and chaotic systems. The metric demonstrates high sensitivity to nondeterminism in both synthetic and real-world datasets, highlighting its capacity to detect subtle disturbances and high-frequency noise, even in series characterized by a deficient sample rate. Our results extend and confirm previous findings in the field. [ABSTRACT FROM AUTHOR]

To improve the security level of image encryption based on chaos theory, a novel bit-level transform method which could enhance the dynamical performance of chaotic maps is proposed and a new image encryption algorithm based on a random irregular blocking method is also designed in this paper. Firstly, in the bit-level transform method, three chaotic maps are combined to generate a novel chaotic sequence. From a series of performance analyses results, the generated sequence not only successfully passes NIST tests, but also performs better than the original sequence, with a larger chaotic parametrial range, high complexity, etc. Then, an image encryption algorithm based on the newly generated chaotic sequence is proposed, in which a random irregular blocking method is adopted. Random irregular blocking could solve the problem of insecurity in the fixed blocking method. With a color Lena image as an encryption example, we analyze the security of the encryption algorithm by conducting a sufficiently large number of experiments using the encrypted image. For the encrypted Lena image, the average values of information entropy, NPCR, and UACI are 7.9931, 0.9961, and 0.3352, respectively. The experimental results and security analyses results provide evidence that the proposed encryption algorithm has good performance and can resist various typical attacks. [ABSTRACT FROM AUTHOR]

Chaotic maps have been widely used in image encryption due to their complexity, pseudorandomness and high sensitivity to initial values. In this paper, an image encryption algorithm based on a 4D chaotic map and steganography is proposed. The algorithm consists of two rounds of encryption and one operation of embedding hash. In the first round of encryption, the hash value of plaintext image is used to control the generation of chaotic sequences, which makes the encryption algorithm highly relevant to the content of the image. Then, the hash value is embedded into the intermediate image according to the idea of steganography. In the second round of encryption, the image is encrypted under the control of another set of chaotic sequences to hide the hash value and further enhance the security of the algorithm. Different from other algorithms, our algorithm does not need to additionally transmit the hash value to the decryptor through a special channel. It has good availability and adaptability. Experimental results and security analysis demonstrate that the algorithm has high security performance and can resist various attacks. [ABSTRACT FROM AUTHOR]

In this paper, we carefully reexamine the chaotic RF model, first studied by Rabinovich and Fabrikant [1979], and have found many new and rich complex dynamics of the model that were mostly not reported before. The chaotic RF model has proved to be a great challenge to classical numerical methods, in the sense that most classical numerical methods have not been very successful in the study of complex dynamics of this special RF model. Therefore, in this paper, we present and apply a special numerical method, the Local Iterative Linearization (LIL) method, along with a special Turbo Pascal code based on this accurate LIL algorithm, for a careful numerical study of this complex RF model. Many interesting new findings are summarized and reported in this paper. [ABSTRACT FROM AUTHOR]

The paper discusses the fractional Rössler system and the dependence of its dynamics on some entry parameters. An explicit algorithm for a priori determination of fractional Hopf bifurcations is derived and scenarios documenting a route of the system from stability to chaos are performed with respect to a varying system’s fractional order as well as to a varying system’s coefficient. Contrary to the existing results, the searched values of the fractional Hopf bifurcations follow directly from a revealed analytical dependence between these two systems’ entries. Their various critical values are established and confirmed by numerical experiments demonstrating not only the loss of stability of an equilibrium point, but also other phenomena of transition to chaotic behavior. In addition, we suggest an active control method for synchronization of two chaotic fractional-order Rössler systems. Our theoretical analysis enables to synchronize them for any value of a free parameter under which the master system displays a chaotic behavior. [ABSTRACT FROM AUTHOR]

In this paper, we propose an image encryption algorithm based on random walk and two hyperchaotic systems. The random walk method is adopted to scramble the position of pixels within a block. Furthermore, the permutation operation between blocks is presented to enhance the scramble effect. Thus, high correlation among pixels of original image is broken by permutation. Moreover, the chosen plaintext attack is used to test the anti-attack ability of the proposed algorithm. By analyzing experimental results and comparing with other image encryption algorithms, we show that the proposed algorithm has better performance and higher security. [ABSTRACT FROM AUTHOR]

Database Tomography (DT) is a textual database analysis system consisting of two major components: (1) algorithms for extracting multiword phrase frequencies and phrase proximities (physical closeness of the multiword technical phrases) from any type of large textual database, to augment (2) interpretative capabilities of the expert human analyst. DT was used to derive technical intelligence from a Nonlinear Dynamics database derived from the Science Citation Index/Social Science Citation Index (SCI). Phrase frequency analysis by the technical domain experts provided the pervasive technical themes of the Nonlinear Dynamics database, and the phrase proximity analysis provided the relationships among the pervasive technical themes. Bibliometric analysis of the Nonlinear Dynamics literature supplemented the DT results with author/journal/institution publication and citation data. [ABSTRACT FROM AUTHOR]

At present, the performance of the digital chaotic sequence generator is affected by the calculation precision of processor and quantization method, which leads to the quantized chaotic binary sequences emerging from some periodic phenomena in the local range of sequences. However, in view of the current methods for analyzing the periodicity and randomness of binary sequences, evaluating the periodic characteristics which exist in the local range of chaotic binary sequences is extremely difficult. Therefore, in this paper, we have proposed a novel algorithm called the GBSPD (General Binary Sequences Periodic Detection) algorithm, which can detect typical periodic phenomena and local periodic phenomena in the chaotic binary sequence. Moreover, it can accurately locate the position of periodic phenomena of binary sequences and perform a detailed statistical analysis. Furthermore, by using the GBSPD algorithm to detect the periodic characteristics of the quantified logistic chaotic binary sequences, the experimental results show that the algorithm can effectively locate multiple periodic phenomena in the binary sequences. [ABSTRACT FROM AUTHOR]

This paper compares the performance of Differential Evolution (DE) with Self-Organizing Migrating Algorithm (SOMA) in the task of optimization of the control of chaos. The main aim of this paper is to show that evolutionary algorithms like DE are capable of optimizing chaos control, leading to satisfactory results, and to show that extreme sensitivity of the chaotic environment influences the quality of results on the selected EA, construction of cost function (CF) and any small change in the CF design. As a model of deterministic chaotic system, the two-dimensional Henon map is used and two complex targeting cost functions are tested. The evolutionary algorithms, DE and SOMA were applied with different strategies. For each strategy, repeated simulations demonstrate the robustness of the used method and constructed CF. Finally, the obtained results are compared with previous research. [ABSTRACT FROM AUTHOR]

This paper introduces a new application of the Field Programmable Analog Array. Ease of design and reprogrammability are the advantages offered by this class of analog circuits, making them an ideal environment for the implementation of chaotic circuits and their experimental characterization. Chua's circuit, a well-known paradigm of nonlinear circuits, has been used as an example of application. Experimental results show the suitability of the approach, highlighting the features of the new implementation: a fully on the fly programmable Chua's circuit has been obtained. [ABSTRACT FROM AUTHOR]

In this paper, the effect of the parameter switching (PS) algorithm in a fractional order chaotic circuit is investigated both in simulation and experiment. The Chen system of fractional order is focused and realized in an electronic circuit. By designing a switching circuit, the PS algorithm is implemented and it is the first time, the paradoxical 'Chaos Chaos Order' is presented in an electronic circuit. Both the simulation and experimental results confirm that the obtained attractor under switching approximates the attractor of the time-averaged model. Some important design issues for the circuitry realization of the PS scheme are pointed out. Finally, our work confirms the practical usage of PS algorithm in potential applications such as attractor synthesis and chaos control. [ABSTRACT FROM AUTHOR]

This paper re-evaluates the security of a chaotic image encryption algorithm called MCKBA/ HCKBA and finds that it can be broken efficiently with two known plain-images and the corresponding cipher-images. In addition, it is reported that a previously proposed breaking on MCKBA/HCKBA can be further improved by reducing the number of chosen plain-images from four to two. The two attacks are both based on the properties of solving a composite function involving the carry bit, which is composed of the modulo addition and the bitwise OR operations. Both rigorous theoretical analysis and detailed experimental results are provided. [ABSTRACT FROM AUTHOR]

This paper studies the bifurcation and chaos phenomena in average queue length in a developed Transmission Control Protocol (TCP) model with Random Early Detection (RED) mechanism. Bifurcation and chaos phenomena are nonlinear behavior in network systems that lead to degradation of the network performance. The TCP/RED model used is a model validated previously. In our study, only the average queue size $\bar{q}_k$ is considered, and the results are based on analytical model rather than actual measurements. The instabilities in the model are studied numerically using the conventional nonlinear bifurcation analysis. Extending from this bifurcation analysis, a modified RED algorithm is derived to prevent the observed bifurcation and chaos regardless of the selected parameters. Our modification is for the simple scenario of a single RED router carrying only TCP traffic. The algorithm neither compromises the throughput nor the average queuing delay of the system. [ABSTRACT FROM AUTHOR]

This paper introduces the notion of chaos synthesis by means of evolutionary algorithms and develops a new method for chaotic systems synthesis. This method is similar to genetic programming and grammatical evolution and is being applied along with three evolutionary algorithms: differential evolution, self-organizing migration and genetic algorithm. The aim of this investigation is to synthesize new and "simple" chaotic systems based on some elements contained in a prechosen existing chaotic system and a properly defined cost function. The investigation consists of eleven case studies: the aforementioned three evolutionary algorithms in eleven versions. For all algorithms, 100 simulations of chaos synthesis were repeated and then averaged to guarantee the reliability and robustness of the proposed method. The most significant results were carefully selected, visualized and commented in this report. [ABSTRACT FROM AUTHOR]

A comparison between polynomial and wavelet expansions for the identification of coupled map lattice (CML) models for deterministic spatiotemporal dynamical systems is presented in this paper. The pattern dynamics generated by smooth and nonsmooth nonlinear maps in a well-known two-dimensional CML structure are analyzed. By using an orthogonal feedforward regression algorithm (OFR), polynomial and wavelet models are identified for the CML's in chaotic regimes. The quantitative dynamical invariants such as the largest Lyapunov exponents and correlation dimensions are estimated and used to evaluate the performance of the identified models. [ABSTRACT FROM AUTHOR]

Symmetric block encryption schemes, designed on invertible two-dimensional chaotic maps on a torus or a square, prove feasible and secure for real-time image encryption according to the commonly used criteria given in the literature. In this paper, a typical map of this kind, namely, the baker map, is further extended to be three-dimensional and then used to speed up image encryption while retaining its high degree of security. The proposed algorithm is described in detail, along with its security analysis and implementation. Experimental results show that this three-dimensional baker map is 2–3 times faster than the two-dimensional one, showing its great potential in real-time image encryption applications. [ABSTRACT FROM AUTHOR]

A new 4D chaotic system with infinitely many equilibria is proposed using a linear state feedback controller in the Sprott C system. Although the new 4D chaotic system has only two nonlinear terms, it has rich dynamic characteristics, such as hidden attractors and coexisting attractors. Besides, the freedom of offset boosting of a variable is achieved by adjusting a controlled constant. The dynamic characteristics of the new chaotic system are fully analyzed from the aspects of phase portraits, bifurcation diagrams, Lyapunov exponents and Poincaré maps. The corresponding analogue electronic circuit is designed and implemented to verify the new 4D chaotic system. By taking advantage of the complex dynamic properties of the new chaotic system, a random number generator algorithm is proposed. [ABSTRACT FROM AUTHOR]

Strong evidence is provided for significant far from equilibrium complex processes in the seismogenic layer of the North Aegean region (Greece), after applying modern nonlinear methods to various seismicity time series. The data used are subsets of the regional catalogue compiled in the central Seismological Station of Geophysics Department, Aristotle University of Thessaloniki and concern 4367 earthquakes of magnitude greater than 3.8, which took place during the period of 1968-2008. We present results, derived from the application of nonlinear algorithms, concerning the estimation of correlation dimension, mutual information, largest Lyapunov exponent, flatness coefficient and q-value which correspond to Tsallis nonextensive statistics. These quantities are estimated for two seismic time series corresponding to the basic focal parameters of earthquakes, namely origin time and magnitude. The obtained results can be associated with novel far from equilibrium complex dynamics such as low dimensional chaos, Self Organized Criticality (SOC) and intermittent turbulence. Furthermore, in this study, new information is provided about the nonlinear turbulent character of the Hellenic lithospheric dynamics related to the Tsallis nonextensive statistical theory. Our analysis indicates the coexistence of two different lithospheric processes, one low dimensional (chaotic) and the other high dimensional (SOC), revealing the strongly turbulent character of the Greek lithospheric system. In particular, the low dimensional chaotic process corresponds to the temporal manifestation of earthquakes, whereas the high dimensional nonlinear (SOC) process corresponds to the burst energy releases, a result that has significant implications concerning the ability of earthquake prediction. [ABSTRACT FROM AUTHOR]

The nonlinear dynamic behavior of a rigid disc-rotor supported by active magnetic bearings (AMB) is investigated, without gyroscopic effects. The vibration of the rotor is modeled by a coupled second order nonlinear ordinary differential equations with quadratic and cubic nonlinearities. Their approximate solutions are sought applying the method of multiple scales in the case of primary resonance. The Newton-Raphson method and the pseudo-arclength path-following algorithm are used to obtain the frequency response curves. Choosing the Hopf bifurcations as the initial points and applying the shooting method and the pseudo-arclength path-following algorithm, the periodic solution branches are obtained. At the same time, the Floquet theory is used to determine the stability of the periodic solutions. A detailed bifurcation analysis of the dynamic (periodic and chaotic) solutions of the averaged equations is presented. The three types of primary Hopf bifurcations are found for the first time in the rotor-AMB system. It is shown that the limit cycles undergo cyclic fold, period doubling bifurcations, and intermittent chaotic attractor, whereas the chaotic attractors undergo explosive bifurcation and boundary crises. In the regime of multiple coexisting solutions, multiple stable equilibriums, periodic solutions and chaotic solutions are the most interesting phenomena observed. [ABSTRACT FROM AUTHOR]

Unstable invariant sets are important to understand mechanisms behind many dynamically important phenomenon such as chaotic transients which can be physically relevant in experiments. However, unstable invariant sets are nontrivial to find computationally. Previous techniques such as the PIM triple method [Nusse & Yorke, 1989] and simplex method variant [Moresco & Dawson, 1999], and even the step-and-stagger method [Sweet et al., 2001] have computationally inherent dimension limitations. In the current study, we explicitly investigate the landscape of an invariant set, which leads us to a simple gradient search algorithm to construct points close to the invariant set. While the calculation of the necessary derivatives can be computationally very expensive, the methods of our algorithm are not as dimension dependant as the previous techniques, as we show by examples such as the two-dimensional instability example from [Sweet et al., 2001] followed by a four-dimensional instability example, and then a nine-dimensional flow from the Yoshida equations, with a two-dimensional instability. [ABSTRACT FROM AUTHOR]

This Letter improves the Chen–Lai chaotification algorithm for discrete-time systems from multiple-input to single-input state feedback, while preserving its mathematical rigor. [ABSTRACT FROM AUTHOR]

We suggest a link between coding theory (iterative algorithms) and chaos theory. A whole range of phenomena known to occur in nonlinear systems, like the existence of multiple fixed points, oscillatory behavior, bifurcations, chaos and transient chaos are found in turbo-decoding algorithms. We develop a simple technique to control transient chaos in turbo-decoding algorithms and improve the performance of the classical turbo codes. [ABSTRACT FROM AUTHOR]

A secure transmission application of the State Controlled Cellular Neural Network (SC–CNN)-based circuit is presented. Since the SC–CNN-based circuit has feedback connections between the cells, it is potentially very suitable for realizing a chaotic masking system with feedback algorithm. So, we have constructed a chaotic masking system with feedback using the SC–CNN-based circuit. PSpice simulation experiments verify that the proposed SC–CNN-based secure communication system exhibits a good performance for a wide range of amplitude and spectral characteristics of the information signal. [ABSTRACT FROM AUTHOR]