Fault‐tolerant mixed /passive synchronization for delayed chaotic neural networks with sampled‐data control

This article is concerned with the fault‐tolerant mixed /passive synchronization problem for chaotic neural networks by sampled‐data control scheme. The objective is focused on the design of a reliable controller such that the mixed /passivity performance level of the resulting synchronization error system is ensured in the presence of actuator failures. A time‐dependent Lyapunov functional and an improved reciprocally convex approach combined with a novel integral inequality are applied to optimize the availability of the information on the actual sampling pattern. Then, some sufficient conditions of mixed /passivity performance analysis for the synchronization error systems are derived. A desired reliable sampled‐data controller is designed by solving the optimization problems. Finally, to demonstrate the effectiveness of the proposed method, a practical chaotic neural networks is provided. © 2015 Wiley Periodicals, Inc. Complexity 21: 246–259, 2016     

Robust sampled‐data H∞ control for mechanical systems

This article addresses the issue of robust sampled‐data control for a class of uncertain mechanical systems with input delays and linear fractional uncertainties which appear in all the mass, damping, and stiffness matrices. Then, a novel Lyapunov–Krasovskii functional is constructed to obtain sufficient conditions under which the uncertain mechanical system is robustly, asymptotically stable with disturbance attenuation level about its equilibrium point for all admissible uncertainties. More precisely, Schur complement and Jenson's integral inequality are utilized to substantially simplify the derivation of the main results. In particular, a set of sampled‐data controller is designed in terms of the solution of certain linear matrix inequalities that can be solved effectively using available MATLAB software. Finally, a numerical example with simulation result is provided to show the effectiveness and less conservativeness of the proposed sampled‐data control scheme. © 2014 Wiley Periodicals, Inc. Complexity 20: 19–29, 2015     

Static output‐feedback control for interval type‐2 discrete‐time fuzzy systems

This article investigates the problem of reliable mixed control for discrete‐time interval type‐2 (IT2) fuzzy model‐based systems via static output‐feedback (SOF) control method. The number of fuzzy rules and the membership functions for the SOF controller are different from those for the plant. A sufficient criterion of reliable stability with mixed performance is derived for the closed‐loop system with sensor failure. The SOF controller is designed for two different cases (known sensor failure case and unknown sensor failure case) to guarantee the reliable stability with mixed performance. Moreover, novel criteria are presented to obtain the optical performance for the closed‐loop system. Finally, an example is used to verify the effectiveness of the proposed design scheme. © 2014 Wiley Periodicals, Inc. Complexity 21: 74–88, 2016     

Defining synergy thermodynamically using quantitative measurements of entropy and free energy

Synergy is often defined as the creation of a whole that is greater than the sum of its parts. It is found at all levels of organization in physics, chemistry, biology, social sciences, and the arts. Synergy occurs in open irreversible thermodynamic systems making it difficult to quantify. Negative entropy or negentropy ( ) has been related to order and complexity, and so has work efficiency, information content, Gibbs Free Energy in equilibrium thermodynamics, and useful work efficiency in general ( ). To define synergy in thermodynamic terms, we use the quantitative estimates of changes in and in seven different systems that suffer process described as synergistic. The results show that synergistic processes are characterized by an increase in coupled to an increase in . Processes not associated to synergy show a different pattern. The opposite of synergy are dissipative processes such as combustion where both and decrease. The synergistic processes studied showed a relatively greater increase in compared to opening ways to quantify energy—or information—dissipation due to the second law of thermodynamics in open irreversible systems. As a result, we propose a precise thermodynamic definition of synergy and show the potential of thermodynamic measurements in identifying, classifying and analysing in detail synergistic processes. © 2016 Wiley Periodicals, Inc. Complexity 21: 235–242, 2016     

Decentralized Piecewise Fuzzy Output Feedback Control for Large‐Scale Nonlinear Systems with Time‐Varying Delay

This article addresses the decentralized output feedback control for discrete‐time large‐scale nonlinear systems. The considered large‐scale system contains several subsystems with nonlinear interconnection and time‐varying delay, and Takagi–Sugeno model is used to represent each nonlinear subsystem. We aim at designing a decentralized piecewise fuzzy memory dynamic‐output‐feedback (DOF) controller that guarantees the stabilization and performance of the resulting closed‐loop control system. First, we propose a model transformation that reformulates the problem of decentralized output feedback control into the stability analysis with input–output form. Then, we introduce a piecewise Lyapunov–Krasovskii functional, where all Lyapunov matrices are not necessarily positive definite. By combining with the scaled small gain theorem, the less conservative solution to the problem of decentralized piecewise fuzzy memory DOF controller design for the considered system is derived in terms of linear matrix inequalities. The advantage of the proposed method is finally validated using two numerical examples. © 2016 Wiley Periodicals, Inc. Complexity 21: 268–288, 2016     

