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

SSRN 2024年

作者： Yang, Chaojie Chao Liu, Changliang Liu, Weiliang Liu, Shuai School of Control and Computer Engineering North China Electric Power University Beijing100096 China Baoding key Laboratory of State Detection and Optimization Regulation for Integrated Energy System Baoding070013 China

Enhance the flexibility and adaptability of peak shaving and frequency regulation for thermal power units is a necessary prerequisite for the stable operation of new energy generation and power grids. In this paper, a gain-scheduled improved active disturbance rejection control (GS-IADRC) is proposed. Firstly, the thermal process of thermal power units is uniformly equivalent to a multi-order time-delay system to accurately characterize different characteristic thermal processes. Secondly, a feedforward compensator is added based on the first-order active disturbance rejection control (ADRC) to enhance the state estimation accuracy of the extended state observer (ESO). Furthermore, based on two equivalent structures of IADRC, quantitative parameter tuning rules of IADRC are derived, and closed-loop stability is proved. Moreover, the rough relationship between the load and the controlled process is introduced into IADRC, and the parameters to be adjusted are inversely calculated using the maximum sensitivity function as a constraint condition to achieve unified robustness under multi-conditions. Finally, the single-loop and coupled system adaptability of GS-IADRC in multi-condition SST and load coordination systems are verified respectively. Compared with existing methods, GS-IADRC demonstrates superior applicability and robustness under various conditions, and simplifies the engineering applicability of GS-IADRC without decoupling in coupled system applications. © 2024, The Authors. All rights reserved.

关键词： State estimation

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

引用

IEEE Transactions on Mobile Computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Auto-MatRegressor材料性能自动预测器:解放材料机器学习"调参师"

引用

Science Bulletin 2023年第12期68卷 1259-1270,M0004页

作者：刘悦王双燕杨正伟 Maxim Avdeev 施思齐 School of Computer Engineering and Science Shanghai UniversityShanghai 200444China Shanghai Engineering Research Center of Intelligent Computing System Shanghai 200444China State Key Laboratory of Advanced Special Steel School of Materials Science and EngineeringShanghai UniversityShanghai 200444China Materials Genome Institute Shanghai UniversityShanghai 200444China Zhejiang Laboratory Hangzhou 311100China Australian Nuclear Science and Technology Organisation Sydney 2232Australia School of Chemistry The University of SydneySydney 2006Australia

机器学习因其能够快速、精准拟合数据的潜在模式而被广泛应用于材料构效关系研究。然而,材料科学家往往需要进行繁琐的模型选择及参数寻优才能构建出高精度预测模型,为了解放材料机器学习"调参师",本文研发了基于元学习的材... 详细信息

机器学习因其能够快速、精准拟合数据的潜在模式而被广泛应用于材料构效关系研究。然而,材料科学家往往需要进行繁琐的模型选择及参数寻优才能构建出高精度预测模型,为了解放材料机器学习"调参师",本文研发了基于元学习的材料性能自动预测器,采集了60份文献公开数据集与60份标准数据集,基于此训练18种常用回归算法并获得其预测性能,定义与计算了27个刻画数据集特点的元特征,以此构建了一份蕴含建模经验的元数据集;同时,创建了表征数据集所属材料类型的类别树,将其嵌入基于距离的元学习算法,进一步耦合贝叶斯优化算法,实现领域知识和元数据协同驱动下的自动算法推荐和模型参数确定,实验结果表明,材料科学家仅需为新材料性能预测任务提供数据集,便可利用该预测器高效地构建具有与文献报道相当或更高预测精度的机器学习模型.

关键词：机器学习贝叶斯优化算法预测器材料科学家元数据参数寻优预测性能材料性能

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

Congress on Evolutionary Computation

作者： Yongfeng Li Yuze Zhang Lijia Ma Junkai Ji Dugang Liu Victor C. M. Leung Jianqiang Li College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen China Department of Electrical and Computer Engineering The University of British Columbia Vancouver Canada

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms.

关键词： Measurement Correlation Sociology Evolutionary computation Reinforcement learning Germanium Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Towards improving detection performance for malware with a correntropy-based deep learning method

引用

Digital Communications and Networks 2021年第4期7卷 570-579页

作者： Xiong Luo Jianyuan Li Weiping Wang Yang Gao Wenbing Zhao School of Computer and Communication Engineering University of Science and Technology BeijingBeijing100083China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083China Beijing Intelligent Logistics System Collaborative Innovation Center Beijing101149China China Information Technology Security Evaluation Center Beijing100085China Department of Electrical Engineering and Computer Science Cleveland State UniversityClevelandOH44115USA

