# New Results on Passivity Analysis of Stochastic Neural Networks with Time-Varying Delay and Leakage Delay

Authors: YaJun Li; Zhaowen Huang
Journal: Computational Intelligence and Neuroscience
 (2015)

---

## Abstract

The passivity problem for a class of stochastic neural networks systems (SNNs) with varying delay and leakage delay has been further studied in this paper. By constructing a more effective Lyapunov functional, employing the free-weighting matrix approach, and combining with integral inequality technic and stochastic analysis theory, the delay-dependent conditions have been proposed such that SNNs are asymptotically stable with guaranteed performance. The time-varying delay is divided into several subintervals and two adjustable parameters are introduced; more information about time delay is utilised and less conservative results have been obtained. Examples are provided to illustrate the less conservatism of the proposed method and simulations are given to show the impact of leakage delay on stability of SNNs.


---

## Body

## 1. Introduction

During the past several decades, neural networks have gained great attention because of their potential application in pattern classification, reconstruction of moving image, and combinatorial optimization. In addition, time delay is a natural phenomenon frequently encountered in various dynamic systems such as electronic, chemical systems, long transmission lines in pneumatic systems, biological systems, and economic and rolling mill systems. Delays in neural networks can cause oscillation, instability, and divergence, which are very often the main sources of poor performance of designed neural networks. So the stability analysis and state estimation of neural networks with various time delays have been widely investigated by many researchers; see [1–8] and the references therein.Furthermore, when modeling real nervous systems, stochastic disturbance is one of main resources of the performance degradations when applying the neural networks, because the synaptic transmission is a noisy process introduced by random fluctuation from the release of neurotransmitter and other probabilistic causes. In recent years, the stability analysis for stochastic neural networks with time delay has become a hot research topic; by virtue of various inequality technics andM-matrix theory, many important research results about neural networks with different type of time delays, such as constant delay, time-varying delay, or distributed delay, have been reported; see, for example, [8–14] and the references therein.The passivity theory, which originated from circuit theory, plays an important role in the analysis of stability of linear or nonlinear systems. The main character of passivity theory is that the passive properties of a system can keep the system internally stable. Because it is a very effective tool in studying the stability of uncertain or nonlinear systems, the passivity theory has been used widely in fuzzy control [15], complexity [16], synchronization [17], signal processing [18], and adaptive control [19].Recently, based on the Lyapunov-Krasovskii theory, passivity and dissipativity analysis of neural networks with various delays and uncertainties have been discussed and many interesting results have been reported [20–28].In [29–35], based on the Lyapunov-Krasovskii, LMI method, and a delay fractioning technique, the passivity and robust passivity of stochastic neural networks with delays and uncertainties have been studied; some sufficient conditions on the passivity of neural networks with delays have been obtained. In [31], authors investigated passivity of the stochastic neural networks with time-varying delays and parameters uncertainties by applying free-weighting matrix and the lower conservatism results are obtained by comparing with the existing results.On the other hand, in many practical problems, a typical time delay called leakage delay or forgetting delay exists in dynamical system, which has a tendency to destabilize the system; it has been one of the research hot topics recently and many research achievements have been reported [20, 36–42].As pointed out in [36], neural networks with leakage delay are a class of important neural networks, and time delay in the leakage term also has great impact on the dynamics of neural networks; sometimes it has more significant effect than other kinds of delays on dynamics of neural networks; the stability analysis of neural networks system involving leakage delay has been researched extensively; see, for example, [37–40] and the references therein. Very recently, in [42], by virtue of free weight matrix and LMIs method, the passivity problem for a class of stochastic neural networks with leakage delay is studied; the sufficient condition making the system passive is presented, but leakage delay under consideration is a constant; but, in practical dynamical systems, the leakage delay can be time-varying, which is often more general and complex than leakage delay being a constant. To the best of authors’ knowledge, no research results have been reported about the condition that leakage delay is time-varying, which motivates our idea.Motivated by the aforementioned discussions, this paper focuses on the passivity problem for a class of stochastic neural networks (SNNs) system with time-varying delay and leakage delay; by constructing a new Lyapunov functional, a set of sufficient conditions are derived to ensure the passivity performance for a class of stochastic neural networks with time-varying delays and leakage delay. By virtue of the delay decomposition idea [8], combining with some integral inequality technic [7], or free-weighting matrix approach [9, 26], two adjustable parameters are introduced and made full use of. All results are established in the form of LMIs and can be solved easily by using the interior algorithms, which can be efficiently solved by Matlab LMI Toolbox and no tuning of parameters is required. Finally, numerical examples are given to demonstrate the effectiveness and less conservatism of the proposed approach.The main contributions of this paper are summarized as follows:(i)
The leakage delay studied is time-varying, so the research model is more general and complex than that in [42].
(ii)
The neuron activation function is assumed to satisfy sector-bounded condition, which is more general and less restrictive than Lipschitz condition, so the less conservatism results can be expected.
(iii)
The derivative of time-varying can be extended to be more than 1.
(iv)
How the leakage delay affects the stability result is discussed.Notation. Throughout this paper, if not explicit, matrices are assumed to have compatible dimensions. The notation M
>
(
≥
,
<
,
≤
)
0 means that the symmetric matrix M is positive-definite (positive-semidefinite, negative, and negative-semidefinite). λ
m
i
n
(
·
) and λ
m
a
x
(
·
) denote the minimum and the maximum eigenvalue of the corresponding matrix; the superscript “T” stands for the transpose of a matrix; the shorthand d
i
a
g
{
⋯
} denotes the block diagonal matrix; · represents the Euclidean norm for vector or the spectral norm of matrices. I refers to an identity matrix of appropriate dimensions. E
· stands for the mathematical expectation; ∗ means the symmetric terms. Sometimes, the arguments of a function will be omitted in the analysis when no confusion can arise.


## 2. System Description

Consider the SNNs with time-varying delay as follows:(1)
d
x
t
=
-
A
x
t
-
δ
t
+
W
0
f
x
t
+
W
1
f
x
t
-
τ
t
+
u
t
d
t
+
σ
x
t
,
x
t
-
τ
t
,
u
t
d
ω
t
,
y
t
=
f
x
t
,where x
(
t
)
=
[
x
1
(
t
)
,
x
2
(
t
)
,
…
,
x
n
(
t
)
]
T
∈
R
n is the neural state vector and u
(
t
)
=
[
u
1
(
t
)
,
u
2
(
t
)
,
…
,
u
n
(
t
)
]
T is the input. y
(
t
)
=
[
y
1
(
t
)
,
y
2
(
t
)
,
…
,
y
n
(
t
)
]
T
∈
R
n is the output; W
0
,
W
1
∈
R
n are the connection weight matrix and the delayed connection weight matrix, respectively; A
=
diag
⁡
(
a
1
,
a
2
,
…
,
a
n
) is a positive diagonal matrix; f
(
x
(
t
)
)
=
[
f
1
(
x
(
t
)
)
,
f
2
(
x
(
t
)
)
,
…
,
f
n
(
x
(
t
)
)
]
T
∈
R
n is the neuron activation function with f
(
0
)
=
0; n denotes the number of neurons in neural networks; ω
(
t
)
=
[
ω
1
(
t
)
,
ω
2
(
t
)
,
…
,
ω
m
(
t
)
]
T
∈
R
m is an m-dimension Brownian motion defined on a complete probability space (Ω
,
F
,
P), satisfying(2)
E
d
ω
t
=
0
,
E
d
ω
2
t
=
d
t
.
τ
(
t
) is the transmission delay and is assumed to satisfy(3)
0
≤
τ
t
≤
τ
,
-
μ
≤
τ
˙
t
≤
μ
.
δ
(
t
) is the leakage delay that satisfies(4)
δ
t
≤
δ
,
δ
˙
t
≤
ρ
δ
,where τ
,
μ
,
δ
,
ρ
δ are some positive scalar constants.Assumption 1.
Fori
∈
{
1,2
,
…
,
n
} and ∀
x
,
y
∈
R, x
≠
y, the neuron activation function f
(
·
) is continuous and bounded and satisfies(5)
f
x
-
f
y
-
Λ
1
x
-
y
T
·
f
x
-
f
y
-
Λ
2
x
-
y
<
0
,where Λ
1 and Λ
2 are some constant known matrices.Remark 2.
In this paper, the above assumption is made on neuron activation function, which is called sector-bounded neuron activation function. WhenΛ
1
=
Λ
2
=
-
Λ, condition (5) becomes(6)
f
x
-
f
y
T
f
x
-
f
y
≤
x
-
y
T
Λ
T
Λ
x
-
y
.So it is less restrictive than the descriptions on both the sigmoid activation functions and the Lipschitz-type activation functions.Assumption 3.
There exist three constant matricesΣ
1, Σ
2, and Σ
3 such that(7)
σ
x
t
,
x
t
-
τ
t
,
u
t
2
≤
Σ
1
x
t
2
+
Σ
2
x
t
-
τ
t
2
+
Σ
3
u
t
2
.Definition 4 (see [22]).
The delayed SNNs are said to stochastically passive if there exists a scalarγ
≥
0 such that(8)
2
E
∫
0
t
y
T
s
u
s
d
s
≥
-
γ
E
∫
0
t
u
T
s
u
s
d
sfor all t
≥
0 and for all solution of (1) with x
(
0
)
=
0.Remark 5.
The different output equation can lead to different definitions. In [31, 42], the output equation expression is y
(
t
)
=
f
(
x
(
t
)
) and y
(
t
)
=
G
f
(
x
(
t
)
), respectively. In order to compare our result with that in [42], we take G
=
I, so we have the same definition as that in [42].At first, we give the following lemmas which will be used frequently in the proof of the our main results.Lemma 6 (see [4]).
For any constant symmetric positive defined matrixJ
∈
R
m
×
m, scalar η, and the vector function ν
:
[
0
,
η
]
→
R
m, the following inequality holds:(9)
η
∫
0
η
ν
T
s
J
ν
s
d
s
≥
∫
0
η
ν
s
d
s
T
J
∫
0
η
ν
s
d
s
.Lemma 7 (see [5]).
For given proper dimensions constant matricesΦ
1
,
Φ
2, and Φ
3, where Φ
1
T
=
Φ
1 and Φ
2
T
=
Φ
2
>
0, we have Φ
1
+
Φ
3
T
Φ
2
-
1
Φ
3
<
0 such that only and only if (10)
Φ
1
Φ
3
T
∗
-
Φ
2
<
0
,
o
r
-
Φ
2
Φ
3
∗
Φ
1
<
0
.Lemma 8 (see [7]).
For given functionτ
(
t
) satisfying μ
1
≤
τ
˙
(
t
)
≤
μ
2, there exist nonnegative functions λ
1
(
t
)
≥
0 and λ
2
(
t
)
≥
0 satisfying λ
1
(
t
)
+
λ
2
(
t
)
=
1 such that the following equation holds:(11)
τ
˙
t
=
μ
1
λ
1
t
+
μ
2
λ
2
t
.Lemma 9 (see [7]).
For any real vectors a and b and any matrixQ
>
0 with appropriate dimensions, it follows that ±
2
a
T
b
≤
a
T
Q
a
+
b
T
Q
-
1
b.


