Next Article in Journal
Existence and Multiplicity of Solutions to a Class of Fractional p-Laplacian Equations of Schrödinger-Type with Concave-Convex Nonlinearities in ℝN
Next Article in Special Issue
Inertial Neural Networks with Unpredictable Oscillations
Previous Article in Journal
A Method for Transportation Planning and Profit Sharing in Collaborative Multi-Carrier Vehicle Routing
Previous Article in Special Issue
Sage Revised Reiterative Even Zernike Polynomials Neural Network Control with Modified Fish School Search Applied in SSCCRIM Impelled System
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Strongly Unpredictable Oscillations of Hopfield-Type Neural Networks

by
Marat Akhmet
1,*,
Madina Tleubergenova
2,3 and
Zakhira Nugayeva
2,3
1
Department of Mathematics, Middle East Technical University, 06800 Ankara, Turkey
2
Department of Mathematics, Aktobe Regional State University, Aktobe 030000, Kazakhstan
3
Institute of Information and Computational Technologies CS MES RK, Almaty 050000, Kazakhstan
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(10), 1791; https://doi.org/10.3390/math8101791
Submission received: 8 September 2020 / Revised: 5 October 2020 / Accepted: 9 October 2020 / Published: 15 October 2020
(This article belongs to the Special Issue Neural Networks and Learning Systems)

Abstract

:
In this paper, unpredictable oscillations in Hopfield-type neural networks is under investigation. The motion strongly relates to Poincaré chaos. Thus, the importance of the dynamics is indisputable for those problems of artificial intelligence, brain activity and robotics, which rely on chaos. Sufficient conditions for the existence and uniqueness of exponentially stable unpredictable solutions are determined. The oscillations continue the line of periodic and almost periodic motions, which already are verified as effective instruments of analysis and applications for image recognition, information processing and other areas of neuroscience. The concept of strongly unpredictable oscillations is a significant novelty of the present research, since the presence of chaos in each coordinate of the space state provides new opportunities in applications. Additionally to the theoretical analysis, we have provided strong simulation arguments, considering that all of the assumed conditions are fulfilled.

1. Introduction

The Hopfield type neural networks were first developed in 1982 [1], through establishing the connection of neural networks with physical systems considered in statistical mechanics [2]. Hopfield neural network is an artificial neural network for storing and retrieving memory similar to the human brain. In the last decades, many works have been devoted to the study of Hopfield type neural networks. For example, periodic and almost periodic solutions [3,4], exponential stability [5,6,7], domain of attraction and convergence rate [8,9,10] have been deeply investigated.
The deterministic model proposed by J. Hopfield [11] is based on continuous variables and responses. The model contains a set of neurons and each neuron has the same architectural connection. More precisely, it is a single-layered and recurrent network where each neuron is connected to other neurons. Therefore, neurons are modeled as amplifiers combined with feedback circuits made up of wires, resistors and capacitors.
Oscillations are important in the human brain activity, they are relative to various cognitive tasks. The theory of oscillations in neural systems is widespread and successfully applied in the field of neuroscience [12]. The investigation of neural networks with chaotic oscillations has been of strong interest of numerous researchers [13,14,15]. Chaos is useful in many applications of neural networks such as separating image segments [16,17,18,19], synchronization [20,21,22], pattern recognition [23] and information processing [24].
Chaotic oscillations were widely studied in human physiological systems and particularly in the dynamics of human brain [24,25,26]. Chaotic behavior resulting from self-organized processes in the human brain could explain “randomness” of neural synchronization associated with cognitive functions and consciousness, as well as mental disorganization associated with psycho pathological phenomena [27,28,29].
The methodical background of the present research lies entirely in the theory of dynamical systems founded by H. Poincaré and G. Birkhoff [30,31]. It was the French genius, who determined that underneath of chaotic dynamics is the Poisson stable motion. In papers [32,33], we continue the line of different types of oscillations. It was proved that a Poisson stable motion equipped with the unpredictability property determines sensitivity in the quasi-minimal set. Thus, the painting of Poincaré on chaos dynamics, had been completed. It is usual that dynamical properties generate functional ones. For example, recurrent or almost periodic motions allow us to define recurrent and almost periodic functions, respectively. Similarly, issuing from the unpredictable point introduced in [32], in paper [33], the unpredictable function was defined as a point of the Bebutov dynamics, where the state space is a set of functions. In our next research [34], we have learned that the metrical state space of the Bebutov dynamics can be replaced with the topological space, where convergence of functions on compact sets of the real axis is applied. The space is metrizable. This made our suggestions more universal and effective in applications, since constructive verifiable conditions were proposed. The method has been realized in several papers [32,33,34,35,36,37,38] and the book [39]. In the present study it is applied in the circumstances of the Hopfield neural network with the unpredictability happen in each coordinate of the motion. This is why, besides new application opportunities, we meet additional theoretical challenges.
A new type of oscillations, which are described by unpredictable functions, was introduced in [32]. It relies on the dynamics of unpredictable points and Poincaré chaos [33]. Unpredictable points and unpredictable functions promise to be useful in the further development in theory of chaos. For instance, the unpredictable points are used by A. Miller in [40], R. Thakur and R. Das in [41], where they considered Poincaré chaos, strongly Ruelle–Takens chaos and strongly Auslander–Yorke chaos in semiflow. The study of unpredictable functions have been widely developed both theoretically [32,33,34,35,36,37,38], as well as in applications [39,42,43]. In paper [43], a new randomly defined unpredictable function was introduced. Thus, the list of unpredictable functions has been essentially extended. Now, it is possible to determine unpredictable functions by simulation discrete stochastic processes. Moreover, existence of unpredictable oscillations can be considered for differential equations of various types.
In this article, we have designed the new model of Hopfield type neural networks with unpredictable perturbations and derive sufficient conditions of the existence, uniqueness, and asymptotic stability of the strongly unpredictable oscillations, which develop previously known results in [3,4,5,6,7,8,9,10], and others.
This paper is organized as follows. The main results of the present study are placed in Section 3, where the existence, uniqueness and stability of strongly unpredictable oscillations of Hopfield-type neural networks systems are investigated. The topology of uniform convergence on compact sets and the contraction mapping principle are utilized to prove the existence of the unpredictable motions. In Section 4, we demonstrate examples of unpredictable solutions, which support theoretical discussions of the paper. Finally, in Section 5, the results of the article are outlined.

