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

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

来源：评论

学校读者我要写书评

暂无评论

Achieving the Social Optimum in a Nonconvex Cooperative Aggregative Game: A Distributed Stochastic Annealing Approach

引用

IEEE Transactions on Neural Networks and Learning Systems 2025年第5期36卷 9709-9716页

作者： Wang, Yinghui Geng, Xiaoxue Chen, Guanpu Zhao, Wenxiao University of Science and Technology Beijing Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering Beijing100083 China Yunnan Normal University School of Mathematics Yunnan Key Laboratory of Modern Analytical Mathematics and Applications Kunming650500 China KTH Royal Institute of Technology School of Electrical Engineering and Computer Science Stockholm100 44 Sweden Chinese Academy of Sciences Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China University of Chinese Academy of Sciences School of Mathematical Sciences Beijing100049 China

This brief designs a distributed stochastic annealing algorithm for nonconvex cooperative aggregative games, whose players’ cost functions not only depend on players’ own decision variables but also rely on the sum of players’ decision variables. To seek the social optimum of cooperative aggregative games, a distributed stochastic annealing algorithm is proposed, where the local cost functions are nonconvex and the communication topology between players is time-varying. The weak convergence to the social optimum of the algorithm is further analyzed. A numerical example is finally given to illustrate the effectiveness of the proposed algorithm. © 2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Visualizing the Local Atomic Environment Features of Machine Learning Interatomic Potential

arXiv

引用

arXiv 2025年

作者： Shao, Xuqiang Zhang, Yuqi Zhang, Di Gao, Tianxiang Liu, Xinyuan Gan, Zhiran Meng, Fanshun Li, Hao Yang, Weijie School of Control and Computer Engineering North China Electric Power University Baoding071003 China Tohoku University Sendai980-8577 Japan Department of Power Engineering School of Energy and Power Engineering North China Electric Power University Hebei Baoding071003 China School of Science Liaoning University of Technology Jinzhou12100l China

This paper addresses the challenges of creating efficient and high-quality datasets for machine learning potential functions. We present a novel approach, termed DV-LAE (Difference Vectors based on Local Atomic Environments), which utilizes the properties of atomic local environments and employs histogram statistics to generate difference vectors. This technique facilitates dataset screening and optimization, effectively minimizing redundancy while maintaining data diversity. We have validated the optimized datasets in high-temperature and high-pressure hydrogen systems as well as the α-Fe/H binary system, demonstrating a significant reduction in computational resource usage without compromising prediction accuracy. Additionally, our method has revealed new structures that emerge during simulations but were underrepresented in the initial training datasets. The redundancy in the datasets and the distribution of these new structures can be visually analyzed through the visualization of difference vectors. This approach enhances our understanding of the characteristics of these newly formed structures and their impact on physical processes. © 2025, CC BY.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Blockage-Resilient Integrated Sensing and Communication in mmWave Networks: Multi-View Collaboration and Efficient Task Allocation

引用

IEEE Transactions on Mobile Computing 2025年

作者： Cui, Yue Ding, Haichuan Ma, Ying Li, Xuanheng Zhang, Haixia Fang, Yuguang Beijing Institute of Technology School of Cyberspace Science and Technology Beijing100081 China Beijing Institute of Technology School of Information and Electronics Beijing100081 China Dalian University of Technology School of Information and Communication Engineering Dalian116023 China Southeast University National Mobile Communications Research Laboratory Nanjing210096 China Shandong University Shandong Provincial Key Laboratory of Wireless Communication Technologies School of Control Science and Engineering Jinan250061 China City University of Hong Kong Department of Computer Science Hong Kong Hong Kong

