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

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

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

UAV Virtual Antenna Array Deployment for Uplink Interference Mitigation in data Collection Networks

arXiv

引用

arXiv 2024年

作者： Li, Hongjuan Kang, Hui Sun, Geng Li, Jiahui Wang, Jiacheng Wang, Xue Niyato, Dusit Leung, Victor C.M. 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 College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore Department of Communication Engineering Jilin University Changchun130012 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518115 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical and Computer Engineering The University of British Columbia VancouverV6T 1Z4 Canada

Unmanned aerial vehicles (UAVs) have gained considerable attention as a platform for establishing aerial wireless networks and communications. However, the line-of-sight dominance in air-to-ground communications often leads to significant interference with terrestrial networks, reducing communication efficiency among terrestrial terminals. This paper explores a novel uplink interference mitigation approach based on the collaborative beamforming (CB) method in multi-UAV network systems. Specifically, the UAV swarm forms a UAV-enabled virtual antenna array (VAA) to achieve the transmissions of gathered data to multiple base stations (BSs) for data backup and distributed processing. However, there is a trade-off between the effectiveness of CB-based interference mitigation and the energy conservation of UAVs. Thus, by jointly optimizing the excitation current weights and hover position of UAVs as well as the sequence of data transmission to various BSs, we formulate an uplink interference mitigation multi-objective optimization problem (MOOP) to decrease interference affection, enhance transmission efficiency, and improve energy efficiency, simultaneously. In response to the computational demands of the formulated problem, we introduce an evolutionary computation method, namely chaotic non-dominated sorting genetic algorithm II (CNSGA-II) with multiple improved operators. The proposed CNSGA-II efficiently addresses the formulated MOOP, outperforming several other comparative algorithms, as evidenced by the outcomes of the simulations. Moreover, the proposed CB-based uplink interference mitigation approach can significantly reduce the interference caused by UAVs to non-receiving BSs. Copyright © 2024, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-fuzzy-constrained graph pattern matching with big graph data

引用

Intelligent data Analysis 2020年第4期24卷 941-958页

作者： Liu, Guliu Li, Lei Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei Anhui 230009 China School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Mininglamp Academy of Sciences Mininglamp Technologies Beijing China

Graph pattern matching has been widespread used for protein structure analysis, expert finding and social group selection, ect. Recently, the study of graph pattern matching using the abundant attribute information of vertices and edges as constraint conditions has attracted the attention of scholars, and multi-constrained simulation has been proposed to address the problem in contextual social networks. Actually, multi-constrained graph pattern matching is an NP-complete problem and the fuzziness of constraint variables may exist in many applications. In this paper, we introduce a multi-fuzzy-constrained graph pattern matching problem in big graph data, and propose an efficient first-k algorithm Fuzzy-ETOF-K for solving it. Specifically, exploration-based method based on edge topology is adopted to improve the efficiency of edge connection, and breadth-first bounded search is used for edge matching instead of shortest path query between two nodes to improve the efficiency of edge matching. The results of our experiments conducted on three datasets of real social networks illustrate that our proposed algorithm Fuzzy-ETOF-K significantly outperforms existing approaches in efficiency and the introduction of fuzzy constraints makes our proposed algorithm more efficient and effective. © 2020 - IOS Press and the authors. All rights reserved.

关键词： big graph data Graph pattern matching multi-fuzzy-constrained

来源：评论

学校读者我要写书评

暂无评论

On the Stability and Generalization of Triplet Learning

arXiv

引用

arXiv 2023年

作者： Chen, Jun Chen, Hong Jiang, Xue Gu, Bin Li, Weifu Gong, Tieliang Zheng, Feng College of Informatics Huazhong Agricultural University Wuhan430070 China College of Science Huazhong Agricultural University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China Key Laboratory of Smart Farming for Agricultural Animals Wuhan430070 China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Mohamed bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates School of Computer Science and Technology Xi'an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China

