Pseudo almost periodic solutions for quaternion-valued cellular neural networks with discrete and distributed delays

This paper is concerned with a class of quaternion-valued cellular neural networks with discrete and distributed delays. By using the exponential dichotomy of linear systems and a fixed point theorem, sufficient conditions are derived for the existence and global exponential stability of pseudo almost periodic solutions of this class of neural networks. Finally, a numerical example is given to illustrate the feasibility of the obtained results.

Stability Analysis of Neural Networks With Time-Varying Delay by Constructing Novel Lyapunov Functionals

This paper presents two novel Lyapunov functionals for analyzing the stability of neural networks with time-varying delay. Based on our newly proposed Lyapunov functionals and a relaxed Wirtinger-based integral inequality, new stability criteria are derived in the form of linear matrix inequalities. A comprehensive comparison of results is given to illustrate the newly proposed stability criteria from both the conservative and computational complexity point of views.

A Globally Generalized Emotion Recognition System Involving Different Physiological Signals

Machine learning approaches for human emotion recognition have recently demonstrated high performance. However, only/mostly for subject-dependent approaches, in a variety of applications like advanced driver assisted systems, smart homes and medical environments. Therefore, now the focus is shifted more towards subject-independent approaches, which are more universal and where the emotion recognition system is trained using a specific group of subjects and then tested on totally new persons and thereby possibly while using other sensors of same physiological signals in order to recognize their emotions. In this paper, we explore a novel robust subject-independent human emotion recognition system, which consists of two major models. The first one is an automatic feature calibration model and the second one is a classification model based on Cellular Neural Networks (CNN). The proposed system produces state-of-the-art results with an accuracy rate between 80% and 89% when using the same elicitation materials and physiological sensors brands for both training and testing and an accuracy rate of 71.05% when the elicitation materials and physiological sensors brands used in training are different from those used in training. Here, the following physiological signals are involved: ECG (Electrocardiogram), EDA (Electrodermal activity) and ST (Skin-Temperature).

Hierarchical Type Stability Criteria for Delayed Neural Networks via Canonical Bessel-Legendre Inequalities

This paper is concerned with global asymptotic stability of delayed neural networks. Notice that a Bessel-Legendre inequality plays a key role in deriving less conservative stability criteria for delayed neural networks. However, this inequality is in the form of Legendre polynomials and the integral interval is fixed on . As a result, the application scope of the Bessel-Legendre inequality is limited. This paper aims to develop the Bessel-Legendre inequality method so that less conservative stability criteria are expected. First, by introducing a canonical orthogonal polynomial sequel, a canonical Bessel-Legendre inequality and its affine version are established, which are not explicitly in the form of Legendre polynomials. Moreover, the integral interval is shifted to a general one . Second, by introducing a proper augmented Lyapunov-Krasovskii functional, which is tailored for the canonical Bessel-Legendre inequality, some sufficient conditions on global asymptotic stability are formulated for neural networks with constant delays and neural networks with time-varying delays, respectively. These conditions are proven to have a hierarchical feature: the higher level of hierarchy, the less conservatism of the stability criterion. Finally, three numerical examples are given to illustrate the efficiency of the proposed stability criteria.

Global Asymptotic Stability and Stabilization of Neural Networks With General Noise

Neural networks (NNs) in the stochastic environment were widely modeled as stochastic differential equations, which were driven by white noise, such as Brown or Wiener process in the existing papers. However, they are not necessarily the best models to describe dynamic characters of NNs disturbed by nonwhite noise in some specific situations. In this paper, general noise disturbance, which may be nonwhite, is introduced to NNs. Since NNs with nonwhite noise cannot be described by Itô integral equation, a novel modeling method of stochastic NNs is utilized. By a framework in light of random field approach and Lyapunov theory, the global asymptotic stability and stabilization in probability or in the mean square of NNs with general noise are analyzed, respectively. Criteria for the concerned systems based on linear matrix inequality are proposed. Some examples are given to illustrate the effectiveness of the obtained results.

Delay-Dependent Global Exponential Stability for Delayed Recurrent Neural Networks

