On passivity and passification of stochastic fuzzy systems with delays: The discrete-time case

Copyright [2010] 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.Takagi–Sugeno (T-S) fuzzy models, which are usually represented by a set of linear submodels, can be used to describe or approximate any complex nonlinear systems by fuzzily blending these subsystems, and so, significant research efforts have been devoted to the analysis of such models. This paper is concerned with the passivity and passification problems of the stochastic discrete-time T-S fuzzy systems with delay. We first propose the definition of passivity in the sense of expectation. Then, by utilizing the Lyapunov functional method, the stochastic analysis combined with the matrix inequality techniques, a sufficient condition in terms of linear matrix inequalities is presented, ensuring the passivity performance of the T-S fuzzy models. Finally, based on this criterion, state feedback controller is designed, and several criteria are obtained to make the closed-loop system passive in the sense of expectation. The results acquired in this paper are delay dependent in the sense that they depend on not only the lower bound but also the upper bound of the time-varying delay. Numerical examples are also provided to demonstrate the effectiveness and feasibility of our criteria.This work was supported in part by the Royal Society Sino–British Fellowship Trust Award of the U.K., by the National Natural Science Foundation of China under Grant 60804028, by the Specialized Research Fund for the Doctoral Program of Higher Education for New Teachers in China under Grant 200802861044, and by the Teaching and Research Fund for Excellent Young Teachers at Southeast University of China

Synchronization of coupled neutral-type neural networks with jumping-mode-dependent discrete and unbounded distributed delays

This is the post-print version of the Article. The official published version can be accessed from the links below - Copyright @ 2013 IEEE.In this paper, the synchronization problem is studied for an array of N identical delayed neutral-type neural networks with Markovian jumping parameters. The coupled networks involve both the mode-dependent discrete-time delays and the mode-dependent unbounded distributed time delays. All the network parameters including the coupling matrix are also dependent on the Markovian jumping mode. By introducing novel Lyapunov-Krasovskii functionals and using some analytical techniques, sufficient conditions are derived to guarantee that the coupled networks are asymptotically synchronized in mean square. The derived sufficient conditions are closely related with the discrete-time delays, the distributed time delays, the mode transition probability, and the coupling structure of the networks. The obtained criteria are given in terms of matrix inequalities that can be efficiently solved by employing the semidefinite program method. Numerical simulations are presented to further demonstrate the effectiveness of the proposed approach.This work was supported in part by the Royal Society of the U.K., the National Natural Science Foundation of China under Grants 61074129, 61174136 and 61134009, and the Natural Science Foundation of Jiangsu Province of China under Grants BK2010313 and BK2011598

Robust synchronization for 2-D discrete-time coupled dynamical networks

This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, a new synchronization problem is addressed for an array of 2-D coupled dynamical networks. The class of systems under investigation is described by the 2-D nonlinear state space model which is oriented from the well-known Fornasini–Marchesini second model. For such a new 2-D complex network model, both the network dynamics and the couplings evolve in two independent directions. A new synchronization concept is put forward to account for the phenomenon that the propagations of all 2-D dynamical networks are synchronized in two directions with influence from the coupling strength. The purpose of the problem addressed is to first derive sufficient conditions ensuring the global synchronization and then extend the obtained results to more general cases where the system matrices contain either the norm-bounded or the polytopic parameter uncertainties. An energy-like quadratic function is developed, together with the intensive use of the Kronecker product, to establish the easy-to-verify conditions under which the addressed 2-D complex network model achieves global synchronization. Finally, a numerical example is given to illustrate the theoretical results and the effectiveness of the proposed synchronization scheme.This work was supported in part by the National Natural Science Foundation of China under Grants 61028008 and 61174136, the International Science and Technology Cooperation Project of China under Grant No. 2009DFA32050, the Natural Science Foundation of Jiangsu Province of China under Grant BK2011598, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

Robust synchronization of an array of coupled stochastic discrete-time delayed neural networks

Copyright [2008] 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.This paper is concerned with the robust synchronization problem for an array of coupled stochastic discrete-time neural networks with time-varying delay. The individual neural network is subject to parameter uncertainty, stochastic disturbance, and time-varying delay, where the norm-bounded parameter uncertainties exist in both the state and weight matrices, the stochastic disturbance is in the form of a scalar Wiener process, and the time delay enters into the activation function. For the array of coupled neural networks, the constant coupling and delayed coupling are simultaneously considered. We aim to establish easy-to-verify conditions under which the addressed neural networks are synchronized. By using the Kronecker product as an effective tool, a linear matrix inequality (LMI) approach is developed to derive several sufficient criteria ensuring the coupled delayed neural networks to be globally, robustly, exponentially synchronized in the mean square. The LMI-based conditions obtained are dependent not only on the lower bound but also on the upper bound of the time-varying delay, and can be solved efficiently via the Matlab LMI Toolbox. Two numerical examples are given to demonstrate the usefulness of the proposed synchronization scheme

