A new image encryption method: parallel sub-image encryption with hyper chaos

A new image encryption scheme, based on a total shuffling and parallel encryption algorithm is proposed in this paper. Two chaotic systems have been used in the encryption algorithm to confuse the relationship between the plain-image and the cipher-image. To make the encryption procedure more confusing and complex, the plain-image is first divided into 4 sub-images and then the position of each sub-image is changed pseudo-randomly according to a logistic map. Next, a total shuffling matrix is used to shuffle the position of pixels in the whole image and then sub-images are encrypted simultaneously in a parallel manner. The experimental results on USC data base demonstrate that the proposed encryption algorithm has a low time complexity and has the advantages of large key space and high security. Moreover, the robustness of this locally encryption method is much more in contrast with other encryption schemes and the distribution of gray values has a random-like behavior in the encrypted image.     

Breaking a novel colour image encryption algorithm based on chaos

Recently, a colour image encryption algorithm based on chaos was proposed by cascading two position permutation operations and one substitution operation, which are all determined by some pseudo-random number sequences generated by iterating the logistic map. This paper evaluates the security level of this encryption algorithm and finds that the position permutation-only part and the substitution part can be separately broken with only ?(log₂(3MN))/8? and 2 chosen plain-images, respectively, where MN is the size of the plain-image. The effectiveness of the proposed chosen-plaintext attack is supported by concise theoretical analyses, and is verified by experimental results.     

SPRING: a novel parallel chaos-based image encryption scheme

Nonlinear Dynamics - Due to the increasing demand on secure image transmission, image encryption has emerged as an active research field in recent years. Many of the proposed image encryption...     

An image encryption scheme combining chaos with cycle operation for DNA sequences

An image encryption scheme is proposed using high-dimensional chaotic systems and cycle operation for DNA sequences. In the scheme, the pixels of the original image are encoded randomly with the DNA coding rule controlled by a key stream produced from Chen’s hyper-chaos. In addition to confusion on the DNA sequence matrix with Lorenz system, a cycle operation for DNA sequences is projected to diffuse the pixel values of the image. In order to enhance the diffusion effect, a bitwise exclusive-OR operation is carried out for the decoded matrices with a binary key stream, and then the cipher-image is obtained. Simulation results demonstrate that the proposed image encryption scheme with acceptable robustness is secure against exhaustive attack, statistical attack and differential attack.     

Cryptanalysis and improvement in an image encryption scheme using combination of the 1D chaotic map

Nonlinear Dynamics - In this paper, we evaluate the security of an image cipher recently proposed. Three different cryptographic primitives, i.e., permutation, diffusion, and cyclic rotation, were...     

多波前并行处理的弹塑性子结构并行有限元

研究一种基于ＰＶＭ的弹塑性子结构并行有限元法。利用多个波前,对各子结构并行地进行静凝聚。再采用预条件共轭梯度法（ＰＣＧ）并行求解界面方程。算例表明该方法能获得较好的并行加速比,同时也能有癣地节省内存量。     

Melnikov's method for chaos of a two-dimensional thin panel in subsonic flow with external excitation

In this brief communication, Melnikov's method is adopted to study the chaotic behaviors of a two-dimensional thin panel subjected to subsonic flow and external excitation. The nonlinear governing equations of the subsonic panel system are reduced to a series of ordinary differential equations by using Galerkin method. The critical parameters for chaos are obtained. It is found that the critical parameters obtained by the theoretical analysis are in agreement with the numerical simulations. The method suggested in this paper can also be extended for other fluid-structure dynamic systems, such as the fluid-conveying system.     

一种粗粒度并行遗传算法及其应用

提出一种粗粒度并行遗传算法 ,采用多种群遗传策略 ,在逐渐收缩的空间上搜索 ,并且用准精确惩罚函数处理约束 ,保证了算法稳定而迅速地收敛于全局最优解。本文还讨论了算法的分布式计算策略 ,并行计算是在天潮 1 0 0 0 (A)超级并行计算机上完成的 ,利用 PVM系统处理各个处理器间的通讯。算例显示了本算法的计算效率和加速比。     

一类非线性发展方程的交替分段显隐并行数值方法

给出了一类非线性发展方程的交替分段显隐并行数值方法 ,得到了方法的无条件稳定性和并行性兼顾的结果。数值例子说明理论分析的正确性和格式的有效性     

Representation of discrete sequences with high-dimensional iterated function systems

Iterated Function System (IFS) models have been used to represent discrete sequences where the attractor of the IFS is self-affine or piece-wise self-affine in R ² or R ³ (R is the set of real numbers). In this paper, the piece-wise hidden-variable fractal model is extended from R ³ to R ⁿ (n is an integer greater than 3), which is called the high-dimensional piece-wise hidden-variable fractal model. This new model uses a “mapping partial derivative” and a constrained inverse algorithm to identify the model parameters. The model values depend continuously on all the hidden variables. Therefore, the result is very general.     

Conservative chaos in a simple oscillatory system with non-smooth nonlinearity

Nonlinear Dynamics - In this paper, we consider some unusual features of dynamical regimes in the non-smooth potential $$V(x)=|x|$$ which is a piece-wise linear function. Also, we consider the...     