Integrated sensing and communication (ISAC) has emerged as a promising technology for future millimeter wave (mmWave) networks. However, the susceptibility of mmWave signals to blockages poses considerable challenges for ISAC as it can result in unreliable links and disrupted sensing. As a result, this paper investigates the blockage-resilient ISAC design that leverages the robustness offered by multi-base station (BS) collaboration. Given the dynamic blockages and the fluctuation in the targets' radar cross section (RCS), the blockage-resilient multiBS collaborative ISAC design is cast as a chance constrained integer programming (CCIP) by jointly considering the diverse deadlines of different sensing tasks and the spatial/temporal user-target pairing for dual-functional radar and communication (DFRC) waveform scheduling. To facilitate efficient solution finding, we develop a group concatenating assisted reinforcement learning (GCRL) algorithm, where we linearize the chance constraints via variable grouping and concatenation, enabling the RL agent to understand the problem structure with bipartite graphs so as to develop an efficient branching policy. Extensive experiments demonstrate the resilience of the obtained ISAC scheme to dynamic blockages. © 2025 IEEE. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

LSU-NET: LIGHTWEIGHT AUTOMATIC ORGANS SEGMENTATION NETWORK FOR MEDICAL IMAGES

arXiv

引用

arXiv 2025年

作者： Ding, Yujie Teng, Shenghua Li, Zuoyong Chen, Xiao College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao266590 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control School of Computer and Big Data Minjiang University Fuzhou350121 China

UNet and its variants have widespread applications in medical image segmentation. However, the substantial number of parameters and computational complexity of these models make them less suitable for use in clinical settings with limited computational resources. To address this limitation, we propose a novel Lightweight Shift U-Net (LSU-Net). We integrate the Light Conv Block and the Tokenized Shift Block in a lightweight manner, combining them with a dynamic weight multi-loss design for efficient dynamic weight allocation. The Light Conv Block effectively captures features with a low parameter count by combining standard convolutions with depthwise separable convolutions. The Tokenized Shift Block optimizes feature representation by shifting and capturing deep features through a combination of the Spatial Shift Block and depthwise separable convolutions. Dynamic adjustment of the loss weights at each layer approaches the optimal solution and enhances training stability. We validated LSU-Net on the UWMGI and MSD Colon datasets, and experimental results demonstrate that LSU-Net outperforms most state-of-the-art segmentation architectures. Copyright © 2025, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Seamless Graph Task Scheduling over Dynamic Vehicular Clouds: A Hybrid Methodology for Integrating Pilot and Instantaneous Decisions

引用

IEEE Transactions on Services Computing 2025年

作者： Guo, Bingshuo Liwang, Minghui Xia, Xiaoyu Li, Li Jiao, Zhenzhen Hosseinalipour, Seyyedali Wang, Xianbin Xiamen University School of Informatics Fujian China Rmit University School of Computing Technologies MelbourneVIC Australia Tongji University Department of Control Science and Engineering Shanghai China Beijing Teleinfo Technology Co. Ltd. Caict IF-Labs China University at Buffalo-SUNY Department of Electrical Engineering NY United States Western University Department of Electrical and Computer Engineering ON Canada

Vehicular clouds (VCs) play a crucial role in the Internet-of-Vehicles (IoV) ecosystem by securing essential computing resources for a wide range of tasks. This paPertackles the intricacies of resource provisioning in dynamic VCs for computation-intensive tasks, represented by undirected graphs for parallel processing over multiple vehicles. We model the dynamics of VCs by considering multiple factors, including varying communication quality among vehicles, fluctuating computing capabilities of vehicles, uncertain contact duration among vehicles, and dynamic data exchange costs between vehicles. Our primary goal is to obtain feasible assignments between task components and nearby vehicles, called templates, in a timely manner with minimized task completion time and data exchange overhead. To achieve this, we propose a hybrid graph task scheduling (P-HTS) methodology that combines offline and online decision-making modes. For the offline mode, we introduce an approach called risk-aware pilot isomorphic subgraph searching (RA-PilotISS), which predicts feasible solutions for task scheduling in advance based on historical information. Then, for the online mode, we propose time-efficient instantaneous isomorphic subgraph searching (TE-InstaISS), serving as a backup approach for quickly identifying new optimal scheduling template when the one identified by RA-PilotISS becomes invalid due to changing conditions. Through comprehensive experiments, we demonstrate the superiority of our proposed hybrid mechanism compared to state-of-the-art methods in terms of various evaluative metrics, e.g., time efficiency such as the delay caused by seeking for possible templates and task completion time, as well as cost function, upon considering different VC scales and graph task topologies. © 2025 IEEE.

