Search

This article considers the quasisynchronization of memristive neural networks (MNNs) with communication delays via event-triggered impulsive control (ETIC). In view of the limited communication and bandwidth, we adopt a novel switching event-triggered mechanism (ETM) that not only decreases the times of controller update and the amount of data sent out but also eliminates the Zeno behavior. By using an appropriate Lyapunov function, several algebraic conditions are given for quasisynchronization of MNNs with communication delays. More important, there is no restriction on the derivation of the Lyapunov function, even if it is an increasing function over a period of time. Then, we further propose a switching ETM depending on communication delays and aperiodic sampling, which is more economical and practical and can directly avoid Zeno behavior. Finally, two simulations are presented to validate the effectiveness of the proposed results. [ABSTRACT FROM AUTHOR]

In this article, we consider the problem of distributed adaptive leader-follower coordination of partial differential systems (i.e., reaction-diffusion neural networks, RDNNs) with directed communication topology in the case of multiple leaders. Different from the dynamical networks with ordinary differential dynamics, the design of adaptive protocols is more difficult due to the existence of spatial variables and nonlinear terms in the model. Under directed networks, a novel adaptive control protocol is proposed to solve the containment control problem of RDNNs. By constructing proper Lyapunov functional and adopting some important prior knowledge, the stability of containment for coupled RDNNs is theoretically proved. Furthermore, a corollary about the leader-follower synchronization with a leader for coupled RDNNs with directed communication topology is given. In the end, two numerical examples are provided to illustrate the obtained theoretical results. [ABSTRACT FROM AUTHOR]

In this article, we analyze the projective synchronization of fractional-order neural networks with mixed time delays. By introducing an extended Halanay inequality that is applicable for the case of fractional differential equations with arbitrary initial time and multiple types of delays, sufficient criteria are deduced for ensuring the projective synchronization of fractional-order neural networks with both discrete time-varying delays and distributed delays. Furthermore, sufficient criteria are presented for ensuring the projective synchronization in the Mittag-Leffler sense if there is no delay in fractional-order neural networks. The results derived herein include complete synchronization, anti-synchronization, and stabilization of fractional-order neural networks as particular cases. Moreover, the testable criteria in this article are a meaningful extension of projective synchronization of neural networks with mixed time delays from integer-order to fractional-order ones. A numerical simulation with four cases is provided to verify the validity of the obtained results. [ABSTRACT FROM AUTHOR]

This article investigates the global stability of bidirectional associative memory neural networks with discrete and distributed time-varying delays (DBAMNNs). By employing the comparison strategy and inequality techniques, global asymptotic stability (GAS) and global exponential stability (GES) of the underlying DBAMNNs are of concern in terms of $p$ -norm ($p\geq 2$). Meanwhile, GES of the addressed DBAMNNs is also analyzed in terms of 1-norm. When distributed time delay is neglected, the GES of the corresponding bidirectional associative memory neural networks is presented as an $M$ -matrix, which includes certain existing outcomes as special cases. Two examples are finally provided to substantiate the validity of theories. [ABSTRACT FROM AUTHOR]

The published stability criteria for impulsive neural networks are scale-free on time line, which is only appropriate for discrete or continuous ones. The issue of global exponential stability for impulsive delayed neural networks on time scales is analyzed by employing the convex combination method in this article. Several algebraic and linear matrix inequality conditions are proved by constructing impulse-dependent Lyapunov functionals and using timescale inequality techniques. Unlike the published works, impulsive control strategies can be designed by utilizing our theoretical results to stabilize delayed neural networks on time scales if they are unstable before introducing impulses. Sufficient criteria for global exponential stability in this article are derived based on the timescale theory, and they are applicable to discrete-time impulsive neural networks, their continuous-time analogues, and neural networks whose states are discrete at one time and continuous at another time. Four numerical examples are offered to demonstrate the effectiveness and superiority of our new theoretical results in the end. [ABSTRACT FROM AUTHOR]

