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

Aerial Active STAR-RIS-assisted Satellite-Terrestrial Covert Communications

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wang, Jiacheng Zhang, Ruichen Niyato, Dusit Mao, Shiwen Quek, Tony Q.S. Computer Science and Technology Jilin University Changchun130012 China Singapore University of Technology and Design Singapore487372 Singapore College of Computer Science and Technology Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States Information System Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore

An integration of satellites and terrestrial networks is crucial for enhancing performance of next generation communication systems. However, the networks are hindered by the long-distance path loss and security risks in dense urban environments. In this work, we propose a satellite-terrestrial covert communication system assisted by the aerial active simultaneous transmitting and reflecting reconfigurable intelligent surface (AASTAR-RIS) to improve the channel capacity while ensuring the transmission covertness. Specifically, we first derive the minimal detection error probability (DEP) under the worst condition that the Warden has perfect channel state information (CSI). Then, we formulate an AASTAR-RIS-assisted satellite-terrestrial covert communication optimization problem (ASCCOP) to maximize the sum of the fair channel capacity for all ground users while meeting the strict covert constraint, by jointly optimizing the trajectory and active beamforming of the AASTAR-RIS. Due to the challenges posed by the complex and high-dimensional state-action spaces as well as the need for efficient exploration in dynamic environments, we propose a generative deterministic policy gradient (GDPG) algorithm, which is a generative deep reinforcement learning (DRL) method to solve the ASCCOP. Concretely, the generative diffusion model (GDM) is utilized as the policy representation of the algorithm to enhance the exploration process by generating diverse and high-quality samples through a series of denoising steps. Moreover, we incorporate an action gradient mechanism to accomplish the policy improvement of the algorithm, which refines the better state-action pairs through the gradient ascent. Simulation results demonstrate that the proposed approach significantly outperforms important benchmarks, and also validate the performance and practicality under different algorithm parameters and environment settings. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

GEOM-GCN: Geometric graph convolutional networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Lei, Yu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education China

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Graphic methods

A pseudo label based dataless naive bayes algorithm for text classification with seed words 27

学校读者我要写书评

暂无评论

A pseudo label based dataless naive bayes algorithm for text...

27th International Conference on computational Linguistics, COLING 2018

作者： Li, Ximing Yang, Bo College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China

ISBN: (纸本)9781948087506

Traditional supervised text classifiers require a large number of manually labeled documents, which are often expensive to obtain. Recently, dataless text classification has attracted more attention, since it only requires very few seed words of categories that are much cheaper. In this paper, we develop a pseudo-label based dataless Naive Bayes (PL-DNB) classifier with seed words. We initialize pseudo-labels for each document using seed word occurrences, and employ the expectation maximization algorithm to train PL-DNB in a semi-supervised manner. The pseudo-labels are iteratively updated using a mixture of seed word occurrences and estimations of label posteriors. To avoid noisy pseudo-labels, we also consider the information of nearest neighboring documents in the pseudo-label update step, i.e., preserving local neighborhood structure of documents. We empirically show that PL-DNB outperforms traditional dataless text classification algorithms with seed words. Especially, PL-DNB performs well on the imbalanced dataset. © 2018 COLING 2018 - 27th International Conference on computational Linguistics, Proceedings. All rights reserved.

关键词： Iterative methods

An Unmanned Aerial Vehicle Pose Estimation System Guided by Desired Shot

学校读者我要写书评

暂无评论

An Unmanned Aerial Vehicle Pose Estimation System Guided by ...

IEEE International Conference on Automation, Electronics and Electrical engineering (AUTEEE)

作者： Xinglei Dou Qijian Ding Qiao Du Min Yang Yuzhou Huo Xin Wang College of Software Engineering Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education Jilin University Changchun China

ISBN: (数字)9781728150307

ISBN: (纸本)9781728150314

