2008
DOI: 10.1016/j.neunet.2008.09.002
|View full text |Cite
|
Sign up to set email alerts
|

Novel stability of cellular neural networks with interval time-varying delay

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
52
0

Year Published

2009
2009
2015
2015

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 104 publications
(53 citation statements)
references
References 26 publications
1
52
0
Order By: Relevance
“…Although the delay decomposition approach was extended to neural networks with time-varying delays [35], it should be noted out that the proposed method in [35] is based on the decomposition of the delay interval [−h 1 , 0], where h 1 is the lower bound of time-varying delay. It is clear that the delay decomposition idea can not applicable in [35] when h 1 = 0.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Although the delay decomposition approach was extended to neural networks with time-varying delays [35], it should be noted out that the proposed method in [35] is based on the decomposition of the delay interval [−h 1 , 0], where h 1 is the lower bound of time-varying delay. It is clear that the delay decomposition idea can not applicable in [35] when h 1 = 0.…”
Section: Resultsmentioning
confidence: 99%
“…In order to obtain the more effective passivity conditions, we firstly develop the direct delay decomposition approach by dividing the delay interval [−h, 0] into multiple time-varying segments, which is more general than some existing delay decomposition approach [32][33][34][35]. Secondly, the novel Lyapunov-Krasovskii functional is constructed by choosing proper functionals with different weight matrices corresponding to different segments.…”
mentioning
confidence: 99%
“…There is a more recent theorem (see [16] and also [25] for a slight variation of it) that can be considered as the generalization of the previous one, in the sense that the lower bound of the time delay is not equal to zero, as in most cases, but this delay is represented in two parts, a constant part 1 and a time varying part ( ) such that ( ) = 1 + ( ) under the condition 0 ( ) 2 − 1 . In this notation, we consider for simplicity that all the processing units have the same time delay function ( ), and that the time delay gets values in the interval 1 ( ) 2 .…”
Section: Proof the Proof Of The Above Theorem Is Based On Lemma 42mentioning
confidence: 99%
“…Methods for constructing a dedicated LKF include delaypartitioning idea [12][13][14][15][16][17][18][19][20], triple integral terms [16][17][18][19][20][21][22][23][24][25], more information on the activation functions [26], augmented vector [27,28], etc. The proposed methods for estimating the timederivative of LKF include: Park' inequality [29], Jensen's inequality [30], free-weighing matrices [31], and reciprocally convex optimization [32].…”
Section: Introductionmentioning
confidence: 99%