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     

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     

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     

Fault‐tolerant sampled‐data mixed ℋ∞ and passivity control of stochastic systems and its application

This article addresses the problem of fault‐tolerant sampled‐data mixed and passivity control for a class of stochastic system with actuator failures, where the plant is modeled as a continuous‐time one and the control inputs are implemented as discrete‐time signals. Sufficient conditions for the reliable sampled‐data mixed and passivity performance control law is established for the considered systems by constructing an appropriate Lyapunov–Krasovskii functional together with the Newton–Leibniz formula and free‐weighting matrix technique. More precisely, linear matrix inequality based sampled‐data methodology is employed to design the mixed and passivity formation controller to reject the impact of the formation changes being treated as disturbances. Simulation studies are performed based on the flight control model to verify the stability, performance, and effectiveness of the proposed design strategy. © 2015 Wiley Periodicals, Inc. Complexity 21: 420–429, 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     

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     

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     

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     

The threshold for combs in random graphs

For let denote the tree consisting of an ‐vertex path with disjoint ‐vertex paths beginning at each of its vertices. An old conjecture says that for any the threshold for the random graph to contain is at . Here we verify this for with any fixed . In a companion paper, using very different methods, we treat the complementary range, proving the conjecture for (with ). © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 794–802, 2016     

On Martin's Axiom and Forms of Choice

Martin's Axiom is the statement that for every well‐ordered cardinal , the statement holds, where is “if is a c.c.c. quasi order and is a family of dense sets in P, then there is a ‐generic filter of P”. In , the fragment is provable, but not in general in . In this paper, we investigate the interrelation between and various choice principles. In the choiceless context, it makes sense to drop the requirement that the cardinal κ be well‐ordered, and we can define for any (not necessarily well‐ordered) cardinal the statement to be “if is a c.c.c. quasi order with , and is a family of dense sets in P, then there is a ‐generic filter of P”. We then define to be the statement that for every (not necessarily well‐ordered) cardinal , we have that holds. We then investigate the set‐theoretic strength of the principle .     

On the set‐theoretic strength of the existence of disjoint cofinal sets in posets without maximal elements

In set theory without the Axiom of Choice , we study the deductive strength of the statements (“Every partially ordered set without a maximal element has two disjoint cofinal subsets”), (“Every partially ordered set without a maximal element has a countably infinite disjoint family of cofinal subsets”), (“Every linearly ordered set without a maximum element has two disjoint cofinal subsets”), and (“Every linearly ordered set without a maximum element has a countably infinite disjoint family of cofinal subsets”). Among various results, we prove that none of the above statements is provable without using some form of choice, is equivalent to , + (Dependent Choices) implies , does not imply in (Zermelo‐Fraenkel set theory with the Axiom of Extensionality modified in order to allow the existence of atoms), does not imply in (Zermelo‐Fraenkel set theory minus ) and (hence, ) is strictly weaker than in .     

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     

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     

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     

Semiframes with Block Size Three and Odd Group Size

A ‐semiframe of type is a ‐GDD of type , , in which the collection of blocks can be written as a disjoint union where is partitioned into parallel classes of and is partitioned into holey parallel classes, each holey parallel class being a partition of for some . A ‐SF is a ‐semiframe of type in which there are p parallel classes in and d holey parallel classes with respect to . In this paper, we shall show that there exists a (3, 1)‐SF for any if and only if , , , and .     

Set Systems with L‐Intersections and k‐Wise L‐Intersecting Families

In this paper, by employing linear algebra methods we obtain the following main results:

• (i) Let and be two disjoint subsets of such that Suppose that is a family of subsets of such that for every pair and for every i. Then Furthermore, we extend this theorem to k‐wise L‐intersecting and obtain the corresponding result on two cross L‐intersecting families. These results show that Snevily's conjectures proposed by Snevily (2003) are true under some restricted conditions. This result also gets an improvement of a theorem of Liu and Hwang (2013).
• (ii) Let p be a prime and let and be two subsets of such that or and Suppose that is a family of subsets of [n] such that (1) for every pair (2) for every i. Then This result improves the existing upper bound substantially.

     

State estimation for complex networks with randomly varying nonlinearities and sensor failures

The current study is focused on the state estimator design for the discrete‐time complex networks with sensor failures and randomly varying nonlinearities. Bernoulli process is adopted to describe the randomly varying nonlinearities, and the norm‐bounded uncertain model is used to deal with the sensor failures. Then, a set of sufficient conditions are provided to guarantee that the estimation error system is stochastically stable with the prescribed property. Then, using the linear matrix inequality method, the estimator gains are obtained. Finally, the effectiveness of the proposed new design method is illustrated through a numerical example. © 2016 Wiley Periodicals, Inc. Complexity 21: 507–517, 2016     

A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

For a multigraph G, the integer round‐up of the fractional chromatic index provides a good general lower bound for the chromatic index . For an upper bound, Kahn 1996 showed that for any real there exists a positive integer N so that whenever . We show that for any multigraph G with order n and at least one edge, ). This gives the following natural generalization of Kahn's result: for any positive reals , there exists a positive integer N so that + c whenever . We also compare the upper bound found here to other leading upper bounds.     

Circular Chromatic Indices of Regular Graphs

The circular chromatic index of a graph G, written , is the minimum r permitting a function such that whenever e and are adjacent. It is known that for any , there is a 3‐regular simple graph G with . This article proves the following results: Assume is an odd integer. For any , there is an n‐regular simple graph G with . For any , there is an n‐regular multigraph G with .     

Opinion dynamics with the contrarian deterministic effect and human mobility on lattice

Opinion dynamics under the influence of the contrarian deterministic effect and human mobility on the two‐dimensional lattice is studied. In the model, the opinion is a binary variable and some shortcuts are added with the adding probability P_s. At each time step, each agent with shortcuts is chosen as the mobile one with the mobility probability P_m and moves to one of his immobile neighbors along shortcuts randomly. Then, the immobile agents update their opinions based on the majority rule with p_f, which is the Fermi function of the interaction noise T due to the contrarian deterministic effect. We find that some appropriate interaction noise T enhances the formation of community around T_c. And human mobility enhances the formation of community when , where T_c is equal to the average degree and independent of the network size N and the mobility probability P_m through the theoretical and numerical analysis. Furthermore, we also find that the system with larger degree and the self‐feedback of agent have stronger robustness in the opinion formation with the contrarian deterministic effect. © 2014 Wiley Periodicals, Inc. Complexity 20: 43–49, 2015