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

arXiv 2020年

作者： Jiang, Feibo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

We consider the optimization of distributed resource scheduling to minimize the sum of task latency and energy consumption for all the Internet of things devices (IoTDs) in a large-scale mobile edge computing (MEC) system. To address this problem, we propose a distributed intelligent resource scheduling (DIRS) framework, which includes centralized training relying on the global information and distributed decision making by each agent deployed in each MEC server. More specifically, we first introduce a novel multi-agent ensemble-assisted distributed deep reinforcement learning (DRL) architecture, which can simplify the overall neural network structure of each agent by partitioning the state space and also improve the performance of a single agent by combining decisions of all the agents. Secondly, we apply action refinement to enhance the exploration ability of the proposed DIRS framework, where the near-optimal state-action pairs are obtained by a novel Lvy flight search. Finally, an imitation acceleration scheme is presented to pre-train all the agents, which can significantly accelerate the learning process of the proposed framework through learning the professional experience from a small amount of demonstration data. Extensive simulations are conducted to demonstrate that the proposed DIRS framework is efficient and outperforms the existing benchmark schemes. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-Agent Deep Reinforcement Learning Approach

引用

Journal of Physics: Conference Series 2021年第1期1757卷

作者： Dong Yin Zhe Zhao Yinglong Dai Han Long College of Intelligence Science and Technology National University of Defense Technology Changsha 410073 China College of Liberal Arts and Sciences National University of Defense Technology Changsha 410073 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha 410081 China

Borrowing the power of deep neural networks, deep reinforcement learning achieved big success in games, and it becomes a popular method to solve the sequential decision-making problems. However, the success is still restricted to single agent training environment. Multi-agent reinforcement learning still is a challenge problem. Although some multi-agent deep reinforcement learning methods have been proposed, they can only perform well when the number of agents is very limited. In this paper, by analyzing the dynamic changing observation space and action space of multi-agent environment, we propose a novel multi-agent deep RL method that compress the joint observation space and action space as the time goes on. The proposed method is potential for a large number of agents cooperative or competitive tasks

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stacked auto encoder based Deep Reinforcement Learning for online resource scheduling in large-scale MEC networks

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom University of Electronic Science and Technology of China Chengdu China

An online resource scheduling framework is proposed for minimizing the sum of weighted task latency for all the mobile users, by optimizing offloading decision, transmission power, and resource allocation in the mobile edge computing (MEC) system. Towards this end, a deep reinforcement learning (DRL) method is proposed to obtain an online resource scheduling policy. Firstly, a related and regularized stacked auto encoder (2r-SAE) with unsupervised learning is proposed to perform data compression and representation for high dimensional channel quality information (CQI) data, which can reduce the state space for DRL. Secondly, we present an adaptive simulated annealing based approach (ASA) as the action search method of DRL, in which an adaptive h-mutation is used to guide the search direction and an adaptive iteration is proposed to enhance the search efficiency during the DRL process. Thirdly, a preserved and prioritized experience replay (2p-ER) is introduced to assist the DRL to train the policy network and find the optimal offloading policy. Numerical results are provided to demonstrate that the proposed algorithm can achieve near-optimal performance while significantly decreasing the computational time compared with existing benchmarks. It also shows that the proposed framework is suitable for resource scheduling problem in large-scale MEC networks, especially in the dynamic environment. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Dynamic maintenance of decision rules for decision attribute values’ changing 25th

Dynamic maintenance of decision rules for decision attribute...

引用

25th International Conference on Neural Information processing, ICONIP 2018

作者： Wang, Yingyao Dai, Jianhua Shi, Hong School of Computer Science and Technology Tianjin University Tianjin300350 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030041816

Rule induction method based on rough set theory (RST) which can generate a minimal set of decision rules by using attribute reduction and approximations has received much attention recently. In real-life, the variation of objects, attributes and attributes’ values affects reducts and approximations, e.g., the coarsening and refining of attributes’ values. The goal of this paper is dynamic maintenance of decision rules for decision attribute values’ coarsening and refining. Two incremental rough-set based methods are proposed to deal with this issue by updating assignment discernibility matrix dynamically without recomputing the reducts from the beginning, which increases the efficiency. © Springer Nature Switzerland AG 2018.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

