Bounded H∞ synchronization and state estimation for discrete time-varying stochastic complex for discrete time-varying stochastic complex networks over a finite horizon

Copyright [2011] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, new synchronization and state estimation problems are considered for an array of coupled discrete time-varying stochastic complex networks over a finite horizon. A novel concept of bounded H∞ synchronization is proposed to handle the time-varying nature of the complex networks. Such a concept captures the transient behavior of the time-varying complex network over a finite horizon, where the degree of bounded synchronization is quantified in terms of the H∞-norm. A general sector-like nonlinear function is employed to describe the nonlinearities existing in the network. By utilizing a timevarying real-valued function and the Kronecker product, criteria are established that ensure the bounded H∞ synchronization in terms of a set of recursive linear matrix inequalities (RLMIs), where the RLMIs can be computed recursively by employing available MATLAB toolboxes. The bounded H∞ state estimation problem is then studied for the same complex network, where the purpose is to design a state estimator to estimate the network states through available output measurements such that, over a finite horizon, the dynamics of the estimation error is guaranteed to be bounded with a given disturbance attenuation level. Again, an RLMI approach is developed for the state estimation problem. Finally, two simulation examples are exploited to show the effectiveness of the results derived in this paper.This work was supported in part by the Engineering and Physical Sciences Research Council of U.K. under Grant GR/S27658/01, the National Natural Science Foundation of China under Grant 61028008 and Grant 60974030, the National 973 Program of China under Grant 2009CB320600, the International Science and Technology Cooperation Project of China under Grant 2009DFA32050, and the Alexander von Humboldt Foundation of Germany

A delay-dependent LMI approach to dynamics analysis of discrete-time recurrent neural networks with time-varying delays

This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Elsevier Ltd.In this Letter, the analysis problem for the existence and stability of periodic solutions is investigated for a class of general discrete-time recurrent neural networks with time-varying delays. For the neural networks under study, a generalized activation function is considered, and the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. By employing the latest free-weighting matrix method, an appropriate Lyapunov–Krasovskii functional is constructed and several sufficient conditions are established to ensure the existence, uniqueness, and globally exponential stability of the periodic solution for the addressed neural network. The conditions are dependent on both the lower bound and upper bound of the time-varying time delays. Furthermore, the conditions are expressed in terms of the linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. Two simulation examples are given to show the effectiveness and less conservatism of the proposed criteria.This work was supported in part by the National Natural Science Foundation of China under Grant 50608072, an International Joint Project sponsored by the Royal Society of the UK and the National Natural Science Foundation of China, and the Alexander von Humboldt Foundation of Germany

An improved neural network model for the two-page crossing number problem

The simplest graph drawing method is that of putting the vertices of a graph on a line and drawing the edges as half-circles either above or below the line. Such drawings are called 2-page book drawings. The smallest number of crossings over all 2-page drawings of a graph G is called the 2-page crossing number of G. Cimikowski and Shope have solved the 2-page crossing number problem for an n-vertex and m-edge graph by using a Hopfield network with 2m neurons. We present here an improved Hopfield modelwith m neurons. The new model achieves much better performance in the quality of solutions and is more efficient than the model of Cimikowski and Shope for all graphs tested. The parallel time complexity of the algorithm, without considering the crossing number calculations, is O(m), for the new Hopfield model with m processors clearly outperforming the previous algorithm

Stability Analysis of Delayed Genetic Regulatory Networks via a Relaxed Double Integral Inequality

Time delay arising in a genetic regulatory network may cause the instability. This paper is concerned with the stability analysis of genetic regulatory networks with interval time-varying delays. Firstly, a relaxed double integral inequality, named as Wirtinger-type double integral inequality (WTDII), is established to estimate the double integral term appearing in the derivative of Lyapunov-Krasovskii functional with a triple integral term. And it is proved theoretically that the proposed WTDII is tighter than the widely used Jensen-based double inequality and the recently developed Wiringter-based double inequality. Then, by applying the WTDII to the stability analysis of a delayed genetic regulatory network, together with the usage of useful information of regulatory functions, several delay-range- and delay-rate-dependent (or delay-rate-independent) criteria are derived in terms of linear matrix inequalities. Finally, an example is carried out to verify the effectiveness of the proposed method and also to show the advantages of the established stability criteria through the comparison with some literature

Lag synchronization of switched neural networks via neural activation function and applications in image encryption

This paper investigates the problem of global exponential lag synchronization of a class of switched neural networks with time-varying delays via neural activation function and applications in image encryption. The controller is dependent on the output of the system in the case of packed circuits, since it is hard to measure the inner state of the circuits. Thus, it is critical to design the controller based on the neuron activation function. Comparing the results, in this paper, with the existing ones shows that we improve and generalize the results derived in the previous literature. Several examples are also given to illustrate the effectiveness and potential applications in image encryption

Toward non-conservative stability conditions for equilibrium points of genetic networks with SUM regulatory functions

An important problem in systems biology consists of establishing whether an equilibrium point of a genetic regulatory network is stable. This paper investigates this problem for genetic networks with SUMregulatory functions. It is shown that a sufficient condition for global asymptotical stability of an equilibrium point of these networks can be derived in terms of convex optimizations with LMI constraints by exploiting polynomial Lyapunov functions and SOS techniques. This condition is interesting because does not introduce approximations of the nonlinearities present in the genetic regulatory network, and the conservatism can be decreased by increasing the degree of the involved polynomials. ©2009 IEEE.published_or_final_versionThe Joint 48th IEEE Conference on Decision and Control and the 28th Chinese Control Conference (CDC/CCC 2009), Shanghai, China, 16-18 December 2009. In Proceedings of the IEEE Conference on Decision and Control, 2009, p. 5631-563

Stability and dissipativity analysis of static neural networks with time delay

This paper is concerned with the problems of stability and dissipativity analysis for static neural networks (NNs) with time delay. Some improved delay-dependent stability criteria are established for static NNs with time-varying or time-invariant delay using the delay partitioning technique. Based on these criteria, several delay-dependent sufficient conditions are given to guarantee the dissipativity of static NNs with time delay. All the given results in this paper are not only dependent upon the time delay but also upon the number of delay partitions. Some examples are given to illustrate the effectiveness and reduced conservatism of the proposed results.published_or_final_versio