Sound speed of a Bose-Einstein condensate in an optical lattice

The speed of sound of a Bose-Einstein condensate in an optical lattice is studied both analytically and numerically in all three dimensions. Our investigation shows that the sound speed depends strongly on the strength of the lattice. In the one-dimensional case, the speed of sound falls monotonically with increasing lattice strength. The dependence on lattice strength becomes much richer in two and three dimensions. In the two-dimensional case, when the interaction is weak, the sound speed first increases then decreases as the lattice strength increases. For the three dimensional lattice, the sound speed can even oscillate with the lattice strength. These rich behaviors can be understood in terms of compressibility and effective mass. Our analytical results at the limit of weak lattices also offer an interesting perspective to the understanding: they show the lattice component perpendicular to the sound propagation increases the sound speed while the lattice components parallel to the propagation decreases the sound speed. The various dependence of the sound speed on the lattice strength is the result of this competition.Comment: 15pages 6 figure

An extended Kalman filtering approach to modeling nonlinear dynamic gene regulatory networks via short gene expression time series

Copyright [2009] 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, the extended Kalman filter (EKF) algorithm is applied to model the gene regulatory network from gene time series data. The gene regulatory network is considered as a nonlinear dynamic stochastic model that consists of the gene measurement equation and the gene regulation equation. After specifying the model structure, we apply the EKF algorithm for identifying both the model parameters and the actual value of gene expression levels. It is shown that the EKF algorithm is an online estimation algorithm that can identify a large number of parameters (including parameters of nonlinear functions) through iterative procedure by using a small number of observations. Four real-world gene expression data sets are employed to demonstrate the effectiveness of the EKF algorithm, and the obtained models are evaluated from the viewpoint of bioinformatics

Bidirectional optimization of the melting spinning process

This is the author's accepted manuscript (under the provisional title "Bi-directional optimization of the melting spinning process with an immune-enhanced neural network"). The final published article is available from the link below. Copyright 2014 @ IEEE.A bidirectional optimizing approach for the melting spinning process based on an immune-enhanced neural network is proposed. The proposed bidirectional model can not only reveal the internal nonlinear relationship between the process configuration and the quality indices of the fibers as final product, but also provide a tool for engineers to develop new fiber products with expected quality specifications. A neural network is taken as the basis for the bidirectional model, and an immune component is introduced to enlarge the searching scope of the solution field so that the neural network has a larger possibility to find the appropriate and reasonable solution, and the error of prediction can therefore be eliminated. The proposed intelligent model can also help to determine what kind of process configuration should be made in order to produce satisfactory fiber products. To make the proposed model practical to the manufacturing, a software platform is developed. Simulation results show that the proposed model can eliminate the approximation error raised by the neural network-based optimizing model, which is due to the extension of focusing scope by the artificial immune mechanism. Meanwhile, the proposed model with the corresponding software can conduct optimization in two directions, namely, the process optimization and category development, and the corresponding results outperform those with an ordinary neural network-based intelligent model. It is also proved that the proposed model has the potential to act as a valuable tool from which the engineers and decision makers of the spinning process could benefit.National Nature Science Foundation of China, Ministry of Education of China, the Shanghai Committee of Science and Technology), and the Fundamental Research Funds for the Central Universities

The Luminosity - E_p Relation within Gamma--Ray Bursts and Implications for Fireball Models

Using a sample of 2408 time-resolved spectra for 91 BATSE gamma-ray bursts (GRBs) presented by Preece et al., we show that the relation between the isotropic-equivalent luminosity (L_iso) and the spectral peak energy (E_p) in the cosmological rest frame, L_iso \propto E_p^2, not only holds within these bursts, but also holds among these GRBs, assuming that the burst rate as a function of redshift is proportional to the star formation rate. The possible implications of this relation for the emission models of GRBs are discussed. We suggest that both the kinetic-energy-dominated internal shock model and the magnetic-dissipation-dominated external shock model can well interpret this relation. We constrain the parameters for these two models, and find that they are in a good agreement with the parameters from the fittings to the afterglow data (abridged).Comment: 3 pages plus 5 figures, emulateapj style, accepted for publication in ApJ Letter