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

Aerial Secure Collaborative Communications under Eavesdropper Collusion in Low-altitude Economy: A Generative Swarm Intelligent Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Jiahui Sun, Geng Wu, Qingqing Liang, Shuang Wang, Jiacheng Niyato, Dusit Kim, Dong In 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 College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China School of Information Science and Technology Northeast Normal University Changchun130117 China Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

The rapid development of the low-altitude economy (LAE) has significantly increased the utilization of autonomous aerial vehicles (AAVs) in various applications, necessitating efficient and secure communication methods among AAV swarms. In this work, we aim to introduce distributed collaborative beamforming (DCB) into AAV swarms and handle the eavesdropper collusion by controlling the corresponding signal distributions. Specifically, we consider a two-way DCB-enabled aerial communication between two AAV swarms and construct these swarms as two AAV virtual antenna arrays. Then, we minimize the two-way known secrecy capacity and maximum sidelobe level to avoid information leakage from the known and unknown eavesdroppers, respectively. Simultaneously, we also minimize the energy consumption of AAVs when constructing virtual antenna arrays. Due to the conflicting relationships between secure performance and energy efficiency, we consider these objectives by formulating a multi-objective optimization problem, which is NP-hard and with a large number of decision variables. Accordingly, we design a novel generative swarm intelligence (GenSI) framework to solve the problem with less overhead, which contains a conditional variational autoencoder (CVAE)-based generative method and a proposed powerful swarm intelligence algorithm. In this framework, CVAE can collect expert solutions obtained by the swarm intelligence algorithm in other environment states to explore characteristics and patterns, thereby directly generating high-quality initial solutions in new environment factors for the swarm intelligence algorithm to search solution space efficiently. Simulation results show that the proposed swarm intelligence algorithm outperforms other state-of-the-art baseline algorithms, and the GenSI can achieve similar optimization results by using far fewer iterations than the ordinary swarm intelligence algorithm. Experimental tests demonstrate that introducing the CVAE mechanism ach

关键词： Multiobjective optimization

Document-Level Relation Extraction with Entity Type Constraints

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Han, Ridong Peng, Tao Zhu, BeiBei Bi, Haijia Han, Jiayu Liu, Lu College of Computer Science and Technology Jilin University Jilin Changchun130012 China College of Software Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Changchun130012 China College of Computer and Artificial Intelligence Liaoning Normal University Liaoning Dalian116081 China Department of Linguistics University of Washington SeattleWA98195 United States

Long-tail problem and multi-label problem are two commonly encountered challenges in document-level relation extraction task. Current efforts are concerned with enhancing the representations of entity pairs through Transformer or document graphs, which cannot tackle the above challenges well. Relation correlations are a potential solution, which allows head relations to assist in the training of tail ones by transferring correlation knowledge between them, and can measure the semantic distance between relations to assist the classifier in assigning multiple semantically similar relations to multi-label instances. This paper proposes to learn relation correlations from both global and local views using entity type constraints, which means that the subject-object entity types limit the scope of possible relations. Globally, we statistically construct the Type-constrained Graph between entity types and relations, which formulates all possible subject/object types for each relation. Different relations are connected by common entity types, reflecting the desired correlations. Locally, given an entity pair, the classification probability of relations matching its entity types should be greater than those unmatched. Therefore, the Type-constrained Loss is proposed to make the matched relations have greater probabilities. Detailed experiments are conducted on DocRED and DWIE datasets, and our model significantly outperforms baselines under long-tail and multi-label setups. © 2024, The Authors. All rights reserved.

关键词： Extraction

When Federated Recommendation Meets Cold-Start Problem: Separating Item Attributes and User Interactions

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Chunxu Zhang, Zijian Long, Guodong Yan, Peng Zhou, Tianyi Yang, Bo College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun China College of Computer Science and Technology Jilin University City University of Hong Kong China Australian Artificial Intelligence Institute FEIT University of Technology Sydney Sydney Australia Computer Science and UMIACS University of Maryland Maryland United States

