{"title":"Arithmetic-Free Personalized Compressed Sensing Based On Deep Neural Networks for Wireless Transmission From Brain–Computer Interfaces","authors":"Erfan Ebrahim Esfahani;Ali Khadem","doi":"10.1109/TSMC.2025.3584478","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3584478","url":null,"abstract":"State-of-the-art brain–computer interfaces can carry out neural recording from hundreds of channels with high resolution. Such massive data makes it easy to study the brain better than ever before, but on the flip side, it leads to increased chip size, power consumption, heat dissipation and risk for patient safety. As such, compression of the data prior to transmission from the implant could be key to improving reliability and usability of such microsystems. In recent years, starting from sparsifying transforms all the way to compressive autoencoders (AEs), this compression has been offered by substantial arithmetic on the implant side, which in turn incurs its own inevitable costs. In this work, we analyze spike waveforms to prioritize subintervals by their importance. Thereupon, we design a temporal undersampling pattern matching the importance of each subinterval for compressive sensing of spikes. Following such sensing, we reconstruct spikes using a deep neural network (DNN) trained to capture spike representation from the undersampled measurements, with possible adaptation to individual subjects. This approach offers what we believe is the first spike compression-reconstruction framework that imposes no arithmetic on the compressing side, yet on the restoration side, performs at least on par with most on-chip arithmetic-heavy techniques. For instance, given a spike length of <inline-formula> <tex-math>$N=64$ </tex-math></inline-formula> at eightfold compression, the famed symmlet-4 method yields a mean signal-to-noise-and-distortion ratio (SNDR) of 7.14 dB at a total compression arithmetic cost of <inline-formula> <tex-math>$16N$ </tex-math></inline-formula> sums and products per spike, while for the proposed method, the figure is 8.38 dB at 0 sums and products.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7228-7237"},"PeriodicalIF":8.7,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jian Song;Guanjun Liu;Ying Tang;Li Wang;Miaomiao Wang;Lin Li
{"title":"An Innovative Formal Verification Method Based on Timed Petri Nets With Integrated Database Tables","authors":"Jian Song;Guanjun Liu;Ying Tang;Li Wang;Miaomiao Wang;Lin Li","doi":"10.1109/TSMC.2025.3585039","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3585039","url":null,"abstract":"Formal verification becomes increasingly critical to ensure system functionality, reliability and safety as they grow in complexity. Existing methods tend to focus on a single dimension of system aspects—such as control flow, data flow or timing constraints—or, at most, consider two of these perspectives without integrating all three. In addition, data flow models generally represent high-level data abstraction without including operational details within underlying contexts. The inability of these models to capture system behavior undermines their reliability, ultimately increasing the likelihood of the corresponding systems malfunctioning. To address these issues, we propose a formal verification method based on a timed Petri net with database tables (TPDT-net). First, we model the system using TPDT-net and generate its state reachability graph (SRG). Next, we extend timed computation tree logic (TCTL) by introducing database-related data element operators, thus proposing a database-oriented TCTL (DTCTL) model checking method. In addition, we formalize the system correctness problem as corresponding DTCTL formulas, which are analyzed based on the SRG. This approach transforms correctness verification into a satisfiability problem of DTCTL formulas within the SRG. Finally, we validate the practicality and effectiveness of the proposed method through case studies and experiments.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7410-7424"},"PeriodicalIF":8.7,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145090165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Cluster Synchronization of Individuals During an Epidemic: A Contraction-Based Analysis","authors":"Shidong Zhai;Jinkui Zhang;Jun Ma;Zhengrong Xiang","doi":"10.1109/TSMC.2025.3585121","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3585121","url":null,"abstract":"This article investigates cluster synchronization (CS) of individuals during an epidemic using a coupled nonlinear network that integrates diffusion-coupled nonlinear systems with an susceptible-infected-recovered (SIR) virus model. To better reflect real-life scenarios, individuals are grouped into clusters, and the model incorporates recovery rates that vary according to collective behavior patterns. The study focuses on analyzing the relationship between CS behavior and the progression of virus transmission within the network. By ensuring that the directed graph satisfies the cluster input equivalence condition and that the system’s Jacobian matrix remains bounded, contraction analysis is employed to establish conditions for achieving CS, which are influenced by the virus’s state. Furthermore, the impact of CS on epidemic dynamics is explored. Numerical simulations validate the theoretical findings.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6868-6878"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Universal Reactive Approach for Graph-Based Persistent Path Planning Problems With Temporal Logic Constraints","authors":"Tong Wang;Yuanhao Li;Panfeng Huang","doi":"10.1109/TSMC.2025.3579023","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3579023","url":null,"abstract":"This article introduces a reactive methodology tailored for a wide range of practical graph-based path planning applications. In these scenarios, a robot with limited sensor capabilities traverses an undirected graph to optimize metrics related to task duration. This article formalizes these challenges as graph-based persistent path planning problems with temporal logical constraints and proposes a comprehensive persistence planning framework. A novel universal algorithm with quadratic time complexity is designed, striking an optimal balance between accuracy and computational efficiency by establishing a new decision space. Theoretical analysis verifies the algorithm’s convergence and generality, especially for patrol, persistent surveillance, and watchman routing tasks. Moreover, the proposed algorithm is evaluated across various simulation scenarios, demonstrating its effectiveness in addressing complex path planning challenges.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6696-6709"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fuxi Niu;Xiaohong Nian;Miaoping Sun;Yong Chen;Yu Shi;Jieyuan Yang;Shiling Li
{"title":"Distributed Nonconvex Optimization and Application to UAV Optimal Rendezvous Formation","authors":"Fuxi Niu;Xiaohong Nian;Miaoping Sun;Yong Chen;Yu Shi;Jieyuan Yang;Shiling Li","doi":"10.1109/TSMC.2025.3583312","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3583312","url":null,"abstract":"A distributed multiagent deep reinforcement learning algorithm (DMADRLA) with theoretical guarantees is proposed for the distributed nonconvex constraint optimization problem. This algorithm provides an innovative theoretical framework for distributed nonconvex optimization problems (DNCOPs) by combining traditional distributed constraint optimization and multiagent deep reinforcement learning methods. This combination eliminates the need for general assumptions on the cost function, enabling a more comprehensive view of distributed nonconvex optimization strategies. It allows for the analysis of both traditional distributed constrained optimization and multiagent deep reinforcement learning methods in one unified approach. Finally, the effectiveness of the algorithm is verified through numerical simulations and experimental verification.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6789-6801"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100306","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Similar-Niching-Based Differential Evolution for Constrained Multimodal Multiobjective Optimization","authors":"Hongyu Lin;Jing Liang;Caitong Yue;Ying Bi;Kangjia Qiao;Yaonan Wang;Ponnuthurai Nagaratnam Suganthan","doi":"10.1109/TSMC.2025.3582852","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3582852","url":null,"abstract":"In constrained multimodal multiobjective optimization problems (CMMOPs), the existence of discrete and confined feasible regions bring great challenges to current multiobjective optimization evolutionary algorithms (MOEAs). To address these challenges, this article proposes a constrained multimodal multiobjective differential evolution algorithm, which incorporates a similar-niching-based reproduction operator and a novel environmental selection mechanism. The proposed algorithm initiates by segregating the population into distinct niches, thereby promoting independent evolution within each niche. This segmentation enhances the exploration of multiple discrete feasible regions, thus improving the capacity to find diverse Pareto optimal solutions. Moreover, the algorithm selects the most similar niche to collaboratively generate solutions, further enhancing its ability to generate effective feasible solutions. To improve the diversity within the population, the proposed environmental selection mechanism gives preference to solutions that enhance the distribution of the next-generation population. By considering the diversity in both two spaces, the population retains more pareto optimal solutions. Based on the Friedman test results of the comparison experiment with other representative algorithms and the champion algorithm of the CEC2023 CMMOPs competition, the proposed algorithm attained the top ranking, thereby reinforcing its demonstrated superiority. Meanwhile, the proposed algorithm is used to solve the constrained multimodal multiobjective location selection problem and results show its superiority.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"6710-6722"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145100342","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wencheng Han;Hao Li;Maoguo Gong;Yue Wu;A. K. Qin;Lining Xing;Yu Zhou
{"title":"Evolutionary Multiobjective Cross-Spectral Adversarial Attacks With Synergistic Patches","authors":"Wencheng Han;Hao Li;Maoguo Gong;Yue Wu;A. K. Qin;Lining Xing;Yu Zhou","doi":"10.1109/TSMC.2025.3584347","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3584347","url":null,"abstract":"DNN have demonstrated vulnerability to adversarial attacks in object detection tasks. While significant progress has been made in single-spectrum attacks, cross-spectral adversarial attacks remain challenging due to the complex tradeoffs between visible and infrared domains. To address this, an evolutionary multiobjective cross-spectral attack (MoXAttack) framework, for developing adversarial patches in closed-box cross-spectral scenarios is proposed. MoXAttack incorporates a multipopulation constraint-handling technique, which uses both penalty functions and feasibility rules to guide the search process. Spectrum-aware genetic operators are introduced to enhance solution diversity and feasibility. The framework automatically optimizes the smooth to cross-spectral shared patch shape using curvature energy. In addition, MoXAttack utilizes singular value decomposition for visible spectrum texture perturbations and adjustable thermal shielding material thickness for infrared spectrum control. Experiments on the LLVIP dataset demonstrate that MoXAttack achieves competitive performance across multiple object detection models. Ablation studies reveal the positive impact of improved components on attack effectiveness. The multipatch strategy improves attack success rates by at least 17%, while optimized patch shapes outperform conventional geometric shapes by at least 25% in terms of mean average precision drop. In the physical world test, the proposed method shows stability in different viewing angles.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7395-7409"},"PeriodicalIF":8.7,"publicationDate":"2025-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145090074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IEEE Systems, Man, and Cybernetics Society Information","authors":"","doi":"10.1109/TSMC.2025.3584486","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3584486","url":null,"abstract":"","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 8","pages":"C3-C3"},"PeriodicalIF":8.6,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11085017","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144663734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems Publication Information","authors":"","doi":"10.1109/TSMC.2025.3584492","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3584492","url":null,"abstract":"","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 8","pages":"C2-C2"},"PeriodicalIF":8.6,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11085018","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144657420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TechRxiv: Share Your Preprint Research With the World!","authors":"","doi":"10.1109/TSMC.2025.3584424","DOIUrl":"https://doi.org/10.1109/TSMC.2025.3584424","url":null,"abstract":"","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 8","pages":"5437-5437"},"PeriodicalIF":8.6,"publicationDate":"2025-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11085022","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144662013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}