Inspired by the concept of DNA sequence in biological systems, we developed a novel learning algorithm named DNA-like learning, which is enable to quickly train the CNN template (or named CNN gene) implementing linearly separable Boolean function (LSBF). This algorithm has many advantages including in particular faster running speed and better robustness, and without the need to consider its convergence property. For example, the "AND" and "OR" operations only needs 6 iterations and computations by using the algorithm, compared to the error-correction algorithm which needs 20 operations for the same task, and for judging and implementing a 9-bit linearly separable Boolean function can be finished within only one second on a program based on the new algorithm.
No abstract is provided for this article.
A simple three-dimensional (3D) autonomous chaotic system is extended to four-dimensions so as to generate richer nonlinear dynamics. The new system not only inherits the dynamical characteristics of its parental 3D system but also exhibits many new and complex dynamics, including assembled 1-scroll, 2-scroll and 4-scroll attractors, as well as hyperchaotic attractors, by simply tuning a single system parameter. Lyapunov exponents and bifurcation diagrams are obtained via numerical simulations to further justify the existences of chaos and hyperchaos. Finally, an electronic circuit is constructed to implement the system, with experimental and simulation results presented and compared for demonstration and verification.
This paper investigates the generalized matrix projective synchronization problem of general colored networks with different-dimensional node dynamics. A general colored network consists of colored nodes and edges, where the dimensions of colored node dynamics can be different in addition to the difference of the inner coupling matrices between any pair of nodes. For synchronizing a colored network onto a desired orbit with respect to the given matrices, open-plus-closed-loop controllers are designed. The closed-loop controllers are chosen as adaptive feedback and intermittent controllers, respectively. Based on the Lyapunov stability theory and mathematical induction, corresponding synchronization criteria are derived. Noticeably, many existing synchronization settings can be regarded as special cases of the present synchronization framework. Numerical simulations are provided to verify the theoretical results.
This paper studies feedback control of limit cycle amplitudes in nonlinear systems. A graphical approach to bifurcation control is first briefly introduced, followed by the derivation of a nonlinear control law. Then, a suitable implementation of the design is developed via an approximation of the time-derivative term in the nonlinear state feedback controller. A classical model is finally simulated for illustration of the proposed control method.
A linear model of recurrent neural networks, called the Elman networks, is combined with the simple nonlinear modulo (mod) operation on its linear activated function so as to generate chaos purposely. Conditions on the weight matrix are obtained, under which the generated chaos satisfies the mathematical definition of chaos in the sense of T.Y. Li and J.A. Yorke (1975). Some simple and representative weight matrices are constructed for designing such Elman networks that can generate Li-Yorke chaos. Several numerical simulations are shown to verify and visualize the design.
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.
A conventional PI+D controller is a practical structure of PID typed controllers, widely used in industry and mechatronic applications. In addition, many fuzzy control-based versions, embracing the linear structure of the conventional PI+D controller, have been designed and implemented. Although there are many reports proving a superior performance of these fuzzy versions over the conventional ones, there is still argument over the trade-off between the simplicity and the effectiveness with regard to the implementation as "pros and cons" for these two types of controllers. To help clarify these concerned issues, the paper presents a detailed study on comparison of conventional PI+D controller versus a fuzzy PI+D controller in the case of a subsystem failure. Simulations on an induction AC motor are carried out as part of the investigation. In case of failure in the feedforward path of the PI control subsystem, the finding shows that the conventional controller fails to perform whereas the fuzzy controller remains working very well.
No abstract is provided for this article.
Each chapters ends with a problem set Fuzzy Set Theory: Classical Set Theory Fuzzy Set Theory Interval Arithmetic Operations on Fuzzy Sets: Fuzzy Logic Theory Classical Logic Theory The Boolean Algebra Multi-Valued Logic Fuzzy Logic and Approximate Reasoning Fuzzy Relations Some Applications of Fuzzy Logic Product Quality Evaluation Decision Making for Investment Performance Evaluation Miscellaneous Examples Fuzzy Rule Base and Fuzzy Modeling Fuzzy Rule Base Fuzzy Modeling Fuzzy Control Systems Classical Programmable Logic Control Fuzzy Logic Control: A General Model-Free Approach Fuzzy PID Control Systems Conventional PID Controllers Fuzzy PID Controllers (Type 1) Fuzzy PID Controllers (Type 2) Fuzzy PID Controllers: Stability Analysis Computational Verb Fuzzy Controllers Computational Verbs and Verb Numbers Verb Rules and Verb Inference Computational Verb-Based Fuzzy PID Controllers References Solutions Index...
In recent years secret permutations have been widely used for protecting different types of multimedia data, including speech files, digital images and videos. Based on a general model of permutation-only multimedia ciphers, this paper performs a quantitative cryptanalysis on the performance of these kind of ciphers against plaintext attacks. When the plaintext is of size M × N and with L different levels of values, the following quantitative cryptanalytic findings have been concluded under the assumption of a uniform distribution of each element in the plaintext: (1) all permutation-only multimedia ciphers are practically insecure against known/chosen-plaintext attacks in the sense that only O ( log L ( MN ) ) known/chosen plaintexts are sufficient to recover not less than (in an average sense) half elements of the plaintext; (2) the computational complexity of the known/chosen-plaintext attack is only O ( n · ( MN ) 2 ) , where n is the number of known/chosen plaintexts used. When the plaintext has a non-uniform distribution, the number of required plaintexts and the computational complexity is also discussed. Experiments are given to demonstrate the real performance of the known-plaintext attack for a typical permutation-only image cipher.
Based on the mechanism for the generation of chaos in a buck converter, a pole placement method is proposed and applied to controlling the chaos in a circuit. The control circuit is designed and tested. Numerical calculation and circuit implementation demonstrate the validity of this chaos control method.