关键词： Undirected graphs

来源：评论

学校读者我要写书评

暂无评论

Unleashing Correlation and Continuity for Hyperspectral Reconstruction from RGB Images

arXiv

引用

arXiv 2025年

作者： Feng, Fuxiang Cong, Runmin Wei, Shoushui Zhang, Yipeng Li, Jun Kwong, Sam Zhang, Wei The School of Control Science and Engineering Shandong University Jinan250061 China The Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan250061 China The University of California Los Angeles United States The Hubei Key Laboratory of Intelligent Geo-Information Processing The School of Computer Science China University of Geo-sciences Wuhan430078 China The Lingnan University Hong Kong

Reconstructing Hyperspectral Images (HSI) from RGB images can yield high spatial resolution HSI at a lower cost, demonstrating significant application potential. This paper reveals that local correlation and global continuity of the spectral characteristics are crucial for HSI reconstruction tasks. Therefore, we fully explore these inter-spectral relationships and propose a Correlation and Continuity Network (CCNet) for HSI reconstruction from RGB images. For the correlation of local spectrum, we introduce the Group-wise Spectral Correlation Modeling (GrSCM) module, which efficiently establishes spectral band similarity within a localized range. For the continuity of global spectrum, we design the Neighborhood-wise Spectral Continuity Modeling (NeSCM) module, which employs memory units to recursively model the progressive variation characteristics at the global level. In order to explore the inherent complementarity of these two modules, we design the Patch-wise Adaptive Fusion (PAF) module to efficiently integrate global continuity features into the spectral features in a patch-wise adaptive manner. These innovations enhance the quality of reconstructed HSI. We perform comprehensive comparison and ablation experiments on the mainstream datasets NTIRE2022 and NTIRE2020 for the spectral reconstruction task. Compared to the current advanced spectral reconstruction algorithms, our designed algorithm achieves State-Of-The-Art (SOTA) performance. Copyright © 2025, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

DEEPCON: Improving Distributed Deep Learning Model Consistency in Edge-Cloud Environments via Distillation

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Qian, Bin Qian, Jiaxu Wen, Zhenyu Wu, Di He, Shibo Chen, Jiming Ranjan, Rajiv Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou China Zhejiang University of Technology Institute of Cyberspace Security College of Information Engineering Hangzhou China University of St Andrews School of Computer Science United Kingdom Newcastle University United Kingdom

In a typical distributed Deep Learning (DL) based application, models are configured differently to meet the requirements of resource constraints. For instance, a large ResNet56 model is deployed on the cloud server while a small lightweight MobileNet model is more suitable for the end-user device with fewer computation resources. However, the heterogeneity of the model architectures and configurations may bring a systemic problem -models may produce different outputs when given the same input. This inconsistency problem may cause severe system failure of prediction agreement inside the application. Current research has not studied the systemic design for efficiently detecting and reducing the inconsistency among models in distributed DL applications. With the increasing scale of distributed DL applications, the challenges of inconsistency mitigation should consider both algorithm and system design. To this end, we design and implement DEEPCON, an adaptive deployment system across the edge-cloud layer with over-the-air model updates. We implement ASRS sampling for efficiently sampling data to reveal the real data distribution as well as model prediction inconsistency. Then, we implement DMML-Par, an asynchronous parallel training algorithm for quickly updating the models and reducing inconsistency. implements over-the-air updates with a set of APIS to enable seamless inconsistency detection and reduction in such deep learning applications. Our experiment results on both vision and language tasks demonstrate that DMML could improve the model consistency up to 4%, 7%, and 13% at CIFAR10/100 and IMDB datasets without sacrificing the accuracy of individual models. We also show that the ASRS sampling can save 90% network bandwidth of data transmission and that DMML-Par is up to 60% faster compared to simple synchronous parallel training. 2015 IEEE.