Finite‐time l2 − l∞ synchronization for discrete‐time nonlinear chaotic systems via information‐constrained delayed feedback

This article is concerned with the problem of finite‐time synchronization control for a class of discrete‐time nonlinear chaotic systems under unreliable communication links. Our aim is to design a delayed feedback controller such that the resulting synchronization error system is stochastically finite‐time bounded with a guaranteed performance level over a finite time interval. Some sufficient conditions for the solvability of the above problem are established. A delayed feedback control scheme involving constrained information about the past state is presented. Finally, the Fold chaotic system is used to demonstrate the effectiveness of our proposed approach. © 2014 Wiley Periodicals, Inc. Complexity 21: 138–146, 2015     

synchronization of coupled reaction‐diffusion neural networks with mixed delays

The reaction‐diffusion neural network is often described by semilinear diffusion partial differential equation (PDE). This article focuses on the asymptotical synchronization and synchronization for coupled reaction‐diffusion neural networks with mixed delays (that is, discrete and infinite distributed delays) and Dirichlet boundary condition. First, using the Lyapunov–Krasoviskii functional scheme, the sufficient condition is obtained for the asymptotical synchronization of coupled semilinear diffusion PDEs with mixed time‐delays and this condition is represented by linear matrix inequalities (LMIs), which is easy to be solved. Then the robust synchronization is considered in temporal‐spatial domain for the coupled semilinear diffusion PDEs with mixed delays and external disturbances. In terms of the technique of completing squares, the sufficient condition is obtained for the robust synchronization. Finally, a numerical example of coupled semilinear diffusion PDEs with mixed time‐delays is given to illustrate the correctness of the obtained results. © 2016 Wiley Periodicals, Inc. Complexity 21: 42–53, 2016     

Quantized control for polynomial fuzzy discrete‐time systems

This article investigates the control problem for polynomial fuzzy discrete‐time systems. Signal quantization is considered in this article. To deal with this issue, a logarithmic quantizer is adopted to quantize the control signal. First, a novel method is first proposed to model polynomial fuzzy discrete‐time systems and handle the quantized control problem of the systems. Second, based on Lyapunov‐stability theory, sufficient conditions are obtained in terms of sum of squares to guarantee the asymptotical stability of the systems and satisfy a performance. Finally, a simulation example is given to illustrate the effectiveness of the proposed results. © 2014 Wiley Periodicals, Inc. Complexity 21: 325–332, 2015     

Nonfragile H∞ filtering for wireless‐networked systems with energy constraint

This article is concerned with the nonfragile filtering for wireless‐networked systems with energy constraint. To achieve the energy‐efficient goal, the local measurement is first sampled by nonuniform sampling, then we only choose one measurement to transmit it to the remote filter. In the filter design, the random occurring filter gain variation problem is taken into account. A new stochastic switched system model is presented to capture the nonuniform sampling, the measurement size reduction, and the random filter gain phenomena. Based on the switched system approach, stochastic system analysis, and Lyapunov stability theory, a sufficient condition is presented such that the filtering error system is exponentially stable in the mean‐square sense and a prescribed performance level is also guaranteed. The effectiveness of the proposed new method is illustrated by a simulation example. © 2015 Wiley Periodicals, Inc. Complexity 21: 79–89, 2016     

Scouting the Mandelbrot set with memory

An exploratory study is made on the dynamics of the map defining the Mandelbrot set endowed with memory (m) of past iterations, that is, , . © 2014 Wiley Periodicals, Inc. Complexity 21: 84–96, 2016     

H∞ stochastic synchronization for master–slave semi‐Markovian switching system via sliding mode control

In this article, synchronization problem of master–slave system with phase‐type semi‐Markovian switching is investigated via sliding mode control scheme. By utilizing a supplementary variable technique and a plant transformation, the master–slave semi‐Markovian switching system can be equivalently expressed as its associated Markovian switching system. Then an integral sliding surface is constructed to guarantee stochastic synchronization of master–slave semi‐Markovian switching system, and the suitable controller is synthesized to ensure that the trajectory of the closed‐loop error system can be driven onto the prescribed sliding mode surface. Finally, numerical simulations are presented to show the effectiveness of the proposed sliding‐mode design scheme. © 2015 Wiley Periodicals, Inc. Complexity 21: 430–441, 2016     

On ‐null sequences and their relatives

Let and , where is the conjugate index of p. We prove an omnibus theorem, which provides numerous equivalences for a sequence in a Banach space X to be a ‐null sequence. One of them is that is ‐null if and only if is null and relatively ‐compact. This equivalence is known in the “limit” case when , the case of the p‐null sequence and p‐compactness. Our approach is more direct and easier than those applied for the proof of the latter result. We apply it also to characterize the unconditional and weak versions of ‐null sequences.     

