Integrable Duffing’s maps and solutions of the Duffing equation

In the numerical integration of nonlinear differential equations, discretization of the nonlinear terms poses extra ambiguity in reducing the differential equation to a discrete difference equation. As for the cubic nonlinear Schrodinger equation, it was well known that there exists the corresponding discrete soliton system. Here, representing the discrete systems by the mappings, we explore structure of the integrable mappings. We introduce the first kind and the second kind of Duffing’s map, and investigate temporal evolution of the orbits. Although the smooth periodic orbits are in accord with the solutions of the Duffing equation, the integrable Duffing’s maps provide much wider variety of orbits.     

One-to-one piecewise linear mappings over triangulations

We call a piecewise linear mapping from a planar triangulation to the plane a convex combination mapping if the image of every interior vertex is a convex combination of the images of its neighbouring vertices. Such mappings satisfy a discrete maximum principle and we show that they are one-to-one if they map the boundary of the triangulation homeomorphically to a convex polygon. This result can be viewed as a discrete version of the Radó-Kneser-Choquet theorem for harmonic mappings, but is also closely related to Tutte's theorem on barycentric mappings of planar graphs.

     

A discrete time car following model and the bi-parameter logistic map

A discrete time model for car following behaviour is investigated. It is found that the model can be expressed in the form of a logistic map with multiple control parameter values. The case where the logistic map has a bi-value control parameter is investigated and relevant Feigenbaum diagrams are presented and the behaviour of the Lyapunov exponent is investigated. Divergent behaviour in the chain of vehicles is also considered.     

Towards optimal workload-aware XML to relational schema mapping

Storing XML documents in relational databases has drawn much attention in recent years because it can leverage existing investments in relational database technologies. Different algorithms have been proposed to map XML DTD/Schema to relational schema in order to store XML data in relational databases. However, most work defines mapping rules based on heuristics without considering application characteristics, hence fails to produce efficient relational schema for various applications. In this paper, we propose a workload-aware approach to generate relational schema from XML data and user specified workload. Our approach adopts the genetic algorithm to find optimal mappings. An elegant encoding method and related operations are proposed to manipulate mappings using bit strings. Various techniques for optimization can be applied to the XML to relational mapping problem based on this representation. We implemented the proposed algorithm and our experiment results showed that our algorithm was more robust and produced better mappings than existing work.     

On an analogue of parallel translation on Carnot–Carathéodory spaces

A new idea of constructing the parallel translation map on a Carnot–Carathéodory space is proposed, the basic properties of this map are described, and the polynomials approximating graph mappings are qualitatively described.     

Computing quasiconformal maps using an auxiliary metric and discrete curvature flow

Surface mapping plays an important role in geometric processing, which induces both area and angular distortions. If the angular distortion is bounded, the mapping is called a quasiconformal mapping (QC-Mapping). Many surface mappings in our physical world are quasiconformal. The angular distortion of a QC mapping can be represented by the Beltrami differentials. According to QC Teichmüller theory, there is a one-to-one correspondence between the set of Beltrami differentials and the set of QC surface mappings under normalization conditions. Therefore, every QC surface mapping can be fully determined by the Beltrami differential and reconstructed by solving the so-called Beltrami equation. In this work, we propose an effective method to solve the Beltrami equation on general Riemann surfaces. The solution is a QC mapping associated with the prescribed Beltrami differential. The main strategy is to define an auxiliary metric (AM) on the domain surface, such that the original QC mapping becomes conformal under the auxiliary metric. The desired QC-mapping can then be obtained by using the conventional conformal mapping method. In this paper, we first formulate a discrete analogue of QC mappings on triangular meshes. Then, we propose an algorithm to compute discrete QC mappings using the discrete Yamabe flow method. To the best of our knowledge, it is the first work to compute the discrete QC mappings for general Riemann surfaces, especially with different topologies. Numerically, the discrete QC mapping converges to the continuous solution as the mesh grid size approaches to 0. We tested our algorithm on surfaces scanned from real life with different topologies. Experimental results demonstrate the generality and accuracy of our auxiliary metric method.     

A novel image encryption algorithm using chaos and reversible cellular automata

In this paper, a novel image encryption scheme is proposed based on reversible cellular automata (RCA) combining chaos. In this algorithm, an intertwining logistic map with complex behavior and periodic boundary reversible cellular automata are used. We split each pixel of image into units of 4 bits, then adopt pseudorandom key stream generated by the intertwining logistic map to permute these units in confusion stage. And in diffusion stage, two-dimensional reversible cellular automata which are discrete dynamical systems are applied to iterate many rounds to achieve diffusion on bit-level, in which we only consider the higher 4 bits in a pixel because the higher 4 bits carry almost the information of an image. Theoretical analysis and experimental results demonstrate the proposed algorithm achieves a high security level and processes good performance against common attacks like differential attack and statistical attack. This algorithm belongs to the class of symmetric systems.     