Triplet learning, i.e. learning from triplet data, has attracted much attention in computer vision tasks with an extremely large number of categories, e.g., face recognition and person re-identification. Albeit with rapid progress in designing and applying triplet learning algorithms, there is a lacking study on the theoretical understanding of their generalization performance. To fill this gap, this paper investigates the generalization guarantees of triplet learning by leveraging the stability analysis. Specifically, we establish the first general high-probability generalization bound for the triplet learning algorithm satisfying the uniform stability, and then 1 obtain the excess risk bounds of the order (Equation presented). for both stochastic gradient descent (SGD) and regularized risk minimization (RRM), where 2n is approximately equal to the number of training samples. Moreover, an optimistic generalization bound in expectation as fast as O(n−1) is derived for RRM in a low noise case via the on-average stability analysis. Finally, our results are applied to triplet metric learning to characterize its theoretical underpinning. Copyright © 2023, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A new steganography without embedding based on adversarial training 20

A new steganography without embedding based on adversarial t...

引用

2020 ACM Turing Celebration Conference - China, ACM TURC 2020

作者： Jiang, Wenjie Hu, Donghui Yu, Cong Li, Meng Zhao, Zhong-Qiu Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education and College of Computer Science and Information Engineering !!!Hefei University of Technology Hefei China College of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China

ISBN: (纸本)9781450375344

Steganography is an art to hide information in the carriers to prevent from being detected, while steganalysis is the opposite art to detect the presence of the hidden information. With the development of deep learning, several state-of-the-art steganography and steganalysis based on deep learning techniques have been proposed to improve hiding or detection capabilities. Generative Adversarial Networks (GANs) based steganography directly uses the minimax game between the generator and discriminator, to automatically generate steganography algorithms resisting being detected by powerful steganalysis. The steganography without embedding (SWE) based on GANs, where the generated cover images themselves are stego ones carrying secret information has shown its state-of-the-art steganography performance. However, SWE based on GANs has serious weaknesses, such as low information recovery accuracy, low steganography capacity and poor natural showing. To solve these problems, this paper proposes a new SWE based on adversarial training, with carefully designed generator, discriminator and extractor, as well as their loss functions and optimized training mode. The proposed method can achieve a very high information recovery accuracy (100% in some cases), and at the same time improve the steganography capacity and image quality. © 2020 ACM.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

In-memory join algorithms on GPUs for large-data 21

In-memory join algorithms on GPUs for large-data

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Guo, Chengxin Chen, Hong Key Lab of Data Engineering and Knowledge Engineering of Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9781728120584

In traditional databases, join is one of the most computationally expensive operations in query processing. During the past years, GPU has been adopted to improve the performance of join processing because of the features of massive parallelism and high memory bandwidth. Limited by the capacity of GPU memory and the absence of virtual memory management, however, handling the relations that exceed the capacity of the GPU memory is a challenge for GPU-based join algorithms. Because of the high computing throughput provided by GPUs and the low bandwidth of data communication between the CPUs and the GPUs, data have to be partitioned to fit the features of GPUs and to reduce the cost of data transmission. Furthermore, a series of novel techniques have been developed on the GPUs, which can benefit the join algorithms. In this work, we focus on the optimizing of processing join operator on large relations and propose the designs of in-memory hash join and sort-merge join on GPUs. We present the data partition method on the GPUs implemented with a pipeline mechanism. Furthermore, the shuffle instructions and the CUDA streams are applied in our algorithms to best utilize the GPUs. Experimental results indicate that our hash join algorithm delivers up to 1.51X and 1.24X speedup over the state-of-the-art hash join algorithm on CPUs on NVIDIA GTX1080ti-Pascal GPU and TitanV-Volta GPU respectively. For sort-merge join, our algorithm achieves up to 3.52X and 2.21X improvements on the same GPUs respectively compared to the baselines on CPUs. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Parallel hybrid join algorithm on GPU 21

Parallel hybrid join algorithm on GPU

引用

作者： Guo, Chengxin Chen, Hong Zhang, Feng Li, Cuiping Key Lab of Data Engineering and Knowledge Engineering Ministry of Education School of Information Renmin University of China Beijing China

ISBN: (纸本)9781728120584

