Quantized passive filtering for switched delayed neural networks

The issue of quantized passive filtering for switched delayed neural networks with noise interference is studied in this paper. Both arbitrary and semi-Markov switching rules are taken into account. By choosing Lyapunov functionals and applying several inequality techniques, sufficient conditions are proposed to ensure the filter error system to be not only exponentially stable, but also exponentially passive from the noise interference to the output error. The gain matrix for the proposed quantized passive filter is able to be determined through the feasible solution of linear matrix inequalities, which are computationally tractable with the help of some popular convex optimization tools. Finally, two numerical examples are given to illustrate the usefulness of the quantized passive filter design methods

LMI Approach to Exponential Stability and Almost Sure Exponential Stability for Stochastic Fuzzy Markovian-Jumping Cohen-Grossberg Neural Networks with Nonlinear p-Laplace Diffusion

The robust exponential stability of delayed fuzzy Markovian-jumping Cohen-Grossberg neural networks (CGNNs) with nonlinear p-Laplace diffusion is studied. Fuzzy mathematical model brings a great difficulty in setting up LMI criteria for the stability, and stochastic functional differential equations model with nonlinear diffusion makes it harder. To study the stability of fuzzy CGNNs with diffusion, we have to construct a Lyapunov-Krasovskii functional in non-matrix form. But stochastic mathematical formulae are always described in matrix forms. By way of some variational methods in W1,p(Ω), Itô formula, Dynkin formula, the semi-martingale convergence theorem, Schur Complement Theorem, and LMI technique, the LMI-based criteria on the robust exponential stability and almost sure exponential robust stability are finally obtained, the feasibility of which can efficiently be computed and confirmed by computer MatLab LMI toolbox. It is worth mentioning that even corollaries of the main results of this paper improve some recent related existing results. Moreover, some numerical examples are presented to illustrate the effectiveness and less conservatism of the proposed method due to the significant improvement in the allowable upper bounds of time delays

Finite-time anti-synchronization of multi-weighted coupled neural networks with and without coupling delays

The multi-weighted coupled neural networks (MWCNNs) models with and without coupling delays are investigated in this paper. Firstly, the finite-time anti-synchronization of MWCNNs with fixed topology and switching topology is analyzed respectively by utilizing Lyapunov functional approach as well as some inequality techniques, and several anti-synchronization criteria are put forward for the considered networks. Furthermore, when the parameter uncertainties appear in MWCNNs, some conditions for ensuring robust finite-time anti-synchronization are obtained. Similarly, we also consider the finite-time anti-synchronization and robust finite-time anti-synchronization for MWCNNs with coupling delays under fixed and switched topologies respectively. Lastly, two numerical examples with simulations are provided to confirm the effectiveness of these derived results

New Stability Criterion for Takagi-Sugeno Fuzzy Cohen-Grossberg Neural Networks with Probabilistic Time-Varying Delays

A new global asymptotic stability criterion of Takagi-Sugeno fuzzy Cohen-Grossberg neural networks with probabilistic time-varying delays was derived, in which the diffusion item can play its role. Owing to deleting the boundedness conditions on amplification functions, the main result is a novelty to some extent. Besides, there is another novelty in methods, for Lyapunov-Krasovskii functional is the positive definite form of p powers, which is different from those of existing literature. Moreover, a numerical example illustrates the effectiveness of the proposed methods

Passivity and synchronization of coupled reaction-diffusion complex-valued memristive neural networks

This paper considers two types of coupled reaction-diffusion complex-valued memristive neural networks (CRDCVMNNs). The nodes of the first type CRDCVMNN are coupled through their state and the second one is coupled by spatial diffusion coupling term. For the former, some novel criteria for the passivity and synchronization are derived by constructing an appropriate controller and utilizing some inequality techniques as well as Lyapunov functional method. For the latter, we establish some sufficient conditions which guarantee that this type of CRDCVMNNs can realize passivity and synchronization. Finally, the effectiveness and correctness of the acquired theoretical results are verified by two numerical examples

Nonlinear Systems

