Mean Dimension for Non-autonomous Iterated Function Systems

In this paper we introduce the notions of mean dimension and metric mean dimension for non-autonomous iterated function systems(NAIFSs for short)on countably infinite alphabets which can be regarded as generalizations of the mean dimension and the Lindenstrauss metric mean dimension for non-autonomous iterated function systems.We also show the relationship between the mean topological dimension and the metric mean dimension.

Finite-time stabilization of uncertain non-autonomous chaoticgyroscopes with nonlinear inputs

Gyroscopes are one of the most interesting and everlasting nonlinear nonautonomous dynamical systems that exhibit very complex dynamical behavior such as chaos. In this paper, the problem of robust stabilization of the nonlinear non-autonomous gyroscopes in a given finite time is studied. It is assumed that the gyroscope system is perturbed by model uncertainties, external disturbances, and unknown parameters. Besides, the effects of input nonlinearities are taken into account. Appropriate adaptive laws are proposed to tackle the unknown parameters. Based on the adaptive laws and the finite-time control theory, discontinuous finite-time control laws are proposed to ensure the finite-time stability of the system. The finite-time stability and convergence of the closed-loop system are analytically proved. Some numerical simulations are presented to show the efficiency of the proposed finite-time control scheme and to validate the theoretical results.

Existence of Solutions for a Non-Autonomous Evolution Equations with Nonlocal Conditions

The existence of mild solutions for non-autonomous evolution equations with nonlocal conditions in Banach space is studied in this article. We obtained the existence of at least one mild solution to the evolution equations by using Krasnoselskii’s fixed point theorem as well as the theory of the evolution family. The interest of this paper is that any assumptions are not imposed on the nonlocal terms and Green’s functions and a new alternative method is applied to prove the existence of mild solutions. The results obtained in this paper may improve some related conclusions on this topic. An example is given as an application of the results.

Design of an adaptive finite-time controller for synchronization of two identical/different non-autonomous chaotic flywheel governor systems

The centrifugal flywheel governor （CFG） is a mechanical device that automatically controls the speed of an engine and avoids the damage caused by sudden change of load torque. It has been shown that this system exhibits very rich and complex dynamics such as chaos. This paper investigates the problem of robust finite-time synchronization of non-autonomous chaotic CFGs. The effects of unknown parameters, model uncertainties and external disturbances are fully taken into account. First, it is assumed that the parameters of both master and slave CFGs have the same value and a suitable adaptive finite-time controller is designed. Second, two CFGs are synchronized with the parameters of different values via a robust adaptive finite-time control approach. Finally, some numerical simulations are used to demonstrate the effectiveness and robustness of the proposed finite-time controllers.

Chaotic CS Encryption:An Efficient Image Encryption Algorithm Based on Chebyshev Chaotic System and Compressive Sensing

Images are the most important carrier of human information. Moreover, how to safely transmit digital imagesthrough public channels has become an urgent problem. In this paper, we propose a novel image encryptionalgorithm, called chaotic compressive sensing (CS) encryption (CCSE), which can not only improve the efficiencyof image transmission but also introduce the high security of the chaotic system. Specifically, the proposed CCSEcan fully leverage the advantages of the Chebyshev chaotic system and CS, enabling it to withstand various attacks,such as differential attacks, and exhibit robustness. First, we use a sparse trans-form to sparse the plaintext imageand then use theArnold transformto perturb the image pixels. After that,we elaborate aChebyshev Toeplitz chaoticsensing matrix for CCSE. By using this Toeplitz matrix, the perturbed image is compressed and sampled to reducethe transmission bandwidth and the amount of data. Finally, a bilateral diffusion operator and a chaotic encryptionoperator are used to perturb and expand the image pixels to change the pixel position and value of the compressedimage, and ultimately obtain an encrypted image. Experimental results show that our method can be resistant tovarious attacks, such as the statistical attack and noise attack, and can outperform its current competitors.

Double quantum images encryption scheme based on chaotic system