2. Preliminaries

The main subjects under investigation in this paper are the following Hopfield-type neural networks:
x i ( t ) = a i x i ( t ) + j = 1 p b i j f j ( x j ( t ) ) + v i ( t ) ,
where t is the time variable, p denotes the number of neurons in the network, x i ( t ) , i = 1 , 2 , , p corresponds to the membrane potential of the unit i, at time t . Moreover, a i > 0 , i = 1 , 2 , , p are constant rates with which the units self-regulate or reset their potential when isolated from other units and inputs, f i with i = 1 , 2 , , p , denotes the measures of activation to its incoming potentials of the unit i at time t, the constants b i j , i = 1 , 2 , , p , j = 1 , 2 , , p , denote the synaptic connection weight of the unit j on the unit i. The function v i corresponds to the external input from outside the network to the unit i, for i = 1 , 2 , , p .
Let R and N be the set of real and natural numbers, respectively.
We assume that the coefficients b i j are real numbers, the activation functions f i : R R , and perturbations v i : R R are continuous functions. Additionally, we introduce the norm v = max 1 i p v i , where · is the absolute value, v = ( v 1 , , v p ) and v i R , i = 1 , 2 , , p .
Let us commence with a preliminary definition of the unpredictable sequence.
Definition 1.
[35] A bounded sequence { i k } , k Z , in R p is called unpredictable if there exist a positive number ε 0 and sequences { ζ n } , { η n } , n N , of positive integers both of which diverge to infinity such that | i k + ζ n i k | 0 as n for each k in bounded intervals of integers and | i ζ n + η n i η n | ε 0 for each n N .
The following definition is one of the main in our study.
Definition 2.
[32] A uniformly continuous and bounded function u : R R p is unpredictable if there exist positive numbers ϵ 0 , δ and sequences t n , s n , both of which diverge to infinity such that u ( t + t n ) u ( t ) as n uniformly on compact subsets of R and u ( t + t n ) u ( t ) ϵ 0 for each t [ s n δ , s n + δ ] and n N .
From the last definition, it implies that some coordinates may not be scalar valued unpredictable functions. That is why it is of significant importance for applications to consider functions with unpredictability in all their coordinates—strongly unpredictable functions.
Definition 3.
A uniformly continuous and bounded function u : R R p , u = ( u 1 , u 2 , , u p ) , is strongly unpredictable if there exist positive numbers ϵ 0 , δ and sequences t n , s n , both of which diverge to infinity such that u ( t + t n ) u ( t ) as n uniformly on compact subsets of R and | u i ( t + t n ) u i ( t ) | ϵ 0 for each i = 1 , , p , t [ s n δ , s n + δ ] and n N .
Based on the Definition 2, it is easy to indicate that any strongly unpredictable function is an unpredictable function, but not vice versa. Furthermore, each of the functions u i ( t ) , i = 1 , , p , in the Definition 3 are unpredictable in the sense of the Definition 2.

3. Main Results

Denote by P the space of vector-functions, φ : R R p , φ = ( φ 1 , φ 2 , , φ p ) , with norm φ 1 = sup t R φ ( t ) , satisfying the following conditions:
  • (U1) φ ( t ) are uniformly continuous;
  • (U2) there exists a positive number H such that φ 1 < H , for all φ ( t ) P ;
  • (U3) there exists a sequence t n , t n as n , such that for each φ ( t ) P the sequence φ ( t + t n ) uniformly converges to φ ( t ) on compact subsets.
We will need the following conditions:
  • (C1) the function v ( t ) = ( v 1 ( t ) , v 2 ( t ) , , v p ( t ) ) , t , v i ( t ) R , i = 1 , 2 , , p , in (1) belongs to space P and there exist positive numbers ϵ 0 , δ and sequences s n as n , which satisfy | v i ( t + t n ) v i ( t ) | ϵ 0 for each t [ s n δ , s n + δ ] , i = 1 , 2 , , p and n N such that the function is strongly unpredictable;
  • (C2) there exists a positive number L, such that | f i ( u ) f i ( v ) | L | u v | , i = 1 , 2 , , p , for all u , v R ;
  • (C3) the inequalities 1 < γ a i γ ¯ , i = 1 , 2 , , p , are valid with positive numbers γ and γ ¯ ;
  • (C4) v i ( t ) H and f i ( t ) m ¯ i , where m ¯ i is a positive number, for all i = 1 , 2 , , p and t R ;
  • (C5) j = 1 p | b i j | m ¯ j γ 1 < H ;
  • (C6) L max i j = 1 p | b i j | < γ .