Unmanned aerial vehicles (UAVs) are widely used in aerial photography nowadays for their strong maneuverability, good image quality and high cost performance, while they have limited battery capacity and difficulty in operation. It is difficult to reach the ideal pose and get the desired shot by manual manipulation in a short time. To solve these problems, an UAV pose estimation system guided by desired shot is constructed. Either a sequence of images or a video is taken as input. The user interacts with the system to express the desired shot. The 3D-reconstruction is done by Structure from Motion (SfM). Then the Perspective-n-Point (PnP) problem is solved to estimate the ideal pose of the UAV. The experimental results proves that the system is effective and valid.

关键词： Three-dimensional displays Feature extraction Unmanned aerial vehicles Cameras Pose estimation Software engineering Data mining

Multiple Auxiliary Information Based Deep Model for Collaborative Filtering

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2018年第4期33卷 668-681页

作者： Lin Yue Xiao-Xin Sun Wen-Zhu Gao Guo-Zhong Feng Bang-Zuo Zhang School of Information Science and Technology Northeast Normal University Changchun 130117 China Key Laboratory of Applied Statistics of Ministry of Education Northeast Normal University Changchun 130024 China School of Environment Northeast Normal University Changchun 130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

With the ever-growing dynamicity, complexity, technique is proposed and becomes one of the most effective and volume of information resources, the recommendation techniques for solving the so-called problem of information overload. Traditional recommendation algorithms, such as collaborative filtering based on the user or item, only measure the degree of similarity between users or items with single criterion, i.e., ratings. According to the experience of previous studies, single criterion cannot accurately measure the similarity between user preferences or items. In recent years, the application of deep learning techniques has gained significant momentum in recommender systems for better understanding of user preferences, item characteristics, and historical interactions. In this work, we integrate plot information as auxiliary information into the denoising autoencoder （DAE）, called SemRe-DCF, which aims at learning semantic representations of item descriptions and succeeds in capturing fine-grained semantic regularities by using vector arithmetic to get better rating prediction. The results manifest that the proposed method can effectively improve the accuracy of prediction and solve the cold start problem.

关键词： semantic representation plot information denoising autoencoder collaborative filtering auxiliary information

Parking Space Prediction Algorithm Based on Recurrent Neural Network and Ensemble Learning Algorithm

学校读者我要写书评

暂无评论

Parking Space Prediction Algorithm Based on Recurrent Neural...

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Kedi Lv Haipeng Chen Yingda Lv Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China Center for Computer Fundamental Education Jilin University Changchun China

ISBN: (数字)9781728138633

ISBN: (纸本)9781728138640

The essence of parking space prediction is a practical application of time series prediction problem. It provides effective auxiliary information for traffic management and personal travel. As a new demand, they face challenges in data acquisition, accuracy and robustness. The parking space prediction algorithm based on recurrent neural network (RNN) and ensemble learning algorithm is proposed in this paper. However, because the neural network needs large data training, the lack of parking space data in specific areas is a common challenge for researchers. In this paper, a new network model structure based on ensemble learning algorithm is proposed, which is called E-RNN. The ensemble learning algorithm model is used as the primary learner and the neural network as the secondary learner for the ensemble learning. By using the adaptability of the algorithm in ensemble learning to the collective data, the neural network can get better prediction effect under the training of small data sets. Finally, the parameters of the new model are optimized by using particle swarm optimization (PSO) algorithm, and a better model is obtained. The experimental results show that the algorithm has high accuracy and robustness for parking space prediction with a small data sets.

关键词：

Game Theoretic Approaches in Vehicular Networks: A Survey

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Anil, Carie Cao, Dongpu College of Computer Science and Technology Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Engineering VIT-AP AmaravatiAndhra Pradesh522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