An iterative parallel algorithm of finite element method

In this paper, a parallel algorithm with iterative form for solving finite element equation is presented. Based on the iterative solution of linear algebra equations, the parallel computational steps are introduced in this method. Also by using the weighted residual method and choosing the appropriate weighting functions, the finite element basic form of parallel algorithm is deduced. The program of this algorithm has been realized on the ELXSI-6400 parallel computer of Xi'an Jiaotong University. The computational results show the operational speed will be raised and the CPU time will be cut down effectively. So this method is one kind of effective parallel algorithm for solving the finite element equations of large-scale structures.     

Quasi-real-time simulation of rotating drum using discrete element method with parallel GPU computing

Real-time simulation of industrial equipment is a huge challenge nowadays. The high performance and fine-grained parallel computing provided by graphics processing units (GPUs) bring us closer to our goals. In this article, an industrial-scale rotating drum is simulated using simplified discrete element method (DEM) without consideration of the tangential components of contact force and particle rotation. A single GPU is used first to simulate a small model system with about 8000 particles in real-time, and the simulation is then scaled up to industrial scale using more than 200 GPUs in a 1D domain-decomposition parallelization mode. The overall speed is about 1/11 of the real-time. Optimization of the communication part of the parallel GPU codes can speed up the simulation further, indicating that such real-time simulations have not only methodological but also industrial implications in the near future.     

Bifurcation and chaos of a delayed predator-prey model with dormancy of predators

In this paper, a delayed predator-prey model with dormancy of predators is investigated. It shows that time delay in the prey-species growth can lead to the occurrence of Hopf bifurcation with stability switches at a coexistence equilibrium. The computing formulas of stability and direction of the Hopf bifurcating periodic solutions are given. Under appropriate conditions, the uniform persistence of this model with time delay is proved. In this simple model, multiple periodic solutions coexist. Through numerical simulation, it is shown that different values of time delay can generate or eliminate chaos. Biologically, our results imply that dynamical behaviors of this system with time delay strongly depend on the initial density of this model and the time delay of the growth of the prey.     

刚体绕平行轴转动动量矩求解方法的分析

从``质点系相对其质心动量矩'的概念,分析了质点系相对其质心绝对动量矩等于其相对动量矩的满足条件. 从``刚体平面运动的合成'的概念得到一种新的求解方法:``${\pmb L}_{o} = {\pmb L}_e + {\pmb L}_{r}https://pubs.cstam.org.cn/article/doi/10.6052/1000-0992-2007-138https://pubs.cstam.org.cn/article/exportPdf?id=mie_137552刚体;平行轴;平面运动;牵连运动;质心http://d.wanfangdata.com.cn/Periodical_lxysj200805026.aspx塔里木大学农业工程学院周岭 http://lxsj.cstam.org.cn/CN/10.6052/1000-0992-2007-138塔里木大学农业工程学院1900-01-012008-10-10', 即刚体绕平行轴转动对某点绝对动量矩等于刚体作牵连运动对该点动量矩与刚体相对质心转动产生动量矩的矢量和,为学生较好理解``刚体绕平行轴转动动量矩'的求解提供了新思路.     

一类非线性发展方程的交替分组的并行数值算法

给出了一类非线性发展方程的交替分组4点格式,并得到该方法的无条件稳定性及具有并行本性兼顾的结果。能够适合在并行计算系统上使用。文中还进行了并行计算的数值实验。     

Computation of fluid flow with a parallel multigrid solver

A finite volume numerical method for the prediction of fluid flow and heat transfer in simple geometries was parallelized using a domain decomposition approach. The method is implicit, uses a colocated arrangement of variables and is based on the SIMPLE algorithm for pressure-velocity coupling. Discretization is based on second-order central difference approximations. The algebraic equation systems are solved by the ILU method of Stone.¹ To accelerate the convergence, a multigrid technique was used. The efficiency was examined on three different parallel computers for laminar flow in a pipe with an orifice and natural convection in a closed cavity. It is shown that the total efficiency is made up of three major factors: numerical efficiency, parallel efficiency and load-balancing efficiency. The first two factors were thoroughly investigated, and a model for predicting the parallel efficiency on various computers is presented. Test calculations indicate reasonable total efficiency and favourable dependence on grid size and the number of processors.     

A fast image encryption scheme with a novel pixel swapping-based confusion approach

In traditional permutation-diffusion type image cipher, the confusion and diffusion are two independent procedures. In general, several overall rounds are required to achieve a satisfactory security level, which downgrades its advantage in online image protection. In this paper, a novel plain pixel-related swapping confusion approach that can contribute considerable diffusion effect in the permutation procedure is proposed. By employing the self-related non-linear pixel swapping confusion approach, a tiny difference between two plain images can bring about completely different confused images. Therefore, the spreading process of the cryptosystem is significantly accelerated, and the workload of the time-consuming diffusion part will be reduced. Moreover, an improved image encryption architecture is proposed in conjunction with the pixel swapping-based confusion approach. Compared with the typical permutation-diffusion structure, the new architecture well addresses the weakness of confusion key sensitivity in the first encryption round. Simulation results and numerical analyses justify the higher efficiency and sufficient strength of the proposed image encryption scheme.