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

Policy Network-Based Dual-Agent Deep Reinforcement Learning for Multi-Resource Task Offloading in Multi-Access Edge Cloud Networks

引用

China Communications 2024年第4期21卷 53-73页

作者： Feng Chuan Zhang Xu Han Pengchao Ma Tianchun Gong Xiaoxue School of Communications and Information Engineering Chongqing University of Posts and TelecommunicationsChongqing 400065China Institute of Intelligent Communication and Network Security Chongqing University of Posts and TelecommunicationsChongqing 400065China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqing 400065China School of Information Engineering Guangdong University of TechnologyGuangzhou 510006China

The Multi-access Edge Cloud(MEC) networks extend cloud computing services and capabilities to the edge of the networks. By bringing computation and storage capabilities closer to end-users and connected devices, MEC networks can support a wide range of applications. MEC networks can also leverage various types of resources, including computation resources, network resources, radio resources,and location-based resources, to provide multidimensional resources for intelligent applications in 5/***, tasks generated by users often consist of multiple subtasks that require different types of resources. It is a challenging problem to offload multiresource task requests to the edge cloud aiming at maximizing benefits due to the heterogeneity of resources provided by devices. To address this issue,we mathematically model the task requests with multiple subtasks. Then, the problem of task offloading of multi-resource task requests is proved to be NP-hard. Furthermore, we propose a novel Dual-Agent Deep Reinforcement Learning algorithm with Node First and Link features(NF_L_DA_DRL) based on the policy network, to optimize the benefits generated by offloading multi-resource task requests in MEC networks. Finally, simulation results show that the proposed algorithm can effectively improve the benefit of task offloading with higher resource utilization compared with baseline algorithms.

关键词： benefit maximization deep reinforcement learning multi-access edge cloud task offloading

来源：评论

学校读者我要写书评

暂无评论

GraphConvNet: A Dual Network Utilizing Local Features Coupled with Structural Information for Predicting Knee Osteoarthritis

GraphConvNet: A Dual Network Utilizing Local Features Couple...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Tang, Pengju Dai, Dawei Zou, Kai Yang, Xionghui Wang, Guoyin Chongqing University of Posts and Telecommunications Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Chongqing400065 China Chongqing Normal University College of Computer and Information Science Chongqing401331 China

ISBN: (纸本)9798350386226

Knee Osteoarthritis (KOA) is a common joint disease that severely affects the normal lives of patients. In clinical practice, the severity of KOA is commonly evaluated by observing radiographs of the knee joint However, this approach heavily relies on a doctor's clinical experience and exhibits a certain degree of subjectivity. In previous studies, various advanced deep convolutional neural network (CNN) models have been used to diagnose KOA. As known, CNN models often focus on learning the local detailed features for decision-making and lack attention to global structural information. In this study, we propose a dual network called GraphConvNet that integrates a visual graph neural network with a deep CNN to enhance representation learning by leveraging both local detailed features and global structural information. Our proposed method was evaluated using an Osteoarthritis Initiative (OAI) dataset and achieved an overall accuracy, recall, precision, and mean absolute error (MAE) of 75.24%, 77.75%, 74.33% and 0.283, respectively. Experiments demonstrate that our proposed method significantly improves the performance and achieves state-of-the-art performance. All codes are available at https://***/ddw2AIGROUP2CQUPT/GraphConvNet. © 2024 IEEE.

关键词： Joints (anatomy)

来源：评论

学校读者我要写书评

暂无评论

A Feature Fusion Network with Multiscale Adaptively Attentional for Object Detection in Complex Traffic Scenes

IEEE Transactions on Intelligent Vehicles

引用

IEEE Transactions on intelligent Vehicles 2024年

作者： Cai, Fei Qu, Zhong Yin, Xuehui Chongqing Key Laboratory of Computational Intelligence The Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education The Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

Currently, small object detection in complex traffic scenarios remains a major challenge due to variations in object shape, scales, and external environment, as well as a high inter-class similarity. Although the latest algorithms achieve high accuracy, the results for small objects are still unsatisfactory. To obtain satisfactory small object detection results, the YOLOv8 algorithm is used to construct a feature fusion network with multiscale adaptively attentional (MAAFFNet). Firstly, the C2f module is modified to replace the simple summation operation with Multiscale Iterative Attentional Feature Fusion (MSIAFF), which enhances the ability of multi-scale aggregation of the C2f module and suppresses the interference of irrelevant information, resulting in a richer semantic feature map. Secondly, the adaptive spatial feature fusion (ASFF) module is introduced to deal with the feature maps of different scales, allocate the weights of spatial features of different levels, and enhance the consistency of semantic information between each layer of the feature maps, so as to improve the detail richness of the network. Finally, to achieve more accurate classification of small objects, a Slide loss function is introduced to achieve object classification and localization. Our proposed algorithm has been extensively experimented on KITTI, COCO-traffic and VOC 2012 datasets, respectively, comparing the proposed method to popular two-stage and single-stage object detection algorithms, the proposed method performs well in terms of accuracy. © 2024 IEEE.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Improved Demonstration-Knowledge Utilization in Reinforcement Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2139-2150页

作者： Liu, Yanyu Zeng, Yifeng Ma, Biyang Pan, Yinghui Gao, Huifan Zhang, Yuting Xiamen University Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Department of Automation Xiamen361102 China Northumbria University Department of Computer and Information Sciences NewcastleNE1 8ST United Kingdom Minnan Normal University Department of Computer Science Zhangzhou363000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Reinforcement learning (RL) has made great success in recent years. Generally, the learning process requires a huge amount of interaction with the environment before an agent can achieve acceptable performance. This motivates many techniques, such as incorporating prior knowledge which is usually presented as experts' demonstration, and using a probability distribution to represent state-and-action values, to accelerate the learning process. The methods perform well when the prior knowledge is genuinely correct and no much change occurs to the learning environment. However, the requirement is not perfectly realistic in many complex applications. The demonstration knowledge may not reflect the true environment and even be full of noise. In this article, we introduce a dynamic distribution merging method to improve knowledge utilization in a general RL algorithm, namely Q-learning. The new method adapts a normal distribution to represent state-action values and merges the prior and learned knowledge in a discriminative way. We theoretically analyze the new learning method and demonstrate its empirical performance over multiple problem domains. © 2020 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

OSFS-Vague: Online streaming feature selection algorithm based on vague set

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1451-1466页

作者： Jie Yang Zhijun Wang Guoyin Wang Yanmin Liu Yi He Di Wu School of Physics and Electronic Science Zunyi Normal UniversityZunyiChina Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqingChina Department of Computer Science Old Dominion UniversityNorfolkVirginiaUSA College of Computer and Information Science Southwest UniversityChongqingChina

Online streaming feature selection(OSFS),as an online learning manner to handle streaming features,is critical in addressing high-dimensional *** real big data-related applications,the patterns and distributions of streaming features constantly change over time due to dynamic data generation ***,existing OSFS methods rely on presented and fixed hyperparameters,which undoubtedly lead to poor selection performance when encountering dynamic *** make up for the existing shortcomings,the authors propose a novel OSFS algorithm based on vague set,named *** main idea is to combine uncertainty and three-way decision theories to improve feature selection from the traditional dichotomous method to the trichotomous ***-Vague also improves the calculation method of correlation between features and ***,OSFS-Vague uses the distance correlation coefficient to classify streaming features into relevant features,weakly redundant features,and redundant ***,the relevant features and weakly redundant features are filtered for an optimal feature *** evaluate the proposed OSFS-Vague,extensive empirical experiments have been conducted on 11 *** results demonstrate that OSFS-Vague outperforms six state-of-the-art OSFS algorithms in terms of selection accuracy and computational efficiency.

关键词： feature selection online feature selection three-way decision vague set

来源：评论

学校读者我要写书评

暂无评论

A keypoint-Based Object Detection Algorithm 7

A Keypoint-Based Object Detection Algorithm

引用

7th IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2024

作者： Hou, Xiangdan Chen, Quansong Liu, Hongpu School of Artificial Intelligence and Data Science Hebei University of Technology Tianjin China Hebei Province Key Laboratory of Big Data Computing Tianjin China

ISBN: (纸本)9798350370782

An improved algorithm is proposed for the omission and re-detection problems in the point cloud object detection method CenterPoint. The algorithm firstly adds Focal sparse convolution module to the feature extraction network to increase the proportion of important information in the features;then redefines the generation function of the detection head heatmap, and the supervisory signal generated by the elliptical Gaussian kernel is more closely matched to the real shape of the object to inhibit the generation of negative samples;finally, the overall regression of the bounding box information is applied to the training, so that the back propagation loss gain of the single dimensional information is regulated by the associated information. The improved algorithm is trained and evaluated on the KITTI 3D object detection dataset, and the overall mean Average Precision (mAP) is improved by 3.29% compared with the base model CenterPoint. The experimental results show that the improved algorithm effectively suppresses the redetection and omission problems of CenterPoint. © 2024 IEEE.

关键词： CenterPoint Focal sparse convolution Gaussian kernel object detection overall regression

来源：评论

学校读者我要写书评

暂无评论

Research on performance optimization of virtual data space across WAN

引用

Frontiers of Computer Science 2024年第6期18卷 167-187页

作者： Jiantong HUO Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China

