Share This Article:

Modified Function Projective Synchronization of Complex Networks with Multiple Proportional Delays

Abstract Full-Text HTML XML Download Download as PDF (Size:1018KB) PP. 537-549
DOI: 10.4236/am.2017.84043    745 Downloads   989 Views   Citations

ABSTRACT

This paper deals with the modified function projective synchronization problem for general complex networks with multiple proportional delays. With the existence of multiple proportional delays, an effective hybrid feedback control is designed to attain modified function projective synchronization of networks. Numerical example is provided to show the effectiveness of our result.

1. Introduction

In recent decades, synchronization as a popular research topic of complex networks has been widespread concern around the world [1] [2] [3] [4] . With the deepening of research on complex networks synchronization problems, the concept and theory of synchronization have been greatly developed, and many different types of synchronization concepts have been found and put forward. such as complete synchronization [5] , cluster synchronization [6] , lag synchro- nization [7] , generalized synchronization [8] , quasi-synchronization [9] , phase synchronization [10] , anti-synchronization [11] , projective synchronization [12] , function projective synchronization [13] [14] .

Modified function projective synchronization(MFPS) has been proposed and extensively investigated in the latest. MFPS means that the drive and response systems could be synchronized up to a desired scaling function matrix [15] . It is easy to see that the definition of MFPS encompasses projective synchronization and function projective synchronization. The MFPS of general complex networks can reveal that the nodes of complex networks could be synchronize up to an equilibrium point or periodic orbit with a desired scaling function matrix. Because the unpredictability of the scaling function in MFPS can additionally enhance the security of communication, MFPS has attracted the interest of many researchers in various fields. On the basis of an adaptive fuzzy nonsingular terminal sliding mode control scheme, a general method of MFPS of two different chaotic systems with unknown functions was investigated in [16] . The work in [17] gives MFPS of a class of chaotic systems. MFPS of a classic chaotic systems with unknown disturbances was investigated by adaptive integral sliding mode control [18] . Ref. [19] investigates the adaptive MFPS of a class of complex four-dimensional chaotic system with one cubic cross-product term in each equation. Ref. [20] investigates the MFPS of two different chaotic systems with parameter perturbations.

A simple general scheme of MFPS in complex dynamical networks (CDNs) is investigated in this paper, considering that external disturbances and unmodeled dynamics are always unavoidably in the practical evolutionary processes of synchronization, MFPS in CDNs with proportional delay and disturbances will be investigated by the proposed scheme.The rest of this paper is organized as follows. Some definitions and a basic lemma are given in Section 2. In Section 3, the synchronization of the complex networks with proportional delays by the pinning control method is discussed by the way of equivalent system. Finally, computer simulation is performed to illustrate the validity of the proposed method in Section 4.

2. Preliminaries

Consider a generally controlled complex dynamical networks consisting of N identical linearly coupled nodes with multiple proportional delays by the following equations:

x ˙ i ( t ) = f ( x i ( t ) ) + j = 1 N g i j x j ( q i j t ) + u i ( t ) , i = 1 , 2 , , N , t 1 , (2.1)

where i = 1 , 2 , , N , t 1 , x i = ( x i 1 , x i 2 , , x i n ) T R n denotes the state vector of the ith node, f : R n R n is a continuously differentiable vector function determining the dynamic behavior of the nodes, u i ( t ) R n is the control input. G = ( g i j ) R N × N is the coupling configuration matrix representing the topolo- gical structure of the network, where g i j > 0 if there is a connection between node i and node j; otherwise g i j = g j i = 0 , and the diagonal elements of matrix G are defined by

g i i = j = 1 , j i N g i j , i = 1 , 2 , , N , (2.2)

q i j , i , j = 1 , 2 , , n are proportional delay factors and satisfy 0 < q i j 1 , q = min 1 i , j n { q i j } . Furthermore, the complex network described in (2.1) possess initial conditions of x i ( t ) = x i 0 , t [ q , 1 ] , x i 0 ( i = 1 , 2 , 3 , , N ) are constants.

