Next Article in Journal
Oscillation of Nonlinear Neutral Delay Difference Equations of Fourth Order
Next Article in Special Issue
Influential Yield Strength of Steel Materials with Return Random Walk Gravity Centrality
Previous Article in Journal
A Review of Chaotic Systems Based on Memristive Hopfield Neural Networks
Previous Article in Special Issue
Dynamic Network Resource Autonomy Management and Task Scheduling Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Shunting Inhibitory Cellular Neural Networks with Compartmental Unpredictable Coefficients and Inputs

by
Marat Akhmet
1,*,
Madina Tleubergenova
2,3 and
Akylbek Zhamanshin
1
1
Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey
2
Department of Mathematics, Aktobe Regional University, Aktobe 030000, Kazakhstan
3
Institute of Information and Computational Technologies, Almaty 050010, Kazakhstan
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(6), 1367; https://doi.org/10.3390/math11061367
Submission received: 16 February 2023 / Revised: 7 March 2023 / Accepted: 8 March 2023 / Published: 11 March 2023
(This article belongs to the Special Issue Theory and Application of Neural Networks and Complex Networks)

Abstract

:
Shunting inhibitory cellular neural networks with compartmental periodic unpredictable coefficients and inputs is the focus of this research. A new algorithm is suggested, to enlarge the set of known unpredictable functions by applying diagonalization in arguments of functions of several variables. Sufficient conditions for the existence and uniqueness of exponentially stable unpredictable and Poisson stable outputs are obtained. To attain theoretical results, the included intervals method and the contraction mapping principle are used. Appropriate examples with numerical simulations that support the theoretical results are provided. It is shown how dynamics of the neural network depend on a new numerical characteristic, the degree of periodicity.

1. Introduction

In 1988 [1], Chua and Yang introduced the concept of cellular neural networks (CNNs), which are arrays of dynamical systems. The authors used CNNs for image processing problems and solving partial differential equations [2]. These publications sparked widespread interest in CNNs among researchers, and since then, many new applications of CNNs have been introduced.
A class of CNNs, shunting inhibitory cellular neural networks (SICNNs), was proposed by Bouzerdoum and Pinter in 1993 [3]. They are biologically inspired networks in which the synaptic interactions among neurons are mediated via a nonlinear mechanism called shunting inhibition. In the Ref. [4], the application of SICNNs for medical diagnosis, which is based on some given symptoms and initial data, was shown. SICNNs are very useful for image processing since they can provide contrast and edge enhancement. The SICNNs algorithm allows to achieve a balance between enhancing the dark region, and at the same time retaining the colours in the bright [5,6]. The neural networks have been widely applied in various fields such as psychophysics, robotics, perception, and adaptive pattern recognition [7,8,9]. The variable and continuous-time excitatory inputs guarantee rich dynamics for SICNNs, as well as for shunting inhibitory artificial neural networks [4,5]. Exceptionally, if they are chaotic, the case will be under investigation of the present research.
It is known that dynamics of the neural networks is very complex, and play an important role in applications. Thus, many studies have been devoted to the study of SICNNs. In particular, the existence and stability of periodic [10,11], anti-periodic [12,13,14], almost periodic [15,16,17] and pseudo-periodic solutions [18,19] have been investigated.
In its original formulation [3], the model of SICNNs is as follows. Consider a two-dimensional grid of cells, and denote by  C i j ,   i = 1 , , m ,   j = 1 , , n ,  the cell at the  ( i , j )  position of the mesh. In SICNNs, neighboring cells exert shunting-type mutual inhibitory interactions. The following differential equation describes the dynamics of the cell  C i j ,
x i j ( t ) = a i j x i j ( t ) C k l N r ( i , j ) C i j k l f ( x k l ( t ) ) x i j ( t ) + v i j ( t ) ,
where  x i j  is the activity of the cell  C i j ;   a i j  is the passive decay rate of the cell activity;  C i j k l 0  is the connection of postsynaptic activity of the cell  C k l  transmitted to the cell  C i j ;   f ( s )  is the activation function;  v i j ( t )  is the external input to cell  C i j ;  and the r-neighborhood  N r ( i , j )  of  C i j  is
N r ( i , j ) =   { C k l : max ( | k i | , | l j | ) r , 1 k m , 1 l n } ,
with fixed natural numbers m and  n .
Currently, only a few studies have investigated the Poisson stable and unpredictable motions of shunting-type cellular neural networks. For instance, the dynamics of the SICNNs (1), where the inputs  v i j ( t )  are unpredictable, was investigated in [20]. Unpredictable oscillations of SICNNs with delay,
x i j ( t ) = a i j x i j ( t ) C k l N r ( i , j ) C i j k l f ( x k l ( t τ ) ) x i j ( t ) + L i j ( t ) ,
were considered in the Ref. [21]. In system (2), inputs  L i j ( t )  are piecewise constant functions, which have not been approved for unpredictability, while in our research they are continuous unpredictable functions obtained through the compartmental algorithm.
In the Ref. [22], the following symmetrical impulsive SICNNs with a generalized piecewise constant argument,
x i j ( t ) = a i j ( t ) x i j ( t ) C h l N r ( i , j ) C i j h l ( t ) f ( x h l ( γ ( t ) ) ) x i j ( t ) + v i j ( t ) , t θ k , Δ x i j ( t ) t = θ k = b i j ( t ) x i j ( θ k ) D h l N r ( i , j ) C i j h l ( t ) g ( x h l ( θ k ) ) x i j ( θ k ) + h i j k ,
was considered, and sufficient conditions for the existence and uniqueness of Poisson stable solutions were obtained.
The following neural model is in the focus of our study,
x i j ( t ) = ( a i j ( t ) + b i j ( t ) ) x i j ( t ) c k l N r ( i , j ) c i j k l ( t ) f ( x k l ( t ) ) x i j ( t ) + v i j ( t ) ,
where the coefficients  a i j ( t )  are continuous periodic functions; the components  b i j ( t ) ,  connection weights  c i j k l ( t )  and inputs  v i j ( t )  are compartmental periodic unpredictable functions; the activation function  f ( s )  is continuous.
The dynamics of SICNNs (4), where the functions  a i j ( t )  are periodic,  b i j ( t ) ,   v i j ( t )  are Poisson stable, and connection weights  c i j k l  are constants, were investigated in the Ref. [23]. This time, all coefficients are time-varying functions, and have a more complex structure that combines periodicity and unpredictability. The Poisson stable and unpredictable solutions of the neural network (4) are under investigation.
It is indisputable that any theory of functions with applications should be accompanied by a number of methods of construction as well as numerical presentations of the functions. They can be simple algebraic operations, Fourier series and results of theory of operators. The methods of construction as well as numerical analysis of the unpredictable solutions are also on the agenda. A novel way to determine unpredictable functions is suggested, which is rooted at the compartmental paradigm. We start with functions of two variables, which are unpredictable in one of them, and in another are periodic. The domains of the functions are narrowed to diagonals of the argument spaces. The method of diagonals is known for quasi-periodic functions or almost periodic functions [24,25]. In the present study, the diagonalization is made on an essentially new level, since dependence on the two variables is significantly different. This is why it is of large interest to look for conditions such that functions on diagonals admit the unpredictability.
Despite many papers on almost periodic and Poisson stable functions, there are no numerical examples, neither for the functions nor solutions, if they are not quasi-periodic. However, the needs of the industry and particularly neuroscience and other modern areas demand numerical presentation of dynamics to support theories. Our study meets the challenges, since we construct several Poisson stable and unpredictable functions numerically, utilizing the merits of the logistic equation. One can emphasise that even for Poisson stable functions, which have been researched for about a century, the concrete samples of functions appeared for the first time in our papers [26,27]. The numerical experiments are advantageous, since they are accompanied by newly developed strong instruments of the functions simulations. They are convenient for synchronization of chaos. Delta synchronization has been introduced, which works for gas discharge-semiconductor systems [28,29], where even the generalized synchronization [30] is not effective. A numerical test for the unpredictable dynamics was suggested in the Ref. [31], and strange attractors were discovered [32]. Moreover, we constructed algorithms which allow to see the contribution of periodicity and the unpredictability for the compartmental dynamics [33]. They are based on the concept of the degree of periodicity. It was learnt that very similar time series can be seen in industrial experiments [34,35,36,37,38], and this is a strong argument for the application of our results. We believe that the study of the compartmental functions will shed more light on the problem of the transition from quasi-periodicity to chaos [39,40].
The rest of the paper is organized as follows. In Section 2, the basic and novel definitions are presented. Special relations between periodicity and unpredictability in compartmental arguments are determined to establish the unpredictability of compartmental functions. They are formulated in terms of time sequences. The lemma on the existence of an equivalent integral equation is provided as a key technical step in the analysis. The conditions for neural networks that are sufficient to obtain the results of the article are announced. Section 3 contains the main results of our study. Using the method of included intervals [26,27] and a contraction mapping principle, it is strictly proved that the Poisson stable and unpredictable motions, which are exponentially stable, are present in the dynamics of the SICNNs (4). In Section 4, discontinuous and continuous unpredictable functions are defined through the solution of the logistic map. A parameter, the degree of periodicity, which strongly affects the behaviour of the neural network is introduced. Numerical examples with illustrations confirming the feasibility of theoretical results are given. Finally, prospects of the obtained results for chaos control and synchronization in neural networks are discussed in Section 5.