## 3. Main Results

In this section, a delay-dependent leakage delay method is developed to guarantee the stochastic passive results of system (1), so we have the following Theorem 10.Theorem 10.
Given scalarsτ
>
0, 0
<
α
<
1, 0
<
β
<
1, λ
>
0, ρ
σ
>
0, and 0
<
μ and proper matrix Σ
i
(
i
=
1,2
,
3
), the SNNs described by (1) are stochastically passive in the sense of Definition 4, if there exist positive matrices P
>
0, Q
>
0, Q
j
>
0
(
j
=
1,2
,
…
,
5
), and R
l
>
0
(
l
=
1,2
,
…
,
5
), positive diagonal matrices F
j
>
0
(
j
=
1,2
), positive constants ϵ
1, ϵ
2, γ
>
0, and real matrices M
¯, N
¯
,
U
¯
,
S
¯, and Z
¯ of appropriate dimensions such that the following LMIs hold:(12)
P
+
τ
R
4
≤
λ
I
,
(13)
Ψ
i
+
Ω
T
Q
-
1
Ω
M
¯
N
¯
∗
-
1
α
τ
R
4
0
∗
∗
-
1
1
-
α
τ
R
4
<
0
,
i
=
1,2
,
(14)
Ψ
i
+
Ω
T
Q
-
1
Ω
U
¯
S
¯
∗
-
1
β
τ
R
4
0
∗
∗
-
1
1
-
β
τ
R
4
<
0
,
i
=
1,2
,where (15)
Ψ
i
=
Ψ
m
×
n
15
×
15
,
Ψ
1,1
=
Q
1
+
R
1
+
δ
2
R
2
-
P
A
-
A
T
P
-
ϵ
1
F
1
+
λ
Σ
1
T
Σ
1
+
M
1
+
M
1
T
,
Ψ
1,2
=
-
Z
1
A
+
M
2
T
,
Ψ
1,3
=
-
M
1
+
M
3
T
+
N
1
,
Ψ
1,4
=
M
4
T
-
N
1
+
U
1
,
Ψ
1,5
=
M
5
T
-
U
1
+
S
1
,
Ψ
1,6
=
M
6
T
-
S
1
,
Ψ
1,7
=
A
T
P
A
+
M
7
T
,
Ψ
1,8
=
Z
1
W
0
+
P
W
0
+
ϵ
1
F
2
+
M
8
T
,
Ψ
1,9
=
Z
1
W
1
+
P
W
1
+
M
9
T
,
Ψ
1,10
=
-
Z
1
+
M
10
T
,
Ψ
1,11
=
Z
1
+
P
+
M
11
T
,
Ψ
1,12
=
M
1
T
-
M
12
,
Ψ
1,13
=
M
13
T
-
N
1
,
Ψ
1,14
=
M
14
T
-
U
1
,
Ψ
1,15
=
M
15
T
-
S
1
,
Ψ
2,2
=
Q
ρ
σ
-
1
-
ρ
σ
R
1
-
Z
2
A
,
Ψ
2,3
=
-
A
T
Z
3
T
-
M
2
+
N
2
,
Ψ
2,4
=
-
A
T
Z
4
T
-
N
2
+
U
2
,
Ψ
2,5
=
-
A
T
Z
5
T
-
U
2
+
S
2
,
Ψ
2,6
=
-
A
T
Z
6
T
-
S
2
,
Ψ
2,7
=
-
A
T
Z
7
T
+
A
T
P
A
ρ
σ
,
Ψ
2,8
=
-
A
T
Z
8
T
+
Z
2
W
0
,
Ψ
2,9
=
-
A
T
Z
9
T
+
Z
2
W
1
,
Ψ
2,10
=
-
A
T
Z
10
T
-
A
T
Z
3
T
,
Ψ
2,11
=
Z
2
-
A
T
Z
11
T
,
Ψ
2,12
=
-
A
T
Z
12
T
-
M
12
,
Ψ
2,13
=
-
A
T
Z
13
T
-
N
2
,
Ψ
2,14
=
-
A
T
Z
14
T
-
U
2
,
Ψ
2,15
=
-
A
T
Z
15
T
-
S
2
,
Ψ
3,3
=
1
-
α
τ
˙
t
Q
2
-
Q
1
-
M
3
-
M
3
T
+
N
3
+
N
3
T
,
Ψ
3,4
=
-
N
3
-
M
3
T
+
N
3
T
+
U
3
,
Ψ
3,5
=
-
M
5
T
+
N
5
T
-
U
3
+
S
3
,
Ψ
3,6
=
-
M
6
T
+
N
6
T
-
S
3
,
Ψ
3,7
=
-
M
7
T
+
N
6
T
,
Ψ
3,8
=
Z
3
W
0
-
M
8
T
+
N
8
T
,
Ψ
3,9
=
Z
3
W
1
-
M
9
T
+
N
9
T
,
Ψ
3,10
=
-
Z
3
-
M
10
T
+
N
10
T
,
Ψ
3,11
=
Z
3
-
M
11
T
+
N
11
T
,
Ψ
3,12
=
-
M
12
T
+
N
12
T
-
M
3
,
Ψ
3,13
=
-
N
3
-
M
13
T
+
N
13
T
,
Ψ
3,14
=
-
M
14
T
+
N
14
T
-
U
3
,
Ψ
3,15
=
-
M
15
T
+
N
15
T
-
S
3
,
Ψ
4,4
=
1
-
τ
˙
t
Q
3
-
Q
2
-
ϵ
2
F
1
+
λ
Σ
2
T
Σ
2
-
N
4
-
N
4
T
+
U
4
T
+
U
4
,
Ψ
4,5
=
-
N
5
T
+
U
5
T
-
U
4
+
S
4
,
Ψ
4,6
=
-
N
6
T
+
U
4
T
-
S
4
,
Ψ
4,7
=
-
N
7
T
+
U
7
T
,
Ψ
4,8
=
Z
4
W
0
-
N
8
T
+
U
8
T
,
Ψ
4,9
=
Z
4
W
1
-
N
9
T
-
ϵ
2
F
2
+
U
9
T
,
Ψ
4,10
=
-
Z
4
-
N
10
T
+
U
10
T
,
Ψ
4,11
=
Z
4
-
N
11
T
+
U
11
T
,
Ψ
4,12
=
-
N
12
T
-
M
4
+
U
12
T
,
Ψ
4,13
=
-
N
13
T
-
N
13
+
U
14
T
,
Ψ
4,14
=
-
N
14
T
+
U
14
T
-
U
4
,
Ψ
4,15
=
-
N
15
T
+
U
15
T
-
S
4
,
Ψ
5,5
=
1
-
1
-
β
τ
˙
t
Q
4
-
Q
3
-
U
5
-
U
5
T
+
S
5
+
S
5
T
,
Ψ
5,6
=
-
U
6
T
+
S
6
T
-
S
5
,
Ψ
5,7
=
-
U
7
T
+
S
7
T
,
Ψ
5,8
=
Z
5
W
0
-
U
8
T
+
S
8
T
,
Ψ
5,9
=
Z
5
W
1
-
U
9
T
+
S
9
T
,
Ψ
5,10
=
-
Z
5
-
U
10
T
+
S
10
T
,
Ψ
5,11
=
Z
5
-
U
11
T
+
S
11
T
,
Ψ
5,12
=
-
U
12
T
-
M
5
+
S
12
T
,
Ψ
5,13
=
-
U
13
T
+
S
13
T
-
N
5
,
Ψ
5,14
=
-
U
14
T
-
U
5
+
S
14
T
,
Ψ
5,15
=
-
U
15
T
+
S
15
T
-
S
5
,
Ψ
6,6
=
-
Q
4
-
S
6
-
S
6
T
,
Ψ
6,7
=
-
S
7
T
,
Ψ
6,8
=
Z
6
W
0
-
S
8
T
,
Ψ
6,9
=
Z
6
W
1
-
S
9
T
,
Ψ
6,10
=
-
S
10
T
-
Z
6
,
Ψ
6,11
=
-
S
11
T
Z
6
,
Ψ
6,12
=
-
M
6
-
S
12
T
,
Ψ
6,13
=
-
N
6
-
S
13
T
,
Ψ
6,14
=
-
U
14
-
S
14
T
,
Ψ
6,15
=
-
S
15
T
-
S
6
,
Ψ
7,7
=
-
R
2
,
Ψ
7,8
=
Z
7
W
0
-
A
T
P
W
0
,
Ψ
7,9
=
Z
7
W
1
-
A
T
P
W
1
,
Ψ
7,10
=
-
Z
7
,
Ψ
7,11
=
Z
7
-
A
T
P
,
Ψ
7,12
=
-
M
7
,
Ψ
7,13
=
-
N
7
,
Ψ
7,14
=
-
U
7
,
Ψ
7,15
=
-
S
7
,
Ψ
8,8
=
-
ϵ
1
I
+
Q
5
+
Z
8
W
0
+
W
0
T
Z
8
T
,
Ψ
8,9
=
W
0
T
Z
9
T
,
Ψ
8,10
=
W
0
T
Z
10
T
-
Z
8
T
,
Ψ
8,11
=
W
0
T
Z
11
T
-
I
+
Z
8
T
,
Ψ
8,12
=
W
0
T
Z
12
T
-
M
12
,
Ψ
8,14
=
W
0
T
Z
14
T
-
U
8
,
Ψ
8,13
=
W
0
T
Z
13
T
-
N
8
,
Ψ
8,15
=
W
0
T
Z
15
T
-
S
8
,
Ψ
9,9
=
-
1
-
τ
˙
t
Q
5
-
Λ
2
I
+
W
1
T
Z
9
T
+
Z
9
W
1
,
Ψ
9,10
=
W
1
T
Z
10
T
-
Z
9
,
Ψ
9,11
=
Z
9
+
W
1
T
Z
11
T
,
Ψ
9,12
=
-
M
9
+
W
1
T
Z
12
T
,
Ψ
9,13
=
-
N
9
+
W
1
T
Z
13
T
,
Ψ
9,14
=
-
U
9
+
W
1
T
Z
14
T
,
Ψ
9,15
=
-
S
9
+
W
1
T
Z
15
T
,
Ψ
10,10
=
Z
10
+
Z
10
T
+
τ
R
3
,
Ψ
10,11
=
Z
10
-
Z
11
T
,
Ψ
10,12
=
-
M
10
-
Z
12
T
,
Ψ
10,13
=
-
Z
13
T
-
N
10
,
Ψ
10,14
=
-
Z
14
T
-
U
10
,
Ψ
10,15
=
-
Z
15
T
-
S
10
,
Ψ
11,11
=
Z
11
T
+
Z
11
-
γ
I
+
λ
Σ
3
T
Σ
3
,
Ψ
11,12
=
Z
12
T
-
M
11
,
Ψ
11,13
=
Z
13
T
-
N
11
,
Ψ
11,14
=
Z
14
T
-
U
11
,
Ψ
11,15
=
Z
15
T
-
S
11
,
Ψ
12,12
=
-
1
α
τ
R
3
-
M
12
-
M
12
T
,
Ψ
12,13
=
-
M
13
T
-
N
12
,
Ψ
12,14
=
-
M
14
T
-
U
12
,
Ψ
12,15
=
-
M
15
T
-
S
12
,
Ψ
13,13
=
-
1
1
-
α
τ
R
3
-
N
13
-
N
13
T
,
Ψ
13,14
=
-
U
13
-
N
14
T
,
Ψ
13,15
=
-
N
15
T
-
S
13
,
Ψ
14,14
=
-
R
3
1
β
τ
-
U
14
-
U
14
T
,
Ψ
14,15
=
-
U
15
T
-
S
14
,
Ψ
15,15
=
-
1
1
-
β
τ
R
3
-
S
15
-
S
15
T
,
Ω
=
ρ
σ
P
A
0
0
0
0
0
0
0
0
0
0
0
0
0
0
.
Ψ
1 and Ψ
2 are defined as replacing τ
˙
(
t
) in Ψ
i by μ and -
μ, respectively. Consider(16)
M
¯
=
M
1
T
M
2
T
M
3
T
M
4
T
M
5
T
M
6
T
M
7
T
M
8
T
M
9
T
M
10
T
M
11
T
M
12
T
M
13
T
M
14
T
M
15
T
T
,
N
¯
=
N
1
T
N
2
T
N
3
T
N
4
T
N
5
T
N
6
T
N
7
T
N
8
T
N
9
T
N
10
T
N
11
T
N
12
T
N
13
T
N
14
T
N
15
T
T
,
U
¯
=
U
1
T
U
2
T
U
3
T
U
4
T
U
5
T
U
6
T
U
7
T
U
8
T
U
9
T
U
10
T
U
11
T
U
12
T
U
13
T
U
14
T
U
15
T
T
,
S
¯
=
S
1
T
S
2
T
S
3
T
S
4
T
S
5
T
S
6
T
S
7
T
S
8
T
S
9
T
S
10
T
S
11
T
S
12
T
S
13
T
S
14
T
S
15
T
T
,
Z
¯
=
Z
1
T
Z
2
T
Z
3
T
Z
4
T
Z
5
T
Z
6
T
Z
7
T
Z
8
T
Z
9
T
Z
10
T
Z
11
T
Z
12
T
Z
13
T
Z
14
T
Z
15
T
T
.Proof.
For the convenience of proof, we denote(17)
g
t
=
-
A
x
t
-
δ
t
+
W
0
f
x
t
+
W
1
f
x
t
-
τ
t
+
u
t
,
σ
t
=
σ
x
t
,
x
t
-
τ
t
,
u
t
;then system (1) can be rewritten as(18)
d
x
t
=
g
t
d
t
+
σ
t
d
ω
t
.
Choose a Lyapunov-Krasovskii functional candidate asV
(
x
(
t
)
)
=
∑
i
=
1
6
V
i
(
x
(
t
)
,
t
), where(19)
V
1
x
t
,
t
=
x
t
-
A
∫
t
-
δ
t
t
x
s
d
s
T
P
x
t
-
A
∫
t
-
δ
t
t
x
s
d
s
,
V
2
x
t
,
t
=
∫
t
-
δ
t
t
x
T
s
R
1
x
T
s
d
s
+
δ
∫
-
δ
t
0
∫
t
+
θ
t
x
T
s
R
2
x
T
s
d
s
d
θ
,
V
3
x
t
,
t
=
∫
t
-
α
τ
t
t
x
T
s
Q
1
x
s
d
s
+
∫
t
-
τ
t
t
-
α
τ
t
x
T
s
Q
2
x
s
d
s
+
∫
t
-
φ
t
t
-
τ
t
x
T
s
Q
3
x
s
d
s
+
∫
t
-
τ
t
-
φ
t
x
T
s
Q
4
x
s
d
s
,
V
4
x
t
,
t
=
∫
t
-
τ
t
t
f
T
s
Q
5
f
s
d
s
,
V
5
x
t
,
t
=
∫
-
τ
0
∫
t
+
s
t
g
T
θ
R
3
g
θ
d
θ
d
s
,
V
6
x
t
,
t
=
∫
-
τ
0
∫
t
+
s
t
σ
T
θ
R
4
σ
θ
d
θ
d
s
,where φ
(
t
)
=
τ
(
t
)
+
β
(
τ
-
τ
(
t
)
) and 0
<
α
<
1 and 0
<
β
<
1. Then, the stochastic differential of V
(
x
(
t
)
,
t
) along system (1) can be obtained as follows:(20)
d
V
x
t
,
t
=
L
V
x
t
,
t
d
t
+
2
x
t
T
P
g
t
d
ω
t
,where(21)
L
V
x
t
,
t
=
∑
i
=
1
6
L
V
i
x
t
,
t
.
So by Lemma9, the following inequalities can be obtained:(22)
L
V
1
x
t
,
t
=
2
x
t
-
A
∫
t
-
δ
t
t
x
s
d
s
T
P
g
¯
t
+
trace
⁡
σ
T
t
P
σ
t
≤
-
2
x
T
t
P
A
x
t
+
2
x
T
t
P
W
0
f
x
t
+
2
x
T
t
P
W
1
f
x
t
-
τ
t
+
2
x
T
t
P
u
t
+
2
∫
t
-
δ
t
t
x
s
d
s
T
A
T
P
A
x
t
-
2
∫
t
-
δ
t
t
x
s
d
s
T
A
T
P
W
0
f
x
t
-
2
∫
t
-
δ
t
t
x
s
d
s
T
A
T
P
W
1
f
x
t
-
τ
t
+
2
∫
t
-
δ
t
t
x
s
d
s
T
A
T
P
A
x
t
-
δ
t
ρ
σ
-
2
∫
t
-
δ
t
t
x
s
d
s
T
A
T
P
u
t
+
trace
⁡
σ
T
t
P
σ
t
+
x
T
t
P
A
Q
-
1
A
T
P
x
t
ρ
σ
+
x
T
t
-
δ
t
Q
x
t
-
δ
t
ρ
σ
,where g
¯
(
t
)
=
-
A
x
(
t
)
-
ρ
σ
A
x
(
t
-
δ
(
t
)
)
+
W
0
f
(
x
(
t
)
)
+
W
1
f
(
x
(
t
-
τ
(
t
)
)
)
+
u
(
t
),(23)
L
V
2
x
t
,
t
≤
x
T
t
R
1
x
t
-
1
-
ρ
σ
·
x
T
t
-
δ
t
R
1
x
t
-
δ
t
+
δ
2
x
T
t
R
2
x
t
-
∫
t
-
δ
t
t
x
T
s
d
s
R
2
∫
t
-
δ
t
t
x
s
d
s
,
L
V
3
x
t
,
t
=
x
T
t
Q
1
x
t
+
1
-
α
τ
˙
t
·
x
T
t
-
α
τ
t
Q
2
-
Q
1
x
t
-
α
τ
t
+
1
-
τ
˙
t
x
T
t
-
τ
t
Q
3
-
Q
2
x
t
-
τ
t
+
1
-
1
-
β
τ
˙
t
x
T
t
-
φ
t
Q
4
-
Q
3
·
x
t
-
φ
t
-
x
T
t
-
τ
Q
4
x
t
-
τ
,
L
V
4
x
t
,
t
=
f
T
x
t
Q
5
f
x
t
-
1
-
τ
˙
t
·
f
T
x
t
-
τ
t
Q
5
f
x
t
-
τ
t
,
L
V
5
x
t
,
t
=
τ
g
t
T
R
3
g
t
-
∫
t
-
α
τ
t
t
g
T
s
R
3
g
s
d
s
-
∫
t
-
τ
t
t
-
α
τ
t
g
T
s
R
3
g
s
d
s
-
∫
t
-
φ
t
t
-
τ
t
g
T
s
R
3
g
s
d
s
-
∫
t
-
τ
t
-
φ
t
g
T
s
R
3
g
s
d
s
,
L
V
6
x
t
,
t
=
τ
σ
T
t
R
4
σ
t
-
∫
t
-
α
τ
t
t
σ
T
s
R
4
σ
s
d
s
-
∫
t
-
τ
t
t
-
α
τ
t
σ
T
s
R
4
σ
s
d
s
-
∫
t
-
φ
t
t
-
τ
t
σ
T
s
R
4
σ
s
d
s
-
∫
t
-
τ
t
-
φ
t
σ
T
s
R
4
σ
s
d
s
.By Lemma 6, it is easy to know that(24)
-
∫
t
-
α
τ
t
t
g
T
s
R
3
g
s
d
s
≤
-
1
α
τ
t
∫
t
-
α
τ
t
t
g
T
s
d
s
R
3
∫
t
-
α
τ
t
t
g
s
d
s
≤
-
1
α
τ
∫
t
-
α
τ
t
t
g
T
s
d
s
R
3
∫
t
-
α
τ
t
t
g
s
d
s
,
-
∫
t
-
τ
t
t
-
α
τ
t
g
T
s
R
3
g
s
d
s
≤
-
1
1
-
α
τ
∫
t
-
τ
t
t
-
α
τ
t
g
T
s
d
s
R
3
∫
t
-
τ
t
t
-
α
τ
t
g
s
d
s
,
-
∫
t
-
φ
t
t
-
τ
t
g
T
s
R
3
g
s
d
s
≤
-
1
β
τ
∫
t
-
φ
t
t
-
τ
t
g
T
s
d
s
R
3
∫
t
-
φ
t
t
-
τ
t
g
s
d
s
,
-
∫
t
-
τ
t
-
φ
t
g
T
s
R
3
g
s
d
s
≤
-
1
1
-
β
τ
∫
t
-
τ
t
-
φ
t
g
T
s
d
s
R
3
∫
t
-
τ
t
-
φ
t
g
s
d
s
.For arbitrary matrices M
¯, N
¯, U
¯, S
¯, and Z
¯ with compatible dimensions, we have(25)
θ
1
t
=
2
ζ
T
t
M
¯
x
t
-
x
T
t
-
α
τ
t
-
∫
t
-
α
τ
t
t
g
s
d
s
-
∫
t
-
α
τ
t
t
σ
s
d
w
s
=
0
,
(26)
θ
2
t
=
2
ζ
T
t
N
¯
x
t
-
α
τ
t
-
x
T
t
-
τ
t
-
∫
t
-
τ
t
t
-
α
τ
t
g
s
d
s
-
∫
t
-
τ
t
t
-
α
τ
t
σ
s
d
w
s
=
0
,
(27)
θ
3
t
=
2
ζ
T
t
U
¯
x
t
-
τ
t
-
x
T
t
-
φ
t
-
∫
t
-
φ
t
t
-
τ
t
g
s
d
s
-
∫
t
-
φ
t
t
-
τ
t
σ
s
d
w
s
=
0
,
(28)
θ
4
t
=
2
ζ
T
t
S
¯
x
t
-
φ
t
-
x
T
t
-
τ
-
∫
t
-
τ
t
-
φ
t
g
s
d
s
-
∫
t
-
τ
t
-
φ
t
σ
s
d
w
s
=
0
,
(29)
θ
5
t
=
2
ζ
T
t
Z
¯
-
A
x
t
-
δ
t
-
g
t
+
W
0
f
x
t
+
W
1
f
x
t
-
τ
t
+
u
t
=
0
,where(30)
ζ
T
t
=
a
1,1
a
1,2
a
1,3
a
1,4
a
1,5
a
1,6
a
1,7
a
1,8
a
1,9
a
1,10
a
1,11
a
1,12
a
1,13
a
1,14
a
1,15
,where(31)
a
1,1
=
x
T
t
,
a
1,2
=
x
T
t
-
δ
t
,
a
1,3
=
x
T
t
-
α
τ
t
,
a
1,4
=
x
T
t
-
τ
t
,
a
1,5
=
x
T
t
-
φ
t
,
a
1,6
=
x
T
t
-
τ
,
a
1,7
=
∫
t
-
δ
t
t
x
T
s
d
s
,
a
1,8
=
f
T
x
t
,
a
1,9
=
f
T
x
t
-
τ
t
,
a
1,10
=
g
T
t
,
a
1,11
=
u
T
t
,
a
1,12
=
∫
t
-
α
τ
t
t
g
T
s
d
s
,
a
1,13
=
∫
t
-
τ
t
t
-
α
τ
t
g
T
s
d
s
,
a
1,14
=
∫
t
-
φ
t
t
-
τ
t
g
T
s
d
s
,
a
1,15
=
∫
t
-
τ
t
-
φ
t
g
T
s
d
s
.From Assumptions 3 and (12), we can get(32)
trace
⁡
σ
T
t
P
+
τ
R
4
σ
t
≤
λ
x
T
t
Σ
1
T
Σ
1
x
t
+
x
T
t
-
τ
t
Σ
2
T
Σ
2
x
t
-
τ
t
+
u
T
t
Σ
3
T
Σ
3
u
t
.
In addition, from Assumption1, the following inequalities can be deduced:(33)
f
x
t
-
Λ
1
x
t
T
f
x
t
-
Λ
2
x
t
≤
0
,
f
x
t
-
τ
t
-
Λ
1
x
t
-
τ
t
T
·
f
x
t
-
τ
t
-
Λ
2
x
t
-
τ
t
≤
0
.
It is clear that for any scalarsϵ
1
>
0 and ϵ
2
>
0, there exist diagonal matrices F
1
≥
0, F
2
≥
0, and Λ
i
(
i
=
1,2
) such that the following inequality hold:(34)
0
≤
-
ϵ
1
x
t
f
x
t
T
F
1
F
2
∗
I
x
t
f
x
t
=
θ
6
t
,
0
≤
-
ϵ
2
x
t
-
τ
t
f
x
t
-
τ
t
T
·
F
1
F
2
∗
I
x
t
-
τ
t
f
x
t
-
τ
t
=
θ
7
t
,where(35)
F
1
=
Λ
1
T
Λ
1
+
Λ
2
T
Λ
1
2
,
F
2
=
-
Λ
1
T
+
Λ
2
T
2
.
In order to get the passive condition, we introduce the following inequality:(36)
L
V
x
t
,
t
-
2
y
T
t
u
t
-
γ
u
T
t
u
t
≤
L
V
x
t
,
t
-
2
f
T
x
t
u
t
-
γ
u
T
t
u
t
+
∑
i
=
1
7
θ
i
t
.On the other hand, for formulas (25)–(28), we further have(37)
-
2
ζ
T
t
M
¯
∫
t
-
α
τ
t
t
σ
s
d
w
s
≤
ζ
T
t
M
¯
R
4
-
1
M
¯
T
ζ
t
+
∫
t
-
α
τ
t
t
σ
s
d
w
s
T
R
4
∫
t
-
α
τ
t
t
σ
s
d
w
s
,
-
2
ζ
T
t
N
¯
∫
t
-
τ
t
t
-
α
τ
t
σ
s
d
w
s
≤
ζ
T
t
N
¯
R
4
-
1
N
¯
T
ζ
t
+
∫
t
-
τ
t
t
-
α
τ
t
σ
s
d
w
s
T
R
4
∫
t
-
τ
t
t
-
α
τ
t
σ
s
d
w
s
,
-
2
ζ
T
t
U
¯
∫
t
-
φ
t
t
-
τ
t
σ
s
d
w
s
≤
ζ
T
t
U
¯
R
4
-
1
U
¯
T
ζ
t
+
∫
t
-
φ
t
t
-
τ
t
σ
s
d
w
s
T
R
4
∫
t
-
φ
t
t
-
τ
t
σ
s
d
w
s
,
-
2
ζ
T
t
S
¯
∫
t
-
τ
t
-
φ
t
σ
s
d
w
s
≤
ζ
T
t
S
¯
R
4
-
1
S
¯
T
ζ
t
+
∫
t
-
τ
t
-
φ
t
σ
s
d
w
s
T
R
4
∫
t
-
τ
t
-
φ
t
σ
s
d
w
s
.
At the same time, from the character of Itô integrals, we can obtain that(38)
E
∫
t
-
α
τ
t
t
σ
T
s
d
w
s
R
4
∫
t
-
α
τ
t
t
σ
s
d
w
s
=
E
∫
t
-
α
τ
t
t
σ
T
s
R
4
σ
s
d
s
,
(39)
E
∫
t
-
τ
t
t
-
α
τ
t
σ
T
s
d
w
s
R
4
∫
t
-
τ
1
t
t
-
α
τ
t
σ
s
d
w
s
=
E
∫
t
-
τ
t
t
-
α
τ
t
σ
T
s
R
4
σ
s
d
s
,
(40)
E
∫
t
-
φ
t
t
-
τ
t
σ
T
s
d
w
s
R
4
∫
t
-
φ
t
t
-
τ
t
σ
s
d
w
s
=
E
∫
t
-
φ
t
t
-
τ
t
σ
T
s
R
4
σ
s
d
s
,
(41)
E
∫
t
-
τ
t
-
δ
t
σ
T
s
d
w
s
R
4
∫
t
-
τ
t
-
φ
t
σ
s
d
w
s
=
E
∫
t
-
τ
t
-
φ
t
σ
T
s
R
4
σ
s
d
s
.
By substituting (22)-(23) into (20) and considering (36), then taking expectation on both sides of (20), and then using (38), we can get(42)
E
d
V
x
t
,
t
-
2
E
y
T
t
u
t
-
γ
E
u
T
t
u
t
=
E
L
V
x
t
,
t
-
2
E
y
T
t
u
t
-
γ
E
u
T
t
u
t
≤
E
ζ
T
t
Ψ
i
+
Ω
T
Q
-
1
Ω
+
M
¯
R
4
-
1
M
¯
T
+
N
¯
R
4
-
1
N
¯
T
+
U
¯
R
4
-
1
U
¯
T
+
S
¯
R
4
-
1
S
¯
T
ζ
t
,
i
=
1,2
.By Lemma 8, there exist nonnegative functions λ
1
(
t
) and λ
2
(
t
) satisfying λ
1
(
t
)
+
λ
2
(
t
)
=
1 such that(43)
Ψ
=
λ
1
t
Ψ
1
+
λ
2
t
Ψ
2
.Substituting (43) into (42), then (42) can be rewritten as(44)
E
d
V
x
t
,
t
-
2
E
y
T
t
u
t
-
γ
E
u
T
t
u
t
≤
λ
1
t
θ
1
t
ζ
T
t
·
Ψ
1
+
Ω
T
Q
-
1
Ω
+
M
R
4
-
1
M
T
+
N
R
4
-
1
N
T
ζ
t
+
λ
1
t
θ
2
t
ζ
T
t
·
Ψ
2
+
Ω
T
Q
-
1
Ω
+
M
R
4
-
1
M
T
+
N
R
4
-
1
N
T
ζ
t
·
λ
2
t
θ
1
t
ζ
T
t
·
Ψ
1
+
Ω
T
Q
-
1
Ω
+
U
R
4
-
1
U
T
+
S
R
4
-
1
S
T
ζ
t
+
λ
2
t
θ
2
t
ζ
T
t
·
Ψ
2
+
Ω
T
Q
-
1
Ω
+
U
R
4
-
1
U
T
+
S
R
4
-
1
S
T
ζ
t
,where θ
1
(
t
)
=
τ
(
t
)
/
τ
≥
0,  θ
2
(
t
)
=
τ
-
τ
(
t
)
/
τ
≥
0.
So we can get that the following matrix inequalities hold:(45)
Ψ
i
+
Ω
T
Q
-
1
Ω
+
M
¯
R
4
-
1
M
¯
T
+
N
¯
R
4
-
1
N
¯
T
<
0
,
i
=
1,2
,
(46)
Ψ
i
+
Ω
T
Q
-
1
Ω
+
U
¯
R
4
-
1
U
¯
T
+
S
¯
R
4
-
1
S
¯
T
<
0
,
i
=
1,2
.By virtue of Lemma 7, (45) and (46) are equivalent to (13) and (14), respectively, so we can get that(47)
E
d
V
x
t
,
t
-
2
E
y
T
t
u
t
-
γ
E
u
T
t
u
t
<
0
;then integrating on both sides of (47) from 0 to t, we can obtain(48)
2
E
∫
0
t
y
T
s
u
s
d
s
≥
E
V
x
t
,
t
-
E
V
x
0
,
0
-
γ
E
∫
0
t
u
s
u
s
d
s
≥
-
γ
E
∫
0
t
u
T
s
u
s
d
s
.It indicates that system (1) is stochastically passive in the sense of Definition 4. This completes the proof.Remark 11.
In [42], the delay interval is divided into three subintervals, which are [
-
τ
2
,
-
τ
(
t
)
], [
-
τ
(
t
)
,
-
τ
1
], and [
-
τ
1
,
0
]. In this paper, the new Lyapunov function proposed in Theorem 10 is based on the decomposition of delay interval [
-
τ
,
0
] into four subintervals, which are [
-
α
τ
(
t
)
,
0
], [
-
τ
(
t
)
,
-
α
τ
(
t
)
], [
-
φ
(
t
)
,
-
τ
(
t
)
], and [
-
τ
,
-
τ
(
t
)
]. By using the lower bound and upper bound of delay derivative τ
˙
(
t
), the idea of delay fraction can be successfully applied to cases of both constant and time-varying delay, so less conservatism results can be expected.
When the leakage delay is constant, namely,δ
(
t
)
=
δ and ρ
σ
=
0, neural network system (1) will become the following model:(49)
d
x
t
=
-
A
x
t
-
δ
+
W
0
f
x
t
+
W
1
f
x
t
-
τ
t
+
u
t
d
t
+
σ
x
t
,
x
t
-
τ
t
,
u
t
d
ω
t
,
y
t
=
f
x
t
.This system has been studied in [42]; then for system (49) we have the following Corollary 12.Corollary 12.
Given scalarsτ
>
0, 0
<
α
<
1, 0
<
β
<
1, λ
>
0, and 0
<
μ and proper matrices Σ
i
(
i
=
1,2
,
3
), the SNNs described by (49) are stochastically passive in the sense of Definition 4, if there exist positive matrices P
>
0, Q
j
>
0
(
j
=
1
,
…
,
5
), and R
l
>
0
(
l
=
1
,
…
,
5
), positive diagonal matrices F
j
>
0
(
j
=
1,2
), positive constants γ
>
0, ϵ
1, ϵ
2, and real matrices M
¯
,
N
¯
,
U
¯
,
S
¯, and Z
¯ of appropriate dimensions such that the following LMIs hold:(50)
P
+
τ
R
4
≤
λ
I
,
(51)
Ψ
¯
i
τ
˙
t
M
N
∗
-
1
α
τ
R
4
0
∗
∗
-
1
1
-
α
τ
R
4
<
0
,
i
=
1,2
,
(52)
Ψ
¯
i
τ
˙
t
U
S
∗
-
1
β
τ
R
4
0
∗
∗
-
1
1
-
β
τ
R
4
<
0
,
i
=
1,2
,where (53)
Ψ
¯
2,2
=
-
R
1
-
Z
2
A
,
Ψ
¯
2,7
=
0
.
Ψ
¯
1
(
τ
˙
(
t
)
) and Ψ
¯
2
(
τ
˙
(
t
)
) are defined as replacing τ
˙
(
t
) in Ψ
¯
i
(
τ
˙
(
t
)
) by μ and -
μ, respectively; the other terms have the same expression as that in Theorem 10.It is well known that the Markovian jump systems (MJSs) are a special class of hybrid systems, which have the advantage in modeling the dynamic systems subject to abrupt variation in their structures, such as component failures and sudden environmental disturbance. Many researches about the stability analysis, impulsive response, and state estimation on the neural networks with Markovian jumping parameters have been obtained; see [44–47] and references therein. Recently [48] has studied the passivity of stochastic neural networks with Markovian jumping parameters; the same method can be used to a system with Markovian jumping parameters and it still leaves much room to reduce the conservatism, which motivates our aim.Letr
t, t
≥
0, be a right-continuous Markov chain defined on a complete probability space (
Ω
,
F
,
P
) and taking discrete values in a finite state space S
=
{
1,2
,
…
,
N
} with generator Π
=
(
π
i
j
)
N
×
N given by(54)
P
r
t
+
Δ
=
j
∣
r
t
=
i
=
π
i
j
Δ
+
o
Δ
,
i
≠
j
,
1
+
π
i
j
Δ
+
o
Δ
,
i
=
j
,where Δ
>
0 and π
i
j
≥
0 is the transition rate from i to j while π
i
i
=
-
∑
j
≠
i
π
i
j.For the purpose of simplicity, in the sequel, for eachr
t
=
i
∈
S, A
(
r
t
), W
0
(
r
t
), and W
1
(
r
t
) are denoted by A
i, W
0
i, W
1
i, and so on. Throughout the paper, we assume that ω
(
t
) and r
(
t
) are independent. Then when the leakage delay does not exist, system (1) will become the one as follows:(55)
d
x
t
=
-
A
i
x
t
+
W
0
i
f
x
t
+
W
1
i
f
x
t
-
τ
t
+
u
t
d
t
+
σ
x
t
,
x
t
-
τ
t
,
i
,
u
t
d
ω
t
y
t
=
f
x
t
.This system has been studied in [43] and good results have been obtained. In order to testify the effectiveness of our methods, we give the following Theorem 13.Theorem 13.
Given scalarsτ
>
0, 0
<
α
<
1, 0
<
β
<
1, λ
i
>
0, and 0
<
μ and proper matrices Σ
n
(
n
=
1,2
,
3
), the SNNs described by (1) are stochastically passive in the sense of Definition 4, if there exist positive matrices P
i
>
0, Q
>
0, Q
j
>
0
(
j
=
1
,
…
,
5
), and R
l
>
0
(
l
=
1,2
,
…
,
5
), positive diagonal matrices F
j
>
0
(
j
=
1,2
), positive constants ϵ
1
i, ϵ
2
i, γ
>
0, and real matrices M
¯
i
,
N
¯
i
,
U
¯
i
,
S
¯
i, and Z
¯
i of appropriate dimensions such that the following LMIs hold:(56)
P
i
+
τ
R
4
≤
λ
i
I
,
(57)
Ψ
κ
τ
˙
t
M
¯
i
N
¯
i
∗
-
1
α
τ
R
4
0
∗
∗
-
1
1
-
α
τ
R
4
<
0
,
κ
=
1,2
(58)
Ψ
κ
τ
˙
t
U
¯
i
S
¯
i
∗
-
1
β
τ
R
4
0
∗
∗
-
1
1
-
β
τ
R
4
<
0
,
κ
=
1,2
,where (59)
Ψ
i
τ
˙
t
=
Ψ
m
×
n
13
×
13
,
Ψ
1,1
=
Q
1
+
R
1
+
∑
j
=
1
N
π
i
j
P
j
-
P
i
A
i
-
A
i
T
P
i
-
ϵ
1
i
F
1
+
λ
i
Σ
1
i
T
Σ
1
i
+
M
1
i
+
M
1
i
T
,
Ψ
1,2
=
-
M
1
i
+
M
2
i
T
+
N
1
i
,
Ψ
1,3
=
M
3
i
T
-
N
1
i
+
U
1
i
,
Ψ
1,4
=
M
4
i
T
-
U
1
i
+
S
1
i
,
Ψ
1,5
=
M
5
i
T
-
S
1
i
,
Ψ
1,6
=
Z
1
i
W
0
i
+
P
W
0
i
+
ϵ
1
i
F
2
+
M
6
i
T
,
Ψ
1,7
=
Z
1
i
W
1
i
+
P
i
W
1
i
+
M
7
i
T
,
Ψ
1,8
=
-
Z
1
i
+
M
8
i
T
,
Ψ
1,9
=
Z
1
i
+
P
+
M
9
i
T
,
Ψ
1,10
=
M
1
i
T
-
M
10
i
,
Ψ
1,11
=
M
11
i
T
-
N
1
i
,
Ψ
1,12
=
M
12
i
T
-
U
1
i
,
Ψ
1,13
=
M
13
i
T
-
S
1
i
,
Ψ
2,2
=
1
-
α
τ
˙
t
Q
2
-
Q
1
-
M
2
i
-
M
2
i
T
+
N
2
i
+
N
2
i
T
,
Ψ
2,3
=
-
N
2
i
-
M
2
i
T
+
N
2
i
T
+
U
2
i
,
Ψ
2,4
=
-
M
4
i
T
+
N
4
i
T
-
U
2
i
+
S
2
i
,
Ψ
2,5
=
-
M
5
i
T
+
N
5
i
T
-
S
2
i
,
Ψ
2,6
=
Z
2
i
W
0
i
-
M
6
i
T
+
N
6
i
T
,
Ψ
2,7
=
Z
2
i
W
1
i
-
M
7
i
T
+
N
7
i
T
,
Ψ
2,8
=
-
Z
2
i
-
M
8
T
+
N
8
T
,
Ψ
2,9
=
Z
2
i
-
M
9
i
T
+
N
9
i
T
,
Ψ
2,10
=
-
M
10
i
T
+
N
10
i
T
-
M
2
i
,
Ψ
2,11
=
-
N
2
i
-
M
11
i
T
+
N
11
i
T
,
Ψ
2,12
=
-
M
12
i
T
+
N
12
i
T
-
U
2
i
,
Ψ
2,13
=
-
M
13
i
T
+
N
13
i
T
-
S
2
i
,
Ψ
3,3
=
1
-
τ
˙
t
Q
3
-
Q
2
-
ϵ
2
i
F
1
+
λ
Σ
2
i
T
Σ
2
i
-
N
3
i
-
N
3
i
T
+
U
3
i
T
+
U
3
i
,
Ψ
3,4
=
-
N
4
i
T
+
U
4
i
T
-
U
3
i
+
S
3
i
,
Ψ
3,5
=
-
N
5
i
T
+
U
3
i
T
-
S
3
i
,
Ψ
3,6
=
Z
3
i
W
0
i
-
N
6
i
T
+
U
6
i
T
,
Ψ
3,7
=
Z
3
i
W
1
i
-
N
7
T
-
ϵ
2
i
F
2
+
U
7
i
T
,
Ψ
3,8
=
-
Z
3
i
-
N
8
i
T
+
U
8
i
T
,
Ψ
3,9
=
Z
3
-
N
9
T
+
U
9
T
,
Ψ
3,10
=
-
N
10
T
-
M
3
+
U
10
T
,
Ψ
3,11
=
-
N
11
i
T
-
N
11
i
+
U
11
i
T
,
Ψ
3,12
=
-
N
12
i
T
+
U
12
i
T
-
U
3
i
,
Ψ
3,13
=
-
N
13
i
T
+
U
13
i
T
-
S
3
i
,
Ψ
4,4
=
1
-
1
-
β
τ
˙
t
Q
4
-
Q
3
-
U
4
i
-
U
4
i
T
+
S
4
i
+
S
4
i
T
,
Ψ
4,5
=
-
U
5
i
T
+
S
5
i
T
-
S
4
i
,
Ψ
4,6
=
Z
4
i
W
0
i
-
U
6
i
T
+
S
6
i
T
,
Ψ
4,7
=
Z
4
i
W
1
i
-
U
7
i
T
+
S
7
i
T
,
Ψ
4,8
=
-
Z
4
i
-
U
8
i
T
+
S
8
i
T
,
Ψ
4,9
=
Z
4
i
-
U
9
i
T
+
S
9
i
T
,
Ψ
4,10
=
-
U
10
i
T
-
M
4
i
+
S
10
i
T
,
Ψ
4,11
=
-
U
11
i
T
+
S
11
i
T
-
N
4
i
,
Ψ
4,12
=
-
U
12
i
T
-
U
4
i
+
S
12
i
T
,
Ψ
4,13
=
-
U
13
i
T
+
S
13
i
T
-
S
4
i
,
Ψ
5,5
=
-
Q
4
-
S
5
i
-
S
5
i
T
,
Ψ
5,6
=
Z
5
i
W
0
i
-
S
6
i
T
,
Ψ
5,7
=
Z
5
i
W
1
i
-
S
7
T
,
Ψ
5,8
=
-
S
8
i
T
-
Z
5
i
,
Ψ
5,9
=
-
S
9
i
T
Z
5
i
,
Ψ
5,10
=
-
M
5
i
-
S
10
i
T
,
Ψ
5,11
=
-
N
5
i
-
S
11
i
T
,
Ψ
5,12
=
-
U
12
i
-
S
12
i
T
,
Ψ
5,13
=
-
S
13
i
T
-
S
5
i
,
Ψ
6,6
=
-
ϵ
1
i
I
+
Q
5
+
Z
6
i
W
0
i
+
W
0
i
T
Z
6
i
T
,
Ψ
6,7
=
W
0
i
T
Z
7
i
T
,
Ψ
6,8
=
W
0
i
T
Z
8
i
T
-
Z
6
T
,
Ψ
6,9
=
W
0
i
T
Z
9
i
T
-
I
+
Z
6
i
T
,
Ψ
6,10
=
W
0
i
T
Z
10
i
T
-
M
10
i
,
Ψ
6,12
=
W
0
i
T
Z
12
i
T
-
U
6
i
,
Ψ
6,11
=
W
0
i
T
Z
11
i
T
-
N
6
i
,
Ψ
6,13
=
W
0
T
Z
13
T
-
S
6
,
Ψ
7,7
=
-
1
-
τ
˙
t
Q
5
-
ϵ
2
i
I
+
W
1
i
T
Z
7
i
T
+
Z
7
i
W
1
i
,
Ψ
7,8
=
W
1
i
T
Z
8
i
T
-
Z
7
i
,
Ψ
7,9
=
Z
7
i
+
W
1
T
Z
9
i
T
,
Ψ
7,10
=
-
M
7
i
+
W
1
i
T
Z
10
i
T
,
Ψ
7,11
=
-
N
7
i
+
W
1
i
T
Z
11
i
T
,
Ψ
7,12
=
-
U
7
i
+
W
1
i
T
Z
12
i
T
,
Ψ
7,13
=
-
S
7
i
+
W
1
i
T
Z
13
i
T
,
Ψ
8,8
=
Z
8
i
+
Z
8
i
T
+
τ
R
3
,
Ψ
8,9
=
Z
8
i
-
Z
9
i
T
,
Ψ
8,10
=
-
M
8
i
-
Z
10
i
T
,
Ψ
8,11
=
-
Z
11
i
T
-
N
8
i
,
Ψ
8,12
=
-
Z
12
i
T
-
U
8
i
,
Ψ
8,13
=
-
Z
13
i
T
-
S
8
i
,
Ψ
9,9
=
Z
9
i
T
+
Z
9
i
-
γ
I
+
λ
i
Σ
3
i
T
Σ
3
i
,
Ψ
9,10
=
Z
10
i
T
-
M
9
i
,
Ψ
9,11
=
Z
11
i
T
-
N
9
i
,
Ψ
9,12
=
Z
12
i
T
-
U
9
i
,
Ψ
9,13
=
Z
3
i
T
-
S
9
i
,
Ψ
10,10
=
-
1
α
τ
R
3
-
M
10
i
-
M
10
i
T
,
Ψ
10,11
=
-
M
11
i
T
-
N
10
i
,
Ψ
10,12
=
-
M
12
i
T
-
U
10
i
,
Ψ
10,13
=
-
M
13
i
T
-
S
10
i
,
Ψ
11,11
=
-
1
1
-
α
τ
R
3
-
N
11
i
-
N
11
i
T
,
Ψ
11,12
=
-
U
11
i
-
N
12
i
T
,
Ψ
11,13
=
-
N
13
i
T
-
S
11
i
,
Ψ
12,12
=
-
R
3
1
β
τ
-
U
12
i
-
U
12
i
T
,
Ψ
12,13
=
-
U
13
i
T
-
S
12
i
,
Ψ
13,13
=
-
1
1
-
β
τ
R
3
-
S
13
i
-
S
13
i
T
.
Ψ
1
(
τ
˙
(
t
)
) and Ψ
2
(
τ
˙
(
t
)
) are defined as replacing τ
˙
(
t
) in Ψ
i
(
τ
˙
(
t
)
) by μ and -
μ, respectively. One has(60)
M
¯
i
=
M
1
i
T
M
2
i
T
M
3
i
T
M
4
i
T
M
5
i
T
M
6
i
T
M
7
i
T
M
8
i
T
M
9
i
T
M
10
i
T
M
11
i
T
M
12
i
T
M
13
i
T
T
,
N
¯
i
=
N
1
i
T
N
2
i
T
N
3
i
T
N
4
i
T
N
5
i
T
N
6
i
T
N
7
i
T
N
8
i
T
N
9
i
T
N
10
i
T
N
11
i
T
N
12
i
T
N
13
i
T
T
,
U
¯
i
=
U
1
i
T
U
2
i
T
U
3
i
T
U
4
i
T
U
5
i
T
U
6
i
T
U
7
i
T
U
8
i
T
U
9
i
T
U
10
i
T
U
11
i
T
U
12
i
T
U
13
i
T
T
,
S
¯
i
=
S
1
i
T
S
2
i
T
S
3
i
T
S
4
i
T
S
5
i
T
S
6
i
T
S
7
i
T
S
8
i
T
S
9
i
T
S
10
i
T
S
11
i
T
S
12
i
T
S
13
i
T
T
,
Z
¯
i
=
Z
1
i
T
Z
2
i
T
Z
3
i
T
Z
4
i
T
Z
5
i
T
Z
6
i
T
Z
7
i
T
Z
8
i
T
Z
9
i
T
Z
10
i
T
Z
11
i
T
Z
12
i
T
Z
13
i
T
T
.Proof.
Choose a Lyapunov-Krasovskii functional candidate asV
(
x
(
t
)
,
t
,
i
)
=
∑
N
=
1
5
V
N
(
x
(
t
)
,
t
,
i
), where(61)
V
1
x
t
,
t
,
i
=
x
t
T
P
i
x
t
,
V
2
x
t
,
t
,
i
=
∫
t
-
α
τ
t
t
x
T
s
Q
1
x
s
d
s
+
∫
t
-
τ
t
t
-
α
τ
t
x
T
s
Q
2
x
s
d
s
+
∫
t
-
φ
t
t
-
τ
t
x
T
s
Q
3
x
s
d
s
+
∫
t
-
τ
t
-
φ
t
x
T
s
Q
4
x
s
d
s
,
V
3
x
t
,
t
,
i
=
∫
t
-
τ
t
t
f
T
s
Q
5
f
s
d
s
,
V
4
x
t
,
t
,
i
=
∫
-
τ
0
∫
t
+
s
t
g
T
θ
R
3
g
θ
d
θ
d
s
,
V
5
x
t
,
t
,
i
=
∫
-
τ
0
∫
t
+
s
t
σ
T
θ
R
4
σ
θ
d
θ
d
s
,where φ
(
t
)
=
τ
(
t
)
+
β
(
τ
-
τ
(
t
)
) and 0
<
α
<
1 and 0
<
β
<
1.
By the same method as that in Theorem10, we can get that the following inequalities hold:(62)
E
d
V
x
t
,
t
,
i
-
2
E
y
T
t
u
t
-
γ
E
u
T
t
u
t
≤
E
ζ
¯
T
t
Ψ
κ
τ
˙
t
+
M
¯
i
T
R
4
-
1
M
¯
i
+
N
¯
i
T
R
4
-
1
N
¯
i
+
U
¯
i
T
R
4
-
1
U
¯
i
+
S
¯
i
T
R
4
-
1
S
¯
i
ζ
¯
t
,
κ
=
1,2
,where(63)
ζ
¯
T
t
=
b
1,1
b
1,2
b
1,3
b
1,4
b
1,5
b
1,6
b
1,7
b
1,8
b
1,9
b
1,10
b
1,11
b
1,12
b
1,13
,where(64)
b
1,1
=
x
T
t
,
b
1,2
=
x
T
t
-
α
τ
t
,
b
1,3
=
x
T
t
-
τ
t
,
b
1,4
=
x
T
t
-
φ
t
,
b
1,5
=
x
T
t
-
τ
,
b
1,6
=
f
T
x
t
,
b
1,7
=
f
T
x
t
-
τ
t
,
b
1,8
=
g
T
t
,
b
1,9
=
u
T
t
,
b
1,10
=
∫
t
-
α
τ
t
t
g
T
s
d
s
,
b
1,11
=
∫
t
-
τ
t
t
-
α
τ
t
g
T
s
d
s
,
b
1,12
=
∫
t
-
φ
t
t
-
τ
t
g
T
s
d
s
,
b
1,13
=
∫
t
-
τ
t
-
φ
t
g
T
s
d
s
.So by virtue of Lemma 7 and the same proof method of Theorem 10, we can get that system (55) is stochastic passive.