Definition 1. (MFPS) The network (2.1) with proportional delays is said to achieve modified function projective synchronization if there exists a continu- ously differentiable scaling function matrix M ( t ) such that

l i m t + x i ( t ) M ( t ) x ( t ) = 0, i = 1,2, , N , (2.3)

where stands for the Euclidean vector norm, M ( t ) = d i a g ( α i ( t ) ) is a modified function matrix, and each modified function α i ( t ) is a continuously differential function and is bounded as | α i ( t ) | δ i < , α i ( t ) 0 , δ i is a finite constant, and x ( t ) R n can be an equilibrium point, or a periodic orbit, or an orbit of a chaotic attractor, which satisfies x ˙ ( t ) = f ( x ( t ) ) .

Considering the actual evolutionary processes of synchronization, external disturbances and unmodeled dynamics are always unavoidable. MFPS in CDNs with disturbances will be investigated further as follows:

#Math_26# (2.4)

where x i = ( x i 1 , x i 2 , , x i n ) T R n denotes the state vector of the ith node, f : R n R n is a continuously differentiable vector function determining the dynamic behavior of the nodes, u i ( t ) R n is the control input and d i ( t ) R n is the mismatched terms, which could exist in many perturbation, noise disturbance. G = ( g i j ) R N × N is the coupling configuration matrix represent- ing the topological structure of the network, and the diagonal elements of matrix G are defined by Equation (2.2).

In the following, some necessary assumptions are given.

Assumption 1. The derivative of scaling function α i ( t ) is bounded, that is

| α i ( t ) | a * (2.5)

for all t R + , where a * R + is the upper limit of the | α ˙ i ( t ) | , i = 1 , 2 , , N .

Assumption 2. The norm of the mismatched terms d i ( t ) ( i = 1 , 2 , , N ) are bounded, that is

d i ( t ) d i * < (2.6)

where d i * R + is the upper limit of the norm of d i ( t ) .

In this paper, M 1 , M 2 denote the upper limit of the norm of M ( t ) f ( y ( t ) ) , M ˙ ( t ) y ( t ) , respectively. Q = G I n , represent the Kroncecker product, λ max ( A ) denotes the maximum eigenvalue for symmetric matrix A .

Lemma 1. [21] For any vector x , y R n and positive definite matrix S R n × n , the following matrix inequality holds:

2 x T y x T S x + y T S 1 y (2.7)

3. MFPS in Complex Networks with Multiple Proportional Delays

In this section, a hybrid feedback control method for realizing modified function projective synchronization in complex dynamical networks with multiple proportional delays is proposed.

Let y i ( t ) = x i ( e t ) , then a couple of networks (2.1) and (2.4) is equivalently transformed into the following couple of complex networks with constant delay and time varying coefficients

y ˙ i ( t ) = e t { f ( y i ( t ) ) + j = 1 N g i j y j ( t τ i j ) + U i ( t ) } , i = 1 , 2 , , N , (3.1)

and

#Math_54# (3.2)

where t 0 , τ i j = log e ( q i j ) 0 , D i ( t ) = d i ( e t ) , U i ( t ) = u i ( e t ) , and y i ( s ) = x i ( s ) C ( [ τ ,0 ] , ) , in which x i ( s ) = x i 0 , s [ τ , 0 ] , τ = max 1 i , j n { τ i j } .

Definition 2. The network (3.2) is said to achieve modified function projec- tive synchronization if there exists a continuously differentiable scaling function matrix M ( t ) such that

l i m t + e i ( t ) = l i m t + y i ( t ) M ( t ) y ( t ) = 0, i = 1,2, , N , (3.3)

