Kinship-based differential evolution algorithm for unconstrained numerical optimization

Nonlinear Dynamics - We propose a modification of the standard differential evolution (DE) algorithm in order to significantly make easier and more efficient standard DE implementations. Taking...     

Parameters identification for chaotic systems based on a modified Jaya algorithm

In this paper, parameters identification for chaotic systems using a modified Jaya algorithm is considered. Firstly, the objective function is formulated based on the variance rate between the responses acquired from the measurement and calculation. Then, the Jaya algorithm is put forward to solve this nonlinear optimization problem. To enhance the performance of the original Jaya, a one-step K-means clustering mechanism and a new updated equation for the best-so-far solution are introduced. To demonstrate the effectiveness of the suggested method, benchmark functions are firstly employed to conduct optimize. Afterward, numerical simulations, including a jerk circuit chaotic system, a hyper-chaotic system and a synchronized chaotic system are used to verify the present algorithm. The simulation results illustrates that the proposed algorithm for chaotic systems is a promising tool with higher identification accuracy, faster convergence rate, as well as stronger robustness.     

A novel approach for designing substitution-boxes based on nonlinear chaotic algorithm

A substitution box (S-box) plays a central role in cryptographic algorithms. In this paper, an efficient method for designing S-boxes based on chaotic maps is proposed. The proposed method is based on the NCA (nonlinear chaotic algorithm) chaotic maps. The S-box so constructed has very optimal nonlinearity, bit independence criterion (BIC), strict avalanche criterion (SAC), differential and linear approximation probabilities. The proposed S-box is more secure against differential and linear cryptanalysis compared to recently proposed chaotic S-boxes.     

混沌优化水下地形匹配算法研究

为了解决迭代最近点算法的定位精度和实时性问题,提出了一种基于混沌优化搜索的迭代最近点算法.在该算法中,以参考导航系统测量位置为中心规划真实位置的搜索范围,从参考地形图上提取相应的地形高程数据,与对应经纬度位置一起定义成模式类,将模式识别的过程转化成函数优化问题,然后运用混沌优化算法搜索目标函数最小值进行全局寻优,从而获得匹配最近点.仿真结果表明,在保证寻优性能的情况下,可以减少匹配次数,提高识别速度,满足地形匹配精度和实时性的要求.     

A novel approach for strong S-Box generation algorithm design based on chaotic scaled Zhongtang system

Nonlinear Dynamics - Substitution Box (S-Box) is one of the most significant structures used to create an encryption which is strong and resistant against attacks in block encryption algorithms....     

Parameter estimation of chaotic systems by an oppositional seeker optimization algorithm

The parameter estimation can be formulated as a multi-dimensional optimization problem. By combining the seeker optimization algorithm with the opposition-based learning method, an oppositional seeker optimization algorithm is proposed in this work, and is applied to the parameter estimation of chaotic systems. The seeker optimization algorithm provides a new alternative for population-based heuristic search. By considering an estimate and its opposite of current solutions at the same time, the opposition-based learning method is employed for population initialization and also for generation jumping in seeker optimization algorithm. Numerical simulations on two typical chaotic systems are conducted to show the effectiveness and robustness of the proposed scheme.     

A novel chaotic approach for information hiding in image

Hiding information in image has been proposed as a methodology for transmitting messages through innocuous covers to conceal their existence. This work investigates current state-of-the-art methods and provides a new and efficient approach to digital image steganography. We proposed an asymmetric image steganographic method based on a chaotic dynamic system. The hidden message can be recovered using orbits different from the embedding orbits, and the original image is not required to extract the hidden message. In the real communication, the receiver can use the same system as well as retrieving the data back that has been hidden inside the image. However, a secret key is needed by the receiver in order to retrieve the data back. This secret key is generated to use the proposed algorithm during the process of hiding the data. In contrast to current method, by using the secret key to retrieve the data, it maintains privacy, confidentiality, and accuracy of the data. The experimental results on USC data base demonstrates that the proposed encryption algorithm has a low time complexity and has the advantages of large key space and high security. In addition, the discussions reveal that the proposed scheme possesses security, imperceptibility, and survivability. The results are promising and point to the advocacy and coherence of the developed algorithm.     

A novel adaptive fuzzy sliding-mode controller for uncertain chaotic systems

This paper is concerned with the stabilization problem for a class of uncertain chaotic systems. Based on a set of linguistic rules, a novel variable universe fuzzy sliding-mode control approach is designed to improve the robustness and the stability of system. Based on Lyapunov stability theory, the overall closed-loop system is shown to be stable. The designed controller not only can control the uncertain chaotic system to a desired state, but also the control action is smooth without chattering. Simulation examples are presented to further illustrate the advantage of the proposed method.     

A novel bounded 4D chaotic system

This paper presents a novel bounded four-dimensional (4D) chaotic system which can display hyperchaos, chaos, quasiperiodic and periodic behaviors, and may have a unique equilibrium, three equilibria and five equilibria for the different system parameters. Numerical simulation shows that the chaotic attractors of the new system exhibit very strange shapes which are distinctly different from those of the existing chaotic attractors. In addition, we investigate the ultimate bound and positively invariant set for the new system based on the Lyapunov function method, and obtain a hyperelliptic estimate of it for the system with certain parameters.     

A novel image encryption algorithm based on chaotic maps and GF(28) exponent transformation

