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

BARGAIN-MATCH: A Game Theoretical Approach for Resource Allocation and Task Offloading in Vehicular Edge computing Networks

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Sun, Zemin Sun, Geng Liu, Yanheng Wang, Jian Cao, Dongpu The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The School of Vehicle and Mobility Tsinghua University Beijing China

Vehicular edge computing (VEC) is emerging as a promising architecture of vehicular networks (VNs) by deploying the cloud computing resources at the edge of the VNs. However, efficient resource management and task offloading in the VEC network is challenging. In this work, we first present a hierarchical framework that coordinates the heterogeneity among tasks and servers to improve the resource utilization for servers and service satisfaction for vehicles. Moreover, we formulate a joint resource allocation and task offloading problem (JRATOP), aiming to jointly optimize the intra-VEC server resource allocation and inter-VEC server load-balanced offloading by stimulating the horizontal and vertical collaboration among vehicles, VEC servers, and cloud server. Since the formulated JRATOP is NP-hard, we propose a cooperative resource allocation and task offloading algorithm named BARGAIN-MATCH, which consists of a bargaining-based incentive approach for intra-server resource allocation and a matching method-based horizontal-vertical collaboration approach for inter-server task offloading. Besides, BARGAIN-MATCH is proved to be stable, weak Pareto optimal, and polynomial complex. Simulation results demonstrate that the proposed approach achieves superior system utility and efficiency compared to the other methods, especially when the system workload is heavy. Copyright © 2022, The Authors. All rights reserved.

关键词： Game theory

Research on the Task Scheduling System for Agricultural Plant Protection UAV 19

学校读者我要写书评

暂无评论

Research on the Task Scheduling System for Agricultural Plan...

Proceedings of the 2019 2nd International Conference on Robot Systems and Applications

作者： Sun Fengjie Wang Xianchang Zhang Rui Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering Ministry of Education China Jilin University Key Laboratory of Symbolic Computing and Knowledge Engineering Ministry of Education Chengdu Kestrel Artificial Intelligence Institute China

ISBN: (纸本)9781450365130

Unmanned Aerial Vehicle (UAV) can greatly reduce manpower in agricultural plant protection such as watering, sowing, pesticide spraying. It helps in creating an autonomous manufacturing sys- tem by executing tasks with less human intervention in time-efficient manner. Consequently, a scheduler is one essential component to be focused on; yet to the best of our knowledge, there are few re- search on practical UAV scheduling. This work proposes an algorithm to schedule the UAV actions in practice such as pesticide spraying, flying and charging. During the execution of the algorithm, the tasks are put into a queue then each task is assigned to the UAV that can complete it in the shortest amount of time, and then the UAVs perform tasks in the order in which they are as- signed. This proposed method is implemented into a scheduler and tested on datasets generated based on a real flight demonstration. Performance evaluation of the scheduler is discussed in details.

关键词： task Assignment UAV swarm scheduling

UAV-enabled Collaborative Beamforming via Multi-Agent Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Saichao Sun, Geng Li, Jiahui Liang, Shuang Wu, Qingqing Wang, Pengfei Niyato, Dusit The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Information Science and Technology Northeast Normal University Changchun130117 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Technology Dalian University of Technology Dalian116024 China

In this paper, we investigate an unmanned aerial vehicle (UAV)-assistant air-to-ground communication system, where multiple UAVs form a UAV-enabled virtual antenna array (UVAA) to communicate with remote base stations by utilizing collaborative beamforming. To improve the work efficiency of the UVAA, we formulate a UAV-enabled collaborative beamforming multi-objective optimization problem (UCBMOP) to simultaneously maximize the transmission rate of the UVAA and minimize the energy consumption of all UAVs by optimizing the positions and excitation current weights of all UAVs. This problem is challenging because these two optimization objectives conflict with each other, and they are non-concave to the optimization variables. Moreover, the system is dynamic, and the cooperation among UAVs is complex, making traditional methods take much time to compute the optimization solution for a single task. In addition, as the task changes, the previously obtained solution will become obsolete and invalid. To handle these issues, we leverage the multi-agent deep reinforcement learning (MADRL) to address the UCBMOP. Specifically, we use the heterogeneous-agent trust region policy optimization (HATRPO) as the basic framework, and then propose an improved HATRPO algorithm, namely HATRPO-UCB, where three techniques are introduced to enhance the performance. Simulation results demonstrate that the proposed algorithm can learn a better strategy compared with other methods. Moreover, extensive experiments also demonstrate the effectiveness of the proposed techniques. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