Federated recommendation systems usually trains a global model on the server without direct access to users’ private data on their own devices. However, this separation of the recommendation model and users’ private data poses a challenge in providing quality service, particularly when it comes to new items, namely cold-start recommendations in federated settings. This paper introduces a novel method called Item-aligned Federated Aggregation (IFedRec) to address this challenge. It is the first research work in federated recommendation to specifically study the cold-start scenario. The proposed method learns two sets of item representations by leveraging item attributes and interaction records simultaneously. Additionally, an item representation alignment mechanism is designed to align two item representations and learn the meta attribute network at the server within a federated learning framework. Experiments on four benchmark datasets demonstrate IFedRec’s superior performance for cold-start scenarios. Furthermore, we also verify IFedRec owns good robustness when the system faces limited client participation and noise injection, which brings promising practical application potential in privacy-protection enhanced federated recommendation systems. The implementation code is available1 Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xiao, Yubin Wang, Di Wu, Xuan Wu, Yuesong Li, Boyang Du, Wei Wang, Liupu Zhou, You 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 639956 Singapore WeBank-NTU Joint Research Institute on Fintech Nanyang Technological University 639956 Singapore College of Computing and Data Science Nanyang Technological University 639956 Singapore

Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but may often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention weight pattern of the model towards familiar ones discovered during training when solving VRPs of varying sizes. The DS decoder explicitly models VRPs of multiple training distribution patterns through multiple auxiliary light decoders, expanding the model representation space to encompass a broader range of distributional scenarios. We conduct extensive experiments on both synthetic and widely recognized real-world benchmarking datasets and compare the performance with seven baseline models. The results demonstrate the effectiveness of using ESF and DS decoder to obtain a more generalizable model and showcase their applicability to solve different VRP variants, i.e., travelling salesman problem and capacitated VRP. Notably, our proposed generic components require minimal computational resources, and can be effortlessly integrated into conventional generalization strategies to further elevate model generalization. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

FastClass: A Time-Efficient Approach to Weakly-Supervised Text Classification

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Xia, Tingyu Wang, Yue Tian, Yuan Chang, Yi School of Artificial Intelligence Jilin University China School of Information and Library Science University of North Carolina Chapel Hill United States Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University China International Center of Future Science Jilin University China

Weakly-supervised text classification aims to train a classifier using only class descriptions and unlabeled data. Recent research shows that keyword-driven methods can achieve state-of-the-art performance on various tasks. However, these methods not only rely on carefully-crafted class descriptions to obtain class-specific keywords but also require substantial amount of unlabeled data and takes a long time to train. This paper proposes FastClass, an efficient weakly-supervised classification approach. It uses dense text representation to retrieve class-relevant documents from external unlabeled corpus and selects an optimal subset to train a classifier. Compared to keyword-driven methods, our approach is less reliant on initial class descriptions as it no longer needs to expand each class description into a set of class-specific keywords. Experiments on a wide range of classification tasks show that the proposed approach frequently outperforms keyword-driven models in terms of classification accuracy and often enjoys orders-of-magnitude faster training speed. Copyright © 2022, The Authors. All rights reserved.

关键词： Classification (of information)

A Task Processing Efficiency Improvement Scheme Based on Cloud-Edge Architecture in Dense Computing Environments

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Feng, Jiahui Qi, Jingze Liu, Yuanning Liu, Zhen 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 Graduate School of Engineering Nagasaki Institute of Applied Science 536 Aba-machi Nagasaki851-0193 Japan

As cloud-edge architecture combines low latency and high-performance computing, it has a wider range of application scenarios. Considering that, how to reasonably allocate tasks to the edge cloud or the central cloud and how to select appropriate virtual machines (VMs) for tasks are two key aspects affecting the efficiency of cloud-edge architecture. For the former, the ARDT algorithm is proposed, which dynamically adjusts the optimal threshold by predicting the number of real-time edge-end devices. For the latter, we design the DBMR algorithm based on the Max-Fit algorithm, in which we propose a structure of blocking to reduce the time complexity of the original algorithm from O(n2) to O(n(n-m)). Experimental results show that the ARDT-DBMR algorithm optimizes the average processing time and task failure rate by 30%-40% compared with the baseline algorithms and other advanced algorithms and significantly improves the problem of abnormal fluctuations in VM utilization in dense computing environments. © 2022, The Authors. All rights reserved.

关键词： Virtual machine

JC5A: Service Delay Minimization for Aerial MEC-assisted Industrial Cyber-Physical Systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Sun, Geng Wu, Jiaxu Sun, Zemin He, Long Wang, Jiacheng Niyato, Dusit Jamalipour, Abbas Mao, Shiwen 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 School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore School of Electrical and Computer Engineering The University of Sydney SydneyNSW2006 Australia Department of Electrical and Computer Engineering Auburn University Auburn United States

