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

2022 IEEE International Conference on systems, Man, and Cybernetics, SMC 2022

作者： Jiao, Jiao Li, Jun Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System College of Computer Science and Technology Wuhan China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Since the traditional fireworks algorithm (FWA) is easy to fall into local optimization and has insufficient global optimization capability and low optimization accuracy, this paper proposes the enhanced fireworks algorithm (EFWA-SI) based on particle swarm optimization and small-hole imaging reverse learning. First, a dynamic explosion amplitude mechanism based on the evolution speed of the population is designed. The evolution speed of the population is dynamically adjusted by evaluating the evolution speed of the fitness in each iteration process, and the global and local search information is controlled. Secondly, the small-hole imaging reverse learning strategy combined with the idea of optimal-worst reverse learning is proposed. This strategy increases the diversity of the optimal-seeking positions and improves the ability of the algorithm to jump out of the local optimum;Finally, the current position is updated according to the position and speed of each firework, and the globally optimal fireworks and personally optimal fireworks are updated simultaneously to improve the individual heuristic learning ability. Through the simulation experiments on the CEC2015 test function and comparison with related algorithms, the results show that the algorithm performs better in convergence speed, computational accuracy, and stability. © 2022 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-agent Deep Reinforcement Learning Based Multi-objective Charging Control for Electric Vehicle Charging Station 7th

Multi-agent Deep Reinforcement Learning Based Multi-objectiv...

引用

7th Chinese Conference on Swarm Intelligence and Cooperative Control, CCSICC 2023

作者： Gong, Jiabao Fu, Weiming Kang, Yu Qin, Jiahu Xiao, Feng Department of Automation University of Science and Technology of China Hefei230027 China State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources School of Control and Computer Engineering North China Electric Power University Beijing102206 China

ISBN: (纸本)9789819733279

This paper proposes a multi-agent deep reinforcement learning (MADRL) based algorithm for charging control of multiple electric vehicles (EVs) in an electric vehicle charging station (EVCS) with dynamic operations. By taking the uncertainties of EV users’ behaviors and charging prices into consideration, a Markov game with multiple objectives is first established, where the individual objective of reducing EV charging costs and the collective objective of mitigating charging load fluctuations are both studied. Then, a multi-agent actor-double-critic (MAADC) algorithm with a unified advantage actor-critic framework is proposed, where two advantage functions are designed as the local and global critics, and the integrated actor is employed to balance the learning towards the individual and collective objectives. The simulation results obtained in a delicately built EVCS environment show the effectiveness of MAADC. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Influence Maximization With Graph Neural Network in Multi-Feature Social Network 24

Influence Maximization With Graph Neural Network in Multi-Fe...

引用

24th IEEE International Conference on High Performance Computing and Communications, 8th IEEE International Conference on Data Science and systems, 20th IEEE International Conference on Smart City and 8th IEEE International Conference on Dependability in Sensor, Cloud and Big Data systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Wang, Yuhao Li, Peng Huang, Weiyi School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350319934

The classical influence maximization (IM) prob-lem aims to select a set of nodes as seed nodes for information propagation. Most related studies focus on one-dimensional information dissemination. However, the diffusion of information should be a multi-dimensional (or multi-feature) diffusion process. The user's judgment of information often depends on the combined judgment of multiple-dimensional information. Based on this, we consider a multi-feature diffusion model. In-formation will be decomposed into multi-dimensional features for diffusion. The user will receive these features and integrate them into a complete message. In addition, we consider seed node selection as a network node classification task. Consid-ering that social networks satisfy a graph structure, we use the node classification technique of graph neural networks. This technique classifies the nodes by the network topology to find the set of influential nodes. We propose a multi-feature influence (MFI) algorithm to improve the performance of the prediction. The set of candidate nodes obtained by classification is used as a benchmark to find the set of nodes with maximum influence. Our experiment results on real datasets show that the proposed algorithm has better algorithmic efficiency than the traditional greedy algorithm and better effectiveness than similar heuristic algorithms. © 2022 IEEE.

关键词： Information dissemination

来源：评论

学校读者我要写书评

暂无评论

A virtualized data center energy-saving mechanism based on switching operating mode of physical servers and reserving virtual machines

A virtualized data center energy-saving mechanism based on s...

引用

作者： Yin, Chunxia Liu, Jian Jin, Shunfu College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China Ocean College of Hebei Agricultural University Qinhuangdao China Institute of Computing Technology Chinese Academy of Sciences Beijing China

The energy consumption of virtualized data centers has grown very fast in last several years. Because a large number of hosts are running in an idle state, virtualized data centers waste a large amount of electric energy. To save more energy for virtualized data centers, an energy-saving mechanism is proposed based on switching operating mode of physical servers and reserving virtual machines (VMs). The main idea is that when the amount of idle VMs reaches twice of a specified threshold, half of these idle VMs are reserved to process the new task that is about to arrive, and the physical server which hosts the other half of the idle VMs is switched to the sleep mode. From the perspective of task arrival rate and sleep parameters, we use two-dimensional Markov processes to analyze the proposed energy-saving mechanisms. By using matrix geometry solutions, we theoretically estimate energy consumption and response performance. According to the numerical experiments, the proposed energy-saving mechanism obviously cut down electric energy consumption and ensures response performance. Finally, the specified threshold for the amount of VMs is optimized by building a cost function. © 2020 John Wiley & Sons, Ltd.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Effective and Imperceptible Adversarial Textual Attack Via Multi-objectivization

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第3期4卷 1-23页