Learning Group-Disentangled Representation for Interpretable Thoracic Pathologic Prediction

学校读者我要写书评

暂无评论

Learning Group-Disentangled Representation for Interpretable...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hao Li Yirui Wu Hexuan Hu Hu Lu Yong Lai Shaohua Wan Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University College of Computer and Information Hohai University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University School of Computer Science and Communication Engineering Jiangsu University Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Deep learning methods have shown significant performance in medical image analysis tasks. However, they generally act like ”black box” without explanations in both feature extraction and decision processes, leading to lack of clinical insights and high risk assessments. To aid deep learning in envisioning diseases with visual clues, we propose Representation Group-Disentangling Network (RGD-Net), which can completely disentangle feature space of input X-ray images into several independent feature groups, each corresponding to a specific disease. Taking several semantically related and labeled X-ray images as input, RGD-Net firstly extracts completely group-disentangled representations of diseases through Group-Disentangle Module, which applies group-swap and linking operations to construct latent space by enforcing semantic consistency of attributes. To prevent learning degenerate representations defined as shortcut problem, we further introduce adversarial constricts on mapping from features to diseases, thus avoiding model collapse with former free-form disentanglement. Experiments on chestxray-14 and ChestXpert datasets demonstrate that RGD-Net are effective in predicting diseases with remarkable advantages, which leverage potential factors contributing to different diseases, thus enhancing interpretability in working patterns of deep learning methods.

关键词： Deep learning Training Visualization Image analysis Semantics Feature extraction Risk management

Weakly supervised prototype topic model with discriminative seed words: Modifying the category prior by self-exploring supervised signals

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Bing Wang, Yue Li, Ximing Ouyang, Jihong College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University China

Dataless text classification, i.e., a new paradigm of weakly supervised learning, refers to the task of learning with unlabeled documents and a few predefined representative words of categories, known as seed words. The recent generative dataless methods construct document-specific category priors by using seed word occurrences only, however, such category priors often contain very limited and even noisy supervised signals. To remedy this problem, in this paper we propose a novel formulation of category prior. First, for each document, we consider its label membership degree by not only counting seed word occurrences, but also using a novel prototype scheme, which captures pseudo-nearest neighboring categories. Second, for each label, we consider its frequency prior knowledge of the corpus, which is also a discriminative knowledge for classification. By incorporating the proposed category prior into the previous generative dataless method, we suggest a novel generative dataless method, namely Weakly Supervised Prototype Topic Model (Wsptm). The experimental results on real-world datasets demonstrate that Wsptm outperforms the existing baseline methods. © 2021, CC0.

关键词： Text processing

Reinforced iterative knowledge distillation for cross-lingual named entity recognition

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liang, Shining Gong, Ming Pei, Jian Shou, Linjun Zuo, Wanli Zuo, Xianglin Jiang, Daxin College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education STCA NLP Group Microsoft School of Computing Science Simon Fraser University

Named entity recognition (NER) is a fundamental component in many applications, such as Web Search and Voice Assistants. Although deep neural networks greatly improve the performance of NER, due to the requirement of large amounts of training data, deep neural networks can hardly scale out to many languages in an industry setting. To tackle this challenge, cross-lingual NER transfers knowledge from a rich-resource language to languages with low resources through pre-trained multilingual language models. Instead of using training data in target languages, cross-lingual NER has to rely on only training data in source languages, and optionally adds the translated training data derived from source languages. However, the existing cross-lingual NER methods do not make good use of rich unlabeled data in target languages, which is relatively easy to collect in industry applications. To address the opportunities and challenges, in this paper we describe our novel practice in Microsoft to leverage such large amounts of unlabeled data in target languages in real production settings. To effectively extract weak supervision signals from the unlabeled data, we develop a novel approach based on the ideas of semi-supervised learning and reinforcement learning. The empirical study on three benchmark data sets verifies that our approach establishes the new state-of-the-art performance with clear edges. Now, the NER techniques reported in this paper are on their way to become a fundamental component for Web ranking, Entity Pane, Answers Triggering, and Question Answering in the Microsoft Bing search engine. Moreover, our techniques will also serve as part of the Spoken Language Understanding module for a commercial voice assistant. We plan to open source the code of the prototype framework after deployment. © 2021, CC BY-NC-SA.

关键词： Deep neural networks

Joint Power and 3D Trajectory Optimization for UAV-enabled Wireless Powered Communication Networks with Obstacles

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Pan, Hongyang Liu, Yanheng Sun, Geng Fan, Junsong Liang, Shuang Yuen, Chau The College of Computer Science and Technology Jilin University Changchun130012 China Pillar Singapore University of Technology and Design 487372 Singapore The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The School of Information Science and Technology Northeast Normal University Changchun130024 China

