Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2023 Aug 2;13:12545. doi: 10.1038/s41598-023-37737-2

Finite-time complete periodic synchronization of memristive neural networks with mixed delays

Hajer Brahmi 1, Boudour Ammar 1,, Amel Ksibi 2, Farouk Cherif 3, Ghadah Aldehim 2, Adel M Alimi 1,4
PMCID: PMC10397264  PMID: 37532702

Abstract

In this paper we study the oscillatory behavior of a new class of memristor based neural networks with mixed delays and we prove the existence and uniqueness of the periodic solution of the system based on the concept of Filippov solutions of the differential equation with discontinuous right-hand side. In addition, some assumptions are determined to guarantee the globally exponentially stability of the solution. Then, we study the adaptive finite-time complete periodic synchronization problem and by applying Lyapunov–Krasovskii functional approach, a new adaptive controller and adaptive update rule have been developed. A useful finite-time complete synchronization condition is established in terms of linear matrix inequalities. Finally, an illustrative simulation is given to substantiate the main results.

Subject terms: Applied mathematics, Dynamical systems

Introduction

Recurrent neural network (RNN) is a deep learning model characterized by a topology that allows all connections between neurons, and by the fact each neuron usually has a complicated structure because of a large number of parallel connections with a diversity of axon lengths1,2. In addition, RNNs are well known for their capacity of classification, detecting regularities and their ability to learn. They can play the role of memory through feedback and are perfectly able to receive sensory data from our future agent3,4. In particular, continuous time RNNs (CTRNNs) are RNNs modeled by dynamical systems in the form of differential equation; they combine machine learning and physical modeling57. In fact, CTRNNs are mathematically easier to analyze, and continuous formulation offers more flexibility in adapting the system to the problem and adding constraints. Actually, researchers are attracted to the mathematical properties of RNNs, namely, the nature of solutions, stability and the oscillation properties8,9.

Indeed, the dynamic properties of RNNs have been deeply discussed and several important works have been provided1013. In particular, RNNs which exhibit periodic oscillation have been used to encode information in the vibration phase and to model many systems in many domains such as celestial mechanics, nonlinear vibration, electromagnetic theory, engineering, robotics1419. In addition, the synchronization problem consists of analyzing the behavior between two systems: driver (or master) and responder (or slave) and could be seen in different real systems such as secure communication, information science, chaos generators and signal generators design, image processing, biological systems20,21. In fact, neuronal synchronization becomes one of the most attractive subjects in neuroscience, it indicates that the specific states of all the neurons in the neural networks converge to a common value2225.

To make these oscillating neurons, researchers are interested in the memristor component that is a combination of memory and resistor26,27. Chua pointed out that the behaviour of memristor is somewhat similar to the synapses in the human brain28, and it can potentially offer both high connectivity and high density needed for efficient computing compared to other storage. A memristive neural networks (MNN) is described in Fig. 1. In addition, memristor studies show that MNN exhibits the feature of pinched hysteresis which means that a lag occurs between the application and the removal of a field and its subsequent effect, just as the neurons in the human brain have2931. Some studies have been discussed to analyze the dynamic behaviour of MNN and a lot of researches were released3235.

Figure 1.

Figure 1

Memristive neural network with 5 neurons.

Hence, one can ask what is the impact of the delays (time-varying and distributed delay) for the stability and the synchronization of the periodic solution of MNNs. In Ref.10, authors investigate whether periodic solutions exist, are unique and stable for a large class of memristor-based neural networks with time-varying delays. Moreover, a novel and useful finite-time complete synchronization condition is obtained in terms of linear matrix inequalities to ensure the synchronization goal in Ref.36.

In this work, we extend these studies and the mathematical model of MNN with mixed delays. In fact, we analyse the stability of equilibrium points with executing significant results of the period behavior of the system. After that, we study the phenomena of synchronization from the point of view of the theory and control. In the considered system, the weights are discontinuous; the classical definition of the solution for differential equations cannot apply here. Therefore we shall propose the Filippov solution to handle this problem. Filippov developed a solution to the differential equation with a discontinuous right-hand side37. Based on this definition, a differential equation with a discontinuous right-hand side has the same solution set as a differential inclusion. Our contribution consists to investigate the existence and exponential stability of the periodic solutions for memristor-based neural networks with time-varying delays in the leakage term. The stability properties of this model are then analyzed and we show that the solutions of this new linear system converge to a periodic and stable limit cycle. The main novelty of our contribution lies in solving the problems of stability and synchronization and we demonstrate the impact of the mixed delays. Also results enhance and extend earlier studies on neural network dynamical systems with a continuous or discontinuous right-hand side that are memristor-based or conventional.

The rest of this paper is organized as follows. A delayed memristor-based neural networks is presented and some necessary definitions are given in “Model description and preliminaries” section. In “Uniqueness and global exponential stability” section, we introduce the Filippov’s solution for our system and the existence of periodic solutions of the system. Our approaches are based on the differential inclusions and topological degree theories in set-valued analysis. In “Finite-time periodic synchronization” section, we shall study the uniqueness and global exponential stability of the w-periodic solution for the system. Especially, when the system is autonomous, we will give the sufficient conditions, uniqueness and global exponential stability of equilibrium point of the proposed system. Moreover, we designed novel control algorithms for the finite-time periodic synchronization to select neurons to pin the designed controller. In “Conclusions” section, a numerical example is obtained to show the effectiveness of the theoretical results given in the previous sections. It should be mentioned that the main results of this paper are Theorems 15.

Model description and preliminaries

In this paper, we shall investigate the following memristive neural networks with time-varying delay:

x˙i(t)=-ai(t)xi(t)+j=1nbij(xj(t))fj(xj(t))+j=1ncij(xj(t-τij(t)))gj(xj(t-τij(t)))×j=1npij(xj(t))-tkij(t-s)hj(xj(s))ds+Ji(t), 1

where n1 represents the number of neurons in the network, xi(t) correponds to the potential membrane of the neuron i at time t, the ai is a positive constant rate with which the i th neuron will reset its potential to the resting state in isolation when it is disconnected. In addition, fj,gj,hj and ϕj denote the activation functions of jth neuron at time t, bij(t),cij(t), pij(t) are the synaptic connection weight of the unit j on the unit i at time t, Ji is the input unit i and τij(t) corresponds to the transmission delay of the ith unit along the axon of the jth unit at time t and is continuously differentiable function satisfying

0τij(t)τ, 2

where τ=max1i,jnmaxt0,ω,τij(t), τ is a nonnegative constant, bij(t), cij(t-τij(t)) and pij(t) are memristive synaptic weights. Basing on memristor feature and the current-voltage characteristic, we write:

bij(xi(t))=b¯ij,|xj(t)|>Tjb_ij,|xj(t)|<Tj, 3
cij(xi(t))=c¯ij,|xj(t)|>Tjc_ij,|xj(t)|<Tj, 4
pij(xi(t))=p¯ij,|xj(t)|>Tjp_ij,|xj(t)|<Tj, 5

for i,j=1,2,,n; tR, where Tj>0 is a switching jumps and let a¯i>0, a_i>0, b¯ij, b_ij , c¯ij, c_ij, p¯ij, p_ij for i,j=1,2,,n are all constants.

Definition 1