With the rapid development of Internet of Things(IoT)technologies,the detection and analysis of malware have become a matter of concern in the industrial application of Cyber-Physical system(CPS)that provides various services using the IoT ***,many advanced machine learning methods such as deep learning are popular in the research of malware detection and analysis,and some achievements have been made so ***,there are also some *** example,considering the noise and outliers in the existing datasets of malware,some methods are not robust ***,the accuracy of malware classification still needs to be *** at this issue,we propose a novel method that combines the correntropy and the deep learning *** our proposed method for malware detection and analysis,given the success of the mixture correntropy as an effective similarity measure in addressing complex datasets with noise,it is therefore incorporated into a popular deep learning model,i.e.,Convolutional Neural Network(CNN),to reconstruct its loss function,with the purpose of further detecting the features of *** present the detailed design process of our ***,the proposed method is tested both on a real-world malware dataset and a popular benchmark dataset to verify its learning performance.

关键词： Malware detection Mixture correntropy Deep learning Convolutional neural network(CNN)

来源：评论

学校读者我要写书评

暂无评论

Generative AI-Enhanced Cooperative MEC of UAVs and Ground Stations for Unmanned Surface Vehicles

Generative AI-Enhanced Cooperative MEC of UAVs and Ground St...

引用

Annual Conference on Information Sciences and systems (CISS)

作者： Jiahao You Ziye Jia Chao Dong Qihui Wu Zhu Han The Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space Ministry of Industry and Information Technology Nanjing University of Aeronautics and Astronautics Nanjing China National Mobile Communications Research Laboratory Southeast University Nanjing China Department of Electrical and Computer Engineering University of Houston Houston TX USA Department of Computer Science and Engineering Kyung Hee University Seoul South Korea

ISBN: (数字)9798331513269

ISBN: (纸本)9798331513276

The increasing deployment of unmanned surface vehicles (USVs) require computational support and coverage in applications such as maritime search and rescue. Unmanned aerial vehicles (UAVs) can offer low-cost, flexible aerial services, and ground stations (GSs) can provide powerful supports, which can cooperate to help the USVs in complex scenarios. However, the collaboration between UAVs and GSs for USVs faces challenges of task uncertainties, USVs trajectory uncertainties, heterogeneities, and limited computational resources. To address these issues, we propose a cooperative UAV and GS based robust multi-access edge computing framework to assist USVs in completing computational tasks. Specifically, we formulate the optimization problem of joint task offloading and UAV trajectory to minimize the total execution time, which is in the form of mixed integer nonlinear programming and NP-hard to tackle. Therefore, we propose the algorithm of generative artificial intelligence-enhanced heterogeneous agent proximal policy optimization (GAI-HAPPO). The proposed algorithm integrates GAI models to enhance the actor network ability to model complex environments and extract high-level features, thereby allowing the algorithm to predict uncertainties and adapt to dynamic conditions. Additionally, GAI stabilizes the critic network, addressing the instability of multi-agent reinforcement learning approaches. Finally, extensive simulations demonstrate that the proposed algorithm outperforms the existing benchmark methods, thus highlighting the potentials in tackling intricate, cross-domain issues in the considered scenarios.

关键词： Adaptation models Uncertainty Heuristic algorithms Computational modeling Autonomous aerial vehicles Prediction algorithms Feature extraction Trajectory Vehicle dynamics Optimization

来源：评论

学校读者我要写书评

暂无评论

RKSeg+: make full use of Runge–Kutta methods in medical image segmentation

引用

Multimedia systems 2024年第2期30卷 65-65页

作者： Zhu, Mai Fu, Chong Wang, Xingwei School of Computer Science and Engineering Northeastern University Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang110819 China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110819 China

The dynamical system perspective has been used to build efficient image classification networks and semantic segmentation networks. Furthermore, the Runge–Kutta (RK) methods are powerful tools for building networks from the dynamical systems perspective. Hence, the Runge–Kutta segmentation network (RKSeg) for medical image segmentation was born. Skip connections and multiple scaling are often used in common models but lack mathematical explanations. RKSeg interprets and uses skip connections based on the RK methods. Therefore, RKSeg greatly improves segmentation efficiency. However, it does not explain and use multiple scales from a dynamical system perspective but only inherits the multi-scale scheme of existing models. We compensate for this shortcoming by interpreting and using multiple scales based on the RK methods. In addition, the network structure also limits the excellent image classification networks as the backbones of RKSegs. Therefore, we modify the network structure to support more image classification networks as backbones. As a result, we propose a novel network structure RKSeg+. Our proposed RKSeg+ achieves better segmentation results with fewer parameters than RKSeg. Furthermore, RKSeg+, well configured with few parameters, outperforms state-of-the-art models on six of the ten organ datasets in the Medical Segmentation Decathlon. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Alignment of diffraction features in the Optical Thomson Scattering Laser at the National ignition Facility 6

