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

Evolutionary Trainer-Based Deep Q-Network for Dynamic Flexible Job Shop Scheduling

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Liu, Yun Zhang, Fangfang Sun, Yanan Zhang, Mengjie College of Computer Science Sichuan University Chengdu PR China Center for Data Science and Artificial Intelligence and School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

Dynamic flexible job shop scheduling (DFJSS) aims to achieve the optimal efficiency for production planning in the face of dynamic events. In practice, deep Q-network (DQN) algorithms have been intensively studied for solving various DFJSS problems. However, these algorithms often cause moving targets for the given job-shop state. This will inevitably lead to unstable training and severe deterioration of the performance. In this paper, we propose a training algorithm based on genetic algorithm to efficiently and effectively address this critical issue. Specifically, a state feature extraction method is first developed, which can effectively represent different job shop scenarios. Furthermore, a genetic encoding strategy is designed, which can reduce the encoding length to enhance search ability. In addition, an evaluation strategy is proposed to calculate a fixed target for each job-shop state, which can avoid the parameter update of target networks. With the designs, the DQNs could be stably trained, thus their performance is greatly improved. Extensive experiments demonstrate that the proposed algorithm outperforms the state-of-the-art peer competitors in terms of both effectiveness and generalizability to multiple scheduling scenarios with different scales. In addition, the ablation study also reveals that the proposed algorithm can outperform the DQN algorithms with different updating frequencies of target networks. IEEE

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Deep Reinforcement Learning With Trajectory Prediction for Task Migration-Assisted Computation Offloading

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 5839-5856页

作者： Zhang, Xinyi Wang, Chunyang Zhu, Yanmin Cao, Jian Liu, Tong Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China East China Normal University School of Data Science and Engineering Shanghai200050 China Shanghai University School of Computer Engineering and Science Shanghai200444 China

Multi-access edge computing has become an effective paradigm to provide offloading services for computation-intensive and delay-sensitive tasks on vehicles. However, high mobility of vehicles usually incurs spatio-temporal load-imbalances among edge servers. Therefore, task migration is employed to maintain dynamic workload balancing by transmitting excessive tasks from overloaded to underloaded servers. Recent studies adopt deep reinforcement learning approaches to generate offloading and migration decisions based on current observations of systems. However, we argue that the migration direction is highly dependent on vehicular movements, and task migration towards the wrong direction could lead to additional delays. Therefore, we emphasize the importance of guiding task migration via exploring prospective trajectories of vehicles. We propose a Mobility-Aware Cooperative Multi-Agent (MCMA) deep reinforcement learning approach to make vehicle-by-vehicle decisions in multi-edge computation offloading scenarios. A two-stage decision framework is designed to solve the joint optimization problem of computation offloading and resource allocation. Additionally, an Informer-based multi-step vehicular trajectory prediction module is incorporated to enhance the capability of forecasting vehicular movements. Extensive experiments and analysis are conducted on synthetic and realistic scenarios, showing that our approach consistently outperforms both heuristic and DRL-based methods. The simulation scenarios and source codes are publicly available here. © 2002-2012 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Hetu: a highly efficient automatic parallel distributed deep learning system

引用

science China(Information sciences) 2023年第1期66卷 314-315页

作者： Xupeng MIAO Xiaonan NIE Hailin ZHANG Tong ZHAO Bin CUI School of Computer Science Peking University Center for Data Science Peking University National Engineering Laboratory for Big Data Analysis and Applications

On July 18, 2021, the PKU-DAIR Lab1)(data and Intelligence Research Lab at Peking University) openly released the source code of Hetu, a highly efficient and easy-to-use distributed deep learning(DL) framework. Hetu is the first distributed DL system developed by academic groups in Chinese universities, and takes into account both high availability in industry and innovation in academia. Through independent research and development, Hetu is completely decoupled from the existing DL systems and has unique characteristics. The public release of the Hetu system will help researchers and practitioners to carry out frontier MLSys(machine learning system) research and promote innovation and industrial upgrading.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DeepSwarm:towards swarm deep learning with bi-directional optimization of data acquisition and processing