(Periodic solution). A solution x(t) of system (1) on [0,+[ is a ω-periodic solution with period ω if

x(t+ω)=x(t), for all t0.

Throughout this paper, we always assume the following hypothesis:

(H1) ai(.),b¯ij(.),b_ij(.),c¯ij(.),c_ij(.),p¯ij(.),p_ij(.),τij(.) and Ji(.) are continuous and w-periodic functions.

(H2) The neuron activation functions fj(.), gj(.) and hj(.) are Lipschitz-continuous on R with Lipschitz constants Fj>0, Gj>0 and Hj>0 respectively, i.e.,

|fj(x)-fj(y)|<Fj|x-y|,|gj(x)-gj(y)|<Gj|x-y|,|hj(x)-hj(y)|<Hj|x-y|, for all x,yR and for all j=1,2,..,n.

(H3) M,αR+ such that |kij(t-s)|==0,s0Me-α(t-s),0st.

Definition 2

We say that a square matrix is an M-matrix if it has all nonpositive elements outside the diagonal and all positive successive principal minors38.

Lemma 1

39 Given matrix M=(mij)n×n with nonpositive off-diagonal elements is a nonsingular M-matrix if and only if one of the following conditions holds:

  1. There exist n positive constants α1,α2,αn such that αimii+j=1,jinαjmji>0,i=1,,n.

  2. There exist n positive constants β1,β2,βn such that βimii+j=1,jinβjmij>0,i=1,,n.

Definition 3

(Clarke Regular40) V(x):RnR is said to be regular, if for each xRn and vRn

  1. there exists the usual right directional derivative D+V(x,v)=limh0+V(x+hv)-V(x)h,

  2. the generalized directional derivative of V at x in the direction vRn is defined as D++V(x,v)=limyx,h0+V(y+hv)-V(y)h, then D+V(x,v)=D++V(x,v).

Definition 4

Consider the column vector x=(x1,x2,,xn)T, where T denotes the transpose of a vector, x denotes any vector norm in Rn. x1=j=1n|xi|, x2=j=1nxi212.

Let the set ARn,co¯[A] denotes the closure of the convex hull of A, μ(A) is the Lebesgue measure of A, and A is the boundary of A.

Definition 5

For a locally Lipschitz function V(x):RnR, we can define Clarke’s generalized gradient of V at point x, as follows

V(x)=co¯[limkV(xk):xkx,xkN,xkΩ],

where ΩRn is the set of points where V is not differentiable and NRn is an arbitrary set with measure zero41. In the following, for a continuous ω-periodic function f(t) defined on R, we define

f¯=1ω0ωf(t)dt,fu=supto,ω|f(t)|,fl=infto,ω|f(t)|.

Given Cτ:=C([-τ,0]) defines a Banach space of all continuous functions e:[-τ,0]R.

For xRn, we can write xCτ means x(s)x in [-τ,0]. Given eCτ, let ec=supe(s).

The initial states proposed for system (1) are as follow

xi(s)=ei(s),s[-τ,0],i=1,2,,n. 6

Consider xtC([-τ,0],Rn) described by xt(s)=x(t+s), -τs0, and the initial states (10) can be rewritten as

x0=eCτ:=C([-τ,0],Rn). 7

Suppose that ARn, then xϕ(x) is said a set-valued map from A to Rn, if for every point xA, there exists a nonempty set ϕ(x)Rn. We call a set-valued map ϕ with nonempty values, an upper semicontinuous at x0A, if for every open set N containing ϕ(x0), there exists a neighborhood M of x0 such that ϕ(M)N. The map ϕ(x) is said to have a closed (convex, compact) image if for each xA, ϕ(x) is closed (convex, compact).

Existence of periodic solution

In the rest of this section we will investigate the existence of periodic solutions of the generalized memristor system.

By the differential equation system (1), we consider the set-valued maps as follow: for tR and i,j=1,2,,n,

K[bij(xj(t))]=b¯ij,|xj(t)|>Tjco¯b¯ij,b_ij,|xi(t)|=Tib_ij,|xj(t)|<Tj, 8
K[cij(xj(t))]=c¯ij,|xj(t)|>Tjco¯c¯ij,c_ij,|xj(t)|=Tjc_ij,|xj(t)|<Tj, 9
K[pij(xj(t))]=p¯ij,|xj(t)|>Tjco¯p¯ij,p_ij,|xj(t)|=Tjp_ij,|xi(t)|<Ti. 10

It is clear that K[bij(xi(t))], K[cij(xi(t))] and K[pij(xi(t))] are all closed, convex and compact for every tR and i,j=1,,n.

A function x(t) is said to be a solution of system (1) on [0, T) with initial condition (7) or (8), if x(t) is absolutely continuous on any compact interval of [0, T] and satisfies differential inclusions:

dxi(t)dt-ai(t)xi(t)+j=1nK[bij(xj(t))]fjxj(t)+j=1nK[cij(xj(t))]gjxjt-τij(t)+j=1nK[pij(xj(t))]-tkij(t-s)hjxj(s)ds+Ji(t), 11

or there exist γij(t)K[bij(xi(t))], ηij(t)K[cij(xi(t))] and νij(t)K[pij(xi(t))] satisfy

dxi(t)dt-ai(t)xi(t)+j=1nγij(t)fjxj(t)+j=1nηij(t)gjxjt-τ+j=1nνij(t)-tkij(t-s)hjxjds+Ji, 12

for a. a. t[0,T),i=1,2,,n.

In the following, we discuss dynamical behavior of system (1) using the following set-valued version of the Mawhin coincidence theorem.

Lemma 2

(Mawhin coincidence theorem42) Suppose that ϕ:R×RnKν(Rn) is upper semicontinuous and ω-periodic in t. If the following conditions hold:

  1. There exists a bounded open set ΔCω, the set of all continuous, ω-periodic functions: RRn, such that for any λ(0,1), each ω-periodic function x(t) of the inclusion
    dxdtλϕ(t,x), 13
    satisfies xΔ if it exists.
  2. Each solution zRn of the inclusion 01ω0ωϕ(t,z)dt=g0(z) satisfies zΔRn;

  3. deg(g0,ΔRn,0)0, then differential inclusion (13) has at least one ω-periodic solution x(t) with xΔ¯. If a matrix O0 then all elements of O are greater than or equal to 0, and similarly we can describe O>0. It follows that for given vectors or matrices O and P, OP (or O>P) and similarly that O-P0 (or O-P>0). After that, we give sufficient conditions to guarantee the existence of periodic solutions for the memristive neural network.

Theorem 1

We consider IS an M-matrix, where I is the identity matrix of dimension n, S=(sij)n×n and

(H4) sij=1ailbijuFj+cijuGj1-τijD+MαpijuFj,i,j=1,2,..,n,

where biju=maxb¯iju,b_iju, ciju=maxc¯iju,c_iju and piju=maxp¯iju,p_iju.

Then there exists at least one ω-periodic solution of system (1).

Proof

Define Eω=x(t)C(R,Rn):x(t+ω)=x(t), and for x(t)Eω

x(t)Cω=i=1nmaxt0,ω|xi(t)|.

Then Eω is a Banach space equipped with the norm .Eω.

Let for x(t)Eω,

ϕ(t,x)=(ϕ1(t,x),ϕ2(t,x),,ϕn(t,x))T,

where

ϕi(t,x)=-ai(t)xi(t)+j=1nK[bij(xj(t))]fjxj(t)+j=1nK[cij(xj(t))]fjxjt-τ+j=1nK[pij(xj(t))]-tfjxj(s)ds+Ji(t),

i=1,2,..,n.

Let assumption (H4) holds, ϕ(t,x) is an upper semicontinuous set-valued map with nonempty compact convex values under H4. Here we need to find an appropriate open, bounded subset Δ, in order to apply Mawhin-Like Coincidence Theorem (Lemma 2),

From the differential inclusion (13), we obtain

dxi(t)dtλ[-aixi(t)+j=1nK[bij(xj(t))]fjxj(t)+j=1nK[cij(xj(t))]fjxjt-τ+j=1nK[pij(xj(t))]-tfjxj(s)ds+Ji]. 14

Given x(t)=(x1(t),x2(t),,xn(t))T an arbitrary ω-periodic solution of the differential inclusion (14) for a certain λ(0,1). There exist γij(t)K[bij(xj(t))] and ηij(t)K[cij(xj(t))] νij(t)K[pij(xj(t))] satisfy

dxi(t)dt=λ[-ai(t)xi(t)+j=1nγij(t)fjxj(t)+j=1nηij(t)fjxjt-τ+j=1nνij(t)-tfjxj(s)ds+Ji], 15

for a [0, T),  i=1,2,..,n.

Multiplying both sides of (15) by xi(t) and integrating over the interval [0,ω], we get

0ωai(t)xi2(t)dt=0ωxi(t)[j=1nγij(t)fjxj(t)+j=1nηij(t)gjxjt-τij+j=1nνij(t)-tkij(t-s)hjxj(s)ds+Ji(t)]dt. 16

From (H2), (8), (9), (10) and (11), it is clear to see that

|γij(t)|max|b¯ij|,|b_ij|biju|ηij(t)|max|c¯ij|,|c_ij|ciju|νij(t)|max|p¯ij|,|p_ij|piju|fj(xj(t))|Fj|xj(t)|+|fj(0)|,|gj(xj(t-τij))|Gj|xj(t-τij)|+|gj(0)||hj(xj(t))|Hj|xj(t)|+|hj(0)|. 17

From (16) and Cauchy–Schwarz inequality, we obtain:

ail0ωxi2(t)dtj=1nbijuFj0ω|xi(t)||xj(t)|dt+j=1ncijuGj0ω|xi(t)||xj(t-τij)|dt+j=1npijuHj0ω-tkij(t-s)|xi(s)||xj(s)|dsdt+j=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiI0ω|xi(t)|dt. 18

Noticing that

0ω|xj2(t-τij(t))|dt=-τij(0)ω-τij(ω)|xj2(t)|1-τ˙ij(φij-1(t))dt=-τij(0)ω-τij(0)|xj2(t)|1-τ˙ij(φij-1(t))dt=0ω|xj2(t)|1-τ˙ij(φij-1(t))dt=11-τijD0ω|xj2(t)|dt,j=1,2,..,n, 19

where φij-1 is the inverse function of φij=t-τij(t),i,j=1,2,..,n.

Then, for i=1,2,..,n, we obtain

ail0ωxi2(t)dtj=1nbijuFj+cijuGj1-τijD+MαpijuHj0ω|xj2(t)|dt12+ωj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiI, 20

which implies

0ωxi2(t)dtj=1n1ailbijuFj+cijuGj1-τijD+MαpijuHj0ω|xj2(t)|dt12+ωailj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiI0ωxi2(t)dtqijj=1n0ωxj2(t)dt12+ωθii=1,2,..,n, 21

where

θi=1ailj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiI,i=1,2,..,n.

Let xi2ω=0ωxi2(t)dt2,xiCR,R,i=1,2,..,n.

Thus

I-Sx12ω,x22ω,,xn2ωTωα. 22

Since I-S is an M-matrix, assumption (H4) holds and Lemma 1, there exists a vector

ν=ν1,ν2,,νn=νI-S>0,0,,0, 23

and from (22), we have

minν1,ν2,,νnx12ω,x22ω,,xn2ων1x12ω+ν2x22ω++νnxn2ω=νI-Sx12ω,x22ω,,xn2ωTνωθ1,θ2,,θnT=ωj=1nνiθi. 24

Thus, we obtain

0ω|xi2(t)|dt12=xi2ωωi=1nνiθiminν1,ν2,,νnωN. 25

Obviously, we can see that there exists ti0,ω such that

|xit|ωN,i=1,2,,n. 26

Since for ti0,ω,

xi(t)=xi(ti)+titx˙isds,

thus we obtain

|xi(t)|N+0ωx˙isds,i=1,2,..,n,

we can derive from (17) and (19) that

0ω|x˙i(t)|dt<ail0ω|xi(t)|dt+j=1nbijuFj0ω|xj(t)|dt+j=1ncijuGj0ω|xj(t-τij(t))|dt+j=1npijuHj0ω-tkij(t-s)|xj(s)|dsdt+ωj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiI=0ω|x˙i(t)|dt<ail0ω|xi(t)|dt+j=1nbijuFj0ω|xj(t)|dt+j=1ncijuGj0ω|xj(t-τij(t))|dt+j=1npijuHj-ω|xj(s)|sωkij(t-s)dtds+ωj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiI=0ω|x˙i(t)|dt<ail0ω|xi(t)|dt+j=1nbijuFj0ω|xj(t)|dt+j=1ncijuGj0ω|xj(t-τij(t))|dt+j=1npijuHj0ω|xi(s)|sωkij(t-s)dtds+ωj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiI0ω|x˙i(t)|dt<ail0ω|xi(t)|dt+j=1nbijuFj0ω|xi(t)|dt+j=1ncijuGj0ω|xj(t-τij(t))|dt+j=1nMαpijuHj0ω|xi(s)|ds+ωj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiIailωxi2ω+j=1nbijuFj+cijuGj1-τijD+MαpijuHjωxi2ω+ωj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiIωN+ail+j=1nbijuFj+cijuGj1-τijD+MαpijuHj+ωj=1nbiju|fj(0)|+ciju|gj(0)|+Mαpiju|hj(0)|+JiIRi,

for each i=1,2,..,n. Then, it follows

|xi(t)|N+RiHi,i=1,2,..,n. 27

One may readily verify that Hi,i=1,2,..,n is independent of λ. Again taking (H4) into account, we can get from Lemma 1, that there exists a vector ζ=ζ1,ζ2,,ζnT>0,0,,0T, such that I-Sζ>0,0,,0T. Hence, we can choose a sufficiently large constant σ such that

ζ=ζ1,ζ2,,ζn=σζ1,σζ2,,σζnT>σζ, and that

ζi=σζi>Hi(i=1,2,,n),andI-Sζ>θ. 28

In order to finish our proof we will proceed in three steps:

Step1 let us take

Δ=x(t)Cω:-ζ<x(t)<ζ,tR. 29

Hence Δ is an open bounded set of Cω and for any λ0,1, xΔ . Thus, the condition (1) in Mawhin coincidence theorem is satisfied.

Step 2 we shall use contradiction to demonstrate the condition (2) in Lemma 2. Let us consider that there exists a solution u=u1,u,,unTΔRn of the inclusion

01ω0ωF(t,u)dt=g0(u).

Then u is a constant vector on Rn such that |ui|=ζi for i1,2,..,n.

Therefore, we have for 1<in

0g0(u)=-ui1ω0ωai(t)ui(t)]dt+j=1nfj(u)1ω0ωK[bij(uj(t))]dt+j=1ngj(u)1ω0ωK[cij(uj(t))]dt+j=1n1ωhj(u)0ωK[bij(uj(t))]dt-tkij(t-s)ds+1ω0ωIi(t)dt, 30

or

0=-ui1ω0ωai(t)dt+j=1nfj(u)1ω0ωγij(t)dt+j=1ngj(u)1ω0ωηij(t))dt+j=1nMαhj(u)1ω0ωνij(t)dt+1ω0ωIi(t)dt,i=1,2,..,n, 31