In data analytics applications, join is a general and time consuming operation. Optimizing join algorithms can benefit the query processing significantly. The emerging of GPUs provides a massive parallelism solution for improving the performance of the join operation. The hash join (HJ) and sort merge join (SMJ), which are two widely used join algorithms, have been proved effective for efficient join processing on the GPUs. Both algorithms have their own advantages and drawbacks, offering the chance of combining the advantages of HJ and SMJ on GPUs. In processing join operation on GPUs, data need to be transmitted between the CPU and the GPU due to the discrete GPU memory design, which causes performance degradation because of the high PCIe data transfer overhead. As GPUs are becoming more powerful than before, the performance gap between data transmission and GPU execution increases, which makes it even harder to implement an efficient join on GPUs. In this paper, we focus on the optimization of join algorithms on GPUs. We propose the Parallel Hybrid Join algorithm on GPUs(PHYJ) to combine the advantages of HJ and SMJ, and overlap the data communication and GPU execution with a pipeline mechanism. In our evaluation, the PHYJ shows up to 1.72X and 1.55X speedup over the up-to-date HJ and SMJ algorithms respectively on a NVIDIA GTX 1080ti-Pascal GPU. On the TitanV-Volta GPU, up to 1.54X and 1.42X improvements can be achieved over the baseline HJ and SMJ algorithms respectively. © 2019 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Terminal Ranking for Sparsification of Interference Coordination Parameters in Ultra-Dense Networks 10th

Graph-Based Terminal Ranking for Sparsification of Interfere...

引用

10th EAI International Conference on Mobile Networks and Management, MONAMI 2020

作者： Gou, Junxiang Wang, Lusheng Lin, Hai Peng, Min Ministry of Education School of Computer Science and Information Engineering Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Hefei230601 China Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan University Wuhan430072 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230601 China

ISBN: (纸本)9783030640019

In the future mobile communication system, inter-cell interference becomes a serious problem due to the intensive deployment of cells and terminals. Traditional interference coordination schemes take long time for optimization in ultra-dense networks. Meanwhile, due to the increase of factors affecting communication and in order to better meet the communication needs of each terminal, an interference coordination scheme needs to fully consider multiple characteristic parameters of the terminal, which will further increase the scheme’s computational time. Therefore, we should compress all the data through sparsification of parameters before optimization. There are many terminal parameters, and the essence of sparsification of parameters is to rank terminals. In this paper, a graph-based terminal ranking scheme is designed. First, each terminal can be represented by its multiple parameters. Then, all terminals are used as the vertexes in the graph to form a complete weighted graph, and edge weights represent the degree of dissimilarity between terminals. A ranking of terminals is obtained by finding a minimum Hamiltonian path in the graph. Finally, the ranking of all parameter sequences is obtained according to terminals ranking, which makes the sparsity of all parameter sequences better. Simulation results show that the proposed scheme can accomplish sparsification of parameter sequences effectively, especially when the number of sequences increases. In addition, compared with the optimal coordination of traditional scheme, this scheme improves the fairness of the system while ensuring high system capacity, and dramatically reduces the computational time of interference coordination. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering 2020.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

LPL-SLAM: LiDAR SLAM with Plane and Line Optimization for Structural Environment

LPL-SLAM: LiDAR SLAM with Plane and Line Optimization for St...

引用

On-Line Conference (ONCON), Industrial Electronics Society Annual

作者： Huanfeng Zhao Meibao Yao Xueming Xiao Bo Zheng Tao Cao Tao Hu Intelligent Robotics Lab (IRL) School of Artificial Intelligence Jilin University Changchun China Engineering Research Center of Knowledge-Driven Human-Machine Intelligence Ministry of Education China CVIR Lab Changchun University of Science and Technology Changchun China Key Lab of Opto-Electronic Measurement and Optical Information Transmission Technology Shanghai Aerospace Control Technology Institute Shanghai China

In LiDAR SLAM, data association of sparse LiDAR scan and high computational complexity of point-to-model metrics limit real-time applications of joint optimization module like Bundle Adjustment in Visual SLAM, which leads to cumulative errors deteriorating performance. To address this drawback, in this paper, we propose LPL-SLAM with plane and line optimization for the structural environment. Since plane and line primitives are ubiquitous in man-made environments, we treat the primitives as landmarks to process scans. We introduce line and plane factors relying on line-to-line and plane-to-plane metrics to optimize keyframe poses, planes and lines. With the line and plane factors, our system avoids a large-scale optimization problem and yields accurate and consistent tracking poses. Experimental results demonstrate that LPL-SLAM outperforms the state-of-the-art algorithms and achieves real-time performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：