Dear Editor, The letter proposes a tensor low-rank orthogonal compression (TLOC) model for a convolutional neural network (CNN), which facilitates its efficient and highly-accurate low-rank representation. Model compression is crucial for deploying deep neural network (DNN) models on resource-constrained embedded devices. However, the typical approach based on prefine tuning is time-consuming, laborintensive and computationally expensive. Moreover, training a low-rank model from scratch presents significant challenges including substantial accuracy degradation and end-to-end training disruption. Motivated by these critical challenges, this letter presents the end-to-end TLOC model adopting the following three-fold ideas: 1) Utilizing the tucker-2 and truncated singular value decomposition (TSVD) decompositions to compress the weights of the Convolutional and fully connected (FC) layers, thus training a deep model in a low-rank format from scratch; 2) Incorporating an orthogonal regularization term into the compression process, thereby enhancing the TLOC model's representation ability to the structure of a CNN's weights; and 3) Incorporating a cyclic learning rate adjustment strategy into the training process for efficient models training. Experimental results on multiple deep networks and datasets demonstrate that the proposed TLOC model can establish highly accurate representation to a CNN without accuracy loss to its downstream tasks, thus outperforming benchmark and state-of-the-art models in implementing efficiency and accurate CNN compression.
{"title":"Tensor Low-Rank Orthogonal Compression for Convolutional Neural Networks","authors":"Yaping He;Xin Luo","doi":"10.1109/JAS.2025.125213","DOIUrl":"https://doi.org/10.1109/JAS.2025.125213","url":null,"abstract":"Dear Editor, The letter proposes a tensor low-rank orthogonal compression (TLOC) model for a convolutional neural network (CNN), which facilitates its efficient and highly-accurate low-rank representation. Model compression is crucial for deploying deep neural network (DNN) models on resource-constrained embedded devices. However, the typical approach based on prefine tuning is time-consuming, laborintensive and computationally expensive. Moreover, training a low-rank model from scratch presents significant challenges including substantial accuracy degradation and end-to-end training disruption. Motivated by these critical challenges, this letter presents the end-to-end TLOC model adopting the following three-fold ideas: 1) Utilizing the tucker-2 and truncated singular value decomposition (TSVD) decompositions to compress the weights of the Convolutional and fully connected (FC) layers, thus training a deep model in a low-rank format from scratch; 2) Incorporating an orthogonal regularization term into the compression process, thereby enhancing the TLOC model's representation ability to the structure of a CNN's weights; and 3) Incorporating a cyclic learning rate adjustment strategy into the training process for efficient models training. Experimental results on multiple deep networks and datasets demonstrate that the proposed TLOC model can establish highly accurate representation to a CNN without accuracy loss to its downstream tasks, thus outperforming benchmark and state-of-the-art models in implementing efficiency and accurate CNN compression.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 1","pages":"227-229"},"PeriodicalIF":19.2,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11369927","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082151","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}
The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex. Furthermore, it is particularly parsimonious on the number of function evaluations, thus making it preferable to convex optimization paradigms in the case, common when dealing with control design problems, that the objective function of the optimization problem is non-differentiable, non-convex, and its closed-form is not available or difficult to be computed analytically. The main goal of this paper is to show how the joint use of the Nelder-Mead simplex method and the Morrison algorithm can be successfully used to solve relevant and challenging control problems that cannot be easily solved using analytic methods. In particular, it is shown how the problems of strong stabilization, static output feedback stabilization, and design of robust controllers having fixed structure can be framed as optimization problems, which, in turn, can be efficiently solved by coupling the two above mentioned algorithms. The performance of this procedure is compared with state-of-the-art techniques on dozens of static output feedback benchmark case studies, and its effectiveness is demonstrated by several examples.
{"title":"On the Use of the Nelder-Mead Simplex Method in Control Design and Systems Theory","authors":"Laura Menini;Corrado Possieri;Antonio Tornambe","doi":"10.1109/JAS.2025.125759","DOIUrl":"https://doi.org/10.1109/JAS.2025.125759","url":null,"abstract":"The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex. Furthermore, it is particularly parsimonious on the number of function evaluations, thus making it preferable to convex optimization paradigms in the case, common when dealing with control design problems, that the objective function of the optimization problem is non-differentiable, non-convex, and its closed-form is not available or difficult to be computed analytically. The main goal of this paper is to show how the joint use of the Nelder-Mead simplex method and the Morrison algorithm can be successfully used to solve relevant and challenging control problems that cannot be easily solved using analytic methods. In particular, it is shown how the problems of strong stabilization, static output feedback stabilization, and design of robust controllers having fixed structure can be framed as optimization problems, which, in turn, can be efficiently solved by coupling the two above mentioned algorithms. The performance of this procedure is compared with state-of-the-art techniques on dozens of static output feedback benchmark case studies, and its effectiveness is demonstrated by several examples.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 1","pages":"186-204"},"PeriodicalIF":19.2,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082155","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}
Dear Editor, This letter presents a node feature similarity preserving graph convolutional framework PD2G. Graph neural networks (GNNs) have garnered significant attention for their efficacy in learning graph representations across diverse real-world applications. They adeptly explore graph structure and node features, employing aggregation and transformation mechanisms within neighborhoods. However, some studies have indicated a trend among GNN models, which prioritize structural information over node feature information. Unfortunately, in numerous scenarios, the significance of node features remains paramount. On top of that, it is acknowledged that datasets frequently encompass noisy structural and feature components, which may not be appropriately refined for subsequent analysis. Inspired by these, we propose a novel GNN framework PD2G, a personalized PageRank (PPR) driven dual GNN, to capitalize on the rich node feature information. Specifically, our approach includes the integration of consistency loss within the feature channel to feature biases in the model. Besides, we leverage the cross-channel alignment strategy to balance information from graph structure and node features. Extensive experiments show the superiority of our solutions when contrasted with baselines.
{"title":"Dual Channel Graph Convolutional Networks via Personalized PageRank","authors":"Longlong Lin;Xin Luo","doi":"10.1109/JAS.2025.125492","DOIUrl":"https://doi.org/10.1109/JAS.2025.125492","url":null,"abstract":"Dear Editor, This letter presents a node feature similarity preserving graph convolutional framework PD<sup>2</sup>G. Graph neural networks (GNNs) have garnered significant attention for their efficacy in learning graph representations across diverse real-world applications. They adeptly explore graph structure and node features, employing aggregation and transformation mechanisms within neighborhoods. However, some studies have indicated a trend among GNN models, which prioritize structural information over node feature information. Unfortunately, in numerous scenarios, the significance of node features remains paramount. On top of that, it is acknowledged that datasets frequently encompass noisy structural and feature components, which may not be appropriately refined for subsequent analysis. Inspired by these, we propose a novel GNN framework PD<sup>2</sup>G, a personalized PageRank (PPR) driven dual GNN, to capitalize on the rich node feature information. Specifically, our approach includes the integration of consistency loss within the feature channel to feature biases in the model. Besides, we leverage the cross-channel alignment strategy to balance information from graph structure and node features. Extensive experiments show the superiority of our solutions when contrasted with baselines.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 1","pages":"221-223"},"PeriodicalIF":19.2,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11369912","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082159","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}
Dear Editor, This letter addresses the challenge of achieving robust global coordination in multi-agent systems (MASs) subject to heterogeneous actuator saturation and additive input disturbances. We develop a novel distributed control framework that strategically integrates a redesigned saturation function to handle the nonlinear actuator constraint and a high-gain feedback mechanism for effective disturbance rejection. With this novel method, by carefully selecting both constant and time-varying saturation parameters in the redesigned saturation function and the high-gain parameter, global coordination can be achieved decoupled with the initial state of each agent and the communication topology of the MAS. Numerical examples demonstrate the effectiveness of the theoretical results.
{"title":"A Novel Distributed Controller Design for Robust Global Coordination of MASs with Heterogeneous Saturation","authors":"Xiaoling Wang;Shengnan Zhu","doi":"10.1109/JAS.2025.125663","DOIUrl":"https://doi.org/10.1109/JAS.2025.125663","url":null,"abstract":"Dear Editor, This letter addresses the challenge of achieving robust global coordination in multi-agent systems (MASs) subject to heterogeneous actuator saturation and additive input disturbances. We develop a novel distributed control framework that strategically integrates a redesigned saturation function to handle the nonlinear actuator constraint and a high-gain feedback mechanism for effective disturbance rejection. With this novel method, by carefully selecting both constant and time-varying saturation parameters in the redesigned saturation function and the high-gain parameter, global coordination can be achieved decoupled with the initial state of each agent and the communication topology of the MAS. Numerical examples demonstrate the effectiveness of the theoretical results.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 1","pages":"230-232"},"PeriodicalIF":19.2,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11369920","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082195","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}
We observe that the response speed of a linear time-invariant system to a step reference input depends not only on the system parameters but also on the magnitude of the step input. Based on this observation, we demonstrate a method to schedule the magnitude of the reference input to achieve a faster response. We will start out with a step input with a higher magnitude for a higher response speed and reduce the magnitude to the intended level as the output approaches it. We hope this observation will provide additional insight into how a linear time-invariant system responds to a step input and stimulate the full development of this reference input scheduling method for increasing the response speed without redesigning the system.
{"title":"Increasing the Response Speed Without Redesigning the System: A Reference Input Scheduling Approach","authors":"Zongli Lin","doi":"10.1109/JAS.2026.125813","DOIUrl":"https://doi.org/10.1109/JAS.2026.125813","url":null,"abstract":"We observe that the response speed of a linear time-invariant system to a step reference input depends not only on the system parameters but also on the magnitude of the step input. Based on this observation, we demonstrate a method to schedule the magnitude of the reference input to achieve a faster response. We will start out with a step input with a higher magnitude for a higher response speed and reduce the magnitude to the intended level as the output approaches it. We hope this observation will provide additional insight into how a linear time-invariant system responds to a step input and stimulate the full development of this reference input scheduling method for increasing the response speed without redesigning the system.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 1","pages":"1-2"},"PeriodicalIF":19.2,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082205","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}
Xingxing You;Songyi Dian;Bin Guo;Quan Xiao;Yuqi Zhu;Kai Liu
To address the finite-time tracking control problem for fractional-order nonlinear systems (FONSs) with actuator faults and external disturbance, a novel strategy of the finite-time adaptive fuzzy fault-tolerant controller is presented in this paper by utilizing the finite-time stability theory and fractional-order dynamic surface control scheme combined with backstepping method. A new lemma is developed for analyzing the finite-time stability of FONSs in terms of fractional differential inequality, which modifies some existing results. Fuzzy logic systems are adopted to identify unknown nonlinear characteristics in FONS. In order to compensate for the influence of unknown external disturbance and estimation error for fuzzy logic systems, an auxiliary function is employed to estimate the upper bound of parameters online. Furthermore, a global coordinate transformation is first introduced initially to decouple the fractional-order dynamic system of a specific class of underactuated single-link flexible manipulator systems, thereby transforming it into lower triangular systems. Simulation analyses and experimental results verify the feasibility and effectiveness of finite-time tracking control algorithm.
{"title":"Novel Finite-Time Adaptive Fuzzy Fault-Tolerant Control for Fractional-Order Nonlinear Systems and Its Applications","authors":"Xingxing You;Songyi Dian;Bin Guo;Quan Xiao;Yuqi Zhu;Kai Liu","doi":"10.1109/JAS.2025.125852","DOIUrl":"https://doi.org/10.1109/JAS.2025.125852","url":null,"abstract":"To address the finite-time tracking control problem for fractional-order nonlinear systems (FONSs) with actuator faults and external disturbance, a novel strategy of the finite-time adaptive fuzzy fault-tolerant controller is presented in this paper by utilizing the finite-time stability theory and fractional-order dynamic surface control scheme combined with backstepping method. A new lemma is developed for analyzing the finite-time stability of FONSs in terms of fractional differential inequality, which modifies some existing results. Fuzzy logic systems are adopted to identify unknown nonlinear characteristics in FONS. In order to compensate for the influence of unknown external disturbance and estimation error for fuzzy logic systems, an auxiliary function is employed to estimate the upper bound of parameters online. Furthermore, a global coordinate transformation is first introduced initially to decouple the fractional-order dynamic system of a specific class of underactuated single-link flexible manipulator systems, thereby transforming it into lower triangular systems. Simulation analyses and experimental results verify the feasibility and effectiveness of finite-time tracking control algorithm.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"13 1","pages":"123-136"},"PeriodicalIF":19.2,"publicationDate":"2026-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146082202","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}
Dear Editor, This letter presents a comprehensive overview of the AGILEHAND project's technical architecture and its role in developing innovative solutions for the grading, handling, and packaging of soft, deformable products within agile and reconfigurable manufacturing lines. The letter focuses on the architectural blueprint of AGILEHAND, detailing its functional and technical specifications. It also describes the integration process of solutions, highlighting the methods used to ensure seamless interoperability and data flow across different systems. Furthermore, the letter demonstrates the application of AGILEHAND solutions through two specific scenarios, showcasing their effectiveness and adaptability. This comprehensive overview underscores the significance of the AGILEHAND architecture in enhancing manufacturing efficiency and flexibility.
{"title":"A Modular Approach to Adaptive Manufacturing: The AGILEHAND Architecture","authors":"Mansoor Ahmed;Ruben Costa;Rui Branco;Jorge Calado;José Ferreira;Filippo Ciarapica;Francisco Fraile;Mohamed Lamine Mekhalfi","doi":"10.1109/JAS.2025.125795","DOIUrl":"https://doi.org/10.1109/JAS.2025.125795","url":null,"abstract":"Dear Editor, This letter presents a comprehensive overview of the AGILEHAND project's technical architecture and its role in developing innovative solutions for the grading, handling, and packaging of soft, deformable products within agile and reconfigurable manufacturing lines. The letter focuses on the architectural blueprint of AGILEHAND, detailing its functional and technical specifications. It also describes the integration process of solutions, highlighting the methods used to ensure seamless interoperability and data flow across different systems. Furthermore, the letter demonstrates the application of AGILEHAND solutions through two specific scenarios, showcasing their effectiveness and adaptability. This comprehensive overview underscores the significance of the AGILEHAND architecture in enhancing manufacturing efficiency and flexibility.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"12 12","pages":"2615-2617"},"PeriodicalIF":19.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11321073","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886691","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}
Dear Editor, The distribution of eigenvalues, i.e., the zeros of the characteristic functions of linear time-invariant (LTI) systems, is of great significance for analyzing and synthesizing the performance of these systems. The research on the distribution of eigenvalues mainly focuses on the determination of the number of zeros of polynomials or quasi-polynomials in a fixed region of the entire complex plane, where the determination of the distribution of zeros of quasi-polynomials has always been a challenging issue [1], [2]. Recently, several results on the determination of the number of zeros of a class of quasi-polynomials in the open right-half complex plane were derived in [3], where the quasi-polynomials can be neutral type with complex (real) coefficients.
{"title":"Determination of the Number of Zeros of Quasi-Polynomials via Function Curves","authors":"Honghai Wang","doi":"10.1109/JAS.2026.125756","DOIUrl":"https://doi.org/10.1109/JAS.2026.125756","url":null,"abstract":"Dear Editor, The distribution of eigenvalues, i.e., the zeros of the characteristic functions of linear time-invariant (LTI) systems, is of great significance for analyzing and synthesizing the performance of these systems. The research on the distribution of eigenvalues mainly focuses on the determination of the number of zeros of polynomials or quasi-polynomials in a fixed region of the entire complex plane, where the determination of the distribution of zeros of quasi-polynomials has always been a challenging issue [1], [2]. Recently, several results on the determination of the number of zeros of a class of quasi-polynomials in the open right-half complex plane were derived in [3], where the quasi-polynomials can be neutral type with complex (real) coefficients.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"12 12","pages":"2612-2614"},"PeriodicalIF":19.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11321134","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145886690","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}
Dear Editor, The industrial internet of things (IIoT) integrates communications and controls into a cohesive system within the framework of Industry 5.0, where time delay critically impairs system performance. Especially, the introduction of wireless networks results in more severe induced delays than wired networks, owing to the greater complexity of factors affecting reliable state updates. From the perspective of control requirements, the state update process depends on the successful rate and real-time performance of information transmission. A low successful transmission rate causes data backlog and delays state updates, while a high rate reduces delay but requires more communication resources. Nevertheless, the control center must rely on previously updated state information before the next sampling period. Therefore, simply increasing the transmission rate may not necessarily enhance long-term system performance.
{"title":"AoI Violation Constrained Control Cost Optimization for Delay-Sensitive Industrial IoT","authors":"Jiawei Su;Zhixin Liu;Yaping Li;Yazhou Yuan;Kai Ma","doi":"10.1109/JAS.2024.125076","DOIUrl":"https://doi.org/10.1109/JAS.2024.125076","url":null,"abstract":"Dear Editor, The industrial internet of things (IIoT) integrates communications and controls into a cohesive system within the framework of Industry 5.0, where time delay critically impairs system performance. Especially, the introduction of wireless networks results in more severe induced delays than wired networks, owing to the greater complexity of factors affecting reliable state updates. From the perspective of control requirements, the state update process depends on the successful rate and real-time performance of information transmission. A low successful transmission rate causes data backlog and delays state updates, while a high rate reduces delay but requires more communication resources. Nevertheless, the control center must rely on previously updated state information before the next sampling period. Therefore, simply increasing the transmission rate may not necessarily enhance long-term system performance.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"12 12","pages":"2621-2623"},"PeriodicalIF":19.2,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11321149","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145861227","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}
Dear Editor, This letter deals with the non-fragile filtering problem for the discrete-time networked system subject to fading measurements and potential risk of information leakage. To ensure the system security enhancement, an encryption-decryption scheme is employed to protect the privacy of the transmitted signal via network, under which the real transmitted data is invisible to eavesdroppers. Ultimately, a numerical example is provided to assess the accuracy and efficacy of the derived approaches.
{"title":"Non-Fragile Filtering for Discrete-Time Networked Systems Subject to Fading Measurements: An Encryption and Decryption Scheme","authors":"Jinliang Liu;Jiahui Tang;Lijuan Zha;Engang Tian","doi":"10.1109/JAS.2025.125402","DOIUrl":"https://doi.org/10.1109/JAS.2025.125402","url":null,"abstract":"Dear Editor, This letter deals with the non-fragile filtering problem for the discrete-time networked system subject to fading measurements and potential risk of information leakage. To ensure the system security enhancement, an encryption-decryption scheme is employed to protect the privacy of the transmitted signal via network, under which the real transmitted data is invisible to eavesdroppers. Ultimately, a numerical example is provided to assess the accuracy and efficacy of the derived approaches.","PeriodicalId":54230,"journal":{"name":"Ieee-Caa Journal of Automatica Sinica","volume":"12 12","pages":"2618-2620"},"PeriodicalIF":19.2,"publicationDate":"2025-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11321151","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145861230","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：