where γij(t)K[bij(ui)], ηij(t)K[cij(ui)] and νij(t)K[pij(ui)]. Then, there exists some t[0,ω) such that

-uiai(t)+j=1n(γij(t)fj(u)+ηij(t)gj(u)+νij(t)Mαhj(u))+Ii(t)=0,i=1,2,..,n. 32

It follows

ζi=|ui|=1ai(t)[j=1nγij(t)fj(u)+ηij(t)gj(u)+νij(t)Mαhj(u)+Ii(t)]1ail[j=1n(biju(Fj(|uj|)+|fj(0)|)+cijuGj(|uj|)+|gj(0)|+MαpijuHj(|uj|)+|hj(0)|)+Iiu,1ail[j=1n(bijuFj(|uj|)+|fj(0)|+cijuGj(|uj|)+|gj(0)|1-τijD+MαpijuHj(|uj|)+|hj(0)|)+Iiu]=j=1nsij|uj|+θi=j=1nsijζj+θi. 33

Therefore (I-S)ζθ, which contradicts the fact (I-S)ζ>θ and the condition 2 of Lemma 2 holds.

Step 3 In order to prove condition 3 let us define homotopic set-valued map

ϕ:ΔRn×0,1Aω

(u,h)hdiag-a¯1,-a¯2,,-a¯nu+1-hg0(u),

where

a¯i=1ω0ωai(t)dt,i=1,2,,n.

if u=u1,u2,,unTΔRn then u is a constant vector on Rn such that |ui|=ζi for some i1,2,,n.

It follows that

ϕu,hi=-ui1ω0ωai(t)ui(t)dt+(1-h)[j=1nfj(u)1ω0ωK[bij(uj(t))]dt+j=1ngj(u)1ω0ωK[cij(uj(t))]dt+j=1nMαhj(u)1ω0ωK[pij(uj(t))]dt+1ω0ωIi(t)dt]. 34

Which implies that

0ϕu,hi,i=1,2,,n. 35

If this is not true, then 0ϕu,hi,i=1,2,,n,, i.e.,

0-ui1ω0ωai(t)ui(t)dt+(1-h)[j=1nfj(u)1ω0ωK[bij(ui(t))]dt+j=1ngj(u)1ω0ωK[cij(ui(t))]dt+j=1nMαhj(u)1ω0ωK[pij(ui(t))]dt+1ω0ωIi(t)dt]. 36

Similarly, there exist γij(t)K[bij(ui)], ηij(t)K[cij(ui)] and νij(t)K[pij(ui)], i=1,2,,n such that

0=(-ui)1ω0ωai(t)dt+(1-h)[j=1nfj(u)1ω0ωγij(t)dt+j=1ngj(u)1ω0ωηij(t))dt+j=1nMαhj(u)1ω0ωνij(t))dt+1ω0ωIi(t)dt],i=1,2,..,n, 37