This paper considers the self-synchronization and tracking synchronization issues for a class of nonidentically coupled neural networks model with unknown parameters and diffusion effects. Using the special structure of neural networks with global Lipschitz activation function, nonidentical terms are treated as external disturbances, which can then be compensated via robust adaptive control techniques. For the case where no common reference trajectory is given in advance, a distributed adaptive controller is proposed to drive the synchronization error to an adjustable bounded area. For the case where a reference trajectory is predesigned, two distributed adaptive controllers are proposed, respectively, to address the tracking synchronization problem with bounded and unbounded reference trajectories, different decomposition methods are given to extract the heterogeneous characteristics. To avoid the appearance of global information, such as the spectrum of the coupling matrix, corresponding adaptive designs on coupling strengths are also provided for both cases. Moreover, the upper bounds of the final synchronization errors can be gradually adjusted according to the parameters of the adaptive designs. Finally, numerical examples are given to test the effectiveness of the control algorithms. [ABSTRACT FROM AUTHOR]

Most memristor-based Pavlov associative memory neural networks strictly require that only simultaneous food and ring appear to generate associative memory. In this article, the time delay is considered, in order to form associative memory when the food stimulus lags behind the ring stimulus for a certain period of time. In addition, the rate of learning can be changed with the length of time between the ring stimulus and food stimulus. A memristive neural network circuit that can realize Pavlov associative memory with time delay is designed and verified by the simulation results. The designed circuit consists of a synapse module, a voltage control module, and a time-delay module. The functions, such as learning, forgetting, fast learning, slow forgetting, and time-delay learning, are implemented by the circuit. The Pavlov associative memory neural network with time-delay learning provides a reference for further development of the brain-like systems. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of complete stability of delayed recurrent neural networks with a general class of piecewise linear activation functions. By applying an appropriate partition of the state space and iterating the defined bounding functions, some sufficient conditions are obtained to ensure that an n-neuron neural network is completely stable with exactly ∏i=1n(2Ki-1) equilibrium points, among which ∏i=1nKi equilibrium points are locally exponentially stable and the others are unstable, where Ki(i=1,⋅⋅⋅,n) are non-negative integers which depend jointly on activation functions and parameters of neural networks. The results of this paper include the existing works on the stability analysis of recurrent neural networks with piecewise linear functions as special cases and hence can be considered as the improvement and extension of the existing stability results in the literature. A numerical example is provided to illustrate the derived theoretical results. [ABSTRACT FROM AUTHOR]

This paper investigates the $\phi $ -type stability and robust stability for a general class of stochastic reaction–diffusion neural networks (SRDNNs) with Dirichlet boundary conditions, infinite discrete time-varying delays, and infinite continuously distributed delays. By virtue of inequality techniques, properties of $\boldsymbol M$ -matrix, and theories of stochastic analysis, several sufficient criteria are obtained to guarantee the almost sure $\boldsymbol \phi $ -type stability, $\boldsymbol p$ th moment $\boldsymbol \phi $ -type stability, and $\boldsymbol \phi $ -type robust stability of the underlying SRDNNs with hybrid unbounded time delays. With appropriate choices of the function $\boldsymbol \phi $ , the $\boldsymbol \phi $ -type stability reduces to the exponential stability, polynomial stability, and logarithmic stability. Additionally, the developed results herein include some existing ones as special cases. A numerical simulation is performed to substantiate the effectiveness and superiority of the theoretical analysis. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel computational architecture of memristor-based echo state network (MESN) with the online least mean square (LMS) algorithm. Newman and Watts small-world network is adopted for the topological structure of MESN network with memristive neural synapses. In the MESN network, the state matrix of the reservoir layer, which is obtained by raising the dimension of input data, is utilized as an input of the LMS algorithm to train the output weight matrix on chip. After certain iterations, the resistance value of memristor is adjusted to a constant. Thus, the final weight output matrix is obtained. To verify the effectiveness of the proposed MESN network, car evaluation and short-term power load forecasting are employed with the effect evaluation of the node number and the connectivity degree of the reservoir layer. The research provides a novel way to design neuromorphic computing systems. [ABSTRACT FROM AUTHOR]

