Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2013, Article ID 728606, 16 pages
Research Article

Synchronization of Switched Complex Bipartite Neural Networks with Infinite Distributed Delays and Derivative Coupling

1Department of Mathematics and Physics, Jiangsu University of Science and Technology, Zhenjiang 212003, China
2Department of Mathematics, Southeast University, Nanjing 210096, China
3Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia
4Department of Mathematics, Jiangsu University, Zhenjiang 212003, China
5Faculty of Economics and Management, Nanjing University of Aeronautics & Astronautics, Nanjing 212096, China

Received 7 March 2013; Accepted 8 April 2013

Academic Editor: Hongli Dong

Copyright © 2013 Qiuxiang Bian et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


A new model of switched complex bipartite neural network (SCBNN) with infinite distributed delays and derivative coupling is established. Using linear matrix inequality (LMI) approach, some synchronization criteria are proposed to ensure the synchronization between two SCBNNs by constructing effective controllers. Some numerical simulations are provided to illustrate the effectiveness of the theoretical results obtained in this paper.

1. Introduction

In recent years, neural networks have been intensively studied due to their potential applications in many different areas such as signal and image processing, content-addressable memory, optimization, and parallel computation [13]. Bidirectional associative memory (BAM) neural networks were first proposed by Kosko in [4, 5]. This class of networks has good applications in pattern recognition, solving optimization problems, and automatic control engineering. A large number of results on the dynamical behavior of BAM neural networks have been reported [69].

Switched systems, as an important kind of hybrid systems, have drawn considerable attention of researchers because of their theoretical significance and practical applications [1012]. Switched systems are composed of a family of continuous-time or discrete-time subsystems and a rule that specifies the switching among them [13, 14]. Recently, the switched neural networks, whose individual subsystems are a set of neural networks, have found applications in the field of high speed signal processing, artificial intelligence, and biology, so there are many theoretical results about the switched neural networks [1517].

Complex networks, which are a set of interconnected nodes with specific dynamics, have sparked the interest of many researchers from various fields of science and engineering such as the World Wide Web, electrical power grids, global economic markets, sensor networks; for example, see [1820] and references therein. Bipartite networks are an important kind of complex networks, whose nodes can be divided into two disjoint nonempty sets such that every edge only connects a pair of nodes, which belong to different sets. Many real-world networks are naturally bipartite networks, such as the papers-scientists networks [21] and producer-consumer networks [22]. Recently, authors [23] have introduced a bipartite-graph complex dynamical network model that is only linearly coupled and has no delays. It is well known that time delays exist commonly in real-world systems. Therefore, many models of coupled networks with coupling delays are proposed, for example, constant single time delay [24], time-varying delays [25], and mix-time delays [26]. On the other hand, the coupled network often occurs in other forms, for example, nonlinearly coupled networks [27] and linearly derivative coupled networks [28]. In [29], a general model of bipartite dynamical network (BDN) with distributed delays and nonlinear derivative coupling was introduced. Synchronization of complex networks has been intensively investigated since they can be applied in power system control, secure communication, automatic control, chemical reaction, and so on [3032]. The study of synchronization of coupled neural networks is an important step for both understanding brain science and designing coupled neural networks for practical use. Yu et al. [33] consider the synchronization of switched linearly coupled neural networks with constant delays, but the controllers are complex and changed with the switched rule. Synchronization of two coupled BDNs was investigated by adaptive method [29], but the controllers are complicated and the model does not include infinite distributed delays coupling and switching. Extending BAM neural networks to complex networks, we get complex bipartite dynamical networks (CBDNs). The dynamics of individual node in CBDNs is switched system and the switched coupling is considered; switched complex bipartite neural network (SCBNN) can be obtained. To the best of our knowledge, up to now, there is not any work that discusses the synchronization problem in SCBNN.

Motivated by the previous discussion, we first proposed a model of SCBNN, and then investigated the synchronization between two SCBNNs with infinite distributed delays and derivative coupling. Using adaptive controllers and linear matrix inequality (LMI) approach, some synchronization criteria are proposed to ensure the synchronization between two coupled SCBNNs. In our paper, the proposed controllers are simpler and do not change with the switched rule, which can be realize more easily.

The paper is organized as follows. In Section 2, a model of SCBNN with infinite distributed delays and derivative coupling is presented, and some hypotheses and lemmas are given too. In Section 3, several synchronization criteria on the SCBNNs are deduced. In Section 4, numerical examples are given to demonstrate the effectiveness of the proposed controller design methods in Section 3. Finally, conclusions are given in Section 5.

