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

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

来源：评论

学校读者我要写书评

暂无评论

Dual-beam photothermal material trace detection method based on self-mixing interference

引用

Applied Optics 2025年第16期64卷 4549-4558页

作者： Yan Zhao Yunlong Zhi Hui Zhao Daming Dong Jigang Tong Chunling Tu School of Electrical Engineering and Automation Tianjin University of Technology Tianjin 300384 China Tianjin Key Laboratory for Control Theory and Applications in Complicated Systems Tianjin 300384 China National Engineering Research Center for Intelligent Agricultural Equipment Beijing Academy of Agriculture and Forestry Sciences Beijing 100097 China Department of Computer Systems Engineering Faculty of ICT Tshwane University of Technology Pretoria 0188 South Africa

In this paper, a dual-beam photothermal self-mixing substance trace detection system is proposed. The crystal violet (CV) solution of the sample undergoes a thermal lens effect under the action of pump photoperiod excitation, and the refractive index changes cause the deviation of the probe beam, and the self-mixing interference (SMI) effect occurs when the modulated light returns to the cavity. By combining theoretical and experimental results, the power fluctuation of the SMI signal caused by the thermo-optic effect is linearly related to CV concentration and other parameters. At an excitation power of 24 mW, the detection limit can reach $8.0 \times {10^{- 8}}\;{\rm mol/L}$ . This method does not require labeling or complex CV pretreatment and has high sensitivity and flexibility, providing a guide for CV characterization in biological, environmental, and pharmaceutical research.

关键词： Gaussian beams Laser beams Optical fields Phase shift Refractive index Spatial resolution

来源：评论

学校读者我要写书评

暂无评论

Adaptive UAV-Assisted Hierarchical Federated Learning: Optimizing Energy, Latency, and Resilience for Dynamic Smart IoT Networks

arXiv

引用

arXiv 2025年

作者： Yang, Xiaohong Liwang, Minghui Fu, Liqun Su, Yuhan Hosseinalipour, Seyyedali Wang, Xianbin Hong, Yiguang School of Informatics Xiamen University Fujian China Department of Control Science and Engineering The National Key Laboratory of Autonomous Intelligent Unmanned Systems China Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Tongji University Shanghai China School of Electronic Science and Engineering Xiamen University Xiamen China Department of Electrical Engineering University at Buffalo-SUNY BuffaloNY United States Department of Electrical and Computer Engineering Western University ON Canada

Hierarchical Federated Learning (HFL) introduces intermediate aggregation layers, addressing the limitations of conventional Federated Learning (FL) in geographically dispersed environments with limited communication infrastructure. An application of HFL is in smart IoT systems, such as remote monitoring, disaster response, and battlefield operations, where cellular connectivity is often unreliable or unavailable. In these scenarios, UAVs serve as mobile aggregators, providing connectivity to the terrestrial IoT devices. This paper studies an HFL architecture for energy-constrained UAVs in smart IoT systems, pioneering a solution to minimize global training cost increased caused by UAV disconnection. In light of this, we formulate a joint optimization problem involving learning configuration, bandwidth allocation, and device-to-UAV association, and perform global aggregation in time before UAV drops disconnect and redeployment of UAVs. The problem explicitly accounts for the dynamic nature of IoT devices and their interruptible communications and is unveiled to be NP-hard. To address this, we decompose it into three subproblems. First, we optimize the learning configuration and bandwidth allocation using an augmented Lagrangian function to reduce training costs. Second, we propose a device fitness score, integrating data heterogeneity (via Kullback-Leibler divergence), device-to-UAV distances, and IoT device resources, and develop a twin-delayed deep deterministic policy gradient (TD3)-based algorithm for dynamic device-to-UAV assignment. Third, We introduce a low-complexity two-stage greedy strategy for finding the location of UAVs redeployment and selecting the appropriate global aggregator UAV. Experiments on real-world datasets demonstrate significant cost reductions and robust performance under communication interruptions. © 2025, CC BY-NC-ND.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Pose-graph optimization for efficient tie-point matching and 3D scene reconstruction from oblique UAV images

引用

ISPRS Journal of Photogrammetry and Remote Sensing 2025年 225卷 461-491页

作者： Xu, Zhihua Niu, Yongze Jiang, Jincheng Qin, Rongjun Cui, Ximin College of Geoscience and Surveying Engineering China University of Mining and Technology-Beijing Beijing100083 China North Automatic Control Technology Institute Shanxi Taiyuan030006 China School of Intelligent Systems Engineering Sun Yat-sen University Guangdong Shenzhen518107 China Department of Civil Environmental and Geodetic Engineering The Ohio State University 2036 Neil Avenue ColumbusOH43210 United States Department of Electrical and Computer Engineering The Ohio State University Dreese Laboratories 205 2015 Neil Ave ColumbusOH43210 United States Translational Data Analytics Institute The Ohio State University 1760 Neil Ave ColumbusOH43210 United States

