Secure image encryption scheme using 4D-Hyperchaotic systems based reconfigurable pseudo-random number generator and S-Box

This paper introduces the design of a hardware efficient reconfigurable pseudorandom number generator (PRNG) using two different feedback controllers based four-dimensional (4D) hyperchaotic systems i.e. Hyperchaotic-1 and -2 to provide confidentiality for digital images. The parameter's value of these two hyperchaotic systems is set to be a specific value to get the benefits i.e. all the multiplications (except a few multiplications) are performed using hardwired shifting operations rather than the binary multiplications, which doesn't utilize any hardware resource. The ordinary differential equations (ODEs) of these two systems have been exploited to build a generic architecture that fits in a single architecture. The proposed architecture provides an opportunity to switch between two different 4D hyperchaotic systems depending on the required behavior. To ensure the security strength, that can be also used in the encryption process in which encrypt the input data up to two times successively, each time using a different PRNG configuration. The proposed reconfigurable PRNG has been designed using Verilog HDL, synthesized on the Xilinx tool using the Virtex-5 (XC5VLX50T) and Zynq (XC7Z045) FPGA, its analysis has been done using Matlab tool. It has been found that the proposed architecture of PRNG has the best hardware performance and good statistical properties as it passes all fifteen NIST statistical benchmark tests while it can operate at 79.101-MHz or 1898.424-Mbps and utilize only 0.036 %, 0.23 %, and 1.77 % from the Zynq (XC7Z045) FPGA's slice registers, slice LUTs, and DSP blocks respectively. Utilizing these PRNGs, we design two 16 × 16 substitution boxes (S-boxes). The proposed S-boxes fulfill the following criteria: Bijective, Balanced, Non-linearity, Dynamic Distance, Strict Avalanche Criterion (SAC) and BIC non-linearity criterion. To demonstrate these PRNGs and S-boxes, a new three different scheme of image encryption algorithms have been developed: a) Encryption using S-box-1, b) Encryption using S-box-2 and, c) Two times encryption using S-box-1 and S-box-2. To demonstrate that the proposed cryptosystem is highly secure, we perform the security analysis (in terms of the correlation coefficient, key space, NPCR, UACI, information entropy and image encryption quantitatively in terms of (MSE, PSNR and SSIM)).     

风速时间序列混沌判定方法比较研究

混沌识别是对非线性时间序列进行混沌预测的前提。针对时间序列风速确定性与随机性相结合的复杂非线性特征,研究了不同的混沌识别方法,并对风速时间序列进行混沌特征识别。应用随机噪声、周期运动及经典混沌系统的时间序列对所选方法进行可靠性验证。对美国国家风能研究中心M2测风塔实测时间序列风速数据进行非线性混沌特征识别。结果表明:风速时间序列具有明显的混沌特征;各风速时间序列表现出不同程度的混沌特征;各混沌识别方法对风速时间序列混沌特征的表达形式不同,互为补充,相互验证。     

Stochastic collocation-based nonlinear analysis of concrete bridges with uncertain parameters

This paper focuses on the stochastic response of concrete bridges considering uncertainty in bearing and abutment stiffness. A multi-span simply supported bridge with concrete girders is selected. A 3D-dimensional model is prepared, and nonlinear response history analyses are performed. For the numerical dynamic simulation, the non-sampling stochastic method based on generalized polynomial chaos (gPC) expansion is utilised. The uncertain parameters include the vertical and shear stiffness of bearings and the lateral stiffness of abutments are presented by the truncated gPC expansions. Furthermore, the system response such as base shear, acceleration, velocity and displacement in different columns is presented by gPC expansion with unknown deterministic coefficients. The stochastic Galerkin projection is employed to calculate a set of deterministic equations. A non-intrusive solution, as a set of collocation points, determines the unknown gPC coefficients of the system response and the results are compared with Monte Carlo simulations. The key advantage of spectral discretization is the combination of the mentioned method with the spatial discretization, e.g. finite element model. This study also emphasises the accuracy in results and time efficiency of the proposed non-sampling method for uncertainty quantification of stochastic systems comparing to sampling procedure (e.g. Monte Carlo simulation).     