In the following, the next assertion is used:
Lemma 1.
[44] A function x ( t ) = ( x 1 ( t ) , , x p ( t ) ) is a bounded solution of Equation (1), if and only if it is a solution of the following integral equation:
x i ( t ) = t e a i ( t s ) j = 1 p b i j f j ( x j ( s ) ) + v i ( s ) d s
for all i = 1 , 2 , , p .
Let us introduce in the space P the following operator, Π φ ( t ) = ( Π 1 φ ( t ) , Π 2 φ ( t ) , , Π p φ ( t ) ) , where
Π i φ ( t ) = t e a i ( t s ) j = 1 p b i j f j ( φ j ( s ) ) + v i ( s ) d s
for all i = 1 , 2 , , p .
Lemma 2.
The operator Π is invariant in P .
Proof. 
To prove the lemma, one needs to verify conditions (U1)–(U3).
One can check that
d Π i φ ( t ) d t = j = 1 p b i j f j ( φ j ( t ) ) + v i ( t ) a i t e a i ( t s ) j = 1 p b i j f j ( φ j ( s ) ) + v i ( s ) d s j = 1 p | b i j | | f j ( φ j ( t ) ) | + | v i ( t ) | + γ ¯ t e γ ( t s ) j = 1 p | b i j | | f j ( φ j ( s ) ) | + | v i ( s ) | d s max i j = 1 p | b i j | m ¯ j + H + γ ¯ γ max i j = 1 p | b i j | m ¯ j + H = 1 + γ ¯ γ max i j = 1 p | b i j | m ¯ j + H <
for all i = 1 , 2 , , p , and t R . That is, the derivatives are bounded and consequently the condition (U1) for Π φ ( t ) is valid.
Now, we will demonstrate that Π φ ( t ) satisfies the condition ( U 2 ) . For a function φ ( t ) P and fixed i = 1 , 2 , , p , we have that
| Π i φ ( t ) | = t e a i ( t s ) j = 1 p b i j f j ( φ j ( s ) ) + v i ( s ) d s t e γ ( t s ) j = 1 p | b i j | | f j ( φ j ( s ) ) | + | v i ( s ) | d s 1 γ max i j = 1 p | b i j | m ¯ j + H .
The last inequality and condition (C5) imply that Π φ 1 < H .
Next, will show that the sequence Π φ ( t + t n ) Π φ ( t ) as n uniformly on compact subsets.
Fix an arbitrary ϵ > 0 and a section [ a , b ] , < a < b < .
Choose numbers c < a and ϵ ξ > 0 , such that
2 H γ L j = 1 p | b i j | + 1 e γ ( a c ) ϵ 2 ,
and
ϵ ξ γ L j = 1 p | b i j | + 1 ϵ 2
for all i = 1 , 2 , , p .
Consider the number n large enough for | φ i ( t + t n ) φ i ( t ) | < ϵ ξ and | v i ( t + t n ) v i ( t ) | < ϵ ξ , i = 1 , 2 , , p , on [ c , b ] . For a function φ ( t ) belonging to P and fixed i = 1 , 2 , , p , it is true that
| Π i φ ( t + t n ) Π i φ ( t ) | = t + t n e a i ( t + t n s ) j = 1 p b i j f j ( φ j ( s ) ) + v i ( s ) d s t e a i ( t s ) j = 1 p b i j f j ( φ j ( s ) ) + v i ( s ) d s = t e a i ( t s ) j = 1 p b i j [ f j ( φ j ( s + t n ) ) f j ( φ j ( s ) ) ] + [ v i ( s + t n ) v i ( s ) ] d s t e γ ( t s ) j = 1 p | b i j | L | φ j ( s + t n ) φ j ( s ) | + | v i ( s + t n ) v i ( s ) | d s .
This is why, for all t [ a , b ] and i = 1 , 2 , , p , we obtain that
| Π i φ ( t + t n ) Π i φ ( t ) | c e γ ( t s ) j = 1 p | b i j | L | φ j ( s + t n ) φ j ( s ) | + | v i ( s + t n ) v i ( s ) | + c t e γ ( t s ) j = 1 p | b i j | L | φ j ( s + t n ) φ j ( s ) | + | v i ( s + t n ) v i ( s ) | d s 2 H γ L j = 1 p | b i j | + 1 e γ ( a c ) + ϵ ξ γ L j = 1 p | b i j | + 1 ,
and inequalities (4) and (5) imply that | Π i φ ( t + t n ) Π i φ ( t ) | ϵ , t [ a , b ] , i = 1 , 2 , , p . Therefore, the function Π φ ( t ) satisfies (U3). □
Lemma 3.
If conditions ( C 1 ) ( C 6 ) are valid, then Π is a contraction operator.
Proof. 
Let us take two functions φ , ψ P such that φ = ( φ 1 , , φ p ) , and ψ = ( ψ 1 , , ψ p ) . We have that for a fixed t R ,
| Π i φ ( t ) Π i ψ ( t ) | = t e a i ( t s ) j = 1 p b i j [ f j ( φ j ( s ) ) f j ( ψ j ( s ) ) ] d s t e γ ( t s ) j = 1 p | b i j | L | φ j ( s ) ψ j ( s ) | d s 1 γ max i j = 1 p | b i j | L φ ( t ) ψ ( t ) 1 .
Therefore, Π φ ( t ) Π ψ ( t ) 1 1 γ max i j = 1 p | b i j | L φ ( t ) ψ ( t ) 1 , and condition (C6) imply that Π is a contraction operator in P . □
Theorem 1.
Assume that the function v = ( v 1 , v 2 , , v p ) in system (1) is strongly unpredictable and conditions (C2)–(C6) are fulfilled. Then, the system (1) admits a unique asymptotically stable strongly unpredictable solution.
Proof. 
Firstly, let us check the completeness of the space P . Consider a Cauchy sequence ϕ k ( t ) in P , which converges to a limit function ϕ ( t ) on R . We start with the condition ( U 3 ) , because other two properties can be easily checked. Fix a closed, bounded interval I R . We get that
ϕ ( t + t n ) ϕ ( t ) ϕ ( t + t n ) ϕ k ( t + t n ) + ϕ k ( t + t n ) ϕ k ( t ) + ϕ k ( t ) ϕ ( t ) .
Choose sufficiently large n and k, so that each term on the right side of (6) is smaller than ϵ 3 for an arbitrary ϵ > 0 and t I . Thus, one can conclude that the sequence ϕ ( t + t n ) is uniformly converging to ϕ ( t ) on I . We have shown that the space P is complete. Apply the contraction mapping theorem, duo to Lemmas 2 and 3, there exists a unique solution ω ( t ) P of the Equation (1).
Further, applying the relations
ω i ( t ) = ω i ( s n ) s n t a i ω i ( s ) d s + s n t j = 1 p b i j f j ( ω j ( s ) ) d s + s n t v i ( s ) d s ,
and
ω i ( t + t n ) = ω i ( s n + t n ) s n t a i ω i ( s + t n ) d s + s n t j = 1 p b i j f j ( ω j ( s + t n ) ) d s + s n t v i ( s + t n ) d s ,
we obtain that
ω i ( t + t n ) ω i ( t ) = ω i ( s n + t n ) ω i ( s n ) s n t a i ( ω i ( s + t n ) ω i ( s ) ) d s + s n t j = 1 p b i j f j ( ω j ( s + t n ) ) f j ( ω j ( s ) ) d s + s n t ( v i ( s + t n ) v i ( s ) ) d s .
One can fix a natural numbers l and k, and positive number κ such that
κ < δ ;
κ 1 2 j = 1 p ( a j + L | b i j | ) 1 l + 2 k 3 2 l , i = 1 , 2 , , p ,
| | ω ( t + s ) ω ( t ) | | < ϵ 0 min 1 k , 1 4 l , t R , | s | < κ ,
are valid.
Let the numbers κ , l , k and a number n N , i = 1 , 2 , , p , be fixed.
Denote Δ = | ω i ( s n + t n ) ω i ( s n ) | . Consider the following two alternatives: (i) Δ < ϵ 0 / l ; (ii) Δ ϵ 0 / l , and consequently, the rest of the proof falls into two parts.
(i) Next, one can show that
| | ω ( t + t n ) ω ( t ) | | | | ω ( t + t n ) ω ( s n + t n ) | | + | | ω ( s n + t n ) ω ( s n ) | | + | | ω ( s n ) ω ( t ) | | < ϵ 0 k + ϵ 0 l + ϵ 0 k = ϵ 0 1 l + 2 k ,
if t [ s n , s n + κ ] . Therefore, by using relations (7)–(10), we have that
| ω i ( t + t n ) ω i ( t ) | s n t | v i ( s + t n ) v i ( s ) | d s s n t a i | ω i ( s + t n ) ω i ( s ) | d s s n t j = 1 p | b i j | | f j ( ω j ( s + t n ) ) f j ( ω j ( s ) ) | d s | ω i ( s n + t n ) ω i ( s n ) | κ 2 ϵ 0 j = 1 p ( a j + L | b i j | ) ϵ 0 κ 1 l + 2 k ϵ 0 l = ϵ 0 κ 1 2 j = 1 p ( a j + L | b i j | ) 1 l + 2 k ϵ 0 l ϵ 0 2 l
for t [ s n + κ 2 , s n + κ ] .
(ii) For the case Δ ϵ 0 / l , we get that
| | ω ( t n + t ) ω ( t ) | | | | ω ( t n + s n ) ω ( s n ) | | | | ω ( s n ) ω ( t ) | | | | ω ( t n + t ) ω ( t n + s n ) | | ϵ 0 l ϵ 0 4 l ϵ 0 4 l = ϵ 0 2 l ,
if t [ s n κ , s n + κ ] . Thus, it can be inferred that solution ω ( t ) is strongly unpredictable.
At last, we shall prove the stability of the solution ω ( t ) . It is true that
ω i ( t ) = e a i ( t t 0 ) ω i ( t 0 ) + t 0 t e a i ( t s ) j = 1 p b i j f j ( ω j ( s ) ) + v i ( s ) d s
for all i = 1 , , p .
Let y ( t ) = ( y 1 , y 2 , , y p ) be another solution of system (1). Then
y i ( t ) = e a i ( t t 0 ) y i ( t 0 ) + t 0 t e a i ( t s ) j = 1 p b i j f j ( y j ( s ) ) + v i ( s ) d s
for all i = 1 , , p .
Making use of the relation
y i ( t ) ω i ( t ) = e a i ( t t 0 ) ( y i ( t 0 ) ω i ( t 0 ) ) + t 0 t e a i ( t s ) j = 1 p b i j f j ( y j ( s ) ) j = 1 p b i j f j ( ω j ( s ) ) d s
for all i = 1 , , p , we have that
y i ( t ) ω i ( t ) e γ ( t t 0 ) y i ( t 0 ) ω i ( t 0 ) + t 0 t e γ ( t s ) j = 1 p | b i j | f j ( y j ( s ) ) f j ( ω j ( s ) ) d s e γ ( t t 0 ) y ( t 0 ) ω ( t 0 ) + L max i j = 1 p | b i j | t 0 t e γ ( t s ) y ( s ) ω ( s ) d s
for all i = 1 , 2 , , p .
Thus, it is shown that
y ( t ) ω ( t ) e γ ( t t 0 ) y ( t 0 ) ω ( t 0 ) + G t 0 t e γ ( t s ) y ( s ) ω ( s ) d s ,
where G = L max i j = 1 p | b i j | , and multiplying both sides of this inequality by e γ t we get
e γ t y ( t ) ω ( t ) e γ t 0 y ( t 0 ) ω ( t 0 ) + G t 0 t e γ s y ( s ) ω ( s ) d s .
Next, applying Gronwall–Belman Lemma, one can obtain
y ( t ) ω ( t ) y ( t 0 ) ω ( t 0 ) e ( G γ ) ( t t 0 ) .
Therefore, (C6) implies that ω ( t ) is a uniformly exponentially stable solution of the system (1). The theorem is proved. □

