# Synchronization of a Class of Memristive Stochastic Bidirectional Associative Memory Neural Networks with Mixed Time-Varying Delays via Sampled-Data Control

Authors: Manman Yuan; Weiping Wang; Xiong Luo; Chao Ge; Lixiang Li; Jürgen Kurths; Wenbing Zhao
Journal: Mathematical Problems in Engineering
 (2018)

---

## Abstract

The paper addresses the issue of synchronization of memristive bidirectional associative memory neural networks (MBAMNNs) with mixed time-varying delays and stochastic perturbation via a sampled-data controller. First, we propose a new model of MBAMNNs with mixed time-varying delays. In the proposed approach, the mixed delays include time-varying distributed delays and discrete delays. Second, we design a new method of sampled-data control for the stochastic MBAMNNs. Traditional control methods lack the capability of reflecting variable synaptic weights. In this paper, the methods are carefully designed to confirm the synchronization processes are suitable for the feather of the memristor. Third, sufficient criteria guaranteeing the synchronization of the systems are derived based on the derive-response concept. Finally, the effectiveness of the proposed mechanism is validated with numerical experiments.


---

## Body

## 1. Introduction

Associate memory is one of the most significant activities of human brain, which can be applied in study of brain-like systems [1], intelligent thinking for intelligent robots [2], and so on. Since Kosko discussed the concept of bidirectional associative memory neural networks (BAMNNs) [3] in 1988, BAMNNs occupied the great researchers’ time and have been studied for several years. Nowadays, due to the wide applications in signal processing, associative memory, pattern recognition, and so on [4], chaos control and synchronization of BAMNNs have been intensively investigated. Owing to the special characters of the memristor [5], researchers have replaced resistor with memristor in large scale integration circuits to construct the MBAMNNs [6]. MBAMNNs are more suitable for mimicking the associative memory process of human brain contrast with the BAMNNs. Thus, more and more researchers build the MBAMNNs models for investigating a variety of applications [7–10].In practical MBAMNNs systems, an ever-present phenomenon is the threshold of the sensitive memristor with a nonlinear drift effect [11], such as the voltages, current, and magnetic flux. It is well known that the presence of the threshold input may drastically deteriorate the desired performance, even inducing the inaccuracy of closed-loop systems under investigation. Hence, it is important to take the nonlinear characteristic of the MBAMNNs into consideration in the dynamical systems. In general, two common methods are utilized to cope with the nonlinear characteristic of the MBAMNNs. One is treating the parameters as constants [12, 13], and the other is making a study of antisynchronization [14]. Recently, the problem of nonlinear characteristic has also been considered to the field of memristive neural networks (MNNs) [15–22]. Although the importance of nonlinear characteristic has been rather well recognized, but few related results have been reported on the synchronization of MBAMNNs. This is the first motivation of the present paper.Synchronization is an elementary collective phenomenon that enables coherent behavior in neural networks (NNs), where neurons coact with each other and achieve a common dynamic behavior. Synchronization is of great significance for its potential applications in many areas, including harmonic oscillation generation, biology systems, and secure communication. Looking through the literatures on the synchronization of MBAMNNs, one can find that most of the results are based on the two kinds of continuous-time control strategies: the state feedback control [23–28] and adaptive control [29]. A prerequisite of these approaches is that the controllers must obtain signals from sensors in a continuous way [30]. This will increase the control cost heavily and cause a waste of communication bandwidth [31].In contrast to the continuous-time control, the sampled-data control merely makes use of the sampling signals at discrete time instants. Consequently, the sampled-data control can eliminate the continuous monitoring of system states as well as the continuous information transmission. Therefore, the sampled-data control is a more managing choice in applications. Till now, numerous results have been reported in this aspect [30–33]. However, to the best of our knowledge, there are few relevant achievements that consider the sampled-data synchronization of MBAMNNs. This is the second motivation of the present paper.Owing to the limited speed of signal transmission between the neurons, the finite switching speed between different circuit elements in hardware implementations of NNs, and the viscosity of synapses triggered by biological NNs, time delay is an inevitable phenomenon in NNs. There are many types of delays, like discrete delay, leakage time delay, distributed delay, neutral-type delay, and so on. These delays are the main factors that contribute to the oscillation, instability, and the performance degradation to the dynamical systems [34]. Therefore, the dynamic systems with time delay becomes a hot topic in the theoretical and application realms.Besides, the actual communication between real systems is usually disturbed by a stochastic perturbation from various uncertainties. In secure communication systems, the digital signal is transmitted by switching forth and back continuously between synchronization. The stochastic perturbation will probably lead to package losses or influences the signal transmission. Hence, it is important to discuss the effect of probabilistic delays, stochastic perturbations, and so on [35–38]. Therefore, it is valuable and practical to discuss the effect of the stochastic perturbations and time-varying delays on MBAMNNs.Motivated by the foregoing discussions, this paper aims at investigating the synchronization of MBAMNNs with mixed time-varying delays and stochastic perturbations by designing a suitable sampled-data controller. The main contributions of this paper are summarized as follows.(1)
We first investigate the globally asymptotic synchronization of MBAMNNs with mixed time-varying delays and stochastic perturbations.
(2)
According to the characters of memristor, we consider the parameters mismatch between the drive-response systems and design a suitable sampled-data controller to fit the features of the memristor.
(3)
We also analyze the feasible region of the sampling period according to simulations, which is significant to some potential future research. Owing to the sampled-data synchronization analysis, Lyapunov functional method, and stochastic analysis theory, the synchronization criteria of the parameters mismatched MBAMNNs are derived.The rest of this paper is organized as follows. The systems and problems formulation are presented in Section2. In Section 3, based on Lyapunov functional method, stochastic analysis theory, and inequality techniques, sufficient criteria that depend on such system for synchronization are obtained. Numerical simulations are demonstrated to verify the effectiveness of the obtained results in Section 4. Finally, conclusions are given in Section 5.


## 2. Model Description and Preliminaries

### 2.1. Model Description