引用

Frontiers of computer science 2025年第3期19卷 125-127页

作者： Sicong LIU Bin GUO Ziqi WANG Lehao WANG Zimu ZHOU Xiaochen LI Zhiwen YU School of Computer Science and Engineering Northwestern Polytechnical UniversityXi’an 710072China School of Data Science City University of Hong KongHong Kong 999077China College Of Computer Science And Technology Harbin Engineering UniversityHarbin 150001China

1 Introduction On-device deep learning(DL)on mobile and embedded IoT devices drives various applications[1]like robotics image recognition[2]and drone swarm classification[3].Efficient local data processing preserves privacy,enhances responsiveness,and saves ***,current ondevice DL relies on predefined patterns,leading to accuracy and efficiency *** is difficult to provide feedback on data processing performance during the data acquisition stage,as processing typically occurs after data acquisition.

关键词： drone swarm classification efficient local data processing data processing deep learning dl device deep learning bi-directional optimization iot devices swarm deep learning

来源：评论

学校读者我要写书评

暂无评论

Deep learning framework for automatic detection and classification of sleep apnea severity from polysomnography signals

引用

Neural Computing and Applications 2024年第28期36卷 17483-17493页

作者： Raja Brundha, A. Lakshmi Sangeetha, A. Balajiganesh, A. Department of Artificial Intelligence and Data Science Sri Sai Ram Engineering College Chennai India Department of Computer Science Engineering Velammal Engineering College Chennai India

Sleep apnea (SA) is a sleep-related breathing disorder characterized by breathing pauses during sleep. A person’s sleep schedule is significantly influenced by that person’s hectic lifestyle, which may include unhealthy eating habits and their line of work. Polysomnographic (PSG) sleep studies examine sleep-related disorders by recording various biosignals from the human body. However, SA classification methods could be more robust in terms of performance because they rely on feature-engineering strategies or employ a particular signal from PSG recording for diagnosis. This study aims to classify the severity of SA according to the apnea–hypopnea index (AHI) into normal, mild, and moderate-to-severe groups using oxygen saturation (SpO2), electroencephalogram (EEG), and electrocardiogram (ECG) signals. The proposed deep neural network (DNN)-bidirectional long short-term memory (DNN-BiLSTM) framework addresses the issue of low detection accuracy in analysis. The DNN-BiLSTM approach employs features extracted from a multiscale dilation attention 1D convolutional neural network (MSDA-1DCNN) as input for detection and classification purposes. The MSDA-1DCNN network extracts deep features from processed SpO2, EEG, and ECG signals. The developed firefly combined electric fish optimization (FCEFO) algorithm improves performance by optimizing the hidden neuron count of the DNN and the learning rate of the BiLSTM framework. The performance measures proved the effectiveness of the model over conventional machine and deep learning approaches. With the integration of deep features, the proposed DNN-BiLSTM model provides enhanced performance in terms of accuracy and precision. Thus, the proposed approach is progressive and can be used for medical diagnosis. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

OptiFog: A Framework for Acquiring State Information and Predicting Resource Availability for Task Offloading in Cooperative Fog-Networks

引用

IEEE Transactions on Services Computing 2024年 1-13页

作者： Alam, Mehbub Ahmed, Nurzaman Ghosh, Shyamal Matam, Rakesh Barbhuiya, Ferdous Ahmed Department of Computer Science and Engineering Indian Institute of Information Technology Guwahati India Department of Computer Science Dartmouth College Hanover USA School of Data Science Indian Institute of Science Education and Research Thiruvananthapuram India