作者： Liu, Shengcai Lu, Ning Hong, Wenjing Qian, Chao Tang, Ke Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen College of Engineering South Tower 1088 Xueyuan Avenue Guangdong Shenzhen518055 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong999077 Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen 10F Zhizhen Building Canghai Campus 3688 Nanhai Avenue Guangdong Shenzhen China National Key Laboratory for Novel Software Technology School of Artificial Intelligence Nanjing University Nanjing International College Area Xianlin Campus 163 Xianlin Avenue Jiangsu Nanjing China

The field of adversarial textual attack has significantly grown over the past few years, where the commonly considered objective is to craft adversarial examples (AEs) that can successfully fool the target model. However, the imperceptibility of attacks, which is also essential for practical attackers, is often left out by previous studies. In consequence, the crafted AEs tend to have obvious structural and semantic differences from the original human-written text, making them easily perceptible. In this work, we advocate leveraging multi-objectivization to address such an issue. Specifically, we reformulate the problem of crafting AEs as a multi-objective optimization problem, where the attack imperceptibility is considered as an auxiliary objective. Then, we propose a simple yet effective evolutionary algorithm, dubbed HydraText, to solve this problem. HydraText can be effectively applied to both score-based and decision-based attack settings. Exhaustive experiments involving 44,237 instances demonstrate that HydraText consistently achieves competitive attack success rates and better attack imperceptibility than the recently proposed attack approaches. A human evaluation study also shows that the AEs crafted by HydraText are more indistinguishable from human-written text. Finally, these AEs exhibit good transferability and can bring notable robustness improvement to the target model by adversarial training. © 2024 Copyright held by the owner/author(s).

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive Federated Learning for EEG Emotion Recognition

Adaptive Federated Learning for EEG Emotion Recognition

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Calvin Chan Qingqing Zheng Chengjian Xu Qiong Wang Pheng Ann Heng Guangdong Provincial Key Laboratory of Computer Vision and Virtual Reality Technology Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Department of Computer Science and Engineering The Chinese University of Hong Kong

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Emotion classification based on electroencephalogram (EEG) signals has drawn huge attention in affective brain computer interface (BCI). Recently, plenty of deep learning approaches have been proposed to improve the performance of EEG emotion recognition, especially the application of domain adaptation methods to tackle the challenge of large individual differences of EEG signals from subject to subject. However, these conventional transfer learning methods would result in information leakage during the sharing of domain data to enhance the accuracy of the target tasks. Therefore, in this paper, we proposed a distributed deep learning method, named adaptive federated learning (AdaFL) for EEG emotion recognition. In AdaFL, a server collaboratively learns a global model by adaptively aggregating the local models according to their importance in several communication rounds. In particular, an importance function is developed to evaluate each client, which would determine to select a subset of optimal clients for subsequent global model aggregation. The function is a simple transformation of the training loss and the sample size of the local models. Then, the resulting importance scores of selected clients are further converted into aggregation coefficients to measure the weights of the local models for global model aggregation. The distinct advantage of AdaFL is that the cross-subject information could be well utilized and the information leakage risk could be significantly reduced. To validate the efficacy of the proposed AdaFL, we conduct extensive experiments on two real EEG emotion datasets, i.e., SEED and DEAP. The experimental results show that the proposed AdaFL has achieved 94.95 ± 0.40% and 91.06 ± 0.29% average classification accuracy on the SEED and DEAP datasets, respectively, which reflects the superiority of our method over the state-of-the-art approaches.

关键词： Training Deep learning Adaptation models Emotion recognition Accuracy Federated learning Brain modeling

来源：评论

学校读者我要写书评

暂无评论

CMD: A Cache-Assisted GPU Memory Deduplication Architecture

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and systems 2025年

作者： Zhao, Wei Feng, Dan Tong, Wei Wei, Xueliang Wu, Bing Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of data storage systems and Technology China