This paper explores a double quantum images representation(DNEQR)model that allows for simultaneous storage of two digital images in a quantum superposition state.Additionally,a new type of two-dimensional hyperchaotic system based on sine and logistic maps is investigated,offering a wider parameter space and better chaotic behavior compared to the sine and logistic maps.Based on the DNEQR model and the hyperchaotic system,a double quantum images encryption algorithm is proposed.Firstly,two classical plaintext images are transformed into quantum states using the DNEQR model.Then,the proposed hyperchaotic system is employed to iteratively generate pseudo-random sequences.These chaotic sequences are utilized to perform pixel value and position operations on the quantum image,resulting in changes to both pixel values and positions.Finally,the ciphertext image can be obtained by qubit-level diffusion using two XOR operations between the position-permutated image and the pseudo-random sequences.The corresponding quantum circuits are also given.Experimental results demonstrate that the proposed scheme ensures the security of the images during transmission,improves the encryption efficiency,and enhances anti-interference and anti-attack capabilities.

Chaotic ferroresonance in a non-autonomous circuit

description of magnetization curve has important effect on ferroresonance. In most of earlier ferroresonance studies the magnetization curve is modelled as a 3rd or 5th order polynomial. However, it is not comprehensive. This paper investigates the chaotic ferroresonance behaviour exhibited by a non-autonomous circuit which contains a nonlinear flux-controlled inductance. The ferromagnetic characteristic of this nonlinear inductance represented by a magnetization curve could be expressed as an nth order two-term polynomial. By varying the value of exponent n, the circuit can assume a diverse range of steady-state regimes including fundamental and subharmonic ferroresonance, quasi-periodic oscillations, and chaos. A detailed analysis of some simulations demonstrates that the probability of chaos increases as the exponent of the magnetization curve rises. The effect of varying the magnitude of the source voltage on the chaotic behaviour of the circuit is also studied.

Chaotic Map-Based Authentication and Key Agreement Protocol with Low-Latency for Metasystem

With the rapid advancement in exploring perceptual interactions and digital twins,metaverse technology has emerged to transcend the constraints of space-time and reality,facilitating remote AI-based collaboration.In this dynamic metasystem environment,frequent information exchanges necessitate robust security measures,with Authentication and Key Agreement(AKA)serving as the primary line of defense to ensure communication security.However,traditional AKA protocols fall short in meeting the low-latency requirements essential for synchronous interactions within the metaverse.To address this challenge and enable nearly latency-free interactions,a novel low-latency AKA protocol based on chaotic maps is proposed.This protocol not only ensures mutual authentication of entities within the metasystem but also generates secure session keys.The security of these session keys is rigorously validated through formal proofs,formal verification,and informal proofs.When confronted with the Dolev-Yao(DY)threat model,the session keys are formally demonstrated to be secure under the Real-or-Random(ROR)model.The proposed protocol is further validated through simulations conducted using VMware workstation compiled in HLPSL language and C language.The simulation results affirm the protocol’s effectiveness in resisting well-known attacks while achieving the desired low latency for optimal metaverse interactions.

CNN-LSTM based incremental attention mechanism enabled phase-space reconstruction for chaotic time series prediction

To improve the prediction accuracy of chaotic time series and reconstruct a more reasonable phase space structure of the prediction network,we propose a convolutional neural network-long short-term memory(CNN-LSTM)prediction model based on the incremental attention mechanism.Firstly,a traversal search is conducted through the traversal layer for finite parameters in the phase space.Then,an incremental attention layer is utilized for parameter judgment based on the dimension weight criteria(DWC).The phase space parameters that best meet DWC are selected and fed into the input layer.Finally,the constructed CNN-LSTM network extracts spatio-temporal features and provides the final prediction results.The model is verified using Logistic,Lorenz,and sunspot chaotic time series,and the performance is compared from the two dimensions of prediction accuracy and network phase space structure.Additionally,the CNN-LSTM network based on incremental attention is compared with long short-term memory(LSTM),convolutional neural network(CNN),recurrent neural network(RNN),and support vector regression(SVR)for prediction accuracy.The experiment results indicate that the proposed composite network model possesses enhanced capability in extracting temporal features and achieves higher prediction accuracy.Also,the algorithm to estimate the phase space parameter is compared with the traditional CAO,false nearest neighbor,and C-C,three typical methods for determining the chaotic phase space parameters.The experiments reveal that the phase space parameter estimation algorithm based on the incremental attention mechanism is superior in prediction accuracy compared with the traditional phase space reconstruction method in five networks,including CNN-LSTM,LSTM,CNN,RNN,and SVR.

