Fractal structures in a generalized square map with exponential terms

Fractal structures in a generalized squared map with exponential terms are expanded in this paper.We describe how complex behaviors can arise as the parameters change.The appearances of different kinds of fractal structures,in both the attractive and the divergent regions,and most interestingly,on small regular islands embedded in the chaotic region,are manifested to have a variety of extraordinary geometries in the parameter plane.     

EQUICONTINUITY OF TRIANGULAR MAPS

In this paper we study the equicontinuity of a triangular map of the square,and obtain some equivalent conditions for it.     

Regular reduction of controlled Hamiltonian system with symplectic structure and symmetry

In this paper, our goal is to study the regular reduction theory of regular controlled Hamiltonian (RCH) systems with symplectic structure and symmetry, and this reduction is an extension of regular symplectic reduction theory of Hamiltonian systems under regular controlled Hamiltonian equivalence conditions. Thus, in order to describe uniformly RCH systems defined on a cotangent bundle and on the regular reduced spaces, we first define a kind of RCH systems on a symplectic fiber bundle. Then we introduce regular point and regular orbit reducible RCH systems with symmetry by using momentum map and the associated reduced symplectic forms. Moreover, we give regular point and regular orbit reduction theorems for RCH systems to explain the relationships between RpCH-equivalence, RoCH-equivalence for reducible RCH systems with symmetry and RCH-equivalence for associated reduced RCH systems. Finally, as an application we regard rigid body and heavy top as well as them with internal rotors as the regular point reducible RCH systems on the rotation group SO(3) and on the Euclidean group SE(3), as well as on their generalizations, respectively, and discuss their RCH-equivalence. We also describe the RCH system and RCH-equivalence from the viewpoint of port Hamiltonian system with a symplectic structure.     

Hybrid Control of Digital Baker Map with Application to Pseudo-Random Number Generator

Dynamical degradation occurs when chaotic systems are implemented on digital devices, which seriously threatens the security of chaos-based cryptosystems. The existing solutions mainly focus on the compensation of dynamical properties rather than on the elimination of the inherent biases of chaotic systems. In this paper, a unidirectional hybrid control method is proposed to improve the dynamical properties and to eliminate the biases of digital chaotic maps. A continuous chaotic system is introduced to provide external feedback control of the given digital chaotic map. Three different control modes are investigated, and the influence of control parameter on the properties of the controlled system is discussed. The experimental results show that the proposed method can not only improve the dynamical degradation of the digital chaotic map but also make the controlled digital system produce outputs with desirable performances. Finally, a pseudorandom number generator (PRNG) is proposed. Statistical analysis shows that the PRNG has good randomness and almost ideal entropy values.     

MCMC Control Spreadsheets for Exponential Mixture Estimation

Abstract

This article presents Bayesian inference for exponential mixtures, including the choice of a noninformative prior based on a location-scale reparameterization of the mixture. Adapted control sheets are proposed for studying the convergence of the associated Gibbs sampler. They exhibit a strong lack of stability in the allocations of the observations to the different components of the mixture. The setup is extended to the case when the number of components in the mixture is unknown and a reversible jump MCMC technique is implemented. The results are illustrated on simulations and a real dataset.     

Scaling limits of random bipartite planar maps with a prescribed degree sequence

We study the asymptotic behavior of uniform random maps with a prescribed face‐degree sequence, in the bipartite case, as the number of faces tends to infinity. Under mild assumptions, we show that, properly rescaled, such maps converge in distribution toward the Brownian map in the Gromov–Hausdorff sense. This result encompasses a previous one of Le Gall for uniform random q‐angulations where q is an even integer. It applies also to random maps sampled from a Boltzmann distribution, under a second moment assumption only, conditioned to be large in either of the sense of the number of edges, vertices, or faces. The proof relies on the convergence of so‐called “discrete snakes” obtained by adding spatial positions to the nodes of uniform random plane trees with a prescribed child sequence recently studied by Broutin and Marckert. This paper can alternatively be seen as a contribution to the study of the geometry of such trees.     

Lipschitz-volume rigidity on limit spaces with Ricci curvature bounded from below

We prove a Lipschitz-Volume rigidity theorem for the non-collapsed Gromov–Hausdorff limits of manifolds with Ricci curvature bounded from below. This is a counterpart of the Lipschitz-Volume rigidity in Alexandrov geometry.     

A fast image encryption algorithm based on only blocks in cipher text

In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simul- taneously. The cipher-text image is divided into blocks and each block has k x k pixels, while the pixels of the plain-text are scanned one by one. Four logistic maps are used to generate the encryption key stream and the new place in the cipher image of plain image pixels, including the row and column of the block which the pixel belongs to and the place where the pixel would be placed in the block. After encrypting each pixel, the initial conditions of logistic maps would be changed ac- cording to the encrypted pixel＇s value; after encrypting each row of plain image, the initial condition would also be changed by the skew tent map. At last, it is illustrated that this algorithm has a faster speed, big key space, and better properties in withstanding differential attacks, statistical analysis, known plaintext, and chosen plaintext attacks.     

具有收获和阶段结构的时滞脉冲的捕食-食饵模型

研究了食饵分布在不同斑块,捕食者具有阶段结构和收获的时滞脉冲的捕食-食饵模型.利用离散动力系统的频闪映射,得到了捕食者灭绝周期解的存在性和它的精确表达式.使用比较原理,得到了捕食者灭绝周期解全局渐近稳定的充分条件和系统的持久性.最后,用Matlab软件进行数值仿真验证了获得的结果.