Abstract
This paper investigates the synchronization problem for a class of memristive chaotic neural networks with time-varying delays. Based on te Wirtinger-based double integral inequality, two novel inequalities are proposed, which are multiple integral forms of the Wirtinger-based integral inequality. Next, by applying the reciprocally convex combination approach for high order case and a free-matrix-based inequality, novel delay-dependent conditions are established to achieve the synchronization for the memristive chaotic neural networks. The results are based on dividing the bounding of activation function into two subintervals with equal length. Finally, a numerical example is provided to demonstrate the effectiveness of the theoretical results.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
1 Introduction
Based on physical symmetry arguments, Chua [7] predicted that besides the resistor, capacitor and inductor, there should be a fourth fundamental two-terminal circuit element called memristor (short for memory and resistor), which is defined by a nonlinear relationship between charge and flux linkage. About 40 years later, members of the Hewlett–Packard Laboratories [31] realized the memristor as a TiO\(_2\) nanocomponent. The memristor is a two-terminal passive device whose value depends on the magnitude and polarity of the voltage applied to it and the length of the time that the voltage has been applied. In other words, the memristor has variable resistance and exhibits the memory characteristics. For these properties, it is shown that the memristor device has many promising applications such as device modeling, signal processing, one of which is to emulate synaptic behavior. As well-known, artificial neural networks can be realized by nonlinear circuits. In the circuits, the connection weights are implemented by fixed value resistors, which are supposed to represent the strength of synaptic connections between neurons in brain. The strength of synapses changes and accords with Hebbian learning rule while the resistance is invariable [30]. In order to simulate the artificial neural network of human brain better, the resistor is replaced by the memristor, which leads to a new model of neural networks: memristor-based neural networks.
In the last two decades, synchronization of chaos has been extensively studied. In the seminal paper [26], Pecora and Carroll first found that two chaotic trajectories with different initial conditions can be synchronized. Since then researchers around the world have been actively engaged in discovering different possible synchronization scenario of chaos and have presented many types of synchronization approach due to their potential applications in secure communication, biological networks, chemical reactions, biological neural networks, information processing, etc [1, 12, 13, 19–22, 27, 28, 34–37, 46–52]. Recently, some achievements about synchronization control of memristor-based neural networks have been obtained. For instance, based on the drive-response concept, the differential inclusions theory and Lyapunov functional method, Wu et al. [39] derived a delay-dependent feedback controller to achieve the exponential synchronization for memristor-based recurrent neural networks with time delays by use of linear matrix inequalities (LMIs), Wang et al. [32] established several sufficient conditions to guarantee the exponential synchronization for coupled memristive neural networks with time delays also by applying LMIs approach, Mathiyalagan et al. [23] proposed feedback controller gains to guarantee the exponential synchronization for delayed impulsive memristive BAM neural networks by using a time-varying Lyapunov function and LMIs technique, Wang et al. [33] obtained a sufficient condition to guarantee the exponential synchronization for a class of memristive chaotic neural networks with mixed delays and parametric uncertainties by using the comparison principle and LMIs form, Song et al. [30] designed two kinds of feedback controllers and gave one new algebraic criterion and a matrix-dependent condition to ensure the exponential synchronization in the p-th moment of the stochastic memristive neural networks by means of the stochastic differential inclusions theory, Jiang et al. [10] presented several memoryless controllers to guarantee the exponential synchronization for a class of memristor-based recurrent neural networks by use of LMIs, Jiang et al. [14] proposed a few sufficient conditions for finite-time stability and finite-time synchronization for a kind of memristor-based neural network with the designed controller by utilizing the matrix-norm inequality and LMIs.
However, the results of [4, 10, 14, 30, 32, 33, 38–40, 44, 45] on synchronization or anti-synchronization control of delayed memristor-based neural networks were obtained under the following typical assumption:
As was pointed out in [41, 42] that this assumption holds only when f(x(t)) and f(y(t)) have different signs or \(f(x(t))f(y(t))=0.\) Hence, these results are useless to the theory and application in engineering. To establish effective synchronization conditions remains challenging.
During the past decade, the Jensen inequality [11] has been intensively used in the context of time-delay or sampled-data systems since it is an appropriate tool to derive tractable stability conditions expressed in terms of LMIs. Recently, Fang and Park [8] introduced a multiple integral form of the Jensen inequality. To reduce conservatism, Seuret and Gouaisbaut [29] presented a Wirtinger-based integral inequality which encompasses the Jensen one and significantly improves existing ones; Park et al. [24] and Lee et al. [17] established double and multiple integral form of the Wirtinger-based integral inequality respectively, which encompass the Jensen ones [8, 11] and obtains more tighter lower bounds of double and multiple integral terms. In order to further reduce conservatism, very recently, Zeng et al. [43] developed a free-matrix-based inequality which encompasses the Wirtinger-based inequality [29] and is more tighter than existing ones.
Motivated by aforementioned discussion, in this paper we study the synchronization problem for a class of delayed memristive chaotic neural networks. First, based on the Wirtinger-based double integral inequality (see Lemma 2), two novel inequalities (see Lemma 1) are proposed, which are multiple integral forms of the Wirtinger-based integral inequality [29]. Next, by applying the reciprocally convex combination approach for high order case (see Lemma 6), a free-matrix-based inequality (see Lemma 5), novel delay-dependent conditions are established to achieve the synchronization for the memristive chaotic neural networks. All the results are based on dividing the bounding of activation function into two subintervals with equal length. Finally, a numerical example is provided to demonstrate the effectiveness of the theoretical results.
Notation: Throughout this paper, solutions of all the systems considered in the following are intended in Filippov’s sense, where [a, b] represents the interval \(a\le t\le b.\) Let \(W^T,W^{-1}\) denote the transpose and the inverse of a square matrix W, respectively. Let \(W>0\)(<0) denote a positive (negative) definite symmetric matrix, \(I_{n},\ 0_{n}\) denote the identity matrix and the zero matrix of \(n-\)dimension respectively, \(0_{m\times n}\) denotes the \(m\times n\) zero matrix, the symbol “*” denotes a block that is readily inferred by symmetry. The shorthand \(\mathrm{col}\{M_1,M_2,\ldots ,M_k\}\) denotes a column matrix with the matrices \(M_1,M_2,\ldots ,M_k.\) sym(A) is defined as \(A+A^T,\) \(\mathrm{diag}\{\cdot \}\) stands for a diagonal or block-diagonal matrix, \(\mathbb {N}=\{1,2,\ldots ,n\}.\) For \(\chi>0, \mathcal {C}\big ([-\chi ,0];\mathbb {R}^n\big )\) denotes the family of continuous functions \(\phi\) from \([-\chi ,0]\) to \(\mathbb {R}^n\) with the norm \(||\phi ||=\sup _{-\chi \le s\le 0}|\phi (s)|.\) Matrices, if not explicitly stated, are assumed to have compatible dimensions.
2 Problem description
The memristor-based recurrent neural network can be implemented by very large scale of integration circuits and the connection weights are implemented by the memristors. By Kirchoff’s current law, a general class of memristor-based recurrent neural networks can be written in the form as:
with initial conditions \(x_i(t)=\varphi _i(t)\in \mathcal {C}\big ((-\infty ,0];\mathbb {R}\big ),\) where \(i\in \mathbb {N},n\) corresponds to the number of units in a neural network, \(x_i(t)\) is the voltage of the capacitor \(\mathbf {C}_i\), \(c_i>0\) represents the rate with which the i-th unit will reset its potential to the resting state in isolation when disconnected from the network and external inputs at time instant t, \(f_j(\cdot )\) is the feedback function, \(\tau (t)\) is the discrete transmission time-varying delay satisfying \(0\le \tau (t)\le \bar{\tau },\) where \(\bar{\tau }\) is a real constant. \(a_{ij}(x_i(t)),b_{ij}(x_i(t))\) represent the memristive synaptic weights, and
where \(\mathbf {M}_{ij},\widetilde{\mathbf {M}}_{ij}\) are the memductance of the resistor \(\mathbf {R}_{ij},\widetilde{\mathbf {R}}_{ij}\) respectively. \(\mathbf {R}_{ij}\) denotes the resistor between the continuous feedback function \(f_i(x_i(t))\) and \(x_i(t)\); \(\widetilde{\mathbf {R}}_{ij}\) denotes the resistor between the feedback function \(f_i(x_i(t-\tau (t)))\) and \(x_i(t)\). \(\mathbf {J}_i\) denotes the external input or bias from outside the neural networks at time instant t.
As well-known, \(a_{ij}(x_j(t)),b_{ij}(x_j(t))\) will change as pinched hysteresis loops change [5]. According to the feature of the memristor and the current–voltage characteristics, we have
and \(a_{ij}(\pm T_j)=\acute{a}_{ij}\) or \(\grave{a}_{ij},\) \(b_{ij}(\pm T_j)=\acute{b}_{ij}\) or \(\grave{b}_{ij},\) where switching jumps \(T_j>0,\acute{a}_{ij},\grave{a}_{ij},\acute{b}_{ij},\grave{b}_{ij}(i,j\in \mathbb {N})\) are known constants. To state conveniently, we denote \(\underline{a}_{ij}=\min \{\acute{a}_{ij},\grave{a}_{ij}\},\bar{a}_{ij}=\max \{\acute{a}_{ij},\grave{a}_{ij}\},\) \(\underline{b}_{ij}=\min \{\acute{b}_{ij},\grave{b}_{ij}\},\bar{b}_{ij}=\max \{\acute{b}_{ij},\grave{b}_{ij}\}.\)
To ensure the existence of the equilibrium point of system (1), the following assumption is given.
Assumption 1
The neural activation functions are bounded, \(f_j(\pm T_j)=0,\) and satisfy the following Lipschitz conditions with Lipschitz constants \(\sigma _j>0\)
For notational simplicity, we denote \(\Sigma =\mathrm{diag}\{\sigma _1,\sigma _2,\ldots ,\sigma _n\}.\)
Throughout this paper, we will use the definitions in the sequel:
Definition 1
([3]) Suppose \(E \subseteq \mathbb {R}^n,\) then \(x\rightarrow F(x)\) is called a set-valued map, if for each point \(x\in E,\) there exists a nonempty set \(F(x)\subseteq \mathbb {R}^n.\) A set-valued map F with nonempty values is said to be upper semi-continuous at \(x_0\in E,\) if for any open set N containing \(F(x_0),\) there exists a neighborhood M of \(x_0\) such that \(F(M)\subseteq N.\) The map F(x) is said to have a closed (convex, compact) image if for each \(x\in E,\ F(x)\) is closed (convex, compact).
Definition 2
([9]) For the system \(\dot{x}(t)=F(x),\ x\in \mathbb {R}^n\) with discontinuous right-hand sides, a set-valued map is defined as follows:
where \(\mathrm{co}\{G\}\) is the closure of the convex hull of set \(G,B(x,\delta )=\{y:\Vert y-x\Vert \le \delta \},\) and \(\mu (E)\) is the Lebesque measure of set E. A solution in Filippov’s sense of the Cauchy problem for this system with initial condition \(x(0)=x_0\) is an absolutely continuous function \(x(t), t\in [0,T], 0 < T\le \infty ,\) which satisfies \(x(0)=x_0\) and differential inclusion:
Since the system (1) is a differential equation with discontinuous right-hand side, its solution in the conventional sense does not exist. Based on the theory of differential inclusions and the definition of Filippov solution [9], the model (1) can be rewritten as the following differential inclusion:
Obviously, \(\Phi (s)\) is an upper semi-continuous, closed, convex and bounded set-valued map for all \(s\in \mathbb {R}\). From [2, 18] there exists a Filippov solution for the model (1) with Assumption 1.
The system (1) is considered as a drive system. Based on the drive-response concept for synchronization of coupled chaotic systems, which was initially proposed by Pecora and Carroll in [26], the corresponding response system of (1) is given in the following form:
with initial conditions \(y_i(t)=\phi _i(t)\in \mathcal {C}\big ((-\infty ,0];\mathbb {R}\big ),\) where \(u_i(t)\in \mathbb {R}\) is the state feedback controller given to achieve the synchronization between the drive system and the response system.
Let \(e_i(t)=y_i(t)-x_i(t)\) be the synchronization error and from the theory of differential inclusion, we can get the synchronization error system as follows:
In this paper, the control input vector with state feedback is designed as follows:
where \(u(t)=(u_1(t),u_2(t),\ldots ,u_n(t))^T\in \mathbb {R}^n,\ e(t)=(e_1(t),e_2(t),\ldots ,e_n(t))^T\in \mathbb {R}^n.\) For convenience, we denote \(g_j(e_j(t))=f_j(y_j(t))-f_j(x_j(t)).\) From Assumption 1, we obtain that
for any \(u,v\in \mathbb {R}.\)
Based on the results of Wirtinger-based integral inequality [29], Wirtinger-based double integral inequality [24] and Wirtinger-based multiple integral inequality [17], we introduce the following Wirtinger-based multiple integral inequality:
Lemma 1
(See Appendix I for a proof) Given a non-negative integer \(\imath\) and a positive definite matrix \(X\in \mathbb {R}^{n\times n}.\) For any continuous function \(\vartheta :[a, b]\rightarrow \mathbb {R}^n,\) the following inequality holds:
where
Especially, let \(\vartheta :[a, b]\rightarrow \mathbb {R}^n\) be differentiable and its derivative be continuous, then for any positive integer i and any positive definite matrix \(X\in \mathbb {R}^{n\times n},\) the following inequality holds:
where
Lemma 2
(Seuret et al. [29], Park et al. [24], Lee et al. [17]) Given a non-negative integer \(\imath\) and a positive definite matrix \(X\in \mathbb {R}^{n\times n}\). For any continuous function \(\vartheta :[a, b]\rightarrow \mathbb {R}^n\), the following inequality holds:
where
Especially, let \(\vartheta :[a, b]\rightarrow \mathbb {R}^n\) be differentiable and its derivative be continuous, then for any positive integer i and any positive definite matrix \(X\in \mathbb {R}^{n\times n},\) the following inequality holds:
where
Similar to the result of Ref. [17], we have the following conclusion:
Lemma 3
(See Appendix II for a proof) Let \(\lambda :[a, b]\rightarrow \mathbb {R}^n\) be continuous, i be a positive integer and c be a scalar with \(a<c<b.\) \(\rho _i(a,b,\lambda ),\beta _{i-1}(a,b,\lambda )\) are defined in Lemmas 2 and 3 respectively, then the following relations hold
In order to obtain the results, we need the following lemmas.
Lemma 4
(Chen et al. [6]) Under Assumption 1, the following inequalities hold for \(i,j\in \mathbb {N}\)
where \(\hat{a}_{ij}=\max \{|\underline{a}_{ij}|,|\bar{a}_{ij}|\},\hat{b}_{ij}=\max \{|\underline{b}_{ij}|,|\bar{b}_{ij}|\}.\) That is, for any \(\zeta _{ij}(x_j(t)),\zeta _{ij}(y_j(t))\in [\underline{a}_{ij},\bar{a}_{ij}],\ \varsigma _{ij}(x_j(t)),\) \(\varsigma _{ij}(y_j(t))\in [\underline{b}_{ij},\bar{b}_{ij}],\) we have
Lemma 5
(Zeng et al. [43]) Let \(\vartheta :[a, b]\rightarrow \mathbb {R}^n\) be differentiable and its derivative be continuous, for symmetric matrices \(R\in \mathbb {R}^{n\times n},\ X,Z\in \mathbb {R}^{3n\times 3n}\), and any matrices \(Y\in \mathbb {R}^{3n\times 3n},\ M,N\in \mathbb {R}^{3n\times n}\) such that
the following inequality holds:
where \(\varpi =\mathrm{col}\Big \{\vartheta ( b),\vartheta (a),\frac{1}{ b-a}\int ^{b}_{a}{\vartheta }(s)\mathrm{d}s\Big \}.\)
Lemma 6
(High order reciprocally convex combination, Kim et al. [25], Lee et al. [17]) Given a positive integer k, two positive scalars p, q such that \(p+q=1.\) Assume that definite nonnegative symmetric constant matrices \(X,Y\in \mathbb {R}^{n\times n}\) and real constant matrices \(S_i\in \mathbb {R}^{n\times n}\) \((i=1,2,\ldots ,k)\) satisfy
then for any two vectors \(\alpha ,\beta \in \mathbb {R}^{n},\) the following inequality holds
where \(\Big (\begin{array}{ll} k\\ i\end{array}\Big )=\frac{k!}{i!(k-i)!}.\)
3 Main results
Before presenting our results, for notational simplicity, we denote \(g(e(t))=(g_1(e_1(t)),g_2(e_2(t)),\ldots ,g_n(e_n(t)))^T,\) \(e_{t}=e(t),e_{\tau }=e(t-\tau (t)),e_{\bar{\tau }}=e(t-\bar{\tau }),\) and introduce a new vector as:
From the mean-value theorem for integral, it follows that
for any positive integer i. Therefore \(\eth (t)\) can be well defined for \(\tau (t)=0\) or \(\tau (t)=\bar{\tau }\).
Let \(\eta _j\in \mathbb {R}^{n\times (4m+7)n}\) be block matrix entries, i.e. \(\eta _j=\big [\begin{array}{lll} 0_{n\times (j-1)n}&I_n&0_{n\times (4m+7-j)n}\end{array}\big ],\ j=1,2,\ldots ,4m+7.\) When the control feedback matrices \(G_1,G_2\) are given, we have the following synchronization result for error system (3).
Theorem 1
(See Appendix IV for a proof) Suppose that Assumption 1 holds. Given positive integer m, constant scalars \(\mu ,\bar{\tau }>0,\) and the control law (4). The controlled slave system (2) is globally asymptotically synchronized with the master system (1) for any \(0\le \tau (t)\le \bar{\tau },\) \(\dot{\tau }(t)\le \mu ,\) if there exist positive definite matrices \(K,\mathcal {Q},\mathcal {R},\mathcal {S},U_i,M_i,Y,\mathcal {Z},\) positive diagonal matrices \(P,W_j,L_j(j=1,2,\ldots ,6),\) positive scalars \(\varepsilon _1,\varepsilon _2,\) real symmetric matrices \(D_1,D_2,\) and real matrices \(H_k,E_k(k=1,\ldots ,5),\ \mathcal {Y},\Phi _{il},\Psi _{il}\) such that the following LMIs hold
where
with
Remark 1
By dividing the interval satisfied by the activation function into two equal subintervals (40) and (51), the information of the activation function is taken fully into account. This may lead to high effective results.
In order to show the design of the estimate gain matrices \(G_1,G_2\), we propose the following result.
Theorem 2
Suppose that Assumption 1 holds. Given positive integer m, constant scalars \(\mu\) and \(\bar{\tau }>0\). The controlled slave system (2) is globally asymptotically synchronized with the master system (1) for any \(0\le \tau (t)\le \bar{\tau },\) \(\dot{\tau }(t)\le \mu ,\) if there exist positive definite matrices \(K,\mathcal {Q},\mathcal {R},\mathcal {S},U_i,M_i(i=1,2,\ldots ,m),Y,\mathcal {Z},\) positive diagonal matrices \(P,W_j,L_j(j=1,2,\ldots ,6),\) positive scalars \(\varepsilon _1,\varepsilon _2,\) real symmetric matrices \(D_1,D_2,\) and real matrices \(P_1,P_2,H_k,E_k(k=1,\ldots ,5),\ \mathcal {Y},\Phi _p,\Psi _p(p=1,2,3,4)\) such that inequalities (11)–(16) and the following LMIs hold
where \(\widehat{\Xi }=\mathrm{sym}\big \{\eta _7^T(P_1\eta _1+P_2\eta _2)\big \},\) and the other parameters are all the same as those defined in Theorem 1. Moreover, the estimation gain matrices are \(G_l=P^{-1}P_l,l=1,2.\)
Proof
Let \(P_l=PG_l(l=1,2)\) and following the same line as in Theorem 1, we can conclude the result of Theorem 2. \(\square\)
Remark 2
Note that the inequality (10) of Lemma 5 is composed of a set of slack variables, which provides extra freedom and may be less conservative than others in the literature. It is worth mentioning that the Wirtinger-based inequality proposed in Lemma 2 [29], which is shown more tighter than the well-known Jensen inequality, is a special case of (10). Thus Theorems 1 and 2, which are established by means of Lemma 5, may lead to less conservative result.
When the time varying delay \(\tau (t)\) is not differentiable or \(\dot{\tau }(t)\) is unknown, the results in Theorems 1, 2 are no longer applicable. For this case, from the proofs of Theorems 1, 2 one can obtain the following corollaries.
Corollary 1
Suppose that Assumption 1 holds. Given positive integer m, constant scalars \(\bar{\tau }>0,\) and the control law (4). The controlled slave system (2) is globally asymptotically synchronized with the master system (1) for any \(0\le \tau (t)\le \bar{\tau },\) if there exist positive definite matrices \(K,\mathcal {R},\mathcal {S}, U_i,M_i(i=1,2,\ldots ,m),Y,\mathcal {Z},\) positive diagonal matrices \(P,W_j,L_j(j=1,2,\ldots ,6),\) real symmetric matrices \(D_1,D_2,\) and real matrices \(H_k,E_k(k=1,\ldots ,5), \mathcal {Y},\Phi _p,\Psi _p(p=1,2,3,4)\) such that (11)–(16) and the following LMIs hold
where the parameters are all the same as those defined in Theorem 1.
Corollary 2
Suppose Assumption that 1 holds. Given positive integer m and constant scalars \(\bar{\tau }>0.\) The controlled slave system (2) is globally asymptotically synchronized with the master system (1) for any \(0\le \tau (t)\le \bar{\tau },\) if there exist positive definite matrices \(K,\mathcal {R},\mathcal {S}, U_i,M_i(i=1,2,\ldots ,m),Y,\mathcal {Z},\) positive diagonal matrices \(P,W_j,L_j(j=1,2,\ldots ,6),\) real symmetric matrices \(D_1,D_2,\) and real matrices \(P_1,P_2,H_k,E_k(k=1,\ldots ,5), \mathcal {Y},\Phi _p,\Psi _p(p=1,2,3,4)\) such that (11)–(16) and the following LMIs hold
where the parameters are all the same as those defined in Theorem 2. Moreover, the estimation gain matrices are \(G_l=P^{-1}P_l,l=1,2.\)
4 Illustrative example
A simulation example will be given in this section to illustrate the effectiveness of the developed approach.
Example 1
Consider the 3-dimensional delayed memristor-based neural network (1) with the following parameters:
It is easy to see that the activation functions satisfy Assumption 1 with \(\Sigma =I_3\) and \(\mu =0.3,\bar{\tau }=0.6.\) If we set \(m=2,\) by resorting to the Matlab LMI Control Toolbox, we find that the LMIs in Theorem 2 are feasible and the control gain matrices are as follows
Figure 1 shows the neural network model has a chaotic attractor with initial values \(x_1(t)=0.5,\,x_2(t)=-0.5,\,x_3(t)=1.5,\ t\in [-1,0].\) The initial values of the response system are taken as \(y_1(t)=-0.5,\,y_2(t)=2.5,\,y_3(t)=-0.3,\ t\in [-1,0].\) Figures 2, 3 and 4 depict the phase trajectories of the drive system and response system, respectively. Figure 5 shows the error states. By numerical simulation, we can see that the dynamical behaviors of response system (2) synchronize with master system (1) as shown in Figs. 2, 3, 4 and 5.
It is easy to see that above activation functions do not satisfy the assumptions in [4, 10, 14, 38, 39, 44, 45]. Therefore the conditions of [4, 10, 14, 38, 39, 44, 45] fail to verify the synchronization of this example.
5 Conclusion
This paper deals with the synchronization problem for memristive chaotic neural networks with time-varying delays. Based on our proposed multiple integral forms of the Wirtinger-based integral inequality and the reciprocally convex combination approach for high order case, several novel delay-dependent conditions are established to achieve the synchronization for the memristive chaotic neural networks with time-varying delays. Also, the control gain matrices are obtained. One numerical example shows the effectiveness of the theoretical results.
References
Ashfaq RAR, Wang X-Z, Huang JZ, Abbas H, He Y (2016) Fuzziness based semi-supervised learning approach for intrusion detection system. Inf Sci. doi:10.1016/j.ins.2016.04.019
Aubin JP, Cellina A (1984) Differential inclusions. Springer, Berlin
Aubin JP, Frankowska H (1990) Set-valued analysis. Birkhauser, Boston
Bao H, Park JH, Cao J (2015) Matrix measure strategies for exponential synchronization and anti-synchronization of memristor-based neural networks with time-varying delays. Appl Math Comput 2701:543–556
Chandrasekar A, Rakkiyappan R, Cao J, Lakshmanan S (2014) Synchronization of memristor-based recurrent neural networks with two delay components based on second-order reciprocally convex approach. Neural Netw 57:79–93
Chen J, Zeng Z, Jiang P (2014) Global Mittag–Leffler stability and synchronization of memristor-based fractional-order neural networks. Neural Netw 51:1–8
Chua LO (1971) Memristor-the missing circuit element. IEEE Trans Circuit Theory 18:507–519
Fang M, Park JH (2013) A multiple integral approach to stability of neutral time-delay systems. Appl Math Comput 224:714–718
Filippov AF (1984) Differential equations with discontinuous right-hand side. Mathematics and its applications (Soviet Series). Kluwer Academic, Boston
Jiang M, Mei J, Hu J (2015) New results on exponential synchronization of memristor-based chaotic neural networks. Neurocomputing 156:60–67
Gu K (2000) An integral inequality in the stability problem of time-delay systems. In: Proceedings of 39th IEEE conference decision and control, pp 2805–2810
He Y, Liu JNK, Hu Y, Wang X-Z (2015) OWA operator based link prediction ensemble for social network. Exp Syst Appl 42(1):21–50
He Y, Wang X-Z, Huang JZ (2016) Fuzzy nonlinear regression analysis using a random weight network. Inf Sci 364–365:222–240
Jiang M, Wang S, Mei J, Shen Y (2015) Finite-time synchronization control of a class of memristor-based recurrent neural networks. Neural Netw 63:133–140
Kim SH, Park P, Jeong CK (2010) Robust H\(_\infty\) stabilisation of networks control systems with packet analyser. IET Control Theory Appl 4:1828–1837
Kwon OM, Lee SM, Park JH, Cha EJ (2012) New approaches on stability criteria for neural networks with interval time-varying delays. Appl Math Comput 218(19):9953–9964
Lee TH, Park JH, Park M-J, Kwon O-M, Jung H-Y (2015) On stability criteria for neural networks with time-varying delay using Wirtinger-based multiple integral inequality. J Frank Inst 352(12):5627–5645
Leine RI, Van Campen DH, Van De Vrande BL (2000) Bifurcations in nonlinear discontinuous systems. Nonlinear Dyn 23(1):105–164
Lin D, Liu H, Song H, Zhang F (2014) Fuzzy neural control of uncertain chaotic systems with backlash nonlinearity. Int J Mach Learn Cyber 5(5):721–728
Lin D, Wang X-Y (2010) Observer-based decentralized fuzzy neural sliding mode control for interconnected unknown chaotic systems via network structure adaptation. Fuzzy Sets Syst 161(15):2066–2080
Lin D, Zhang F, Liu J-M (2014) Symbolic dynamics-based error analysis on chaos synchronization via noisy channels. Phys Rev E 90(1):012908–012908
Liu Z, Zhang H, Zhang Q (2010) Novel stability analysis for recurrent neural networks with multiple delays via line integral-type L-K functional. IEEE Trans Neural Netw 21(11):1710–1718
Mathiyalagan K, Park JH, Sakthivel R (2015) Synchronization for delayed memristive BAM neura using impulsive control with random nonlinearities. Appl Math Comput 259:967–979
Park MJ, Kwon OM, Park JH, Lee SM, Cha EJ (2015) Stability of time-delay systems via Wirtinger-based double integral inequality. Automatica 55(1):204–208
Park P, Ko JW, Jeong C (2011) Reciprocally convex approach to stability of systems with time-varying delays. Automatica 47(1):235–238
Pecora L, Carroll T (1990) Synchronization in chaotic systems. Phys Rev Lett 64:821–824
Rakkiyappan R, Dharani S, Zhu Q (2015) Stochastic sampled-data H-infinity synchronization of coupled neutral-type delay partial differential systems. J Franklin Inst 352(10):4480–4502
Rakkiyappan R, Dharani S, Zhu Q (2015) Synchronization of reaction-diffusion neural networks with time-varying delays via stochastic sampled-data controller. Nonlinear Dyn 79(1):485–500
Seuret A, Gouaisbaut F (2013) Wirtinger-based integral inequality: application to time-delay systems. Automatica 49:2860–2866
Song Y, Wen S (2015) Synchronization control of stochastic memristor-based neural networks with mixed delays. Neurocomputing 156:121–128
Struko DB, Snider GS, Stewart GR, Williams RS (2008) The missing memristor found. Nature 453:80–83
Wang G, Shen Y (2014) Exponential synchronization of coupled memristive neural networks with time delays. Neural Comput Appl 24(6):1421–1430
Wang X, Li C, Huang T, Chen L (2015) Dual-stage impulsive control for synchronization of memristive chaotic neural networks with discrete and continuously distributed delays. Neurocomputing 149(B):621–628
Wang X-Y, Song J-M (2009) Synchronization of the fractional order hyperchaos Lorenz systems with activation feedback control. Commun Nonlinear Sci Numer Simul 14(8):3351–3357
Wang X-Y, He Y (2008) Projective synchronization of fractional order chaotic system based on linear separation. Phys Lett A 372(4):435–441
Wang X-Z (2015) Learning from big data with uncertainty–editorial. J Intell Fuzzy Syst 28(5):2329–2330
Wang X-Z, Ashfaq RAR, Fu A-M (2015) Fuzziness based sample categorization for classifier performance improvement. J Intell Fuzzy Syst 29(3):1185–1196
Wu A, Wen S, Zeng Z (2012) Synchronization control of a class of memristor-based recurrent neural networks. Inf Sci 183(1):106–116
Wu A, Wen S, Zeng Z, Zhu X, Zhang J (2011) Exponential synchronization of memristor-based recurrent neural networks with time delays. Neurocomputing 74(17):3043–3050
Wu A, Zeng Z (2013) Anti-synchronization control of a class of memristive recurrent neural networks. Commun Nonlinear Sci Numer Simul 18(2):373–385
Wu H, Li R, Yao R, Zhang X (2015) Weak, modified and function projective synchronization of chaotic memristive neural networks with time delays. Neurocomputing 149(B):667–676
Wu H, Li R, Zhang X, Yao R (2015) Adaptive finite-time complete periodic synchronization of memristive neural networks with time delays. Neural Process Lett 42(3):563–583
Zeng H-B, He Y, Wu M, She J (2015) Free-matrix-based integral inequality for stability analysis of systems with time-varying delay. IEEE Trans Autom Control 60(10):2768–2774
Zhang G, Shen Y (2013) New algebraic criteria for synchronization stability of chaotic memristive neural networks with time-varying delays. IEEE Trans Neural Netw Learn Syst 24(10):1701–1707
Zhang G, Shen Y, Yin Q, Sun J (2013) Global exponential periodicity and stability of a class of memristor-based recurrent neural networks with multiple delays. Inf Sci 232:386–396
Zhang H, Liu Z, Huang G-B, Wang Z (2010) Novel weighting-delay-based stability criteria for recurrent neural networks with time-varying delay. IEEE Trans Neural Netw 21(1):91–106
Zhang H, Yang F, Liu X, Zhang Q (2013) Stability analysis for neural networks with time-varying delay based on quadratic convex combination. IEEE Trans Neural Netw Learn Syst 24(4):513–521
Zhu Q, Cao J (2014) Mean-square exponential input-to-state stability of stochastic delayed neural networks. Neurocomputing 131:157–163
Zhu Q, Cao J (2012) Stability analysis of Markovian jump stochastic BAM neural networks with impulse control and mixed time delays. IEEE Trans Neural Netw Learn Syst 23(3):467–479
Zhu Q, Cao J (2012) Stability of Markovian jump neural networks with impulse control and time varying delays. Nonlinear Anal Real World Appl 13(5):2259–2270
Zhu Q, Cao J, Rakkiyappan R (2015) Exponential input-to-state stability of stochastic Cohen–Grossberg neural networks with mixed delays. Nonlinear Dyn 79:1085–1098
Zhu Q, Rakkiyappan R, Chandrasekar A (2014) Stochastic stability of Markovian jump BAM neural networks with leakage delays and impulse control. Neurocomputing 136:136–151
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (Grant Nos. 61273022, 61473070, 61433004), the Fundamental Research Funds for the Central Universities (Grant Nos. N130504002 and N130104001), and SAPI Fundamental Research Funds (Grant No. 2013ZCX01).
Appendices
Appendix I
1.1 Proof of Lemma 1
We utilize the mathematical induction to prove inequality (6). Let \(\imath =0,\) inequality (6) changes into the Wirtinger-based integral inequality [29]. That is, inequality (6) holds for \(\imath =0.\) Now assume that inequality (6) holds for \(\imath =k,\) that is, for any scalar \(s\ (a<s<b),\) the following inequality holds
where \(\varpi (s)=\mathrm{col}\big \{\rho _k(a,s,\vartheta ),\ \rho _{k+1}(a,s,\vartheta )\big \}\) and
Note that matrix \(X>0\), thus \(\Omega _{11}(s)=-\frac{2(k+2)k!}{(s-a)^{k+1}}X<0\) and \(\Omega _{22}(s)-\Omega _{21}(s)\Omega _{11}(s)^{-1}\Omega _{12}(s)=-\frac{(k+3)!}{2(s-a)^{k+3}}X<0\). Applying Schur Complements to \(\Omega (s)\) yields \(\Omega (s)<0\). By Schur Complements again, (21) is equivalent to the following inequality:
where
Since \(\widetilde{\Omega }_{22}(s)=\frac{2(s-a)^{k+3}}{(k+3)!}X^{-1}>0\) and \(\widetilde{\Omega }_{11}(s)-\widetilde{\Omega }_{12}(s)\widetilde{\Omega }_{22}(s)^{-1}\widetilde{\Omega }_{21}(s) =\frac{k+1}{2(k+2)!}X^{-1}>0,\) applying Schur Complements to \(\widetilde{\Omega }(s)\) leads to \(\widetilde{\Omega }(s)>0\).
Integrating (22) from a to b yields
where \(\int ^{b}_{a}\varpi (s)\mathrm{d}s=\mathrm{col}\big \{\rho _{k+1}(a,b,\vartheta ),\ \rho _{k+2}(a,b,\vartheta )\big \}\) and
Applying Schur Complements again to (23) yields
where
Simple calculating yields that (24) is equivalent to inequality (6) with \(\imath =k+1.\) This completes the proof.
Appendix II
1.1 Proof of Lemma 3
Equality (8) comes from Ref. [17], we only need to prove that equality (9) holds for any positive integer i. We utilize the mathematical induction again. Let \(i=1,\) (9) changes into the following equality
That is, equality (9) holds for \(i=1.\) Now assume that inequality (9) holds for \(i=k.\) Set \(\Gamma (s)=\int ^{s}_{a}\lambda (v)\mathrm{d}v,\) then \(\Gamma (s)\) is continuous on [a, b]. Based on the assumption of induction, we have
That is, inequality (9) holds for \(i=k+1.\) This completes the proof.
Appendix III
1.1 Proof of Theorem 1
Consider the following Lyapunov–Krasovskii functional candidate:
where
with \(\kappa (s)=\mathrm{col}\big \{e_s,\ g(e_s)\big \}, \nu (t)=\mathrm{col}\big \{e_t,\dot{e}(t)\big \}\) and \(\Omega _i(\cdot ,\cdot ,\cdot ,\cdot )(i=1,2,\ldots ,m)\) are defined in Lemma 1.
Calculating the time derivatives of \(V(e_t,t)\) along the trajectories of the error system (3), we obtain
where
where \(\Theta _i(\cdot ,\cdot ,\cdot ,\cdot )(i=0,1,\ldots ,m-1)\) are defined in Lemma 1.
When \(0<{\tau }(t)<\bar{\tau },\) by utilizing the Jensen integral inequality [11] and reciprocally convex combination [25], we obtain from (11) that
where \(\tilde{\kappa }(t)=\mathrm{col}\Big \{\int ^{t}_{t-{\tau }(t)}\kappa (s)\mathrm{d}s,\ \int ^{t-{\tau }(t)}_{t-\bar{\tau }}\kappa (s)\mathrm{d}s\Big \}.\)
Inspired by the work of [15], the following zero equalities with any symmetric matrices \(D_i(i=1,2)\) are proposed according to the Leibniz-Newton formula:
By utilizing the Jensen integral inequality [11] and reciprocally convex combination [25], we get from (12) that
where \(\tilde{\nu }(t)=\mathrm{col}\Big \{\int ^{t}_{t-{\tau }(t)}\nu (s)\mathrm{d}s,\ \int ^{t-{\tau }(t)}_{t-\bar{\tau }}\nu (s)\mathrm{d}s\Big \}.\)
Based on Lemma 5, from inequalities (13)–(14) we get that
where
Applying Lemma 3 yields
Based on Lemmas 2, 3 and 6, if conditions (15)-(16) hold, then by simple calculating we obtain from inequalities (34)-(35) that
where \(\psi '_\omega =\mathrm{col}\big \{\psi _{i-1}(t-\bar{\tau },t-\tau (t),{e}_t),\ \omega _{i-1}(t-\bar{\tau },t-\tau (t),{e}_t)\big \},\ \psi ''_\omega =\mathrm{col}\big \{\psi _{i-1}(t-\tau (t),t,{e}_t),\ \omega _{i-1}(t-\tau (t),t,{e}_t)\big \},\) \(\hbar '_\xi =\mathrm{col}\big \{\hbar _{i-1}(t-\tau (t),t,{e}_t),\ \xi _{i-1}(t-\tau (t),t,{e}_t)\big \},\ \hbar ''_\xi =\mathrm{col}\big \{\hbar _{i-1}(t-\bar{\tau },t-\tau (t),{e}_t),\ \xi _{i-1}(t-\bar{\tau },t-\tau (t),{e}_t)\big \}.\)
Based on (3), the following equalities hold for any positive diagonal matrix P:
where \(C=\mathrm{diag}\{c_1,c_2,...,c_n\},P=\mathrm{diag}\{p_1,p_2,...,p_n\}.\)
According to Lemma 4 and the Cauchy inequality \(2\alpha ^T\beta \le \alpha ^TQ\alpha +\beta ^TQ^{-1}\beta ,\) the following inequalities hold for any positive scalars \(\varepsilon _1,\varepsilon _2\):
where \(\hat{A}=\mathrm{diag}\big \{\sum ^n_{i=1}\hat{a}_{i1}^2,\ \sum ^n_{i=1}\hat{a}_{i2}^2,\ \ldots ,\ \sum ^n_{i=1}\hat{a}_{in}^2\big \},\ \hat{B}=\mathrm{diag}\big \{\sum ^n_{i=1}\hat{b}_{i1}^2,\ \sum ^n_{i=1}\hat{b}_{i2}^2,\ \ldots ,\ \sum ^n_{i=1}\hat{b}_{in}^2\big \}.\)
Inspired by the work of [16], the interval satisfied by the activation function is divided into the following two subintervals:
Case I:
It should be noted that the conditions (40) and (41) are equivalent to the following inequalities respectively:
Based on inequalities (42) and (43), the following matrix inequalities hold for any positive diagonal matrices \(W_i(i=1,\ldots ,6)\) with compatible dimensions:
Substituting (26)–(36) and (44)–(49) into (25) yields that
It is easy to see that inequality (50) holds for \({\tau }(t)=0\) or \({\tau }(t)=\bar{\tau }\) from the Jensen integral inequality [11]. Therefore, inequality (50) holds for any \(t>0\) with \(0\le {\tau }(t)\le \bar{\tau }\).
According to the Schur Complement, \(\Xi +\overline{\Xi }+\widetilde{\Xi }+\Xi _1+n\big (\varepsilon _1^{-1}+\varepsilon _2^{-1}\big )\eta _7^T{P}^2\eta _7<0\) is equivalent to inequality (17) with \(p=1.\) Therefore when condition (17) is satisfied for \(p=1\), from (50) we get that \(\dot{V}(e_t,t)<0.\) That is, error system (3) is asymptotically stable.
Case II:
It is obvious that the conditions (51) and (52) are equivalent to the following inequalities respectively:
From (53) and (54), the following matrix inequalities hold for any positive diagonal matrices \(L_i(i=1,\ldots ,6)\) with compatible dimensions:
Substituting (26)–(36) and (55)–(60) into (25) yields that
It is easy to see that inequality (61) holds for \({\tau }(t)=0\) or \({\tau }(t)=\bar{\tau }\) from the Jensen integral inequality [11]. Therefore, inequality (61) holds for any \(t>0\) with \(0\le {\tau }(t)\le \bar{\tau }\).
Again according to the Schur Complement, \(\Xi +\overline{\Xi }+\widetilde{\Xi }+\Xi _2+n\big (\varepsilon _1^{-1}+\varepsilon _2^{-1}\big )\eta _7^T{P}^2\eta _7<0\) is equivalent to inequality (17) with \(p=2.\) Therefore when condition (17) is satisfied for \(p=2,\) we conclude that the drive system (1) and response system (2) are synchronous. This completes the proof of Theorem 1.
Rights and permissions
About this article
Cite this article
Zheng, CD., Zhang, Y. & Wang, Z. Synchronization for memristive chaotic neural networks using Wirtinger-based multiple integral inequality. Int. J. Mach. Learn. & Cyber. 9, 1069–1083 (2018). https://doi.org/10.1007/s13042-016-0626-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13042-016-0626-8