This paper deals with the global exponential stability for delayed recurrent neural networks (DRNNs). By constructing an augmented Lyapunov-Krasovskii functional and adopting the reciprocally convex combination approach and Wirtinger-based integral inequality, delay-dependent global exponential stability criteria are derived in terms of linear matrix inequalities. Meanwhile, a general and effective method on global exponential stability analysis for DRNNs is given through a lemma, where the exponential convergence rate can be estimated. With this lemma, some global asymptotic stability criteria of DRNNs acquired in previous studies can be generalized to global exponential stability ones. Finally, a frequently utilized numerical example is carried out to illustrate the effectiveness and merits of the proposed theoretical results.

Multistability and instability analysis of recurrent neural networks with time-varying delays

This paper provides new theoretical results on the multistability and instability analysis of recurrent neural networks with time-varying delays. It is shown that such n-neuronal recurrent neural networks have exactly [Formula: see text] equilibria, [Formula: see text] of which are locally exponentially stable and the others are unstable, where k₀ is a nonnegative integer such that k₀≤n. By using the combination method of two different divisions, recurrent neural networks can possess more dynamic properties. This method improves and extends the existing results in the literature. Finally, one numerical example is provided to show the superiority and effectiveness of the presented results.

Synchronization of Reaction-Diffusion Neural Networks With Dirichlet Boundary Conditions and Infinite Delays

This paper is concerned with synchronization for a class of reaction-diffusion neural networks with Dirichlet boundary conditions and infinite discrete time-varying delays. By utilizing theories of partial differential equations, Green's formula, inequality techniques, and the concept of comparison, algebraic criteria are presented to guarantee master-slave synchronization of the underlying reaction-diffusion neural networks via a designed controller. Additionally, sufficient conditions on exponential synchronization of reaction-diffusion neural networks with finite time-varying delays are established. The proposed criteria herein enhance and generalize some published ones. Three numerical examples are presented to substantiate the validity and merits of the obtained theoretical results.

Stability Analysis of Discrete-Time Neural Networks With Time-Varying Delay via an Extended Reciprocally Convex Matrix Inequality

This paper is concerned with the stability analysis of discrete-time neural networks with a time-varying delay. Assessment of the effect of time delays on system stability requires suitable delay-dependent stability criteria. This paper aims to develop new stability criteria for reduction of conservatism without much increase of computational burden. An extended reciprocally convex matrix inequality is developed to replace the popular reciprocally convex combination lemma (RCCL). It has potential to reduce the conservatism of the RCCL-based criteria without introducing any extra decision variable due to its advantage of reduced estimation gap using the same decision variables. Moreover, a delay-product-type term is introduced for the first time into the Lyapunov function candidate such that a delay-variation-dependent stability criterion with the bounds of delay change rate is established. Finally, the advantages of the proposed criteria are demonstrated through two numerical examples.

A Memristive Multilayer Cellular Neural Network With Applications to Image Processing

The memristor has been extensively studied in electrical engineering and biological sciences as a means to compactly implement the synaptic function in neural networks. The cellular neural network (CNN) is one of the most implementable artificial neural network models and capable of massively parallel analog processing. In this paper, a novel memristive multilayer CNN (Mm-CNN) model is presented along with its performance analysis and applications. In this new CNN design, the memristor crossbar circuit acts as the synapse, which realizes one signed synaptic weight with a pair of memristors and performs the synaptic weighting compactly and linearly. Moreover, the complex weighted summation is executed in an efficient way with a proper design of Mm-CNN cell circuits. The proposed Mm-CNN has several merits, such as compactness, nonvolatility, versatility, and programmability of synaptic weights. Its performance in several image processing applications is illustrated through simulations.

Impulsive Multisynchronization of Coupled Multistable Neural Networks With Time-Varying Delay

This paper studies the synchronization problem of coupled delayed multistable neural networks (NNs) with directed topology. To begin with, several sufficient conditions are developed in terms of algebraic inequalities such that every subnetwork has multiple locally exponentially stable periodic orbits or equilibrium points. Then two new concepts named dynamical multisynchronization (DMS) and static multisynchronization (SMS) are introduced to describe the two novel kinds of synchronization manifolds. Using the impulsive control strategy and the Razumikhin-type technique, some sufficient conditions for both the DMS and the SMS of the controlled coupled delayed multistable NNs with fixed and switching topologies are derived, respectively. Simulation examples are presented to illustrate the effectiveness of the proposed results.

