2,312 publications from this institution
Dynamical behaviors of a three-dimensional autonomous chaotic system with two double-scroll attractors are studied. Some basic properties such as bifurcation, routes to chaos, periodic windows and compound structure are demonstrated with various numerical examples. System equilibria and their stabilities are discussed, and chaotic features of the attractors are justified numerically.
This paper constructs a $t_{r}$-norm and a $t_{r}$-conorm on the set of all normal and convex functions from ${[0, 1]}$ to ${[0, 1]}$, which are not obtained by using the following two formulas on binary operations ${\curlywedge}$ and ${\curlyvee}$: $$ {(f\curlywedge g)(x)=\sup\left\{f(y)\ast g(z)\mid y\vartriangle z=x\right\},} $$ $$ {(f\curlyvee g)(x)=\sup\left\{f(y)\ast g(z)\mid y\ \triangledown\ z=x\right\},} $$ where ${f, g\in Map([0, 1], [0, 1])}$, ${\vartriangle}$ and ${\triangledown}$ are respectively a ${t}$-norm and a ${t}$-conorm on ${[0, 1]}$, and ${\ast}$ is a binary operation on ${[0, 1]}$. {\color{blue}This result answers affirmatively an open problem posed in \cite{HCT2015}. Moreover, the duality between $t_r$-norms and $t_r$-conorms is obtained by the introduction of operations dual to binary operations on ${Map([0, 1], [0, 1])}$.}
In this article, a quantum analogue of a classical chaotic system is constructed, using the Chen system and a generalized Lorenz system as an example. It is shown that if a classical system in R3 has a chaotic attractor, then a corresponding quantized system can be obtained by the density matrix theory in quantum mechanics. Furthermore, a direct transformation can be used to ensure that the basin of attraction contains the unit Bloch ball with the attractor located in its interior. As an application, a natural model for the Chen qubit is constructed and then extended to the generalized Lorenz qubit. Moreover, the Chen qutrit model is established.
Traditional image encryption methods typically make a trade-off between privacy protection and visual usability. To address this issue, a novel thumbnail-preserving encryption scheme is proposed based on a hybrid of decimal and binary pixel values in three pixel groups, utilizing the excellent dynamic characteristics of a generalized coupled logistic map. Theoretically, it is proved that the core algorithm of this scheme is sum-preserving. Experimentally, it is demonstrated that this scheme not only excels in efficiency and resistance to attacks, effectively safeguarding image privacy, but also retains high-quality thumbnails after encryption, achieving both objectives of image privacy protection and visual usability.
Many complex networks possess a scale-free vertex-degree distribution in a power-law form of ck(-γ), where k is the vertex-degree variable and c and γ are constants. To better understand the mechanism of the power-law formation in scale-free networks, it is important to understand and analyze their vertex-degree sequences. We had shown before that, for a scale-free network of size N, if its vertex-degree sequence is k1 <k2<⋯<kl, where {k1,k2,...,kl} is the set of all non-equal vertex degrees in the network, and if its power exponent satisfies γ>1, then the length l of the vertex-degree sequence is of order log N. In the present paper, we further study complex networks with a more general vertex-degree distribution, not restricted to the power-law, and prove that the same conclusion holds as well. In addition, we verify the new result by real data from a large number of real-world examples. We finally discuss some potential applications of the new finding in various fields of science, technology, and society.
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> In this paper, we cast the design of<formula formulatype="inline"><tex>$\Delta$</tex> </formula>-modulated control of a high-order system into the study of control Lyapunov functions. We classify the complex dynamics of the closed-loop system in three cases. In the first case, we show how <formula formulatype="inline"> <tex>$\Delta$</tex></formula>-modulated feedback introduces a finite set of globally attracting periodic points. We find the numbers and periods of all possible such periodic orbits. In addition, we characterize the attracting region for each of such periodic points. In the second case, we show that there is a maximal "stabilizable" region, and inside this region, there is a local attractor. In the last case, we show that all the states stabilizable by the <formula formulatype="inline"><tex>$\Delta$</tex></formula>-modulated feedback constitute a Cantor set. This Cantor set is a repeller, and the closed-loop system is chaotic on the Cantor set. </para>
This article addresses the rigidity recovery problem of a formation controlled over an undirected sensing framework after a link is broken. In the formation control problem, mobile agents are controlled individually such that all interagent distances remain unchanged. The control law used by each agent is designed based on the relative positions of that agent to its neighbors, sensed in its local coordinate system. When the sensing graph is rigid, it has been shown that one can design a distributed control law to guarantee the stability of the formation. However, obtaining sensing measurements is a challenge in the formation control, since these systems are always subjected to sensing constraints, such as line-of-sight requirements and power limitations. This clearly affects the rigidity of the sensing graph, thus affecting the formation. This article proposes an online distributed algorithm based on the lattice of configurations to recover the distance-based controlled formation when a failure in a sensing link causes the network to lose its rigidity. The approach is to recover the rigidity of subframeworks of the formation, i.e., the subframework established by each node and its neighbors within the sensing range, by adding new sensing links locally so as to ensure a rigid formation. This article also proposes a multilayer rigidity recovery technique using a combination of sensing and communication networks, when the lattice of configurations fails due to a lack of neighbors for an agent. An upper bound is established on the delay in this indirect distance-measuring approach, which guarantees the tolerance of the formation against link failures. Simulations on a sample formation support the theoretical results.
In this paper, we analyze the stability of nonlinear fuzzy PI (proportional-integral) control systems. The fuzzy PI controller involved is actually a nonlinear adaptive PI controller whose gains change continuously with output of the processes under control. We have employed the "small gain theorem" to obtain a simple sufficient condition for the global asymptotic stability of the nonlinear fuzzy PI control systems. In addition, we have proven that in a conventional PI control system, if the linear PI controller is replaced by the nonlinear fuzzy PI controller, then the stability of the resulting control system remains unchanged. This result is true no matter the given process is linear or not. We have also derived explicit formulas for the computation of the fuzzy PI controller parameters, using only the proportional and integral gains of the corresponding linear PI controller.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No abstract is provided for this article.
No abstract is provided for this article.