The viscosity approximation method for asymptotically nonexpansive mappings in Banach spaces

A recent trend in the iterative methods for constructing fixed points of nonlinear mappings is to use the viscosity approximation technique. The advantage of this technique is that one can find a particular solution to the associated problems, and in most cases this particular solution solves some variational inequality. In this paper, we try to extend this technique to find a particular common fixed point of a finite family of asymptotically nonexpansive mappings in a Banach space which is reflexive and has a weakly continuous duality map. Both implicit and explicit viscosity approximation schemes are proposed and their strong convergence to a solution to a variational inequality is proved.     

On stability and stabilization of some discrete dynamical systems

The paper formulates effective and nonimprovable stability conditions for a linear difference system involving 2 integer delays. The used technique combines algorithm of the discrete D‐decomposition method with some procedures of the polynomial theory. Contrary to the related existing results, the derived conditions are fully explicit with respect to both delays, which enables their simple applicability in various scientific and engineering areas. As an illustration, we show their importance in delayed feedback controls of discrete dynamical systems, with a particular emphasis put on stabilization of unstable steady states of the discrete logistic map.     

Nonlinear effects in a discrete-time dynamic model of a stock market

The time evolution of prices and savings in a stock market is modeled by a discrete time nonlinear dynamical system. The model proposed has a unique and unstable steady-state, so that the time evolution is determined by the nonlinear effects acting out of the equilibrium. The nonlinearities strongly influence the kind of long-run dynamics of the system. In particular, the global geometric properties of the noninvertible map of the plane, whose iteration gives the evolution of the system, are important to understand the global bifurcations which change the qualitative properties of the asymptotic dynamics. Such global bifurcations are studied by geometric and numerical methods based on the theory of critical curves, a powerful tool for the characterization of the global dynamical properties of noninvertible mappings of the plane. The model unfolds more complex chaotic and unpredictable trajectories as a consequence of increasing agents' “speculative” or “capital gain realizing” attitudes. The global analysis indicates that, for some ranges of the parameter values, the system has several coexisting attractors, and it may not be robust with respect to exogenous shocks due to the complexity of the basins of attraction.     

多边形网格上扩散方程新的单调格式

 本文在星形多边形网格上, 构造了扩散方程新的单调有限体积格式.该格式与现有的基于非线性两点流的单调格式的主要区别是, 在网格边的法向流离散模板中包含当前边上的点, 在推导离散法向流的表达式时采用了定义于当前边上的辅助未知量, 这样既可适应网格几何大变形, 同时又兼顾了当前网格边上物理量的变化. 在光滑解情形证明了离散法向流的相容性.对于具有强各向异性、非均匀张量扩散系数的扩散方程, 证明了新格式是单调的, 即格式可以保持解析解的正性. 数值结果表明在扭曲网格上, 所构造的格式是局部守恒和保正的, 对光滑解有高于一阶的精度, 并且, 针对非平衡辐射限流扩散问题, 数值结果验证了新格式在计算效率和守恒精度上优于九点格式.     

A discrete method of optimal control based upon the cell state space concept

A discrete method of optimal control is proposed in this paper. The continuum state space of a system is discretized into a cell state space, and the cost function is discretized in a similar manner. Assuming intervalwise constant controls and using a finite set of admissible control levels (u) and a finite set of admissible time intervals (), the motion of the system under all possible interval controls (u, ) can then be expressed in terms of a family of cell-to-cell mappings. The proposed method extracts the optimal control results from these mappings by a systematic search, culminating in the construction of a discrete optimal control table.The possibility of expressing the optimal control results in the form of a control table seems to give this method a means to make systems real-time controllable.Dedicated to G. LeitmannThe material is based upon work supported by the National Science Foundation under Grant No. MEA-82-17471. The author is also indebted to Professor G. Leitmann for his many helpful comments.     

关于连续区间映射的敏感依赖性

首先证明:若区间映射f是敏感依赖的,则f的拓扑熵ent(f)>0.然后通过引入一种扩张映射进一步证明了敏感依赖的区间映射的拓扑熵的下确界为0,即,上式中拓扑熵的下界0是最优的.最后通过实例展示稠混沌、Spatio-temporal混沌、Li-Yorke敏感及敏感性之间是几乎互不蕴含的.     

A family of integrable differential–difference equations,its bi-Hamiltonian structure and binary nonlinearization of the Lax pairs and adjoint Lax pairs