2. Preliminaries

The definitions of the Poisson stable and unpredictable function are as follows.
Definition 1 
([41]). A bounded function  g ( t ) : R R n  is called Poisson stable if there exists a sequence  t p ,   t p  as  p ,  such that the sequence of functions  g ( t + t p )  converges to  g ( t )  uniformly on each bounded interval of  R .
Definition 2 
([42]). A bounded function  g : R R n  is said to be unpredictable if there exist positive numbers  ϵ 0 , δ  and sequences  t p ,   s p  as  p ,  such that  g ( t + t p ) g ( t ) 0  uniformly on compact subsets of  R  and  g ( t + t p ) g ( t ) > ϵ 0  for each  t [ s p δ , s p + δ ]  and  p N .
The sequence  t p , p = 1 , 2 , ,  is called the convergence sequence in Definitions 1, 2, and correspondingly, we shall say about the convergence property, while the existence of positive numbers  ϵ 0 , δ  and sequence  s p  is said to be the separation property.
It is easily seen, reading the last two definitions, that all unpredictable functions make a subset of Poisson stable functions specified with an additional property of separation. It was proved in our studies [42] that the property guarantees chaotic dynamics of the unpredictable motion. Loosely speaking, one can say that an unpredictable function is a Poisson stable function with assigned chaotic behaviour.
Definition 3 
([33]). A function  g ( t ) : R R n  is called a compartmental periodic unpredictable function, if  g ( t ) = G ( t , t ) ,  where  G ( u , v )  is a bounded continuous function, periodic in u uniformly with respect to  v ,  and unpredictable in v uniformly with respect to  u ,  that is, there exist positive numbers  ω ,   ϵ 0 , δ and sequences  t p ,   s p  as  p ,  such that  G ( u + ω , v ) = G ( u , v )  for all  u , v R ,   sup u R G ( u , v + t p ) G ( u , v ) 0  uniformly on bounded intervals of  v ,  and  G ( u , v + t p ) G ( u , v ) > ϵ 0  for  v [ s p δ , s p + δ ] ,   u R  and  p N .
Remark 1. 
To say that function  g ( t )  in the last definition is a compartmental periodic unpredictable function does not mean that it is unpredictable in the sense of Definition 2. The question of whether the function on the diagonal is unpredictable will be answered under the conditions of Lemma 1.
Let us consider the convergence sequence  t p , p = 1 , 2 , ,  and a fixed positive number  ω .  One can write that  t p = θ p ( m o d ω ) ,  where  0 θ p < ω ,   p = 1 , 2 , .  There exists a subsequence  θ p l ,   l = 1 , 2 , ,  which tends to a real number  θ ω .  Consequently, one can find a subsequence  t p l ,   l = 1 , 2 , ,  such that  t p l θ ω ( m o d ω )  as  l .  The number  θ ω  is called a Poisson shift for the convergence sequence  t p .  Denote by  T   ω  the set of all Poisson shifts. The number  κ ω = i n f T   ω ,   0 κ ω < ω ,  is said to be the Poisson number for  t p ,   p = 1 , 2 , .  We say that the convergence sequence satisfies kappa property with respect to the  ω  if  κ ω = 0 .
The following lemma is a main auxiliary result of the paper.
Lemma 1. 
Let a bounded function  F ( u , v ) : R × R R n ,  is  ω periodic in  u .  The function  f ( t ) = F ( t , t )  is unpredictable if the following conditions are valid:
(i) 
For each  ϵ > 0  there exists a positive number η such that  F ( t + s , t ) F ( t , t ) < ϵ  if  | s | < η , t R ;
There exist positive numbers  ϵ 0 , δ  and sequences  t p ,   s p  both of which diverges to infinity as  p ,  such that
(ii) 
The sequence  t p  satisfies kappa property with respect to the  ω ;
(iii) 
F ( t , t + t p ) F ( t , t ) 0 ,  uniformly on each bounded interval  I R  of  t ;
(iv) 
  inf [ s p δ , s p + δ ] F ( t , t + t p ) F ( t , t ) > ϵ 0 ,   p N .
Proof. 
Let us fix a bounded interval  I R ,  and a positive number  ϵ .  By assumption  ( i i ) ,  one can write, without loss of generality, that  t p 0 ( m o d ω )  as  p .  Therefore, conditions  ( i )  and  ( i i i )  imply that the following inequalities are valid:
sup R × R F ( t + t p , t ) F ( t , t ) < ϵ 2
and
sup R × I F ( t , t + t p ) F ( t , t ) < ϵ 2 ,
for sufficiently large  p .
Using inequalities (5) and (6), we obtain that
f ( t + t p ) f ( t )   =   F ( t + t p , t + t p ) F ( t , t ) F ( t + t p , t + t p ) F ( t , t + t p ) + F ( t , t + t p ) F ( t , t ) < ϵ 2 + ϵ 2 = ϵ ,
for all  t I .  That is,  f ( t + t p )  converges to  f ( t )  on each arbitrary bounded time interval uniformly, and the function  f ( t )  satisfies the convergence property.
Conditions  ( i )  and  ( i i )  imply that  sup R F ( t + t p , t ) F ( t , t ) < ϵ 0 2  for sufficiently large  p .  Applying assumption  ( i v ) ,  one can obtain that
f ( t + t p ) f ( t )   =   F ( t + t p , t + t p ) F ( t , t ) F ( t + t p , t + t p ) F ( t + t p , t ) F ( t + t p , t ) F ( t , t ) > ϵ 0 ϵ 0 2 = ϵ 0 2 ,
for all  t [ s p δ , s p + δ ] ,   p N .  Thus, the separation property is valid. The lemma is proved. □
Remark 2. 
If the conditions of Lemma 1 are valid, then function  F ( u , v )  admits properties of Definition 3. This is why the lemma provides conditions for unpredictability of a compartmental periodic function.
Using the theory of differential equations [43], one can verify that the following lemma is true.
Lemma 2. 
In order for a bounded on  R  function  y ( t ) = ( y i j ( t ) ) ,   i = 1 , , m , j = 1 , , n ,  to be a solution of (4), it is necessary and sufficient that it satisfies the integral equation
y i j ( t ) = t e s t a i j ( u ) d u b i j ( s ) y i j ( s ) + c k l N r ( i , j ) c i j k l ( s ) f ( y k l ( s ) ) y i j ( s ) v i j ( s ) d s ,
for all  i = 1 , , m , j = 1 , , n .
Throughout the paper, we will use the norm  v = max ( i , j ) v i j ,   i = 1 , , m , j = 1 , , n ,  where  ·  is the absolute value. In what follows, we consider the activation function f in the domain  ( H , H ) ,  where H is a fixed positive number.
Suppose that  Q  is a set of functions  ϕ ( t ) = ( ϕ i j ( t ) ) ,   i = 1 , 2 , , m , j = 1 , 2 , , n ,  with the norm  ϕ ( t ) 0 = max i , j ϕ i j ( t ) ,  such that all  ϕ i j ( t )  are Poisson stable with a common convergence sequence  t p , p = 1 , 2 , ,  and  | ϕ i j ( t ) | < H ,   i = 1 , 2 , , m , j = 1 , 2 , , n .
Define on  Q  the operator T as  T ϕ ( t ) = ( T i j ϕ ( t ) ) ,   i = 1 , , m , j = 1 , , n ,  where
T i j ϕ ( t ) t e s t a i j ( u ) d u b i j ( s ) ϕ i j ( s ) + c k l N r ( i , j ) c i j k l ( s ) f ( ϕ k l ( s ) ) ϕ i j ( s ) v i j ( s ) d s .
The following assumptions are needed for system (4):
(C1)
functions  a i j ( t ) ,   i = 1 , , m ,   j = 1 , , n ,  are  ω -periodic, and  0 ω a i j ( s ) d s > 0 ;
(C2)
functions  b i j ( t ) ,   c i j k l ( t )  and  v i j ( t )  are compartmental periodic unpredictable such that  b i j ( t ) = B i j ( t , t ) ,   c i j k l ( t ) = C i j k l ( t , t ) ,   v i j ( t ) = V i j ( t , t ) ,  where the functions  B i j ( u , v ) ,   C i j k l ( u , v )  and  V i j ( u , v )  are  ω periodic in u uniformly with respect to  v ,  and unpredictable in v with common sequences  t p ,   s p ,   p = 1 , 2 , ,  uniformly with respect to  u ;
(C3)
convergence sequence  t p , p = 1 , 2 , ,  satisfies the kappa property;
(C4)
sup | s | < H | f ( s ) | = m f ,  where  m f  is a positive number;
(C5)
there exists a constant  L > 0  such that  | f ( s 1 ) f ( s 2 ) | L | s 1 s 2 |  if  | s 1 | < H , | s 2 | < H .
Condition (C1) implies that there exist constants  K i j 1  and  λ i j > 0 ,  which satisfy
e s t a i j ( u ) d u K i j e λ i j ( t s ) , t s ,
for all  i = 1 , , m , j = 1 , , n .
For the sake of simplicity, the following notations will be used.
m i j b = sup t R | b i j ( t ) | , m i j c = C k l N r ( i , j ) sup t R | c i j k l ( t ) | , m i j v = sup t R | v i j ( t ) | ,
for each  i = 1 , 2 , , m , j = 1 , 2 , , n .
We assume that the following conditions are satisfied.
(C6)
K i j m i j v λ i j K i j m i j b K i j m i j c m f < H ,   i = 1 , , m , j = 1 , , n ;
(C7)
K i j ( m i j b + m i j c ( m f + L H ) ) < λ i j ,   i = 1 , , m , j = 1 , , n .

