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

UAV Deployment Optimization in UAV-assisted Wireless Communications

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Xueqi Wang, Aimin Sun, Geng Liu, Lingling Zhang, Jing 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 Communication Engineering Jilin University Changchun130012 China

Due to the fact that the locations of base stations (BSs) cannot be changed after they are installed, it is very difficult to communicate directly with remote user equipment (UE), which will directly affect the lifespan of the system. Unmanned aerial vehicles (UAVs) offer a hopeful solution as mobile relays for fifth-generation wireless communications due to the flexible and cost-effective deployment. However, with the limited onboard energy of UAV and slow progress in energy storage technology, it is a key challenge to achieve the energy-efficient communication. Therefore, in this article, we study a wireless communication network using a UAV as a high-altitude relay, and formulate a UAV relay deployment optimization problem (URDOP) to minimize the energy consumption of system by optimizing the deployment of UAV, including the locations and number of UAV hover points. Since the formulated URDOP is a mixed-integer programming problem, it presents a significant challenge for conventional gradient-based approaches. To this end, we propose a self-adaptive differential evolution with a variable population size (SaDEVPS) algorithm to solve the formulated URDOP. The performance of proposed SaDEVPS is verified through simulations, and the results show that it can successfully decrease the energy consumption of system when compared to other benchmark algorithms across multiple instances. Copyright © 2024, The Authors. All rights reserved.

关键词： Unmanned aerial vehicles (UAV)

Verifying Diagnosability of Discrete Event System with Logical Formula

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2020年第2期29卷 304-311页

作者： GENG Xuena OUYANG Dantong HAN Cheng College of Computer Science and Technology Changchun University of Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering for Ministry of Education Jilin University

Diagnosability is an important property in the field of fault diagnosis. In this paper, a novel approach based on logical formula is proposed to verify diagnosability of Discrete event systems(DESs). CNFFSM is defined to represent a new model for DES. Each transition in DES can be described as a clause. According to CNF-FSM, we construct a CNF-diagnoser. Based on the resolution principle and CNF-diagnoser, an algorithm is presented to test whether the failure events can be detected or not in a finite number of observable *** algorithm can be applied in both off-line diagnosis and on-line diagnosis. Experimental results show that our algorithm can solve the diagnosability problem efficiently.

关键词： Fault diagnosis Diagnosability Discrete event system Finite state machine Conjunctive normal form

Enhancing Unsupervised Graph Few-shot Learning via Set Functions and Optimal Transport

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Yonghao Giunchiglia, Fausto Li, Ximing Huang, Lan Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

Graph few-shot learning has garnered significant attention for its ability to rapidly adapt to downstream tasks with limited labeled data, sparking considerable interest among researchers. Recent advancements in graph few-shot learning models have exhibited superior performance across diverse applications. Despite their successes, several limitations still exist. First, existing models in the meta-training phase predominantly focus on instance-level features within tasks, neglecting crucial set-level features essential for distinguishing between different categories. Second, these models often utilize query sets directly on classifiers trained with support sets containing only a few labeled examples, overlooking potential distribution shifts between these sets and leading to suboptimal performance. Finally, previous models typically require necessitate abundant labeled data from base classes to extract transferable knowledge, which is typically infeasible in real-world scenarios. To address these issues, we propose a novel model named STAR, which leverages Set funcTions and optimAl tRansport for enhancing unsupervised graph few-shot learning. Specifically, STAR utilizes expressive set functions to obtain set-level features in an unsupervised manner and employs optimal transport principles to align the distributions of support and query sets, thereby mitigating distribution shift effects. Theoretical analysis demonstrates that STAR can capture more task-relevant information and enhance generalization capabilities. Empirically, extensive experiments across multiple datasets validate the effectiveness of STAR. Our code can be found here. Copyright © 2025, The Authors. All rights reserved.

关键词： Zero-shot learning

Reconsidering Feature Structure Information and Latent Space Alignment in Partial Multi-label Feature Selection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Pan, Hanlin Liu, Kunpeng Gao, Wanfu College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China Department of Computer Science Portland State University PortlandOR97201 United States

The purpose of partial multi-label feature selection is to select the most representative feature subset, where the data comes from partial multi-label datasets that have label ambiguity issues. For label disambiguation, previous methods mainly focus on utilizing the information inside the labels and the relationship between the labels and features. However, the information existing in the feature space is rarely considered, especially in partial multi-label scenarios where the noises is considered to be concentrated in the label space while the feature information is correct. This paper proposes a method based on latent space alignment, which uses the information mined in feature space to disambiguate in latent space through the structural consistency between labels and features. In addition, previous methods overestimate the consistency of features and labels in the latent space after convergence. We comprehensively consider the similarity of latent space projections to feature space and label space, and propose new feature selection term. This method also significantly improves the positive label identification ability of the selected features. Comprehensive experiments demonstrate the superiority of the proposed method. Copyright © 2025, The Authors. All rights reserved.

关键词： Feature extraction

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering The Ministry of Education China

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

Automating Discussion Structure Re-Organization for Github Issues

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Bai, Shuotong Liu, Lei Meng, Chenkun Liu, Huaxiao College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China

