检索结果-内蒙古大学图书馆

Robust Event-Triggered control of Nonlinear systems Under a Global Sector-Bound Condition

Guidance, Navigation and control 2022年第2期2卷 59-79页

作者： Pengpeng Zhang Tengfei Liu Zhong-Ping Jiang Department of Control Science&Engineering Frontiers Science Center for Intelligent Autonomous SystemsTongji UniversityShanghai 201804P.R.China State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819P.R.China Department of Electrical and Computer Engineering New York University370 Jay StreetBrooklynNY 11201USA

This paper studies an event-tniggered control problem for nonlinear systems subject to both external disturbancoes and dy namic *** is assumed that the system satisfies a global sector bound *** avold infnitely fast samplng,a novel eventriggred sampling mechanism is propoeed,which use8 not only the measuned system state but also an estimation of the inluence of the *** the propoeed design,the intersampling intervals an be lower bounded by a poeitive constant,and it is independent of botb external disturbances and dynamie ***,the doeedl loop event-tniggered system i proved to be input-torstate stable with repect to the extemal *** smalgain techmigues are;used for the stability analysis of the dloeeil-bop system.

关键词： Event-triggered control external disturbance dynamic uncertainty input-to-state stability

来源：评论

学校读者我要写书评

暂无评论

Stealthy Attacks on Sampled-Data control and Encryption-Based Countermeasures

引用

IEEE Transactions on Automatic control 2025年

作者： Shang, Jun Li, Yuzhe Chen, Tongwen Tongji University Department of Control Science and Engineering Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai200092 China Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110004 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada

This paper investigates stealthy attacks on sampled-data control systems, where a continuous process is sampled periodically, and the resultant discrete output and control signals are transmitted through dual channels in wireless communication networks. Acknowledging the vulnerability of these transmitted data to cyber threats, we analyze two types of stealthy attacks that compromise either one or both channels. We explicitly present the necessary and sufficient conditions for the existence of stealthy single-channel attacks. To mitigate these security risks, we implement encryption-based countermeasures, including linear time-invariant and periodic encryption methods. We detail sufficient conditions under which these encryption strategies effectively thwart single- and dual-channel stealthy attacks. The effectiveness of these approaches and the theoretical findings are demonstrated through numerical simulations. © 1963-2012 IEEE.

关键词： Cyber attacks

来源：评论

学校读者我要写书评

暂无评论

The Research on Sheet Metal Part Recognition Technology Based on Improved Mask R-CNN

The Research on Sheet Metal Part Recognition Technology Base...

引用

Machine Learning and computer Application (ICMLCA), International Conference on

作者： Mingfei Liu Jun Liu Kecheng Zhou Jian Wang Key Laboratory of Industrial Intelligence Technology on Chemical Process School of Computer Science and Technology Shenyang University of Chemical Technology Shenyang Liaoning Province China Chinese Academy of Sciences Key Laboratory of Networked Control Systems Shenyang China Chinese Academy of Sciences Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China

ISBN: (数字)9798331530334

ISBN: (纸本)9798331530341

The visual recognition of sheet metal parts is a crucial component of industrial automation sorting, particularly under complex lighting and background interference conditions. To enhance the accuracy of sheet metal part recognition, this paper curates a dataset of sheet metal parts acquired by an intelligent light field image sensor and proposes a visual recognition model, PA-CBAM, based on an improved Mask R-CNN. By improving the original feature pyramid FPN and introducing the Convolutional Block Attention Module (CBAM), the model enhances multi-scale feature fusion and the focus on key features: (1) Bottom up paths and shortcut connections have been added between different layers of the traditional FPN feature pyramid, thereby improving multi-scale object detection capability. (2) CBAM further optimizes the model's channel and spatial attention mechanisms, effectively enhancing the capture of edge details and the suppression of background noise. Experimental results show that the proposed PA-CBAM model significantly improves detection and segmentation performance compared to traditional methods, particularly in terms of edge recognition accuracy for sheet metal parts under complex lighting conditions.

关键词： Visualization Accuracy Image edge detection Metals Lighting Object detection Feature extraction Light fields Optimization Sorting

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Research on Target Detection Method Based on Improved YOLOv5 19th

Research on Target Detection Method Based on Improved YOLOv5

引用

19th International Conference on Web Information systems and Applications, WISA 2022

作者： Wang, Rongzhuang Liu, Jun Zhang, Hualiang School of Computer Science and Technology Shenyang University of Chemical Technology Shenyang110142 China Liaoning Key Laboratory of Intelligent Technology for Chemical Process Industry Shenyang110142 China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang110016 China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China

ISBN: (纸本)9783031203084

At present, various target detection algorithms are used in detection and classification. It is a problem to improve the accuracy and speed of target detection by using deep learning and neural network model to train the parameters of the data set. Aiming at the problems of insufficient detection, inaccurate detection of complex background and loss of small target feature information in yolov5 target detection, an improved method combining hole convolution, moving exponential average and retraining of positive samples is proposed in this paper. This method effectively solves the problems of complex background, occlusion and incomplete feature extraction, reduces the loss rate of target features, and improves the detection accuracy of each category. The improved yolov5 target detection algorithm in this paper can not only use multi feature fusion and accelerate positive sample matching, but also use cavity convolution to increase receptive field, improve the detection effect of small targets and reduce the occurrence of missed detection and false detection. Experiments show that the improved yolov5 algorithm has better detection rate and lower loss rate than many existing target detection algorithms. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further reduced to O)(log(T)), and the network cumulative constraint violation bound is reduced to O(log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Cardiac Medical Image Segmentation Based on an Improved U-Net Model

Research on Cardiac Medical Image Segmentation Based on an I...

引用

Image processing, computer Vision and Machine Learning (ICICML), International Conference on

作者： Yuqing Wu Jun Wang Rui Wang Jian Wang Kecheng Zhou Xiaoxin Zhang School of Computer Science and Technology Shenyang University of Chemical Technology Key Laboratory of Industrial Intelligence Technology on Chemical Process Liaoning Province Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Department of Emergency Zhongyi Northeast International Hospital Co. Ltd. Shenyang China

ISBN: (数字)9798350355413

ISBN: (纸本)9798350355420

This paper presents a cardiac MRI image segmentation model based on an improved U-Net architecture. Accurate segmentation of cardiac MRI images is critical for the diagnosis and treatment of cardiovascular diseases, yet existing U-Net models exhibit limitations in handling complex cardiac structures and multi-scale features. To address these challenges, this paper proposes two key enhancements. First, we propose a Multi-Dimensional Context Attention module, designed to improve the integration of global and local information within the skip connections, thereby enhancing segmentation accuracy for intricate cardiac structures. Furthermore, we propose a Reverse Feature Modulation module, which generates reverse masks and dynamically adjusts feature weights across different classes using adaptive weighting, effectively mitigating class imbalance issues in multi-class segmentation tasks and improving focus on difficult-to-segment regions. Experimental results demonstrate that the proposed model outperforms the standard U-Net on the ACDC dataset, achieving significant improvements in evaluation metrics such as the Dice coefficient. These enhancements underscore the model's efficacy and robustness in complex cardiac image segmentation tasks, offering new technical support for automated cardiovascular disease diagnosis.

关键词： Image segmentation Accuracy Magnetic resonance imaging Computational modeling Modulation Context awareness Robustness Medical diagnosis Cardiovascular diseases Context modeling

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Mathematics Southeast University Nanjing210096 China The Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms require that each agent broadcasts its decision to its neighbors at each iteration. To better utilize the limited communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：