In the era of the sixth generation (6G) and industrial Internet of Things (IIoT), an industrial cyber-physical system (ICPS) drives the proliferation of sensor devices and computing-intensive tasks. To address the limited resources of IIoT sensor devices, unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) has emerged as a promising solution, providing flexible and cost-effective services in close proximity of IIoT sensor devices (ISDs). However, leveraging aerial MEC to meet the delay-sensitive and computation-intensive requirements of the ISDs could face several challenges, including the limited communication, computation and caching (3C) resources, stringent offloading requirements for 3C services, and constrained on-board energy of UAVs. To address these issues, we first present a collaborative aerial MEC-assisted ICPS architecture by incorporating the computing capabilities of the macro base station (MBS) and UAVs. We then formulate a service delay minimization optimization problem (SDMOP). Since the SDMOP is proved to be an NP-hard problem, we propose a joint computation offloading, caching, communication resource allocation, computation resource allocation, and UAV trajectory control approach (JC5A). Specifically, JC5A consists of a block successive upper bound minimization method of multipliers (BSUMM) for computation offloading and service caching, a convex optimization-based method for communication and computation resource allocation, and a successive convex approximation (SCA)-based method for UAV trajectory control. Moreover, we theoretically prove the convergence and polynomial complexity of JC5A. Simulation results demonstrate that the proposed approach can achieve superior system performance compared to the benchmark approaches and algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

SSBM: A Signed Stochastic Block Model for Multiple Structure Discovery in Large-Scale Exploratory Signed Networks

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Yang Yang, Bo Zhao, Xuehua Yang, Zhejian Chen, Hechang Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China Aviation University of Air Force Changchun130062 China School of Digital Media Shenzhen Institute of Information Technology Shenzhen518055 China School of Artificial Intelligence Jilin University Changchun130012 China

Signed network structure discovery has received extensive attention and has become a research focus in the field of network science. However, most of the existing studies are focused on the networks with a single structure, e.g., community or bipartite, while ignoring multiple structures, e.g., the coexistence of community and bipartite structures. Furthermore, existing studies were faced with challenge regarding large-scale signed networks due to their high time complexity, especially when determining the number of clusters in the observed network without any prior knowledge. In view of this, we propose a mathematically principled method for signed network multiple structure discovery named the Signed Stochastic Block Model (SSBM). The SSBM can capture the multiple structures contained in signed networks, e.g., community, bipartite, and coexistence of them, by adopting a probabilistic model. Moreover, by integrating the minimum message length (MML) criterion and component-wise EM (CEM) algorithm, a scalable learning algorithm that has the ability of model selection is proposed to handle large-scale signed networks. By comparing state-of-the-art methods on synthetic and realworld signed networks, extensive experimental results demonstrate the effectiveness and efficiency of SSBM in discovering large-scale exploratory signed networks with multiple structures. Copyright © 2023, The Authors. All rights reserved.

关键词： Stochastic models

Practical two-party privacy-preserving neural network based on secret sharing

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ge, Zhengqiang Zhou, Zhipeng Guo, Dong Li, Qiang College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun China

Neural networks, with the capability to provide efficient predictive models, have been widely used in medical, financial, and other fields, bringing great convenience to our lives. However, the high accuracy of the model requires a large amount of data from multiple parties, raising public concerns about privacy. Privacy-preserving neural network based on multi-party computation is one of the current methods used to provide model training and inference under the premise of solving data privacy. In this study, we propose a new two-party privacy-preserving neural network training and inference framework in which privacy data is distributed to two non-colluding servers. We construct a preprocessing protocol for mask generation, support and realize secret sharing comparison on 2PC, and propose a new method to further reduce the communication rounds. Based on the comparison protocol, we construct building blocks such as division and exponential, and realize the process of training and inference that no longer needs to convert between different types of secret sharings and is entirely based on arithmetic secret sharing. Compared with the previous works, our work obtains higher accuracy, which is very close to that of plaintext training. While the accuracy has been improved, the runtime is reduced, considering the online phase, our work is 5× faster than SecureML, 4.32-5.75× faster than SecureNN, and is very close to the current optimal 3PC implementation, FALCON. For secure inference, as far as known knowledge is concerned, we should be the current optimal 2PC implementation, which is 4-358× faster than other works. © 2021, CC BY.

关键词： Neural networks