关键词： Distributed cloud

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Learning and control with Event-Triggered Measurements

引用

IEEE Transactions on Automatic control 2025年

作者： Feng, Shilun Shi, Dawei Chen, Tongwen Shi, Ling Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems MIIT Key Laboratory of Servo Motion System Drive and Control School of Automation Beijing100081 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 1H9 Canada Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Clear Water Bay Kowloon Hong Kong

Event-triggered control has attracted considerable attention for its effectiveness in resource-restricted applications. To make event-triggered control as an end-to-end solution, a key issue is how to effectively learn unknown system dynamics from event-triggered measurements and consequently, develop a learning-based event-triggered controller. Existing works learn system dynamics based on periodic time-triggered measurements, and it is yet to know how to learn a controller with performance guarantee based on event-triggered measurements. To address this issue, we consider the problem of learning an event-triggered state feedback controller for an unknown linear system based on event-triggered state measurements in this work. In particular, we first analyze the event-triggered measurements within a set-membership framework. We prove that the estimation error belongs to a bounded ellipsoid determined by the historical measurements and the event-triggering condition. Subsequently, we demonstrate that all admissible systems compatible with the collected data samples can be explicitly represented in the form of quadratic matrix inequalities using the state estimates. With the acquired set of admissible systems, a co-design problem for the data-driven controller and event-triggering condition is solved using the linear matrix inequality technique, with guaranteed closed-loop stability and L2-gain performance. Finally, numerical examples and comparisons are provided to illustrate the effectiveness of the proposed event-triggered learning and control approach. © 1963-2012 IEEE.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

Content-decoupled Contrastive Learning-based Implicit Degradation Modeling for Blind Image Super-Resolution Supplementary Material

引用

IEEE Transactions on Image Processing 2025年 PP卷 PP页

作者： Yuan, Jiang Ma, Ji Wang, Bo Hu, Weiming North China Electric Power University School of Control and Computer Engineering Beijing102206 China CASIA State Key Laboratory of Multimodal Artificial Intelligence Systems Beijing100190 China University of Chinese Academy of Sciences School of Artificial Intelligence Beijing100049 China ShanghaiTech University School of Information Science and Technology Shanghai201210 China

Implicit degradation modeling-based blind super-resolution (SR) has attracted more increasing attention in the community due to its excellent generalization to complex degradation scenarios and wide application range. How to extract more discriminative degradation representations and fully adapt them to specific image features is the key to this task. In this paper, we propose a new Content-decoupled Contrastive Learning-based blind image super-resolution (CdCL) framework following the typical blind SR pipeline. This framework introduces negative-free contrastive learning technique for the first time to model the implicit degradation representation, in which a new cyclic shift sampling strategy is designed to ensure decoupling between content features and degradation features from the data perspective, thereby improving the purity and discriminability of the learned implicit degradation space. In addition, we propose a detail-aware implicit degradation adapting module that can better adapt degradation representations to specific LR features by enhancing the basic adaptation unit's perception of image details, significantly reducing the overall SR model complexity. Extensive experiments on synthetic and real data show that our method achieves highly competitive quantitative and qualitative results in various degradation settings while obviously reducing parameters and computational costs, validating the feasibility of designing practical and lightweight blind SR tools. Codes and models will be available at https://***/Fieldhunter/CdCL. © 1992-2012 IEEE.

关键词： Blind SR Degradation adaptation Implicit degradation learning Negative-free contrastive learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：