Label distribution learning based on ensemble neural networks 25th

Label distribution learning based on ensemble neural network...

引用

25th International Conference on Neural Information processing, ICONIP 2018

作者： Zhai, Yansheng Dai, Jianhua Shi, Hong School of Computer Science and Technology Tianjin University Tianjin300350 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030041816

Label distribution learning (LDL), as an extension of multi-label learning, is a new arising machine learning technique to deal with label ambiguity problems. The maximum entropy model is commonly used in label distribution learning. However, it does not consider the correlation between the labels and is not suitable for nonlinear relationships, and the prediction performance is also limited. In this paper, we propose a label distribution learning algorithm based on ensemble neural networks. The algorithm trains neural networks with preferences using training sets with different label sets to construct base learners, and combines the base learners with the weights, which is learned by the combined learner to obtain the final learning results. Experimental results show that the proposed algorithm is effective for label distribution data. © Springer Nature Switzerland AG 2018.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Ai driven heterogeneous MEC system for dynamic environment - Challenges and solutions

arXiv

引用

arXiv 2020年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Xu, Wei Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom NCRL Southeast University Nanjing China School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom University of Electronic Science and Technology of China Chengdu China

—By taking full advantage of computing, Communication and Caching (3C) resources at the network edge, Mobile Edge computing (MEC) is envisioned as one of the key enablers for the next generation network and services. However, current fixed-location MEC architecture may not be able to make real-time decision in dynamic environment, especially in large-scale scenarios. To address this issue, in this paper, a Heterogeneous MEC (H-MEC) architecture is proposed, which is composed of fixed unit, i.e., Ground Stations (GSs) as well as moving nodes, i.e., Ground Vehicles (GVs) and Unmanned Aerial Vehicles (UAVs), all with 3C resource enabled. The key challenges in H-MEC, e.g., mobile edge node management, real-time decision making, user association and resource allocation along with the possible Artificial Intelligence (AI)-based solutions are discussed in this paper. In addition, an AI-based joint Resource schEduling (ARE) framework is proposed, with simulation results shown to verify the efficiency of our proposed framework. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

UWB SAR image segmentation algorithm based on polynomial analysis of statistical distribution

UWB SAR image segmentation algorithm based on polynomial ana...

引用

Asian and Pacific Conference on Synthetic Aperture Radar (APSAR)

作者： Wang Yuming Jin Tian Luo Chaopeng College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computhing and Language Information Processing Science and Technology on Near-Surface Detection Laboratory Hunan Normal University Changsha R.P.China College of Electronic Science and Technology Science and Technology on Near-Surface Detection Laboratory National University of Defense Technology Changsha R.P.China Science and Technology on Near-Surface Detection Laboratory Wuxi China

ISBN: (数字)9781728129129

ISBN: (纸本)9781728129136

Aimed at the segmentation problem of ultrawideband synthetic aperture radar (UWB SAR) image, a novel algorithm based on polynomial analysis of statistical distribution is proposed in this letter. Firstly, we estimate the probability density function (PDF) for each pixel via sparse decomposition of which the dictionary consists of orthogonal polynomials (OP). Secondly, the weighting coefficients of corresponding OP are used to segment image using their maximum value. The experimental results validate the efficiency of this algorithm.

关键词： Image segmentation Probability density function Synthetic aperture radar Radar polarimetry Signal processing algorithms Scattering Statistical distributions

来源：评论

学校读者我要写书评

暂无评论

Insight-HXMT and GECAM-C observations of the brightest-of-all-time GRB 221009A

arXiv

引用

arXiv 2023年