## 4. Numerical Example and Simulation

In this section, three numerical examples are presented to demonstrate the effectiveness of the developed method on the obtained passive results.Example 1.
Consider neutral stochastic neural networks (1) with the following parameters (Example  5 in [42]):(65)
A
=
1.5
0
0
1.3
,
W
0
=
0.5
0.2
0.4
0.3
,
W
1
=
0.4
-
0.1
0.1
0.2
,
Σ
1
=
0.1
0
0
0.1
,
Σ
2
=
0.2
0
0
0.2
,
Σ
3
=
0.3
0
0
0.4
,
α
=
0.5
,
β
=
0.6
,
τ
=
0.8
,
μ
=
0.6
.
Take the activation function asf
1
x
t
=
f
2
x
t
=
tanh
⁡
(
x
), so it can be verified from Assumption 1 that F
1
=
diag
⁡
{
0,0
} and F
2
=
diag
⁡
{
-
0.5
,
-
0.5
}, and by using of the Matlab LMI Control Toolbox, we find out a solution to LMIs (12), (13), and (14) as follows:(66)
P
=
0.1536
-
0.0046
-
0.0046
0.1497
,
R
1
=
0.0812
-
0.0415
-
0.0415
0.0864
,
R
2
=
1.4662
-
0.4043
-
0.4043
1.2144
,
R
3
=
0.0088
-
0.0058
-
0.0058
0.0122
,
R
4
=
0.0520
0.0051
0.0051
0.0565
,
Q
1
=
0.0881
-
0.0174
-
0.0174
0.0902
,
Q
2
=
0.0704
-
0.0139
-
0.0139
0.0717
,
Q
3
=
0.0529
-
0.0102
-
0.0102
0.0537
,
Q
4
=
0.0318
-
0.0060
-
0.0060
0.0322
,
Q
=
0.0318
-
0.0060
-
0.0060
0.0322
,
γ
=
297.6609
.In order to testify the effectiveness of our proposed method, many experiments have been done and the upper bounds of delays δ and τ are listed from Tables 1 to 3, where “–” means that LMIs (12)–(14) has no feasible solution. Table 1 shows the maximum allowable upper bound δ for different values of ρ
σ, which means that the bound of the derivative of the leakage-time-varying is very effective and plays an important role in obtaining the feasible results.
From Table2, we can see that when μ
>
1, the feasible solution can be obtained. From Table 3 we can see that when fixing the value of μ and ρ
σ, the allowable upper value of τ is effected by δ, especially when δ
=
0.45; the feasible solution cannot be obtained. Especially, when leakage δ
(
t
)
=
δ, namely, leakage delay, is constant, the studied system will become system (40), which has been researched in [42]; then we have the following Example 2.Table 1
Maximum allowable bounds ofδ for different ρ
σ values and α
=
0.6, β
=
0.6, τ
=
1.0, and μ
=
0.6.
ρ
σ
0.1
0.4
0.45
Theorem10
0.5176
0.3251
—Table 2
Maximum allowable bounds ofτ for different μ values of ρ
σ
=
0.2 and δ
=
0.2.
μ
0
0.5
0.8
1.1
τ
0.8267
0.7342
0.4682
0.3848Table 3
Allowable upper bounds ofτ for different values of δ; ρ
σ = 0.1 and μ
=
0.5.
δ
0.1
0.05
0.1
0.4
0.45
τ
0.8367
0.7537
0.6415
0.2593
—Example 2.
Consider that stochastic neural networks (49) have the same parameters as that in [42], so from Corollary 12, we can have the following research results listed in Tables 4 and 5, which show the effect on τ for different μ and mutual effect between τ and δ.
From Table4 we also can see that when the same parameters in (2) and (3) of [42] are taken into account and when λ is set by 1 and δ
=
0.1 and R
1
=
R
2
=
0.1
∗
I, by solving (2) and (3) of [42], we can get that maximum value τ is 0.0005, so our method has obtained the less conservatism than that of [42].
In this example, whenu
t
=
-
0.3
cos
⁡
3.1
t
0.7
sin
⁡
1.4
t
′, Figure 1 shows the state curve with u
(
t
). From Figure 1 we can see that when stochastic disturbance and input exist, the systems with leakage delay are unstable.Table 4
Allowable upper bounds ofτ for different values of δ; μ
=
0.5.
δ
0.01
0.05
0.1
0.4
0.45
Corollary12
0.9293
0.7882
0.7023
0.3685
—
[42]
0.0005
—
—
—
—Table 5
Allowable upper bounds ofτ with different values of μ; α
=
0.4, β
=
0.6, and δ
=
0.2.
μ
0
0.2
0.5
0.8
0.9
1.1
τ
0.3025
0.3004
0.2946
0.2886
0.2886
0.2886Figure 1
State curves of system (1) with input u
(
t
).Remark 14.
In [42], the sufficient conditions of passivity about stochastic neural networks are given by LMIs, but the solution is not given out, and the simulation about both stochastic and leakage delay is not discussed, either. In our discussion, the impact of leakage delay on stability of systems is considered.
At the same time, when leakage delay is set by different values, by taking the initial state[
2
,
-
1
] and using the Matlab software, a state curve is obtained as in Figure 2; Figure 2 shows the state curves of system (49) without input and δ is 0.6 and τ
=
0.8; Figure 3 shows the state curves of system (49) without input and δ is 0.2 and τ
=
0.8.
When stochastic disturbance does not exit in system (49), the state simulation curves of (49) are shown in Figure 4.
Figure4 shows the state curves of system (49) without stochastic disturbance and different leakage delay; from Figure 4, we can see that when the leakage delay exits in the neural networks system, state curve of system oscillates sharply from the start point and then becomes asymptotically stable; at the same time, we can find that the bigger the leakage delay, the more serious the oscillation.Figure 2
State curves of system (1) without input and δ is 0.6.Figure 3
State curves of system (49) with leakage delay 0.2.Figure 4
State curves of system (1) without input.Remark 15.
In Corollary 2 of [42], the maximum value of time delay is 0.2, when leakage delay is set by 0.1. In our method, combing the simulation curve with the value of δ, when δ is 0.1, the maximum value of time delay which is guaranteeing the fact that system (1) is stable can reach 1.2.Remark 16.
In [42], an example has been given to show the effectiveness of passivity criteria, but how the leakage delay affects the stability is not discussed. In our example, simulations have been given and proved that leakage delay can cause effect on the stability of neural networks.Example 3.
Consider a two-neuron stochastic neural network with Markovian jump parameters and mixed time delays (56) with the following parameters [43]:Mode 1(67)
A
1
=
4
0
0
3
,
W
01
=
0
-
0.5
0.5
0
,
W
1
=
0.4
-
0.5
0.5
0
,
Σ
11
=
0.2
0
0
0.5
,
Σ
12
=
0.5
0
0
0.2
,
Σ
13
=
0.3
0
0
0.2
.
Mode 2(68)
A
2
=
3
0
0
4.5
,
W
02
=
0
1
-
1
1
,
W
12
=
-
1
-
1
1
-
2
,
Σ
21
=
0.4
0
0
0.2
,
Σ
22
=
0.2
0
0
0.3
,
Σ
23
=
0.2
0
0
0.4
.Let the Markov process governing the mode switching have generator(69)
∏
=
-
1
1
0.5
-
0.5
.We take f
j
x
j
=
tanh
⁡
(
x
j
), α
=
0.5, μ
=
0.5, β
=
0.6, and τ
t
=
0.7
+
0.1
cos
⁡
(
t
); by solving the LMI in Theorem 13, the following feasible solutions can be obtained:(70)
P
1
=
112.9775
-
8.7790
-
8.7790
148.8517
,
P
2
=
143.0854
-
14.0663
-
14.0663
105.4530
,
Q
1
=
357.2075
-
34.0926
-
34.0926
340.8987
,
Q
2
=
246.3834
-
36.6553
-
36.6553
210.3547
,
Q
3
=
117.8358
-
22.8272
-
22.8272
152.6593
,
Q
4
=
105.2710
-
9.7393
-
9.7393
117.4932
,
Q
5
=
144.1946
17.5976
17.5976
181.2422
,
R
1
=
73.0134
-
23.6982
-
23.6982
86.0642
,
R
3
=
48.8051
-
13.1574
-
13.1574
25.3595
,
R
4
=
221.0378
10.8347
10.8347
212.3304
,
γ
=
414.5897
,
λ
1
=
416.0385
,
λ
2
=
437.0104
,
ϵ
1
=
434.0883
,
ϵ
2
=
184.0411
.At the same time, in order to testify the less conservatism of our method, the allowable upper bounds of τ with different values of μ have been compared with that in [43]; the results are shown in Table 6.
From Table6, we can see that even μ
>
1; our methods can improve existing research results.
On the other hand, we selectx
(
0
)
=
[
0.6
,
-
0.4
]
T and u
(
t
)
=
[
sin
⁡
t
,
t
∗
cos
⁡
(
t
)
]
T, and the following simulation results can be obtained. Figure 5 shows the state curve of system (56) with u
(
t
), Figure 6 shows the state curve of system (56) without u
(
t
), and Figure 7 shows the state switching modes of system (56), so the simulation results further prove that the two-neuron stochastic neural networks with Markovian switching parameters is passive in the sense of Definition 4.Table 6
Allowable upper bounds ofτ with different values of μ; α
=
0.5 and β
=
0.6.
μ
0
0.4
0.8
1.1
[43]
0.3025
0.2946
0.1886
0.1826
Theorem13
0.8226
0.6357
0.4786
0.2839Figure 5
State curves of system (55) with input.Figure 6
State curves of system (55) without input.Figure 7
The Markov chain of system (55).


## 5. Conclusions

In this paper, we have investigated the passivity problem for a class of stochastic neural networks systems (SNNs) with varying delay and leakage delay. By constructing a novel Lyapunov functional and utilizing the delay fractionizing technique, new passivity conditions have been established to achieve the passivity performance. Moreover, in derivation of the passivity criteria, it is assumed that the description of the activation functions is more general than the commonly used Lipschitz conditions; the time-varying delay is divided into several subintervals; two adjustable parameters are introduced so that more information about time delay has been utilised. Finally, examples and simulations are provided to illustrate the impact of leakage delay on stability of neural networks and the less conservatism of the developed approach.



---

*Source: 389250-2015-08-05.xml*