Oblique photogrammetry using unmanned aerial vehicles (UAV) is crucial to 3D scene reconstruction. Nevertheless, oblique images are generally acquired with large overlaps, and sometimes with multiple views. Although this increases the level of data completeness, it introduces additional and sometimes redundant computations in tie-point matching, creating overly dense camera connections in the pose graph for bundle adjustment (BA). This study optimizes the pose graph of oblique UAV images by removing redundant image connections to guide tie-point matching. Assuming a five-camera system for oblique image collection, a pose graph called a topologically connected camera network (TCN) was initially constructed using position and orientation system (POS) data to determine the spatial connectivity among oblique images. Second, five geometric meta-parameters of overlapping images were constructed, and their influence on tie-point matching was analyzed using a data-driven approach to generate a weighted pose graph. Third, the weighted pose graph was simplified to a degree-bounded skeletal camera network (D-SCN) using the proposed two-stage multi-objective graph optimization approach. Finally, the D-SCN was embedded into a structure from motion (SfM) pipeline to produce a novel D-SCN–SfM method to reduce the required computations for tie-point matching. The proposed D-SCN-SfM method was tested using data from three large sites, each containing over 5,000 images. In addition, the D-SCN-SfM method was compared with three state-of-the-art methods. The experimental results indicate that our method can significantly reduce the required computations for tie-point matching to 1/14–1/20 as compared to a method that uses only topological constraints, that is, TCN, saving 89–92% of the time expenditure. Furthermore, the accuracy and completeness of the 3D geometry produced by the proposed method were comparable to those produced by standard SfM methods. The source code of our approach

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

Secure Communication in Dynamic RDARS-Driven systems

arXiv

引用

arXiv 2025年

作者： Pei, Ziqian Wang, Jintao Zhang, Pingping Shi, Zheng Yang, Guanghua Ma, Shaodan State Key Laboratory of Internet of Things for Smart City The Department of Electrical and Computer Engineering University of Macau Macau999078 China School of Intelligent Systems Science and Engineering Jinan University Zhuhai519070 China

In this letter, we investigate a dynamic reconfigurable distributed antenna and reflection surface (RDARS)driven secure communication system, where the working mode of the RDARS can be flexibly configured. We aim to maximize the secrecy rate by jointly designing the active beamforming vectors, reflection coefficients, and the channel-aware mode selection matrix. To address the non-convex binary and cardinality constraints introduced by dynamic mode selection, we propose an efficient alternating optimization (AO) framework that employs penalty-based fractional programming (FP) and successive convex approximation (SCA) transformations. Simulation results demonstrate the potential of RDARS in enhancing the secrecy rate and show its superiority compared to existing reflection surface-based schemes. Copyright © 2025, The Authors. All rights reserved.

关键词： Secure communication

来源：评论

学校读者我要写书评

暂无评论

Innate Cyber-Immunity and Acquired Cyber-Immunity across Multi-Area Power systems

引用

IEEE Transactions on Power systems 2025年

作者： Hou, Jiazuo Song, Yue Hou, Yunhe Peng, Jimmy Chih-Hsien National University of Singapore Department of Electrical and Computer Engineering Singapore Tongji University Department of Control Science and Engineering National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology Shanghai201804 China The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong University of Hong Kong Shenzhen Institute of Research and Innovation Shenzhen518057 China

Organisms have evolved innate and acquired immune systems to defend against pathogens like coronaviruses. Similarly, power networks, threatened by cyber-attacks, desire cyber-immunity. Inspired by the immunology research, this study develops a cyber-immune strategy-characterizing innate cyber-immunity and establishing acquired cyber-immunity-for any selected portion of a power network (termed as power subnetwork) against stealthy false data injection (FDI) cyberattacks. Therein, without extrinsic protection and information asymmetry, this paper for the first time confirms the existence and provides closed-form conditions for power subnetworks that are innately immune to FDI cyber-attacks despite all measurements being compromised. Single-leader-multi-follower bi-level optimization models are then developed to strategically allocate measurement protection, leading to the acquired cyber-immunity, whose conditions for existence and the least cost are explicitly formulated. More importantly, a bi-directional cyber-immunity propagation mechanism is presented to provide the optimal spatial allocation of defense resources across adjacent subnetworks. It also explicitly determines the temporal allocation sequence, revealing its sequential and cumulative impacts on establishing cyber-immunity. This is achieved by designing recursive traversal algorithms, one of which is modelled as a post-order depth-first-search problem of a multi-fork tree. The proposed subnetwork-specific cyber-immune strategy is verified in a modified Australian National Electricity Market. © 1969-2012 IEEE.

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