Retinal Circuit Emulator With Spatiotemporal Spike Outputs at Millisecond Resolution in Response to Visual Events

To gain insights on how visual information of the real world is filtered, compressed, and encoded by the vertebrate retinas, emulating in silico the spatiotemporal patterns of the graded and action potentials of neuronal responses to natural visual scenes on biological time scale is a feasible approach. As a basic platform for such an emulation, we here developed a compact hardware system comprising an analog silicon retina and a field-programmable gate array module. With utilizing the Izhikevich formalism, a retinal circuit model that emulates spiking of ganglion cells was implemented in this system. The emulated spike timing had the resolution of about 2 ms relative to the stimulus onset and was little affected by timings of the synchronous frame sampling in the silicon retina. Thus, the emulator can mimic the event-driven spike outputs of biological retinas. The system was useful for simultaneously visualizing neural images of both the graded potentials and the spikes in response to real live visual scenes. Since our emulator system is reconfigurable, it provides a flexible platform for investigating visual functions of retinal circuits under natural visual environment.

Robustly Fitting and Forecasting Dynamical Data With Electromagnetically Coupled Artificial Neural Network: A Data Compression Method

In this paper, a dynamical recurrent artificial neural network (ANN) is proposed and studied. Inspired from a recent research in neuroscience, we introduced nonsynaptic coupling to form a dynamical component of the network. We mathematically proved that, with adequate neurons provided, this dynamical ANN model is capable of approximating any continuous dynamic system with an arbitrarily small error in a limited time interval. Its extreme concise Jacobian matrix makes the local stability easy to control. We designed this ANN for fitting and forecasting dynamic data and obtained satisfied results in simulation. The fitting performance is also compared with those of both the classic dynamic ANN and the state-of-the-art models. Sufficient trials and the statistical results indicated that our model is superior to those have been compared. Moreover, we proposed a robust approximation problem, which asking the ANN to approximate a cluster of input-output data pairs in large ranges and to forecast the output of the system under previously unseen input. Our model and learning scheme proposed in this paper have successfully solved this problem, and through this, the approximation becomes much more robust and adaptive to noise, perturbation, and low-order harmonic wave. This approach is actually an efficient method for compressing massive external data of a dynamic system into the weight of the ANN.

Memristor standard cellular neural networks computing in the flux-charge domain

The paper introduces a class of memristor neural networks (NNs) that are characterized by the following salient features. (a) The processing of signals takes place in the flux-charge domain and is based on the time evolution of memristor charges. The processing result is given by the constant asymptotic values of charges that are stored in the memristors acting as non-volatile memories in steady state. (b) The dynamic equations describing the memristor NNs in the flux-charge domain are analogous to those describing, in the traditional voltage-current domain, the dynamics of a standard (S) cellular (C) NN, and are implemented by using a realistic model of memristors as that proposed by HP. This analogy makes it possible to use the bulk of results in the SCNN literature for designing memristor NNs to solve processing tasks in real time. Convergence of memristor NNs in the presence of multiple asymptotically stable equilibrium points is addressed and some applications to image processing tasks are presented to illustrate the real-time processing capabilities. Computing in the flux-charge domain is shown to have significant advantages with respect to computing in the voltage-current domain. One advantage is that, when a steady state is reached, currents, voltages and hence power in a memristor NN vanish, whereas memristors keep in memory the processing result. This is basically different from SCNNs for which currents, voltages and power do not vanish at a steady state, and batteries are needed to keep in memory the processing result.

Vertex coloring of graphs via phase dynamics of coupled oscillatory networks

While Boolean logic has been the backbone of digital information processing, there exist classes of computationally hard problems wherein this paradigm is fundamentally inefficient. Vertex coloring of graphs, belonging to the class of combinatorial optimization, represents one such problem. It is well studied for its applications in data sciences, life sciences, social sciences and technology, and hence, motivates alternate, more efficient non-Boolean pathways towards its solution. Here we demonstrate a coupled relaxation oscillator based dynamical system that exploits insulator-metal transition in Vanadium Dioxide (VO2) to efficiently solve vertex coloring of graphs. Pairwise coupled VO2 oscillator circuits have been analyzed before for basic computing operations, but using complex networks of VO2 oscillators, or any other oscillators, for more complex tasks have been challenging in theory as well as in experiments. The proposed VO2 oscillator network harnesses the natural analogue between optimization problems and energy minimization processes in highly parallel, interconnected dynamical systems to approximate optimal coloring of graphs. We further indicate a fundamental connection between spectral properties of linear dynamical systems and spectral algorithms for graph coloring. Our work not only elucidates a physics-based computing approach but also presents tantalizing opportunities for building customized analog co-processors for solving hard problems efficiently.