作者： An, Zheng-Hua Antier, S. Bi, Xing-Zi Bu, Qing-Cui Cai, Ce Cao, Xue-Lei Camisasca, Anna-Elisa Chang, Zhi Chen, Gang Chen, Li Chen, Tian-Xiang Chen, Wen Chen, Yi-Bao Chen, Yong Chen, Yu-Peng Coughlin, Michael W. Cui, Wei-Wei Dai, Zi-Gao Hussenot-Desenonges, T. Du, Yan-Qi Du, Yuan-Yuan Du, Yun-Fei Fan, Cheng-Cheng Frontera, Filippo Gao, He Gao, Min Ge, Ming-Yu Gong, Ke Gu, Yu-Dong Guan, Ju Guo, Dong-Ya Guo, Zhi-Wei Guidorzi, Cristiano Han, Da-Wei He, Jian-Jian He, Jun-Wang Hou, Dong-Jie Huang, Yue Huo, Jia Ji, Zhen Jia, Shu-Mei Jiang, Wei-Chun Kann, David Alexander Klotz, A. Kong, Ling-Da Lan, Lin Li, An Li, Bing Li, Chao-Yang Li, Cheng-Kui Li, Gang Li, Mao-Shun Li, Ti-Pei Li, Wei Li, Xiao-Bo Li, Xin-Qiao Li, Xu-Fang Li, Yan-Guo Li, Zheng-Wei Liang, Jing Liang, Xiao-Hua Liao, Jin-Yuan Lin, Lin Liu, Cong-Zhan Liu, He-Xin Liu, Hong-Wei Liu, Jia-Cong Liu, Xiao-Jing Liu, Ya-Qing Liu, Yu-Rong Lu, Fang-Jun Lu, Hong Lu, Xue-Feng Luo, Qi Luo, Tao Ma, Bin-Yuan Ma, Fu-Li Ma, Rui-Can Ma, Xiang Maccary, Romain Mao, Ji-Rong Meng, Bin Nie, Jian-Yin Orlandini, Mauro Ou, Ge Peng, Jing-Qiang Peng, Wen-Xi Qiao, Rui Qu, Jin-Lu Ren, Xiao-Qin Shi, Jing-Yan Shi, Qi Song, Li-Ming Song, Xin-Ying Su, Ju Sun, Gong-Xing Sun, Liang Sun, Xi-Lei Tan, Wen-Jun Tan, Ying Tao, Lian Tuo, You-Li Turpin, Damien Wang, Jin-Zhou Wang, Chen Wang, Chen-Wei Wang, Hong-Jun Wang, Hui Wang, Jin Wang, Ling-Jun Wang, Peng-Ju Wang, Ping Wang, Wen-Shuai Wang, Xiang-Yu Wang, Xi-Lu Wang, Yu-Sa Wang, Yue Wen, Xiang-Yang Wu, Bo-Bing Wu, Bai-Yang Wu, Hong Xiao, Sheng-Hui Xiao, Shuo Xiao, Yun-Xiang Xie, Sheng-Lun Xiong, Shao-Lin Xiong, Sen-Lin Xu, Dong Xu, He Xu, Yan-Jun Xu, Yan-Bing Xu, Ying-Chen Xu, Yu-Peng Xue, Wang-Chen Yang, Sheng Yang, Yan-Ji Yang, Zi-Xu Ye, Wen-Tao Yi, Qi-Bin Yi, Shu-Xu Yin, Qian-Qing You, Yuan Yu, Yun-Wei Yu, Wei Yu, Wen-Hui Zeng, Ming Zhang, Bing Zhang, Bin-Bin Zhang, Da-Li Zhang, Fan Zhang, Hong-Mei Zhang, Juan Key Laboratory of Particle Astrophysics Institute of High Energy Physics Chinese Academy of Sciences 19B Yuquan Road Beijing100049 China Institut für Astronomie und Astrophysik Kepler Center for Astro and Particle Physics Eberhard Karls Universität Sand 1 Tübingen72076 Germany College of Physics Hebei Key Laboratory of Photophysics Research and Application Hebei Normal University Hebei Shijiazhuang050024 China Department of Physics and Earth Science University of Ferrara Via Saragat 1 Ferrara44122 Italy Department of Astronomy Beijing Normal University Beijing100875 China CAS Key Laboratory for Research in Galaxies and Cosmology Department of Astronomy University of Science and Technology of China Hefei230026 China Department of Astronomy Tsinghua University Beijing100084 China Southwest Jiaotong University Chengdu610092 China INAF Osservatorio di Astrofisica e Scienza dello Spazio di Bologna Via Piero Gobetti 101 Bologna40129 Italy University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing100049 China College of physics Sciences Technology Hebei University No. 180 Wusi Dong Road Lian Chi District Hebei Baoding071002 China INFN - Sezione di Ferrara Via Saragat 1 Ferrara44122 Italy Physics and Space Science College China West Normal University China Yunnan Observatories Chinese Academy of Sciences Yunnan Province Kunming650011 China Key Laboratory of Space Astronomy and Technology National Astronomical Observatories Chinese Academy of Sciences Beijing100012 China School of Astronomy and Space Science Nanjing University Nanjing210093 China School of Physics and Optoelectronics Xiangtan University Yuhu District Hunan Xiangtan411105 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China Institute of Astrophysics Central China Normal University Wuhan430079 China Nevada Center for Astrophysics Department of Physics and Astronomy University of