Massive off-chip accesses in GPUs are the main performance bottleneck. We find that many writes are duplicate, and the duplication can be inter-dup and intra-dup. While inter-dup means different memory blocks are identical, and intra-dup means all the 4B elements in a line are the same. In this work, we propose a cache-assisted GPU memory deduplication architecture named CMD to reduce the off-chip accesses via utilizing the data duplication in GPU applications. CMD includes three key design contributions which aim to reduce the three kinds of accesses: (1) A novel GPU memory deduplication architecture that removes the intra-dup and inter-dup lines. We design several techniques to manage duplicate blocks, reducing massive off-chip writes. (2) We propose a cache-assisted read scheme to reduce the reads to duplicate data. When an L2 cache miss wants to read the duplicate block, if the reference block has been fetched to L2 and it is clean, we can copy it to the L2 missed block without accessing off-chip DRAM. As for the reads to intra-dup data, CMD uses the on-chip metadata cache to get the data. (3) When a cache line is evicted, the clean sectors in the line are invalidated while the dirty sectors are written back. However, most read-only victims are re-referenced from DRAM more than twice. Therefore, we add a full-associate FIFO to accommodate the read-only (it is also clean) victims to reduce the re-reference counts. Experiments show that CMD can decrease the off-chip accesses by 31.01%, reduce the energy by 32.78% and improve performance by 42.53%. Besides, CMD can improve the performance of memory-intensive workloads by 57.56%. © 2025 IEEE.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Low Energy Consumption and Time Deterministic Energy-saving Workflow Task Scheduling Algorithm based on DVFS 9

Low Energy Consumption and Time Deterministic Energy-saving ...

引用

9th IEEE International Conference on Cyber Security and Cloud Computing and 8th IEEE International Conference on Edge Computing and Scalable Cloud, CSCloud-EdgeCom 2022

作者： Liu, Xun Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System College of Computer Science and Technology Wuhan China

ISBN: (数字)9781665480666

ISBN: (纸本)9781665480666

With the development of streaming media, soft real-time system in today's life could participate in the use of more extensive areas. The use frequency was also increasing. Consequently, modern processors were equipped with software control mechanisms such as DVFS (Dynamic Voltage Frequency Scaling) to allow operating systems to meet required performance while reducing power consumption. Therefore, we propose a task scheduling algorithm combined DVFS technology and time deterministic cyclic scheduling to achieve energy saving effect. First, the algorithm needed to minimize the preemption between tasks to reduce latency, so we created a buffer to save periodic tasks to avoid preemption. Second, to reduce the computational cost of the scheduling scheme, a scheduling template were designed to perform tasks. In this paper, the scheduling of periodic tasks, task scheduling would be designed when the task scheduling template would be fixed length. Besides, this algorithm supported that task could adopt appropriate voltage and frequency through DVFS technology in idle time under the condition of satisfying task dependence. Experimental analysis showed that the proposed algorithm could effectively reduce the system energy consumption while ensuring the completion of the task. © 2022 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Two-sided Online Stable Task Assignment with Incomplete Lists and Ties in Spatial Crowdsourcing 19

Two-sided Online Stable Task Assignment with Incomplete List...

引用

2022 IEEE SmartWorld, 19th IEEE International Conference on Ubiquitous Intelligence and Computing, 2022 IEEE International Conference on Autonomous and Trusted Vehicles Conference, 22nd IEEE International Conference on Scalable Computing and Communications, 2022 IEEE International Conference on Digital Twin, 8th IEEE International Conference on Privacy Computing and 2022 IEEE International Conference on Metaverse, SmartWorld/UIC/ATC/ScalCom/DigitalTwin/PriComp/Metaverse 2022

作者： Huang, Weiyi Li, Peng Li, Bo Liu, Jing Nie, Lei Bao, Haizhou Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350346558

For the application of task assignment in crowdsourcing, previous research has focused on offline version or one-sided online version. Some of them draw extra attention to stability in task assignment. Our work extends a one-sided task assignment and its stable generalization. In particular, we present a two-sided online stable task assignment (TS-OSTA) problem in which any vertex from two sides can maintain an incomplete neighbor list and ties. We first give the fundamental definitions of task assignment in spatial crowdsourcing and stable matching. Then, we analyze and present the matching condition and formulate the TS-OSTA problem. As a warm-up, we investigate and analyze two classical baseline algorithms Greedy and Random Threshold. Then we present a bipartite ranking algorithm that maintains the efficiency of Greedy and effectiveness of Random Threshold. Through extensive experiments, we examine the performance of our algorithm in size, memory, and time. The results show that our algorithm performs better than the baselines. © 2022 IEEE.

关键词： Crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Mining Alarm Association Rules in Optical Transmission Networks Using a Statistical Approach 24

Mining Alarm Association Rules in Optical Transmission Netwo...

引用

作者： Deng, Miao Li, Peng Liu, Yu Zhu, Rongjing Zhang, Yujie School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China

ISBN: (纸本)9798350319934

Due to the interconnection between devices in the optical transmission network (OTN), when one device fails and generates alarm information, a large number of other invalid alarms are generated in OTN. How to mining association rules in alarm data is an important problem. In this paper, we investigate the association rules mining problem based on a statistical method. First, we remove the chattering alarm in preprocess to reduce data redundancy. Second, we propose a statistics-based association rule mining algorithm. We use a sliding time window to scan the alarm data, and we exploit the matrix to record the corresponding results. According to the matrix, we calculate the support and confidence of association rules. Compared with other traditional association rule mining algorithms, the proposed algorithm does not need to set the minimum support artificially, and the obtained association rules have strong causality. Through extensive experiments on syn-thetic and real OTN alarm datasets, we verify the effectiveness of our proposed algorithm and the correctness of the obtained association rules. © 2022 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：