Unmanned aerial vehicle (UAV)-enabled wireless powered communication networks (WPCNs) are promising technologies in 5G/6G wireless communications, while there are several challenges about UAV power allocation and scheduling to enhance the energy utilization efficiency, considering the existence of obstacles. In this work, we consider a UAV-enabled WPCN scenario that a UAV needs to cover the ground wireless devices (WDs). During the coverage process, the UAV needs to collect data from the WDs and charge them simultaneously. To this end, we formulate a joint-UAV power and three-dimensional (3D) trajectory optimization problem (JUPTTOP) to simultaneously increase the total number of the covered WDs, increase the time efficiency, and reduce the total flying distance of UAV so as to improve the energy utilization efficiency in the network. Due to the difficulties and complexities, we decompose it into two sub optimization problems, which are the UAV power allocation optimization problem (UPAOP) and UAV 3D trajectory optimization problem (UTTOP), respectively. Then, we propose an improved non-dominated sorting genetic algorithm-II with K-means initialization operator and Variable dimension mechanism (NSGA-II-KV) for solving the UPAOP. For UTTOP, we first introduce a pretreatment method, and then use an improved particle swarm optimization with Normal distribution initialization, Genetic mechanism, Differential mechanism and Pursuit operator (PSO-NGDP) to deal with this sub optimization problem. Simulation results verify the effectiveness of the proposed strategies under different scales and settings of the networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Energy utilization

Hierarchical features-based targeted aspect extraction from online reviews

学校读者我要写书评

暂无评论

Intelligent Data Analysis 2021年第1期25卷 205-223页

作者： He, Jin Li, Lei Wang, Yan Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei Anhui China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Department of Computing Macquarie University Sydney Australia MiningLamp Academy of Sciences Mininglamp Techonologies Beijing China

With the prevalence of online review websites, large-scale data promote the necessity of focused analysis. This task aims to capture the information that is highly relevant to a specific aspect. However, the broad scope of the aspects of the various products makes this task overarching but challenging. A commonly used solution is to modify the topic models with additional information to capture the features for a specific aspect (referred to as a targeted aspect). However, the existing topic models, either perform the full analysis to capture features as many as possible or estimate the similarity to capture features as coherent as possible, overlook the fine-grained semantic relations between the features, resulting in the captured features coarse and confusing. In this paper, we propose a novel Hierarchical Features-based Topic Model (HFTM) to extract targeted aspects from online reviews, then to capture the aspect-specific features. Specifically, our model can not only capture the direct features posing target-to-feature semantics but also capture the latent features posing feature-to-feature semantics. The experiments conducted on real-world datasets demonstrate that HFTMl outperforms the state-of-the-art baselines in terms of both aspect extraction and document classification. © 2021 - IOS Press. All rights reserved.

关键词： Aspect extraction Focused analysis Online reviews Text mining Topic modeling

A Multi-Agent Deep Reinforcement Learning Method for Fully Noisy Observations

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Wang, Kaiyu Zhang, Menglin Qu, Bohao Wang, Xianchang College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Changchun130012 China School of Artificial Intelligence Jilin University Jilin Changchun130012 China Chengdu Kestrel Artificial Intelligence Institute Chengdu611730 China

Multi-agent reinforcement learning (MARL) algorithms have achieved great breakthroughs in many aspects. The MARL algorithms can learn effective policies in ideal simulation environments. But different from the ideal simulation environments, noise is unavoidable in the real world. MARL algorithms need to learn effective policies in unavoidable fully noisy environments. In this paper, we consider a challenging multi-agent reinforcement learning problem: All agents cannot observe any noiseless observations from environments during the whole training process and MARL algorithms cannot learn effective policies in these fully noisy observation environments. To solve this problem, we propose a method called Robust Policy Learning under Fully Noisy Observation viA DeNoising REpresentation NeTwork (PLANET), which enables MARL algorithms learning effective policies in fully noisy observation environments. The PLANET method learns the effective policy through two steps. (1) Extracting the noise characteristics and motion laws information from fully noisy observation histories. (2) Making MARL algorithms extract information from the noise characteristics and motion laws information and learn effective policies. The results of a series of exhaustive experiments show that our method can eliminate the effects of noise and learn effective policies in fully noisy observation environments. © 2023, The Authors. All rights reserved.

关键词： Learning algorithms