2,312 publications from this institution
This paper presents a single‐layer perceptron (SLP) scheme with an impulse activation function (IAF) and a dynamic neuron (DN) with a trapezoidal activation function (TAF). Combining with some interesting properties of the offset levels, it is shown that many linearly non‐separable Boolean functions can be realized by using only one SLPwIAF or one DNwTAF. In the present work, a few appropriate IAF and TAF are adopted, and the inverse offset level method is used for the design of the SLPwIAF synaptic weights and the DNwTAF templates. The XOR and NXOR Boolean operations with two inputs and all 152 non‐separable Boolean functions with three inputs can be easily implemented by one SLPwIAF or one DNwTAF. Finally, the entire set of 152 DNwTAF templates associated with 152 non‐separable Boolean functions of three inputs is completely listed. Copyright © 2008 John Wiley & Sons, Ltd.
This paper proposes a new switching control method, saturated function series approach, for generating multi-scroll chaotic attractors. The systematic methodology developed here can create multi-scroll chaotic attractors from a given 3-D linear autonomous system with a saturated function series controller. It includes 1-D n-scroll, 2-D n /spl times/ m-grid scroll, and 3-D n /spl times/ m /spl times/ l-grid scroll chaotic attractors. The chaos generation mechanism in multi-scroll systems is briefly discussed by analyzing the system equilibria.
This article introduces a new chaotic system of three-dimensional quadratic autonomous ordinary differential equations, which can display (i) two 1-scroll chaotic attractors simultaneously, with only three equilibria, and (ii) two 2-scroll chaotic attractors simultaneously, with five equilibria. Several issues such as some basic dynamical behaviors, routes to chaos, bifurcations, periodic windows, and the compound structure of the new chaotic system are then investigated, either analytically or numerically. Of particular interest is the fact that this chaotic system can generate a complex 4-scroll chaotic attractor or confine two attractors to a 2-scroll chaotic attractor under the control of a simple constant input. Furthermore, the concept of generalized Lorenz system is extended to a new class of generalized Lorenz-like systems in a canonical form. Finally, the important problems of classification and normal form of three-dimensional quadratic autonomous chaotic systems are formulated and discussed.
In this paper, some results on fuzzy regulation and fuzzy modeling are presented for synchronization of chaotic systems described by Takagi–Sugeno (TS) fuzzy models using linear local controllers. It is shown that the synchronization error is bounded if the local controller can be appropriately designed, and that such an error is independent of initial conditions. This feature allows synchronizing not only similar chaotic systems but, under certain conditions, different chaotic systems can be synchronized as well. In other words, this approach can be used to obtain either complete or generalized synchronization. Several simulations are carried out to illustrate how the problem can be solved in a practical way by using the linear matrix inequalities (LMI) technique.
No abstract is provided for this article.
A new chaotic communication scheme based on generalized chaotic synchronization (GCS) and hash function transpositions is presented. The communication scheme has nonsymmetric secrete keys and its ability is similar to traditional digital signatures, i.e. a receiver can convince himself whether or not the sender's message contents have been modified. As a direct application of the scheme, a GCS system is designed by using Chen's chaotic circuit and is studied in some detail. The numerical simulation shows that this Chen GCS system has high security and is fast and reliable for secure Internet communications.
No abstract is provided for this article.
In this paper, we investigate global synchronization in an array of linearly coupled identical delayed neural networks. We consider the array with an arbitrary coupling matrix without assuming it to be symmetric, irreducible and diffusive. Moreover, we consider the array being connected through two different coupling schemes, state-coupling and output-coupling, respectively. For state-coupling, we derive a more general sufficient condition ensuring global synchronization, which is an extension of some existing results in the literature. For output-coupling, we derive a new sufficient condition for global synchronization. Numerical simulations are given to illustrate the theoretical results.
This brief introduces a quantitative measure of the robustness of network controllability, and presents an empirical comparison on 6 network models, i.e., random-graph network, scale-free network, multiplex concurrence network, q-snapback network, random triangle network, and random rectangle network, against 6 different attacks, i.e., betweenness-based and degree-based, random and targeted, node-removal, and edge-removal attacks, showing the overall good performances of the multi-ring structure in networks.
In this paper, we present a class of 3-D unstable dissipative systems, which are stable in two components but unstable in the other one. This class of systems is motivated by whirls, comprised of switching subsystems, which yield strange attractors from the combination of two unstable “one-spiral” trajectories by means of a switching rule. Each one of these trajectories moves around two hyperbolic saddle equilibrium points. Both theoretical and numerical results are provided for verification and demonstration.
This book offers an elementary and self-contained introduction to many fundamental issues concerning approximate solutions of operator equations formulated in an abstract Banach space setting, including important topics such as solvability, computational schemes, convergence stability and error estimates. The operator equations under investigation include various linear and nonlinear types of ordinary and partial differential equations, integral equations and abstract evolution equations, which are frequently involved in applied mathematics and engineering applications. Chapter 1 gives an overview of a general projective approximation scheme for operator equations, which covers several well-known approximation methods as special cases, such as the Galerkin-type methods, collocation-like methods, and least-square-based methods. Chapter 2 discusses approximate solutions of compact linear operator equations, and chapter 3 studies both classical and generalized solutions, as well as the projective approximations, for general linear operator equations. Chapter 4 gives an introduction to some important concepts, such as the topological degree and the fixed point principle, with applications to projective approximations of nonlinear operator equations. Linear and nonlinear monotone operator equations and their projective approximators are investigated in chapter 5, while chapter 6 addresses basic questions in discrete and semi-discrete projective approximations for two important classes of abstract operator evolution equations. Each chapter contains well-selected examples and exercises, for the purposes of demonstrating the fundamental theories and methods developed in the text and familiarizing the reader with functional analysis techniques useful for numerical solutions of various operator equations.
In this paper, we discuss a generalization of the OGY chaos control method based on the invariant manifold theory. This control methodology can deal with higher order chaotic systems in the same spirit of the OGY method. The effectiveness of the methodology will be tested by controlling the third order Rossler chaos.