4. Examples

It is not possible to find the initial data of unpredictable solutions. Therefore, in the present examples, we visualize unpredictable oscillations through graphs of attracted neighbor solutions.
Example 1.
At first, we will design an unpredictable function. To that end, we use the dynamics of the logistic map in the same way as in [32]. Let us keep in mind the logistic map
λ i + 1 = F μ ( λ i ) ,
where i Z , and F μ ( s ) = μ s ( 1 s ) for μ ( 0 , 4 ] [45]. According to Theorem 4.1 [32], for each μ [ 3 + ( 2 / 3 ) 1 / 2 , 4 ] , the logistic map (11) possesses an unpredictable solution.
Let us denote by ψ i , i Z , the unpredictable solution of the logistic map (11) with μ = 3.92 . The sequence inside the unit interval [ 0 , 1 ] .
Since the sequence ψ i , there exist a positive number ϵ 0 and sequences ζ n , η n , both of which diverge to infinity such that | ψ i + ζ n ψ i | 0 as n for each i in bounded intervals of integers and | ψ ζ n + η n ψ η n | ϵ 0 for each n N .
Consider the function
Ω ( t ) = t e 2.5 ( t s ) Θ ( s ) d s ,
where the function Θ ( t ) is defined by Θ ( t ) = ψ i for t [ i , i + 1 ) , i Z . The function is bounded on the whole real axis such that sup t R Ω ( t ) 2 / 5 .
Next, we will show that Ω ( t ) is an unpredictable function. Consider a bounded and closed interval α , β , and a number ϵ > 0 . Assume, without loss of generality, that α and β are integers. Choose a positive number ξ and an integer γ < α , such that the following inequalities 4 5 e 2.5 ( α γ ) < ϵ 2 and 2 5 ξ 1 e 2.5 ( β γ ) < ϵ 2 are satisfied. Moreover, let n be a large natural number such that | Θ ( t + ζ n ) | Θ ( t ) | < ξ on γ , β .
Then, for all α , β , we obtain that
| Ω ( t + ζ n ) Ω ( t ) | = | t e 2.5 ( t s ) ( Θ ( s + ζ n ) Θ ( s ) ) d s | | γ e 2.5 ( t s ) ( Θ ( s + ζ n ) Θ ( s ) ) d s | + | γ β e 2.5 ( t s ) ( Θ ( s + ζ n ) Θ ( s ) ) d s | γ e 2.5 ( t s ) 2 d s + γ β e 2.5 ( t s ) ξ d s 4 5 e 2.5 ( α γ ) + 2 5 ξ [ 1 e 2.5 ( β γ ) ] ϵ 2 + ϵ 2 = ϵ .
Thus, | Ω ( t + ζ n ) Ω ( t ) | 0 as n uniformly on the interval α , β .
The following inequalities are valid, | Θ ( t + ζ n ) Θ ( t ) | = | i ζ n + η n i η n | ϵ 0 , t [ η n , η n + 1 ) , n N . There exists a positive number κ < 1 such that 4 5 [ 1 e 2.5 κ ] ϵ 0 10 .
Let us fix the number κ and n N , and consider two cases: (i) | Ω ( η n + ζ n ) Ω ( η n ) | < ϵ 0 5 and (ii) | Ω ( η n + ζ n ) Ω ( η n ) | ϵ 0 5 .
In what follows, we need the relation
Ω ( t + ζ n ) Ω ( t ) = Ω ( η n + ζ n ) Ω ( η n ) + η n t e 2.5 ( t s ) ( Θ ( s + ζ n ) Θ ( s ) ) d s .
(i) From the last relation, it implies that
| Ω ( t + ζ n ) Ω ( t ) | | η n t e 2.5 ( t s ) ( Θ ( s + ζ n ) Θ ( s ) ) d s | | Ω ( η n + ζ n ) Ω ( η n ) | η n t e 2.5 ( t s ) ϵ 0 d s ϵ 0 5 2 ϵ 0 5 ϵ 0 5 = ϵ 0 5
for t [ η n , η n + 1 ) .
(ii) Utilizing the relation (13), one can get that
| Ω ( t + ζ n ) Ω ( t ) | | Ω ( η n + ζ n ) Ω ( η n ) | | η n t e 2.5 ( t s ) ( Θ ( s + ζ n ) Θ ( s ) ) d s | ϵ 0 5 η n t e 2.5 ( t s ) 2 d s ϵ 0 5 4 5 [ 1 e 2.5 κ ] ϵ 0 10
for t [ η n , η n + κ ) .
Thus, Ω ( t ) is unpredictable function with positive numbers ϵ 0 10 , κ 3 and sequences t n = ζ n and s n = η n + κ 2 .
Let us rewrite the integral (12) as
Ω ( t ) = t e 2.5 ( t s ) Θ ( s ) d s = e 2.5 t Ω 0 + 0 t e 2.5 ( t s ) Θ ( s ) d s ,
where Ω 0 = 0 e 2.5 s Θ ( s ) d s . It is worth noting that the simulation of an unpredictable function is impossible, since the initial value is not known.
That is why we will simulate a function Ψ ( t ) which approaches to Θ ( t ) with increasing time. Let us determine
Ψ ( t ) = e 2.5 t Ψ 0 + 0 t e 2.5 ( t s ) Θ ( s ) d s ,
where Ψ 0 is a fixed number, which is not necessarily equal to Ω 0 . Subtract (15) from (14) to obtain that Ω ( t ) Ψ ( t ) = e 2.5 t ( Ω 0 Ψ 0 ) , t 0 . That is, the difference Ω ( t ) Ψ ( t ) exponentially diminishes. This means that the function Ψ ( t ) exponentially tends to the unpredictable function Ω ( t ) , i.e., the graphs of these functions approach, as time increases. Instead of the curve describing the unpredictable solution, we can take the graph of Ψ ( t ) . In Figure 1, we depict the graph defined by the initial value Ψ ( 0 ) = 0.85 .
Example 2.
Let us introduce the following Hopfield type neural network:
x i ( t ) = a i x i ( t ) + j = 1 3 b i j f j ( x j ( t ) ) + v i ( t ) ,
where i = 1 , 2 , 3 and a 1 = 2 , a 2 = 3 , a 3 = 4 ,
f ( x ( t ) ) = 1 20 a r c t g ( x ( t ) ) ,
b 11 b 12 b 13 b 21 b 22 b 23 b 31 b 32 b 33 = 0.02 0.03 0.02 0.04 0.05 0.01 0.03 0.06 0.02 , v 1 ( t ) v 2 ( t ) v 3 ( t ) = 15 Ω 3 ( t ) + 1 4 Ω ( t ) + 1.5 7 Ω ( t ) ,
where Ω ( t ) is the unpredictable function from Example 1.
The perturbation function ( 15 Ω 3 ( t ) + 1 , 4 Ω ( t ) + 1.5 , 7 Ω ( t ) ) is unpredictable in accordance with Lemmas 1.4 and 1.5 [36]. The properties (C1)–(C6) hold for the system (16) with γ = 2 , L = 0.05 and H = 2.8 . The simulation results of solution for the system with the initial conditions ϕ 1 ( 0 ) = 0.355 , ϕ 2 ( 0 ) = 1.235 , ϕ 3 ( 0 ) = 0.649 , are shown in Figure 2. Similarly to Example 1, one can show that the solution ϕ ( t ) approaches to the unpredictable solution x ( t ) as t increases. Additionally, from the graph it is seen that the maximum value does not exceed 0.7 . Thus, if we take H = 2.8 , then all conditions in Theorem 1 are fulfilled. According to the theorem, system (16) possesses a unique asymptotically stable unpredictable solution. The irregular behavior of the solution indicates the presence of an unpredictable solution in the dynamics of (16).
In the next example, we utilize the unpredictable solution x ( t ) for system (16) to form new perturbations.
Example 3.
Consider the system
y i ( t ) = a i y i ( t ) + j = 1 3 b i j f j ( y j ( t ) ) + v i ( t ) ,
where i = 1 , 2 , 3 and a 1 = 4 , a 2 = 6 , a 3 = 5 ,
f ( z ) = 3 50 a r c t g ( z ) ,
b 11 b 12 b 13 b 21 b 22 b 23 b 31 b 32 b 33 = 0.03 0.01 0.04 0.06 0.02 0.05 0.03 0.07 0.02 , v 1 ( t ) v 2 ( t ) v 3 ( t ) = 12 x 1 ( t ) + 4 15 x 2 ( t ) + 3 20 x 3 3 ( t ) 1 ,
where ( x 1 ( t ) , x 2 ( t ) , x 3 ( t ) ) is the solution of (16). The properties (C1)–(C6) hold for the system (17) with γ = 4 , L = 0.06 and H = 13.5 . That is why, according to the Theorem 1, system (17) possesses the unique asymptotically stable unpredictable solution. If one accepts H = 13.5 , then the solutions of system (17) satisfy all conditions of the theorem. The simulation result of system (17), with the initial conditions ψ 1 ( 0 ) = 2.2610 , ψ 2 ( 0 ) = 0.4815 , ψ 3 ( 0 ) = 3.8226 , is shown in Figure 3. Likewise, in Example 2, the solution ψ ( t ) approaches to the unpredictable solution y ( t ) as time increases.