consequently, there exists some t[0,ω] such that

0=-uiai(t)+(1-h)[j=1nγij(t)fj(u)+ηij(t)gj(u)+Mανij(t)hj(u)+Ii(t)]i=1,2,,n. 38

We derive from (38) that

ζi=|ui|=1-hai(t)[j=1nγij(t)fj(u)+ηij(t)gj(u)+Mανij(t)hj(u)+Ii(t)]1ail[j=1n(bijuFj(|uj|)+|fj(0)|+cijuGj(|uj|)+|gj(0)|+MαpijuHj(|uj|)+|hj(0)|)+Iiu]1ail[j=1n(bijuFj(|uj|)+|fj(0)|+cijuGj(|uj|)+|gj(0)|1-τijD+MαpijuHj(|uj|)+|hj(0)|)+Iiu]=j=1nqij|uj|+θi=j=1nqijζj+θi,

which yields that (I-S)ζθ, which contradicts (I-S)ζ>θ. Thus, (30) holds. Which implies that (0,0,,0)Tϕ(u,h) for any u=(u1,u2,,un)TΔRn,h[0,1]. Thus, using the solution properties of the topological degree and the homotopy invariance, we have degg0,ΔRn,0=degϕu,0,Rn,0=degϕu,1,Rn,0=deg-a¯1u1,-a¯2u2,,-a¯nunT,ΔRn,0

=sign|-a¯100-a¯1|=-1n0. 39

This means that satisfies all the conditions in Lemma 2, then the system (1) possesses at least one ω-periodic solution.

The proof is finished.

Uniqueness and global exponential stability

Now, we will prove the uniqueness and global exponential stability of the ω-periodic solution for the system (1). Mainly, when the system (1) is considered autonomous, we will find the sufficient conditions on the existence, uniqueness and global exponential stability of fixed point of the system.

Definition 6

(Stability) We denote x(t,φ) a periodic solution of the system (1). The periodic solution x(t,ψ) is said to be globally exponentially stable if for any solution x(t,φ) of the system (1), there are constants M1 and μ>0 such that for any φCτ

x(t,φ)-x(t,ψ)Mφ-ψCeμt,t0.

Let us firstly introduce the following lemma.

Lemma 3

10 If fj(±Tj)=0 , gj(±Tj)=0 and hj(±Tj)=0 j=1,,n then for every xj,yjR we have

K[bij(xj(t))]fj(xj)-K[bij(yj(t))]fj(yj)bijuFj|xj-yj|, 40

and

K[cij(xj(t))]Gj(xj)-K[cij(yj(t))]gj(yj)cijuGj|xj-yj|, 41

and

K[pij(xj(t))]Hj(xj)-K[pij(yj(t))]hj(yj)pijuHj|xj-yj|, 42

for i,j=1,2,,n.

Lemma 4