where stands for the Euclidean vector norm, M ( t ) = d i a g ( α i ( t ) ) is a modified function matrix, and each modified function α i ( t ) is a continuously differential function and is bounded as | α i ( t ) | δ i < , α i ( t ) 0 , δ i is a finite constant, and y ( t ) R n can be an equilibrium point, or a periodic orbit, or an orbit of a chaotic attractor, which satisfies y ˙ ( t ) = e t f ( y ( t ) ) .

Theorem 1. Suppose Assumptions 1 and 2 hold. For a given synchronization scaling function matrix M ( t ) , if there exist positive constants k i 1 , k i 2 and

k i 3 which satisfy k i 1 d i * + M 1 , k i 2 M 2 and k i 3 λ max ( Q Q T 2 ) + 1 2 , CDNs

with disturbance (3.2) can realize modified function projective synchronization via the control law :

#Math_78# (3.4)

where s g n ( ) denotes the sign function.

Proof. Define

e i ( t ) = y i ( t ) M ( t ) y ( t ) , i = 1 , 2 , , N , (3.5)

where M ( t ) is a modified function matrix. It follows from (3.2) and (2.2) that

e ˙ i ( t ) = e t { f ( y i ( t ) ) + j = 1 N g i j e j ( t τ i j ) + D i ( t ) + U i ( t ) } M ˙ ( t ) s ( t ) M ( t ) e t f ( y ( t ) ) , i = 1 , 2 , , N , (3.6)

Construct the Lyapunov function

V ( t ) = 1 2 e t i = 1 N e i T ( t ) e i ( t ) + 1 2 t τ i j t i = 1 N e i T ( v ) e i ( v ) d v , (3.7)

The time derivative of V(t) along the trajectories of system (3.6) is

(3.8)

Because chaos systems and the scaling function are bounded, y ( t ) and α i ( t ) are bounded. Furthermore, f is a continuously vector function, there exists a positive constants M 1 satisfying M ( t ) f ( y ( t ) ) M 1 . Because Assumption 1 holds, there exists a positive constant M 1 satisfying M ˙ ( t ) y ( t ) M 2 . Because Assumption 2 holds, there exists a positive constant d i * satisfying D i ( t ) d i * ( i = 1,2, , N ) :

V ˙ ( t ) i = 1 N e i T ( t ) [ d i * k i 1 k i 2 e t + M 1 + M 2 e t ] i = 1 N k i 3 e i T ( t ) e i ( t ) + i = 1 N j = 1 N e i T ( t ) g i j e j ( t τ i j ) + 1 2 i = 1 N e i T ( t ) e i ( t ) 1 2 i = 1 N e i T ( t τ i j ) e i ( t τ i j ) = i = 1 N e i T ( t ) [ ( d i * + M 1 k i 1 ) + ( M 2 k i 2 ) e t ] i = 1 N k i 3 e i T ( t ) e i ( t ) + i = 1 N j = 1 N e i T ( t ) g i j e j ( t τ i j ) + 1 2 i = 1 N e i T ( t ) e i ( t ) 1 2 i = 1 N e i T ( t τ i j ) e i ( t τ i j ) (3.9)

Tanking k i 1 d i * + M 1 and k i 2 M 2 , i = 1 , 2 , , N , we obtain

V ˙ ( t ) k 3 i = 1 N e i T ( t ) e i ( t ) + i = 1 N j = 1 N e i T ( t ) g i j e j ( t τ i j ) + 1 2 i = 1 N e i T ( t ) e i ( t ) 1 2 i = 1 N e i T ( t τ i j ) e i ( t τ i j ) (3.10)

where k 3 = min ( k 1 3 , k 2 3 , , k N 3 ) .

Let e ( t ) = ( e 1 T ( t ) , e 2 T ( t ) , , e N T ( t ) ) T R n N . Then by Lemma 1, we have