As a popular social code hosting platform, GitHub encourages developers to discuss and leave opinions on issues for better repository development and closer team collaboration. However, popular issues can be bloated over the time, in particular, the linear format of GitHub issue discussions makes it difficult for developers to organize and extract useful information. For a better understanding of GitHub issue discussions, we first conduct an empirical study. Among the 14 most-starred repositories, we notice that 16,740 issues contain more than 10 comments. Then, more commented issue discussions refer to additional repository contributions and draw more developer attention. Hence, we narrow our perspective to the issue discussions with more than 10 comments. For 50.29% of these popular discussions, the topics of content are subject to change explicitly, and more than 36% of consecutive comment pairs do not host response relationships. In addition, just 40% of the comments on GitHub use the @ or quoting functions when commenting on other people's comments, but these functions are not only used for responding, but also for referencing, informing others, etc. Based on these results, these popular discussions suffer from intertwined content of various topics and ambiguous response linkage. To mitigate the situation, we propose a new approach IRA to automatically re-organize GitHub issue discussions, aiming at converting an issue discussion with the linear structure into a discussion tree with key information. The experimental results show that our approach outperforms other baselines, and achieves an average improvement of 19.97%, 14,25% on metrics of ACC and F1-score in the task of predicting response relationships, as well as gets 15.78%, 51.72%, 26.92%, 21.03%, 22.08%, 25.59% improvement in terms of parent accuracy, Variation of Information, One-to-One Overlap, and all Exact Match metrics in the re-organizing task. To investigate human perspectives on our re-organized

关键词： Deep learning

Unsupervised Sentence Representation Learning with Frequency-induced Adversarial Tuning and Incomplete Sentence Filtering

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Bing Li, Ximing Yang, Zhiyao Guan, Yuanyuan Li, Jiayin Wang, Shengsheng College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China School of Humanities Jilin University China

Pre-trained Language Model (PLM) is nowadays the mainstay of Unsupervised Sentence Representation Learning (USRL). However, PLMs are sensitive to the frequency information of words from their pre-training corpora, resulting in anisotropic embedding space, where the embeddings of high-frequency words are clustered but those of low-frequency words disperse sparsely. This anisotropic phenomenon results in two problems of similarity bias and information bias, lowering the quality of sentence embeddings. To solve the problems, we fine-tune PLMs by leveraging the frequency information of words and propose a novel USRL framework, namely Sentence Representation Learning with Frequency-induced Adversarial tuning and Incomplete sentence filtering (SLT-FAI). We calculate the word frequencies over the pre-training corpora of PLMs and assign words thresholding frequency labels. With them, (1) we incorporate a similarity discriminator used to distinguish the embeddings of high-frequency and low-frequency words, and adversarially tune the PLM with it, enabling to achieve uniformly frequency-invariant embedding space;and (2) we propose a novel incomplete sentence detection task, where we incorporate an information discriminator to distinguish the embeddings of original sentences and incomplete sentences by randomly masking several low-frequency words, enabling to emphasize the more informative low-frequency words. Our SLT-FAI is a flexible and plug-and-play framework, and it can be integrated with existing USRL techniques. We evaluate SLT-FAI with various backbones on benchmark datasets. Empirical results indicate that SLT-FAI can be superior to the existing USRL baselines. Our code is released in https://***/wangbing1416/SLT-FAI. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

DeciLS-PBO: an Effective Local Search Method for Pseudo-Boolean Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Luyu Ouyang, Dantong Zhang, Qi Zhang, Liming 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

Local search is an effective method for solving large-scale combinatorial optimization problems, and it has made remarkable progress in recent years through several subtle mechanisms. In this paper, we found two ways to improve the local search algorithms in solving Pseudo-Boolean Optimization(PBO): Firstly, some of those mechanisms such as unit propagation are merely used in solving MaxSAT before, which can be generalized to solve PBO as well;Secondly, the existing local search algorithms utilize the heuristic on variables, so-called score, to mainly guide the search. We attempt to gain more insights into the clause, as it plays the role of a middleman who builds a bridge between variables and the given formula. Hence, we first extended the combination of unit propagation-based decimation algorithm to PBO problem, giving a further generalized definition of unit clause for PBO problem, and apply it to the existing solver LS-PBO for constructing an initial assignment;then, we introduced a new heuristic on clauses, dubbed care, to set a higher priority for the clauses that are less satisfied in current iterations. Experiments on benchmarks from the most recent PB Competition, as well as three real-world application benchmarks including minimum-width confidence band, wireless sensor network optimization, and seating arrangement problems show that our algorithm DeciLS-PBO has a promising performance compared to the state-of-the-art algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Wireless sensor networks

LLM-Powered User Simulator for Recommender System

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Zijian Liu, Shuchang Liu, Ziru Zhong, Rui Cai, Qingpeng Zhao, Xiangyu Zhang, Chunxu Liu, Qidong Jiang, Peng Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China Kuaishou Technology China City University of Hong Kong Hong Kong Xi’an Jiaotong University China

User simulators can rapidly generate a large volume of timely user behavior data, providing a testing platform for reinforcement learning-based recommender systems, thus accelerating their iteration and optimization. However, prevalent user simulators generally suffer from significant limitations, including the opacity of user preference modeling and the incapability of evaluating simulation accuracy. In this paper, we introduce an LLM-powered user simulator to simulate user engagement with items in an explicit manner, thereby enhancing the efficiency and effectiveness of reinforcement learning-based recommender systems training. Specifically, we identify the explicit logic of user preferences, leverage LLMs to analyze item characteristics and distill user sentiments, and design a logical model to imitate real human engagement. By integrating a statistical model, we further enhance the reliability of the simulation, proposing an ensemble model that synergizes logical and statistical insights for user interaction simulations. Capitalizing on the extensive knowledge and semantic generation capabilities of LLMs, our user simulator faithfully emulates user behaviors and preferences, yielding high-fidelity training data that enrich the training of recommendation algorithms. We establish quantifying and qualifying experiments on five datasets to validate the simulator’s effectiveness and stability across various recommendation scenarios. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning