混沌遗传算法对BP神经网络的改进研究

BP神经网络算法是目前应用最广泛的一种神经网络算法,但有收敛速度慢和易陷入局部极小值等缺陷.本文利用混沌遗传算法(CGA)具有混沌运动遍历性、遗传算法反演性的特性来改进BP神经网络算法.该算法的基本思想是用混沌遗传算法对BP神经网络算法的初始权值和初始阈值进行优化.把混沌变量加入遗传算法中,提高遗传算法的全局搜索能力和收敛速度;用混沌遗传算法优化后得到的最优解作为BP神经网络算法的初始权值和阈值.通过实验观察,改进后的结果与普通的BP神经网络算法的结果相比,具有更高的准确率.     

基于混沌序列的密钥生成新方法

设计了一种从混沌序列生成密钥的新方法.其基本原理是从混沌序列依次取若干数据构成实值序列,将其按非线性规则映射成二值序列,再用实值序列和任意指定序列分别置乱这个二值序列,被置乱后的二值序列即为所生成密钥.实验表明,在混沌密码体制研究中,这种密钥较一般序列密钥更具有独立性、均匀性和不可预测性.     

一种混沌多相伪随机序列

提出了一种混沌多相伪随机序列生成方法，推导出通过Logistic映射产生独立同分布多相序列的充分条件，即根据混沌轨迹的概率密度分布把混沌吸引子划分为2n个区域，对混沌轨迹进行采样间隔为n的采样，对照轨道点所处位置与相应的序列元素之间的映射关系，可以得到独立、均匀分布的2n相伪随机序列。数值统计分析支持以上研究结果并表明该序列具有较高的复杂度。此外文中给出了该序列生成的快速算法和一般表达式。该序列可用于信息安全、扩频通信等众多领域。      

CPI数据预测计算的ANFIS模型结构探讨

依据CPI经济序列数据确定性混沌原理,探讨自适应神经模糊推理系统模型构造,并给出此类混沌数据列预测的ANFIS系统结构形式,进行CPI经济序列数据预测.并用实例拟合、预测数据证明:ANFIS模型是一种精度较高的混沌数据序列预报系统.为CPI数据预测提供了一种计算方法.     

瞬时混沌神经网络的混沌动力学

首先利用“不可分意味着混沌”从理论上证明了一维瞬时混沌神经网络在一定的条件下按Li-Yorke意义是混沌的；特别地，进一步推出了混沌神经网络按Li-Yorke意义是混沌的充分条件，而这将从理论上证明Aihara等人通过数值计算所得结论；最后，为说明前面的结论给出了一个例子及其数值计算的结果．     

基于多元混沌时间序列的油田产量预测模型

油田产量的预测一直是石油工作者研究的重要课题.针对油田产油量、产水量、地层压力和时间之间有着混沌的特征,利用多变量混沌时间序列等方法研究了油田产量的混沌建模和预测问题.用C-C算法确定每一个变量的嵌入维数和延迟时间,重构多元混沌时间序列的相空间;使用基于奇异值分解的主成分分析消除重构相空间的冗余变量和噪声干扰,建立了有较好泛化性能的多元混沌时间序列油田产量预测模型;最后将混沌时间序列预测和Elman神经网络进行耦合,创建了基于主成分分析前馈网络的多元混沌时间序列油田产量预测方法.应研究表明,提出的多变量混沌时间序列预测方法的预测精确度优于单变量预测,它可用于解决具有多变量混沌时间序列的预测问题.     

基于Volterra自适应方法的水文混沌时间序列预测

Volterra泛函级数能够描述具有响应和记忆功能的非线性行为,一般用于非线性系统因果关系点对的预测,把Volterra自适应方法应用于水文混沌时间序列的预测研究是一个有意义的工作。论文针对水文系统的复杂性,基于混沌动力系统相空间重构技术,构建了水文混沌时间序列Volterra自适应预测方法,并采用NLMS算法调整滤波器参数,并就模型进行仿真计算,讨论了模型参数对预测精度的影响。直门达水文站月蒸发量混沌时间序列预测实验表明,水文混沌时间序列Volterra自适应预测方法,具有较好的预测精度和效果,拓展了水文预测报方法的研究途径。     

基于多尺度自适应阶ARMA的混沌序列多步预测

