IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-29 DOI: 10.1155/cplx/6053078

Mohammad Mazyad Hazzazi, Muhammad Nadeem, Muhammad Kamran, Muhammad Arshad, M. I. Elashiry, Samuel Asefa Fufa

{"title":"Linking Bipartiteness and Inversion in Algebra via Graph-Theoretic Methods and Simulink","authors":"Mohammad Mazyad Hazzazi, Muhammad Nadeem, Muhammad Kamran, Muhammad Arshad, M. I. Elashiry, Samuel Asefa Fufa","doi":"10.1155/cplx/6053078","DOIUrl":"https://doi.org/10.1155/cplx/6053078","url":null,"abstract":"Research for decades has concentrated on graphs of algebraic structures, which integrate algebra and combinatorics in an innovative way. The goal of this study is to characterize specific aspects of bipartite and inverse graphs that are associated with specific algebraic structures, such as weak inverse property quasigroups and their isotopes, commutator subloops, associator subloops, and nuclei, with a focus on structural and topological characteristics. This research aims to highlight the link between mathematical algebraic systems and graph-theoretic capabilities, paving the path for theoretical advances and applications in computer science through Simulink. The methodology blends algebraic techniques based on quasigroup structural components with basic ideas of simple graphs via edge labeling. Furthermore, mathematical methods are used for property analysis, graph visualization, and construction. The analysis shows that inverse and bipartite graphs with weak inverse property loops have distinct structural patterns, such as supporting substructures of specific properties, connectedness, and symmetry in the vertex system. Finally, our findings lay the groundwork for future detection of more complex algebraic structures and dynamic graph models, as well as various opportunities for both theoretical research and practical application.","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2025 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/6053078","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145224361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Correction to “The Spread of Information in Virtual Communities” 更正“虚拟社区中的信息传播”

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-26 DOI: 10.1155/cplx/9784740

引用次数: 0

Multi-Agent Imitation Behavior Based on Information Interaction 基于信息交互的多智能体模仿行为

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-26 DOI: 10.1155/cplx/8828678

Chen Guo, Peng Yu, Meijuan Li, Xue-Bo Chen

{"title":"Multi-Agent Imitation Behavior Based on Information Interaction","authors":"Chen Guo, Peng Yu, Meijuan Li, Xue-Bo Chen","doi":"10.1155/cplx/8828678","DOIUrl":"https://doi.org/10.1155/cplx/8828678","url":null,"abstract":"As a common social phenomenon, group imitation behavior holds significant research value in the fields of biological group collaboration and artificial swarm intelligence. This paper constructs a behavior imitation model integrating information dissemination mechanisms based on the theory of multiagent systems. The model aims to reveal the influence mechanism of group dynamic characteristics and information interaction intensity on the consistency of group behavior. The model architecture consists of two parts. The first part is an information dissemination model improved upon the SIR model, which introduces a perception radius to analyze how neighboring interactions affect the information diffusion rate. The second part is a multiagent group aggregation model based on social mechanics, enabling individuals to form groups through parameters like attraction, repulsion, speed, and movement direction. Groups spread aggregation and imitation information through interactions with neighboring individuals. Then, based on the breadth of the information they receive, they imitate exemplary groups through intergroup imitation effects. Through complex system simulations, the experimental results show that the consistency of group imitation behavior is positively correlated with the perception radius of individuals. This research provides a new modeling framework and analytical perspective for understanding the emergence mechanism of swarm intelligence.","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2025 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/8828678","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145146419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The World of Agent-Based Modeling: A Bibliometric and Analytical Exploration 基于主体的建模世界：文献计量学和分析探索

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-18 DOI: 10.1155/cplx/2636704

Adrian Domenteanu, Bianca Cibu, Camelia Delcea, Liviu-Adrian Cotfas

{"title":"The World of Agent-Based Modeling: A Bibliometric and Analytical Exploration","authors":"Adrian Domenteanu, Bianca Cibu, Camelia Delcea, Liviu-Adrian Cotfas","doi":"10.1155/cplx/2636704","DOIUrl":"https://doi.org/10.1155/cplx/2636704","url":null,"abstract":"The primary objective of this research paper is to conduct a bibliometric analysis of the prevailing research landscape pertaining to agent-based modeling (ABM). This analysis encompasses an examination of key contributors, affiliated academic institutions, influential publications, and prominent journals within the domain. To achieve this, a dataset consisting of 11,477 scholarly papers retrieved from the ISI Web of Science database has been curated, using keywords specifically related to ABM, spanning the period from 1996 to 2024. Employing n-gram analysis techniques on titles, keywords, abstracts, and keyword-plus fields has unearthed a multitude of domains wherein ABM has been applied with notable success. Our findings, as delineated in this paper, underscore a sustained and robust growth in scholarly interest in the realm of ABM during the specified temporal span, characterized by an impressive annual growth rate of 25.29%. Furthermore, our study contributes to the identification and analysis of salient keywords and emerging trends, thereby elucidating key research trajectories within this domain. The identification of collaborative networks among authors, their respective academic affiliations, and the geographical distribution across various countries and territories offers valuable insights into the global proliferation of ABM as a research methodology. The findings offer valuable insights into the widespread applications of ABM across various domains, including climate change, social networks, supply chain dynamics, public health studies, financial market analysis, and population dynamics. The results of the study can help in guiding future research and practical applications of ABM in these and other multifaceted areas.","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2025 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/2636704","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145102087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Innovation Diffusion on Higher-Order Networks 高阶网络上的创新扩散

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-15 DOI: 10.1155/cplx/6649992

Maria Letizia Bertotti, Nicola Cinardi

{"title":"Innovation Diffusion on Higher-Order Networks","authors":"Maria Letizia Bertotti, Nicola Cinardi","doi":"10.1155/cplx/6649992","DOIUrl":"https://doi.org/10.1155/cplx/6649992","url":null,"abstract":"Higher-order networks (HON) provide a suitable frame to model connections that involve groups of nodes—representing interacting individuals or other types of agents—of different sizes. They allow us to take into account not only pairwise interactions but also connections binding three or four or any other natural number of nodes together. Motivated by the consideration that the existence of higher-order interactions may impact, among others, the process of diffusion of new products, the spreading of ideas, and the adoption of practices, we propose and study here a version of the celebrated Bass model on top of HON. We define a mean-field equation that contains terms up to the order at which interactions might make a significant contribution. The impact of the paper is twofold. By considering and comparing different maximal orders of interaction and analyzing how they influence certain times that are important in the diffusion process, we show that HON indeed has an impact and yields a greater accuracy in modeling results. The second contribution of the paper, also of interest for future works, consists of a novel procedure we develop for the construction of HON with assigned generalized mean degrees. We also show that the behavior of the take-off time with the size of the orders contribution undergoes a phase transition where the link density of the network and the related higher-order structures act as the characterizing condition for one phase or the other.","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2025 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/6649992","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145101143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Input Delay Analysis and H∞ Control for Networked Control Systems With Finite-Time Stochastic Boundedness 有限时间随机有界网络控制系统的输入延迟分析与H∞控制

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-09 DOI: 10.1155/cplx/7635015

Gaofeng Peng, Hu Dong, Jin Yuan Zhao, Yang Leng

引用次数: 0

A Finger Vein Recognition Framework Using Foreground–Background Decomposition and Translation-Invariant Encoding 基于前景-背景分解和平移不变编码的手指静脉识别框架

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-07 DOI: 10.1155/cplx/9965155

Xue Jiang, Min Li

{"title":"A Finger Vein Recognition Framework Using Foreground–Background Decomposition and Translation-Invariant Encoding","authors":"Xue Jiang, Min Li","doi":"10.1155/cplx/9965155","DOIUrl":"https://doi.org/10.1155/cplx/9965155","url":null,"abstract":"While deep learning–based layered feature extraction methods have achieved remarkable success, their reliance on large-scale annotated datasets limits their applicability in small-sample scenarios. To address this challenge, a novel feature extraction method has been proposed within the traditional image processing framework. This technique is specifically designed for scenarios with limited training data, aiming to enhance performance and efficiency in such conditions. Inspired by image separation algorithms and multifeature fusion strategies, the proposed approach employs guided filtering combined with the Sobel gradient operator to decompose the original finger vein image into a foreground layer and a background layer. Texture features are extracted from the foreground layer, while structural features are derived from the background layer, resulting in two complementary feature maps that capture multidimensional information. These maps are then encoded into a unified one-dimensional feature vector using block-wise histogram descriptors, which enhances feature representation and ensures translation invariance. By separately extracting and effectively fusing multilevel features, the method significantly alleviates the impact of noise on feature extraction and discriminative performance. Without relying on large-scale data, it improves the robustness and practicality of finger vein recognition. Extensive experiments on public datasets validate the effectiveness and generalization capability of the proposed approach.","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2025 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/9965155","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145007981","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

RETRACTION: Interactive Algorithms in Complex Image Processing Systems Based on Big Data 基于大数据的复杂图像处理系统中的交互算法

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-02 DOI: 10.1155/cplx/9826907

Complexity

引用次数: 0

Evolutionary External Archive for Gaining-Sharing Knowledge–Based Algorithm 基于增益共享知识算法的进化外部存档

IF 1.7 4区工程技术

Complexity Pub Date : 2025-09-01 DOI: 10.1155/cplx/8823662

Hao Li, Zhaoning Tian, Zhenhua Li

{"title":"Evolutionary External Archive for Gaining-Sharing Knowledge–Based Algorithm","authors":"Hao Li, Zhaoning Tian, Zhenhua Li","doi":"10.1155/cplx/8823662","DOIUrl":"https://doi.org/10.1155/cplx/8823662","url":null,"abstract":"Real-parameter single-objective optimization has become a prominent focus within artificial intelligence in recent years. Among population-based metaheuristics, differential evolution (DE) and covariance matrix adaptation evolution strategy (CMA-ES) have consistently demonstrated strong performance. However, the difficulty of solving optimization problems increases exponentially with the dimensionality of the objective function, resulting in a corresponding rise in the number of required function evaluations. To address this challenge, a novel algorithm—the Gaining-Sharing Knowledge (GSK)–based algorithm—has emerged as a promising solution. GSK’s development trajectory currently resembles the early stages of DE. Nevertheless, further enhancements are necessary to unlock its full potential. In this paper, we propose an evolutionary external archive (EEA) for GSK and its variants, inspired by the external archive mechanism used in DE. The proposed EEA integrates individuals from both the current population and the archive into the evolutionary process. To promote diversity, we apply an evolutionary procedure based on CMA-ES within the archive and exclude individuals from the archive if identical counterparts exist in the current generation. We evaluate our approach using three benchmark test suites from the Congress on Evolutionary Computation (CEC) and real-world optimization problems from CEC 2011. Our experimental analysis compares GSK and its variants with and without the EEA. Results show that the EEA significantly improves the performance of GSK and its variants. Consequently, the GSK variant, AGSK, with the EEA is selected for further comparison against benchmark algorithms. Experimental results confirm that our proposed method is highly competitive.","PeriodicalId":50653,"journal":{"name":"Complexity","volume":"2025 1","pages":""},"PeriodicalIF":1.7,"publicationDate":"2025-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/cplx/8823662","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144923760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

RETRACTION: Linkboost: A Link Prediction Algorithm to Solve the Problem of Network Vulnerability in Cases Involving Incomplete Information Linkboost：一种解决信息不完全情况下网络漏洞的链路预测算法

IF 1.7 4区工程技术

Complexity Pub Date : 2025-08-28 DOI: 10.1155/cplx/9873491

Complexity

引用次数: 0

Complexity最新文献