Chaotic neural networks have global searching ability.But their applications are generally confined to combinatorial optimization to date.By introducing chaotic noise annealing process into conventional Hopfield netwo...Chaotic neural networks have global searching ability.But their applications are generally confined to combinatorial optimization to date.By introducing chaotic noise annealing process into conventional Hopfield network,this paper proposes a new chaotic annealing neural network (CANN) for global optimization of continuous constrained non linear programming.It is easy to implement,conceptually simple,and generally applicable.Numerical experiments on severe test functions manifest that CANN is efficient and reliable to search for global optimum and outperforms the existing genetic algorithm GAMAS for the same purpose.展开更多
On the assumption that random interruptions in the observation process are modelled by a sequence of independent Bernoulli random variables, this paper generalize the extended Kalman filtering （EKF）, the unscented K...On the assumption that random interruptions in the observation process are modelled by a sequence of independent Bernoulli random variables, this paper generalize the extended Kalman filtering （EKF）, the unscented Kalman filtering （UKF） and the Gaussian particle filtering （GPF） to the case in which there is a positive probability that the observation in each time consists of noise alone and does not contain the chaotic signal （These generalized novel algorithms are referred to as GEKF, GUKF and GGPF correspondingly in this paper）. Using weights and network output of neural networks to constitute state equation and observation equation for chaotic time-series prediction to obtain the linear system state transition equation with continuous update scheme in an online fashion, and the prediction results of chaotic time series represented by the predicted observation value, these proposed novel algorithms are applied to the prediction of Mackey-Glass time-series with additive and multiplicative noises. Simulation results prove that the GGPF provides a relatively better prediction performance in comparison with GEKF and GUKF.展开更多
基金the National Natural Science Foundation of China(No.79970 0 4 2 )
文摘Chaotic neural networks have global searching ability.But their applications are generally confined to combinatorial optimization to date.By introducing chaotic noise annealing process into conventional Hopfield network,this paper proposes a new chaotic annealing neural network (CANN) for global optimization of continuous constrained non linear programming.It is easy to implement,conceptually simple,and generally applicable.Numerical experiments on severe test functions manifest that CANN is efficient and reliable to search for global optimum and outperforms the existing genetic algorithm GAMAS for the same purpose.
基金supported by the National Natural Science Foundation of China (Grant No 60774067)the Natural Science Foundation of Fujian Province of China (Grant No 2006J0017)
文摘On the assumption that random interruptions in the observation process are modelled by a sequence of independent Bernoulli random variables, this paper generalize the extended Kalman filtering （EKF）, the unscented Kalman filtering （UKF） and the Gaussian particle filtering （GPF） to the case in which there is a positive probability that the observation in each time consists of noise alone and does not contain the chaotic signal （These generalized novel algorithms are referred to as GEKF, GUKF and GGPF correspondingly in this paper）. Using weights and network output of neural networks to constitute state equation and observation equation for chaotic time-series prediction to obtain the linear system state transition equation with continuous update scheme in an online fashion, and the prediction results of chaotic time series represented by the predicted observation value, these proposed novel algorithms are applied to the prediction of Mackey-Glass time-series with additive and multiplicative noises. Simulation results prove that the GGPF provides a relatively better prediction performance in comparison with GEKF and GUKF.