Theoretical and experimental investigation of the resonance responses and chaotic dynamics of a bistable laminated composite shell in the dynamic snap-through mode

The dynamic model of a bistable laminated composite shell simply supported by four corners is further developed to investigate the resonance responses and chaotic behaviors.The existence of the 1:1 resonance relationship between two order vibration modes of the system is verified.The resonance response of this class of bistable structures in the dynamic snap-through mode is investigated,and the four-dimensional(4D)nonlinear modulation equations are derived based on the 1:1 internal resonance relationship by means of the multiple scales method.The Hopf bifurcation and instability interval of the amplitude frequency and force amplitude curves are analyzed.The discussion focuses on investigating the effects of key parameters,e.g.,excitation amplitude,damping coefficient,and detuning parameters,on the resonance responses.The numerical simulations show that the foundation excitation and the degree of coupling between the vibration modes exert a substantial effect on the chaotic dynamics of the system.Furthermore,the significant motions under particular excitation conditions are visualized by bifurcation diagrams,time histories,phase portraits,three-dimensional(3D)phase portraits,and Poincare maps.Finally,the vibration experiment is carried out to study the amplitude frequency responses and bifurcation characteristics for the bistable laminated composite shell,yielding results that are qualitatively consistent with the theoretical results.

A color image encryption scheme based on a 2D coupled chaotic system and diagonal scrambling algorithm

A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.

An Improved Artificial Rabbits Optimization Algorithm with Chaotic Local Search and Opposition-Based Learning for Engineering Problems and Its Applications in Breast Cancer Problem

Artificial rabbits optimization(ARO)is a recently proposed biology-based optimization algorithm inspired by the detour foraging and random hiding behavior of rabbits in nature.However,for solving optimization problems,the ARO algorithm shows slow convergence speed and can fall into local minima.To overcome these drawbacks,this paper proposes chaotic opposition-based learning ARO(COARO),an improved version of the ARO algorithm that incorporates opposition-based learning(OBL)and chaotic local search(CLS)techniques.By adding OBL to ARO,the convergence speed of the algorithm increases and it explores the search space better.Chaotic maps in CLS provide rapid convergence by scanning the search space efficiently,since their ergodicity and non-repetitive properties.The proposed COARO algorithm has been tested using thirty-three distinct benchmark functions.The outcomes have been compared with the most recent optimization algorithms.Additionally,the COARO algorithm’s problem-solving capabilities have been evaluated using six different engineering design problems and compared with various other algorithms.This study also introduces a binary variant of the continuous COARO algorithm,named BCOARO.The performance of BCOARO was evaluated on the breast cancer dataset.The effectiveness of BCOARO has been compared with different feature selection algorithms.The proposed BCOARO outperforms alternative algorithms,according to the findings obtained for real applications in terms of accuracy performance,and fitness value.Extensive experiments show that the COARO and BCOARO algorithms achieve promising results compared to other metaheuristic algorithms.

A chaotic hierarchical encryption/watermark embedding scheme for multi-medical images based on row-column confusion and closed-loop bi-directional diffusion

Security during remote transmission has been an important concern for researchers in recent years.In this paper,a hierarchical encryption multi-image encryption scheme for people with different security levels is designed,and a multiimage encryption(MIE)algorithm with row and column confusion and closed-loop bi-directional diffusion is adopted in the paper.While ensuring secure communication of medical image information,people with different security levels have different levels of decryption keys,and differentiated visual effects can be obtained by using the strong sensitivity of chaotic keys.The highest security level can obtain decrypted images without watermarks,and at the same time,patient information and copyright attribution can be verified by obtaining watermark images.The experimental results show that the scheme is sufficiently secure as an MIE scheme with visualized differences and the encryption and decryption efficiency is significantly improved compared to other works.