混沌时间序列在自然界以及人们的生产生活中很常见,混沌序列看似杂乱无章但相较于纯随机序列其中蕴含着一些非线性的运动特征,提出一种基于多尺度自适应阶ARMA的混沌时间序列多步预测方法.首先利用自适应噪声的完备经验模态分解(CEEMDAN)对原始混沌序列进行分解,获得不同尺度的固有模态分量(IMF)和残余分量.然后采用经粒子群算法(PSO)进行阶数寻优的自回归移动平均模型(ARMA)对每一个IMF分量进行拟合预测.最后将预测得到的每一个分量相加得到原始混沌序列的预测值.基于Mackay-Glass混沌序列和太阳黑子数混沌序列进行实验分析,实验表明:与ARMA、PSO-ARMA以及CEEMDAN-ARMA方法相比,方法的预测效果有较好的提高,其平均绝对误差(MAE)、均方根误差(RMSE)以及平均绝对百分比误差(MAPE)都有降低.     

以混沌理论为基础的神经网络预测方法

我国证券市场股价波动表现出特有的混沌性质，具有局部随机与整体秩序相容的特征。本以2002年每隔十秒的上证指数高频数据为例，以混沌理论为基础。从原始序列中构造出若干个新的时间序列，运用神经网络法进行预测。预测结果表明，此方法能够较好地预测股票的走势，有望在股票交易中应用。     

混沌时间序列的2阶预测模型

为了克服传统预测方法对混沌时间序列预测精度不高的缺点,提出一种新的基于1阶预测模型(1-OP)和信息融合理论的混沌时间序列2阶预测模型(2-OP).首先根据相空间重构理论建立2个1阶预测模型,然后根据融合估计原理建立2阶预测模型.最后利用Lorenz和Mackey-Glass时间序列对该模型进行验证,结果表明,2阶预测模型对多变量和单变量混沌系统都是有效的.     

Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.     

Chaos-enhanced accelerated particle swarm optimization

There are more than two dozen variants of particle swarm optimization (PSO) algorithms in the literature. Recently, a new variant, called accelerated PSO (APSO), shows some extra advantages in convergence for global search. In the present study, we will introduce chaos into the APSO in order to further enhance its global search ability. Firstly, detailed studies are carried out on benchmark problems with twelve different chaotic maps to find out the most efficient one. Then the chaotic APSO (CAPSO) will be compared with some other chaotic PSO algorithms presented in the literature. The performance of the CAPSO algorithm is also validated using three engineering problems. The results show that the CAPSO with an appropriate chaotic map can clearly outperform standard APSO, with very good performance in comparison with other algorithms and in application to a complex problem.     

A new chaotic cryptosystem

Based on the study of some previously proposed chaotic encryption algorithms, we found that it is dangerous to mix chaotic state or iteration number of the chaotic system with ciphertext. In this paper, a new chaotic cryptosystem is proposed. Instead of simply mixing the chaotic signal of the proposed chaotic cryptosystem with the ciphertext, a noise-like variable is utilized to govern the encryption and decryption processes. This adds statistical sense to the new cryptosystem. Numerical simulations show that the new cryptosystem is practical whenever efficiency, ciphertext length or security is concerned.     

A chaos-based evolutionary algorithm for general nonlinear programming problems

In this paper we present a chaos-based evolutionary algorithm (EA) for solving nonlinear programming problems named chaotic genetic algorithm (CGA). CGA integrates genetic algorithm (GA) and chaotic local search (CLS) strategy to accelerate the optimum seeking operation and to speed the convergence to the global solution. The integration of global search represented in genetic algorithm and CLS procedures should offer the advantages of both optimization methods while offsetting their disadvantages. By this way, it is intended to enhance the global convergence and to prevent to stick on a local solution. The inherent characteristics of chaos can enhance optimization algorithms by enabling it to escape from local solutions and increase the convergence to reach to the global solution. Twelve chaotic maps have been analyzed in the proposed approach. The simulation results using the set of CEC’2005 show that the application of chaotic mapping may be an effective strategy to improve the performances of EAs.     

A Verified Optimization Technique to Locate Chaotic Regions of Hénon Systems

We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located by the new technique.     

Evolving chaos: Identifying new attractors of the generalised Lorenz family

