A complexity measure approach based on forbidden patterns and correlation degree

Based on forbidden patterns in symbolic dynamics, symbolic subsequences are classified and relations between forbidden patterns, correlation dimensions and complexity measures are studied. A complexity measure approach is proposed in order to separate deterministic (usually chaotic) series from random ones and measure the complexities of different dynamic systems. The complexity is related to the correlation dimensions, and the algorithm is simple and suitable for time series with noise. In the paper, the complexity measure method is used to study dynamic systems of the Logistic map and the H\'enon map with multi-parameters.     

Adaptive synchronisation of fractional-order chaotic systems

A new stability theory of nonlinear dynamic systems is proposed, and a novel adaptive synchronisation method is presented for fractional-order chaotic and hyperchaotic systems based on the theory described in this paper. In comparison with previous methods, not only is the present control scheme simple but also it employs only one control strength, converges very fast, and it is also suitable for a large class of fractional-order chaotic and hyperchaotic systems. Moreover, this scheme is analytical and simple to implement in practice. Numerical and circuit simulations are used to validate and demonstrate the effectiveness of the method.     

A method of estimating initial conditions of coupled maplattices 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).     

Chaotic System Identification Based on a Fuzzy Wiener Model with Particle Swarm Optimization

A fuzzy Wiener model is proposed to identify chaotic systems. The proposed fuzzy Wiener model consists of two parts, one is a linear dynamic subsystem and the other is a static nonlinear part, which is represented by the Takagi-Sugeno fuzzy model. Identification of chaotic systems is converted to find optimal parameters of the fuzzy Wiener model by minimizing the state error between the original chaotic system and the fuzzy Wiener model. Particle swarm optimization algorithm, a global optimizer, is used to search the optimal parameter of the fuzzy Wiener model. The proposed method can identify the parameters of the linear part and nonlinear part simultaneously. Numerical simulations for Henon and Lozi chaotic system identification show the effectiveness of the proposed method.     

Parameter estimation for chaotic systems using the cuckoo search algorithm with an orthogonal learning method

We study the parameter estimation of a nonlinear chaotic system,which can be essentially formulated as a multidimensional optimization problem.In this paper,an orthogonal learning cuckoo search algorithm is used to estimate the parameters of chaotic systems.This algorithm can combine the stochastic exploration of the cuckoo search and the exploitation capability of the orthogonal learning strategy.Experiments are conducted on the Lorenz system and the Chen system.The proposed algorithm is used to estimate the parameters for these two systems.Simulation results and comparisons demonstrate that the proposed algorithm is better or at least comparable to the particle swarm optimization and the genetic algorithm when considering the quality of the solutions obtained.     

A new approach of optimal control for a class of continuous-time chaotic systems by an online ADP algorithm

We develop an online adaptive dynamic programming （ADP） based optimal control scheme for continuous-time chaotic systems. The idea is to use the ADP algorithm to obtain the optimal control input that makes the performance index function reach an optimum. The expression of the performance index function for the chaotic system is first presented. The online ADP algorithm is presented to achieve optimal control. In the ADP structure, neural networks are used to construct a critic network and an action network, which can obtain an approximate performance index function and the control input, respectively. It is proven that the critic parameter error dynamics and the closed-loop chaotic systems are uniformly ultimately bounded exponentially. Our simulation results illustrate the performance of the established optimal control method.     

Chaotifying a linear time-invariant system by the state feedback controller and sawtooth function

Another algorithm for chaotification of any given linear time-invariant discrete-time systems is presented. The new chaotification algorithm uses the decentralized control and the continuous sawtooth function, which can generate discrete chaos with an arbitrarily desired amplitude bound. Based on the Marotto theorem, we mathematically prove that the controlled system is chaotic in the sense of Li and Yorke. Finally, a simple example is used to illustrate the effectiveness of the proposed theory and method.     

Approximation-error-ADP-based optimal tracking control for chaotic systems with convergence proof