Intrusion Detection Model Using Chaotic MAP for Network Coding Enabled Mobile Small Cells

Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions,vulnerabilities,and assaults.Complex security systems,such as Intrusion Detection Systems(IDS),are essential due to the limitations of simpler security measures,such as cryptography and firewalls.Due to their compact nature and low energy reserves,wireless networks present a significant challenge for security procedures.The features of small cells can cause threats to the network.Network Coding(NC)enabled small cells are vulnerable to various types of attacks.Avoiding attacks and performing secure“peer”to“peer”data transmission is a challenging task in small cells.Due to the low power and memory requirements of the proposed model,it is well suited to use with constrained small cells.An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code(HHMAC)hash between transmissions since the HMAC function is generated using the shared secret.In this research,a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure“peer”to“peer”data transmission model using lightweight H-MAC(1D-LM-P2P-LHHMAC)is proposed with accurate intrusion detection.The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels,Key Pair Generation Time Levels,Chaotic Map Accuracy Levels,Intrusion Detection Accuracy Levels,and the results represent that the proposed model performance in chaotic map accuracy level is 98%and intrusion detection is 98.2%.The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high.

Distributional Chaoticity of the Minimal Subshift of Shift Operators

This paper focus on the chaotic properties of minimal subshift of shift operators. It is proved that the minimal subshift of shift operators is uniformly distributional chaotic, distributional chaotic in a sequence, distributional chaotic of type k ( k∈{ 1,2,2 1 2 ,3 } ), and ( 0,1 ) -distribution.

Adaptive coupled synchronization of non-autonomous systems in ring networks

The adaptive coupled synchronization method for non-autonomous systems is proposed. This method can avoid estimating the value of coupling coefficient. Under the uniform Lipschitz assumption, we derive the asymptotical synchronization for a general coupling ring network with N identical non-autonomous systems~ even when N is large enough. Strict theoretical proofs are given. Numerical simulations illustrate the effectiveness of the present method.

Uniform attractors for non-autonomous Klein-Gordon-Schrdinger lattice systems

The existence of a compact uniform attractor for a family of processes corre- sponding to the dissipative non-autonomous Klein-Gordon-SchrSdinger lattice dynamical system is proved. An upper bound of the Kolmogorov entropy of the compact uniform attractor is obtained, and an upper semicontinuity of the compact uniform attractor is established.

Non-autonomous discrete Boussinesq equation:Solutions and consistency

A non-autonomous 3-component discrete Boussinesq equation is discussed. Its spacing parameters Pn and qm are related to independent variables n and m, respectively. We derive bilinear form and solutions in Casoratian form. The plain wave factor is defined through the cubic roots of unity. The plain wave factor also leads to extended non-autonomous discrete Boussinesq equation which contains a parameter δ. Tree-dimendional consistency and Lax pair of the obtained equation are discussed.

Some results on entropy dimension for non-autonomous systems

In this paper,the preimage branch t-entropy and entropy dimension for nonautonomous systems are studied and some systems with preimage branch t-entropy zero are introduced.Moreover,formulas calculating the s-topological entropy of a sequence of equi-continuous monotone maps on the unit circle are given.Finally,examples to show that the entropy dimension of non-autonomous systems can be attained by any positive number s are constructed.

A fast computing method to distinguish the hyperbolic trajectory of an non-autonomous system

Attempting to find a fast computing method to DHT （distinguished hyperbolic trajectory）, this study first proves that the errors of the stable DHT can be ignored in normal direction when they are computed as the trajectories extend. This conclusion means that the stable flow with perturbation will approach to the real trajectory as it extends over time. Based on this theory and combined with the improved DHT computing method, this paper reports a new fast computing method to DHT, which magnifies the DHT computing speed without decreasing its accuracy.