In order to better understand the MBAMNNs, firstly we describe the circuit of a general class of BAMNNs with the architecture as shown in Figure1. Take the ith subsystem and the jth subsystem as the unit of analysis so as to simplify illustration [39]; one can clearly see that the Kirchhoff’s current law (KCL) of the subsystems of BAMNNs [3] is described as the following differential equation:(1)
d
x
i
t
=
-
x
i
t
+
1
C
i
∑
j
=
1
m
f
j
y
j
t
-
τ
t
F
j
i
×
s
i
g
n
j
i
+
I
i
t
C
j
,
t
≥
0
,
i
=
1,2
,
…
,
n
,
d
y
j
t
=
-
y
j
t
+
1
C
~
i
∑
i
=
1
n
g
i
x
i
t
-
τ
t
R
i
j
×
s
i
g
n
i
j
+
J
j
t
C
~
j
,
t
≥
0
,
j
=
1,2
,
…
,
m
,where x
i
(
t
) and y
j
(
t
) are the voltages of capacitors C
i and C
~
j, respectively. And F
j
i presents the resistor between the feedback function f
j
(
y
j
(
t
-
τ
(
t
)
)
) and x
i
(
t
); R
i
j depicts the resistor between the feedback function g
i
(
x
i
(
t
-
τ
(
t
)
)
) and y
j
(
t
). Then the transmission time-varying delay is illustrated by τ
(
t
), I
i
(
t
) is the bias function or external input on the ith subsystem at time t, J
j
(
t
) denotes the bias function or external input on the jth subsystem at time t, and(2)
s
i
g
n
i
j
=
s
i
g
n
j
i
1
,
i
≠
j
,
-
1
,
i
=
j
.Figure 1
The circuits implementing of BAMNNs with transmission time-varying delay.Remark 1.
Enlightened by [23–29], especially for [39], we proposed the following system which contains not only discrete time-varying delays τ
(
t
) and σ
(
t
), but also distributed time-varying delays μ
(
t
) and ε
(
t
). And self-inhibition weights d
i
(
x
i
(
t
)
) and p
j
(
y
j
(
t
)
) are also time-varying. Therefore, the obtained results are more general and practical than some existing results.Based on the physical properties of a memristor, the proposed MBAMNNs with mixed time-varying delays are described by the following differential equations:(3)
d
x
i
t
=
-
d
i
x
i
t
x
i
t
+
I
i
t
+
∑
j
=
1
m
a
j
i
x
i
t
f
j
y
j
t
+
∑
j
=
1
m
b
j
i
x
i
t
-
τ
t
f
j
y
j
t
-
τ
t
+
∑
j
=
1
m
c
j
i
x
i
t
∫
t
-
μ
t
t
f
j
y
j
s
d
s
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
j
t
,
y
j
t
-
τ
t
d
ω
j
t
,
d
y
j
t
=
-
p
j
y
j
t
y
j
t
+
I
j
t
+
∑
i
=
1
n
m
i
j
y
j
t
g
i
x
i
t
+
∑
i
=
1
n
n
i
j
y
j
t
-
σ
t
g
i
x
i
t
-
σ
t
+
∑
i
=
1
n
q
i
j
y
j
t
∫
t
-
ε
t
t
g
i
x
i
s
d
s
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
i
t
,
x
i
t
-
σ
t
d
ω
i
t
,where x
i
(
t
) and y
j
(
t
) denote the voltages of capacitors C
i and C
~
j at time t, for t
≥
0, i
=
1,2
,
…
,
n, and j
=
1,2
,
…
,
m. d
i
>
0 and p
j
>
0 represent the self-feedback connection weight. Then a
j
i
(
x
i
(
t
)
), b
j
i
(
x
i
(
t
-
τ
(
t
)
)
), c
j
i
(
x
i
(
t
)
), m
i
j
(
y
j
(
t
)
), n
i
j
(
y
j
(
t
-
σ
(
t
)
)
), and q
i
j
(
y
j
(
t
)
) represent the memristor-based weights. In addition, f
j
(
y
j
(
t
)
) and g
i
(
x
i
(
t
)
) are feedback functions, τ
(
t
) and σ
(
t
) are discrete time-varying delays, μ
(
t
) and ε
(
t
) are finite distributed time-varying delays. In addition, I
i
(
t
) and I
j
(
t
) denote the continuous external inputs, respectively.According to the current-voltage characteristic and the property of a memristor, the memristive connection weights of system (3) can be modeled as(4)
d
i
x
i
t
=
d
i
ˇ
,
x
i
t
≤
T
i
,
d
i
^
,
x
i
t
>
T
i
,
a
j
i
x
i
t
=
a
ˇ
j
i
,
x
i
t
≤
T
i
,
a
^
j
i
,
x
i
t
>
T
i
,
p
j
y
j
t
=
p
j
ˇ
,
y
j
t
≤
R
j
,
p
j
^
,
y
j
t
>
R
j
,
m
i
j
y
j
t
=
m
ˇ
i
j
,
y
j
t
≤
R
j
,
m
^
i
j
,
y
j
t
>
R
j
,
c
j
i
x
i
t
=
c
ˇ
j
i
,
x
i
t
≤
T
i
,
c
^
j
i
,
x
i
t
>
T
i
,
q
i
j
y
j
t
=
q
ˇ
i
j
,
y
j
t
≤
R
j
,
q
^
i
j
,
y
j
t
>
R
j
,
b
j
i
x
i
t
-
τ
t
=
b
ˇ
j
i
,
x
i
t
-
τ
t
≤
T
i
,
b
^
j
i
,
x
i
t
-
τ
t
>
T
i
,
n
i
j
y
j
t
-
σ
t
=
n
ˇ
i
j
,
y
j
t
-
σ
t
≤
R
j
,
n
^
i
j
,
y
j
t
-
σ
t
>
R
j
,in which switching jumps T
i
>
0, d
i
ˇ
>
0, d
i
^
>
0 and a
ˇ
j
i, a
^
j
i, b
ˇ
j
i, b
^
j
i, c
ˇ
j
i, c
^
j
i, for i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
m are constants, so do R
j, p
j
ˇ, p
j
^, m
ˇ
i
j, m
^
i
j, q
ˇ
i
j, q
^
i
j, n
ˇ
i
j, and n
^
i
j.In this paper, we treat system (3) as the drive system; then the corresponding response system with stochastic perturbations is described as(5)
d
x
^
i
t
=
-
d
i
x
^
i
t
x
^
i
t
+
∑
j
=
1
m
a
j
i
x
^
i
t
f
j
y
^
j
t
+
∑
j
=
1
m
b
j
i
x
^
i
t
-
τ
t
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
m
c
j
i
x
^
i
t
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
I
i
t
+
U
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
^
j
t
,
y
^
j
t
-
τ
t
d
ω
j
t
,
d
y
^
j
t
=
-
p
j
y
^
j
t
y
^
j
t
+
∑
i
=
1
n
m
i
j
y
^
j
t
g
i
x
^
i
t
+
∑
i
=
1
n
n
i
j
y
^
j
t
-
σ
t
g
i
x
^
i
t
-
σ
t
+
∑
i
=
1
n
q
i
j
y
^
j
t
∫
t
-
ε
t
t
g
i
x
^
i
s
d
s
+
I
j
t
+
U
j
t
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
^
i
t
,
x
^
i
t
-
σ
t
d
ω
i
t
,where (6)
d
i
x
^
i
t
=
d
i
ˇ
,
x
^
i
t
≤
T
i
,
d
i
^
,
x
^
i
t
>
T
i
,
a
j
i
x
^
i
t
=
a
ˇ
j
i
,
x
^
i
t
≤
T
i
,
a
^
j
i
,
x
^
i
t
>
T
i
,
c
j
i
x
^
i
t
=
c
ˇ
j
i
,
x
^
i
t
≤
T
i
,
c
^
j
i
,
x
^
i
t
>
T
i
,
p
j
y
^
j
t
=
p
ˇ
j
,
y
^
j
t
≤
R
j
,
p
^
j
,
y
^
j
t
>
R
j
,
m
i
j
y
^
j
t
=
m
ˇ
i
j
,
y
^
j
t
≤
R
j
,
m
^
i
j
,
y
^
j
t
>
R
j
,
q
i
j
y
^
j
t
=
q
ˇ
i
j
,
y
^
j
t
≤
R
j
,
q
^
i
j
,
y
^
j
t
>
R
j
,
b
j
i
x
^
i
t
-
τ
t
=
b
ˇ
j
i
,
x
^
i
t
-
τ
t
≤
T
i
,
b
^
j
i
,
x
^
i
t
-
τ
t
>
T
i
,
n
i
j
y
^
j
t
-
σ
t
=
n
ˇ
i
j
,
y
^
j
t
-
σ
t
≤
R
j
,
n
^
i
j
,
y
^
j
t
-
σ
t
>
R
j
.U
i
(
t
) and U
j
(
t
) are the appropriate controllers that will be proposed in order to gain the certain control objectives. Consider the following state feedback sampled-data controllers:(7)
U
i
t
=
K
i
e
i
t
k
1
-
λ
i
s
i
g
n
e
i
t
,
U
j
t
=
K
j
e
j
t
k
2
-
λ
j
s
i
g
n
e
j
t
,where K
i and K
j are the sampled-data controllers gain matrices to be designed. λ
i and λ
j are positive scalars. Then e
i
(
t
k
1
) and e
j
(
t
k
2
) are discrete measurements of e
i
(
t
) and e
j
(
t
) at the sampling instant t
k
1 and t
k
2, respectively. And the sampling instants satisfy the following conditions:(8)
0
=
t
01
<
t
11
<
⋯
<
t
k
1
<
⋯
<
l
i
m
n
→
∞
t
k
1
=
+
∞
,
0
=
t
02
<
t
12
<
⋯
<
t
k
2
<
⋯
<
l
i
m
n
→
∞
t
k
2
=
+
∞
.Remark 2.
According to the discussions above, the inner connection matricesd
i
(
x
i
(
t
)
), a
j
i
(
x
i
(
t
), b
j
i
(
x
i
(
t
-
τ
(
t
)
)
), c
j
i
(
x
i
(
t
)
), p
j
(
y
j
(
t
)
), m
i
j
(
y
j
(
t
)
), q
i
j
(
y
j
(
t
)
), n
i
j
(
y
j
(
t
-
σ
(
t
)
)
), d
i
(
x
^
i
(
t
)
), a
j
i
(
x
^
i
(
t
), b
j
i
(
x
^
i
(
t
-
τ
(
t
)
)
), c
j
i
(
x
^
i
(
t
)
), p
j
(
y
^
j
(
t
)
), m
i
j
(
y
^
j
(
t
)
), q
i
j
(
y
^
j
(
t
)
), and n
i
j
(
y
^
j
(
t
-
σ
(
t
)
)
) of systems (3) and (5) are varying with the state of memristance. Therefore, the MBAMNNs are considered as the state-dependent systems. When the parameters are all constants, systems (3) and (5) become a general class of BAMNNs.We define the following error system as follows:(9)
d
e
i
t
=
d
x
^
i
t
-
d
x
i
t
,
i
=
1,2
,
…
,
n
,
d
e
j
t
=
d
y
^
j
t
-
d
y
j
t
,
j
=
1,2
,
…
,
m
.Remark 3.
Some of the published papers studied the synchronization of MNNs [24, 25] through the following assumption to design the error system:(10)
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
-
c
o
a
_
i
j
,
a
¯
i
j
f
j
x
j
t
⊆
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
-
f
j
x
j
t
.
Letc
o
[
a
,
b
] denote the closure of convex hull generated by real numbers a and b or real matrices a and b. However this assumption has not always been proved to be correct. In [26], authors tried to deal with the synchronization issue of MABMNNs, but the results are unreasonable without taking the switching jumps into account.
The antisynchronization can avoid the problems mentioned above by constructing the error system as the following assumption:(11)
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
+
c
o
a
_
i
j
,
a
¯
i
j
f
j
x
j
t
⊆
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
+
f
j
x
j
t
.But it still has limitations in practical applications, such as associative memory and associative learning. It is worth mentioning that we fully consider the complex property of the inner connection and take the switching jumps into consideration. Therefore, the obtained results are more practical and less conservative than some published literatures.


### 2.2. Definitions and Assumptions

In order to get our primary conclusions in the next section, we make the following assumptions. For the sampling interval, one has the following.Assumption 4 (see [40]).
It is supposed that the interval between any two sampling instants is bounded byd (d
>
0):(12)
Δ
k
1
=
t
k
1
+
1
-
t
k
1
≤
d
1
,
∀
k
1
≥
0
,
Δ
k
2
=
t
k
2
+
1
-
t
k
2
≤
d
2
,
∀
k
2
≥
0
.
The constantsd
1, d
2 denote the maximum time span between t
k
1
+
1 and t
k
1, t
k
2
+
1 and t
k
2. The state is sampled, and t
k
1
+
1, t
k
2
+
1 are the next update reaching the destination.
Due to the discrete termse
i
(
t
k
1
) and e
j
(
t
k
2
), it is difficult to analyze the synchronization of MBAMNNs directly. Therefore, according to the input delay approach, t
k
1 and t
k
2 are defined as(13)
t
k
1
=
t
-
t
-
t
k
1
≔
t
-
d
1
t
,
t
k
2
=
t
-
t
-
t
k
2
≔
t
-
d
2
t
,where 0
≤
d
1
(
t
)
≤
d
1, 0
≤
d
2
(
t
)
≤
d
2, and the controllers can be designed as(14)
U
i
t
=
K
i
e
i
t
-
d
1
t
-
λ
i
s
i
g
n
e
i
t
,
U
j
t
=
K
j
e
j
t
-
d
2
t
-
λ
j
s
i
g
n
e
j
t
.Remark 5.
It should be noted that [41] has made use of the sampled-data control to the MNNs, but to the best of our knowledge little attention has been paid to the MBAMNNs with mixed time-varying delays and stochastic perturbations based on sampled-data control theory, which motivates our present study.Definition 6.
Systems (3) and (5) are said to be asymptotically synchronized if and only if the error systems are globally asymptotically stable for the equilibrium points e
i
(
t
)
≡
0 and e
j
(
t
)
≡
0. That is, e
i
(
t
)
→
0, e
j
(
t
)
→
0 as t
→
0, for any initial conditions(15)
ϕ
s
=
ϕ
1
s
,
ϕ
2
s
,
…
,
ϕ
n
s
T
∈
C
-
ν
,
0
,
R
n
,
γ
s
=
γ
1
s
,
γ
2
s
,
…
,
γ
m
s
T
∈
C
-
ς
,
0
,
R
m
,
φ
s
=
φ
1
s
,
φ
2
s
,
…
,
φ
n
s
T
∈
C
-
ν
,
0
,
R
n
,
ψ
s
=
ψ
1
s
,
ψ
2
s
,
…
,
ψ
m
s
T
∈
C
-
ς
,
0
,
R
m
,where ν
=
m
a
x
1
≤
i
≤
n
{
τ
i
,
μ
i
} which denotes the Banach space of all continuous functions mapping [
-
ν
,
0
] into R
n with 2-norm defined by ϕ
=
(
∑
i
=
1
n
‍
ϕ
i
2
), φ
=
(
∑
i
=
1
n
‍
φ
i
2
), and ς
=
m
a
x
1
≤
j
≤
m
{
σ
j
,
ε
j
}. They denote the Banach space of all continuous functions mapping [
-
ς
,
0
] into R
m with 2-norm defined by γ
=
(
∑
j
=
1
m
‍
γ
j
2
), ψ
=
(
∑
j
=
1
m
‍
ψ
j
2
).Assumption 7 (see [42]).
The activation functionsf
j
(
·
)
(
j
=
1,2
,
…
,
m
) and g
i
(
·
)
(
i
=
1,2
,
…
,
n
) are bounded and globally Lipschitz continuous in R; namely, there exist constants α
i
,
β
i, α
j, and β
j for all s
1
,
s
2
∈
R, s
1
≠
s
2 such that(16)
α
j
≤
f
j
s
1
-
f
j
s
2
s
1
-
s
2
≤
β
j
,
f
j
·
≤
Γ
j
,
α
i
≤
g
i
s
1
-
g
i
s
2
s
1
-
s
2
≤
β
i
,
g
i
·
≤
Δ
i
,where the constants α
i, β
i, α
j, and β
j can be positive numbers, negative numbers, or zero.Assumption 8 (see [37]).
There exist constantsR
1
⩾
0, R
2
⩾
0, such that (17)
T
r
a
c
e
σ
T
t
,
x
t
,
x
t
-
ξ
t
σ
t
,
x
t
,
x
t
-
ξ
t
≤
x
T
t
R
1
x
t
+
x
T
t
-
ξ
t
R
2
x
t
-
ξ
t
.
For the stochastic system [42],(18)
d
y
t
=
g
t
,
y
t
d
t
+
σ
t
,
y
t
d
ω
t
,where ω
(
t
) is the Brownian motion and it is clearly E
ω
(
t
)
=
0. L is the operator defined as follows:(19)
L
V
t
,
y
=
V
t
t
,
y
+
V
y
t
,
y
+
1
2
T
r
a
c
e
σ
T
t
,
y
t
V
y
y
σ
t
,
y
t
,where (20)
V
t
t
,
y
=
∂
V
t
t
,
y
∂
t
,
V
y
y
t
,
y
=
∂
2
V
t
t
,
y
∂
y
i
∂
y
j
,
V
y
t
,
y
=
∂
V
t
t
,
y
∂
y
1
,
∂
V
t
t
,
y
∂
y
2
,
…
,
∂
V
t
t
,
y
∂
y
n
T
.Assumption 9.
The time-varying delaysτ
(
t
), σ
(
t
) in this paper are differential functions, where(21)
0
<
τ
t
<
τ
,
0
<
σ
t
<
σ
,
τ
˙
t
≤
τ
1
<
1
,
σ
˙
t
≤
σ
1
<
1
,
μ
t
≤
μ
,
ε
t
≤
ε
,
d
˙
1
t
≤
d
1
′
<
1
,
d
˙
2
t
≤
d
2
′
<
1
,for all t
≥
0.Lemma 10 (see [43]).
Given any real matrixX
,
Z
,
P of appropriate dimensions, a scalar ϵ
0
>
0, and P
>
0, the following inequality holds:(22)
X
T
Z
+
Z
T
X
≤
ϵ
0
X
T
P
X
+
ϵ
0
-
1
Z
T
P
-
1
Z
.In particular, ifX and Z are vectors, X
T
Z
≤
1
/
2
(
X
T
X
+
Z
T
Z
)
.


## 2.1. Model Description

In order to better understand the MBAMNNs, firstly we describe the circuit of a general class of BAMNNs with the architecture as shown in Figure1. Take the ith subsystem and the jth subsystem as the unit of analysis so as to simplify illustration [39]; one can clearly see that the Kirchhoff’s current law (KCL) of the subsystems of BAMNNs [3] is described as the following differential equation:(1)
d
x
i
t
=
-
x
i
t
+
1
C
i
∑
j
=
1
m
f
j
y
j
t
-
τ
t
F
j
i
×
s
i
g
n
j
i
+
I
i
t
C
j
,
t
≥
0
,
i
=
1,2
,
…
,
n
,
d
y
j
t
=
-
y
j
t
+
1
C
~
i
∑
i
=
1
n
g
i
x
i
t
-
τ
t
R
i
j
×
s
i
g
n
i
j
+
J
j
t
C
~
j
,
t
≥
0
,
j
=
1,2
,
…
,
m
,where x
i
(
t
) and y
j
(
t
) are the voltages of capacitors C
i and C
~
j, respectively. And F
j
i presents the resistor between the feedback function f
j
(
y
j
(
t
-
τ
(
t
)
)
) and x
i
(
t
); R
i
j depicts the resistor between the feedback function g
i
(
x
i
(
t
-
τ
(
t
)
)
) and y
j
(
t
). Then the transmission time-varying delay is illustrated by τ
(
t
), I
i
(
t
) is the bias function or external input on the ith subsystem at time t, J
j
(
t
) denotes the bias function or external input on the jth subsystem at time t, and(2)
s
i
g
n
i
j
=
s
i
g
n
j
i
1
,
i
≠
j
,
-
1
,
i
=
j
.Figure 1
The circuits implementing of BAMNNs with transmission time-varying delay.Remark 1.
Enlightened by [23–29], especially for [39], we proposed the following system which contains not only discrete time-varying delays τ
(
t
) and σ
(
t
), but also distributed time-varying delays μ
(
t
) and ε
(
t
). And self-inhibition weights d
i
(
x
i
(
t
)
) and p
j
(
y
j
(
t
)
) are also time-varying. Therefore, the obtained results are more general and practical than some existing results.Based on the physical properties of a memristor, the proposed MBAMNNs with mixed time-varying delays are described by the following differential equations:(3)
d
x
i
t
=
-
d
i
x
i
t
x
i
t
+
I
i
t
+
∑
j
=
1
m
a
j
i
x
i
t
f
j
y
j
t
+
∑
j
=
1
m
b
j
i
x
i
t
-
τ
t
f
j
y
j
t
-
τ
t
+
∑
j
=
1
m
c
j
i
x
i
t
∫
t
-
μ
t
t
f
j
y
j
s
d
s
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
j
t
,
y
j
t
-
τ
t
d
ω
j
t
,
d
y
j
t
=
-
p
j
y
j
t
y
j
t
+
I
j
t
+
∑
i
=
1
n
m
i
j
y
j
t
g
i
x
i
t
+
∑
i
=
1
n
n
i
j
y
j
t
-
σ
t
g
i
x
i
t
-
σ
t
+
∑
i
=
1
n
q
i
j
y
j
t
∫
t
-
ε
t
t
g
i
x
i
s
d
s
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
i
t
,
x
i
t
-
σ
t
d
ω
i
t
,where x
i
(
t
) and y
j
(
t
) denote the voltages of capacitors C
i and C
~
j at time t, for t
≥
0, i
=
1,2
,
…
,
n, and j
=
1,2
,
…
,
m. d
i
>
0 and p
j
>
0 represent the self-feedback connection weight. Then a
j
i
(
x
i
(
t
)
), b
j
i
(
x
i
(
t
-
τ
(
t
)
)
), c
j
i
(
x
i
(
t
)
), m
i
j
(
y
j
(
t
)
), n
i
j
(
y
j
(
t
-
σ
(
t
)
)
), and q
i
j
(
y
j
(
t
)
) represent the memristor-based weights. In addition, f
j
(
y
j
(
t
)
) and g
i
(
x
i
(
t
)
) are feedback functions, τ
(
t
) and σ
(
t
) are discrete time-varying delays, μ
(
t
) and ε
(
t
) are finite distributed time-varying delays. In addition, I
i
(
t
) and I
j
(
t
) denote the continuous external inputs, respectively.According to the current-voltage characteristic and the property of a memristor, the memristive connection weights of system (3) can be modeled as(4)
d
i
x
i
t
=
d
i
ˇ
,
x
i
t
≤
T
i
,
d
i
^
,
x
i
t
>
T
i
,
a
j
i
x
i
t
=
a
ˇ
j
i
,
x
i
t
≤
T
i
,
a
^
j
i
,
x
i
t
>
T
i
,
p
j
y
j
t
=
p
j
ˇ
,
y
j
t
≤
R
j
,
p
j
^
,
y
j
t
>
R
j
,
m
i
j
y
j
t
=
m
ˇ
i
j
,
y
j
t
≤
R
j
,
m
^
i
j
,
y
j
t
>
R
j
,
c
j
i
x
i
t
=
c
ˇ
j
i
,
x
i
t
≤
T
i
,
c
^
j
i
,
x
i
t
>
T
i
,
q
i
j
y
j
t
=
q
ˇ
i
j
,
y
j
t
≤
R
j
,
q
^
i
j
,
y
j
t
>
R
j
,
b
j
i
x
i
t
-
τ
t
=
b
ˇ
j
i
,
x
i
t
-
τ
t
≤
T
i
,
b
^
j
i
,
x
i
t
-
τ
t
>
T
i
,
n
i
j
y
j
t
-
σ
t
=
n
ˇ
i
j
,
y
j
t
-
σ
t
≤
R
j
,
n
^
i
j
,
y
j
t
-
σ
t
>
R
j
,in which switching jumps T
i
>
0, d
i
ˇ
>
0, d
i
^
>
0 and a
ˇ
j
i, a
^
j
i, b
ˇ
j
i, b
^
j
i, c
ˇ
j
i, c
^
j
i, for i
=
1,2
,
…
,
n
,
j
=
1,2
,
…
,
m are constants, so do R
j, p
j
ˇ, p
j
^, m
ˇ
i
j, m
^
i
j, q
ˇ
i
j, q
^
i
j, n
ˇ
i
j, and n
^
i
j.In this paper, we treat system (3) as the drive system; then the corresponding response system with stochastic perturbations is described as(5)
d
x
^
i
t
=
-
d
i
x
^
i
t
x
^
i
t
+
∑
j
=
1
m
a
j
i
x
^
i
t
f
j
y
^
j
t
+
∑
j
=
1
m
b
j
i
x
^
i
t
-
τ
t
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
m
c
j
i
x
^
i
t
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
I
i
t
+
U
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
^
j
t
,
y
^
j
t
-
τ
t
d
ω
j
t
,
d
y
^
j
t
=
-
p
j
y
^
j
t
y
^
j
t
+
∑
i
=
1
n
m
i
j
y
^
j
t
g
i
x
^
i
t
+
∑
i
=
1
n
n
i
j
y
^
j
t
-
σ
t
g
i
x
^
i
t
-
σ
t
+
∑
i
=
1
n
q
i
j
y
^
j
t
∫
t
-
ε
t
t
g
i
x
^
i
s
d
s
+
I
j
t
+
U
j
t
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
^
i
t
,
x
^
i
t
-
σ
t
d
ω
i
t
,where (6)
d
i
x
^
i
t
=
d
i
ˇ
,
x
^
i
t
≤
T
i
,
d
i
^
,
x
^
i
t
>
T
i
,
a
j
i
x
^
i
t
=
a
ˇ
j
i
,
x
^
i
t
≤
T
i
,
a
^
j
i
,
x
^
i
t
>
T
i
,
c
j
i
x
^
i
t
=
c
ˇ
j
i
,
x
^
i
t
≤
T
i
,
c
^
j
i
,
x
^
i
t
>
T
i
,
p
j
y
^
j
t
=
p
ˇ
j
,
y
^
j
t
≤
R
j
,
p
^
j
,
y
^
j
t
>
R
j
,
m
i
j
y
^
j
t
=
m
ˇ
i
j
,
y
^
j
t
≤
R
j
,
m
^
i
j
,
y
^
j
t
>
R
j
,
q
i
j
y
^
j
t
=
q
ˇ
i
j
,
y
^
j
t
≤
R
j
,
q
^
i
j
,
y
^
j
t
>
R
j
,
b
j
i
x
^
i
t
-
τ
t
=
b
ˇ
j
i
,
x
^
i
t
-
τ
t
≤
T
i
,
b
^
j
i
,
x
^
i
t
-
τ
t
>
T
i
,
n
i
j
y
^
j
t
-
σ
t
=
n
ˇ
i
j
,
y
^
j
t
-
σ
t
≤
R
j
,
n
^
i
j
,
y
^
j
t
-
σ
t
>
R
j
.U
i
(
t
) and U
j
(
t
) are the appropriate controllers that will be proposed in order to gain the certain control objectives. Consider the following state feedback sampled-data controllers:(7)
U
i
t
=
K
i
e
i
t
k
1
-
λ
i
s
i
g
n
e
i
t
,
U
j
t
=
K
j
e
j
t
k
2
-
λ
j
s
i
g
n
e
j
t
,where K
i and K
j are the sampled-data controllers gain matrices to be designed. λ
i and λ
j are positive scalars. Then e
i
(
t
k
1
) and e
j
(
t
k
2
) are discrete measurements of e
i
(
t
) and e
j
(
t
) at the sampling instant t
k
1 and t
k
2, respectively. And the sampling instants satisfy the following conditions:(8)
0
=
t
01
<
t
11
<
⋯
<
t
k
1
<
⋯
<
l
i
m
n
→
∞
t
k
1
=
+
∞
,
0
=
t
02
<
t
12
<
⋯
<
t
k
2
<
⋯
<
l
i
m
n
→
∞
t
k
2
=
+
∞
.Remark 2.
According to the discussions above, the inner connection matricesd
i
(
x
i
(
t
)
), a
j
i
(
x
i
(
t
), b
j
i
(
x
i
(
t
-
τ
(
t
)
)
), c
j
i
(
x
i
(
t
)
), p
j
(
y
j
(
t
)
), m
i
j
(
y
j
(
t
)
), q
i
j
(
y
j
(
t
)
), n
i
j
(
y
j
(
t
-
σ
(
t
)
)
), d
i
(
x
^
i
(
t
)
), a
j
i
(
x
^
i
(
t
), b
j
i
(
x
^
i
(
t
-
τ
(
t
)
)
), c
j
i
(
x
^
i
(
t
)
), p
j
(
y
^
j
(
t
)
), m
i
j
(
y
^
j
(
t
)
), q
i
j
(
y
^
j
(
t
)
), and n
i
j
(
y
^
j
(
t
-
σ
(
t
)
)
) of systems (3) and (5) are varying with the state of memristance. Therefore, the MBAMNNs are considered as the state-dependent systems. When the parameters are all constants, systems (3) and (5) become a general class of BAMNNs.We define the following error system as follows:(9)
d
e
i
t
=
d
x
^
i
t
-
d
x
i
t
,
i
=
1,2
,
…
,
n
,
d
e
j
t
=
d
y
^
j
t
-
d
y
j
t
,
j
=
1,2
,
…
,
m
.Remark 3.
Some of the published papers studied the synchronization of MNNs [24, 25] through the following assumption to design the error system:(10)
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
-
c
o
a
_
i
j
,
a
¯
i
j
f
j
x
j
t
⊆
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
-
f
j
x
j
t
.
Letc
o
[
a
,
b
] denote the closure of convex hull generated by real numbers a and b or real matrices a and b. However this assumption has not always been proved to be correct. In [26], authors tried to deal with the synchronization issue of MABMNNs, but the results are unreasonable without taking the switching jumps into account.
The antisynchronization can avoid the problems mentioned above by constructing the error system as the following assumption:(11)
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
+
c
o
a
_
i
j
,
a
¯
i
j
f
j
x
j
t
⊆
c
o
a
_
i
j
,
a
¯
i
j
f
j
y
j
t
+
f
j
x
j
t
.But it still has limitations in practical applications, such as associative memory and associative learning. It is worth mentioning that we fully consider the complex property of the inner connection and take the switching jumps into consideration. Therefore, the obtained results are more practical and less conservative than some published literatures.


## 2.2. Definitions and Assumptions

In order to get our primary conclusions in the next section, we make the following assumptions. For the sampling interval, one has the following.Assumption 4 (see [40]).
It is supposed that the interval between any two sampling instants is bounded byd (d
>
0):(12)
Δ
k
1
=
t
k
1
+
1
-
t
k
1
≤
d
1
,
∀
k
1
≥
0
,
Δ
k
2
=
t
k
2
+
1
-
t
k
2
≤
d
2
,
∀
k
2
≥
0
.
The constantsd
1, d
2 denote the maximum time span between t
k
1
+
1 and t
k
1, t
k
2
+
1 and t
k
2. The state is sampled, and t
k
1
+
1, t
k
2
+
1 are the next update reaching the destination.
Due to the discrete termse
i
(
t
k
1
) and e
j
(
t
k
2
), it is difficult to analyze the synchronization of MBAMNNs directly. Therefore, according to the input delay approach, t
k
1 and t
k
2 are defined as(13)
t
k
1
=
t
-
t
-
t
k
1
≔
t
-
d
1
t
,
t
k
2
=
t
-
t
-
t
k
2
≔
t
-
d
2
t
,where 0
≤
d
1
(
t
)
≤
d
1, 0
≤
d
2
(
t
)
≤
d
2, and the controllers can be designed as(14)
U
i
t
=
K
i
e
i
t
-
d
1
t
-
λ
i
s
i
g
n
e
i
t
,
U
j
t
=
K
j
e
j
t
-
d
2
t
-
λ
j
s
i
g
n
e
j
t
.Remark 5.
It should be noted that [41] has made use of the sampled-data control to the MNNs, but to the best of our knowledge little attention has been paid to the MBAMNNs with mixed time-varying delays and stochastic perturbations based on sampled-data control theory, which motivates our present study.Definition 6.
Systems (3) and (5) are said to be asymptotically synchronized if and only if the error systems are globally asymptotically stable for the equilibrium points e
i
(
t
)
≡
0 and e
j
(
t
)
≡
0. That is, e
i
(
t
)
→
0, e
j
(
t
)
→
0 as t
→
0, for any initial conditions(15)
ϕ
s
=
ϕ
1
s
,
ϕ
2
s
,
…
,
ϕ
n
s
T
∈
C
-
ν
,
0
,
R
n
,
γ
s
=
γ
1
s
,
γ
2
s
,
…
,
γ
m
s
T
∈
C
-
ς
,
0
,
R
m
,
φ
s
=
φ
1
s
,
φ
2
s
,
…
,
φ
n
s
T
∈
C
-
ν
,
0
,
R
n
,
ψ
s
=
ψ
1
s
,
ψ
2
s
,
…
,
ψ
m
s
T
∈
C
-
ς
,
0
,
R
m
,where ν
=
m
a
x
1
≤
i
≤
n
{
τ
i
,
μ
i
} which denotes the Banach space of all continuous functions mapping [
-
ν
,
0
] into R
n with 2-norm defined by ϕ
=
(
∑
i
=
1
n
‍
ϕ
i
2
), φ
=
(
∑
i
=
1
n
‍
φ
i
2
), and ς
=
m
a
x
1
≤
j
≤
m
{
σ
j
,
ε
j
}. They denote the Banach space of all continuous functions mapping [
-
ς
,
0
] into R
m with 2-norm defined by γ
=
(
∑
j
=
1
m
‍
γ
j
2
), ψ
=
(
∑
j
=
1
m
‍
ψ
j
2
).Assumption 7 (see [42]).
The activation functionsf
j
(
·
)
(
j
=
1,2
,
…
,
m
) and g
i
(
·
)
(
i
=
1,2
,
…
,
n
) are bounded and globally Lipschitz continuous in R; namely, there exist constants α
i
,
β
i, α
j, and β
j for all s
1
,
s
2
∈
R, s
1
≠
s
2 such that(16)
α
j
≤
f
j
s
1
-
f
j
s
2
s
1
-
s
2
≤
β
j
,
f
j
·
≤
Γ
j
,
α
i
≤
g
i
s
1
-
g
i
s
2
s
1
-
s
2
≤
β
i
,
g
i
·
≤
Δ
i
,where the constants α
i, β
i, α
j, and β
j can be positive numbers, negative numbers, or zero.Assumption 8 (see [37]).
There exist constantsR
1
⩾
0, R
2
⩾
0, such that (17)
T
r
a
c
e
σ
T
t
,
x
t
,
x
t
-
ξ
t
σ
t
,
x
t
,
x
t
-
ξ
t
≤
x
T
t
R
1
x
t
+
x
T
t
-
ξ
t
R
2
x
t
-
ξ
t
.
For the stochastic system [42],(18)
d
y
t
=
g
t
,
y
t
d
t
+
σ
t
,
y
t
d
ω
t
,where ω
(
t
) is the Brownian motion and it is clearly E
ω
(
t
)
=
0. L is the operator defined as follows:(19)
L
V
t
,
y
=
V
t
t
,
y
+
V
y
t
,
y
+
1
2
T
r
a
c
e
σ
T
t
,
y
t
V
y
y
σ
t
,
y
t
,where (20)
V
t
t
,
y
=
∂
V
t
t
,
y
∂
t
,
V
y
y
t
,
y
=
∂
2
V
t
t
,
y
∂
y
i
∂
y
j
,
V
y
t
,
y
=
∂
V
t
t
,
y
∂
y
1
,
∂
V
t
t
,
y
∂
y
2
,
…
,
∂
V
t
t
,
y
∂
y
n
T
.Assumption 9.
The time-varying delaysτ
(
t
), σ
(
t
) in this paper are differential functions, where(21)
0
<
τ
t
<
τ
,
0
<
σ
t
<
σ
,
τ
˙
t
≤
τ
1
<
1
,
σ
˙
t
≤
σ
1
<
1
,
μ
t
≤
μ
,
ε
t
≤
ε
,
d
˙
1
t
≤
d
1
′
<
1
,
d
˙
2
t
≤
d
2
′
<
1
,for all t
≥
0.Lemma 10 (see [43]).
Given any real matrixX
,
Z
,
P of appropriate dimensions, a scalar ϵ
0
>
0, and P
>
0, the following inequality holds:(22)
X
T
Z
+
Z
T
X
≤
ϵ
0
X
T
P
X
+
ϵ
0
-
1
Z
T
P
-
1
Z
.In particular, ifX and Z are vectors, X
T
Z
≤
1
/
2
(
X
T
X
+
Z
T
Z
)
.


## 3. Main Results

In this section, we get some new sufficient conditions to ensure the synchronization of MBAMNNs by the designed sampled-data controller.Theorem 11.
Assume that Assumption7 is satisfied; then error system (9) achieves global stable situation under the designed sampled-data feedback controller (7) with the control law as follows:(23)
K
i
2
≤
min
⁡
Ξ
1
,
Ξ
2
,
K
j
2
≤
min
⁡
Π
1
,
Π
2
,
λ
i
>
∑
i
=
1
n
d
i
ˇ
-
d
^
i
T
i
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
L
y
R
j
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
Γ
j
+
∑
j
=
1
m
c
ˇ
j
i
-
c
j
i
μ
L
y
R
j
,
λ
j
>
∑
i
=
1
n
p
j
ˇ
-
p
^
j
R
j
+
∑
i
=
1
n
m
ˇ
i
j
-
m
^
i
j
L
x
T
i
+
∑
i
=
1
n
n
ˇ
i
j
-
n
^
i
j
Δ
i
+
∑
i
=
1
n
q
ˇ
i
j
-
q
^
i
j
ε
L
x
T
i
,where (24)
L
x
=
max
⁡
α
i
,
β
i
,
L
y
=
max
⁡
α
j
,
β
j
,
Ξ
1
=
2
d
i
ˇ
-
∑
j
=
1
m
a
ˇ
j
i
2
L
y
2
+
b
ˇ
j
i
2
L
y
2
+
c
ˇ
j
i
2
-
1
1
-
d
1
′
-
J
1
-
m
ε
L
x
2
-
1
+
J
2
1
-
σ
1
,
Ξ
2
=
2
d
i
^
-
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
b
^
j
i
2
L
y
2
+
c
^
j
i
2
-
1
1
-
d
1
′
-
J
1
-
m
ε
L
x
2
-
1
+
J
2
1
-
σ
1
,
Π
1
=
2
p
j
ˇ
-
∑
i
=
1
n
m
ˇ
i
j
2
L
x
2
+
n
ˇ
i
j
2
L
x
2
+
q
ˇ
i
j
2
-
1
1
-
d
2
′
-
H
1
-
n
μ
L
y
2
-
1
+
H
2
1
-
τ
1
,
Π
2
=
2
p
j
^
-
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
n
^
i
j
2
L
x
2
+
q
^
i
j
2
-
1
1
-
d
2
′
-
H
1
-
n
μ
L
y
2
-
1
+
H
2
1
-
τ
1
,and J
1
,
J
2
,
H
1
,
H
2 are all positive constants.Proof.
Consider the following Lyapunov function for synchronization error system (9):(25)
V
t
=
V
x
t
+
V
y
t
,where(26)
V
x
t
=
1
2
∑
i
=
1
n
e
i
T
t
e
i
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
∫
t
-
d
1
t
t
e
i
T
s
e
i
s
d
s
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
∫
t
-
τ
t
t
e
j
T
s
e
j
s
d
s
+
1
2
∑
i
=
1
n
∑
j
=
1
m
∫
-
μ
0
∫
t
+
s
t
e
j
T
z
L
y
T
L
y
e
j
z
d
z
d
s
,
(27)
V
y
t
=
1
2
∑
j
=
1
m
e
j
T
t
e
j
t
+
∑
j
=
1
m
1
2
1
-
d
2
′
∫
t
-
d
2
t
t
e
j
T
s
e
j
s
d
s
+
∑
i
=
1
n
1
+
J
2
2
1
-
σ
1
∫
t
-
σ
t
t
e
i
T
s
e
i
s
d
s
+
1
2
∑
i
=
1
n
∑
j
=
1
m
∫
-
ε
0
∫
t
+
s
t
e
i
T
z
L
x
T
L
x
e
i
z
d
z
d
s
.
Case
1. If x
i
t
≤
T
i, x
^
i
t
≤
T
i, y
j
t
≤
R
j, y
^
j
t
≤
R
j at time t, according to the jumping rules, systems (3) and (5) are reduced to systems (28) and (29), respectively:(28)
d
x
i
t
=
-
d
ˇ
i
x
i
t
+
∑
j
=
1
m
a
ˇ
j
i
f
j
y
j
t
+
∑
j
=
1
m
b
ˇ
j
i
f
j
y
j
t
-
τ
t
+
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
f
j
y
j
s
d
s
+
I
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
j
t
,
y
j
t
-
τ
t
d
ω
j
t
,
d
y
j
t
=
-
p
ˇ
j
y
j
t
+
∑
i
=
1
n
m
ˇ
i
j
g
i
x
i
t
+
∑
i
=
1
n
n
ˇ
i
j
g
i
x
i
t
-
σ
t
+
∑
i
=
1
n
q
ˇ
i
j
∫
t
-
ε
t
t
g
i
x
i
s
d
s
+
I
j
t
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
i
t
,
x
i
t
-
σ
t
d
ω
i
t
.
Then we define the corresponding response system(29)
d
x
^
i
t
=
-
d
ˇ
i
x
^
i
t
+
∑
j
=
1
m
a
ˇ
j
i
f
j
y
^
j
t
+
∑
j
=
1
m
b
ˇ
j
i
f
j
y
^
j
t
-
τ
t
+
I
i
t
+
U
i
t
+
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
^
j
t
,
y
^
j
t
-
τ
t
d
ω
j
t
,
d
y
^
j
t
=
-
p
ˇ
j
y
^
j
t
+
∑
i
=
1
n
m
ˇ
i
j
g
i
x
^
i
t
+
∑
i
=
1
n
n
ˇ
i
j
g
i
x
^
i
t
-
σ
t
+
I
j
t
+
U
j
t
+
∑
i
=
1
n
q
ˇ
i
j
∫
t
-
ε
t
t
g
i
x
^
i
s
d
s
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
^
i
t
,
x
^
i
t
-
σ
t
d
ω
i
t
.
And error system (9) can be rewritten:(30)
d
e
i
t
=
d
x
^
i
t
-
d
x
i
t
=
-
d
ˇ
i
x
^
i
t
+
∑
j
=
1
m
a
ˇ
j
i
x
^
i
t
f
j
y
^
j
t
+
∑
j
=
1
m
b
ˇ
j
i
f
j
y
^
j
t
-
τ
t
+
I
i
t
+
U
i
t
+
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
d
ˇ
i
x
i
t
-
∑
j
=
1
m
a
ˇ
j
i
f
j
y
j
t
-
∑
j
=
1
m
b
ˇ
j
i
f
j
y
j
t
-
τ
t
-
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
f
j
y
j
s
d
s
d
t
+
∑
j
=
1
m
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
d
ω
j
t
.
Then(31)
d
e
i
t
=
-
d
ˇ
i
e
i
t
+
∑
j
=
1
m
a
ˇ
j
i
F
j
e
j
t
+
∑
j
=
1
m
b
ˇ
j
i
F
j
e
j
t
-
τ
t
+
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
F
j
e
j
s
d
s
+
K
i
e
i
t
-
d
1
t
-
λ
i
s
i
g
n
e
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
d
ω
j
t
.
We conclude that(32)
d
e
j
t
=
d
y
^
j
t
-
d
y
j
t
=
-
p
ˇ
j
e
j
t
+
∑
i
=
1
n
m
ˇ
i
j
G
i
e
i
t
+
∑
i
=
1
n
n
ˇ
i
j
G
i
e
i
t
-
σ
t
+
∑
i
=
1
n
q
ˇ
i
j
∫
t
-
ε
t
t
G
i
e
i
s
d
s
+
K
j
e
j
t
-
d
2
t
-
λ
j
s
i
g
n
e
j
t
d
t
+
∑
i
=
1
n
β
i
j
t
,
e
i
t
,
e
i
t
-
σ
t
d
ω
i
t
,where(33)
F
j
e
j
t
=
f
j
y
^
j
t
-
f
j
y
j
t
,
F
j
e
j
t
-
τ
t
=
f
j
y
^
j
t
-
τ
t
-
f
j
y
j
t
-
τ
t
,
G
i
e
i
t
=
g
i
x
^
i
t
-
g
i
x
i
t
,
G
i
e
i
t
-
σ
t
=
g
i
x
^
i
t
-
σ
t
-
g
i
x
i
t
-
σ
t
.
From all the above discussion, we get(34)
V
˙
x
t
=
∑
i
=
1
n
e
i
t
e
˙
i
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
∫
-
μ
0
e
j
T
t
L
y
T
L
y
e
j
t
d
s
-
∫
-
μ
0
e
j
T
t
+
s
L
y
T
L
y
e
j
t
+
s
d
s
,and then(35)
V
˙
x
t
≤
∑
i
=
1
n
e
i
t
e
˙
i
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
μ
e
j
T
t
L
y
T
L
y
e
j
t
-
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
.
According to (31), one has (36)
V
˙
x
t
=
∑
i
=
1
n
e
i
t
-
d
ˇ
i
e
i
t
+
∑
j
=
1
m
a
ˇ
j
i
F
j
e
j
t
+
∑
j
=
1
m
b
ˇ
j
i
F
j
e
j
t
-
τ
t
-
λ
i
s
i
g
n
e
i
t
+
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
F
j
e
j
s
d
s
+
K
i
e
i
t
-
d
1
t
+
1
2
∑
j
=
1
m
T
r
β
j
i
T
t
,
e
j
t
,
e
j
t
-
τ
t
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
μ
e
j
T
t
L
y
T
L
y
e
j
t
-
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
.
Due to Assumptions7 and 8, we obtain the following inequality:(37)
V
˙
x
t
≤
∑
i
=
1
n
e
i
t
-
d
ˇ
i
e
i
t
+
∑
j
=
1
m
a
ˇ
j
i
F
j
e
j
t
+
∑
j
=
1
m
b
ˇ
j
i
F
j
e
j
t
-
τ
t
-
λ
i
s
i
g
n
e
i
t
+
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
F
j
e
j
s
d
s
+
K
i
e
i
t
-
d
1
t
+
1
2
∑
j
=
1
m
e
j
T
t
H
1
e
j
t
+
e
j
T
t
-
τ
t
H
2
e
j
t
-
τ
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
μ
e
j
T
t
L
y
T
L
y
e
j
t
-
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
,and then(38)
V
˙
x
t
≤
∑
i
=
1
n
-
d
ˇ
i
e
i
2
t
+
∑
j
=
1
m
a
ˇ
j
i
e
i
t
L
y
e
j
t
+
∑
j
=
1
m
b
ˇ
j
i
e
i
t
L
y
e
j
t
-
τ
t
+
∑
j
=
1
m
c
ˇ
j
i
e
i
t
∫
t
-
μ
t
t
L
y
e
j
s
d
s
+
K
i
e
i
t
e
i
t
-
d
1
t
-
λ
i
e
i
t
+
1
2
∑
j
=
1
m
e
j
T
t
H
1
e
j
t
+
e
j
T
t
-
τ
t
H
2
e
j
t
-
τ
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
μ
e
j
T
t
L
y
T
L
y
e
j
t
-
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
.
Based on Lemma10, we get the inequalities as follows:(39)
K
i
e
i
t
e
i
t
-
d
1
t
≤
1
2
e
i
T
t
K
i
T
K
i
e
i
t
+
1
2
e
i
T
t
-
d
1
t
e
i
t
-
d
1
t
,
a
ˇ
j
i
e
i
t
L
y
e
j
t
≤
1
2
e
i
T
t
L
y
T
a
ˇ
j
i
T
a
ˇ
j
i
L
y
e
i
t
+
1
2
e
j
T
t
e
j
t
,
b
ˇ
j
i
e
i
t
L
y
e
j
t
-
τ
t
≤
1
2
e
i
T
t
L
y
T
b
ˇ
j
i
T
b
ˇ
j
i
L
y
e
i
t
+
1
2
e
j
T
t
-
τ
t
e
j
t
-
τ
t
,
c
ˇ
j
i
e
i
t
∫
t
-
μ
t
t
L
y
e
j
s
≤
1
2
e
i
T
t
c
ˇ
j
i
T
c
ˇ
j
i
e
i
t
+
1
2
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
.
Thus, we infer that(40)
V
˙
x
t
≤
∑
i
=
1
n
-
d
ˇ
i
e
i
2
t
+
1
2
∑
j
=
1
m
a
ˇ
j
i
2
L
y
2
e
i
2
t
+
1
2
∑
j
=
1
m
e
j
2
t
+
1
2
∑
j
=
1
m
b
ˇ
j
i
2
L
y
2
e
i
2
t
+
1
2
∑
j
=
1
m
e
j
2
t
-
τ
t
+
1
2
∑
j
=
1
m
c
ˇ
j
i
2
e
i
2
t
+
1
2
∑
j
=
1
m
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
+
1
2
K
i
2
e
i
2
t
+
1
2
e
i
2
t
-
d
1
t
-
λ
i
e
i
t
+
1
2
∑
j
=
1
m
H
1
e
j
2
t
+
H
2
e
j
2
t
-
τ
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
μ
e
j
T
t
L
y
T
L
y
e
j
t
-
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
.
After organizing the above formulas, we deduce that(41)
V
˙
x
t
≤
∑
i
=
1
n
-
d
ˇ
i
+
1
2
∑
j
=
1
m
a
ˇ
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
ˇ
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
ˇ
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
e
i
2
t
+
∑
j
=
1
m
1
2
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
e
j
2
t
.
With similar process ofV
˙
x
(
t
), we obtain V
˙
y
(
t
) as follows:(42)
V
˙
y
t
≤
∑
j
=
1
m
-
p
ˇ
j
+
1
2
∑
i
=
1
n
m
ˇ
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
ˇ
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
ˇ
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
e
j
2
t
+
∑
i
=
1
n
1
2
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
e
i
2
t
.
So according to (25) and the compilation of the above equations, we have (43)
V
˙
t
=
V
˙
x
t
+
V
˙
y
t
≤
∑
i
=
1
n
-
d
ˇ
i
+
1
2
∑
j
=
1
m
a
ˇ
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
ˇ
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
ˇ
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
e
i
2
t
+
∑
j
=
1
m
-
p
ˇ
j
+
1
2
∑
i
=
1
n
m
ˇ
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
ˇ
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
ˇ
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
+
1
2
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
e
j
2
t
≤
0
.
According to the definitions ofK
i
2 and K
j
2, one has V
˙
(
t
)
≤
0. Then (44)
-
d
ˇ
i
+
1
2
∑
j
=
1
m
a
ˇ
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
ˇ
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
ˇ
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
≤
0
,
-
p
ˇ
j
+
1
2
∑
i
=
1
n
m
ˇ
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
ˇ
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
ˇ
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
+
1
2
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
≤
0
.
Case
2. If x
i
t
>
T
i, x
^
i
t
>
T
i, y
j
t
>
R
j, y
^
j
t
>
R
j at time t, systems (3) and (5) can be reduced to the following systems, respectively:(45)
d
x
i
t
=
-
d
^
i
x
i
t
+
∑
j
=
1
m
a
^
j
i
f
j
y
j
t
+
∑
j
=
1
m
b
^
j
i
f
j
y
j
t
-
τ
t
+
∑
j
=
1
m
c
^
j
i
∫
t
-
μ
t
t
f
j
y
j
s
d
s
+
I
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
j
t
,
y
j
t
-
τ
t
d
ω
j
t
,
(46)
d
x
^
i
t
=
-
d
^
i
x
^
i
t
+
∑
j
=
1
m
a
^
j
i
f
j
y
^
j
t
+
∑
j
=
1
m
b
^
j
i
f
j
y
^
j
t
-
τ
t
+
I
i
t
+
∑
j
=
1
m
c
^
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
U
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
^
j
t
,
y
^
j
t
-
τ
t
d
ω
j
t
.
Then the corresponding error system can be defined as follows:(47)
d
e
i
t
=
-
d
^
i
e
i
t
+
∑
j
=
1
m
a
ˇ
j
i
F
j
e
j
t
+
∑
j
=
1
m
b
^
j
i
F
j
e
j
t
-
τ
t
+
∑
j
=
1
m
c
^
j
i
∫
t
-
μ
t
t
F
j
e
j
s
d
s
-
λ
i
s
i
g
n
e
i
t
+
K
i
e
i
t
-
d
1
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
d
ω
j
t
.
The following line is similar toV
˙
x
(
t
) of Case 1, and we obtain V
˙
y
(
t
) and V
˙
(
t
) as follows:(48)
V
˙
t
=
V
˙
x
t
+
V
˙
y
t
≤
∑
i
=
1
n
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
e
i
2
t
+
∑
j
=
1
m
-
p
^
j
+
1
2
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
^
i
j
2
+
1
2
K
j
t
+
1
2
1
-
d
2
′
+
1
2
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
e
j
2
t
≤
0
.
According to the definitions ofK
i
2 and K
j
2, one has V
˙
(
t
)
≤
0. Thus(49)
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
≤
0
,
-
p
^
j
+
1
2
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
^
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
+
1
2
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
≤
0
.
Case
3. If x
i
t
≤
T
i, x
^
i
t
>
T
i, y
j
t
≤
R
j, y
^
j
t
>
R
j at time t, on the basis of memristive connection weights, systems (3) and (5) can be rewritten as the following systems, respectively:(50)
d
x
i
t
=
-
d
^
i
x
i
t
+
∑
j
=
1
m
a
^
j
i
f
j
y
j
t
+
∑
j
=
1
m
b
^
j
i
f
j
y
j
t
-
τ
t
+
∑
j
=
1
m
c
^
j
i
∫
t
-
μ
t
t
f
j
y
j
s
d
s
+
I
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
j
t
,
y
j
t
-
τ
t
d
ω
j
t
.
Therefore the corresponding response system can be described as(51)
d
x
^
i
t
=
-
d
ˇ
i
x
^
i
t
+
∑
j
=
1
m
a
ˇ
j
i
f
j
y
^
j
t
+
∑
j
=
1
m
b
ˇ
j
i
f
j
y
^
j
t
-
τ
t
+
I
i
t
+
∑
j
=
1
m
c
ˇ
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
U
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
^
j
t
,
y
^
j
t
-
τ
t
d
ω
j
t
.
We define the error system(52)
d
e
i
t
=
-
d
^
i
e
i
t
+
∑
j
=
1
m
a
^
j
i
F
j
e
j
t
+
∑
j
=
1
m
b
^
j
i
F
j
e
j
t
-
τ
t
+
d
^
i
-
d
ˇ
i
x
^
i
t
+
∑
j
=
1
m
c
^
j
i
∫
t
-
μ
t
t
F
j
e
j
s
d
s
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
f
j
y
^
j
t
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
m
c
ˇ
j
i
-
c
^
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
K
i
e
i
t
-
d
1
t
-
λ
i
s
i
g
n
e
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
d
ω
j
t
.
We infer the following inequality through (26):(53)
V
˙
x
t
≤
∑
i
=
1
n
e
i
t
e
˙
i
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
μ
e
j
T
t
L
y
T
L
y
e
j
t
-
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
.
According to (52), we have(54)
V
˙
x
t
=
∑
i
=
1
n
e
i
t
-
d
^
i
e
i
t
+
∑
j
=
1
m
a
^
j
i
F
j
e
j
t
+
∑
j
=
1
m
b
^
j
i
F
j
e
j
t
-
τ
t
+
∑
j
=
1
m
c
^
j
i
∫
t
-
μ
t
t
F
j
e
j
s
d
s
+
d
^
i
-
d
ˇ
i
x
^
i
t
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
f
j
y
^
j
t
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
m
c
ˇ
j
i
-
c
^
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
K
i
e
i
t
-
d
1
t
-
λ
i
s
i
g
n
e
i
t
+
1
2
∑
j
=
1
m
T
r
β
j
i
T
t
,
e
j
t
,
e
j
t
-
τ
t
×
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
+
∑
j
=
1
m
1
+
H
2
2
1
-
τ
1
e
j
2
t
-
1
+
H
2
2
e
j
2
t
-
τ
t
+
∑
i
=
1
n
1
2
1
-
d
1
′
e
i
2
t
-
1
2
e
i
2
t
-
d
1
t
+
1
2
∑
i
=
1
n
∑
j
=
1
m
μ
e
j
T
t
L
y
T
L
y
e
j
t
-
∫
t
-
μ
t
t
e
j
T
s
L
y
T
L
y
e
j
s
d
s
.
Through Assumptions7 and 8 and Lemma 10, we get(55)
V
˙
x
t
≤
∑
i
=
1
n
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
e
i
2
t
+
∑
j
=
1
m
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
e
j
2
t
+
∑
i
=
1
n
e
i
t
d
^
i
-
d
ˇ
i
x
^
i
t
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
f
j
y
^
j
t
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
m
c
ˇ
j
i
-
c
^
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
-
λ
i
.
According to Assumption7 and switching jumps, we obtain(56)
f
j
y
^
j
t
≤
L
y
R
j
,
f
j
y
^
j
t
-
τ
t
≤
Γ
j
,
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
≤
∫
t
-
μ
t
t
L
y
R
j
d
s
=
L
y
R
j
μ
t
≤
L
y
R
j
μ
.
Then, (55) can be written as(57)
V
˙
x
t
≤
∑
i
=
1
n
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
e
i
2
t
+
∑
j
=
1
m
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
e
j
2
t
+
∑
i
=
1
n
e
i
t
d
^
i
-
d
ˇ
i
T
i
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
L
y
R
j
+
∑
j
=
1
m
c
ˇ
j
i
-
c
^
j
i
μ
L
y
R
j
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
Γ
j
-
λ
i
.
According to a similar process ofV
˙
x
(
t
), we have V
˙
(
t
) be extended as follows:(58)
V
˙
t
=
V
˙
x
t
+
V
˙
y
t
≤
∑
i
=
1
n
e
i
2
t
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
+
∑
j
=
1
m
e
j
2
t
-
p
ˇ
j
+
1
2
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
ˇ
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
+
∑
i
=
1
n
e
i
t
d
^
i
-
d
ˇ
i
T
i
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
L
y
R
j
+
∑
j
=
1
m
c
ˇ
j
i
-
c
^
j
i
μ
L
y
R
j
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
Γ
j
-
λ
i
+
∑
j
=
1
m
e
j
t
p
^
j
-
p
ˇ
j
R
j
+
∑
i
=
1
n
m
ˇ
i
j
-
m
^
i
j
L
x
T
i
+
∑
i
=
1
n
n
ˇ
i
j
-
n
^
i
j
Δ
i
+
∑
i
=
1
n
q
ˇ
i
j
-
q
^
i
j
L
x
T
i
ε
-
λ
j
≤
0
.
According to the definitions ofK
i
2, K
j
2, λ
i, and λ
j, one has V
˙
(
t
)
≤
0. Then we get (59)
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
≤
0
,
-
p
ˇ
j
+
1
2
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
ˇ
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
≤
0
,
d
^
i
-
d
ˇ
i
T
i
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
L
y
R
j
+
∑
j
=
1
m
c
ˇ
j
i
-
c
^
j
i
μ
L
y
R
j
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
Γ
j
-
λ
i
≤
0
,
p
^
j
-
p
ˇ
j
R
j
+
∑
i
=
1
n
m
ˇ
i
j
-
m
^
i
j
L
x
T
i
+
∑
i
=
1
n
n
ˇ
i
j
-
n
^
i
j
Δ
i
+
∑
i
=
1
n
q
ˇ
i
j
-
q
^
i
j
L
x
T
i
ε
-
λ
j
≤
0
.
Case
4. If x
i
t
>
T
i, x
^
i
t
≤
T
i, y
j
t
>
R
j, y
^
j
t
≤
R
j at time t, in accordance with switching jumps, the error systems can be redefined as follows:(60)
d
e
i
t
=
-
d
^
i
e
i
t
+
∑
j
=
1
m
a
^
j
i
F
j
e
j
t
+
∑
j
=
1
m
b
^
j
i
F
j
e
j
t
-
τ
t
+
∑
j
=
1
m
c
^
j
i
∫
t
-
μ
t
t
F
j
e
j
s
d
s
+
d
ˇ
i
-
d
^
i
x
^
i
t
+
∑
j
=
1
m
a
^
j
i
-
a
ˇ
j
i
f
j
y
^
j
t
+
∑
j
=
1
m
b
^
j
i
-
b
ˇ
j
i
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
m
c
^
j
i
-
c
ˇ
j
i
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
K
i
e
i
t
-
d
1
t
-
λ
i
s
i
g
n
e
i
t
d
t
+
∑
j
=
1
m
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
d
ω
j
t
.
Similarly, evaluatingV
˙
x
(
t
) along the trajectories of (60), we get V
˙
y
(
t
) and V
˙
(
t
).(61)
V
˙
t
=
V
˙
x
t
+
V
˙
y
t
≤
∑
i
=
1
n
e
i
2
t
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
+
∑
j
=
1
m
e
j
2
t
-
p
ˇ
j
+
1
2
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
ˇ
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
+
∑
i
=
1
n
e
i
t
d
ˇ
i
-
d
^
i
T
i
+
∑
j
=
1
m
a
^
j
i
-
a
ˇ
j
i
L
y
R
j
+
∑
j
=
1
m
c
^
j
i
-
c
ˇ
j
i
μ
L
y
R
j
+
∑
j
=
1
m
b
^
j
i
-
b
ˇ
j
i
Γ
j
-
λ
i
+
∑
j
=
1
m
e
j
t
p
ˇ
j
-
p
^
j
R
j
+
∑
i
=
1
n
m
^
i
j
-
m
ˇ
i
j
L
x
T
i
+
∑
i
=
1
n
n
^
i
j
-
n
ˇ
i
j
Δ
i
+
∑
i
=
1
n
q
^
i
j
-
q
ˇ
i
j
L
x
T
i
ε
-
λ
j
≤
0
.
According to the definitions ofK
i
2, K
j
2, λ
i, and λ
j, we obtain the following estimation V
˙
(
t
)
≤
0. So we get (62)
-
d
^
i
+
1
2
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
b
^
j
i
2
L
y
2
+
1
2
∑
j
=
1
m
c
^
j
i
2
+
1
2
K
i
2
+
1
2
1
-
d
1
′
+
1
2
J
1
+
m
2
ε
L
x
2
+
1
+
J
2
2
1
-
σ
1
≤
0
,
-
p
ˇ
j
+
1
2
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
n
^
i
j
2
L
x
2
+
1
2
∑
i
=
1
n
q
ˇ
i
j
2
+
1
2
K
j
2
+
1
2
1
-
d
2
′
+
1
2
H
1
+
n
2
μ
L
y
2
+
1
+
H
2
2
1
-
τ
1
≤
0
,
d
ˇ
i
-
d
^
i
T
i
+
∑
j
=
1
m
a
^
j
i
-
a
ˇ
j
i
L
y
R
j
-
λ
i
+
∑
j
=
1
m
c
^
j
i
-
c
ˇ
j
i
μ
L
y
R
j
+
∑
j
=
1
m
b
^
j
i
-
b
ˇ
j
i
Γ
j
≤
0
,
p
ˇ
j
-
p
^
j
R
j
+
∑
i
=
1
n
m
^
i
j
-
m
ˇ
i
j
L
x
T
i
-
λ
j
+
∑
i
=
1
n
q
^
i
j
-
q
ˇ
i
j
L
x
T
i
ε
+
∑
i
=
1
n
n
^
i
j
-
n
ˇ
i
j
Δ
i
≤
0
.
The proof of Theorem11 is completed.Remark 12.
In some previous studies [23–27, 44] the authors treated the self-inhibition d
i
(
x
i
(
t
)
)
=
1 or d
i
(
x
i
(
t
)
)
=
d
i
>
0. It should be mentioned that the above researches cannot refer to the case that the self-inhibition switches at two states. Because the discontinuous self-inhibition can make the system illustrate the complicated nonlinear dynamic behaviors, thus we considered the self-inhibitions d
i
(
x
i
(
t
)
) and p
j
(
y
j
(
t
)
) as the state switching parameters.Corollary 13.
If Assumption7 holds, systems (31) and (32) without perturbations are asymptotically stable when the following conditions are satisfied:(63)
K
i
2
≤
min
⁡
Ξ
1
,
Ξ
2
,
K
j
2
≤
min
⁡
Π
1
,
Π
2
,
λ
i
>
∑
i
=
1
n
d
i
ˇ
-
d
^
i
T
i
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
L
y
R
j
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
Γ
j
+
∑
j
=
1
m
c
ˇ
j
i
-
c
j
i
μ
L
y
R
j
,
λ
j
>
∑
i
=
1
n
p
j
ˇ
-
p
^
j
R
j
+
∑
i
=
1
n
m
ˇ
i
j
-
m
^
i
j
L
x
T
i
+
∑
i
=
1
n
n
ˇ
i
j
-
n
^
i
j
Δ
i
+
∑
i
=
1
n
q
ˇ
i
j
-
q
^
i
j
ε
L
x
L
i
,where(64)
L
x
=
max
⁡
α
i
,
β
i
,
L
y
=
max
⁡
α
j
,
β
j
,
Ξ
1
=
2
d
i
ˇ
-
∑
j
=
1
m
a
ˇ
j
i
2
L
y
2
+
b
ˇ
j
i
2
L
y
2
+
c
ˇ
j
i
2
-
1
1
-
d
1
′
-
m
ε
L
x
2
-
1
1
-
σ
1
,
Ξ
2
=
2
d
i
^
-
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
b
^
j
i
2
L
y
2
+
c
^
j
i
2
-
1
1
-
d
1
′
-
m
ε
L
x
2
-
1
1
-
σ
1
,
Π
1
=
2
p
j
ˇ
-
∑
i
=
1
n
m
ˇ
i
j
2
L
x
2
+
n
ˇ
i
j
2
L
x
2
+
q
ˇ
i
j
2
-
1
1
-
d
2
′
-
n
μ
L
y
2
-
1
1
-
τ
1
,
Π
2
=
2
p
j
^
-
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
n
^
i
j
2
L
x
2
+
q
^
i
j
2
-
1
1
-
d
2
′
-
n
μ
L
y
2
-
1
1
-
τ
1
.Proof.
​The proof process is similar to Theorem11. So the proof is omitted.Remark 14.
Usually, we observe that the actual communication between subsystems of MBAMNNs is inevitably disturbed by the time-varying leakage delays from various uncertainties. Thus, we considered the time-varying delays in the leakage term, and then we get the asymptotic synchronization criterion for the drive and response systems.
Under Assumption9, the drive system of MBAMNNs with mixed time-varying delays can be described by(65)
d
x
i
t
=
-
d
i
x
i
t
x
i
t
-
δ
t
+
∑
j
=
1
m
a
j
i
x
i
t
f
j
y
j
t
+
I
i
t
+
∑
j
=
1
m
b
j
i
x
i
t
-
τ
t
f
j
y
j
t
-
τ
t
+
∑
j
=
1
m
c
j
i
x
i
t
∫
t
-
μ
t
t
f
j
y
j
s
d
s
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
j
t
,
y
j
t
-
τ
t
d
ω
j
t
,
d
y
j
t
=
-
p
j
y
j
t
y
j
t
-
ζ
t
+
∑
i
=
1
n
m
i
j
y
j
t
g
i
x
i
t
+
I
j
t
+
∑
i
=
1
n
n
i
j
y
j
t
-
σ
t
g
i
x
i
t
-
σ
t
+
∑
i
=
1
n
q
i
j
y
j
t
∫
t
-
ε
t
t
g
i
x
i
s
d
s
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
i
t
,
x
i
t
-
σ
t
d
ω
i
t
.
And the corresponding response system can be defined as(66)
d
x
^
i
t
=
-
d
i
x
^
i
t
x
^
i
t
-
δ
t
+
∑
j
=
1
m
a
j
i
x
^
i
t
f
j
y
^
j
t
+
I
i
t
+
U
i
t
+
∑
j
=
1
m
b
j
i
x
^
i
t
-
τ
t
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
m
c
j
i
x
^
i
t
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
d
t
+
∑
j
=
1
m
β
j
i
t
,
y
^
j
t
,
y
^
j
t
-
τ
t
d
ω
j
t
,
d
y
^
j
t
=
-
p
j
y
^
j
t
y
^
j
t
-
ζ
t
+
∑
i
=
1
n
m
i
j
y
^
j
t
g
i
x
^
i
t
+
I
j
t
+
U
j
t
+
∑
i
=
1
n
n
i
j
y
^
j
t
-
σ
t
g
i
x
^
i
t
-
σ
t
+
∑
i
=
1
n
q
i
j
y
^
j
t
∫
t
-
ε
t
t
g
i
x
^
i
s
d
s
d
t
+
∑
i
=
1
n
β
i
j
t
,
x
^
i
t
,
x
^
i
t
-
σ
t
d
ω
i
t
.Corollary 15.
Suppose Assumption7 is satisfied, then systems (65) and (66) globally achieve synchronization under designed sampled-data feedback controller (7) with the control law as follows:(67)
K
i
2
≤
min
⁡
Ξ
1
,
Ξ
2
,
K
j
2
≤
min
⁡
Π
1
,
Π
2
,
λ
i
>
∑
i
=
1
n
d
i
ˇ
-
d
^
i
T
i
+
∑
j
=
1
m
a
ˇ
j
i
-
a
^
j
i
L
y
R
j
+
∑
j
=
1
m
b
ˇ
j
i
-
b
^
j
i
Γ
j
+
∑
j
=
1
m
c
ˇ
j
i
-
c
j
i
μ
L
y
R
j
,
λ
j
>
∑
i
=
1
n
p
j
ˇ
-
p
^
j
R
j
+
∑
i
=
1
n
m
ˇ
i
j
-
m
^
i
j
L
x
T
i
+
∑
i
=
1
n
n
ˇ
i
j
-
n
^
i
j
Δ
i
+
∑
i
=
1
n
q
ˇ
i
j
-
q
^
i
j
ε
L
x
L
i
,where (68)
L
x
=
max
⁡
α
i
,
β
i
,
L
y
=
max
⁡
α
j
,
β
j
,
Ξ
1
=
d
i
ˇ
-
∑
j
=
1
m
a
ˇ
j
i
2
L
y
2
+
b
ˇ
j
i
2
L
y
2
+
c
ˇ
j
i
2
-
1
1
-
d
1
′
-
m
ε
L
x
2
-
1
1
-
σ
1
,
Ξ
2
=
d
i
^
-
∑
j
=
1
m
a
^
j
i
2
L
y
2
+
b
^
j
i
2
L
y
2
+
c
^
j
i
2
-
1
1
-
d
1
′
-
m
ε
L
x
2
-
1
1
-
σ
1
,
Π
1
=
p
j
ˇ
-
∑
i
=
1
n
m
ˇ
i
j
2
L
x
2
+
n
ˇ
i
j
2
L
x
2
+
q
ˇ
i
j
2
-
1
1
-
d
2
′
-
n
μ
L
y
2
-
1
1
-
τ
1
,
Π
2
=
p
j
^
-
∑
i
=
1
n
m
^
i
j
2
L
x
2
+
n
^
i
j
2
L
x
2
+
q
^
i
j
2
-
1
1
-
d
2
′
-
n
μ
L
y
2
-
1
1
-
τ
1
.Proof.
The proof process is similar to Theorem11. So the proof is omitted.Remark 16.
Some existing researches show the criterion for systems with differentiable delays, bounded in the in the leakage term. However, when the time-varying delaysδ
(
t
) and ζ
(
t
) are not differentiable or their derivatives are unknown or no bounded, the criterion cannot be applicable any more. Under these circumstances, the conclusion we obtained is more valid and effective than the exciting results.Corollary 17.
Assume that Assumption7 is satisfied; then systems (65) and (66) with constant delays in the leakage term (
δ
(
t
)
=
δ
,
ζ
(
t
)
=
ζ
) will achieve asymptotic synchronization under the same criteria.Remark 18.
There is no extra restraint on activation functions demanding that they are bounded and the time-varying delays are mixed. Furthermore, overall consideration of our obtained results with sampled-data control schemes is shown, which can be expected to have a powerful potential application in areas like associative memory, image encryption, digital processing, and so on.


## 4. Numerical Simulation

In this section, numerical examples are presented to demonstrate the results for plausibility and validity. Based on the following parameters, consider two-dimensional MBAMNNs with mixed time-varying delays and stochastic perturbations as follows:(69)
d
x
i
t
=
-
d
i
x
i
t
x
i
t
+
∑
j
=
1
2
a
j
i
x
i
t
f
j
y
j
t
+
I
i
t
+
∑
j
=
1
2
b
j
i
x
i
t
-
τ
t
f
j
y
j
t
-
τ
t
+
∑
j
=
1
2
c
j
i
x
i
t
∫
t
-
μ
t
t
f
j
y
j
s
d
s
d
t
+
∑
j
=
1
2
β
j
i
t
,
y
j
t
,
y
j
t
-
τ
t
d
ω
j
t
,
d
y
j
t
=
-
p
j
y
j
t
y
j
t
+
∑
i
=
1
2
m
i
j
y
j
t
g
i
x
i
t
+
I
j
t
+
∑
i
=
1
2
n
i
j
y
j
t
-
σ
t
g
i
x
i
t
-
σ
t
+
∑
i
=
1
2
q
i
j
y
j
t
∫
t
-
ε
t
t
g
i
x
i
s
d
s
d
t
+
∑
i
=
1
2
β
i
j
t
,
x
i
t
,
x
i
t
-
σ
t
d
ω
i
t
,and the corresponding response system can be defined as(70)
d
x
^
i
t
=
-
d
i
x
^
i
t
x
^
i
t
+
∑
j
=
1
2
a
j
i
x
^
i
t
f
j
y
^
j
t
+
∑
j
=
1
2
b
j
i
x
^
i
t
-
τ
t
f
j
y
^
j
t
-
τ
t
+
∑
j
=
1
2
c
j
i
x
^
i
t
∫
t
-
μ
t
t
f
j
y
^
j
s
d
s
+
I
i
t
+
K
i
e
i
t
-
d
1
t
-
λ
i
s
i
g
n
e
i
t
d
t
+
∑
j
=
1
2
β
j
i
t
,
y
^
j
t
,
y
^
j
t
-
τ
t
d
ω
j
t
,
d
y
^
j
t
=
-
p
j
y
^
j
t
y
^
j
t
+
∑
i
=
1
2
m
i
j
y
^
j
t
g
i
x
^
i
t
+
∑
i
=
1
2
n
i
j
y
^
j
t
-
σ
t
g
i
x
^
i
t
-
σ
t
+
∑
i
=
1
2
q
i
j
y
^
j
t
∫
t
-
ε
t
t
g
i
x
^
i
s
d
s
+
I
j
t
+
K
j
e
j
t
-
d
2
t
-
λ
j
s
i
g
n
e
j
t
d
t
+
∑
i
=
1
2
β
i
j
t
,
x
^
i
t
,
x
^
i
t
-
σ
t
d
ω
i
t
,where(71)
d
1
x
1
t
=
-
1.1
,
x
1
t
≤
1
,
-
1.2
,
x
1
t
>
1
,
a
11
x
1
t
=
1.3
,
x
1
t
≤
1
,
1.4
,
x
1
t
>
1
,
c
21
x
1
t
=
0.18
,
x
1
t
≤
1
,
-
0.13
,
x
1
t
>
1
,
d
2
x
2
t
=
-
1
,
x
2
t
≤
1
,
-
1.1
,
x
2
t
>
1
,
p
1
y
1
t
=
-
1.2
,
y
1
t
≤
2
,
-
1.1
,
y
1
t
>
2
,
m
11
y
1
t
=
1.4
,
y
1
t
≤
2
,
1.33
,
y
1
t
>
2
,
q
21
y
1
t
=
0.17
,
y
1
t
≤
2
,
-
0.16
,
y
1
t
>
2
,
p
2
y
2
t
=
-
0.9
,
y
2
t
≤
2
,
-
1.3
,
y
2
t
>
2
,
a
12
x
2
t
=
1.8
,
x
2
t
≤
1
,
1.9
,
x
2
t
>
1
,
a
22
x
2
t
=
0.48
,
x
1
t
≤
1
,
1.51
,
x
1
t
>
1
,
m
12
y
2
t
=
1.75
,
y
2
t
≤
2
,
1.79
,
y
2
t
>
2
,
m
22
y
2
t
=
0.51
,
y
2
t
≤
2
,
1.48
,
y
2
t
>
2
,
c
12
x
2
t
=
0.21
,
x
2
t
≤
1
,
0.32
,
x
2
t
>
1
,
c
22
x
2
t
=
-
0.32
,
x
2
t
≤
1
,
-
0.43
,
x
2
t
>
1
,
m
21
y
1
t
=
6.83
,
y
1
t
≤
2
,
4.96
,
y
1
t
>
2
,
q
11
y
1
t
=
-
0.48
,
y
1
t
≤
2
,
-
0.24
,
y
1
t
>
2
,
a
21
x
1
t
=
7.2
,
x
1
t
≤
1
,
5.1
,
x
1
t
>
1
,
c
11
x
1
t
=
0.56
,
x
1
t
≤
1
,
-
0.4
,
x
1
t
>
1
,
q
12
y
2
t
=
0.49
,
y
2
t
≤
2
,
0.42
,
y
2
t
>
2
,
q
22
y
2
t
=
-
0.31
,
y
2
t
≤
2
,
-
0.42
,
y
2
t
>
2
.
b
12
x
2
t
-
τ
t
=
0.76
,
x
2
t
-
τ
t
≤
1
,
0.98
,
x
2
t
-
τ
t
>
1
,
b
22
x
2
t
-
τ
t
=
-
1.32
,
x
2
t
-
τ
t
≤
1
,
-
1.43
,
x
2
t
-
τ
t
>
1
,
n
11
y
1
t
-
σ
t
=
-
1.51
,
y
1
t
-
σ
t
≤
2
,
-
1.20
,
y
1
t
-
σ
t
>
2
,
n
21
y
1
t
-
σ
t
=
0.81
,
y
1
t
-
σ
t
≤
2
,
0.9
,
y
1
t
-
σ
t
>
2
,
b
11
x
1
t
-
τ
t
=
-
1.48
,
x
1
t
-
τ
t
≤
1
,
-
1.19
,
x
1
t
-
τ
t
>
1
,
b
21
x
1
t
-
τ
t
=
0.88
,
x
1
t
-
τ
t
≤
1
,
0.75
,
x
1
t
-
τ
t
>
1
,
n
12
y
2
t
-
σ
t
=
0.83
,
y
2
t
-
σ
t
≤
2
,
0.99
,
y
2
t
-
σ
t
>
2
,
n
22
y
2
t
-
σ
t
=
-
1.42
,
y
2
t
-
σ
t
≤
2
,
-
1.52
,
y
2
t
-
σ
t
>
2
.Taking the activation function asf
1
(
·
)
=
g
1
(
·
)
=
sin
⁡
· and f
2
(
·
)
=
g
2
(
·
)
=
tanh
⁡
·, we have τ
(
t
)
=
σ
(
t
)
=
0.4
-
0.1
sin
⁡
t, μ
(
t
)
=
ε
(
t
)
=
0.5
+
0.5
cos
⁡
t, δ
(
t
)
=
ζ
(
t
)
=
0.15
t. The sampling period is taken as d
1
(
t
)
=
d
2
(
t
)
=
0.1
sin
⁡
t.We choose the initial values of the state variables asx
1
t
,
x
2
t
=
[
-
0.15
,
-
0.35
], [
x
^
1
(
t
)
,
x
^
2
(
t
)
]
=
-
1.15
,
-
1.35, [
y
1
(
t
)
,
y
2
(
t
)
]
=
0.55,0.75, and [
y
^
1
(
t
)
,
y
^
2
(
t
)
]
=
[
1.55,1.75
]. We also define the external input [
I
i
(
t
)
,
I
j
(
t
)
]
T
=
[
0,0
]
T.We makeL
x
=
L
y
=
0.001, J
1
=
J
2
=
H
1
=
H
2
=
0.00001; thus according to the Theorem 11, we calculate K
i
=
-
0.2, K
j
=
-
1, λ
i
=
λ
j
=
-
0.2.The Brownian motion satisfiesE
ω
(
t
)
=
0, D
ω
(
t
)
=
1.(72)
β
j
i
t
,
e
j
t
,
e
j
t
-
τ
t
=
d
i
a
g
0.4
e
j
t
+
0.3
e
j
t
-
τ
t
,
-
0.5
e
j
t
+
0.2
e
j
t
-
τ
t
,
β
i
j
t
,
e
i
t
,
e
i
t
-
σ
t
=
d
i
a
g
0.4
e
i
t
+
0.3
e
i
t
-
σ
t
,
-
0.5
e
i
t
+
0.2
e
i
t
-
σ
t
.The dynamic behaviors of drive-response systems are given in Figure2, and the following simulations are conducted on the basis of this situation. In order to verify Theorem 11, we take systems (69) and (70) as example. Figure 3 shows the state trajectories of such systems without control; then it illustrates the synchronization errors correlation between the drive-response systems without and under control. From the above illustration, we conclude that systems (69) and (70) will achieve globally asymptotic synchronization with the help of the proposed controller (14).Figure 2
(a) Phase trajectories of thex-layer of system (3). (b) Phase trajectories of the y-layer of system (3).
(a)
(b)Figure 3
(a) and (b) show the time response curves of drive-response systems (69) and (70); (c) and (d) show the curves of error systems without or with delay-dependent controller (14), respectively.
(a)
(b)
(c)
(d)Based on Theorem11, we indicate the considered systems without perturbations. Under these circumstances, define the errors as d
e
i
(
t
)
=
d
x
^
i
(
t
)
-
d
x
i
(
t
) and d
e
j
(
t
)
=
d
y
^
j
(
t
)
-
d
y
j
(
t
); the error states without control and under control are depicted in Figure 4. The comparison between (a) and (b) provides the clearest significant role of the controller played in the synchronization control.Figure 4
(a) The synchronization error of drive-response systems (69) and (70) without perturbations and control; (b) the synchronization error of drive-response systems (69) and (70) without perturbations but under control.
(a)
(b)According to Corollary15, for given time-varying delays δ
(
t
) and ζ
(
t
), systems (65) and (66) are globally asymptotically synchronized under controller (14). In this simulation, we take δ
(
t
)
=
ζ
(
t
)
=
0.15
t, and Figure 5 depicts the trajectories of error states. In order to testify Corollary 17, we make δ
=
ζ
=
0.15 in the leakage terms; Figure 6 illustrates the error states of the proposed systems. From the comparison results we conclude the sampled-data control inputs which contribute to the effective chaos synchronization.Figure 5
(a) The synchronization error of drive-response systems (65) and (66) without control; (b) the synchronization error of drive-response systems (65) and (66) under control.
(a)
(b)Figure 6
(a) The synchronization error of drive-response systems (65) and (66) with constant leakage delays but without control; (b) the synchronization error of drive-response systems (65) and (66) with constant leakage delays and control.
(a)
(b)Based on the model of Corollary15, we choose the different sampling periods to verify the relationship between sampling period and the convergence time of error systems. We set d
1
(
t
)
=
d
2
(
t
)
=
0.001
sin
⁡
t, d
1
(
t
)
=
d
2
(
t
)
=
0.01
sin
⁡
t, d
1
(
t
)
=
d
2
(
t
)
=
0.1
sin
⁡
t, d
1
(
t
)
=
d
2
(
t
)
=
1
sin
⁡
t, d
1
(
t
)
=
d
2
(
t
)
=
10
sin
⁡
t, d
1
(
t
)
=
d
2
(
t
)
=
100
sin
⁡
t, respectively. Figure 7 depicts the different error convergence corresponding to the different sampling period. Table 1 gives the specific convergence times corresponding to the different sampling periods. We find that the larger the sampling period we take, the worse the effect on the error convergence.Table 1
The relationship between convergence time and sampling period.
Sampling period
d
=
0.001
d
=
0.01
d
=
0.1
d
=
1
d
=
10
d
=
100
Convergence time
1.616
1.566
1.515
3.030
10.510
UnstableFigure 7
(a) The synchronization error of sampled periodd
1
(
t
)
=
d
2
(
t
)
=
0.001
sin
⁡
t; (b) d
1
(
t
)
=
d
2
(
t
)
=
0.01
sin
⁡
t; (c) d
1
(
t
)
=
d
2
(
t
)
=
0.1
sin
⁡
t; (d) d
1
(
t
)
=
d
2
(
t
)
=
1
sin
⁡
t; (e) d
1
(
t
)
=
d
2
(
t
)
=
10
sin
⁡
t; (f) d
1
(
t
)
=
d
2
(
t
)
=
100
sin
⁡
t.
(a)
(b)
(c)
(d)
(e)
(f)The error system becomes unstable when we choose sampling periodd
1
=
d
2
=
100. Under these circumstances, it means the sampled-data controller with the feedback gains K
i and K
j is not enough to guarantee the stability of the error systems. For comparing and analyzing the influence of the sampling period relationship, we make the state feedback controller with the same feedback gains. Figure 7 depicts the trajectories of error states. From Figure 8 we detect that the error system becomes stable at 11.921. So we conclude that when we take the sampled-data controller, the effect on error convergence is not only relevant to the feedback gains but also related to the sampling period. Table 1 illustrates that the best sampling period for our simulations is d
1
(
t
)
=
d
2
(
t
)
=
0.01
sin
⁡
t.Figure 8
The synchronization error of drive-response systems (69) and (70) without perturbations but under normal feedback controller.Remark 19.
Comparing with the exciting researches on MBAMNNs, we investigate the relationship between the sampling period and convergence time. It can be found that even the longer sampling period will cause the lower communication channel occupation, less packet transmission, and little actuation of the controller; it also sacrifices the accuracy of controller at the same time. Thus the suitable sampling period has important significance to the stable of error systems. So our conclusion is greatly helpful to some potential future research topics including synchronization or stability on sampled-data synchronization strategy to NNs.


## 5. Conclusion

In this paper, a synchronization problem has been investigated for MBAMNNs with stochastic perturbations and mixed time-varying delays. The dynamics of the synaptic weights between the drive and response systems were considered and analyzed rather than treating them as consonants. Firstly, both various mixed time-varying delays and stochastic perturbations are considered in this paper, which include no-delay, finite distributed time-varying delays, discrete time-varying delays, and leakage time-varying delays. Secondly, we have proposed a sampled-data synchronization strategy for each node of the MBAMNNs. By utilizing the sign function and the definition of asymptotic stability, a suitable nonlinear state feedback sampled-data controller is designed. In addition, we verify the sampling period effect on the convergence of error system according to simulations. By utilizing the Lyapunov functional method, stochastic analysis theory, and inequality techniques, some sufficient conditions are derived to guarantee synchronization of the MBAMNNs model. Simulation examples have been presented to validate the theoretical results.



---

*Source: 9126183-2018-04-30.xml*