Notations. Throughout this paper, and denote the maximum eigenvalue and minimum eigenvalue of a real symmetric matrix, respectively. The notation denotes the symmetric block.

2. Model Description, Assumptions, and Lemmas

Consider a complex bipartite dynamical network (CBDN) consisting of two disjoint nonempty node sets and . Suppose that and , , are integer. The coupled network is described as follows: where , denotes the state variables of nodes and , respectively. and are diagonal matrices with . are weight matrices, are delayed weight matrices, , , , , , , corresponds to the boundedness activation functions of neurons. , are the delay kernel functions. , and are time delays. and express infinite distributed delays. and are the constant external input vectors. The matrix is the delayed weight coupling matrix denoting coupling strength between nodes. If there is a connection from node to , then ; otherwise, and the matrix satisfies the sum of every row being zero. The definitions of the other coupling matrixes , , ,, and are similar to that of matrix ; hence, they are omitted here.

In this paper, we consider a class of switched complex bipartite neural network with infinite distributed delays and derivative coupling, which is described as follows: where switching signal is piecewise constant functions, which is a value in the finite set . This means that the matrices are allowed to take values at particular time, in a finite set . We define the function as follows: It follows that under any switching rules . Model (2) can be written as The response network of the drive network (4) is where and are the control inputs.

Let , , , and . The error dynamical system of (4) and (5) is given by where

In this paper, the following assumptions and lemmas are needed. There exist diagonal matrices and , such that and , , and . There exist diagonal matrices and , such that and , , , and  ., , , , , and are differential functions with , , , , , and . are real-value nonnegative continuous functions defined in satisfying

Lemma 1 (see [34]). Given any real matrices , , and of appropriate dimensions and a scalar such that , then the following inequality holds:

Lemma 2 (see [35]). Given a positive definite matrixand a symmetric matrix , then

Lemma 3 (Schur complement). Given constant symmetric matrices , , and , where and , then if and only if
For convenience, let

3. Main Results

Theorem 4. Under assumptions , the two coupled SCBNNs (4) and (5) can be synchronized, if there exist positive constants, , positive matrices , , , , , and diagonal positive matrices , , such that and the adaptive feedback controllers are designed as where , , , , and .

Proof. For the error dynamical system (6), we design the following Lyapunov-Krasovskii function: where Calculating the derivative of (22) along the trajectories of (6), we have By Lemma 1, we can get from By assumptions and , it is obvious that Observe that Using inequality we have Using Lemma 2 and condition (17), we get Substituting (20) into (24) and combining (24)–(31), it can be derived by condition (18) that where .
Meanwhile, by a similar process, the following inequality can be true: where .
By condition (17), we have By (15)-(16) and Lemma 3 (Schur complement), it can be obtained that ,. Set , where then , and Therefore, is nonincreasing in . One has bounded since , so exists and From (22)-(23) and conditions , and we have , so is bounded. According to error system (6), is bounded for due to the boundedness of activation functions. From the above we can see that and . By using Barbǎlat lemma (see [36]), one has , so the two SBNNs (4) and (5) can obtain synchronization under the controllers (20). This completes the proof.

We take CBDN (1) as drive network. The response network of the drive network (1) is where are the control inputs.

From Theorem 4, we can get the following corollary.

Corollary 5. Under assumptions , the two coupled CBDNs (1) and (38) can be synchronized, if there exist positive constants , positive matrices , , , , , and diagonal positive matrices , , , such that and the adaptive feedback controllers are designed as where ,  .

Remark 6. From Corollary 5, we can easily get that the controllers in this paper are simpler than those of Theorem 1 in [29].

Remark 7. If the coupling matrix of the SCBNN is not a diffusive matrix satisfying the sum of every row being zero, we can still obtain the same result from the proof of Theorem 4.
Theorem 8 presents another sufficient condition to ascertain that the two networks (4) and (5) can be synchronized, using the following simple adaptive feedback controllers: where , , and are positive constants.
Let then the error dynamical system of (6) becomes

Theorem 8. Under assumptions and using the adaptive feedback controllers (41), the two coupled SCBNNs (4) and (5) can be synchronized, if there exist positive matrices ,,, and diagonal positive matrices , , , , , , , such that for , the following matrix inequalities hold: