This study explores the bipartite secure synchronization problem of coupled quaternion-valued neural networks (QVNNs), in which variable sampled communications and random deception attacks are considered. Firstly, by employing the signed graph theory, the mathematical model of coupled QVNNs with structurally-balanced cooperative-competitive interactions is established. Secondly, by adopting non-decomposition method and constructing a suitable unitary Lyapunov functional, the bipartite secure synchronization (BSS) criteria for coupled QVNNs are obtained in the form of quaternion-valued LMIs. It is essential to mention that the structurally-balanced topology is relatively strong, hence, the coupled QVNNs with structurally-unbalanced graph are further studied. The structurally-unbalanced graph is treated as an interruption of the structurally-balanced graph, the bipartite secure quasi-synchronization (BSQS) criteria for coupled QVNNs with structurally-unbalanced graph are derived. Finally, two simulations are given to illustrate the feasibility of the suggested BSS and BSQS approaches.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1016/j.neunet.2024.106717 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Adaptive bipartite time-varying formation tracking control for heterogeneous multi-agent systems with DoS attacks.
ISA Trans
December 2024
School of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China. Electronic address:
Denial-of-service (DoS) attacks and antagonistic interactions may exist in complex networks, which will destroy cooperative communication between agents and thus cannot realize collaborative tasks. Therefore, this paper studies time-varying formation tracking (TVFT) of heterogeneous multi-agent systems (HMASs) with DoS attacks and cooperative-antagonistic interactions. It aims to ensure system communication connectivity and allow followers to achieve distributed secure bipartite TVFT.
View Article and Find Full Text PDFEdge computing task scheduling method based on user's social relations: a construction and solution for Smart City Library.
PeerJ Comput Sci
October 2024
Changchun Children's Library, Changchun, Jilin, China.
Article Synopsis
- - The development of a Smart City Library relies on advanced edge computing, utilizing a new task-scheduling model that incorporates users' social relationships to enhance efficiency.
- - By creating a user's social relationship graph through mathematical methods and a device connection graph based on proximity, the model establishes a task-device bipartite graph for optimized task scheduling.
- - Utilizing the Kuhn-Munkres algorithm, this approach results in reduced task execution delays and energy use, demonstrating enhanced security and reliability for edge computing tasks in Smart City Libraries.
Maize yield prediction with trait-missing data via bipartite graph neural network.
Front Plant Sci
October 2024
Information Technology Research Center, Beijing Academy of Agriculture and Forestry Sciences, Beijing, China.
Article Synopsis
- * Existing methods struggle with data correlations and performance issues when dealing with missing or imbalanced data in maize planting records.
- * To address these issues, the authors introduce a new model using bipartite graph neural networks, which improves data imputation and yield prediction by better mining correlations and balancing unbalanced samples.
Causal evidence for social group sizes from Wikipedia editing data.
R Soc Open Sci
October 2024
Department of Experimental Psychology, University of Oxford, Radcliffe Quarter, Oxford OX2 6GG, UK.
Human communities have self-organizing properties in which specific Dunbar Numbers may be invoked to explain group attachments. By analysing Wikipedia editing histories across a wide range of subject pages, we show that there is an emergent coherence in the size of transient groups formed to edit the content of subject texts, with two peaks averaging at around for the size corresponding to maximal contention, and at around as a regular team. These values are consistent with the observed sizes of conversational groups, as well as the hierarchical structuring of Dunbar graphs.
View Article and Find Full Text PDFBipartite secure synchronization criteria for coupled quaternion-valued neural networks with signed graph.
Neural Netw
December 2024
School of Mathematical Sciences, Qufu Normal University, Qufu, 273165, China.
This study explores the bipartite secure synchronization problem of coupled quaternion-valued neural networks (QVNNs), in which variable sampled communications and random deception attacks are considered. Firstly, by employing the signed graph theory, the mathematical model of coupled QVNNs with structurally-balanced cooperative-competitive interactions is established. Secondly, by adopting non-decomposition method and constructing a suitable unitary Lyapunov functional, the bipartite secure synchronization (BSS) criteria for coupled QVNNs are obtained in the form of quaternion-valued LMIs.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!