43 Let x(t):[0,+[Rn an absolutely continuous on any compact interval of [0,+[ and V(x):RnR is Clarke’s regular, then x(t) and V(x):RnR are differential for all t[0,+[. We get

ddtν(t)=γ(t)Tx˙(t),γ(t)V(x(t)),

where V(x(t)) is Clarke’s generalized gradient.

Next, we consider the assumption below.

(H5) I-S is an M-matrix, I is the identity matrix of size n,S=sijn×n and

sij=1ailbijuFj+cijuGj+MαpijuHj,i,j=i,j=1,2,,n.

Theorem 2

Suppose that fj(±Tj)=0, gj(±Tj)=0and hj(±Tj)=0 for j=1,,n, and the assumption (H5) holds. If there exists periodic solution x(t,ψ) for system (1), then x(t,ψ) is a unique periodic solution of system (1) and is globally exponentially stable, and for any other solution x(t,φ) of system (1), there exist constants M,μ>0 such that

xi(t,φ)-xi(t,ψ)Rφ-ψ)ce-μt,

for any t>0.

Proof

Consider x(t)=(x1(t),x2(t),,xn(t))T any solution of system (1) and x(t)=(x1(t),x2(t),,xn(t))T is an ω-periodic solution of system (1). We get:

dxi(t)dt-aixi(t)+j=1nK[bij(xj(t))]fjxj(t)+j=1nK[cij(xj(t-τj(t)))]gjxjt-τj(t)+j=1nK[pij(xj(t))]-thjxj(s)ds+Ji],

dxi(t)dt-aixi(t)+j=1nK[bij(xj(t))]fjxj(t)+j=1nK[cij(xj(t-τj(t)))]gjxjt-τj(t)+j=1nK[pij(xj(t))]-tkij(t-s)hjxj(s)ds+Ji].

Assume that yi(t)=xi(t)-xi(t), then

dyi(t)dt-aiyi(t)+j=1nBij(yj(t),xj(t))+j=1nCij(yj(t-τij(t),xj(t-τij(t)))+j=1nMαPij(yj(t),xj(t)), 43

where Bij(u,v), Cij(u,v) and Pij(u,v) are given as following

Bij(u,v)=K[bij(u+v)]fju,v-K[bij(v)]fjxj(t)Cij(u,v)=K[cij(u+v)]gju,v-K[cij(v)]gjxj(t)Pij(u,v)=K[pij(u+v)]hju,v-K[pij(v)]hjxj(t).

Similarly, there exist γij(yj(t))Bij(yj(t),xj(t)), ηij(yj(t-τij(t)))Cij(yj(t-τij(t)),xj(t-τij(t))) and νij(yj(t))Pij(yj(t),xj(t)) verify,

dyi(t)dt-aiyi(t)+j=1nγij(yj(t),yj(t))+j=1nηij(yj(t-τij(t),yj(t-τij(t)))+j=1nMανij(yj(t),yj(t)), 44

for every t[0,T), i=1,2,,n

Taking (44) and Lemma 3 into account, we obtain

γij(yj(t))bijuFj|yj(t)|ηij(yj(t-τij(t)))cijuGj|yj(t-τij(t))|νij(yj(t))pijuHj|yj(t)|

Obviously, basing on (H5), the matrix diag(a1l,a1l,,anl)-(bijuFj+cijuGj+MαpijuHj)n×n is also a nonsingular Mmatrix. In addition, there exists a positive βi(i=1,2,,n) such that

βiail-(bijuFj+cijuGj+MαpijuHj)>0,i=1,2,,n,

As a result, there exists a sufficiently small positive number μ such that

βiail-μ-j=1nβj(bijuFj+cijuGjeμτ+MαpijuHj)>0,i=1,2,,n. 45

We consider the Lyapunov function:

V(t)=maxeμt|yi(t)|βj,i=1,2,,n..

V(t) is differential for all t0 because any solution x(t) of system (1) including the ω-periodic solution x(t) are absolutely continuous.

The function |yi(t)| is locally Lipschitz continuous in yi on R. Hence, the Clarke’s generalized gradient of function |yi(t)| at yi(t) is

(|yi(t)|)=co¯sign(yi(t))=-1ifyi(t)<0,-1,1ifyi(t)=0,-1ifyi(t)>0.

For a given t0, there exists a k1,,n such that V(t)=eμt|yk(t)|βk, and let vk(t)=sign(yk(t), if yk(t)0, while vk(t) can be arbitrarily chosen in [-1,1], if yk(t)=0. From Lemma 4 and system (44), it follows for all t0 :

V˙(t)=μV(t)+Vk(t)eμty˙k(t)|βk-(ak(t)-μ)V(t)+eμtβkj=1n|γij(yj(t))|+eμtβkj=1n|ηij(yj(t-τij(t)))|+eμtβkj=1nMα|νij(yj(t))|-akl-μV(t)+1βkj=1nbijuFjβjV(t)+j=1ncijuGjβjeμτij(t)V(t-τij(t))+j=1nMαpijuHjβjV(t)-1βk-akl-μβk-j=1nbijuFj+cijuGjeμτ+MαpijuHjβjV(t)0, 46

when V(t+s)V(t) for any s-τ,0. Let V¯(t)=sup-τs0V(t+s), then we get

V¯(t)dt0,t-τ 47

Therefore

|yj(t)|βiV(t)e-μtβiV(0)e-μt, 48

for all i=1,,n. Thus, for any t>0,

y(t)yk(t)(t)e-μti=1nβi/βk.

Moreover,

x(t)-x(t)Rφ-ψce-μt,

where R=i=1nβi/βmin,x(t)=x(t,φ) and x(t)=x(t,ψ).

Hence, the ω-periodic solution x(t) of system (1) is globally exponentially stable. Then, the periodic solution x(t) of system (1) is unique. The proof is complete.

Theorem 3

Consider that fj(±Tj)=0, gj(±Tj)=0 and hj(±Tj)=0 (j=1,,n), and the assumption (H4) is satisfied. Then system (1) has a unique periodic solution x(t,ψ), and it is globally exponentially stable.

Next, we demonstrate the existence and global exponential stability of the equilibrium point for autonomous neural network model (1).

Let ail=ai,biju=max|b^ij|,|bˇij|, ciju=max|c^ij|,|cˇij| piju=max|p^ij|,|pˇij| in the assumption (H4) and (H5) for system (1).

Firstly, for autonomous system (1), using Theorems 1 and 3 we can get the following result.

Corollary 1

Consider that fj(±Tj)=0 and gj(±Tj)=0, hj(±Tj)=0 and τij(t)τij, where τiji,j=1,2,,n are all nonnegative constants. if (H5) is satisfied, then there exists a unique equilibrium point x for system (1), which is globally exponentially stable.

Proof

Clearly, system (1) is an ω-periodic system, then, basing on Theorems 1 and 2, for any constant ω>0 system (1) possesses a unique ω-periodic solution x(t) and it is globally exponentially stable.

Let x(t) be unique for all ω>0 , then we have x(t+ω)=x(t) for any constants ω>0 and t0. Hence x(t)x for all t0.

Thus x=x(0) is an equilibrium point of system (1) and x is unique and globally exponentially stable.

Theorem 4

Consider that fj(±Tj)=0 and gj(±Tj)=0j=1,2,,n. Since (H5) holds, there exists an uniqueness equilibrium point x for system (1), which is globally exponentially stable.

From the assumption (H5), there exist positive constants βii=1,2,,n such that

βiail-j=1nβjbijuFj+cijuGj+MαpijuHj>0,i=1,,n.

After that, let a set-valued map Γ(u)=Γ1(u),Γ1(u),,Γn(u)T, and

Γi(u)=βi[j=1nK[bij(ujβjai)]fjujβjai+j=1nK[cij(ujβjai)]gjxjujβjai+j=1nK[pij(ujβjai)]-tkij(t-s)hjxjujβjaids+Ji], 49

for i=1,2,,n, where u=u1,,unT .

Using Lemma 3, for any two vectors u=(u1,,un)TRn and v=(v1,,vn)TRn, we have

|Γi(u)-Γi(v)|=βi[j=1nK[bij(ujβjai)]fjujβjai-K[bij(ujβjai)]fjvjβjai+j=1nK[cij(ujβjai)]gjxjujβjai-j=1nK[cij(ujβjai)]gjxjvjβjai+j=1nMαK[pij(ujβjai]hjujβjaids-j=1nMαK[pij(ujβjai)]hjvjβjai], 50

for i=1,2,,n, then,

Γi(u)-Γi(v)σu-v, 51

where

σ=max1in1βiailj=1nβjbijuFj+cijuGj+MαpijuHj, 52

and 0<σ<1. Thus, the map Γ:RnRn is a contraction mapping on Rn. It follows that, there is a unique fixed point uRn such that uΓ(u), i.e.,

uiβi[j=1nK[bij(ujβjai)]fjujβjai+j=1nK[cij(ujβjai)]gjujβjai+j=1nMαK[pij(ujβjai)]hjujβjai+Ji]

for i=1,,n. Let xj=ujβjai for i=1,,n, then

ui-aixi+j=1nK[bij(xj)]fjxj+j=1nK[cij(xj)]gjxj+j=1nMαK[pij(xj)]hjxj+Ji.

where i=1,,n, and u is unique, we obtain that system (1) has a unique equilibrium x.

Thus, following the proof of Theorem 1, we prove easily that equilibrium x of system (1) is globally exponentially stable.

Finite-time periodic synchronization

In this section, we will examine the finite-time synchronization problem of delayed memristive neural networks.

For this purpose, we consider the delayed memristive neural network model (1) as the drive system, and a controlled response system is modeled by the following functional differential equation:

y˙i(t)=-ai(t)yi(t)+j=1n[bij(t)fj(yj(t))+cij(t)gj(yj(t-τij(t)))+pij(t)-tkij(t-s)hj(yj(s))ds+Ji(t)]+vi(t) 53

where yi(t) is the controller to be designed.

Definition 7

The memristive neural network (1) is said to be completely synchronized onto (53) in finite time if by designing a suitable controller vi(t) to system (53), there exists a constant t1>0 (t1 depends on the initial value), satisfying

limtt1yi(t)-xi(t)=0;yi(t)-xi(t)0,fori=1,2,..n,t>t1

We take ei(t)=xi(t)-yi(t) the error term. Then, one can obtain the following result.

Theorem 5

We consider that then system (1) exists at least one w-periodic solution. If there exists a positive definite matrix S satisfying

Z1=-A+12S+B_F+MαP_H12C_G-12S<0.
Z2=-A+12S+B¯F+MαP_H12C¯G-12S<0,

where F=diag(F1,F2,Fn), G=diag(G1,G2,Gn), H=diag(H1,H2,Hn), B_=diag(b_1,b_2,b_n), B¯=diag(b¯1,b¯2,b¯n), C_=diag(c_1,c_2,c_n), C¯=diag(c¯1,c¯2,c¯n), then system (53) can synchronize onto system (1) in a finite time t1=2kV120 and to adapt to changes in the process that occur with time, we define the adaptive controller

vi(t)=-oi(t)ei(t), 54

and adaptive updated law, where

o˙i(t)=εiei2t-lieitoi(t)sign(eit)-keitoi(t)sign(eit)-kεisign(oit)-kλmax(P)t-τ0ei2(s)ds12),

and

V(0)=12eT(0)e(0)+12-τ0eT(s)Se(s)ds+12i=1n1εioi2(0).

εi>0 is a constant, k>0 is a tunable constant,

ιi>0,i=1,2,,n, are the control parameters to be determined and satisfies:

ιi|A|Ti+j=1nFj|b¯ij-b_ij|Ti+j=1n|b¯ij-b_ij|Gjj=1nMα|p¯ij-p_ij|Hj.

Proof

Set Λ=diago1(t),o2(t),on(t). Consider the following Lyapunov functional:

V(t)=12eT(t)e(t)+12t-τ0eT(s)Se(s)ds+12i=1n1εioi2(t). 55

The master model (1) and the slave model (53) are state-dependent switching systems, hence, we can divide the error system into the following four cases at time t.

Case 1 If |xi(t)|>Ti, |yi(t)|Ti, at time t, then the master system (1) and the slave system (53) decrease respectively, to the following models:

x˙i(t)=-ai(t)xi(t)+j=1nb_ij(t)fj(xj(t))+c_ij(t)gj(xj(t-τij(t)))+p_ij(t)-tkij(t-s)hj(xj(s))ds+Ji(t), 56

and

y˙i(t)=-ai(t)yi(t)+j=1nb_ij(t)fj(yj(t))+c_ij(t)gj(yj(t-τij(t)))+p_ij(t)-tkij(t-s)hj(yj(s))ds+ui(t)+Ji(t). 57

Correspondingly, the error system can be written as

e˙i(t)=-ai(t)ei(t)+j=1nb_ij(t)fj(ej(t))+c_ij(t)gj(ej(t-τij(t)))+p_ij(t)-tkij(t-s)hj(ej(s))ds+ui(t). 58

Let us denote fj(ej(t))=fj(xj(t))-fj(yj(t)); gj(ej(t-τ))=gj(xj(t-τ))-gj(yj(t-τ)) and hj(ej(t))=hj(xj(t))-hj(yj(t)). Under assumption (H2), evaluating the derivation of V(t) along the trajectory of error system gives

V˙(t)=eT(t)-Ae(t)+B_f(e(t))+C_ge(t-τ)+MαP_h(e(t))+u(t)+12eT(t)Se(t)-12eT(t-τ)Se(t-τ)+12i=1noi(t)(ei2(t)-liei(t)oi(t)sign(ei(t))-kei(t)oi(t)sign(ei(t))-kεisign(oi(t))-kλmax(S)t-τtei2(s)ds12)-eT(t)Ae(t)+eTB_Fe(t)+eTC_Ge(t-τ)+eTMαP_He(t)-eT(t)Λe(t)+12eT(t)Se(t)-12eT(t-τ)Se(t-τ)+eT(t)Λe(t)-i=1nιi|ei(t)|-ki=1n|ei(t)|-ki=1n1εi|oi(t)|-kt-τteT(s)Se(s)ds12eT(t),eT(t-τ)Z1eT(t),eT(t-τ)T-i=1nιi|ei(t)-ki=1n|ei(t)||-ki=1n1εi|oi(t)|-kt-τteT(s)Se(s)ds12. 59

Using previous results, we obtain

V˙(t)-ki=1n|ei(t)|212-kt-τteT(s)Se(s)ds12-ki=1n1εi|oi(t)|.

By Lemma 1, one has

V˙(t)-2k12eT(t)e(t)+12t-τteT(s)Se(s)ds+12i=1n1εioi2(t)12=-2kV12(t).

Case 2 Let |xi(t)|>Ti ,|yi(t)|>Ti at time t, then the master system (1) and the slave system (53) decrease to the following systems:

x˙i(t)=-ai(t)xi(t)+j=1nb¯ij(t)fj(xj(t))+j=1nc¯ij(t)gj(xj(t-τij(t)))+j=1np¯ij(t)-tkij(t-s)hj(xj(s))ds+Ji(t), 60

and

y˙i(t)=-ai(t)yi(t)+j=1nb¯ij(t)fj(yj(t))+c¯ij(t)gj(yj(t-τij(t)))+p¯ij(t)-tkij(t-s)hj(yj(s))ds+Ji(t)+ui(t). 61

Hence, we obtain the following error system

e˙i(t)=-ai(t)ei(t)+j=1nb¯ij(t)fj(ej(t))+c¯ij(t)gj(ej(t-τij(t)))+p¯ij(t)-tkij(t-s)hj(ej(s))ds+wi(t). 62

Similarly, we write

V˙(t)eT(t),eT(t-τ)Z2eT(t),e(t-τ)T-i=1nli|ei(t)-ki=1n|ei(t)||-ki=1n1εi|oi(t)|-kt-τteT(s)Se(s)ds12. 63

According to Lemmas 1, it follows

V˙(t)-2k12eT(t)e(t)+12t-τteT(s)Se(s)ds+12i=1n1εioi2(t)12=-2kV12(t).

Case 3 If |xi(t)|>Ti , |yi(t)|Ti at time t, then the master system (1) and the slave system (53) reduce to (60) and (61). Correspondingly, the error system can be written as

e˙i(t)=-ai(t)ei(t)+j=1nb¯ij(t)fj(ej(t))+j=1nc¯ij(t)gj(ej(t-τij(t)))+j=1np¯ij(t)-tkij(t-s)hj(ej(s))ds+a¯i(t)-a_i(t)yi(t)+j=1nb_ij(t)-b¯ij(t)fj(yj(t))+j=1nc_ij(t)-c¯ij(t)gj(yj(t-τij(t)))+j=1np_ij(t)-p¯ij(t)-tkij(t-s)hj(yj(s))ds+ui(t). 64

evaluating the derivation of V(t) along the trajectory of (68), we have

V˙i(t)=i=1nei(t)[-ai(t)ei(t)+j=1nb¯ij(t)fj(ej(t))+j=1nc¯ij(t)gj(ej(t-τij(t)))+j=1np¯ij(t)-tkij(t-s)hj(ej(s))ds+|a_i-a¯i||yi(t)|+j=1n|b_ij-b¯ij||fj(yj(t))|+j=1n|c_ij-c¯ij||gj(yj(t-τij(t)))|+j=1n|p_ij-p¯ij|-tkij(t-s)|hj(yj(s))|ds+ui(t)]+12eT(t)Se(t)-12eT(t-τ)Se(t-τ)+i=1noi2(t)-liei(t)oi(t)sign(ei(t))-kei(t)oi(t)sign(ei(t))-kεisign(oi(t))-kλmax(S)t-τ0ei2(s)ds12]-eT(t)Ae(t)+eTB¯Fe(t)+eTC¯Ge(t-τ)+MαP¯He(t)-eT(t)Λe(t)+12eT(t)Se(t)-12eT(t-τ)Se(t-τ)+eT(t)Λe(t)-i=1n|ei(t)|-ki=1n|ei(t)|-ki=1n1εi|oi(t)|-kt-τteT(s)Se(s)ds12+j=1n[|ai|Ti+j=1nFj|b_ij-b¯ij|Ti+j=1n|c_ij-c¯ij|Gj-li]|ei(t)|+j=1nMαHj|p_ij-p¯ij|eT(t),eT(t-τ)Z2eT(t),e(t-τ)T-ki=1n|ei(t)|-ki=1n1εi|oi(t)|-kt-τteT(s)Se(s)ds12+j=1n[|ai|Ti+j=1nFj|b¯i-b_ij|Ti+j=1n|c¯ij-c_ij|Gj+j=1nMαHj|p_ij-p¯ij|Ti-li]|ei(t)|.

In consideration of the definition li and Z2, one has V˙i(t)-2kV12(t).

Case 4. Let |xi(t)|Ti , |yi(t)|>Ti at time t, then the master system (1) and the slave system (53) reduce to (60) and (62). Then, we obtain the following error system:

e˙i(t)=-ai(t)ei(t)+j=1nb¯ij(t)fj(ej(t))+j=1nc¯ij(t)gj(ej(t-τij(t)))+j=1np¯ij(t)-tkij(t-s)hj(ej(s))ds+ai(t)xi(t)+j=1nb¯i(t)-b_ij(t)fj(xj(t))+j=1nc¯ij(t)-c_ij(t)gj(xj(t-τij(t)))+j=1np¯ij(t)-p_ij(t)-tkij(t-s)hjxj(s)ds+ui(t). 65

Consider |xi(t)|Ti , we obtain

V˙i(t)eT(t),eT(t-τ)Z2eT(t),e(t-τ)T-ki=1n|ei(t)|-ki=1n1εi|oi(t)|-kt-τteT(s)Se(s)ds12+j=1n[|ai|Ti+j=1nFj|b_i-b¯ij|Ti+j=1n|c_ij-c¯ij|Gj+j=1n|c_ij-c¯ij|MαHj-li|]ei(t)-2kV12(t)|

Or V(t)=0 for tt1 with t1=2kV12(0) , hence ei(t)=0 for tt1, i=1,2,,n. According to definition 5, the salve system (53) is finite-timely synchronized onto the master system (1) under the designed controller (54). This completes the proof.

Numerical example

In this section, numerical example is given to show the effectiveness of our results. We consider the two-dimensional mermristor-based recurrent neural networks described by the following system:

x˙i(t)=-aixi(t)+j=12(bijfj(xj(t))+cijgj(xj(t-τij(t)))+pij-tkij(t-s)hj(xj(s))ds+Ji(t),

where i=1,22, a1=[34], τij(t)=15cos(t) and for all xR

fj(x)=gj(x)=hj(x)=ϕj(x)=|x+1|-|x-1|2b11(x1(t))=-0.1,|x1(t)|<11,|x1(t)|>1,b12(x1(t))=cos(t),|x1(t)|<1-0.5,|x1(t)|>1b21(x2(t))=-0.5sin(t),|x2(t)|<11,|x2(t)|>1,b22(x2(t))=0.1cos(t),|x2(t)|<1-1,|x2(t)|>1c11(x1(t))=0.5,|x1(t)|<11,|x1(t)|>1,c12(x1(t))=2sin(t),|x1(t)|<1-0.3cos(-t),|x1(t)|>1c21(x2(t))=0.2sin(t),|x2(t)|<1sin(t),|x2(t)|>1,c22(x2(t)=0.1cos(t),|x2(t)|<1-1,|x2(t)|>1p11(x1(t))=0.5,|x1(t)|<1-0.5,|x1(t)|>1,p12(x1(t))]=2sin(t),|x1(t)|<11.5,|x1(t)|>1p21(x2(t))=-0.2sin(t),|x2(t)|<11,|x2(t)|>1,p22(x2(t))]=0.5cos(t),|x2(t)|<11,|x2(t)|>1M=0.4,α=5.J=[0.1sin(t);0.2cos(t)];

We easily calculate

I-S=0.490.840.650.07. Thus, the conditions required in Theorem 1 are satisfied. When I (t) is a periodic function, in the view of Theorem 1, this neural network has at least one periodic solution. It is clear that I-S is an M-matrix. Then theorem 4 holds and the system has a unique equilibrium point x, which is globally exponentially stable.

After simulation of these two systems using matlab Toobox,we obtain the graphical illustration Figs. 2 and  3 shows the periodic dynamic behaviors of the output of the two neurons which are in accordance with theoretical results.

Figure 2.

Figure 2

The state trajectories of x1(t).

Figure 3.

Figure 3

The state trajectories of x2(t).

To prove the effectiveness of our result on finite-time synchronization we consider the master system the above simulated example and the following system is the slave.

Let consider the following response RNN:

y˙i(t)=-aixi(t)+j=12bijfj(yj(t))+j=12cijgj(yj(t-τj))+j=12pij(t)-tkij(t-s)hj(yj(s))ds+ui(t).

We choose n=2 neurons and ui(t)=exp(-0.5×t) and the initial states x=[0.5;0.2];y=[0.7;0.3];

ei(t)=xi(t)-yi(t),i=1,2.

We obtain in the following the simulation results: the two neurons tend to have the same trajectories in Figs. 4 and 5. Figs. 6 and 7 describes the time responses of finite-time synchronization errors and the trajectory turns to zero quickly as time goes and t1=4.4 and t2=2.9.

Figure 4.

Figure 4

Time-domain behavior of the state variables x1(t) and y1(t).

Figure 5.

Figure 5

Time-domain behavior of the state variables x2(t) and y2(t).

Figure 6.

Figure 6

Phase plane behavior of the master system and the slave system.

Figure 7.

Figure 7

Finite-Time synchronization error.

Conclusions

In this paper, we study a memristive recurrent neural networs by giving assumptions for the existence and uniqueness of periodic solution. In addition, we detemine sufficient conditions that ensure the global exponential stability of this solution. Further more, we garantee the finite-synchronization problem of delayed memristive by determining several assymptions.

Meanwhile, the theoretical proposed model can be tested in practical issues like brain computing interface, image processing, pattern recognition and intelligent control. In our ongoing future works, the proposed neural network model will be adjusted to analyze the electroencephalography (EEG) data for implementing continuous vigilance estimation using EEG signals acquired by wearable dry electrodes in both simulated and real driving environments. Also, MNN synchronization and EEG signals can be combined to study the brain dynamics at rest following a perturbation.

Acknowledgements

This work was supported by the Princess Nourah bint Abdulrahman University Researchers project number (PNURSP2023R387), Princess Nourah bint Abdulrahman University, Riyadh, Saudi Arabia.It has been, also, funded by the Ministry of Higher Education and Scientific Research of Tunisia under Grant Agreement number LR11ES48.

Author contributions

H.B.: Conceptualization, Methodology, Writing—original draft, Writing prepared Figs. 1, 4 and 5 and editing. B.A. and A.K.: Writing—prepared Figs. 2 and 3 review and editing, Methodology. F.C.: Validation, Editing. G.A. and A.M.A.: Validation, Conceptualization, Supervision. All authors reviewed the manuscript.

Data availability

The data that support the findings of this study are available from author Hajer Brahmi but restrictions apply to the availability of these data, which were used under license for the current study, and so are not publicly available. Data are however available from the authors upon reasonable request and with permission of the author Hajer Brahmi.

Competing interests

The authors declare no competing interests.

Footnotes

Publisher's note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Yu Y, Si X, Hu C, Zhang J. A review of recurrent neural networks: Lstm cells and network architectures. Neural Comput. 2019;31:1235–1270. doi: 10.1162/neco_a_01199. [DOI] [PubMed] [Google Scholar]
  • 2.Yan B, He S, Sun K. Design of a network permutation entropy and its applications for chaotic time series and eeg signals. Entropy. 2019;21:849. doi: 10.3390/e21090849. [DOI] [Google Scholar]
  • 3.Fourati R, Ammar B, Sanchez-Medina J, Alimi AM. Unsupervised learning in reservoir computing for eeg-based emotion recognition. IEEE Trans. Affect. Comput. 2020;13:2. [Google Scholar]
  • 4.Liu P-L. Delay-dependent robust stability analysis for recurrent neural networks with time-varying delay. Int. J. Innov. Comput. Inf. Control. 2013;9:3341–3355. [Google Scholar]
  • 5.Chen RT, Rubanova Y, Bettencourt J, Duvenaud DK. Neural ordinary differential equations. Adv. Neural Inf. Process. Syst. 2018;31:1. [Google Scholar]
  • 6.Ammar B, Chérif F, Alimi AM. Existence and uniqueness of pseudo almost-periodic solutions of recurrent neural networks with time-varying coefficients and mixed delays. IEEE Trans. Neural Netw. Learn. Syst. 2011;23:109–118. doi: 10.1109/TNNLS.2011.2178444. [DOI] [PubMed] [Google Scholar]
  • 7.Abdelaziz M, Chérif F. Stability analysis of delayed fuzzy Cohen–Grossberg neural networks with discontinuous activations. Int. J. Adapt. Control Signal Process. 2020;34:1120–1134. doi: 10.1002/acs.3126. [DOI] [Google Scholar]
  • 8.Selverston AI, Ayers J. Oscillations and oscillatory behavior in small neural circuits. Biol. Cybern. 2006;95:537–554. doi: 10.1007/s00422-006-0125-1. [DOI] [PubMed] [Google Scholar]
  • 9.Brahmi H, Ammar B, Chérif F, Alimi AM. Stability and exponential synchronization of high-order hopfield neural networks with mixed delays. Cybern. Syst. 2017;48:49–69. doi: 10.1080/01969722.2016.1262709. [DOI] [Google Scholar]
  • 10.Chen J, Zeng Z, Jiang P. On the periodic dynamics of memristor-based neural networks with time-varying delays. Inf. Sci. 2014;279:358–373. doi: 10.1016/j.ins.2014.03.124. [DOI] [Google Scholar]
  • 11.Cherif F. Analysis of global asymptotic stability and pseudo almost periodic solution of a class of chaotic neural networks. Math. Model. Anal. 2013;18:489–504. doi: 10.3846/13926292.2013.840686. [DOI] [Google Scholar]
  • 12.Ammar B, Brahmi H, Chérif F. On the weighted pseudo-almost periodic solution for bam networks with delays. Neural Process. Lett. 2018;48:849–862. doi: 10.1007/s11063-017-9725-0. [DOI] [Google Scholar]
  • 13.Ziyin L, Hartwig T, Ueda M. Neural networks fail to learn periodic functions and how to fix it. Adv. Neural. Inf. Process. Syst. 2020;33:1583–1594. [Google Scholar]
  • 14.Brahmi H, Ammar B, et al. Deep learning and intelligent robots in government. In: Valle-Cruz D, et al., editors. Handbook of Research on Applied Artificial Intelligence and Robotics for Government Processes. IGI Global; 2023. pp. 1–34. [Google Scholar]
  • 15.Zhang A, Qiu J, She J. Existence and global exponential stability of periodic solution for high-order discrete-time bam neural networks. Neural Netw. 2014;50:98–109. doi: 10.1016/j.neunet.2013.11.005. [DOI] [PubMed] [Google Scholar]
  • 16.Abbas A, Bassil Y, Keilholz S. Quasi-periodic patterns of brain activity in individuals with attention-deficit/hyperactivity disorder. NeuroImage Clin. 2019;21:101653. doi: 10.1016/j.nicl.2019.101653. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 17.Li Q, Lin T, Shen Z. Deep learning via dynamical systems: An approximation perspective. J. Eur. Math. Soc. 2022;1:1. [Google Scholar]
  • 18.Kendall JD, Kumar S. The building blocks of a brain-inspired computer. Appl. Phys. Rev. 2020;7:011305. doi: 10.1063/1.5129306. [DOI] [Google Scholar]
  • 19.Yang H, Zhang J, Li S, Lei J, Chen S. Attend it again: Recurrent attention convolutional neural network for action recognition. Appl. Sci. 2018;8:383. doi: 10.3390/app8030383. [DOI] [Google Scholar]
  • 20.Castelo-Branco M, Neuenschwander S, Singer W. Synchronization of visual responses between the cortex, lateral geniculate nucleus, and retina in the anesthetized cat. J. Neurosci. 1998;18:6395–6410. doi: 10.1523/JNEUROSCI.18-16-06395.1998. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 21.Kleinbub JR, Talia A, Palmieri A. Physiological synchronization in the clinical process: A research primer. J. Couns. Psychol. 2020;67:420. doi: 10.1037/cou0000383. [DOI] [PubMed] [Google Scholar]
  • 22.Wang H, Liu S, Wu X. Synchronization analysis of fractional delayed memristive neural networks via event-based hybrid impulsive controllers. Neurocomputing. 2023;528:75. doi: 10.1016/j.neucom.2023.01.064. [DOI] [Google Scholar]
  • 23.Hamad AA, Al-Obeidi AS, Al-Taiy EH, Khalaf OI, Le D. Synchronization phenomena investigation of a new nonlinear dynamical system 4d by Gardano’s and Iyapunov’s methods. Comput. Mater. Continua. 2021;66:3311–3327. doi: 10.32604/cmc.2021.013395. [DOI] [Google Scholar]
  • 24.Abdelaziz M, Chérif F. The synchronization and stability analysis of delayed fuzzy Cohen–Grossberg neural networks via nonlinear measure method. J. Exp. Theor. Artif. Intell. 2022;34:215–234. doi: 10.1080/0952813X.2021.1871663. [DOI] [Google Scholar]
  • 25.Abdelaziz M, Chérif F. Exponential lag synchronization and global dissipativity for delayed fuzzy Cohen–Grossberg neural networks with discontinuous activations. Neural Process. Lett. 2020;51:1653–1676. doi: 10.1007/s11063-019-10169-8. [DOI] [Google Scholar]
  • 26.Strukov DB, Snider GS, Stewart DR, Williams RS. The missing memristor found. Nature. 2008;453:80–83. doi: 10.1038/nature06932. [DOI] [PubMed] [Google Scholar]
  • 27.Adamatzky, A. & Chua, L. Memristor Networks (2013).
  • 28.Chua L. Memristor-the missing circuit element. IEEE Trans. Circuit Theory. 1971;18:507–519. doi: 10.1109/TCT.1971.1083337. [DOI] [Google Scholar]
  • 29.Yang, C., Zhong, K., Zhu, S. & Shen, Y. Algebraic Conditions for Synchronization Stability of Memristive Neural Networks 5055–5058 (2014).
  • 30.Jo SH, et al. Nanoscale memristor device as synapse in neuromorphic systems. Nano Lett. 2010;10:1297–1301. doi: 10.1021/nl904092h. [DOI] [PubMed] [Google Scholar]
  • 31.He S, Zhan D, Wang H, Sun K, Peng Y. Discrete memristor and discrete memristive systems. Entropy. 2022;24:786. doi: 10.3390/e24060786. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 32.Wu A, Zeng Z. Exponential stabilization of memristive neural networks with time delays. IEEE Trans. Neural Netw. Learn. Syst. 2012;23:1919–1929. doi: 10.1109/TNNLS.2012.2219554. [DOI] [PubMed] [Google Scholar]
  • 33.Kozma R, Pino RE, Pazienza GE. Advances in Neuromorphic Memristor Science and Applications. Springer; 2012. [Google Scholar]
  • 34.Guo Z, Yang S, Wang J. Global exponential synchronization of multiple memristive neural networks with time delay via nonlinear coupling. IEEE Trans. Neural Netw. Learn. Syst. 2014;26:1300–1311. doi: 10.1109/TNNLS.2014.2354432. [DOI] [PubMed] [Google Scholar]
  • 35.Xu C, Li P. Periodic dynamics for memristor-based bidirectional associative memory neural networks with leakage delays and time-varying delays. Int. J. Control Autom. Syst. 2018;16:535–549. doi: 10.1007/s12555-017-0235-7. [DOI] [Google Scholar]
  • 36.Wu H, Li R, Zhang X, Yao R. Adaptive finite-time complete periodic synchronization of memristive neural networks with time delays. Neural Process. Lett. 2015;42:563–583. doi: 10.1007/s11063-014-9373-6. [DOI] [Google Scholar]
  • 37.Filippov, A. F. Differential Equations with Discontinuous Righthand Sides: Control Systems, Vol. 18 (2013).
  • 38.Higham NJ. Stable iterations for the matrix square root. Numer. Algorithms. 1997;15:227–242. doi: 10.1023/A:1019150005407. [DOI] [Google Scholar]
  • 39.Ray, M. B. Monotone Iterative Techniques for the Numerical Solution of Nonlinear Neumann Problems (1981).
  • 40.Hiriart-Urruty J-B, Lewis AS. The Clarke and Michel–Penot subdifferentials of the eigenvalues of a symmetric matrix. Comput. Optim. Appl. 1999;13:13–23. doi: 10.1023/A:1008644520093. [DOI] [Google Scholar]
  • 41.Clarke FH. Generalized gradients and applications. Trans. Am. Math. Soc. 1975;205:247–262. doi: 10.1090/S0002-9947-1975-0367131-6. [DOI] [Google Scholar]
  • 42.Gaines RE, Mawhin JL. Coincidence Degree and Nonlinear Differential Equations. Springer; 2006. [Google Scholar]
  • 43.Clarke FH. Generalized gradients of lipschitz functionals. Adv. Math. 1981;40:52–67. doi: 10.1016/0001-8708(81)90032-3. [DOI] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The data that support the findings of this study are available from author Hajer Brahmi but restrictions apply to the availability of these data, which were used under license for the current study, and so are not publicly available. Data are however available from the authors upon reasonable request and with permission of the author Hajer Brahmi.


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES