improved synchronization analysis of competitive neural ...84 a. arbi et al. 2 methodology and...

21
ISSN 1392-5113 https://doi.org/10.15388/NA.2018.1.7 Nonlinear Analysis: Modelling and Control, 2018, Vol. 23, No. 1, 82–102 Improved synchronization analysis of competitive neural networks with time-varying delays Adnène Arbi a,b,c , Jinde Cao d,e , Ahmed Alsaedi f a Higher Institute of Applied Sciences and Technology of Kairouan, University of Kairouan, 3100 Kairouan, Tunisia b Tunisia Polytechnic School, University of Carthage, El Khawarizmi Street, Carthage 2078, Tunisia c Faculty of Sciences of Bizerta, University of Carthage, BP W, Jarzouna 7021, Bizerta, Tunisia [email protected]; [email protected] d School of Mathematics, Research Center for Complex Systems and Network Sciences, Southeast University, Nanjing 210996, China [email protected]; [email protected] e Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia f Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia [email protected] Received: April 6, 2017 / Revised: September 15, 2017 / Published online: December 14, 2017 Abstract. Synchronization and control are two very important aspects of any dynamical systems. Among various kinds of nonlinear systems, competitive neural network holds a very important place due to its application in diverse fields. The model is general enough to include, as subclass, the most famous neural network models such as competitive neural networks, cellular neural networks and Hopfield neural networks. In this paper, the problem of feedback controller design to guarantee synchronization for competitive neural networks with time-varying delays is investigated. The goal of this work is to derive an existent criterion of the controller for the exponential synchronization between drive and response neutral-type competitive neural networks with time-varying delays. The method used in this brief is based on feedback control gain matrix by using the Lyapunov stability theory. The synchronization conditions are given in terms of LMIs. To the best of our knowledge, the results presented here are novel and generalize some previous results. Some numerical simulations are also represented graphically to validate the effectiveness and advantages of our theoretical results. Keywords: competitive neural networks, time-varying delays, global exponential synchronization, Lyapunov functional. c Vilnius University, 2018

Upload: others

Post on 13-Mar-2020

1 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

ISSN 1392-5113https://doi.org/10.15388/NA.2018.1.7

Nonlinear Analysis: Modelling and Control, 2018, Vol. 23, No. 1, 82–102

Improved synchronization analysis of competitive neuralnetworks with time-varying delays

Adnène Arbia,b,c, Jinde Caod,e, Ahmed Alsaedif

aHigher Institute of Applied Sciences and Technology of Kairouan,University of Kairouan,3100 Kairouan, TunisiabTunisia Polytechnic School, University of Carthage,El Khawarizmi Street, Carthage 2078, TunisiacFaculty of Sciences of Bizerta, University of Carthage,BP W, Jarzouna 7021, Bizerta, [email protected]; [email protected] of Mathematics,Research Center for Complex Systems and Network Sciences,Southeast University,Nanjing 210996, [email protected]; [email protected] of Science, King Abdulaziz University,Jeddah 21589, Saudi ArabiafDepartment of Mathematics, King Abdulaziz University,Jeddah 21589, Saudi [email protected]

Received: April 6, 2017 / Revised: September 15, 2017 / Published online: December 14, 2017

Abstract. Synchronization and control are two very important aspects of any dynamical systems.Among various kinds of nonlinear systems, competitive neural network holds a very important placedue to its application in diverse fields. The model is general enough to include, as subclass, the mostfamous neural network models such as competitive neural networks, cellular neural networks andHopfield neural networks. In this paper, the problem of feedback controller design to guaranteesynchronization for competitive neural networks with time-varying delays is investigated. The goalof this work is to derive an existent criterion of the controller for the exponential synchronizationbetween drive and response neutral-type competitive neural networks with time-varying delays. Themethod used in this brief is based on feedback control gain matrix by using the Lyapunov stabilitytheory. The synchronization conditions are given in terms of LMIs. To the best of our knowledge, theresults presented here are novel and generalize some previous results. Some numerical simulationsare also represented graphically to validate the effectiveness and advantages of our theoreticalresults.

Keywords: competitive neural networks, time-varying delays, global exponential synchronization,Lyapunov functional.

c© Vilnius University, 2018

Page 2: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 83

1 Introduction

Classical concepts of the synchronization phenomenon are based on the notions of close-ness of the frequencies or phases of the subsystems generating periodic oscillations. Usingthe traditional language of dynamical systems with continuous time, one can reveal hatsynchronization of periodic oscillations that may be represented as follows. While a stablelimit cycle is a geometrical image of such oscillations, an attracting two-dimensional (orn-dimensional) torus is a geometrical image of the oscillations generated by two (or n)uncoupled oscillators in a common phase space. As the parameter of coupling increases,the motions of partial subsystems are no longer independent, and a stable limit cycle isborn on the torus that is still an attractor. This corresponds to the transition of the systemto synchronization. The analysis of periodic systems incorporating full-time informationleads to challenging control problems with a rich mathematical structure. Meanwhile,as a typical complex system, delayed neural networks have been verified to exhibit somecomplex and unpredictable behaviors such as periodic oscillations, bifurcation and chaoticattractors. Since synchronization of neural networks has been shown to be an importantstep toward both fundamental science and technological practice, much of the focushas been received and numerous research results have been reported in the literature[6, 12, 15, 26]. Many methods have been developed for synchronizing of chaos such asLMI based approach [13], adaptive control [18], passivity feedback control [24].

On the other hand, many researches have been devoted to the dynamics of variousclasses of neural networks (see [3, 7–10, 14, 27]). Furthermore, there is few works aboutthe so-called competitive neural networks proposed for the first time by Meyer-Baese etal. (see [19,21,22,25]), who used them to model the dynamics of cortical cognitive mapswith unsupervised synaptic modifications. The model of competitive neural networks isdifferent from the traditional neural networks with first-order interactions. In [9], basedon Lyapunov functional method and Kronecker product technique, the authors proposedsome sufficient conditions for global synchronization of neutral-type neural networkswith constant and delayed coupling. In [10], there is proposed a simple adaptive couplingenhancement algorithm for the synchronization of two coupled identical time-varying de-layed neural networks based on the invariant principle of functional differential equations.

As a continuation of their previous published results, in this paper, we consider a targetmodel with two different state variables: the short-term memory (STM) variable de-scribing the fast neural activity and the long-term memory (LTM) variable describingthe slow unsupervised synaptic modifications. In addition, it has been reported that ifthe parameters and time delays are appropriately chosen, the delayed competitive neuralnetworks can exhibit complicated behaviors even with strange chaotic attractors. Basedon the aforementioned arguments, the study of delayed competitive neural networks andits analogous equations have attracted worldwide interest (see [20]).

The remainder of this paper is organized as follows. In Section 2, we present thesynchronization problem for CNNs. In Section 3, we introduce preliminaries, notationsand hypotheses. The controller design will be proposed in Section 4. In Section 5, we willintroduce the new criteria proving the exponential synchronization of CNNs. At last, anillustrative numerical example is given.

Nonlinear Anal. Model. Control, 23(1):82–102

Page 3: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

84 A. Arbi et al.

2 Methodology and problem formulation

The competitive neural networks with time-varying delays in this brief are modeled asfollows:

STM: xi(t) = −αi(t)xi(t) +n∑j=1

Dij(t)fj(xj(t)

)+Bi(t)

n∑j=1

mij(t)yj

+

n∑j=1

Dτij(t)fj

(xj(t− τij(t)

))+ Ii(t),

LTM: mij(t) = −βi(t)mij(t) + yjEi(t)fi(xi(t)

),

(1)

where i, j = 1, . . . , n; xi(t) is the neuron current activity level; fj(xj(t)) is the outputof neurons; mij(t) is the synaptic efficiency; yi is the constant external stimulus; Dij(t),Dτij(t) represent, respectively, the connection weight and the synaptic weight of delayed

feedback between the ith and jth neurons; Bi(t) is the strength of the external stimulus;Ei(t) denotes disposable scale; Ii(t) denotes the external inputs on the ith neuron at timet; σ = max(τij(t)) < 1 for j = 1, . . . , n and t > t0, where σ is constant; αi, βi : R→ Rare continuous functions.

By setting Si =∑nj=1mij(t)yi = Y Tmi(t), where y = (y1, y2, . . . , yn)

T, mi =(mi1,mi2, . . . ,min)

T and, without loss of generality, the input stimulus Y is assumedto be normalized with unit magnitude |y|2 = 1, summing up the LTM over j, then theabove networks are simplified, and we get a state-space representation of the LTM andSTM equations of the networks:

STM: xi(t) = −αi(t)xi(t) +n∑j=1

Dij(t)fj(xj(t)

)+Bi(t)Si(t)

+

n∑j=1

Dτij(t)fj

(xj(t− τij(t)

))+ Ii(t),

LTM: Si(t) = −βi(t)Si(t) + Ei(t)fi(xi(t)

),

(2)

i = 1, . . . , n. In order to observe the synchronization behavior in the class of delayedfunctional differential equations, we consider two delayed functional differential equa-tions, where the drive system with state variable denoted by xi drives the response sys-tem having identical dynamical equations denoted by state variable zi, and Si drivesthe response system having identical dynamical equations denoted by state variable Wi.However, the initial condition on the drive system is different from that of the responsesystem. The drive system is as follows:

STM: xi(t) = −αi(t)xi(t) +n∑j=1

Dij(t)fj(xj(t)

)+Bi(t)Si(t)

+

n∑j=1

Dτij(t)fj

(xj(t− τij(t)

))+ Ii(t),

LTM: Si(t) = −βi(t)Si(t) + Ei(t)fi(xi(t)

),

(3)

https://www.mii.vu.lt/NA

Page 4: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 85

i = 1, . . . , n, with the initial condition(x1(t), . . . xn(t), S1(t), . . . , Sn(t)

)=(ϕ1(t), . . . , ϕn(t), φ1(t), . . . , φn(t)

)∈(C([−τ∗, 0],R

))2n.

In practice, the output signals of system (3) can be received by system (4). There-fore, the goal of control is to design and implement an appropriate controller u+i (t) =(ui(t), ui(t)) for the second system such that the controlled response system can syn-chronize with the drive system (3). The response system is as follows:

STM: zi(t) = −αi(t)zi(t) +n∑j=1

Dij(t)fj(zj(t)

)+

n∑j=1

Dτij(t)fj

(zj(t− τij(t)

))+Bi(t)Wi(t) + Ii(t) + ui(t),

LTM: Wi(t) = −βi(t)Wi(t) + Ei(t)fi(zi(t)

)+ ui(t),

(4)

where ui and ui are the control terms respectively for STM and LTM with the initialcondition(

z1(t), . . . zn(t),W1(t), . . . ,Wn(t))=(ϕ1(t), . . . , ϕn(t), φ1(t), . . . , φn(t)

)∈(C([−τ∗, 0],R

))2n,

where ϕi(·) and φi(·) are the real-valued bounded differentiable functions defined on[−τ∗, 0], i = 1, . . . , n.

3 Preliminaries, notations and hypotheses

In this paper, we always consider the vectorial space Rn for n ∈ N∗ equipped with theEuclidean norm (denoted by ‖·‖) in Rn. Let Rn be n-dimensional Euclidean space. In allthat follows, we denote be In ∈ Rn×n and On ∈ Rn×n identity matrix and zero matrix,respectively. For all x, S, y, Z : R→ R, we define the zero norm by∥∥(x(t), S(t)), (y(t), Z(t))∥∥

0= max

∥∥x(t)− y(t)∥∥∞,∥∥S(t)− Z(t)∥∥∞.For convenience, we introduce the following notations:

B+i = sup

t∈R

∣∣Bi(t)∣∣, E+i = sup

t∈R

∣∣Ei(t)∣∣,αmin(t) = min

i=1,...,n

αi(t)

, αmax(t) = max

i=1,...,n

αi(t)

,

αmin = inft∈R

αmin(t)

, αmax = sup

t∈R