The primary objective of fog computing is to minimize the reliance of IoT devices on the cloud by leveraging the resources of fog network. Typically, IoT devices offload computation tasks to fog to meet different task requirements such as latency in task execution, computation costs, etc. So, selecting such a fog node that meets task requirements is a crucial challenge. To choose an optimal fog node, access to each node's resource availability information is essential. Existing approaches often assume state availability or depend on a subset of state information to design mechanisms tailored to different task requirements. In this paper, OptiFog: a cluster-based fog computing architecture for acquiring the state information followed by optimal fog node selection and task offloading mechanism is proposed. Additionally, a continuous time Markov chain based stochastic model for predicting the resource availability on fog nodes is proposed. This model prevents the need to frequently synchronize the resource availability status of fog nodes, and allows to maintain an updated state information. Extensive simulation results show that OptiFog lowers task execution latency considerably, and schedules almost all the tasks at the fog layer compared to the existing state-of-the-art. IEEE

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

引用

science China(Information sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

Blockchain with drug traceability in medical supply chain with Henry gas solubility optimisation algorithm

引用

International Journal of Wireless and Mobile Computing 2025年第2期28卷 135-148页

作者： Devi, P. Yamini Sriramya, P. Department of Computer Science and Engineering Saveetha School of Engineering Thandalam Tamil Nadu Chennai India Department of Data Science Saveetha School of Engineering SIMATS Tamil Nadu Chennai India

The drug traceability model is used for ensuring drug quality and its safety for customers in the medical supply chain. The healthcare supply chain is a complex network, which is susceptible to failures and leakage of information because of cyber security attacks. Hence, this research aims to design a blockchain to perform traceability of drugs using Henry Gas Solubility Optimisation (HGSO). The entities include distributors, wholesalers, retailers, blockchain and patients. This model comprises initialisation, registration, key generation, authentication, drug distribution with traceability and key generation phases. Any exchange of medicines needs the approval of both sender and receiver. The drugs are registered in the blockchain, which then generates a secret key that is obtained using HGSO. The verification and authentication of drugs are performed after the authentication process. The implemented model outperformed with the response time, memory, normalised variance, and privacy of 32.678 sec, 84 MB, 0.958 and 0.958. Copyright © 2025 Inderscience Enterprises Ltd.

关键词： authentication blockchain drug traceability key generation medical supply chain

来源：评论

学校读者我要写书评

暂无评论

Resource investment for DDoS attack resistant SDN: a practical assessment

引用

science China(Information sciences) 2023年第7期66卷 112-129页

作者： Bin YUAN Fan ZHANG Jun WAN Huan ZHAO Shui YU Deqing ZOU Qiangsheng HUA Hai JIN School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Shenzhen Huazhong University of Science and Technology Research Institute School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab School of Computer Science University of Technology Sydney

Software-defined networks(SDNs) present a novel network architecture that is widely used in various datacenters. However, SDNs also suffer from many types of security threats, among which a distributed denial of service(DDoS) attack, which aims to drain the resources of SDN switches and controllers,is one of the most common. Once the switch or controller is damaged, the network services can be *** defense schemes against DDoS attacks have been proposed from the perspective of attack detection;however, such defense schemes are known to suffer from a time consuming and unpromising accuracy, which could result in an unavailable network service before specific countermeasures are taken. To address this issue through a systematic investigation, we propose an elaborate resource-management mechanism against DDoS attacks in an SDN. Specifically, by considering the SDN topology, we leverage the M/M/c queuing model to measure the resistance of an SDN to DDoS attacks. Network administrators can therefore invest a reasonable number of resources into SDN switches and SDN controllers to defend against DDoS attacks while guaranteeing the quality of service(QoS). Comprehensive analyses and empirical data-based experiments demonstrate the effectiveness of the proposed approach.

关键词： SDN security DDoS attacks resource management queueing theory QoS

来源：评论

学校读者我要写书评

暂无评论

Minimal Context-Switching data Race Detection with dataflow Tracking

引用

Journal of computer science & Technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：