A family of integrable differential–difference equations is derived by the method of Lax pairs. A discrete Hamiltonian operator involving two arbitrary real parameters is introduced. When the parameters are suitably selected, a pair of discrete Hamiltonian operators is presented. Bi-Hamiltonian structure of obtained family is established by discrete trace identity. Then, Liouville integrability for the obtained family is proved. Ultimately, through the binary nonlinearization of the Lax pairs and adjoint Lax pairs, every differential–difference equation in obtained family is factored by an integrable symplectic map and a finite-dimensional integrable system in Liouville sense.     

Approximation and optimization of Darboux type differential inclusions with set-valued boundary conditions

The present paper is devoted to an optimal control problem given by hyperbolic discrete (P _D ) and differential inclusions (P _C ) of generalized Darboux type and ordinary discrete inclusions. The results are extended to non-convex problems. An approach concerning necessary and sufficient conditions for optimality is proposed. In order to formulate sufficient conditions of optimality for problem (P _C ) the approximation method is used. Formulation of these conditions is based on locally adjoint mappings. Moreover for construction of adjoint partial differential inclusions the equivalence theorems of locally adjoint mappings are proved. One example with homogeneous boundary conditions is considered.     

An image encryption scheme based on quantum logistic map

The topic of quantum chaos has begun to draw increasing attention in recent years. While a satisfactory definition for it is not settled yet in order to differentiate between its classical counterparts. Dissipative quantum maps can be characterized by sensitive dependence on initial conditions, like classical maps. Considering this property, an implementation of image encryption scheme based on the quantum logistic map is proposed. The security and performance analysis of the proposed image encryption is performed using well-known methods. The results of the reliability analysis are encouraging and it can be concluded that, the proposed scheme is efficient and secure. The results of this study also suggest application of other quantum maps such as quantum standard map and quantum baker map in cryptography and other aspects of security and privacy.     

Centre Manifold Reduction for Quasilinear Discrete Systems

Summary. We study the dynamics of quasilinear mappings in Hilbert spaces in the neighbourhood of a fixed point. The linearized map is a closed unbounded operator and thus the initial value problem is ill-posed. Under suitable spectral assumptions, we show that all solutions staying in some neighbourhood of the fixed point lie on an invariant centre manifold. We apply this result to the study of time-periodic oscillations of a class of infinite one-dimensional Hamiltonian lattices. In this context, our approach provides a mathematically justified and corrected version of the rotating-wave approximation method. The equations are viewed as recurrence relations in the discrete space coordinate, where the fixed point corresponds to the oscillators at rest. These problems yield finite-dimensional centre manifolds and thus can be locally reduced to the study of finite-dimensional mappings. In particular, we consider the Fermi-Pasta-Ulam (FPU) lattice, which describes a chain of nonlinearly coupled particles. When the frequency of solutions is close to the highest normal mode frequency, the reduction yields a two-dimensional reversible mapping. For interaction potentials satisfying a hardening condition, the reduced mapping admits homoclinic orbits to 0 which correspond to FPU ``breathers' (time-periodic and spatially localized oscillations).     

Controlling predator-prey discrete dynamics utilizing a threshold policy with hysteresis

This paper introduces a threshold policy with hysteresis (TPH) for the control of the logistic one-species model, the Lotka-Volterra and Rosenzweig-MacArthur two species density-dependent predator-prey models. A nonstandard scheme is used for the discretization of the models since it results in preservation of the qualitative characteristics of the continuous-time models. Two theorems that establish the global stability of the discrete logistic model subject to the threshold policy (TP) and the TPH are proved. The proposed policy (TPH) is more realistic than a pure threshold policy (TP) proposed earlier in the literature and changes the dynamics of the system in such a way that a low amplitude bounded oscillation, far from the extinction region, is achieved. Furthermore, it can be designed by a suitable choice of so called virtual equilibrium points in a simple and intuitive manner.     

Regular conjugate classes in some groups of flows

This paper investigates the structure of the set of the so-called regular conjugate classes in the group of mappings of a paracompact Hausdorff space into a connected simply connected compact Lie group. The paper establishes the existence of two parameters, one continuous and the other discrete, which together completely determine this set. In the special case when the Lie group is taken to be the group SU(2) the problem is of interest for physics and was proposed by L. D. Faddeev.     

A stream cipher based on a spatiotemporal chaotic system

A stream cipher based on a spatiotemporal chaotic system is proposed. A one-way coupled map lattice consisting of logistic maps is served as the spatiotemporal chaotic system. Multiple keystreams are generated from the coupled map lattice by using simple algebraic computations, and then are used to encrypt plaintext via bitwise XOR. These make the cipher rather simple and efficient. Numerical investigation shows that the cryptographic properties of the generated keystream are satisfactory. The cipher seems to have higher security, higher efficiency and lower computation expense than the stream cipher based on a spatiotemporal chaotic system proposed recently.