In a recent paper, we presented an intelligent evolutionary search technique through genetic programming (GP) for finding new analytical expressions of nonlinear dynamical systems, similar to the classical Lorenz attractor's which also exhibit chaotic behaviour in the phase space. In this paper, we extend our previous finding to explore yet another gallery of new chaotic attractors which are derived from the original Lorenz system of equations. Compared to the previous exploration with sinusoidal type transcendental nonlinearity, here we focus on only cross-product and higher-power type nonlinearities in the three state equations. We here report over 150 different structures of chaotic attractors along with their one set of parameter values, phase space dynamics and the Largest Lyapunov Exponents (LLE). The expressions of these new Lorenz-like nonlinear dynamical systems have been automatically evolved through multi-gene genetic programming (MGGP). In the past two decades, there have been many claims of designing new chaotic attractors as an incremental extension of the Lorenz family. We provide here a large family of chaotic systems whose structure closely resemble the original Lorenz system but with drastically different phase space dynamics. This advances the state of the art knowledge of discovering new chaotic systems which can find application in many real-world problems. This work may also find its archival value in future in the domain of new chaotic system discovery.     

Design and FPGA-realization of a self-synchronizing chaotic decoder in the presence of noise

This paper describes requirement for wireless transmission of Chaotic Code Division Multiplexed Access (Chaotic CDMA) and it focuses on real-time synchronization algorithm embedded into electronic programmable device. CDMA with quasi-orthogonal codes is used to allow multi-users to transmit simultaneously in the same channel. Since the channel is shared between all users, the receiver system has to cope with channel noise and overall with interference from other users. As a result, one of the main problems of communication with quasi-orthogonal chaotic codes is to implement a real time decoder in presence of noise. Even if set-membership algorithm are efficient in real time synchronization of chaotic discrete generators in the presence of noise, these algorithms require a large memory resource. In this paper, we propose an evolution of set-membership algorithm toward genetic algorithm to be implemented into electronic programmable device. The advantage of genetic algorithm compared with set-membership algorithm is that they require a fixed size of memory.     

Chaotic harmony search algorithms

Harmony Search (HS) is one of the newest and the easiest to code music inspired heuristics for optimization problems. Like the use of chaos in adjusting note parameters such as pitch, dynamic, rhythm, duration, tempo, instrument selection, attack time, etc. in real music and in sound synthesis and timbre construction, this paper proposes new HS algorithms that use chaotic maps for parameter adaptation in order to improve the convergence characteristics and to prevent the HS to get stuck on local solutions. This has been done by using of chaotic number generators each time a random number is needed by the classical HS algorithm. Seven new chaotic HS algorithms have been proposed and different chaotic maps have been analyzed in the benchmark functions. It has been detected that coupling emergent results in different areas, like those of HS and complex dynamics, can improve the quality of results in some optimization problems. It has been also shown that, some of the proposed methods have somewhat increased the solution quality, that is in some cases they improved the global searching capability by escaping the local solutions.     

An improved artificial bee colony algorithm for directing orbits of chaotic systems

Artificial bee colony algorithm (ABC) is a relatively new optimization technique which has been shown to be competitive to other population-based algorithms. However, there is still an insufficiency in ABC regarding its solution search equation, which is good at exploration but poor at exploitation. To address this concerning issue, we propose an improved ABC (IABC) by using a modified search strategy to generate a new food source in order that the exploration and exploitation can be well balanced and satisfactory optimization performances can be achieved. In addition, to enhance the global convergence, when producing the initial population, both opposition-based learning method and chaotic maps are employed. In this paper, the proposed algorithm is applied to control and synchronization of discrete chaotic systems which can be formulated as both multimodal numerical optimization problems with high dimension. Numerical simulation and comparisons with some typical existing algorithms demonstrate the effectiveness and robustness of the proposed approach.     

Design and statistical analysis of a new chaotic block cipher for Wireless Sensor Networks

Security issue is a vital and active topic in the research of Wireless Sensor Networks (WSN). After surveying the existing encryption algorithms for WSN briefly, we propose a new chaotic block cipher for WSN and then compare the performance of this cipher with those of RC5 and RC6 block ciphers. Simulation result demonstrates that better performance in WSN encryption algorithms can be achieved using the new cipher.