V ˙ ( t ) k 3 e T ( t ) e ( t ) + e T ( t ) Q e ( t τ i j ) + 1 2 e T ( t ) e ( t ) 1 2 e T ( t τ i j ) e ( t τ i j ) k 3 e T ( t ) e ( t ) + 1 2 e T ( t ) Q Q T e ( t ) + 1 2 e T ( t ) e ( t ) [ k 3 + λ max ( Q Q T 2 ) + 1 2 ] e T ( t ) e ( t ) (3.11)

Taking k 3 λ max ( Q Q T 2 ) + 1 2 , we obtain

V ˙ ( t ) 0. (3.12)

According to the Lyapunov stability theory, the error system (3.6) is asymptotically stable. This completes the proof.

Corollary 1. Suppose Assumptions 1 hold. For a given synchronization scaling function matrix M ( t ) , if there exist positive constants k i 1 , k i 2 , k i 3 ,

which satisfy k i 1 M 1 , k i 2 M 2 and k i 3 λ max ( Q Q T 2 ) + 1 2 , CDNs without

disturbance (3.1) can realize modified function projective synchronization via the control law :

#Math_111# (3.13)

where s g n ( ) denotes the sign function.

By Theorem 1, it is easy to see that a similar proof holds for D i ( t ) = 0 ( i = 1 , 2 , , N ) . Thus, the proof is omitted here.

Though the proposed error feedback control method is very simple, Choosing the appropriate feedback gains k i 1 , k i 2 and k i 3 is still difficult. Thus, finding appropriate gains k i 1 , k i 2 and k i 3 to achieve synchronization is still a challenging problem. In the following, an adaptive scheme is established in order to select the appropriate gains k i 1 , k i 2 and k i 3 to realize MFPS in CDNs with or without disturbances.

Theorem 2. Suppose Assumptions 1 and 2 hold. For a given synchronization scaling function matrix M ( t ) , CDNs with disturbance (3.2) can realize modified function projective synchronization via the control law :

U i ( t ) = f ( y i ( t ) ) + ( k i 1 ( t ) k i 2 ( t ) e t ) s g n ( e i ( t ) ) k i 3 ( t ) e i ( t ) , i = 1,2, , N , (3.14)

k ˙ i 1 ( t ) = l i 1 e i T ( t ) s g n ( e i ( t ) ) , i = 1,2, , N , (3.15)

k ˙ i 2 ( t ) = l i 2 e t e i T ( t ) s g n ( e i ( t ) ) , i = 1,2, , N , (3.16)

k ˙ i 3 ( t ) = l i 3 e i T ( t ) e i ( t ) , i = 1,2, , N , (3.17)

where s g n ( ) denotes the sign function. l i 1 > 0 , l i 2 > 0 and l i 3 > 0 are arbi- trary positive constants. Proof. Construct the Lyapunov function

V ( t ) = 1 2 e t i = 1 N e i T ( t ) e i ( t ) + 1 2 t τ i j t i = 1 N e i T ( v ) e i ( v ) d v + 1 2 i = 1 N 1 l i 1 ( k i 1 ( t ) k ¯ i 1 ) 2 + 1 2 i = 1 N 1 l i 2 ( k i 2 ( t ) k ¯ i 2 ) 2 + 1 2 i = 1 N 1 l i 3 ( k i 3 ( t ) k ¯ i 3 ) 2 , (3.18)

The time derivative of V(t) along the trajectories of (3.6) is

(3.19)

Because chaos systems and the scaling function are bounded, y ( t ) and α i ( t ) are bounded. Furthermore, f is a continuously vector function, there exists a positive constants M 1 satisfying M ( t ) f ( y ( t ) ) M 1 . Because As- sumption 1 holds, there exists a positive constant M 2 satisfying M ˙ ( t ) y ( t ) M 2 . Because Assumption 2 holds, there exists a positive constant d i * satisfying D i ( t ) d i * ( i = 1 , 2 , , N ) :