Hand Gesture Recognition from an Open-Set Perspective

引用

IEEE Transactions on Multimedia 2025年

作者： Zhou, Jun Xu, Chi Cheng, Li China University of Geosciences School of Automation Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China Ministry of Education Engineering Research Center of Intelligent Technology for Geo-Exploration Wuhan430074 China University of Alberta Vision and Learning Laboratory Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada

Existing hand gesture recognition methods predominantly rely on a close-set assumption, which in essence limits the viewpoints, gesture categories, and hand shapes at test time to closely resemble those seen during training. This requirement is however rarely met in practice, as images are often captured from unconstrained viewpoints, with novel gestures and unseen hand shapes that can differ significantly from the training data. This motivates us to investigate an open-set hand gesture recognition problem, where hand gestures are still recognizable from unconstrained viewpoints, and novel gesture classes and hand shapes can be incrementally learned with just a few examples. To address this, we propose a viewpoint influence elimination network that extracts view-independent features, significantly improving performance in scenarios with unconstrained viewpoints. Moreover, a joint-weighted classification scheme is introduced to augment the cosine similarity metric for evaluating few-shot incremental learning of novel gestures and shapes. Finally, as existing hand gesture recognition datasets primarily adhere to the close-set assumption, a new hand gesture recognition dataset, OHG, is introduced in this paper, that includes a wide range of viewpoints, diverse gesture classes, and distinct hand shapes. Experimental hand gesture recognition results demonstrate the superior performance of our approach in both unconstrained viewpoint and few-shot incremental learning scenarios. The source code and the OHG dataset are to be made available at https://***/zhoujun-7/OSHGR. © 1999-2012 IEEE.

关键词： Palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

Discrete control algorithms for systems with big dead time for control101 MATLAB toolbox

Discrete control algorithms for systems with big dead time f...

引用

Cybernetics & Informatics (K&I)

作者： Ruth Bars Gyula Max J. Anthony Rossiter László Keviczky Department of Automation and Applied Informatics Budapest University of Technology and Economics Budapest Hungary School of Electrical and Electronic Engineering University of Sheffield Sheffield UK Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

ISBN: (数字)9798331541811

ISBN: (纸本)9798331541828

The first course of control is under a critical review. Both the teaching material covered and the teaching methods require new considerations. Introducing interactivity in the education process makes the learning more successful and enjoyable. MATLAB provides an effective environment for learning and applying different disciplines. control101 is a new MATLAB toolbox under development which provides tools for interactive learning of control disciplines. This paper presents the framework for teaching discrete control algorithms applied for processes containing large dead times.

关键词： Visualization Systematics PI control Reviews Education Laboratories Process control Prediction algorithms PD control MATLAB

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Vehicular Road Crack Detection with Deep Learning: A New Online Benchmark for Comprehensive Evaluation of Existing Algorithms

arXiv

引用

arXiv 2025年

作者： Ma, Nachuan Song, Zhengfei Hu, Qiang Liu, Chuang-Wei Han, Yu Zhang, Yanting Fan, Rui Xie, Lihua College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems the State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai201804 China School of Computer Science and Technology Donghua University Shanghai201620 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore

In the emerging field of urban digital twins (UDTs), advancing intelligent road inspection (IRI) vehicles with automatic road crack detection systems is essential for maintaining civil infrastructure. Over the past decade, deep learning-based road crack detection methods have been developed to detect cracks more efficiently, accurately, and objectively, with the goal of replacing manual visual inspection. Nonetheless, there is a lack of systematic reviews on state-of-the-art (SoTA) deep learning techniques, especially data-fusion and label-efficient algorithms for this task. This paper thoroughly reviews the SoTA deep learning-based algorithms, including (1) supervised, (2) unsupervised, (3) semi-supervised, and (4) weakly-supervised methods developed for road crack detection. Also, we create a dataset called UDTIRI-Crack, comprising 2, 500 high-quality images from seven public annotated sources, as the first extensive online benchmark in this field. Comprehensive experiments are conducted to compare the detection performance, computational efficiency, and generalizability of public SoTA deep learning-based algorithms for road crack detection. In addition, the feasibility of foundation models and large language models (LLMs) for road crack detection is explored. Afterwards, the existing challenges and future development trends of deep learning-based road crack detection algorithms are discussed. We believe this review can serve as practical guidance for developing intelligent road detection vehicles with the next-generation road condition assessment systems. The released benchmark UDTIRI-Crack is available at https://***/submission/. © 2025, CC BY.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：