GRB 221009A is the brightest gamma-ray burst ever detected since the discovery of this kind of energetic explosions. However, an accurate measurement of the prompt emission properties of this burst is very challenging due to its exceptional brightness. With joint observations of Insight-HXMT and GECAM-C, we made an unprecedentedly accurate measurement of the emission during the first ∼1800 s of GRB 221009A, including its precursor, main emission (ME, which dominates the burst in flux), flaring emission and early afterglow, in the hard X-ray to soft gamma-ray band from ∼ 10 keV to ∼ 6 MeV. Based on the GECAM-C unsaturated data of the ME, we measure a record-breaking isotropic equivalent energy (Eiso) of ∼ 1.5 × 1055 erg, which is about eight times the total rest-mass energy of the Sun. The early afterglow data require a significant jet break between 650 s and 1100 s, most likely at ∼ 950 s from the afterglow starting time TAG, which corresponds to a jet opening angle of ∼ 0.7◦ (ηγn)1/8, where n is the ambient medium density in units of cm−3 and ηγ is the ratio between γ-ray energy and afterglow kinetic energy. The beaming-corrected total γ-ray energy Eγ is ∼ 1.15 × 1051 (ηγn)1/4 erg, which is typical for long GRBs. These results suggest that this GRB may have a special central engine, which could launch and collimate a very narrowly beamed jet with an ordinary energy budget, leading to exceptionally luminous gamma-ray radiation per unit solid angle. Alternatively, more GRBs might have such a narrow and bright beam, which are missed by an unfavorable viewing angle or have been detected without distance measurement. Copyright © 2023, The Authors. All rights reserved.

关键词： Gamma rays

来源：评论

学校读者我要写书评

暂无评论

Deep learning based joint resource scheduling algorithms for hybrid MEC networks

arXiv

引用

arXiv 2019年

作者： Jiang, Feibo Wang, Kezhi Dong, Li Pan, Cunhua Xu, Wei Yang, Kun Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Technology and Business Changsha China School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom NCRL Southeast University Nanjing China School of Computer Technology and Engineering Changchun Institute of Technology Changchun China School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom

In this paper, we consider a hybrid mobile edge computing (H-MEC) platform, which includes ground stations (GSs), ground vehicles (GVs) and unmanned aerial vehicle (UAVs), all with mobile edge cloud installed to enable user equipments (UEs) or Internet of thing (IoT) devices with intensive computing tasks to offload. Our objective is to obtain an online offloading algorithm to minimize the energy consumption of all the UEs, by jointly optimizing the positions of GVs and UAVs, user association and resource allocation in real-time, while considering the dynamic environment. To this end, we propose a hybrid deep learning based online offloading (H2O) framework where a large-scale path-loss fuzzy c-means (LSFCM) algorithm is first proposed and used to predict the optimal positions of GVs and UAVs. Secondly, a fuzzy membership matrix U-based particle swarm optimization (U-PSO) algorithm is applied to solve the mixed integer nonlinear programming (MINLP) problems and generate the sample datasets for the deep neural network (DNN) where the fuzzy membership matrix can capture the small-scale fading effects and the information of mutual interference. Thirdly, a DNN with the scheduling layer is introduced to provide user association and computing resource allocation under the practical latency requirement of the tasks and limited available computing resource of H-MEC. In addition, different from traditional DNN predictor, we only input one UEs information to the DNN at one time, which will be suitable for the scenarios where the number of UE is varying and avoid the curse of dimensionality in DNN. Copyright © 2019, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：