The synchronization problem of multiple/coupled reaction–diffusion neural networks with time-varying delays is investigated. Differing from the existing considerations, state delays among distinct neurons and coupling delays among different subnetworks are included in the proposed model, the assumptions posed on the arisen delays are very weak, time-varying, heterogeneous, even unbounded delays are permitted. To overcome the difficulties from this kind of delay as well as diffusion effects, a comparison-based approach is applied to this model and a series of algebraic criteria are successfully obtained to verify the global asymptotical synchronization. By specifying the existing delays, some ${M}$ -matrix-based criteria are derived to justify the power-rate synchronization and exponential synchronization. In addition, new criterion on synchronization of general connected neural networks without diffusion effects is also given. Finally, two simulation examples are given to verify the effectiveness of the obtained theoretical results and provide a comparison with the existing criterion. [ABSTRACT FROM AUTHOR]

Back propagation (BP) based on stochastic gradient descent is the prevailing method to train multilayer neural networks (MNNs) with hidden layers. However, the existence of the physical separation between memory arrays and arithmetic module makes it inefficient and ineffective to implement BP in conventional digital hardware. Although CMOS may alleviate some problems of the hardware implementation of MNNs, synapses based on CMOS cost too much power and areas in very large scale integrated circuits. As a novel device, memristor shows promises to overcome this shortcoming due to its ability to closely integrate processing and memory. This paper proposes a novel circuit for implementing a synapse based on a memristor and two MOSFET tansistors (p-type and n-type). Compared with a CMOS-only circuit, the proposed one reduced the area consumption by 92%–98%. In addition, we develop a fuzzy method for the adjustment of the learning rates of MNNs, which increases the learning accuracy by 2%–3% compared with a constant learning rate. Meanwhile, the fuzzy adjustment method is robust and insensitive to parameter changes due to the approximate reasoning. Furthermore, the proposed methods can be extended to memristor-based multilayer convolutional neural network for complex tasks. The novel architecture behaves in a human-liking thinking process. [ABSTRACT FROM AUTHOR]

The existing results of passivity for neural networks mainly concentrated on first-order derivative of the states, whereas it is also significant to study the passivity with high-order derivative. In this paper, a class of memristor-based inertial neural networks (MINNs) with external inputs and outputs are concerned. First, by choosing appropriate variable transformation, the original networks are rewritten as first-order differential equations. Then a criterion of passivity for the MINNs is presented by nonsmooth analysis and linear matrix inequality (LMI) techniques, which could also result in NP-hard problem since it needs at least exponential-time to solve the passivity condition. Meanwhile, based on the obtained passivity criterion, asymptotic stability criterion is accordingly derived for MINNs. In order to avoid the NP-hard problem, we employ matrix-analysis-techniques with the property that the difference-matrix between the given matrix and the proposed matrix is seminegative definite. Then the time complexity for solving the proposed passivity criterion is reduced to constant-time with respect to the number of LMIs. Robust passivity for MINNs is also studied for bounded uncertain parameters. The MINN widens the application ranges for designing neural networks. Finally, relevant simulation examples are given to show the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM PUBLISHER]

The existed results of Lagrange stability and finite-time synchronization for memristive recurrent neural networks (MRNNs) are scale-free on time evolvement, and some restrictions appear naturally. In this paper, two novel scale-limited comparison principles are established by means of inequality techniques and induction principle on time scales. Then the results concerning Lagrange stability and global finite-time synchronization of MRNNs on time scales are obtained. Scaled-limited Lagrange stability criteria are derived, in detail, via nonsmooth analysis and theory of time scales. Moreover, novel criteria for achieving the global finite-time synchronization are acquired. In addition, the derived method can also be used to study global finite-time stabilization. The proposed results extend or improve the existed ones in the literatures. Two numerical examples are chosen to show the effectiveness of the obtained results. [ABSTRACT FROM PUBLISHER]