Alignment of diffraction features in the Optical Thomson Sca...

引用

High Power Lasers for Fusion Research VI 2021

作者： Awwal, Abdul A. S. Integrated Computer Control System National Ignition Facility Computational Engineering Division Lawrence Livermore National Laboratory LivermoreCA94551 United States

ISBN: (数字)9781510641686

ISBN: (纸本)9781510641679

The world's largest and most energetic laser facility, the National Ignition Facility (NIF) is dedicated to understanding inertial confinement fusion by irradiating a mm scale fusion target using 192 precisely aligned laser beams. The optical Thompson scattering (OTS) laser is being commissioned to understand the target implosion physics, especially for under-dense plasma conditions. The OTS will enable the diagnosis of the plasma performance leading to better control of the symmetry and efficiency of target implosion. Both 3w and 5w probe beams can be selectively chosen for diagnosing various plasma densities. Just as the NIF laser, the OTS system is aligned using several closed loop controls. CCD images of the laser beams are analyzed using automatic alignment image processing algorithm to provide beam position and motorized mirrors are mobilized to steer those beams to the desired path and location. One such control loop of the OTS uses a pair of far field diffraction pattern generated by a spherical object connected to a shaft. During the control loop alignment movements, the diffraction rings may be partially missing due to obstruction by the aperture. This paper describes the systematic process of algorithm development for detection of the diffraction rings and the necessary modifications as the requirements change. It describes the template design and algorithm for position detection from such images under challenging illumination and obstructive conditions. Among other novelties of this work is the use of a single computational neuron, inspired by a bipolar binary associative memory, employed to evaluate the quality and uncertainty of the location measurement, and avoid false detection. © 2021 SPIE. All rights reserved.

关键词： Laser beams

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal AU Relational Graph Representation Learning For Facial Action Units Detection

arXiv

引用

arXiv 2023年

作者： Wang, Zihan Song, Siyang Luo, Cheng Zhou, Yuzhi Wu, Shiling Xie, Weicheng Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China School of Computing and Mathematical Sciences University of Leicester United Kingdom

This paper presents our Facial Action Units (AUs) detection submission to the fifth Affective Behavior Analysis in-the-wild Competition (ABAW). Our approach consists of three main modules: (i) a pre-trained facial representation encoder which produce a strong facial representation from each input face image in the input sequence;(ii) an AU-specific feature generator that specifically learns a set of AU features from each facial representation;and (iii) a spatio-temporal graph learning module that constructs a spatio-temporal graph representation. This graph representation describes AUs contained in all frames and predicts the occurrence of each AU based on both the modeled spatial information within the corresponding face and the learned temporal dynamics among frames. The experimental results show that our approach outperformed the baseline and the spatio-temporal graph representation learning allows our model to generate the best results among all ablated systems. Our model ranks at the 4th place in the AU recognition track at the 5th ABAW Competition. Our code is publicly available at https://***/wzh125/ABAW-5 .MSC Codes 68T40 Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Last-X-Generation Archiving Strategy for Multi-Objective Evolutionary Algorithms

Last-X-Generation Archiving Strategy for Multi-Objective Evo...

引用

Congress on Evolutionary Computation

作者： Tianye Shu Yang Nan Ke Shang Hisao Ishibuchi Department of Computer Science and Engineering Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China Southern University of Science and Technology Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

For evolutionary multi-objective optimization algorithms (EMOAs), an external archive can be utilized for saving good solutions found throughout the evolutionary process. Recent studies showed that a solution set selected from an external archive is usually superior to the final population. That is, the incorporation of an external archive improves the performance of EMOAs. However, the computation time for maintaining an external archive is long, especially when the archive size is large. To solve this issue, a simple archiving strategy is to save all solutions generated in the last several generations. In this paper, we examine this archiving strategy for three representative EMOAs on artificial test problems (Minus-DTLZ and WFG) and real-world problems (RE). Our results show that archiving the last several generations clearly improves the performance of EMOAs without severely increasing the computation time.

关键词： Costs Sociology Evolutionary computation Statistics Optimization Standards

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：