The Cohomology of Transitive Lie Algebroids

For a transitive Lie algebroid A on a connected manifold M and its a representation on a vector bundle F, we study the localization map Y^1: H^1(A,F)-> H^1(L_x,F_x), where L_x is the adjoint algebra at x in M. The main result in this paper is that: Ker Y^1_x=Ker(p^{1*})=H^1_{deR}(M,F_0). Here p^{1*} is the lift of H^1(\huaA,F) to its counterpart over the universal covering space of M and H^1_{deR}(M,F_0) is the F_0=H^0(L,F)-coefficient deRham cohomology. We apply these results to study the associated vector bundles to principal fiber bundles and the structure of transitive Lie bialgebroids.Comment: 17pages, no figure

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 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

Exponential filtering for uncertain Markovian jump time-delay systems with nonlinear disturbances

Copyright [2004] 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, we study the robust exponential filter design problem for a class of uncertain time-delay systems with both Markovian jumping parameters and nonlinear disturbances. The jumping parameters considered here are generated from a continuous-time discrete-state homogeneous Markov process, and the parameter uncertainties appearing in the state and output equations are real, time dependent, and norm bounded. The time-delay and the nonlinear disturbances are assumed to be unknown. The purpose of the problem under investigation is to design a linear, delay-free, uncertainty-independent state estimator such that, for all admissible uncertainties as well as nonlinear disturbances, the dynamics of the estimation error is stochastically exponentially stable in the mean square, independent of the time delay. We address both the filtering analysis and synthesis issues, and show that the problem of exponential filtering for the class of uncertain time-delay jump systems with nonlinear disturbances can be solved in terms of the solutions to a set of linear (quadratic) matrix inequalities. A numerical example is exploited to demonstrate the usefulness of the developed theory

Nonlinear filtering for state delayed systems with Markovian switching

Copyright [2003] 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 deals with the filtering problem for a general class of nonlinear time-delay systems with Markovian jumping parameters. The nonlinear time-delay stochastic systems may switch from one to the others according to the behavior of a Markov chain. The purpose of the problem addressed is to design a nonlinear full-order filter such that the dynamics of the estimation error is guaranteed to be stochastically exponentially stable in the mean square. Both filter analysis and synthesis problems are investigated. Sufficient conditions are established for the existence of the desired exponential filters, which are expressed in terms of the solutions to a set of linear matrix inequalities (LMIs). The explicit expression of the desired filters is also provided. A simulation example is given to illustrate the design procedures and performances of the proposed method

Mathematical problems for complex networks

Copyright @ 2012 Zidong Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This article is made available through the Brunel Open Access Publishing Fund.Complex networks do exist in our lives. The brain is a neural network. The global economy is a network of national economies. Computer viruses routinely spread through the Internet. Food-webs, ecosystems, and metabolic pathways can be represented by networks. Energy is distributed through transportation networks in living organisms, man-made infrastructures, and other physical systems. Dynamic behaviors of complex networks, such as stability, periodic oscillation, bifurcation, or even chaos, are ubiquitous in the real world and often reconfigurable. Networks have been studied in the context of dynamical systems in a range of disciplines. However, until recently there has been relatively little work that treats dynamics as a function of network structure, where the states of both the nodes and the edges can change, and the topology of the network itself often evolves in time. Some major problems have not been fully investigated, such as the behavior of stability, synchronization and chaos control for complex networks, as well as their applications in, for example, communication and bioinformatics