3. Main Results

This part of the manuscript considers the existence of the dynamics, which is described in the Preliminary section. The discussion is fulfilled by researching dynamics of operator T in the space  Q .  We will show that it is invariant and contractive in the set, and prove the existence of Poisson stable dynamics for the neural networks. Next, the existence of the unpredictable solution is approved, to guarantee chaotic features in the dynamics. The exponential stability of the solution is verified under suggested conditions.
Lemma 3. 
Assume that conditions (C1)–(C6) are valid. Then T is an invariant operator in  Q .
Proof. 
Let  ϕ ( t ) Q .  We have that
| T i j ϕ ( t ) | | t e s t a i j ( u ) d u b i j ( s ) ϕ i j ( s ) + c k l N r ( i , j ) c i j k l ( s ) f ( ϕ k l ) ( s ) ϕ i j ( s ) v i j ( s ) d s | t K i j e λ i j ( t s ) | b i j ( s ) | | ϕ i j ( s ) | + c k l N r ( i , j ) | c i j k l ( s ) | | f ( ϕ k l ) ( s ) | | ϕ i j ( s ) | + | v i j ( s ) | d s K i j λ i j ( m i j b H + m i j c m f H + m i j v ) ,
for all  i = 1 , 2 , , m , j = 1 , 2 , , n .  By condition (C6), we obtain that  | T i j ϕ ( t ) | < H ,   i = 1 , 2 , , m , j = 1 , 2 , , n .
Next, we prove that the sequence of the functions  T i j ϕ ( t + t p ) ,   i = 1 , 2 , , m ,   j = 1 , 2 , , n ,  uniformly converges to  T i j ϕ ( t )  on each bounded interval of  R .  Let us fix a bounded interval  [ α , β ] R ,  and a positive number  ϵ .  There exist numbers  ξ > 0  and  γ < α ,  such that the following inequalities are valid for all  i = 1 , 2 , , m ,   j = 1 , 2 , , n ,
2 K i j λ i j e λ i j ( α γ ) 3 m i j b H + 3 m i j c m f H + m i j c L H 2 + 2 m i j v < ϵ 2 ,
K i j λ i j ( e ξ ( β γ ) 1 ) 2 m i j b H + m i j c m f H + m i j v < ϵ 4 ,
K i j ξ λ i j m i j b + H + m i j c m f + m i j c L H + m n m f H + 1 < ϵ 4 .
The proof technique given below is called the method of included intervals, since the interval  [ α , β ]  is contained in  [ γ , β ]  [26].
Applying condition (C3), one can take a sufficiently large number p such that  | b i j ( t + t p ) b i j ( t ) | < ξ ,   | c i j ( t + t p ) c i j ( t ) | < ξ ,   | v i j ( t + t p ) v i j ( t ) | < ξ ,   | ϕ i j ( t + t p ) ϕ i j ( t ) | < ξ ,   i = 1 , 2 , , m ,   j = 1 , 2 , , n ,  for  t [ γ , β ] .  Moreover, due to condition (C1), it is correct that  | a i j ( t + t p ) a i j ( t ) | < ξ  for all  t R .  We have that
| T i j ϕ ( t + t p ) T i j ϕ ( t ) | | t e s t a i j ( u + t p ) d u ( b i j ( s + t p ) ϕ ( s + t p ) + c k l N r ( i , j ) c i j k l ( s + t p ) f ( ϕ k l ( s + t p ) ) ϕ i j ( s + t p ) v i j ( s + t p ) ) d s + t e s t a i j ( u ) d u b i j ( s ) ϕ ( s ) + c k l N r ( i , j ) c i j k l ( s ) f ( ϕ k l ( s ) ) ϕ i j ( s ) v i j ( s ) d s | t | e s t a i j ( u + t p ) d u e s t a i j ( u ) d u | | b i j ( s + t p ) ϕ ( s + t p ) + c k l N r ( i , j ) c i j k l ( s + t p ) f ( ϕ k l ( s + t p ) ) ϕ i j ( s + t p ) v i j ( s + t p ) | d s + t e s t a i j ( u ) d u | b i j ( s + t p ) ϕ ( s + t p ) b i j ( s ) ϕ ( s ) + c k l N r ( i , j ) c i j k l ( s + t p ) f ( ϕ k l ( s + t p ) ) ϕ i j ( s + t p ) c k l N r ( i , j ) c i j k l ( s ) f ( ϕ k l ( s ) ) ϕ i j ( s ) v i j ( s + t p ) + v i j ( s ) | d s .
Consider the last inequality separately on intervals  ( , γ ]  and  ( γ , t ] .  Applying inequalities (9)–(11), we obtain
I 1 = γ | e s t a i j ( u + t p ) d u e s t a i j ( u ) d u | | b i j ( s + t p ) ϕ ( s + t p ) + c k l N r ( i , j ) c i j k l ( s + t p ) f ( ϕ k l ( s + t p ) ) ϕ i j ( s + t p ) v i j ( s + t p ) | d s + γ e s t a i j ( u ) d u | b i j ( s + t p ) ϕ ( s + t p ) b i j ( s ) ϕ ( s ) + c k l N r ( i , j ) c i j k l ( s + t p ) f ( ϕ k l ( s + t p ) ) ϕ i j ( s + t p ) c k l N r ( i , j ) c i j k l ( s ) f ( ϕ k l ( s ) ) ϕ i j ( s ) v i j ( s + t p ) + v i j ( s ) | d s γ 2 K i j e λ i j ( t s ) m i j b H + m i j c m f H + m i j v d s + γ K i j e λ i j ( t s ) 4 m i j b H + 2 H m f m i j c + 2 m i j c L H 2 + 2 m i j c H m f + 2 m i j v d s 2 K i j λ i j e λ i j ( α γ ) 3 m i j b H + 3 m i j c m f H + m i j c L H 2 + 2 m i j v < ϵ 2
and
I 2 = γ t | e s t a i j ( u + t p ) d u e s t a i j ( u ) d u | | b i j ( s + t p ) ϕ ( s + t p ) + c k l N r ( i , j ) c i j k l ( s + t p ) f ( ϕ k l ( s + t p ) ) ϕ i j ( s + t p ) v i j ( s + t p ) | d s + γ t e s t a i j ( u ) d u | b i j ( s + t p ) ϕ ( s + t p ) b i j ( s ) ϕ ( s ) + c k l N r ( i , j ) c i j k l ( s + t p ) f ( ϕ k l ( s + t p ) ) ϕ i j ( s + t p ) c k l N r ( i , j ) c i j k l ( s ) f ( ϕ k l ( s ) ) ϕ i j ( s ) v i j ( s + t p ) + v i j ( s ) | d s γ t K i j e λ i j ( t s ) ( e ξ ( β γ ) 1 ) 2 m i j b H + m i j c m f H + m i j v d s + γ t K i j e λ ( t s ) m i j b ξ + H ξ + m i j c m f ξ + m i j c L H ξ + m n ξ m f H + ξ d s K i j λ i j ( e ξ ( β γ ) 1 ) 2 m i j b H + m i j c m f H + m i j v + K i j λ i j ξ m i j b + H + m i j c m f + m i j c L H + m n m f H + 1 < ϵ 4 + ϵ 4 = ϵ 2 .
Inequalities (12) and (13) give that  | T i j ϕ ( t + t p ) T i j ϕ ( t ) | I 1 + I 2 < ϵ  for all  i = 1 , 2 , , m , j = 1 , 2 , , n ,  if  t [ α , β ] .  Therefore,  T Q Q .   □
Lemma 4. 
Conditions (C1)–(C7) imply that T is a contraction operator in  Q .
Proof. 
Let  φ  and  ψ  be members of  Q .  It is true that the inequality
| T i j φ ( t ) T i j ψ ( t ) | t e s t a i j ( u ) d u ( | b i j ( s ) ( φ ( s ) ψ ( s ) ) | + c k l N r ( i , j ) c i j k l ( s ) ( | f ( φ k l ( s ) ) φ i j ( s ) f ( φ k l ( s ) ) ψ i j ( s ) | + | f ( φ k l ( s ) ) ψ i j ( s ) f ( ψ k l ( s ) ) ψ i j ( s ) ) | ) d s K i j λ i j m i j b + m i j c ( m f + L H ) φ ψ 0
is valid for all  i = 1 , 2 , , m , j = 1 , 2 , , n .  Therefore, it is true that  T φ T ψ 0 K i j ( m i j b + m i j c ( m f + L H ) ) λ i j φ ψ 0 , and by condition  ( C 7 ) , operator T is contractive in  Q . □
Theorem 1. 
If the assumptions  ( C 1 ) ( C 7 )  are valid, then the neural network (4) has a unique, exponentially stable Poisson stable solution.
Proof. 
Let us show that the set  Q  is complete. Consider a sequence  ϕ k ( t )  in  Q ,  which converges on  R  to a limit function  ϕ ( t ) .  Fix a section  I R .  We have that
ϕ ( t + t p ) ϕ ( t ) ϕ ( t + t p ) ϕ k ( t + t p ) + ϕ k ( t + t p ) ϕ k ( t ) + ϕ k ( t ) ϕ ( t ) .
One can take sufficiently large numbers p and k such that each term on the right-hand-side of (14) is smaller than  ϵ 3  for an arbitrary  ϵ > 0  and  t I . The inequality (14) implies that  ϕ ( t + t p )  converges to  ϕ ( t )  uniformly on  I .  That is, the set  Q  is complete.
By the contraction mapping principle, duo to Lemmas 3 and 4, there exists a unique Poisson stable solution,  z ( t ) Q  of the system (4), such that the sequences  z ( t + t p )  converges to  z ( t )  uniformly on each of the bounded intervals of  R .
Now, let us discuss the stability of the solution  z ( t ) .  It is true that
z i j ( t ) = e t 0 t a i j ( u ) d u z i j ( t 0 ) t 0 t e s t a i j ( u ) d u b i j ( s ) z i j ( s ) + c k l N r ( i , j ) c i j k l ( s ) f ( z k l ( s ) ) z i j ( s ) v i j ( s ) d s ,
for all  i = 1 , , m j = 1 , , n .
If  x ( t ) = ( x i j ( t ) ) ,   i = 1 , , m , j = 1 , , n ,  is another solution of the neural network (4), then
x i j ( t ) = e t 0 t a i j ( u ) d u x i j ( t 0 ) t 0 t e s t a i j ( u ) d u b i j ( s ) x i j ( s ) + c k l N r ( i , j ) c i j k l ( s ) f ( x k l ( s ) ) x i j ( s ) v i j ( s ) d s .
Using the formula
x i j ( t ) z i j ( t ) = e t 0 t a i j ( u ) d u x i j ( t 0 ) z i j ( t 0 ) t 0 t e t 0 t a i j ( u ) d u × c k l N r ( i , j ) c i j k l ( s ) f ( x k l ( s ) ) x i j ( s ) c k l N r ( i , j ) c i j k l ( s ) f ( z k l ( s ) ) z i j ( s ) d s = e t 0 t a i j ( u ) d u x i j ( t 0 ) z i j ( t 0 ) t 0 t e t 0 t a i j ( u ) d u ( c k l N r ( i , j ) c i j k l ( s ) f ( x k l ( s ) ) x i j ( s ) c k l N r ( i , j ) c i j k l ( s ) f ( z k l ( s ) ) x i j ( s ) + c k l N r ( i , j ) c i j k l ( s ) f ( z k l ( s ) ) x i j ( s ) c k l N r ( i , j ) c i j k l ( s ) f ( z k l ( s ) ) z i j ( s ) ) d s ,
we obtain that
| x i j ( t ) z i j ( t ) | e t 0 t a i j ( u ) d u | x i j ( t 0 ) z i j ( t 0 ) | + t 0 t e t 0 t a i j ( u ) d u ( b i j ( s ) ( x i j ( s ) z i j ( s ) ) + c k l N r ( i , j ) c i j k l ( s ) | f ( x k l ( s ) ) f ( z k l ( s ) ) | | x i j ( s ) | d s + c k l N r ( i , j ) c i j k l ( s ) | f ( z k l ( s ) ) | | x i j ( s ) z i j ( s ) | ) d s K i j e λ i j ( t t 0 ) | x i j ( t 0 ) z i j ( t 0 ) | + t 0 t K i j e λ i j ( t t 0 ) ( m i j b + m i j c ( L H + m f ) ) | x i j ( s ) z i j ( s ) | d s ,
is valid for all  i = 1 , 2 , , m , j = 1 , 2 , , n .
Applying the Gronwall–Bellman lemma, one can attain that
| x i j ( t ) z i j ( t ) | K i j | x i j ( t 0 ) z i j ( t 0 ) | e ( K i j ( m i j b + m i j c ( L H + m f H ) ) λ i j ) ( t t 0 ) , t > t 0 .
Consequently,  z ( t )  is exponentially stable in accordance with condition (C7). □
Theorem 2. 
Assume that conditions  ( C 1 ) ( C 7 )  are fulfilled. Then the neural network (4) possesses a unique exponentially stable unpredictable solution.
Proof. 
According to Theorem 1, under conditions  ( C 1 ) ( C 7 )  there exists a unique exponentially stable solution  z ( t ) ,  which satisfies the convergence property. Now, we will prove that the separation property for the solution  z ( t )  is true. Condition  ( C 2 )  implies that for functions  v i j ( t ) ,   i = 1 , , m j = 1 , , n ,  there exists a sequence  s p  and positive numbers  ϵ 0 , δ  such that  | v i j ( t + t p ) v i j ( t ) | > ϵ 0  for each  t [ s p δ , s p + δ ]  and  p N .
It is true that
z i j ( t ) = z i j ( s p ) s p t a i j ( s ) z i j ( s ) d s s p t b i j ( s ) z i j ( s ) d s s p t c k l N r ( i , j ) c i j k p ( s ) f ( z k p ( s ) ) ω i j ( s ) d s + s p t v i j ( s ) d s
and
z i j ( t + t p ) = z i j ( t p + s p ) s p t a i j ( s + t p ) z i j ( s + t p ) d s s p t b i j ( s + t p ) z i j ( s + t p ) d s s p t c k l N r ( i , j ) c i j k l ( s + t p ) f ( z k l ( s + t p ) ) ω i j ( s + t p ) d s + s s t v i j ( s + t p ) d s .
Therefore, we have that
z i j ( t + t p ) z i j ( t ) = z i j ( t p + s p ) z i j ( s p ) s p t a i j ( s + t p ) i j ( s + t p ) d s + s p t a i j ( s ) z i j ( s ) d s s p t b i j ( s + t p ) z i j ( s + t p ) d s + s p t b i j ( s ) z i j ( s ) d s s p t c k l N r ( i , j ) c i j k l ( s + t p ) f ( z k l ( s + t p ) ) ω i j ( s + t p ) d s + s p t c k l N r ( i , j ) c i j k l ( s ) f ( z k l ( s ) ) ω i j ( s ) d s s s t v i j ( s + t p ) d s + s p t v i j ( s ) d s .
Denote  m i j a = sup t R | a i j ( t ) | .  One can fix positive numbers  l , k  and  δ 1  such that the following inequalities are satisfied:
δ 1 < δ ;
| a i j ( t + s ) a i j ( s ) | < ϵ 0 ( 1 l + 2 k ) , t R ,
| c i j ( t + s ) c i j ( s ) | < ϵ 0 ( 1 l + 2 k ) , t R ,
δ 1 ϵ 0 1 ( 1 l + 2 k ) ( m i j a + H + m i j b + L H + m i j c m f + m n m f H ) 2 H ( m i j b + m i j c m f ) > 3 ϵ 0 2 l ,
| z i j ( t + s ) z i j ( t ) | < ϵ 0 min ( 1 k , 1 4 l ) , t R , | s | < δ 1 .
Consider the following two alternatives: (i)  | z i j ( t p + s p ) z i j ( s p ) | < ϵ 0 / l ;   (ii)  | z i j ( t p + s p ) z i j ( s p ) | ϵ 0 / l .
(i) Using (19), for each  i = 1 , 2 , , m , j = 1 , 2 , , n ,  one can show that
| z i j ( t + t p ) z i j ( t p ) | | z i j ( t + t p ) z i j ( s p + t p ) | + | z i j ( s p + t p ) z i j ( s p ) | + | z i j ( s p ) z i j ( t ) | < ϵ 0 l + ϵ 0 k + ϵ 0 k = ϵ 0 ( 1 l + 2 k ) ,
if  t [ s p , s p + δ 1 ] .  Therefore, the condition (C4) and inequalities (15)–(19) imply that
| z i j ( t + t p ) z i j ( t ) | s p t | v i j ( s + t p ) v i j ( s ) | d s | z i j ( t p + s p ) z i j ( s p ) | s p t | a i j ( s + t p ) z i j ( s + t p ) | d s + s p t | a i j ( s ) i j z i j ( s ) | d s s p t | b i j ( s + t p ) z i j ( s + t p ) | d s + s p t | b i j ( s ) i j z i j ( s ) | d s s p t | c k l N r ( i , j ) c i j k l ( s + t p ) f ( z k l ( s + t p ) ) z i j ( s + t p ) | d s + s p t | c k l N r ( i , j ) c i j k l ( s ) f ( z k l ( s ) ) z i j ( s ) | d s > ϵ 0 δ 1 ϵ 0 l ϵ 0 δ 1 ( 1 l + 2 k ) ( m i j a + H ) 2 δ 1 m i j b H ϵ 0 δ 1 ( 1 l + 2 k ) m i j b 2 δ 1 m i j c m f H ϵ 0 δ 1 ( 1 l + 2 k ) ( L H + m i j c m f + m n m f H ) = δ 1 ϵ 0 2 m i j b H 2 m i j c m f H ϵ 0 ( 1 l + 2 k ) ( m i j a + H + m i j b + L H + m i j c m f + m n m f H ) ϵ 0 l ϵ 0 2 l ,
for  t [ s p , s p + δ 1 ] .
(ii) If  | z i j ( t p + s p ) z i j ( s p ) | ϵ 0 / l , it is not difficult to find that (18) implies:
| z i j ( t + t p ) z i j ( t ) | | z i j ( t p + s p ) z i j ( s p ) | | z i j ( s p ) z i j ( t ) | | z i j ( t + t p ) z i j ( t p + s p ) | > ϵ 0 l ϵ 0 4 l ϵ 0 4 l = ϵ 0 2 l ,
for  t [ s p δ 1 , s p + δ 1 ]  and  p N .  Thus, we can conclude that  z ( t )  is an unpredictable solution with positive numbers  δ 1 2 ,   ϵ 0 2 l  and sequences  t p ,   s p .   □