αmax(t)

,

βmin(t) = mini=1,...n

βi(t)

, βmin = inf

t∈R

βmin(t)

,

D+ij = sup

t∈R

∣∣Dij(t)∣∣, (

Dτij

)+= sup

t∈R

∣∣Dτij(t)

∣∣,τ∗ = max

i,j

(sup(τij(t)

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

Nonlinear Anal. Model. Control, 23(1):82–102

Page 5: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

86 A. Arbi et al.

Let us list some assumptions, which will be used throughout the rest of this paper:

(H1) The functions αi, βi : R→ R+ are continuous and positive.(H2) The functions fj(·) are differential and satisfy the Lipschitz condition, i.e., there

are constants kj > 0 such that for all x, y ∈ R and for all 1 6 j 6 n, one has|fj(x)− fj(y)| 6 kj |x− y| and fj(0) = 0.

Definition 1. Let Z∗(t) = (x∗1(t), x∗2(t), . . . , x

∗n(t), S

∗1 (t), S

∗2 (t), . . . , S

∗n(t))

T be solu-tion of system (3) with the initial value ψ∗(t) = (ϕ∗1(t), ϕ

∗2(t), . . . , ϕ

∗n(t), φ

∗1(t), φ

∗2(t),

. . . , φ∗n(t))T, and let Z(t) = (x1(t), x2(t), . . . , xn(t), S1(t), S2(t), . . . , Sn(t))

T be thesolution of uncontrolled system (4) with the initial valueψ(t) = (ϕ1(t), ϕ2(t), . . . , ϕn(t),φ1(t), φ2(t), . . . , φn(t))

T. If there exist constants ρ > 0 and M > 1 such that for everysolution Z(t) of system (4) with any initial value ψ(t),∥∥Z(t)− Z∗(t)∥∥

0=(max

∥∥x(t)− x∗(t)∥∥2∞,∥∥S(t)− S∗(t)∥∥2∞)1/26M exp

(−ρ(t− t0)

)‖ψ‖1

=M exp(−ρ(t− t0)

)× supt∈[−τ∗,0]

(max

∥∥ϕ(t)− ϕ∗(t)∥∥2∞,∥∥φ(t)− φ∗(t)∥∥2∞)1/2for all t > t0, then system (3) synchronizes exponentially with system (4).

Remark 1. The exponential synchronization problem considered here is to determinethe control inputs ui(t) and ui(t) associated with the state-feedback for the purposeof exponentially synchronizing the two identical chaotic nonlinear neural networks (3)and (4) with the same system parameters except the differences in initial conditions.

4 Controller design

Let us define the synchronization error signal ei(t) = xi(t) − zi(t) and ei(t) = Si(t) −Wi(t), where xi(t), Si(t) and zi(t), Wi(t) are the ith state variables of the drive andresponse competitive neural networks, respectively. Therefore, the error dynamics be-tween (3) and (4) can be expressed by

STM: ei(t) = −αi(t)ei(t) +n∑j=1

Dij(t)fj(ej(t)

)+

n∑j=1

Dτij(t)fj

(ej(t− τij(t)

))+Bi(t)ei(t)− ui(t), (5)

LTM: ˙ei(t) = −βi(t)ei(t) + Ei(t)fi(ei(t)

)− ui(t) (6)

for i = 1, . . . , n, where

fj(ej(t)

)= fj

(xj(t)

)− fj

(zj(t)

),

fj(ej(t− τij(t)

))= fj

(xj(t− τij(t)

))− fj

(zj(t− τij(t)

)).

https://www.mii.vu.lt/NA

Page 6: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 87

From hypothesis (H2) we can have that fi(·) satisfies

0 6 ei(t)fi(ei(t)

)6 kie

2i (t), 0 6 ei(t)fi

(ei(t)

)6 kie

2i (t).

If the state variables of the drive system are used to drive the response system, then thecontrol input vector with state feedback is designed as follows:

u1(t)...

un(t)

u1(t)...

un(t)

=

∑nj=1 ω1,j × (xj(t)− zj(t))

...∑nj=1 ωn,j × (xj(t)− zj(t))∑nj=1 ω1,j × (Sj(t)−Wj(t))

...∑nj=1 ωn,j × (Sj(t)−Wj(t))

=

ω1,1 . . . ω1,n ω1,n+1 . . . ω1,2n

......

......

......

ωn,1 . . . ωn,n ωn,n+1 . . . ωn,2n

x1(t)− z1(t)...

xn(t)− zn(t)S1(t)−W1(t)

...Sn(t)−Wn(t)

= Ωe(t),

where e(t) = (e1(t), . . . , en(t))T, and Ω = (ωi,j)n×n ∈ Rn×2n is the gain matrix to be

determined for synchronizing both a drive system and response system.Besides, if new errors are defined by ei(t) and ˆei(t) is defined by ei(t) = eρtei(t) and

ˆei(t) = eρtei(t), respectively, the dynamics of (5) and (6) can be transformed into thefollowing forms:

STM: ˙ei(t) = −αi(t)ei(t) + ρei(t) +

n∑j=1

Dij(t)Fj(ej(t)

)+

n∑j=1

Dτij(t)Fj

(ej(t− τij(t)

))+Bi(t)ˆei(t)−

n∑j=1

ωi,j ej(t), (7)

LTM: ˙ei(t) = −βi(t)ˆei(t) + ρˆei(t) + Ei(t)Fi

(ei(t)

)−

n∑j=1

ωi,j ˆej(t), (8)

where Fj(ej(t)) = eρtfj(ej(t)) and Fj(ej(t− τij(t))) = eρtfj(ej(t− τij(t))).

5 Main results

The exponential synchronization problem of systems (3) and (4) can be solved if thecontroller gain matrix is suitably designed. The exponential synchronization condition isestablished in the following main results.

Nonlinear Anal. Model. Control, 23(1):82–102

Page 7: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

88 A. Arbi et al.

Theorem 1. Let (H1)–(H2) hold. Assume that there exist two strictly positive constants ρand σ < 1 such that:

(i)n∑i=1

(Dτij

)+<

e2ρτ∗

1− σfor all j = 1, . . . , n,

and there exist n strictly positive constants q1, q2, . . . , qn such that:

(ii)2ρ

αmax+ max

16i6n

n∑j=1

D+ij

αmin

+ max16j6n

kj∑ni=1D

+ij

αmin

− 2 max16j6n

n∑i=1

ωi,jαmin

+ max16i6n

(B+i

αmin

+qiαmin

kiE+i

)< 2;

(iii)1

2max16i6n

(B+i

αmin

+qiαmin

kiE+i

)6 max

16i6nqiβ

min + max16j6n

n∑i=1

qiωi,j .

Then the drive system (3) synchronizes exponentially with the response system (4).

Proof. To confirm that the origin of (7) is globally exponentially convergent, a continuousLyapunov functional V (t) is defined as follows:

V (t) =

n∑i=1

1

αi(t)e2i (t) + 2

n∑i=1

qi

ˆei(t)∫0

sds+e2ρτ

1− σ

n∑j=1

(Dτij

)+ t∫t−τij(t)

F 2j

(ej(s)

)ds.

It is easy to verify that V (t) is a nonnegative function over [−τ∗,+∞) andlime(t)→+∞ V (t) = +∞. By the expression of fj(ej(t)), Fj(ej(t)) and assumption (H2)we obtain ∣∣fj(ej(t))∣∣ 6 kj

∣∣ej(t)∣∣,∣∣Fj(ej(t))∣∣ = ∣∣eρtFj(ej(t))∣∣ 6 kj∣∣eρtej(t)∣∣ = kj

∣∣ej(t)∣∣.Evaluating the time derivative of V along the trajectory of (7) and (8)

V (t) = 2

n∑i=1

1

αi(t)ei(t) ˙ei(t) + 2

n∑i=1

qi ˆei(t)˙ei(t) +

e2ρτ∗

1− σ

n∑j=1

(Dτij

)+F 2j

(ej(t)

)− e2ρτ

1− σ

n∑j=1

(Dτij

)+F 2j

(ej(t− τij(t)

))(1− τij(t)

)6 −2

n∑i=1

e2i (t) + 2ρ

n∑i=1

1

αi(t)e2i (t) + 2

n∑i=1

n∑j=1

Dij(t)

αi(t)ei(t)Fj

(ej(t)

)+ 2

n∑i=1

n∑j=1

Dτij(t)

αi(t)ei(t)Fj

(ej(t− τij(t)

))

https://www.mii.vu.lt/NA

Page 8: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 89

+ 2

n∑i=1

1

αi(t)ei(t)Bi(t)ˆei(t)− 2

n∑i=1

n∑j=1

ωi,jαi(t)

e2j (t)

− 2

n∑i=1

qi ˆe2i (t) + 2

n∑i=1

qi ˆei(t)Ei(t)Fi(ei(t)

)− 2

n∑i=1

n∑j=1

qiωi,j ˆe2j (t)

+e2ρτ

1− σ

n∑j=1

(Dτij

)+F 2j

(ej(t)

)− e2ρτ

1− σ

n∑j=1

(Dτij

)+F 2j

(ej(t− τij(t)

)). (9)

Applying the inequality 2|a|b 6 a2 + b2, we have that

2

n∑i=1

n∑j=1

Dij(t)

αi(t)ei(t)Fj

(ej(t)

)6

n∑i=1

n∑j=1

D+ij

αmine2i (t) +

n∑i=1

n∑j=1

D+ij

αminF 2j

(ej(t)

), (10)

2

n∑i=1

n∑j=1

Dτij(t)

αi(t)ei(t)Fj

(ej(t− τij(t)

))6

n∑i=1

n∑j=1

(Dτij)

+

αmine2i (t) +

n∑i=1

n∑j=1

(Dτij)

+

αminF 2j

(ej(t− τij(t)

))(11)

and

2

n∑i=1

(Bi(t)

αi(t)+

qiαi(t)

kiEi(t)

)∣∣ei(t)∣∣ˆei(t)6

n∑i=1

(B+i

αmin+

qiαmin

kiE+i

)(e2i (t) + ˆe2i (t)

). (12)

Substituting (10), (11) and (12) in derivative (9), we obtain easily

V (t) 6

−2 + 2ρ

αmin+ max

16i6n

n∑j=1

D+ij

αmin+ max

16j6n

kj∑ni=1D

+ij

αmin

− 2 max16j6n

n∑i=1

ωi,jαmin

+ max16i6n

(B+i

αmin+ qikiE

+i

)∥∥e(t)∥∥2+

n∑j=1

(max16j6n

n∑i=1

(Dτij

)+ − e2ρτ∗

1− σ

)F 2j

(ej(t− τij(t)

))+

max16i6n

(B+i

αmin+ qikiE

+i

)− 2 max

16i6nqiβ

min − 2 max16j6n

n∑i=1

qiωi,j

×∥∥ˆe(t)∥∥2.

Nonlinear Anal. Model. Control, 23(1):82–102

Page 9: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

90 A. Arbi et al.

In addition, we have

1

αmax

∥∥e(t)∥∥2 6 V (t)

61

αmin

∥∥e(t)∥∥2 + qmax

αmin

∥∥ˆe(t)∥∥2+τ∗e2ρτ

1− σK2

max

∑nj=1(D

τij)

+

αmin

∥∥e(t)∥∥2.Besides,

qmin

αmax

∥∥ˆe(t)∥∥2 6 V (t)

61

αmin

∥∥e(t)∥∥2 + qmax

αmin

∥∥ˆe(t)∥∥2+τ∗e2ρτ

1− σK2

max

∑nj=1(D

τij)

+

αmin

∥∥e(t)∥∥2.Therefore, we have√

1 + qmin

αmaxmax

∥∥e(t)∥∥, ˆe(t)∥∥ 6√

2V (t) 6√2V (t0).

For t = t0, we have

√V (t0) 6

(√1

qmin+

√qmax

αmin

+

√τ∗e2ρτ∗

1− σK2

max

∑nj=1(D

τij)

+

αmin

)exp(ρt0)

× supt∈[−τ∗,0]

max∥∥ϕ(t)∥∥,∥∥φ(t)∥∥.

Then

max∥∥e(t)∥∥,∥∥e(t)∥∥ 6M exp

(−ρ(t− t0)

)sup

t∈[−τ∗,0]

max∥∥ϕ(t)∥∥,∥∥φ(t)∥∥,

where

M =

√αmax

(1 + qmin)αmin

+

√αmaxqmax

(1 + qmin)αmin

+

√τ∗e2ρτ∗

1− σK2

maxαmax

∑nj=1(D

τij)

+

(1 + qmin)αmin

> 1.

Therefore, system (3) synchronizes exponentially with system (4).

If q1 = q2 = · · · = qn = 1, we obtain the following result.

https://www.mii.vu.lt/NA

Page 10: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 91

Corollary 1. The drive system (3) synchronizes exponentially with the response sys-tem (4) if there exist two strictly positive constants ρ and σ < 1 such that:

(i)n∑i=1

(Dτij

)+<

e2ρτ∗

1− σfor all j = 1, . . . , n;

(ii)2ρ

αmax+ max

16i6n

n∑j=1

D+ij

αmin

+ max16j6n

kj∑ni=1D

+ij

αmin

+ max16i6n

(B+i

αmin

+1

αmin

kiE+i

)< 2 + 2 max

16j6n

n∑i=1

ωi,jαmin

;

(iii)1

2max16i6n

(B+i

αmin

+1

αmin

kiE+i

)6 max

16i6nβmin + max

16j6n

n∑i=1

ωi,j .

Remark 2. To the best of our knowledge, no paper in the literature has investigated thesynchronization problem of system (3) with system (4). Furthermore, this paper improvesand generalizes the outcomes in [10, 20].

6 Simulation results

Example 1. The parameters of a two-dimensional nonlinear competitive neural networkswith time-varying delays (3) and (4) is given by the following system of equations:

α1(t) = α2(t) = exp

(− t

2

2

)+ 0.5, β1(t) = β2(t) = 2 exp

(− t

2

2

),

Ii(t) = 2 cos(√2t),

D(t) =(Dij(t)

)2×2 =

(2 exp(−t2) −0.3 cos t−2 exp(−t2) 8 cos(

√2t)

),

Dτ (t) =(Dτij(t)

)2×2 =

(2 cos(

√2t) 0.1 cos t

exp(−t2) −8 cos t

),

B(t) =

(4 exp(−t2)4 exp(−t2)

), E(t) =

(2 exp(−t2)1.5 exp(−t2)

).

The delays (τij(t))16i,j62 = 0.7exp t/(1 + exp t) satisfy

0 6 τij(t) 6 0.7 = τ∗, 0 6 τij(t) 6 0.7.

We choose the activation functions of competitive neural networks as the type of hyper-bolic tangent function fj(x) = 0.3 tanh(x). Figures 1–10 show the oscillation of thedelayed competitive neural networks (3) and (4) with above coefficients and initial valuesx1(θ) = −1, x2(θ) = −0.2, S1(θ) = −2, S2(θ) = −0.6 for θ ∈ [−0.7, 0].

The oscillation of solution of drive system is clearly presented in Figs. 1–4.

Nonlinear Anal. Model. Control, 23(1):82–102

Page 11: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

92 A. Arbi et al.

0 20 40 60 80 100−30

−20

−10

0

10

20

30

t

x1(t)

Figure 1. Trajectory of x1 for t ∈ [0, 100].

0 20 40 60 80 100−30

−20

−10

0

10

20

30

t

x2(t)

Figure 2. Trajectory of x2 for t ∈ [0, 100].

−1.5

−1

−0.5

0

0.5

−4

−2

0

2

4

−2

−1.5

−1

−0.5

0

x2(t)

S1(t)

x1(t)

Figure 3. Phase plot of x1, x2, S1 for t ∈[0, 100].

−1.5

−1

−0.5

0

0.5

−4

−2

0

2

4

−4

−2

0

2

4

6

x2(t) x1(t)

S2(t)

Figure 4. Phase plot of x1, x2, S2 for t ∈[0, 100].

0 20 40 60 80 100−500

0

500

S1(t)

t

0 20 40 60 80 100−500

0

500

S2(t)

t

Figure 5. Trajectory of S1 and S2 for t ∈[0, 100].

0 20 40 60 80 100−200

−150

−100

−50

0

50

100

150

200

z1(t)

t

Figure 6. Trajectory of z1 for t ∈ [0, 100].

https://www.mii.vu.lt/NA

Page 12: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 93

0 20 40 60 80 100−100

−80

−60

−40

−20

0

20

40

60

80

100

t

z2(t)

Figure 7. Trajectory of z2 for t ∈ [0, 100].

0 20 40 60 80 100−500

0

500

t

0 20 40 60 80 100−500

0

500

t

W2(t)

W1(t)

Figure 8. Trajectory of W1 and W2 for t ∈[0, 100].

−3

−2

−1

0

1

−4

−2

0

2

4

−3

−2.5

−2

−1.5

−1

−0.5

0

W1(t)

z2(t) z1(t)

Figure 9. Phase plot of z1, z2, W1 for t ∈[0, 100].

−3

−2

−1

0

1

−4

−2

0

2

4

−4

−2

0

2

4

6

W2(t)

z2(t) z1(t)

Figure 10. Phase plot of z1, z2, W2 for t ∈[0, 100].

It follows from the main theorem that if the controls input ui(t) and ui(t) are chosen as

u1(t) = 9.2e1(t), u2(t) = 9.2e2(t),

u1(t) = 1.2e1(t), u2(t) = 1.2e2(t),

then the matrix of control is as follows:

Ω =

(9.2 0 1.2 00 9.2 0 1.2

).

The oscillation of solution of response system with above coefficients and initial valuesx1(θ) = −2, x2(θ) = −0.2, S1(θ) = −3, S2(θ) = −0.5 for θ ∈ [−0.7, 0] is clearlypresented in Figs. 6–10.

Nonlinear Anal. Model. Control, 23(1):82–102

Page 13: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

94 A. Arbi et al.

It is evident that hypotheses (H1)–(H2) hold (k1 = k2 = 0.3). By choosing ρ = 0.5and σ = 0.9 we have

2∑i=1

(Dτi1

)+= 3 <

e2ρτ∗

1− σ= 14.1,

2∑i=1

(Dτi2

)+= 8.1 <

e2ρτ∗

1− σ= 14.1.

Besides,

αmax+ max

16i62

2∑j=1

D+ij

αmin

+ max16j62

kj∑ni=1D

+ij

αmin

+ max16i62

(B+i

αmin

+1

αmin

kiE+i

)

=1

1.5+ max

2.3

0.5,10

0.5

+max

0.3

4

0.5, 0.3

8.3

0.5

+max

4

0.5+ 2

0.3

0.5,

4

0.5+ 1.5

0.3

0.5

= 0.66 + 20 + 4.98 + 9.2 < 2 + 2 max

16j62

2∑i=1

ωi,jαmin

= 38.8

and

1

2max16i62

(B+i

αmin

+1

αmin

kiE+i

)=

1

2max

4

0.5+ 2

0.3

0.5,

4

0.5+ 1.5

0.3

0.5

6 max

16i62βmin + max

16j6n

2∑i=1

ωi,j = 9.2.

Conditions (i), (ii) and (iii) of Corollary 1 are satisfied. Hence, by using Corollary 1,the drive system (3) can be synchronized by the corresponding response system (4).Figures 11–14 reveal the synchronization error of the state variables between the drivesystem and the corresponding response system.

Remark 3. The major improvement over [20, 22] is that in our approach, it is very easyto verify the criteria by simple algebraic calculus.

Remark 4. The competitive neural networks models investigated in [20] and [22] areconsidered with constant coefficients. However, in this work, we study the model withtime-varying coefficients. Furthermore, our system include models in [20,22] and [23] asspecial cases whenDij(t) = Dij ,Dτ

ij(t) = Dτij ,Bi(t) = Bi,Ei(t) = Ei, Ii(t) = Ii and

Ji(t) = Ji. Hence, our results have been shown to be the generalization and improvementof existing results reported recently in the literature.

Remark 5. For system (1), if there is no external stimulus, i.e., yj = 0, then system (1)degenerates into general neural networks with time-varying delay, which contains neuralmodels studied in [4, 11, 16].

https://www.mii.vu.lt/NA

Page 14: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 95

0 20 40 60 80 100−50

0

50

100

t

e1(t)

Figure 11. Trajectory of e1 and x2 for t ∈[0, 100].

0 20 40 60 80 100−50

0

50

100

t

e2(t)

Figure 12. Trajectory of e2 for t ∈ [0, 100].

−15

−10

−5

0

5

−1

0

1

2

−2

−1.5

−1

−0.5

0

0.5

e1(t)

e1(t)e2(t)

~

Figure 13. Phase plot of e1, e2, e1 for t ∈[0, 100].

−1.5

−1

−0.5

0

0.5

−1

0

1

2

−1

−0.5

0

0.5

1

e2(t) e1(t)

e2(t)

~

Figure 14. Phase plot of e1, e2, e2 for t ∈[0, 100].

0 20 40 60 80 100−50

0

50

t

0 20 40 60 80 100−50

0

50

t

e2(t)

~e1(t)

~

Figure 15. Trajectory of e1 and e2 for t ∈[0, 100].

Nonlinear Anal. Model. Control, 23(1):82–102

Page 15: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

96 A. Arbi et al.

Example 2. The parameters of a two-dimensional nonlinear competitive neural networkswith time-varying delays (3) and (4) are almost some parameters of Example 1. The onlydifference compared to Example 1 is about the activation functions. Furthermore, in thisexample, we choose the activation functions as follows: fj(x) = 0.3 sin(0.5x), j =1, . . . , n, and

D(t) =(Dij(t)

)2×2 =

(2 exp(−t2) −0.3 cos t−2 exp(−t2) 5 cos(

√2t)

),

Dτ (t) =(Dτij(t)

)2×2 =

(2 cos(

√2t) 0.1 cos t

exp(−t2) −5 cos t

).

The delays (τij(t))16i,j62 = 0.7 exp t/(1 + exp t) are time-varying and satisfy 0 6τij(t) 6 0.7 = τ∗, 0 6 τij(t) 6 0.7.

Figures 16–19 show the oscillation of the delayed competitive neural networks (3) and(4) with above coefficients and initial values x1(θ) = −1, x2(θ) = −0.2, S1(θ) = −2,S2(θ) = 0.6 for θ ∈ [−0.7, 0]. The driver system’s oscillating solution is clearly presentedin Figs. 21–24.

It follows from the main theorem that if the controls input ui(t), ui(t) are chosen as

u1(t) = 9.2e1(t) u2(t) = 9.2e2(t), u1(t) = 1.2e1(t), u2(t) = 1.2e2(t),

then the matrix of control is as follows:

Ω =

(9.2 0 1.2 00 9.2 0 1.2

).

The responser system’s oscillating solution with above coefficients and initial valuesx1(θ) = −2, x2(θ) = −0.2, S1(θ) = −3, S2(θ) = −0.5 for θ ∈ [−0.7, 0] is clearlypresented in Figs. 26–29.

It is evident that hypotheses (H1)–(H2) hold (k1 = k2 = 0.3). By choosing ρ = 0.5and σ = 0.9, we have

2∑i=1

(Dτi1)

+ = 3 <e2ρτ

1− σ= 14.1,

2∑i=1

(Dτi2)

+ = 5.1 <e2ρτ

1− σ= 14.1.

Besides,

αmax+ max

16i62

2∑j=1

D+ij

αmin

+ max16j62

kj∑ni=1D

+ij

αmin

+ max16i62

(B+i

αmin

+1

αmin

kiE+i

)

=1

1.5+ max

2.3

0.5,

7

0.5

+max

0.3

4

0.5, 0.3

5.3

0.5

+max

4

0.5+ 2

0.3

0.5,

4

0.5+ 1.5

0.3

0.5

= 0.66 + 14 + 3.18 + 9.2 < 2 + 2 max

16j62

2∑i=1

ωi,jαmin

= 38.8

https://www.mii.vu.lt/NA

Page 16: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 97

0 20 40 60 80 100−30

−20

−10

0

10

20

30

t

x1(t)

Figure 16. Trajectory of x1 for t ∈ [0, 100].

0 20 40 60 80 100−30

−20

−10

0

10

20

30

t

x2(t)

Figure 17. Trajectory of x2 for t ∈ [0, 100].

−1.5

−1

−0.5

0

0.5

−2

−1

0

1

2

−10

0

10

20

30

40

S1(t)

x2(t) x1(t)

Figure 18. Phase plot of x1, x2, S1 for t ∈[0, 100].

−1.5

−1

−0.5

0

0.5

−2

−1

0

1

2

0

5

10

15

20

S2(t)

x2(t) x1(t)

Figure 19. Phase plot of x1, x2, S2 for t ∈[0, 100].

0 20 40 60 80 100−500

0

500

t

0 20 40 60 80 100−500

0

500

t

S2(t)

S1(t)

Figure 20. Trajectory of S1 and S2 for t ∈[0, 100].

Nonlinear Anal. Model. Control, 23(1):82–102

Page 17: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

98 A. Arbi et al.

0 20 40 60 80 100−200

−150

−100

−50

0

50

100

150

200

t

z1(t)

Figure 21. Trajectory of z1 for t ∈ [0, 100].

0 20 40 60 80 100−100

−80

−60

−40

−20

0

20

40

60

80

100

t

z2(t)

Figure 22. Trajectory of z2 for t ∈ [0, 100].

−3

−2

−1

0

1

−2

−1

0

1

2

−10

0

10

20

30

40

z2(t) z1(t)

W1(t)

Figure 23. Phase plot of z1, z2, W1 for t ∈[0, 100].

−3

−2

−1

0

1

−2

−1

0

1

2

−5

0

5

10

15

20

z2(t) z1(t)

W2(t)

Figure 24. Phase plot of z1, z2, W2 for t ∈[0, 100].

0 20 40 60 80 100−500

0

500

t

0 20 40 60 80 100−500

0

500

t

W2(t)

W1(t)

Figure 25. Trajectory of W1 and W2 for t∈[0, 100].

https://www.mii.vu.lt/NA

Page 18: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 99

0 20 40 60 80 100−50

0

50

100

t

e1(t)

Figure 26. Trajectory of e1 and x2 for t ∈[0, 100].

0 20 40 60 80 100−50

0

50

100

t

e2(t)

Figure 27. Trajectory of e2 for t ∈ [0, 100].

−15

−10

−5

0

−2

−1

0

1

2

−2

−1.5

−1

−0.5

0

0.5

e1(t)

e1(t)e2(t)

~

Figure 28. Phase plot of e1, e2, e1 for t ∈[0, 100].

−1.5

−1

−0.5

0

−2

−1

0

1

2

−1

−0.5

0

0.5

1

−0.

e2(t) e1(t)

e2(t)

~

Figure 29. Phase plot of e1, e2, e2 for t ∈[0, 100].

0 20 40 60 80 100−50

0

50

t

0 20 40 60 80 100−50

0

50

t

e2(t)

~e1(t)

~

Figure 30. Trajectory of e1 and e2 for t ∈[0, 100].

Nonlinear Anal. Model. Control, 23(1):82–102

Page 19: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

100 A. Arbi et al.

and

1

2max16i62

(B+i

αmin

+1

αmin

kiE+i

)=

1

2max

4

0.5+ 2

0.3

0.5,

4

0.5+ 1.5

0.3

0.5

6 max

16i62βmin + max

16j6n

2∑i=1

ωi,j = 9.2.

Hence, using Corollary 1, the drive system (3) can be synchronized by the correspondingresponse system (4). Figures 24–29 reveal the synchronization error of the state variablesbetween the drive system and the corresponding response system.

Remark 6. However, in most papers, the activation functions are assumed to be mono-tonically nondecreasing. In this paper, from Theorem 1 the restriction is removed, andthus, the results obtained here extend and improve those in [11, 16, 17]. However theactivation functions here are not monotonous in Example 2, the results in [11, 16, 17] arenot applicable.

Remark 7. The above examples show that the result of the proposed control law ensuresexponential synchronization of the competitive neural networks constituting of two ormulti-neurons with/without time delays.

7 Conclusion and future works

In the present work, we demonstrate that two different chaotic nonlinear competitiveneural networks with time-varying delays can be synchronized using active control. Moreprecisely, this paper has presented sufficient conditions to guarantee the exponential syn-chronization of a class of chaotic nonlinear competitive neural networks with time-varyingdelays. Moreover, the proposed criteria were dependent of the delay parameter, whichmay possess important significance in the design of chaos of delayed competitive neuralnetworks. A numerical example and its simulation have been given to demonstrate theeffectiveness and advantage of the theory results. Furthermore, the synchronization degreecan be easily estimated. Finally, an illustrative example has been given to verify thetheoretical results. However, to the best of our knowledge, there are few results concerningthe exponential synchronization for competitive neural networks. This technique is appli-cable for the high-order Hopfield neural networks [2]. Furthermore, there are no studiesinvestigating the problem of exponential synchronization of competitive neural networkswith mixed time-varying delays in the leakage terms [5] and the high-order competitiveneural networks with mixed time-varying delays in the leakage terms [1]. This is someinteresting problems and will become our future investigative direction. Besides, moremethods and tools should be explored and developed in this direction. Along, the futurework spawning from this paper would be to train this model that can be applied in variousareas including pattern recognition, associate memory, cryptography etc.

Acknowledgment. The authors would like to express their sincere thanks to the refereesfor suggesting some corrections that help making the content of the paper more accurate.

https://www.mii.vu.lt/NA

Page 20: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

Improved synchronization analysis of competitive neural networks 101

References

1. A. Arbi, A. Alsaedi, J. Cao, Delta-differentiable weighted pseudo-almost automorphicity ontime-space scales for a novel class of high-order competitive neural networks with WPAAcoefficients and mixed delays, Neural Process. Lett., 2017, https://doi.org/10.1007/s11063-017-9645-z.

2. A. Arbi, C. Aouiti, F. Chérif, A. Touati, A.M. Alimi, Stability analysis for delayed high-ordertype of Hopfield neural networks with impulses, Neurocomputing, 165:312–329, 2015.

3. A. Arbi, C. Aouiti, F. Chérif, A. Touati, A.M. Alimi, Stability analysis of delayed Hopfieldneural networks with impulses via inequality techniques, Neurocomputing, 158:281–294,2015.

4. A. Arbi, C. Aouiti, A. Touati, Uniform asymptotic stability and global asymptotic stabilityfor time-delay Hopfield neural networks, in L. Iliadis, I. Maglogiannis, H. Papadopoulos(Eds.), Artificial Intelligence Applications and Innovations. 8th IFIP WG 12.5 InternationalConference, AIAI 2012, Halkidiki, Greece, September 27–30, 2012. Proceedings, Part I, IFIPAdv. Inf. Commun. Technol., Vol. 381, Springer, 2012, pp. 483–492.

5. A. Arbi, J. Cao, Pseudo-almost periodic solution on time-space scales for a novel class ofcompetitive neutral-type neural networks with mixed time-varying delays and leakage delays,Neural Process. Lett., 46:719–745, 2017.

6. G. Cai, Q. Yao, H. Shao, Global synchronization of weighted cellular neural network withtime-varying coupling delays, Commun. Nonlinear Sci. Numer. Simul., 17:3843–3847, 2012.

7. J. Cao, G. Chen, P. Li, Global synchronization in an array of delayed neural networks withhybrid coupling, IEEE Trans. Syst. Man Cybern. B, 38(2):488–498, 2008.

8. J. Cao, L. Li, Cluster synchronization in an array of hybrid coupled neural networks with delay,Neural Networks, 22(4):335–342, 2009.

9. J. Cao, P. Li, W. Wang, Global synchronization in arrays of delayed neural networks withconstant and delayed coupling, Phys. Lett. A, 353(4):318–325, 2006.

10. J. Cao, J. Lü, Adaptive synchronization of neural networks with or without time-varying delay,Chaos, 16(1):013133, 2006.

11. C.J. Cheng, T.L. Liao, C.C. Hwang, Exponential synchronization of a class of chaotic neuralnetworks, Chaos Solitons Fractals, 24(1):197–206, 2015.

12. J. Hu, Synchronization conditions for chaotic nonlinear continuous neural networks, ChaosSolitons Fractals, 41:2495–2501, 2009.

13. S. Kuntanapreeda, Chaos synchronization of unified chaotic systems via LMI, Phys. Lett. A,373:2837–2840, 2009.

14. S. Li, J. Cao, Distributed adaptive control of pinning synchronization in complex dynamicalnetworks with non-delayed and delayed coupling, Int. J. Control Autom. Syst., 13(5):1076–1085, 2015.

15. X. Li, M. Bohner, Exponential synchronization of chaotic neural networks with mixed delaysand impulsive effects via output coupling with delay feedback, Math. Comput. Modelling,52:643–653, 2010.

16. X. Lou, B. Cui, New LMI conditions for delay-dependent asymptotic stability of delayedHopfield neural networks, Neurocomputing, 69(16):2374–2378, 2006.

Nonlinear Anal. Model. Control, 23(1):82–102

Page 21: Improved synchronization analysis of competitive neural ...84 A. Arbi et al. 2 Methodology and problem formulation The competitive neural networks with time-varying delays in this

102 A. Arbi et al.

17. H. Lu, Z. He, Global exponential stability of delayed competitive neural networks withdifferent time scales, Neural Networks, 18(3):243–250, 2005.

18. J. Mei, M. Jiang, W. Xu, B. Wang, Finite-time synchronization control of complex dynamicalnetworks with time delay, Commun. Nonlinear Sci. Numer. Simul., 18:2462–2478, 2013.

19. A. Meyer-Baese, F. Ohl, H. Scheich, Singular perturbation analysis of competitive neuralnetworks with different time scales, Neural Comput., 8:1731–1742, 1996.

20. A. Meyer-Baese, S.S. Pilyugin, Y. Chen, Global exponential stability of competitive neuralnetworks with different time scales, IEEE Trans. Neural Networks, 2003:716–719, 2003.

21. X. Nie, J. Cao, Existence and global stability of equilibrium point for delayed competitiveneural networks with discontinuous activation functions, Int. J. Syst. Sci., 43(3):459–474,2012.

22. X. Nie, J. Cao, S. Fei, Multistability and instability of delayed competitive neural networks withnondecreasing piecewise linear activation functions, Neurocomputing, 119:281–291, 2013.

23. X. Nie, W.X. Zheng, Dynamical behaviors of multiple equilibria in competitive neuralnetworks with discontinuous nonmonotonic piecewise linear activation functions, IEEE Trans.Cybern., 46(3):679–693, 2016.

24. T. Sangpet, S. Kuntanapreeda, Adaptive synchronization of hyperchaotic systems via passivityfeedback control with time-varying gains, J. Sound Vib., 329:2490–2496, 2010.

25. X. Yang, J. Cao, Y. Long, W. Rui, Adaptive lag synchronization for competitive neuralnetworks with mixed delays and uncertain hybrid perturbations, IEEE Trans. Neural Networks,21(10):1656–1667, 2010.

26. X. Yang, Z. Yang, X. Nie, Exponential synchronization of discontinuous chaotic systems viadelayed impulsive control and its application to secure communication, Commun. NonlinearSci. Numer. Simul., 19:1529–1543, 2014.

27. W. Yu, J. Cao, J. Lü, Global synchronization of linearly hybrid coupled networks with time-varying delay, SIAM J. Appl. Dyn. Syst., 7(1):108–133, 2008.

https://www.mii.vu.lt/NA