For the high-performance computing in a WAN environment,the geographical locations of national supercomputing centers are scattered and the network topology is complex,so it is difficult to form a unified view of *** aggregate the widely dispersed storage resources of national supercomputing centers in China,we have previously proposed a global virtual data space named GVDS in the project of“High Performance computing Virtual data Space”,a part of the National key Research and Development Program of *** GVDS enables large-scale applications of the high-performance computing to run efficiently across ***,the applications running on the GVDS are often data-intensive,requiring large amounts of data from multiple supercomputing centers across *** this regard,the GVDS suffers from performance bottlenecks in data migration and access across *** solve the above-mentioned problem,this paper proposes a performance optimization framework of GVDS including the multitask-oriented data migration method and the request access-aware IO proxy resource allocation *** a WAN environment,the framework proposed in this paper can make an efficient migration decision based on the amount of migrated data and the number of multiple data sources,guaranteeing lower average migration latency when multiple data migration tasks are running in *** addition,it can ensure that the thread resource of the IO proxy node is fairly allocated among different types of requests(the IO proxy is a module of GVDS),so as to improve the application’s performance across *** experimental results show that the framework can effectively reduce the average data access delay of GVDS while improving the performance of the application greatly.

关键词： storage aggregation across WANs large-scale applications GVDS data migration allocation of IO proxy resource

来源：评论

学校读者我要写书评

暂无评论

Combining permissioned blockchain and Bayesian best-worst method for transparent supplier selection in supply chain management

引用

Science China(Technological Sciences) 2024年第8期67卷 2579-2593页

作者： LIU JiaJun ZHANG Jie LENG JieWu Shanghai Engineering Research Center of Industrial Big Data and Intelligent System Institute of Artificial IntelligenceDonghua UniversityShanghai 201620China State Key Laboratory of Precision Electronic Manufacturing Technology and Equipment Guangdong University of TechnologyGuangzhou 510006China

Supplier selection is an important business activity in order to realize the purchasing function in supply chain *** supplier selection process includes four stages,i.e.,bidding inviting,bidding,group decision-making,and results disclosure,involving the participation of manufacturing service demanders(MSDs),manufacturing service suppliers(MSSs),and ***,all the participants have raised concerns about the increased transparency in supplier ***,this study proposes a transparent supplier selection method by considering the engagement of *** this method,the Bayesian best-worst method(Bayesian BWM)is used to aggregate decision-makers'preferences into the overall optimal weights of the alternative MSSs,and the MSS with the largest weight is considered the suitable MSS for ***,blockchain is introduced to record the decision-making process information about supplier selection through a customized smart contract,where MSSs act as supervisors to supervise the decision-making process through the distributed consensus mechanism rather than directly participate in the decision-making ***,a case study of supplier selection in purchasing vibration acceleration sensors is *** result shows that the proposed method can support MSDs in selecting suitable MSS from alternative MSSs by aggregating decision-makers'preferences,and blockchain can provide credible information about the supplier selection process for MSSs,MSDs,and *** this way,the transparency of supplier selection is enhanced.

关键词： blockchain supplier selection supply chain transparency Bayesian BWM group decision-making

来源：评论

学校读者我要写书评

暂无评论

DFGR: Deep Feature Graph Representation for Predicting Knee Osteoarthritis 4

DFGR: Deep Feature Graph Representation for Predicting Knee ...

引用

4th International Conference on Neural Networks, Information and Communication Engineering, NNICE 2024

作者： Xu, Tao Dai, Dawei Wang, Yuqi Li, Gen Chongqing University of Posts and Telecommunications Key Laboratory of Big Data Intelligent Computing Chongqing China Shanghai Jiaotong University School of Medicine Department of Orthopedics Ruijin Hospital Shanghai China

ISBN: (纸本)9798350394375

Knee osteoarthritis (KOA) is a common joint disease that severely affects the normal lives of patients. In clinical practice, the severity of KOA is evaluated by observing the X-ray images of the knee joint, which is highly dependent on the subjective experience of the doctor. In this study, we developed a novel deep CNN model that integrates structural information processing to predict KOA severity automatically. Specifically, (1) The knee joint regions of the original X-ray images are segmented using automatic detection;(2) We employed a pre-trained deep CNN models to extract deep features of key regions, and construct their corresponding graph representations;(3) A graph attention network (GAT) was designed as a fine-tuning module to build a KOA prediction model. Experiments demonstrate that our method significantly improves the performance in multiple aspects. In addition, our method demonstrates good interpretability. Codes are available at https://***/ddw2AIGROUP2CQUPT/DFGR © 2024 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

On RNN-Based k-WTA Models With Time-Dependent Inputs

引用

IEEE/CAA Journal of Automatica Sinica 2022年第11期9卷 2034-2036页

作者： Mei Liu Mingsheng Shang the Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714 the Chongqing School University of Chinese Academy of SciencesChongqing 400714China

Dear editor,This letter identifies two weaknesses of state-of-the-art k-winnerstake-all(k-WTA)models based on recurrent neural networks(RNNs)when considering time-dependent inputs,i.e.,the lagging error and the infeas... 详细信息

关键词： letter convergence finite

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：