On the Enumeration of ‐Optimal and Minimax‐Optimal k‐Circulant Supersaturated Designs

In recent years, several methods have been proposed for constructing ‐optimal and minimax‐optimal supersaturated designs (SSDs). However, until now the enumeration problem of such designs has not been yet considered. In this paper, ‐optimal and minimax‐optimal k‐circulant SSDs with 6, 10, 14, 18, 22, and 26 runs, factors and are enumerated in a computer search. We have also enumerated all ‐optimal and minimax‐optimal k‐circulant SSDs with (mod 4) and . The computer search utilizes the fact that theses designs are equivalent to certain 1‐rotational resolvable balanced incomplete block designs. Combinatorial properties of these resolvable designs are used to restrict the search space.     

From Bolzano‐Weierstraß to Arzelà‐Ascoli

We show how one can obtain solutions to the Arzelà‐Ascoli theorem using suitable applications of the Bolzano‐Weierstraß principle. With this, we can apply the results from 10 and obtain a classification of the strength of instances of the Arzelà‐Ascoli theorem and a variant of it. Let be the statement that each equicontinuous sequence of functions contains a subsequence that converges uniformly with the rate and let be the statement that each such sequence contains a subsequence which converges uniformly but possibly without any rate. We show that is instance‐wise equivalent, over , to the Bolzano‐Weierstraß principle and that is instance‐wise equivalent, over , to , and thus to the strong cohesive principle (). Moreover, we show that over the principles , and are equivalent.     

Flag‐Transitive 2‐ Symmetric Designs with Sporadic Socle

Let be a nontrivial 2‐ symmetric design admitting a flag‐transitive, point‐primitive automorphism group G of almost simple type with sporadic socle. We prove that there are up to isomorphism six designs, and must be one of the following: a 2‐(144, 66, 30) design with or , a 2‐(176, 50, 14) design with , a 2‐(176, 126, 90) design with or , or a 2‐(14,080, 12,636, 11,340) design with .     

Large ‐ or ‐Minors in 3‐Connected Graphs

There are numerous results bounding the circumference of certain 3‐connected graphs. There is no good bound on the size of the largest bond (cocircuit) of a 3‐connected graph, however. Oporowski, Oxley, and Thomas (J Combin Theory Ser B 57 (1993), 2, 239–257) proved the following result in 1993. For every positive integer k, there is an integer such that every 3‐connected graph with at least n vertices contains a ‐ or ‐minor. This result implies that the size of the largest bond in a 3‐connected graph grows with the order of the graph. Oporowski et al. obtained a huge function iteratively. In this article, we first improve the above authors' result and provide a significantly smaller and simpler function . We then use the result to obtain a lower bound for the largest bond of a 3‐connected graph by showing that any 3‐connected graph on n vertices has a bond of size at least . In addition, we show the following: Let G be a 3‐connected planar or cubic graph on n vertices. Then for any , G has a ‐minor with , and thus a bond of size at least .     

Solitary wave solutions of coupled boussinesq equation

This article presents the general case‐study of our previous works regarding generalized Boussinesq equations [17, 18, 19], that focus on application of various subordinate methods where are applied to construct more general exact solutions of the coupled Boussinesq equations. In this article, the ‐expansion method is applied on coupled Boussinesq equations. Our work is motivated by the fact that the ‐expansion method provides not only more general forms of solutions but also periodic, solitary waves, and rational solutions. The method appears to be easier and faster by means of a symbolic manipulation program. © 2016 Wiley Periodicals, Inc. Complexity 21: 151–155, 2016     

Matching energy of unicyclic and bicyclic graphs with a given diameter

Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let G be a simple graph of order n and be the roots of its matching polynomial. The ME of G is defined to be the sum of the absolute values of . In this article, we characterize the graphs with minimal ME among all unicyclic and bicyclic graphs with a given diameter d. © 2014 Wiley Periodicals, Inc. Complexity 21: 224–238, 2015     

k‐Kings in k‐Quasitransitive Digraphs

Let D be a digraph with vertex set and arc set . A vertex x is a k‐king of D, if for every , there is an ‐path of length at most k. A subset N of is k‐independent if for every pair of vertices , we have and ; it is l‐absorbent if for every there exists such that . A ‐kernel of D is a k‐independent and l‐absorbent subset of . A k‐kernel is a ‐kernel. A digraph D is k‐quasitransitive, if for any path of length k, x₀ and are adjacent. In this article, we will prove that a k‐quasitransitive digraph with has a k‐king if and only if it has a unique initial strong component and the unique initial strong component is not isomorphic to an extended ‐cycle where each has at least two vertices. Using this fact, we show that every strong k‐quasitransitive digraph has a ‐kernel.