In this paper, an optimal tracking control scheme is proposed for a class of discrete-time chaotic systems using the approximation-error-based adaptive dynamic programming （ADP） algorithm. Via the system transformation, the optimal tracking problem is transformed into an optimal regulation problem, and then the novel optimal tracking control method is proposed. It is shown that for the iterative ADP algorithm with finite approximation error, the iterative performance index functions can converge to a finite neighborhood of the greatest lower bound of all performance index functions under some convergence conditions. Two examples are given to demonstrate the validity of the proposed optimal tracking control scheme for chaotic systems.     

The 0-1 test algorithm for chaos and its applications

To determine whether a given deterministic nonlinear dynamic system is chaotic or periodic,a novel test approach named zero-one (0-1) test has been proposed recently.In this approach,the regular and chaotic motions can be decided by calculating the parameter K approaching asymptotically to zero or one.In this study,we focus on the 0-1 test algorithm and illustrate the selection of parameters of this algorithm by numerical experiments.To validate the reliability and the universality of this algorithm,it is applied to typical nonlinear dynamic systems,including fractional-order dynamic system.     

Analysis and demonstration of PID algorithm based on arranging the transient process for adaptive optics

The fastness and robustness of a control algorithm are highly important in the performance of adaptive optics systems. The proportional-integral-derivative control with arranging the transient process, which is designed using a tracking differentiator, is applied into an adaptive optics system. This control algorithm greatly improves the dynamic properties of the control system. To identify the underlying reasons for these improvements, the influence of the control algorithm is theoretically discussed. The control algorithm is verified by a simple adaptive optics system for tip/tilt correction. The experimental results demonstrate that the control algorithm is fast and robust.     

基于组合混沌遗传算法的认知无线电资源分配

提出了基于组合混沌遗传算法用于认知无线电资源分配,设计了相应的组合混沌序列发生器,并分别运用组合混沌遗传算法、粒子群优化算法、模拟退火算法及简单遗传算法对认知无线电资源分配问题进行了仿真分析.结果表明,组合混沌遗传算法具有收敛速度快、搜索空间广、全局收敛等优点.相比其他三种算法,基于组合混沌遗传算法进行资源分配提高了认知无线电系统的传输速率,降低了系统的发射功率及误码率,同时加快了收敛速度. 关键词： 组合混沌 认知无线电 遗传算法 资源分配     

Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm

Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algorithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate.     

基于混沌并行遗传算法的多目标无线传感器网络跨层资源分配

提出了一种基于混沌并行遗传算法的多目标无线传感器网络跨层资源分配方法,该方法运用混沌序列和并行遗传算法来动态调整传感器网络节点的探测目标及通信时隙等参数,对资源分配方式进行跨层整体优化.在多目标无线传感器网络环境下,将本文方法与传统的随机分配方法、动态规划方法、T-MAC协议及S-MAC协议等资源分配算法进行了仿真比较.仿真结果表明,本文提出的混沌并行遗传算法具有通信时延小,目标检测成功率高等优点,在降低了无线传感器网络功率消耗的同时提高了对目标检测的实时性. 关键词： 无线传感器网络 无线资源管理 Henon映射 并行遗传算法     

Deep Q-learning based optimal resource allocation method for energy harvested cognitive radio networks

In this article, we propose a deep Q-learning based algorithm for optimal resource allocation in energy harvested cognitive radio networks (EH-CRN). In EH-CRN, channel resources of primary users (PU) networks are shared with secondary users (SU) and energy harvesting allows nodes of the CRN to acquire energy from the environment for operation sustainability. However, amount of energy harvested from the environment is not fixed and requires dynamic allocation of resources for obtaining optimum network and throughput capacity. In this work, we overcome the limitations of existing Q-learning based resource allocation schemes which are constrained by large state-space systems and have slow convergence. Proposed deep Q-learning based algorithm improves the resource allocation in EH-CRN, while considering quality of service (QoS), energy and interference constraints. Simulation results show that proposed algorithm provide improved convergence and better resource utilization compared to other techniques in literature.     

一种用于认知无线电资源分配的并行免疫遗传算法

