{"title":"具有混合时变延迟的超复杂神经网络的同步问题","authors":"","doi":"10.1007/s12559-024-10253-9","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>This article discusses the fixed-time synchronization (FTS) of hypercomplex neural networks (HCNNs) with mixed time-varying delays. Unlike finite-time synchronization (FNTS) based on initial conditions, the settling time of FTS can be adjusted to meet the needs. The state vector, weight matrices, activation functions, and input vectors of HCNNs are all hypercomplex numbers. The techniques used in complex-valued neural networks (CVNNs) and quaternion-valued neural networks (QVNNs) cannot be used directly with HCNNs because they do not work with eight or more dimensions. To begin with, the decomposition method is used to split the HCNNs into <span> <span>\\((n+1)\\)</span> </span> real-valued neural networks (RVNNs) applying distributive law to handle non-commutativity and non-associativity. A nonlinear controller is constructed to synchronize the master-response systems of the HCNNs. Lyapunov-based method is used to prove the stability of an error system. The FTS of mixed time-varying delayed HCNNs is achieved using a suitable lemma, Lipschitz condition, appropriate Lyapunov functional construction, and designing suitable controllers. Two different algebraic criteria for settling time have been achieved by employing two distinct lemmas. It is demonstrated that the settling time derived from Lemma 1 produces a more precise result than that obtained from Lemma 2. Three numerical examples for CVNNs, QVNNs, and octonions-valued neural networks (OVNNs) are provided to demonstrate the efficacy and effectiveness of the proposed theoretical results.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Synchronization of Hypercomplex Neural Networks with Mixed Time-Varying Delays\",\"authors\":\"\",\"doi\":\"10.1007/s12559-024-10253-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> <p>This article discusses the fixed-time synchronization (FTS) of hypercomplex neural networks (HCNNs) with mixed time-varying delays. Unlike finite-time synchronization (FNTS) based on initial conditions, the settling time of FTS can be adjusted to meet the needs. The state vector, weight matrices, activation functions, and input vectors of HCNNs are all hypercomplex numbers. The techniques used in complex-valued neural networks (CVNNs) and quaternion-valued neural networks (QVNNs) cannot be used directly with HCNNs because they do not work with eight or more dimensions. To begin with, the decomposition method is used to split the HCNNs into <span> <span>\\\\((n+1)\\\\)</span> </span> real-valued neural networks (RVNNs) applying distributive law to handle non-commutativity and non-associativity. A nonlinear controller is constructed to synchronize the master-response systems of the HCNNs. Lyapunov-based method is used to prove the stability of an error system. The FTS of mixed time-varying delayed HCNNs is achieved using a suitable lemma, Lipschitz condition, appropriate Lyapunov functional construction, and designing suitable controllers. Two different algebraic criteria for settling time have been achieved by employing two distinct lemmas. It is demonstrated that the settling time derived from Lemma 1 produces a more precise result than that obtained from Lemma 2. Three numerical examples for CVNNs, QVNNs, and octonions-valued neural networks (OVNNs) are provided to demonstrate the efficacy and effectiveness of the proposed theoretical results.</p>\",\"PeriodicalId\":51243,\"journal\":{\"name\":\"Cognitive Computation\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.3000,\"publicationDate\":\"2024-03-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cognitive Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s12559-024-10253-9\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cognitive Computation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12559-024-10253-9","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
Synchronization of Hypercomplex Neural Networks with Mixed Time-Varying Delays
Abstract
This article discusses the fixed-time synchronization (FTS) of hypercomplex neural networks (HCNNs) with mixed time-varying delays. Unlike finite-time synchronization (FNTS) based on initial conditions, the settling time of FTS can be adjusted to meet the needs. The state vector, weight matrices, activation functions, and input vectors of HCNNs are all hypercomplex numbers. The techniques used in complex-valued neural networks (CVNNs) and quaternion-valued neural networks (QVNNs) cannot be used directly with HCNNs because they do not work with eight or more dimensions. To begin with, the decomposition method is used to split the HCNNs into \((n+1)\) real-valued neural networks (RVNNs) applying distributive law to handle non-commutativity and non-associativity. A nonlinear controller is constructed to synchronize the master-response systems of the HCNNs. Lyapunov-based method is used to prove the stability of an error system. The FTS of mixed time-varying delayed HCNNs is achieved using a suitable lemma, Lipschitz condition, appropriate Lyapunov functional construction, and designing suitable controllers. Two different algebraic criteria for settling time have been achieved by employing two distinct lemmas. It is demonstrated that the settling time derived from Lemma 1 produces a more precise result than that obtained from Lemma 2. Three numerical examples for CVNNs, QVNNs, and octonions-valued neural networks (OVNNs) are provided to demonstrate the efficacy and effectiveness of the proposed theoretical results.
期刊介绍:
Cognitive Computation is an international, peer-reviewed, interdisciplinary journal that publishes cutting-edge articles describing original basic and applied work involving biologically-inspired computational accounts of all aspects of natural and artificial cognitive systems. It provides a new platform for the dissemination of research, current practices and future trends in the emerging discipline of cognitive computation that bridges the gap between life sciences, social sciences, engineering, physical and mathematical sciences, and humanities.