Open Mathematics is a challenging notion for theoretical modeling, technical analysis, and numerical simulation in physics and mathematics, as well as in many other fields, as highly correlated nonlinear phenomena, evolving over a large range of time scales and length scales, control the underlying systems and processes in their spatiotemporal evolution. Indeed, available data, be they physical, biological, or financial, and technologically complex systems and stochastic systems, such as mechanical or electronic devices, can be managed from the same conceptual approach, both analytically and through computer simulation, using effective nonlinear dynamics methods. The aim of this Special Issue is to highlight papers that show the dynamics, control, optimization and applications of nonlinear systems. This has recently become an increasingly popular subject, with impressive growth concerning applications in engineering, economics, biology, and medicine, and can be considered a veritable contribution to the literature. Original papers relating to the objective presented above are especially welcome subjects. Potential topics include, but are not limited to: Stability analysis of discrete and continuous dynamical systems; Nonlinear dynamics in biological complex systems; Stability and stabilization of stochastic systems; Mathematical models in statistics and probability; Synchronization of oscillators and chaotic systems; Optimization methods of complex systems; Reliability modeling and system optimization; Computation and control over networked systems

PyEMMA 2: A Software Package for Estimation, Validation, and Analysis of Markov Models

Markov (state) models (MSMs) and related models of molecular kinetics have recently received a surge of interest as they can systematically reconcile simulation data from either a few long or many short simulations and allow us to analyze the essential metastable structures, thermodynamics, and kinetics of the molecular system under investigation. However, the estimation, validation, and analysis of such models is far from trivial and involves sophisticated and often numerically sensitive methods. In this work we present the opensource Python package PyEMMA (http://pyemma.org) that provides accurate and efficient algorithms for kinetic model construction. PyEMMA can read all common molecular dynamics data formats, helps in the selection of input features, provides easy access to dimension reduction algorithms such as principal component analysis (PCA) and time-lagged independent component analysis (TICA) and clustering algorithms such as k-means, and contains estimators for MSMs, hidden Markov models, and several other models. Systematic model validation and error calculation methods are provided. PyEMMA offers a wealth of analysis functions such that the user can conveniently compute molecular observables of interest. We have derived a systematic and accurate way to coarse-grain MSMs to few states and to illustrate the structures of the metastable states of the system. Plotting functions to produce a manuscript-ready presentation of the results are available. In this work, we demonstrate the features of the software and show new methodological concepts and results produced by PyEMMA

Overcoming the timescale barrier in molecular dynamics: Transfer operators, variational principles and machine learning

One of the main challenges in molecular dynamics is overcoming the ‘timescale barrier’: in many realistic molecular systems, biologically important rare transitions occur on timescales that are not accessible to direct numerical simulation, even on the largest or specifically dedicated supercomputers. This article discusses how to circumvent the timescale barrier by a collection of transfer operator-based techniques that have emerged from dynamical systems theory, numerical mathematics and machine learning over the last two decades. We will focus on how transfer operators can be used to approximate the dynamical behaviour on long timescales, review the introduction of this approach into molecular dynamics, and outline the respective theory, as well as the algorithmic development, from the early numerics-based methods, via variational reformulations, to modern data-based techniques utilizing and improving concepts from machine learning. Furthermore, its relation to rare event simulation techniques will be explained, revealing a broad equivalence of variational principles for long-time quantities in molecular dynamics. The article will mainly take a mathematical perspective and will leave the application to real-world molecular systems to the more than 1000 research articles already written on this subject

Comprehensive review of models and methods for inferences in bio-chemical reaction networks

The key processes in biological and chemical systems are described by networks of chemical reactions. From molecular biology to biotechnology applications, computational models of reaction networks are used extensively to elucidate their non-linear dynamics. The model dynamics are crucially dependent on the parameter values which are often estimated from observations. Over the past decade, the interest in parameter and state estimation in models of (bio-) chemical reaction networks (BRNs) grew considerably. The related inference problems are also encountered in many other tasks including model calibration, discrimination, identifiability, and checking, and optimum experiment design, sensitivity analysis, and bifurcation analysis. The aim of this review paper is to examine the developments in literature to understand what BRN models are commonly used, and for what inference tasks and inference methods. The initial collection of about 700 documents concerning estimation problems in BRNs excluding books and textbooks in computational biology and chemistry were screened to select over 270 research papers and 20 graduate research theses. The paper selection was facilitated by text mining scripts to automate the search for relevant keywords and terms. The outcomes are presented in tables revealing the levels of interest in different inference tasks and methods for given models in the literature as well as the research trends are uncovered. Our findings indicate that many combinations of models, tasks and methods are still relatively unexplored, and there are many new research opportunities to explore combinations that have not been considered—perhaps for good reasons. The most common models of BRNs in literature involve differential equations, Markov processes, mass action kinetics, and state space representations whereas the most common tasks are the parameter inference and model identification. The most common methods in literature are Bayesian analysis, Monte Carlo sampling strategies, and model fitting to data using evolutionary algorithms. The new research problems which cannot be directly deduced from the text mining data are also discussed