提出了用于认知无线电自适应调制和资源分配的并行免疫遗传算法,并对该算法、简单遗传算法和静态调制分配算法进行了仿真.仿真结果显示,该算法具有很强的全局搜索能力和较快的收敛速度,在误码率和功率受限条件下,该算法比简单遗传算法和静态调制方式的性能更好,同时明显降低了计算复杂度.     

Chaotic itinerancy in coupled dynamical recognizers

We argue that chaotic itinerancy in interaction between humans originates in the fluctuation of predictions provided by the nonconvergent nature of learning dynamics. A simple simulation model called the coupled dynamical recognizer is proposed to study this phenomenon. Daily cognitive phenomena provide many examples of chaotic itinerancy, such as turn taking in conversation. It is therefore an interesting problem to bridge two chaotic itinerant phenomena. A clue to solving this is the fluctuation of prediction, which can be translated as "hot prediction" in the context of cognitive theory. Hot prediction is simply defined as a prediction based on an unstable model. If this approach is correct, the present simulation will reveal some dynamic characteristics of cognitive interactions.     

混沌量子克隆算法求解认知无线网络频谱分配问题

对认知无线网络中的频谱进行有效分配是实现动态频谱接入的关键技术.考虑3次用户对频谱的需求和分配的公平性,给出了频谱分配的数学模型,并将其转换为以最大化网络收益为目标的带约束优化问题,进而提出一种采用混沌量子克隆优化求解的认知无线网络频谱分配算法, 并证明了该算法以概率1收敛.最后,通过仿真实验比较了本文算法与颜色敏感图着色算法、基于遗传算法的频谱分配、基于量子遗传算法的频谱分配的性能.结果表明:本文算法性能较优, 能更好地实现网络收益最大化. 关键词： 混沌量子克隆算法 认知无线网络 频谱分配     

基于量子遗传算法的认知无线电决策引擎研究

提出了基于量子遗传算法的认知无线电决策引擎，设计了待优化的多目标函数，利用量子遗传算法调整优化无线电参数，运用多载波系统对算法性能进行了仿真分析.实验结果表明该方法在收敛速度、收敛精度和算法稳定性上都明显优于经典遗传算法，在种群规模较小时仍然能获得很好性能，适合于实际实现.不同权重设置模式下仿真结果表明该方法能够在多个目标函数间进行权衡，参数调整结果与当前对目标函数的偏好一致.     

认知无线网络中基于Sigmoid函数的功率控制算法研究

为了实现认知无线网络中频谱分配公平性以及契合现代化绿色通信的需求,根据非合作博弈论和干扰温度,引入信道状态概念,设计出一种新型功率控制算法,分析了该算法的收敛性、纳什均衡解的存在性和唯一性。该算法不仅可以快速收敛,符合实时通信,而且分布式实施,简单实用。仿真结果表明,相比其他算法,该算法系统干扰小,能源消耗低,具有抗干扰性能,而且在日益多用户网络的情况下,具有低功率、低干扰,提高网络的整体效益,更加符合现代化的绿色通信的需求。     

Resource allocation for LTE-based cognitive radio network with queue stability and interference constraints

We consider the problem of interference management and resource allocation in a cognitive radio network (CRNs) where the licensed spectrum holders (primary users) share their spare capacity with the non-licensed spectrum holders (secondary users). Under such shared spectrum usage the transmissions of the secondary users should have a minimal impact on the quality of service (QoS) and the operating conditions of the primary users. Therefore, it is important to distinguish the two types of users, and formulate the problem of resource allocation considering hard restrictions on the user-perceived QoS (such as packet end-to-end delay and loss) and physical-layer channel characteristics (such as noise and interference) of the primary users. To achieve this goal, we propose to assign the bandwidth and transmission power to minimize the total buffer occupancy in the system subject to capacity constraints, queue stability constraints, and interference requirements of the primary users. We apply this approach for resource allocation in a CRN built upon a Third Generation Partnership Project (3GPP) long-term evolution (LTE) standard platform. Performance of the algorithm is evaluated using simulations in OPNET environment. The algorithm shows consistent performance improvement when compared with other relevant resource allocation techniques.