5. Conclusions

This is the first time that the Hopfield-type neural networks are considered for existence, uniqueness and asymptotic stability of unpredictable oscillations. The strength of the actuality of the research is increased as the oscillations are strongly related to the new type of dynamics, Poincaré chaos. Consequently, all the benefits, which are connected with chaos applications for artificial intelligence, robotics and engineering are extended for unpredictable oscillations. In the present research, the motions are specified with the condition of strong unpredictability, when the property is true for all coordinates of the dynamics. Thus, the chaos applications became more effective, since the motions are observable in each parameter of a process, and the phenomenon can be extended, if one applies the results of the paper for models with larger dimensions. Correspondingly, one can say about such effective methods of chaos analysis and applications as synchronization, control, stabilization of periodic solutions in future researches [20,21,22,24,29,46]. In addition, indication of unpredictable oscillations can be improved by application of the sequential test for the Poincaré chaos, which is developed in the paper [47].

Author Contributions

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

Funding

This research received no external funding.

Acknowledgments

M. Akhmet has been supported by a grant (118F161) from TÜBİTAK, the Scientific and Technological Research Council of Turkey. M. Tleubergenova and Z. Nugayeva have been supported by the MES RK grant No. AP05132573 “Cellular neural networks with continuous/discrete time and singular perturbations” (2018–2020) of the Committee of Science, Ministry of Education and Science of the Republic of Kazakhstan.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Hopfield, J.J. Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA 1982, 79, 2554–2558. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  2. Ramya, C.; Kavitha, G.; Shreedhara, K.S. Recalling of images using Hopfield neural network model. Natl. Conf. Comput. Commun. Controls 2011, 11, 2–4. [Google Scholar]
  3. Dong, Q.; Matsui, K.; Huang, X. Existence and stability of periodic solutions for Hopfield neural network equations with periodic input. Nonlinear Anal. 2002, 49, 471–479. [Google Scholar] [CrossRef]
  4. Chen, A.; Huang, L. Existence and attractivity of almost periodic solutions of Hopfield Neural Networks. Math. Acta Sci. 2001, 21, 505–511. [Google Scholar]
  5. Akhmet, M.; Karacaören, M. A Hopfield neural network with multi-compartmental activation. Neural Comput. Appl. 2018, 29, 815–822. [Google Scholar] [CrossRef]
  6. Cao, J. Global exponential stability of Hopfield neural networks. Int. J. Syst. Sci. 2001, 32, 233–236. [Google Scholar] [CrossRef]
  7. Akhmet, M.U.; Arugaslan, D.; Yilmaz, E. Stability analysis of recurrent neural networks with piecewise constant argument of generalized type. Neural Netw. 2010, 23, 805–811. [Google Scholar] [CrossRef]
  8. Cao, J.; Tao, Q. Estimation of the domain of attraction and the convergence rate of a Hopfield associative memory and an application. J. Comput. Syst. Sci. 2000, 60, 179–186. [Google Scholar] [CrossRef] [Green Version]
  9. Cao, J. An estimation of the domain of attraction and convergence rate for Hopfield continuous feedback neural networks. Phys. Lett. A 2004, 325, 370–374. [Google Scholar] [CrossRef]
  10. Jin, D.; Peng, J. A New Approach for Estimating the Attraction Domain for Hopfield-Type Neural Networks. Neural Comput. 2009, 21, 101–120. [Google Scholar] [CrossRef]
  11. Hopfield, J.J. Neurons with graded response have collective computational properties like those of two-stage neurons. Proc. Natl. Acad. Sci. USA 1982, 81, 3088–3092. [Google Scholar] [CrossRef] [Green Version]
  12. Ashwin, P.; Coombes, S.; Nicks, R. Mathematical Frameworks for Oscillatory Network Dynamics in Neuroscience. J. Math. Neurosci. 2016, 6, 2. [Google Scholar] [CrossRef] [PubMed]
  13. Aihara, K.; Takabe, T.; Toyoda, M. Chaotic Neural Networks. Phys. Lett. A 1990, 6, 333–340. [Google Scholar] [CrossRef]
  14. Das, A.; Roy, A.B.; Das, P. Chaos in a three dimensional neural network. Appl. Math. Model. 2000, 24, 511–522. [Google Scholar] [CrossRef]
  15. Yuan, Q.; Li, Q.D.; Yang, X.-S. Horseshoe chaos in a class of simple Hopfield neural networks. Chaos Solit. Fract. 2009, 39, 1522–1529. [Google Scholar] [CrossRef]
  16. Shibasaki, M.; Adachi, M. Response to external input of chaotic neural networks based on Newman—Watts model. In Proceedings of the 2012 International Joint Conference on Neural Networks (IJCNN), Brisbane, Australia, 10–15 June 2011. [Google Scholar]
  17. Sang, N.; Zhang, T. Segmentation of FLIR images by Hopfield neural network with edge constraint. Pattern Recognit. 2001, 34, 811–821. [Google Scholar] [CrossRef]
  18. Raiko, T.; Valpola, H. Oscillatory neural network for image segmentation with biased competition for attention. Adv. Exp. Med. Biol. 2011, 718, 75–85. [Google Scholar]
  19. Cheng, K.C.; Lin, Z.C.; Mao, C.W. The Application of Competitive Hopfield Neural Network to Medical Image Segmentation. IEEE Trans. Med. Imaging 1996, 15, 560–567. [Google Scholar] [CrossRef]
  20. Liu, Q.; Zhang, S. Adaptive lag synchronization of chaotic Cohen–Grossberg neural networks with discrete delays. Chaos 2012, 22, 033123. [Google Scholar] [CrossRef]
  21. Wen, S.P.; Wen, S.; Zeng, Z.; Huang, T.; Meng, Q.; Yao, W. Lag synchronization of switched neural networks via neural activation function and applications in image encryption. IEEE Trans. Neural Netw. Learn. Syst. 2015, 26, 1493–1502. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  22. Gonzales-Miranda, J.M. Synchronization and Control of Chaos; Imperial College Press: London, UK, 2004. [Google Scholar]
  23. Ke, Q.; Oommen, J. Logistic Neural Networks: Their chaotic and pattern recognition propertie. Neurocomputing 2014, 125, 184–194. [Google Scholar] [CrossRef]
  24. He, G.; Chen, L.; Aihara, K. Associative memory with a controlled chaotic neural network. Neurocomputing 2008, 71, 2794–2805. [Google Scholar] [CrossRef]
  25. Erchova, I.; McGonigle, D.J. Rhythms of the brain: An examination of mixed mode oscillation approaches to the analysis of neurophysiological data. Chaos 2008, 18, 015115. [Google Scholar] [CrossRef] [PubMed]
  26. Diaz, H.M.; Córdova, F.M.; Cañete, L.; Palominos, F.; Cifuentes, F.; Sánchez, C.; Herrera, M. Order and chaos in the brain: Fractal time series analysis of the EEG activity during a cognitive problem solving task. Proc. Comput. Sci. 2015, 55, 1410–1419. [Google Scholar] [CrossRef] [Green Version]
  27. Schmidt, H.; Avitabile, D.; Montbrio, E.; Roxin, A. Network mechanisms underlying the role of oscillations in cognitive tasks. PLoS Comput. Biol. 2018, 14, e1006430. [Google Scholar] [CrossRef]
  28. Maguire, M.; Abel, A. What changes in neural oscillations can reveal about developmental cognitive neuroscience: Language development as a case in point. Dev. Cogn. Neurosci. 2013, 6, 125–136. [Google Scholar] [CrossRef] [Green Version]
  29. Hammond, C.; Bergman, H.; Brown, P. Pathological synchronization in Parkinson’s disease: Networks, models and treatments. Trends Neurosci. 2007, 30, 357–364. [Google Scholar] [CrossRef]
  30. Poincaré, H. Les Methodes Nouvelles De La Mecanique Celeste; Gauthier-Villars: Paris, France, 1899; reprint Dover Publications: New York, NY, USA, 1957; Volume III. [Google Scholar]
  31. Birkhoff, G.D. Dynamical Systems; Colloquium Publications: Providence, RI, USA, 1927. [Google Scholar]
  32. Akhmet, M.; Fen, M.O. Poincaré chaos and unpredictable functions. Commun. Nonlinear Sci. Nr. Simul. 2017, 48, 85–94. [Google Scholar] [CrossRef] [Green Version]
  33. Akhmet, M.; Fen, M.O. Unpredictable points and chaos. Commun. Nonlinear Sci. Nr. Simul. 2016, 40, 1–5. [Google Scholar] [CrossRef] [Green Version]
  34. Akhmet, M.; Fen, M.O. Existence of unpredictable solutions and chaos. Turk. J. Math. 2017, 41, 254–266. [Google Scholar] [CrossRef]
  35. Akhmet, M.; Fen, M.O. Non-autonomous equations with unpredictable solutions. Commun. Nonlinear Sci. Nr. Simul. 2018, 59, 657–670. [Google Scholar] [CrossRef]
  36. Akhmet, M.; Fen, M.O.; Tleubergenova, M.; Zhamanshin, A. Unpredictable solutions of linear differential and discrete equations. Turk. J. Math. 2019, 43, 2377–2389. [Google Scholar] [CrossRef]
  37. Akhmet, M.; Tleubergenova, M.; Zhamanshin, A. Quasilinear differential equations with strongly unpredictable solutions. Carpathion J. Math. 2020, 36, 3. [Google Scholar]
  38. Akhmet, M.; Tleubergenova, M.; Zhamanshin, A. Poincaré chaos for a hyperbolic quasilinear system. Miskolc Math. Notes 2019, 20, 33–44. [Google Scholar] [CrossRef]
  39. Akhmet, M.U.; Fen, M.O.; Alejaily, E.M. Dynamics with Chaos and Fractals; Springer: Cham, Switzerland, 2020. [Google Scholar]
  40. Miller, A. Unpredictable points and stronger versions of Ruelle–Takens and Auslander–Yorke chaos. Topol. Appl. 2019, 253, 7–16. [Google Scholar] [CrossRef]
  41. Thakur, R.; Das, R. Strongly Ruelle-Takens, strongly Auslander-Yorke and Poincaré chaos on semiflows. Commun. Nonlinear Sci. Numer. Simulat. 2019, 81, 105018. [Google Scholar] [CrossRef]
  42. Akhmet, M.U.; Fen, M.O.; Alejaily, E.M. Extension of sea surface temperature unpredictability. Ocean Dyn. 2019, 69, 145–156. [Google Scholar] [CrossRef]
  43. Akhmet, M.; Fen, M.O.; Alejaily, E.M. A randomly determined unpredictable function. arXiv 2019, arXiv:1910.12758. [Google Scholar]
  44. Hartman, P. Ordinary Differential Equations; John Wiley: New York, NY, USA, 1964. [Google Scholar]
  45. Hale, J.; Koçak, H. Dynamics and Bifurcations; Springer: New York, NY, USA, 1991. [Google Scholar]
  46. Akhmet, M.; Fen, M.O. Replication of Chaos in Neural Networks, Economics and Physics; Springer: Berlin/Heidelberg, Germany, 2016. [Google Scholar]
  47. Akhmet, M.; Fen, M.O.; Tola, A. The Sequential Test for Chaos. arXiv 2019, arXiv:1904.09127. [Google Scholar]