Intrinsic optimization using stochastic nanomagnets

This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic constituents are stochastic nanomagnets which switch randomly between the ±1 Ising states and can be monitored continuously with standard electronics. Their mutual interactions can be short or long range, and their strengths can be reconfigured as needed to solve specific problems and to anneal the system at room temperature. The natural laws of statistical mechanics guide the network of stochastic nanomagnets at GHz speeds through the collective states with an emphasis on the low energy states that represent optimal solutions. As proof-of-concept, we present simulation results for standard NP-complete examples including a 16-city traveling salesman problem using experimentally benchmarked models for spin-transfer torque driven stochastic nanomagnets.

Sampled-Data Synchronization Analysis of Markovian Neural Networks With Generally Incomplete Transition Rates

This paper investigates the problem of sampled-data synchronization for Markovian neural networks with generally incomplete transition rates. Different from traditional Markovian neural networks, each transition rate can be completely unknown or only its estimate value is known in this paper. Compared with most of existing Markovian neural networks, our model is more practical because the transition rates in Markovian processes are difficult to precisely acquire due to the limitations of equipment and the influence of uncertain factors. In addition, the time-dependent Lyapunov-Krasovskii functional is proposed to synchronize drive system and response system. By applying an extended Jensen's integral inequality and Wirtinger's inequality, new delay-dependent synchronization criteria are obtained, which fully utilize the upper bound of variable sampling interval and the sawtooth structure information of varying input delay. Moreover, the desired sampled-data controllers are obtained. Finally, two examples are provided to illustrate the effectiveness of the proposed method.

Stability Analysis of Neural Networks With Two Delay Components Based on Dynamic Delay Interval Method

In this paper, a dynamic delay interval (DDI) method is proposed to deal with the stability problem of neural networks with two delay components. This method extends the fixed interval of a time-varying delay to a dynamic one, which relaxes the restriction on upper and lower bounds of the delay intervals. Combining the reciprocally convex combination technique and Wirtinger integral inequality, the DDI method leads to some much less conservative delay-dependent stability criteria based on a linear matrix inequality for neural networks with two delay components. Furthermore, the criteria for the system with a single time-varying delay are provided. Some examples are given to illustrate the effectiveness of the obtained results.

Finite-time synchronization for recurrent neural networks with discontinuous activations and time-varying delays

In this paper, we study the finite-time synchronization problem for recurrent neural networks with discontinuous activations and time-varying delays. Based on the finite-time convergence theory and by using the nonsmooth analysis technique, some finite-time synchronization criteria for the considered neural network model are established, which are new and complement some existing ones. The feasibility and effectiveness of the proposed synchronization method are supported by two examples with numerical simulations.

Neutral impulsive shunting inhibitory cellular neural networks with time-varying coefficients and leakage delays

In this article, we consider a class of neutral impulsive shunting inhibitory cellular neural networks with time varying coefficients and leakage delays. We study the existence and the exponential stability of the piecewise differentiable pseudo almost-periodic solutions and establish sufficient conditions for the existence and exponential stability of such solutions. An example is provided to illustrate the theory developed in this work.

Synchronization of a Class of Switched Neural Networks with Time-Varying Delays via Nonlinear Feedback Control

This paper is concerned with the synchronization problem for a class of switched neural networks (SNNs) with time-varying delays. First, a new crucial lemma which includes and extends the classical exponential stability theorem is constructed. Then by using the lemma, new algebraic criteria of ψ -type synchronization (synchronization with general decay rate) for SNNs are established via the designed nonlinear feedback control. The ψ -type synchronization which is in a general framework is obtained by introducing a ψ -type function. It contains exponential synchronization, polynomial synchronization, and other synchronization as its special cases. The results of this paper are general, and they also complement and extend some previous results. Finally, numerical simulations are carried out to demonstrate the effectiveness of the obtained results.