An enhanced data-driven polynomial chaos method for uncertainty propagation

As a novel type of polynomial chaos expansion (PCE), the data-driven PCE (DD-PCE) approach has been developed to have a wide range of potential applications for uncertainty propagation. While the research on DD-PCE is still ongoing, its merits compared with the existing PCE approaches have yet to be understood and explored, and its limitations also need to be addressed. In this article, the Galerkin projection technique in conjunction with the moment-matching equations is employed in DD-PCE for higher-dimensional uncertainty propagation. The enhanced DD-PCE method is then compared with current PCE methods to fully investigate its relative merits through four numerical examples considering different cases of information for random inputs. It is found that the proposed method could improve the accuracy, or in some cases leads to comparable results, demonstrating its effectiveness and advantages. Its application in dealing with a Mars entry trajectory optimization problem further verifies its effectiveness.     

Mitigating the harmful effects of technostress: inducing chaos theory in an experimental setting

ABSTRACT

This research investigates the role of users’ proactive personality when they mitigate the adverse impacts of ICT's (information and communication technologies’) technostress in an experimental setting. Further, this study examines genuinely two types of individuals’ proactive personality, i.e. confront and transform. Both types can handle ICT's technostress creators by different attitudes and behaviours. This article contributes to a novelty by inducing chaos theory. This inducement laid in the experimental setting that the users had been in a chaotic situation. Results of this research show that users’ proactive personality mitigates the negative impact of ICT's technostress on their performance and satisfaction. This study found that the user's proactive personality, rested in a chaotic situation, does mitigate greatly. This research finds that users’ performance and satisfaction are higher to the proactive personality verging to the transform than that of confront. It implies that information system managers should consider the ICT user's characteristics. Besides, it means that ICT's developer should make users do their innovativeness.     

Criteria on existence of horseshoes near homoclinic tangencies of arbitrary orders

Consider (m + 1)-dimensional, m ≥ 1, diffeomorphisms that have a saddle fixed point O with m-dimensional stable manifold W^s(O), one-dimensional unstable manifold W^u(O), and with the saddle value σ different from 1. We assume that W^s(O) and W^u(O) are tangent at the points of some homoclinic orbit and we let the order of tangency be arbitrary. In the case when σ < 1, we prove necessary and sufficient conditions of existence of topological horseshoes near homoclinic tangencies. In the case when σ > 1, we also obtain the criterion of existence of horseshoes under the additional assumption that the homoclinic tangency is simple.     

混流式水轮机调节系统的混沌建模及分析

水轮发电机在正常运行中会受到各种各样的干扰(增减负荷、故障等),因此控制其稳定运行十分必要。针对混流式水轮发电机系统,分析了各个子模块的动态特性,分别建立了其整数阶和分数阶非线性数学模型,研究了正常运行工况下水轮机调节系统中各变量的状态轨迹图,采用Lyapunov指数、Poincaré映射图、功率谱分析了水轮机调节系统的非线性特性,并研究了水轮机调节系统在参数变化时的分岔现象,进一步证明了水轮发电机在运行中表现出的非线性混沌特性,研究结果可为混流式水轮发电机的混沌控制研究提供理论依据。     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

基于混沌理论的弧形闸门支臂振动特性

为了研究弧形闸门支臂的振动问题,采用混沌理论对时间序列进行处理,确定延迟时间τ、嵌入维数m进行相空间重构,并计算时间序列的混沌特征值,进而研究弧形闸门在启闭过程中振动的复杂性。以某水电站弧形闸门支臂振动为研究对象,根据支臂振动加速度原型观测资料,分析不同开度的振动情况,发现启门振动的复杂程度高于闭门工况,小开度的振动复杂程度更高,且支臂振动的复杂程度为与面板连接位置最大,与闸墩连接位置最小,中间位置介于前两者之间。为弧形闸门短期振动预测提供了支持。