2,312 publications from this institution
A new testing method for measurement of dynamic back stress for fatigue-creep interaction with predominant creep at high mean stress is developed according to the principle of dropped stress creep. A series of dropped stress creep tests were performed repeatedly until an unlimited extensive incubation with zero creep rate at a given dropped stress occurred. The stress causing zero creep rate is defined as fatigue-creep dynamic back stress. The developed method was used successfully to measure the dynamic back stress for fatigue-creep interaction with predominant creep. The dynamic effective stress could yield a better description of the strain rate equation for the fatigue-creep interaction at high mean stress. Mean stress plays a predominant role in determining fatigue-creep strain rate.
In this article, three-dimensional autonomous chaotic systems with two quadratic terms, similar to the Lorenz system in their algebraic forms, are studied. An attractor with two clearly distinguishable scrolls similar to the Lorenz attractor is referred to as a Lorenz-like attractor, while an attractor with more intertwine between the two scrolls similar to the Chen attractor is referred to as a Chen-like attractor. A gallery of Lorenz-like attractors and Chen-like attractors are presented. For several different families of such systems, through tuning only one real parameter gradually, each of them can generate a spectrum of chaotic attractors continuously changing from a Lorenz-like attractor to a Chen-like attractor. Some intrinsic relationships between the Lorenz system and the Chen system are revealed and discussed. Some common patterns of the Lorenz-like and Chen-like attractors are found and analyzed, which suggest that the instability of the two saddle-foci of such a system somehow determines the shape of its chaotic attractor. These interesting observations on the general dynamic patterns hopefully could shed some light for a better understanding of the intrinsic relationships between the algebraic structures and the geometric attractors of these kinds of chaotic systems.
The amount of publicly accessible experimental data has gradually increased in recent years, which makes it possible to reconsider many longstanding questions in neuroscience. In this paper, an efficient framework is presented for reconstructing functional connectivity using experimental spike-train data. A modified generalized linear model ( GLM ) with L1-norm penalty was used to investigate 10 datasets. These datasets contain spike-train data collected from the entorhinal-hippocampal region in the brains of rats performing different tasks. The analysis shows that entorhinal-hippocampal network of well-trained rats demonstrated significant small-world features. It is found that the connectivity structure generated by distance-dependent models is responsible for the observed small-world features of the reconstructed networks. The models are utilized to simulate a subset of units recorded from a large biological neural network using multiple electrodes. Two metrics for quantifying the small-world-ness both suggest that the reconstructed network from the sampled nodes estimates a more prominent small-world-ness feature than that of the original unknown network when the number of recorded neurons is small. Finally, this study shows that it is feasible to adjust the estimated small-world-ness results based on the number of neurons recorded to provide a more accurate reference of the network property.
We propose a new active queue management (AQM) scheme to improve the performance of the well-known random early detection (RED) AQM. The new AQM is based on the proportional derivative (PD) control principle, and we call it PD-RED. In PD-RED we introduce minimal changes to RED. We demonstrate the improvement in performance of PD-RED over adaptive RED AQM by simulations.
No abstract is provided for this article.
No abstract is provided for this article.
This technical note studies the consensus problem for cooperative agents with nonlinear dynamics in a directed network. Both local and global consensus are defined and investigated. Techniques for studying the synchronization in such complex networks are exploited to establish various sufficient conditions for reaching consensus. The local consensus problem is first studied via a combination of the tools of complex analysis, local consensus manifold approach, and Lyapunov methods. A generalized algebraic connectivity is then proposed to study the global consensus problem in strongly connected networks and also in a broad class of networks containing spanning trees, for which ideas from algebraic graph theory, matrix theory, and Lyapunov methods are utilized.
This paper is concerned with delayed generalized 2D discrete logistic systems of the form , where σ and τ are positive integers, is a real function, which contains the logistic map as a special case, and m and n are nonnegative integers, where and . Some sufficient conditions for this system to be stable and exponentially stable are derived.
Based on a stream encryption scheme with avalanche effect (SESAE), a stream encryption scheme with both key avalanche effect and plaintext avalanche effect (SESKPAE) is introduced. Using this scheme and an ideal [Formula: see text]-word ([Formula: see text]-segment) pseudorandom number generator (PRNG), a plaintext can be encrypted such that each bit of the ciphertext block has a change with the probable probability of [Formula: see text] when any word of the key is changed or any bit of the plaintext is changed. To that end, a novel four-dimensional discrete chaotic system (4DDCS) is proposed. Combining the 4DDCS with a generalized synchronization (GS) theorem, a novel eight-dimensional discrete GS chaotic system (8DDGSCS) is constructed. Using the 8DDGSCS, a [Formula: see text]-word chaotic pseudorandom number generator (CPRNG) is designed. The keyspace of the [Formula: see text]-word CPRNG is larger than [Formula: see text]. Then, the FIPS 140-2 test suit/generalized FIPS 140-2 test suit is used to test the randomness of the 1000-key streams consisting of 20[Formula: see text]000 bits generated by the [Formula: see text]-word CPRNG, the RC4 algorithm PRNG and the ZUC algorithm PRNG, respectively. The test results show that for the three PRNGs, there are 100%/98.9%, 99.9%/98.8%, 100%/97.9% key streams passing the tests, respectively. Furthermore, the SP800-22 test suite is used to test the randomness of four 100-key streams consisting of 1000[Formula: see text]000 bits generated by four PRNGs, respectively. The numerical results show that the randomness performances of the [Formula: see text]-word CPRNG is promising, showing that there are no significant correlations between the key streams and the perturbed key streams generated via the [Formula: see text]-word CPRNG. Finally, using the [Formula: see text]-word CPRNG and the SESKPAE to encrypt two gray-scale images, test results demonstrate that the [Formula: see text]-word CPRNG is able to generate both key avalanche effect and plaintext avalanche effect, which are similar to those generated via an ideal CPRNG, and performs better than other comparable schemes.
We apply some successful digital redesign techniques, developed previously for the control of linear system, to controlling the nonlinear chaotic Chua's circuit. Chua's circuit is a simple autonomous physical device that exhibits very rich and complex nonlinear dynamics of bifurcation and chaos, and is hence very sensitive to digital controls. To apply advanced high-speed computer technology to the implementation, we show how to redesign a good digital controller, based on an existing successful analog controller, for controlling the chaotic trajectories of Chua's circuit, from anywhere within the chaotic attractor to a predesired unstable limit cycle of the circuit.
A new approach to real-time digital secure speech communication is proposed based on the inversion theory of nonlinear discrete-time dynamical systems. The proposed approach uses an observable minimal-phase nonlinear discrete-time dynamical system, particularly with chaotic zero-dynamics, as the drive system to generate encrypted message signals for transmission. The receiver is the minimal left-inverse system of the drive system with the capability of synchronization. The receiver decrypts the received signal, recovers the original message in real-time. The effectiveness of the proposed approach and design is demonstrated via several examples for secure speech signals transmission. Performance evaluation of the designed secure communication system is discussed. Both analysis and simulation show that the new scheme is secure, simple, accurate and robust.
The idea of using a one-time-one-key design has been widely applied in conventional cryptography. With the security theory of conventional cryptology, encryption algorithms are made public while all the secrets are encoded only in the keys. This paper applies chaos theory to conventional cryptography to develop a one-time-one-algorithm design. A general theory is given to generate the clock key, substitution box, permutation box and operational sign functions for a one-time-one-algorithm scheme. This scheme is then implemented in a system to manage the tradeoff between speed and the security of the encryption algorithm.