V ˙ ( t ) i = 1 N e i T ( t ) [ ( d i * + M 1 k ¯ i 1 ) + e t ( M 2 k ¯ i 2 ) ] + i = 1 N j = 1 N e i T ( t ) g i j e j ( t τ i j ) + 1 2 i = 1 N e i T ( t ) e i ( t ) 1 2 i = 1 N e i T ( t τ i j ) e i ( t τ i j ) i = 1 N k ¯ i 3 e i T ( t ) e i ( t ) (3.20)

Tanking k ¯ i 1 d i * + M 1 and k ¯ i 2 M 2 , i = 1,2, , N , we obtain

V ˙ ( t ) i = 1 N j = 1 N e i T ( t ) g i j e j ( t τ i j ) + 1 2 i = 1 N e i T ( t ) e i ( t ) 1 2 i = 1 N e i T ( t τ i j ) e i ( t τ i j ) k ¯ 3 i = 1 N e i T ( t ) e i ( t ) (3.21)

where k ¯ 3 = min ( k ¯ 1 3 , k ¯ 2 3 , , k ¯ N 3 ) .

Let e ( t ) = ( e 1 T ( t ) , e 2 T ( t ) , , e N T ( t ) ) T R n N . Then by Lemma 1, we have

V ˙ ( t ) e T ( t ) Q e ( t τ i j ) + 1 2 e T ( t ) e ( t ) 1 2 e T ( t τ i j ) e ( t τ i j ) k ¯ 3 e T ( t ) e ( t ) 1 2 e T ( t ) ( Q Q T ) e ( t ) + 1 2 e T ( t ) e ( t ) k ¯ 3 e T ( t ) e ( t ) [ λ max ( Q Q T 2 ) + 1 2 k ¯ 3 ] e T ( t ) e ( t ) (3.22)

Taking k ¯ 3 = λ max ( Q Q T 2 ) + 3 2 , we obtain

V ˙ ( t ) e T ( t ) e ( t ) . (3.23)

According to the Lyapunov stability theory, the error system (3.6) is asymptotically stable. This completes the proof.

Corollary 2. Suppose Assumptions 1 hold. For a given synchronization scaling function matrix M ( t ) , CDNs without disturbance (3.1) can realize modified function projective synchronization via the control law (3.14)-(3.17).

By Theorem 2, it is easy to see that a similar proof holds for D i ( t ) = 0 ( i = 1 , 2 , , N ) . Thus, the proof is omitted here.

4. Computer Simulation

In this section, the chaotic Lorenz system is taken as nodes of CDNs to verify the effectiveness of the proposed scheme in Corollary 2.

Consider the following single Lorenz system:

{ x ˙ 1 = a ( x 2 x 1 ) x ˙ 2 = ( b x 3 ) x 1 x 2 x ˙ 3 = x 1 x 2 c x 3 (4.1)

where a = 10 , b = 28 , c = 8 3 . Figure 1 and Figure 2 depict the chaotic attractor

and components of the Lorenz system respectively. The coupling configuration matrix G = ( g i j ) is chosen to be

Figure 1. Chaotic attractor of the Lorenz system.

Figure 2. Components of the Lorenz system.

G = [ 1 0 1 1 1 0 0 1 1 ]

Complex networks with proportional delays can be described as follows:

( x ˙ i 1 ( t ) x ˙ i 2 ( t ) x ˙ i 3 ( t ) ) = ( 10 ( x i 2 ( t ) x i 1 ( t ) ) ( 28 x i 3 ( t ) ) x i 1 ( t ) x i 2 ( t ) x i 1 ( t ) x i 2 ( t ) 8 3 x i 3 ( t ) ) + j = 1 3 g i j x j ( q i j t ) + u i ( t ) , i = 1 , 2 , 3 (4.2)

where the controllers u i ( t ) satisfied: U i ( t ) = u i ( e t ) , U i ( t ) can be designed by using Theorem 2 as follows:

U i ( t ) = ( 10 ( y i 2 ( t ) y i 1 ( t ) ) ( 28 y i 3 ( t ) ) y i 1 ( t ) y i 2 ( t ) y i 1 ( t ) y i 2 ( t ) 8 3 y i 3 ( t ) ) + ( k i 1 ( t ) k i 2 ( t ) e t ) ( s g n ( e i 1 ( t ) ) s g n ( e i 2 ( t ) ) s g n ( e i 3 ( t ) ) ) k i 3 ( t ) ( e i 1 ( t ) e i 2 ( t ) e i 3 ( t ) )

with

k ˙ i 1 ( t ) = l i 1 j = 1 3 e i j ( t ) s g n ( e i j ( t ) ) k ˙ i 2 ( t ) = l i 2 e t j = 1 3 e i j ( t ) s g n ( e i j ( t ) ) k ˙ i 3 ( t ) = l i 3 j = 1 3 e i j 2 ( t )

where y i ( t ) = x i ( e t ) , e i ( t ) = y i ( t ) M ( t ) y ( t ) , i = 1 , 2 , 3.

In this numerical simulation, we take the initial states as x 1 ( 0 ) = [ 3 4 4 ] T , x 2 ( 0 ) = [ 4 1 4 ] T , x 3 ( 0 ) = [ 2 0 5 ] T , x ( 0 ) = [ 5 3 5 ] T . We take k 1 1 ( 0 ) = 1 , k 2 1 ( 0 ) = 2 , k 3 1 ( 0 ) = 3 , k 1 2 ( 0 ) = 4 , k 2 2 ( 0 ) = 5 , k 3 2 ( 0 ) = 6 , k 1 3 ( 0 ) = 12 , k 2 3 ( 0 ) = 15 , k 3 3 ( 0 ) = 16 , k 3 3 ( 0 ) = 16 and

M ( t ) = d i a g ( 4 + sin 2 π t 10 , 4 + cos 2 π t 10 , 4 + sin 2 π t 10 ) . The numerical results are

presented in Figure 3 and Figure 4. Figure 3 displays the state phases of the Lorenz system. The time evolution of the synchronization errors is depicted in Figure 4, which displays e ( t ) 0 with t . These results show that function projective synchronization takes place with the desired scaling function in complex networks (4.2).

5. Concluding Remarks

In this paper, function projective synchronization schemes for complex net- works with proportional delays are given by a error feedback control method. Numerical simulation is provided to show the effectiveness of our result.

Figure 3. State phases of the Lorenz system.

Figure 4. The time evolution of the synchronization errors e.

Acknowledgements

This work is jointly supported by the Natural Science Foundation of China (11101187, 61573005, 11361010), the Scientific Research Fund of Fujian Provincial Education Department of China (JAT160691).

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Qiu, X. , Bin, H. and Chu, L. (2017) Modified Function Projective Synchronization of Complex Networks with Multiple Proportional Delays. Applied Mathematics, 8, 537-549. doi: 10.4236/am.2017.84043.

References

[1] Ott, E., Grebogi, C. and Yorke, J.A. (1990) Controlling Chaos. Physical Review Letters, 11, 1196-1199.
https://doi.org/10.1103/PhysRevLett.64.1196
[2] Gang, H. and Qu, Z.L. (1994) Controlling Spatiotemporal Chaos in Coupled Map Lattice Systems. Physics Letters A, 72, 68-73.
https://doi.org/10.1103/PhysRevLett.72.68
[3] Carroll, T.L. and Pecora, L.M. (1990) Synchronization in Chaotic Systems. Physical Review Letters, 64, 821-824.
https://doi.org/10.1103/PhysRevLett.64.821
[4] Yang, T. (2004) A Survey of Chaotic Secure Communication Systems. International Journal of Computational Vision and Robotics, 2, 81-130.
[5] Lu, J.Q. and Cao, J.D. (2005) Adaptive Complete Synchronization of Two Identical or Different Chaotic (Hyperchaotic) Systems with Fully Unknown Parameters. Chaos, 15, 4-9.
https://doi.org/10.1063/1.2089207
[6] Wang, T., Li, T., Yang, X., Fei, S. (2012) Cluster Synchronization for Delayed Lur’e Dynamical Networks Based on Pinning Control. Neurocomputing, 83, 72-82.
[7] Shahverdiev, E.M. and Sivaprakasam, S. (2002) Lag Synchronization in Time Delayed Systems. Physics Letters A, 292, 320-324.
https://doi.org/10.1016/S0375-9601(01)00824-6
[8] Rulkov, N.F., Sushchik, M.M. and Tsimring, L.S., et al. (1995) Generalized Synchronization of Chaotic Oscillators. Physical Review Letters, 51, 980-994.
[9] Wang, L., Qian, W. and Wang, Q. (2015) Bounded Synchronization of a Time Varying Dynamical Network with Nonidentical Nodes. International Journal of Systems Science, 46, 1-12.
https://doi.org/10.1080/00207721.2013.815825
[10] Rosenblum, M.G., Pikovsky, A.S. and Kurths, J. (1996) Phase Synchronization of Chaos in Directionally Coupled Chaotic Systems. Physical Review Letters, 761, 804-807.
[11] Kim, C., Rim, S., Kye, W., Yu, J.R. and Park, Y. (2003) Anti-Synchronization of Chaotic Oscillators. Physics Letters A, 320, 39-46.
https://doi.org/10.1016/j.physleta.2003.10.051
[12] Mainieri, R. and Rehacek, J. (1999) Projective Synchronization in Three-Dimensional Chaotic Systems. Physical Review Letters, 82, 3042-3045.
[13] Tang, X., Lu, J. and Zhang, W. (2007) The FPS of Chaotic System Using Backstepping Design. International Journal of Dynamics and Control, 5, 216-219.
[14] Chen, Y. and Li, X. (2009) Function Projective Synchronization between Two Identical Chaotic System. Chaos, Solitons & Fractals, 42, 2399-2402.
https://doi.org/10.1016/j.chaos.2009.03.120
[15] Du, H., Zeng, Q. and Wang, C. (2010) Modified Function Projective Synchronization of Chaotic Systems. Nonlinear Analysis: Real World Applications, 11, 705-712.
[16] Park, J., Lee, J. and Won, S. (2013) Modified Function Projective Synchronization for Two Different Chaotic Systems Using Adaptive Fuzzy Nonsingular Terminal Sliding Mode Control. 13th International Conference on Control, Automation and Systems, Gwangju, 20-23 October 2013, 28-33.
https://doi.org/10.1109/iccas.2013.6703858
[17] Li, J. and Li, N. (2011) Modified Function Projective Synchronization of a Class of Chaotic Systems. Acta Physica Sinica, 60, 147-149.
[18] Wei, D., Hong, W., et al. (2013) Modified Function Projective Synchronization of a Classic Chaotic Systems with Unknown Disturbances Based on Adaptive Integral Sliding Mode Control. 2013 Fourth International Conference on Intelligent Systems Design and Engineering Applications, Gwangju, 6-7 November 2013, 382-385.
[19] Feng, M. (2013) Adaptive Modified Function Projective Synchronization for Complex Four-Dimensional Chaotic Systems. Proceedings of 2013 International Conference on Computing, Networking and Communications, Honolulu, 3-6 February 2013, 1537-1541.
[20] Du, H., Lu, N. and Li, F. (2012) Modified Function Projective Synchronization of Two Different Chaotic Systems with Parameter Perturbations. Proceedings of 2012 International Conference on Measurement, Information and Control, Harbin, 18-20 May 2012, 761-764.
[21] Lu, J. and Cao, J. (2009) Synchronization-Based Approach for Parameters Identification in Delayed Chaotic Neural Networks. Physics Letters A, 382, 672-682.

  
comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.