Figure 1. The graph of function Ψ ( t ) , which approximates the unpredictable function Ω ( t ) .
Figure 1. The graph of function Ψ ( t ) , which approximates the unpredictable function Ω ( t ) .
Mathematics 08 01791 g001
Figure 2. The time series of the coordinates ϕ 1 , ϕ 2 and ϕ 3 of the solution of system (16) with the initial conditions ϕ 1 ( 0 ) = 0.355 , ϕ 2 ( 0 ) = 1.235 , ϕ 3 ( 0 ) = 0.649 .
Figure 2. The time series of the coordinates ϕ 1 , ϕ 2 and ϕ 3 of the solution of system (16) with the initial conditions ϕ 1 ( 0 ) = 0.355 , ϕ 2 ( 0 ) = 1.235 , ϕ 3 ( 0 ) = 0.649 .
Mathematics 08 01791 g002
Figure 3. The time series of the coordinates ψ 1 , ψ 2 and ψ 3 of the solution of system (17) with the initial conditions ψ 1 ( 0 ) = 2.2610 , ψ 2 ( 0 ) = 0.4815 , ψ 3 ( 0 ) = 3.8226 .
Figure 3. The time series of the coordinates ψ 1 , ψ 2 and ψ 3 of the solution of system (17) with the initial conditions ψ 1 ( 0 ) = 2.2610 , ψ 2 ( 0 ) = 0.4815 , ψ 3 ( 0 ) = 3.8226 .
Mathematics 08 01791 g003
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Akhmet, M.; Tleubergenova, M.; Nugayeva, Z. Strongly Unpredictable Oscillations of Hopfield-Type Neural Networks. Mathematics 2020, 8, 1791. https://doi.org/10.3390/math8101791

AMA Style

Akhmet M, Tleubergenova M, Nugayeva Z. Strongly Unpredictable Oscillations of Hopfield-Type Neural Networks. Mathematics. 2020; 8(10):1791. https://doi.org/10.3390/math8101791

Chicago/Turabian Style

Akhmet, Marat, Madina Tleubergenova, and Zakhira Nugayeva. 2020. "Strongly Unpredictable Oscillations of Hopfield-Type Neural Networks" Mathematics 8, no. 10: 1791. https://doi.org/10.3390/math8101791

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