Hierarchy of rational order families of chaotic maps with an invariant measure

We introduce an interesting hierarchy of rational order chaotic maps that possess an invariant measure. In contrast to the previously introduced hierarchy of chaotic maps [1–5], with merely entropy production, the rational order chaotic maps can simultaneously produce and consume entropy. We compute the Kolmogorov-Sinai entropy of these maps analytically and also their Lyapunov exponent numerically, where the obtained numerical results support the analytical calculations.     

Space–Time Chaos,Critical Phenomena,and Bifurcations of Solutions of Infinite-Dimensional Systems of Ordinary Differential Equations

We study infinite-dimensional systems of ordinary differential equations having applications in some popular and important physical problems. The appearance of infinite-dimensional space–time chaos is considered, namely, the bifurcations and critical phenomena that occur in the phase space of the systems and explain some physical problems are described.     

A Simple Chaotic Circuit with Impulsive Switch Depending on Time and State

This paper presents a simple chaotic circuit consisting of two capacitors, one linear two-port VCCS and one time-state-controlled impulsive switch. The impulsive switch causes rich chaotic and periodic behavior. The circuit dynamics can be simplified into a one-dimensional return map that is piecewise linear and piecewise monotone. Using the return map, we clarify parameter conditions for existence of chaotic and periodic attractors and coexistence state of attractors.     

Applications of interval arithmetic in solving polynomial equations by Wu''''s elimination method

Wu's elimination method is an important method for solving multivariate poly- nomial equations.In this paper,we apply interval arithmetic to Wu's method and convert the problem of solving polynomial equations into that of solving interval polynomial equa- tions.Parallel results such as zero-decomposition theorem are obtained for interval poly- nomial equations.The advantages of the new approach are two-folds:First,the problem of the numerical instability arisen from floating-point arithmetic is largely overcome.Second, the low efficiency of the algorithm caused by large intermediate coefficients introduced by exact compaction is dramatically improved.Some examples are provided to illustrate the effectiveness of the proposed algorithm.     

Chromatic Uniqueness of the Complement of T_m(l, 4, m - 6)

In the paper, we prove that the complement of Tm(1,4,m - 6)(m > 10) is chromatically unique if and only if m ≠5k(k ≥ 2).     

Atomistic phenomena in dense fluid shock waves

The shock structure problem is one of the classical problems of fluid mechanics and at least for non-reacting dilute gases it has been considered essentially solved. Here we present a few recent findings, to show that this is not the case. There are still new physical effects to be discovered provided that the numerical technique is general enough to not rule them out a priori. While the results have been obtained for dense fluids, some of the effects might also be observable for shocks in dilute gases.     

混沌经济学——混沌与分形

本文给出作为混沌经济学的数学基础的混沌与分形的简短介绍 .     

Predicting vibration signals of automobile engine using chaos theory

Condition monitoring and life prediction of the vehicle engine is an important and urgent problem during the vehicle development process. The vibration signals that are closely associated with the engine running condition and its development trend are complex and nonlinear. The chaos theory is used to treat the nonlinear dynamical system recently. A novel chaos method in conjunction with SVD (singular value decomposition)denoising skill are used to predict the vibration time series. Two types of time series and their prediction errors are provided to illustrate the practical utility of the method.     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.