Finite-time Anti-synchronization of Memristive Stochastic BAM Neural Networks with Probabilistic Time-varying Delays

This paper investigates the drive-response finite-time anti-synchronization for memristive bidirectional associative memory neural networks (MBAMNNs). Firstly, a class of MBAMNNs with mixed probabilistic time-varying delays and stochastic perturbations is first formulated and analyzed in this paper. Secondly, an nonlinear control law is constructed and utilized to guarantee drive-response finite-time anti-synchronization of the neural networks. Thirdly, by employing some inequality technique and constructing an appropriate Lyapunov function, some anti-synchronization criteria are derived. Finally, a number simulation is provided to demonstrate the effectiveness of the proposed mechanism

Synchronization of inertial memristive neural networks with time-varying delays via static or dynamic event-triggered control

Funding Information: This work was supported in part by the National Natural Science Foundation of China under Grant 61971185, the Major Research Project of the National Natural Science Foundation of China under Grant 91964108 and the Open Fund Project of Key Laboratory in Hunan Universities under Grant 18K010. Publisher Copyright: © 2020 Elsevier B.V.This paper investigates the synchronization problem of inertial memristive neural networks (IMNNs) with time-varying delays via event-triggered control (ETC) scheme and state feedback controller for the first time. First, two types of state feedback controllers are designed; the first type of controller is added to the transformational first-order system, and the second type of controller is added to the original second-order system. Next, based on each feedback controller, static event-triggered control (SETC) condition and dynamic event-triggered control (DETC) condition are presented to significantly reduce the update times of controller and decrease the computing cost. Then, some sufficient conditions are given such that synchronization of IMNNs with time-varying delays can be achieved under ETC schemes. Finally, a numerical simulation and some data analyses are given to verify the validity of the proposed results.Peer reviewe

Exponential multistability of memristive Cohen-Grossberg neural networks with stochastic parameter perturbations

© 2020 Elsevier Ltd. All rights reserved. This manuscript is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International Licence http://creativecommons.org/licenses/by-nc-nd/4.0/.Due to instability being induced easily by parameter disturbances of network systems, this paper investigates the multistability of memristive Cohen-Grossberg neural networks (MCGNNs) under stochastic parameter perturbations. It is demonstrated that stable equilibrium points of MCGNNs can be flexibly located in the odd-sequence or even-sequence regions. Some sufficient conditions are derived to ensure the exponential multistability of MCGNNs under parameter perturbations. It is found that there exist at least (w+2) l (or (w+1) l) exponentially stable equilibrium points in the odd-sequence (or the even-sequence) regions. In the paper, two numerical examples are given to verify the correctness and effectiveness of the obtained results.Peer reviewe

New results on finite-/fixed-time synchronization of delayed memristive neural networks with diffusion effects

In this paper, we further investigate the finite-/fixed-time synchronization (FFTS) problem for a class of delayed memristive reaction-diffusion neural networks (MRDNNs). By utilizing the state-feedback control techniques, and constructing a general Lyapunov functional, with the help of inequality techniques and the finite-time stability theory, novel criteria are established to realize the FFTS of the considered delayed MRDNNs, which generalize and complement previously known results. Finally, a numerical example is provided to support the obtained theoretical results

An improved data classification framework based on fractional particle swarm optimization

Particle Swarm Optimization (PSO) is a population based stochastic optimization technique which consist of particles that move collectively in iterations to search for the most optimum solutions. However, conventional PSO is prone to lack of convergence and even stagnation in complex high dimensional-search problems with multiple local optima. Therefore, this research proposed an improved Mutually-Optimized Fractional PSO (MOFPSO) algorithm based on fractional derivatives and small step lengths to ensure convergence to global optima by supplying a fine balance between exploration and exploitation. The proposed algorithm is tested and verified for optimization performance comparison on ten benchmark functions against six existing established algorithms in terms of Mean of Error and Standard Deviation values. The proposed MOFPSO algorithm demonstrated lowest Mean of Error values during the optimization on all benchmark functions through all 30 runs (Ackley = 0.2, Rosenbrock = 0.2, Bohachevsky = 9.36E-06, Easom = -0.95, Griewank = 0.01, Rastrigin = 2.5E-03, Schaffer = 1.31E-06, Schwefel 1.2 = 3.2E-05, Sphere = 8.36E-03, Step = 0). Furthermore, the proposed MOFPSO algorithm is hybridized with Back-Propagation (BP), Elman Recurrent Neural Networks (RNN) and Levenberg-Marquardt (LM) Artificial Neural Networks (ANNs) to propose an enhanced data classification framework, especially for data classification applications. The proposed classification framework is then evaluated for classification accuracy, computational time and Mean Squared Error on five benchmark datasets against seven existing techniques. It can be concluded from the simulation results that the proposed MOFPSO-ERNN classification algorithm demonstrated good classification performance in terms of classification accuracy (Breast Cancer = 99.01%, EEG = 99.99%, PIMA Indian Diabetes = 99.37%, Iris = 99.6%, Thyroid = 99.88%) as compared to the existing hybrid classification techniques. Hence, the proposed technique can be employed to improve the overall classification accuracy and reduce the computational time in data classification applications