—In the era of the Internet of Things (IoT), vehicles and other intelligent components in Intelligent Transportation System (ITS) are connected, forming the Vehicular Networks (VNs) that provide efficient and secure traffic, ubiquitous access to information, and various applications. However, as the number of connected nodes keeps increasing, it is challenging to satisfy various and large amounts of service requests with different Quality of Service (QoS) and security requirements in the highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources so that either an individual or a group objectives can be achieved. Game theory, a theoretical framework designed for strategic interactions among rational decision-makers who faced with scarce resources, can be used to model and analyze individual or group behaviors of communication entities in VNs. This paper primarily surveys the recent advantages of GT used in solving various challenges in VNs. As VNs and GT have been extensively investigate34d, this survey starts with a brief introduction of the basic concept and classification of GT used in VNs. Then, a comprehensive review of applications of GT in VNs is presented, which primarily covers the aspects of QoS and security. Moreover, with the development of fifth-generation (5G) wireless communication, recent contributions of GT to diverse emerging technologies of 5G integrated into VNs are surveyed in this paper. Finally, several key research challenges and possible solutions for applying GT in VNs are outlined. Copyright © 2020, The Authors. All rights reserved.

关键词： Game theory

Incorporating Surprisingly Popular Algorithm and Euclidean Distance-based Adaptive Topology into PSO

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wu, Xuan Han, Jizong Wang, Di Gao, Pengyue Cui, Quanlong Chen, Liang Liang, Yanchun Huang, Han Lee, Heow Pueh Miao, Chunyan Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore State Key Laboratory of Superhard Materials International Center for Computational Method and Software College of Physics Jilin University Changchun130012 China Commercial Quality and Efficiency Department Baidu Inc Beijing100085 China Department of Computer Science Shantou University Shantou515063 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China School of Software Engineering The South China University of Technology Guangzhou510641 China Department of Mechanical Engineering National University of Singapore 117575 Singapore School of Computer Science and Engineering Nanyang Technological University 639798 Singapore College of Software Jilin University Changchun130012 China

While many Particle Swarm Optimization (PSO) algorithms only use fitness to assess the performance of particles, in this work, we adopt Surprisingly Popular Algorithm (SPA) as a complementary metric in addition to fitness. Consequently, particles that are not widely known also have the opportunity to be selected as the learning exemplars. In addition, we propose a Euclidean distance-based adaptive topology to cooperate with SPA, where each particle only connects to k number of particles with the shortest Euclidean distance during each iteration. We also introduce the adaptive topology into heterogeneous populations to better solve large-scale problems. Specifically, the exploration sub-population better preserves the diversity of the population while the exploitation sub-population achieves fast convergence. Therefore, large-scale problems can be solved in a collaborative manner to elevate the overall performance. To evaluate the performance of our method, we conduct extensive experiments on various optimization problems, including three benchmark suites and two real-world optimization problems. The results demonstrate that our Euclidean distance-based adaptive topology outperforms the other widely adopted topologies and further suggest that our method performs significantly better than state-of-the-art PSO variants on small, medium, and large-scale problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Small-world networks

An improved genetic algorithm to optimize vehicle scheduling for relief efforts

学校读者我要写书评

暂无评论

International Journal of Performability engineering 2019年第9期15卷 2356-2363页

作者： Zhou, You Sun, Lecheng Zhou, Xu Parmar, Milan Wang, Liupu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbol Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Cancer Hospital Attached Xinjiang Medical University Urumqi830000 China Faculty of Engineering and Computing Coventry University CoventryCV1 5FB United Kingdom

The vehicle scheduling problem is a typical multi-objective optimization problem. It is a core logistics dispatching problem and the key to realize system optimization. Optimizing vehicle scheduling for relief efforts has important practical significance and can be applied to a broader range of applications. Compared with other vehicle scheduling problems, vehicle optimal scheduling for relief efforts is mostly used to perform spot delivery or security tasks. In this paper, we propose an improved genetic algorithm and apply it to solve the vehicle scheduling problem for relief efforts in the equipment technical area. The experimental results demonstrate the effectiveness and robustness of our proposed algorithm. © 2019 Totem Publisher, Inc. All rights reserved.

关键词： Genetic algorithms