In this paper, we propose an image encryption algorithm that is based on GF(2⁸) transformations, using the Arnold cat map and incorporating the nonlinear chaotic algorithm. The plain image is processed with the nonlinear chaotic algorithm and is shuffled iteratively with the Arnold cat map, while transforming the image pixel values into GF(2⁸). We show that the encryption characteristics of this approach are better as compared to some well known encryption algorithms.     

A novel spectrogram visual security encryption algorithm based on block compressed sensing and five-dimensional chaotic system

Based on block compressed sensing theory, combined with a five-dimensional chaotic system, we propose and analyze a novel spectrogram visual security encryption algorithm. This research is devoted to solving the compression, encryption and steganography problems of spectrograms involving large data volumes and high complexity. First, the discrete wavelet transform is applied to the spectrogram to generate the coefficient matrix. Then, block compressed sensing is applied to compress and preencrypt the spectrogram. Second, we design a new five-dimensional chaotic system. Then, several typical evaluation methods, such as the phase diagram, Lyapunov exponent, bifurcation diagram and sample entropy, are applied to deeply analyze the chaotic behavior and dynamic performance of the system. Moreover, the corresponding Simulink model has been built, which proves the realizability of the chaotic system. Importantly, the measurement matrix required for compressed sensing is constructed by the chaotic sequence. Third, dynamic Josephus scrambling and annular diffusion are performed on the secret image to obtain the cipher image. Finally, an improved least significant bit embedding method and alpha channel synchronous embedding are designed to obtain a steganographic image with visual security properties. To make the initial keys of each image completely different from other images, the required keys are produced using the SHA-256 algorithm. The experimental results confirm that the visual security cryptosystem designed in this study has better compression performance, visual security and reconstruction quality. Furthermore, it is able to effectively defend against a variety of conventional attack methods, such as statistical attacks and entropy attacks.

     

A numerical algorithm for tensegrity dynamics with non-minimal coordinates

This paper provides a numerical correction algorithm for implementation of the dynamics of tensegrity systems described by non-minimal coordinates. This correction algorithm corrects any numerical error that would violate the fixed-length bar constraints. A recursive form of the correction algorithm is proposed, and simulation results support the validity of the proposed scheme.     

基于PTCNN的结构布局优化问题研究

对结构优化中的难点布局优化问题,基于交叉学科的优势,运用脉冲暂态混沌神经网络（PTCNN）的方法,对一个新型布局优化模型进行了寻优计算。在PTCNN算法中应用脉冲混沌动力自然解决了杆件的恢复和删除问题;利用神经网络的多神经元并行构成特点,通过参数调整方法解决了不同数量级变量问的耦合问题。因此PTCNN不仅是模型的寻优算法,更成为布局优化的一部分。此外构造了一个应力关联系数σ_AI,使面积变量随杆中应力大小按比例自适应下降。算例结果表明,基于PTCNN方法解决结构布局优化问题,有效且具有自适应性,布局优化效果明显。     

Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization

The nonlinear conjugate gradient method (CGM) is a very effective iterative method for solving large-scale optimal problems. In this paper, based on a variant of Polak–Ribière–Polyak method, two modified CGMs with disturbance factors are proposed. By the disturbance factors, the two proposed methods not only generate sufficient descent direction at each iteration but also converge globally for nonconvex minimization if the strong Wolfe line search is used. Finally, elementary numerical experiment results are reported, which show that the proposed methods are promising.     

A NON－INCREMENTAL TIME－SPACE ALGORITHM FOR NUMERICAL SIMULATION OF FORMING PROCESS

ＡＮＯＮ－ＩＮＣＲＥＭＥＮＴＡＬＴＩＭＥ－ＳＰＡＣＥＡＬＧＯＲＩＴＨＭＦＯＲＮＵＭＥＲＩＣＡＬＳＩＭＵＬＡＴＩＯＮＯＦＦＯＲＭＩＮＧＰＲＯＣＥＳＳＬｉｕＢａｏｓｈｅｎｇ（柳葆生）ＣｈｅｎＤａｐｅｎｇ（陈大鹏）ＬｉｕＹｕ（刘渝）（ＲｅｃｅｉｖｅｄＡｐｒ...     

A chaotic image encryption algorithm based on perceptron model

Based on the high-dimension Lorenz chaotic system and perceptron model within a neural network, a chaotic image encryption system with a perceptron model is proposed. This paper describes the algorithm flow in detail, and analyses the cryptographic security. The experimental results show that this algorithm has high security, and strong resistance to the existing attack methods.     

A combinatorial algorithm for the discrete optimization of structures

The definition of local optimum solution of the discrete optimization is first given, and then a comprehensive combinatorial algorithm is proposed in this paper. Two-level optimum method is used in the algorithm. In the first level optimization, an approximate local optimum solution is found by using the heuristic algorithm, relative difference quotient algorithm, with high computational efficiency and high performance demonstrated by the performance test of random samples. In the second level, a mathematical model of (-1, 0, 1) programming is established first, and then it is changed into (0, 1) programming model. The local optimum solution X^* will be from the (0, 1) programming by using the delimitative and combinatorial algorithm or the relative difference quotient algorithm. By this algorithm, the local optimum solution can be obtained certainly, and a method is provided to judge whether or not the approximate optimum solution obtained by heuristic algorithm is an optimum solution. The above comprehensive combinatorial algorithm has higher computational efficiency.Project supported by Natural Science Foundation of Shandong Province