4. Degree of Periodicity and Numerical Simulations

This part of the article emphasises application significance of the theoretical achievements in the Section 3. Unpredictable continuous and discontinuous functions are constructively determined through discrete Poisson stable and unpredictable motions of the logistic equation. A special technical characteristic, the degree of periodicity, is introduced, which allows to estimate contributions of periodic and unpredictable arguments to the behaviour of the neural network. This can be useful for analysis of experimental data in industries [34,35,36,37,38], and this is a strong argument for the application of our results. Finally, two numerical examples with sophisticated dynamics can be seen below.
In the Ref. [42], it was proved that the logistic map
λ i + 1 = ν λ i ( 1 λ i ) , i Z .
admits an unpredictable solution  μ i ,   i Z ,  if  ν [ 3 + ( 2 / 3 ) 1 / 2 , 4 ] .  That is, there exist sequences  ζ p ,   η p  as  p ,  and a positive number  ϵ 0  such that  μ i + ζ p  tends to  μ i  for each i in a bounded interval of integers and  | μ ζ p + η p μ η p | > ϵ 0  for  p N .
Discontinuous unpredictable function. Consider the function  π ( t ) = μ i ξ ( t i h ) ,   t ( i h , ( i + 1 ) h ] ,   i Z ,  where  μ i  is an unpredictable solution of the logistic Equation (21),  ξ ( t ) : ( 0 , h ] R n , n N ,  is a continuous function, and h is a positive number. Assume that there exist positive numbers  δ , s  and  ϵ 1  such that  [ s δ , s + δ ] ( 0 , h ]  and  ξ ( t ) > ϵ 1  for each  t [ s δ , s + δ ] .
Let us show that the function  π ( t )  is unpredictable. Fix an interval of real numbers  ( α , β )  and a number  i Z  such that  ( α , β ) [ ( i 1 ) h , ( i + s + 1 ) h ] ,  where s is a natural number. Then for  t p = ζ p h ,   p N ,  and  t ( j h , ( j + 1 ) h ] ,   i 1 j i + s ,  we have that  t + ζ p h ( ( j + ζ p ) h , ( j + ζ p + 1 ) h ] ,  and  ξ ( t ( j + ζ p ) h ) = ξ ( t j h ) .
Denote  M = sup t ( 0 , h ] ξ ( t ) .  For a fixed positive number  ϵ ,  and sufficiently large number p, it is true that  | μ j + ζ p μ j | < ϵ M ,   i 1 j i + s .  Therefore, for  t ( l h , ( l + 1 ) h ] ,  where l is a fixed integer number from  i 1  to  i + s ,  one can obtain that
π ( t + t p ) π ( t )   =   π ( t + ζ p h ) π ( t )   =   μ l + ζ p ξ ( t ( l + ζ p ) h ) μ l ξ ( t l h ) = | μ l + ζ p μ j | ξ ( t l h ) | μ l + ζ p μ l | M < ϵ .
The last inequality is valid for all  i 1 l i + s .  Consequently,  π ( t + t p ) π ( t ) < ϵ  if  t ( α , β ) .  Thus, the function  π ( t )  satisfies the convergence property.
We have that there exists a positive number  ϵ 0 ,  and the sequence  η p ,   η p  as  p ,  such that  | μ ζ p + η p μ η p | > ϵ 0  for each  p N .
From  t p = ζ p h ,   p = 1 , 2 , ,  and  t ( η p h + s δ , η p h + s + δ ]  it follows that  t + t p = t + ζ p h ( ( ζ p + η p ) h + s δ , ( ζ p + η p ) h + s + δ ] .  Therefore,  ξ ( t + t p ) = ξ ( t ( ζ p + η p ) h ) = ξ ( t η p h ) ,   p = 1 , 2 , .  We obtain that
π ( t + t p ) π ( t )   =   μ ζ p + η p ξ ( t ( ζ p + η p ) h ) μ η p ξ ( t ζ p h ) = | μ ζ p + η p μ η p | ξ ( t η p h ) > ϵ 0 ϵ 1 > 0 ,
for all  t ( η p h + s δ , η p h + s + δ ] ,   p = 1 , 2 , .  Thus, the function  π ( t )  satisfies separation property, and one can conclude that it is unpredictable with positive numbers  ϵ * = ϵ 0 ϵ 1 ,   δ ,  and sequences  t p = ζ p h ,   s p = η p h + s ,   p = 1 , 2 , .
Continuous unpredictable function. Using the function  π ( t ) ,  we construct an integral function  Ξ ( t ) = t e α ( t s ) π ( s ) d s ,  where  α  is a positive real number. The function  Ξ ( t )  is bounded on  R  such that  sup t R Ξ ( t ) M π α ,  where  M π = sup t R π ( t ) .
Let us discuss the unpredictability of the function  Ξ ( t ) .  Firstly, we shall approve the convergence property. Fix an interval  [ a , b ] R  and a number  ϵ > 0 .  Applying the method of included intervals [26], we will show that  Ξ ( t + t p ) Ξ ( t )  uniformly on  [ a , b ] .  There exist numbers  ξ > 0  and  c < a ,  such that the following inequalities are valid,  2 M π α e α ( a c ) < ϵ 2  and  ξ α [ 1 e α ( b c ) ] < ϵ 2 .  Let p be a large enough number, such that  π ( t + t p ) π ( t ) < ξ  on  [ c , b ] .  We obtain that
Ξ ( t + t p ) Ξ ( t )   =   t e α ( t s ) ( π ( s + t p ) π ( s ) ) d s = c e α ( t s ) ( π ( s + t p ) π ( s ) ) d s + c t e α ( t s ) ( π ( s + t p ) π ( s ) ) d s c e α ( t s ) 2 M π d s + c t e α ( t s ) ξ d s 2 M π α e α ( a c ) + ξ α [ 1 e α ( b c ) ] < ϵ 2 + ϵ 2 = ϵ ,
for all  t [ a , b ] .  Thus,  Ξ ( t + t k ) Ξ ( t ) 0  as  k  uniformly on the interval  [ a , b ] ,  and the convergence property is fulfilled.
Next, we verify that the separation property is correct. Due to the unpredictability of the function  π ( t ) ,  we have that  π ( t + t p ) π ( t ) > ϵ *  for  t [ s p δ , s p + δ ] .  Fix a natural number p and positive  δ 1 < δ  such that  2 M π δ 1 α [ 1 e α δ 1 ] < ϵ * 3 α .  Consider two alternative cases: (i)  Ξ ( t p + s p ) Ξ ( s p ) < 2 δ 1 ϵ * 3 α ,   (ii)  Ξ ( t p + s p ) Ξ ( s p ) 2 δ 1 ϵ * 3 α .
It is easily seen that the following relation holds
Ξ ( t + t p ) Ξ ( t ) = Ξ ( t p + s p ) Ξ ( s p ) + s p t e α ( t s ) ( π ( s + t p ) π ( s ) ) d s .
(i) From the last relation, we obtain that
Ξ ( t + t p ) Ξ ( t ) s p t e α ( t s ) ( π ( s + t p ) π ( s ) ) d s Ξ ( t p + s p ) Ξ ( s p ) > s p t e α ( t s ) ϵ * d s 2 δ 1 ϵ * 3 α δ 1 ϵ * α 2 δ 1 ϵ * 3 α = δ 1 ϵ * 3 α
for  t [ s p δ 1 , s p + δ 1 ] .
(ii) Using the relation (23), we obtain that
Ξ ( t + t p ) Ξ ( t ) Ξ ( t p + s p ) Ξ ( s p ) s p t e α ( t s ) ( π ( s + t p ) π ( s ) ) d s > 2 δ 1 ϵ * 3 α s p t e α ( t s ) 2 M π d s 2 δ 1 ϵ * 3 α 2 M π δ 1 α [ 1 e α δ 1 ] > δ 1 ϵ * 3 α
for  t [ s p δ 1 , s p + δ 1 ] .  The inequalities (24) and (25) prove that the separation property is valid. Thus, the function  Ξ ( t )  is unpredictable with positive numbers  ϵ 1 = δ 1 ϵ * 3 α ,   δ 1  and sequences  t p ,   s p .
Below, we will use the continuous unpredictable function  Ξ ( t ) = t e 3 ( t s ) π ( s ) d s ,  where  π ( t ) = μ i cos ( t i h ) ,   t ( i h , ( i + 1 ) h ] ,   i Z ,  as a component of compartmental periodic unpredictable coefficients. The number h is said to be the length of step of functions  π ( t )  and  Ξ ( t ) .  For compartmental periodic unpredictable functions, the number  = ω / h ,  is called the degree of periodicity.
Let us consider the following compartmental periodic unpredictable function  f ( t ) = G ( t , t ) = 2 cos ( 0.1 t ) Ξ ( t ) + sin ( 0.2 t ) .  The function  G ( u , v )  is  20 π periodic in u uniformly with respect to  v ,  and unpredictable in v uniformly with respect to  u .  For the function  f ( t )  the degree of periodicity is equal to 200. In Figure 1 the graph of function  f ( t )  is shown.
The following lemma is used in the examples.
Lemma 5 
([33]). Assume that bounded function  g ( u ) : R n R n ,  satisfies the inequalities  L 1 u 1 u 2 g ( u 1 ) g ( u 2 ) L 2 u 1 u 2 ,  where  L 1 , L 2  are positive constants, for all  u 1 , u 2 R n .  Then the function  g ( ψ ( t ) )  is unpredictable, provided that  ψ ( t ) : R R n  is an unpredictable function.
Example 1. 
Let us consider the system:
d x i j ( t ) d t = ( a i j ( t ) + b i j ( t ) ) x i j ( t ) c k l N 1 ( i , j ) c i j k l ( t ) f ( x k l ( t ) ) x i j ( t ) + v i j ( t ) ,
with  i = 1 , 2 ,   j = 1 , 2 , 3 ,  and  f ( s ) = 0.25 tanh ( s ) .  The functions  c i j 11 ( t ) = 0.2 sin ( 2 t ) Ξ ( t ) ,   c i j 12 ( t ) = 0.1 sin ( t ) Ξ ( t ) ,   c i j 13 ( t ) = 0.3 cos ( 2 t ) Ξ ( t ) ,   c i j 21 ( t ) = 0.3 sin ( 2 t ) Ξ ( t ) ,   c i j 22 ( t ) = 0.1 cos ( t ) Ξ ( t )  and  c i j 23 ( t ) = 0.2 sin ( t ) Ξ ( t )  are compartmental periodic unpredictable. The functions  a i j ( t ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  are  2 π periodic:  a 11 ( t ) = 3 + sin ( t ) ,   a 12 ( t ) = 2 + cos ( t ) ,   a 13 ( t ) = 4 + sin ( 2 t ) ,   a 21 ( t ) = 5 + cos ( 4 t ) ,   a 22 ( t ) = 3 + cos ( 2 t ) ,   a 23 ( t ) = 2 + sin ( t ) .  According Lemma 5, the functions  b i j ( t )  and perturbation  v i j ( t )  are compartmental periodic unpredictable:  b 11 ( t ) = cos ( 4 t ) Ξ ( t ) ,   b 12 ( t ) = sin ( 2 t ) tanh ( Ξ ( t ) ) ,   b 13 ( t ) = sin ( 4 t ) Ξ ( t ) ,   b 21 ( t ) = cos ( 2 t ) arctan ( Ξ ( t ) ) ,   b 22 ( t ) = sin ( t ) Ξ ( t ) ,   b 23 ( t ) = cos ( 4 t ) Ξ ( t ) ,   v 11 ( t ) = 3 sin ( 2 t ) Ξ ( t ) ,   v 12 ( t ) = arctan ( Ξ ( t ) ) + 0.5 cos ( 2 t ) ,   v 13 ( t ) = 4 sin ( t ) Ξ ( t ) ,   v 21 ( t ) = 3 sin ( t ) arctan ( Ξ ( t ) ) ,   v 22 ( t ) = 0.4 cos ( 2 t ) Ξ ( t ) ,   v 23 ( t ) = cos ( 2 t ) Ξ ( t ) .  Condition (C1) is satisfied, and  K i j = 1.5 ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,   λ 11 = 6 π ,   λ 12 = 4 π ,   λ 13 = 8 π ,   λ 21 = 10 π ,   λ 22 = 6 π ,   λ 23 = 4 π .  Condition (C3) is valid since the elements of the convergence sequence  t p  are multiples of the length of step h and the period ω is equal to  2 π .  Conditions (C4)–(C7) are satisfied with  H = 0.8 ,   m f = π / 8 ,   L = 0.25 ,   max ( i , j ) m i j c = 2 / 15 ,   max ( i , j ) m i j b = 1 / 3 ,   m 11 v = 1 ,   m 12 v = 5 / 6 ,   m 13 v = 4 / 3 ,   m 21 v = 1 ,   m 22 v = 2 / 15  and  m 23 v = 1 / 3 .
By Theorem 2, the neural network (26) has a unique exponentially stable unpredictable solution  z ( t ) = ( z i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 .  Figure 2 and Figure 3 show the solution  x ( t ) = ( x i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  with the length of step  h = 2 π  and  h = 8 π ,  respectively. The solution  x ( t )  exponentially converges to the unpredictable solution  z ( t ) .
Example 2. 
Let us take into account the SICNNs (26) with  a 11 ( t ) = 3 + sin ( 0.1 t ) ,   a 12 ( t ) = 2 + cos ( 0.1 t ) ,   a 13 ( t ) = 4 + sin ( 0.2 t ) ,   a 21 ( t ) = 5 + cos ( 0.4 t ) ,   a 22 ( t ) = 3 + cos ( 0.2 t ) ,   a 23 ( t ) = 2 + sin ( 0.1 t ) ,   v 11 ( t ) = 3 sin ( 0.2 t ) Ξ ( t ) ,   v 12 ( t ) = arctan ( Ξ ( t ) ) + 0.5 cos ( 0.2 t ) ,   v 13 ( t ) = 4 sin ( 0.1 t ) Ξ ( t ) ,   v 21 ( t ) = 3 sin ( 0.1 t ) arctan ( Ξ ( t ) ) ,   v 22 ( t ) = 0.4 cos ( 0.2 t ) Ξ ( t ) ,   v 23 ( t ) = cos ( 0.2 t ) Ξ ( t ) .  The functions  b i j ( t )  and  c i j k l ( t )  are the same as in Example 1. The period ω is equal to  20 π .  In Figure 4, the graph of the solution of SICNNs (26) with the length of step  h = 0.2 π  and the degree of periodicity  = 100  is demonstrated.
Analysing the numerical simulations above, one can make interesting observations concerning dominance of periodicity and unpredictability in compartmental functions. Figure 2 and Figure 3 show that the unpredictability prevails if  1 .  More precisely, periodicity is not seen if  = 1  at all, and it appears only locally on isolated intervals, if  < 1 .  In contrast, if  > 1 ,  one can see in Figure 1 and Figure 4 that the graphs admit a clear periodic shape, which is enveloped by the unpredictability.

5. Conclusions

In this paper, we considered SICNNs with variable compartmental unpredictable coefficients and inputs. Sufficient conditions were obtained to ensure the existence of exponentially stable unpredictable and Poisson stable solutions. Effectiveness of neural networks strongly depend on the selection of the right inputs [7,8,9]. Obviously, one can consider them not to be constant, but variable. In this case, there are two significantly different sorts of continuous-type inputs, regular (such as periodic, almost periodic, and recurrent) [10,11,12,13,14,15,16,17], and irregular or chaotic [44,45]. The choice of chaotic bias is an effective approach, since it is rich for infinitely many various motions, and periodic and almost periodic [46] are among them. The motions can be stabilized by different methods of control [47]. Recently, we have started to work with chaotic dynamics being focused on a single motion, the unpredictable point. The point is an unpredictable function [42], if the space is a functional one. The dynamics on the closure of the trajectory was named Poincaré chaos. Thus, all benefits of neural networks with chaotic inputs are also valid for the unpredictable dynamics in neuroscience. Additionally, new characteristics to synchronize have been determined [28,29], the convergence and divergence sequences. The characteristics make convenient circumstances for collective analysis of the neural networks. It deserves to be mentioned that the reduction in chaotic analysis to a single motion provides new possibilities for numerical simulations of neural networks, and this was seen in the present paper. We compared Figure 1, Figure 2, Figure 3 and Figure 4 with experimental data in the Refs. [34,35,36,37,38], and it was found that they are surprisingly similar. It means that the compartmental motions can find applications in solutions of industrial problems. Finally, the effectiveness of the compartmental approach to the unpredictability was shown by analysis of contributions of periodicity and unpredictability in the outputs, and it was just the first step in the direction of application of the research, since the next ones will be connected to control of chaos, which will be applied to the compartments’ parameters separately. Moreover, it will be productive if the compartmental nature of the dynamics will be taken into account for synchronization research [28,29,47,48,49].

Author Contributions

M.A.: conceptualization; methodology; investigation. M.T.: investigation; supervision; writing—review and editing. A.Z.: software; investigation; writing—original draft. All authors have read and agreed to the published version of the manuscript.

Funding

M. Akhmet and A. Zhamanshin have been supported by 2247-A National Leading Researchers Program of TUBITAK, Turkey, N 120C138. M. Tleubergenova has been supported by the Science Committee of the Ministry of Education and Science of the Republic of Kazakhstan (grant No. AP14870835).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The authors wish to express their sincere gratitude to the referees for the helpful criticism and valuable suggestions, which helped to improve the paper significantly.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Chua, L.; Yang, L. Cellular neural networks: Theory. IEEE Trans. Circuits Syst. 1988, 35, 1257–1272. [Google Scholar] [CrossRef]
  2. Chua, L.; Yang, L. Cellular neural networks: Applications. IEEE Trans. Circuits Syst. 1988, 35, 1273–1290. [Google Scholar] [CrossRef]
  3. Bouzerdoum, A.; Pinter, R. Shunting inhibitory cellular neural networks: Derivation and stability analysis. IEEE Trans. Circuits Syst. I Fundam. Theory Appl. 1993, 40, 215–221. [Google Scholar] [CrossRef]
  4. Arulampalam, G.; Bouzerdoum, A. Application of shunting inhibitory artificial neural networks to medical diagnosis. In Proceedings of the 7th Australian and New Zealand Intelligent Information Systems Conference, ANZIIS 2001, University of Western, Perth, WA, Australia, 18–20 November 2001; pp. 89–94. [Google Scholar]
  5. Cheung, H.N.; Bouzerdoum, A.; Newland, W. Properties of shunting inhibitory cellular neural networks for colour image enhancement. In Proceedings of the 6th International Conference on Neural Information Processing, Perth, WA, Australia, 16–20 November 1999; pp. 1219–1223. [Google Scholar]
  6. Hammadou, T.; Bouzerdoum, A. Novel image enhancement technique using shunting inhibitory cellular neural networks. IEEE Trans. Consum. Electron. 2001, 47, 934–940. [Google Scholar] [CrossRef]
  7. Carpenter, G.A.; Grossberg, S. The ART of adaptive pattern recognition by a selforganizing neural network. Computer 1988, 21, 77–88. [Google Scholar] [CrossRef]
  8. Pinter, R.B.; Olberg, R.M.; Warrant, E. Luminance adaptation of preferred object size in identified dragonfly movement detectors. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Cambridge, MA, USA, 14–17 November 1989; pp. 682–686. [Google Scholar]
  9. Fukushima, K. Analysis of the process of visual pattern recognition by the neocognitron. Neural Netw. 1989, 2, 413–420. [Google Scholar] [CrossRef]
  10. Li, Y.; Wang, L.; Fei, Y. Periodic Solutions for Shunting Inhibitory Cellular Neural Networks of Neutral Type with Time-Varying Delays in the Leakage Term on Time Scales. J. Appl. Math. 2014, 2014, 496396. [Google Scholar] [CrossRef] [Green Version]
  11. Li, Y.K.; Liu, C.C.; Zhu, L.F. Global exponential stability of periodic solution for shunting inhibitory CNNs with delays. Phys. Lett. A 2005, 337, 46–54. [Google Scholar] [CrossRef]
  12. Fan, Q.Y.; Shao, J.Y. Positive almost periodic solutions for shunting inhibitory cellular neural networks with time-varying and continuously distributed delays. Commun. Nonlinear Sci. Numer. Simul. 2010, 15, 1655–1663. [Google Scholar] [CrossRef]
  13. Peng, G.; Li, L. Anti–periodic solutions for shunting inhibitory cellular neural networks with continuously distributed delays. Nonlinear Anal. Real World Appl. 2009, 10, 2434–2440. [Google Scholar] [CrossRef]
  14. Huang, C.; Wen, S.; Huang, L. Dynamics of anti–periodic solutions on shunting inhibitory cellular neural networks with multi-proportional delays. Neurocomputing 2019, 357, 47–52. [Google Scholar] [CrossRef]
  15. Ou, C. Almost periodic solutions for shunting inhibitory cellular neural networks. Nonlinear Anal. Real World Appl. 2019, 10, 2652–2658. [Google Scholar] [CrossRef]
  16. Li, Y.; Meng, X. Almost periodic solutions for quaternion-valued shunting inhibitory cellular neural networks of neutral type with time delays in the leakage term. Int. J. Syst. Sci. 2018, 49, 2490–2505. [Google Scholar] [CrossRef]
  17. Li, Y.; Wang, C. Almost periodic solutions of shunting inhibitory cellular neural networks on time scales. Commun. Nonlinear Sci. Numer. Simul. 2018, 17, 3258–3266. [Google Scholar] [CrossRef]
  18. Lu, Y.; Ji, D. Pseudo almost periodic solutions for shunting inhibitory cellular neural networks with continuously distributed delays. J. Inequalities Appl. 2017, 2017, 242. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  19. Zhang, A. Pseudo Almost Periodic Solutions for SICNNs with Oscillating Leakage Coefficients and Complex Deviating Arguments. Neural Process. Lett. 2017, 45, 183–196. [Google Scholar] [CrossRef]
  20. Akhmet, M.; Seilova, R.; Tleubergenova, M.; Zhamanshin, A. Shunting inhibitory cellular neural networks with strongly unpredictable oscillations. Commun. Nonlinear Sci. Numer. Simul. 2020, 89, 105287. [Google Scholar] [CrossRef]
  21. Fen, M.O.; Tokmak Fen, F. Unpredictable oscillations of SICNNs with delay. Neurocomputing 2021, 464, 119–129. [Google Scholar] [CrossRef]
  22. Akhmet, M.; Tleubergenova, M.; Seilova, R.; Nugayeva, Z. Poisson Stability in Symmetrical Impulsive Shunting Inhibitory Cellular Neural Networks with Generalized Piecewise Constant Argument. Symmetry 2022, 14, 1754. [Google Scholar] [CrossRef]
  23. Akhmet, M.; Tleubergenova, M.; Zhamanshin, A. Dynamics of Shunting Inhibitory Cellular Neural Networks with Variable Two-Component Passive Decay Rates and Poisson Stable Inputs. Symmetry 2022, 14, 1162. [Google Scholar] [CrossRef]
  24. Corduneanu, C. Almost Periodic Oscillations and Waves; Springer: New York, NY, USA, 2009. [Google Scholar]
  25. Besicovitch, A. Almost Periodic Functions; Dover: Cambridge, UK, 1954. [Google Scholar]
  26. Akhmet, M.; Tleubergenova, M.; Zhamanshin, A. Modulo periodic Poisson stable solutions of quasilinear differential equations. Entropy 2021, 23, 1535. [Google Scholar] [CrossRef]
  27. Akhmet, M.; Tleubergenova, M.; Zhamanshin, A. Compartmental Poisson Stability in Non-autonomous Differential Equations. In Nonlinear Dynamics and Complexity; Pinto, C.M., Ed.; Springer: Cham, Switzerland, 2022; pp. 1–23. [Google Scholar]
  28. Akhmet, M.; Başkan, K.; Yeşil, C. Delta synchronization of Poincaré chaos in gas discharge-semiconductor systems. Chaos 2022, 32, 083137. [Google Scholar] [CrossRef]
  29. Akhmet, M.; Yeşil, C.; Başkan, K. Synchronization of chaos in semiconductor gas discharge model with local mean energy approximation. Chaos Solitons Fractals 2023, 167, 113035. [Google Scholar] [CrossRef]
  30. Rulkov, N.; Sushchik, M.; Tsimring, L.; Abarbanel, H. Generalized synchronization of chaos in directionally coupled chaotic systems. Phys. Rev. E 1995, 51, 980. [Google Scholar] [CrossRef] [PubMed]
  31. Akhmet, M.; Fen, M.; Tola, A. A Numerical Analysis of Poincaré Chaos. Discontinuity Nonlinearity Complex. 2023, 12, 183–195. [Google Scholar] [CrossRef]
  32. Akhmet, M.; Fen, M.; Tola, A. Strange Non-Chaotic Attractors with Unpredictable Trajectories. J. Vib. Test. Syst. Dyn. 2022, 6, 317–327. [Google Scholar]
  33. Akhmet, M.; Tleubergenova, M.; Zhamanshin, A. Compartmental unpredictable functions. Mathematics 2023, 11, 1069. [Google Scholar] [CrossRef]
  34. Zhang, H.; Lu, H.; Nayak, A. Periodic time series data analysis by deep learning methodology. IEEE Access 2020, 8, 78–88. [Google Scholar] [CrossRef]
  35. Li, X.; Xu, F.; Zhang, J.; Wang, S. A multilayer feed forward small-world neural network controller and its application on electrohydraulic actuation system. J. Appl. Math. 2013, 1, 211–244. [Google Scholar] [CrossRef] [Green Version]
  36. Wei, Y.; Zhang, Q. Square wave analysis. In Common Waveform Analysis; Cai, K.Y., Ed.; Springer: Boston, MA, USA, 2000; pp. 13–40. [Google Scholar]
  37. Mohammad, U.; Yasin, M.; Yousuf, R.; Anwar, I. A novel square wave generator based on the translinear circuit scheme of second generation current controlled current conveyor–CCCII. SN Appl. Sci. 2019, 1, 587. [Google Scholar] [CrossRef] [Green Version]
  38. Wu, U.; Yasin, M.; Yousuf, R.; Anwar, I. Deep convolutional neural network for structural dynamic response estimation and system identification. J. Eng. Mech. Appl. Sci. 2019, 145, 04018125. [Google Scholar] [CrossRef]
  39. Landau, L. On the Nature of Turbulence. C. R. Dokl. Acad. Sci. USSR 1944, 44, 311314. [Google Scholar]
  40. Ruelle, D.; Takens, F. On the Nature of Turbulence. Commun. Math. Phys. 1971, 20, 167–192. [Google Scholar] [CrossRef]
  41. Sell, G. Topological Dynamics and Ordinary Differential Equations; Van Nostrand Reinhold Company: London, UK, 1971. [Google Scholar]
  42. Akhmet, M.; Fen, M.O. Poincaré chaos and unpredictable functions. Commun. Nonlinear Sci. Nummer. Simulat. 2017, 48, 85–94. [Google Scholar] [CrossRef] [Green Version]
  43. Hartman, P. Ordinary Differential Equations; Birkhauser: Boston, MA, USA, 2002. [Google Scholar]
  44. Gui, Z.; Ge, W. Periodic solution and chaotic strange attractor for shunting inhibitory cellular neural networks with impulses. Chaos 2006, 16, 033116. [Google Scholar] [CrossRef]
  45. Sun, J. Stationary oscillation for chaotic shunting inhibitory cellular neural networks with impulses. Chaos 2007, 17, 043123. [Google Scholar] [CrossRef] [PubMed]
  46. Akhmet, M. Almost Periodicity, Chaos, and Asymptotic Equivalence; Springer: New York, NY, USA, 2020. [Google Scholar]
  47. Gonzáles-Miranda, J.M. Synchronization and Control of Chaos; Imperial College Press: London, UK, 2004. [Google Scholar]
  48. Zhang, Z.; Cao, J. Finite-Time Synchronization for Fuzzy Inertial Neural Networks by Maximum Value Approach. IEEE Trans Fuzzy Syst. 2022, 30, 1436–1446. [Google Scholar] [CrossRef]
  49. Zhang, Z.; Cao, J. Novel Finite-Time Synchronization Criteria for Inertial Neural Networks With Time Delays via Integral Inequality Method. IEEE Trans. Neural Netw. Learn. Syst. 2019, 30, 1476–1485. [Google Scholar] [CrossRef] [PubMed]
Figure 1. The graph of compartmental periodic unpredictable function  f ( t ) .  The length of step  h = 0.1 π ,  and degree of periodicity  = 200 .
Figure 1. The graph of compartmental periodic unpredictable function  f ( t ) .  The length of step  h = 0.1 π ,  and degree of periodicity  = 200 .
Mathematics 11 01367 g001
Figure 2. The time series of the solution  x ( t ) = ( x i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  of the system (26) with initial values  x 11 ( 0 ) = 0.2 ,   x 12 ( 0 ) = 0.3 ,   x 13 ( 0 ) = 0.1 ,   x 21 ( 0 ) = 0.2 ,   x 22 ( 0 ) = 0.1 ,   x 23 ( 0 ) = 0.1 ,  and the degree of periodicity  = 1 .
Figure 2. The time series of the solution  x ( t ) = ( x i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  of the system (26) with initial values  x 11 ( 0 ) = 0.2 ,   x 12 ( 0 ) = 0.3 ,   x 13 ( 0 ) = 0.1 ,   x 21 ( 0 ) = 0.2 ,   x 22 ( 0 ) = 0.1 ,   x 23 ( 0 ) = 0.1 ,  and the degree of periodicity  = 1 .
Mathematics 11 01367 g002
Figure 3. The graph of the solution  x ( t ) = ( x i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  of SICNNs (26) with the initial values  x 11 ( 0 ) = 0.2 ,   x 12 ( 0 ) = 0.3 ,   x 13 ( 0 ) = 0.1 ,   x 21 ( 0 ) = 0.2 ,   x 22 ( 0 ) = 0.1 ,   x 23 ( 0 ) = 0.1 ,  and the degree of periodicity  = 1 / 4 .
Figure 3. The graph of the solution  x ( t ) = ( x i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  of SICNNs (26) with the initial values  x 11 ( 0 ) = 0.2 ,   x 12 ( 0 ) = 0.3 ,   x 13 ( 0 ) = 0.1 ,   x 21 ( 0 ) = 0.2 ,   x 22 ( 0 ) = 0.1 ,   x 23 ( 0 ) = 0.1 ,  and the degree of periodicity  = 1 / 4 .
Mathematics 11 01367 g003
Figure 4. The graph of the solution  x ( t ) = ( x i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  of SICNNs (26) with the initial values  x 11 ( 0 ) = 0.2 ,   x 12 ( 0 ) = 0.3 ,   x 13 ( 0 ) = 0.1 ,   x 21 ( 0 ) = 0.2 ,   x 22 ( 0 ) = 0.1 ,   x 23 ( 0 ) = 0.1 ,  and the degree of periodicity  = 100 .
Figure 4. The graph of the solution  x ( t ) = ( x i j ( t ) ) ,   i = 1 , 2 ,   j = 1 , 2 , 3 ,  of SICNNs (26) with the initial values  x 11 ( 0 ) = 0.2 ,   x 12 ( 0 ) = 0.3 ,   x 13 ( 0 ) = 0.1 ,   x 21 ( 0 ) = 0.2 ,   x 22 ( 0 ) = 0.1 ,   x 23 ( 0 ) = 0.1 ,  and the degree of periodicity  = 100 .
Mathematics 11 01367 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Akhmet, M.; Tleubergenova, M.; Zhamanshin, A. Shunting Inhibitory Cellular Neural Networks with Compartmental Unpredictable Coefficients and Inputs. Mathematics 2023, 11, 1367. https://doi.org/10.3390/math11061367

AMA Style

Akhmet M, Tleubergenova M, Zhamanshin A. Shunting Inhibitory Cellular Neural Networks with Compartmental Unpredictable Coefficients and Inputs. Mathematics. 2023; 11(6):1367. https://doi.org/10.3390/math11061367

Chicago/Turabian Style

Akhmet, Marat, Madina Tleubergenova, and Akylbek Zhamanshin. 2023. "Shunting Inhibitory Cellular Neural Networks with Compartmental Unpredictable Coefficients and Inputs" Mathematics 11, no. 6: 1367. https://doi.org/10.3390/math11061367

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop