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

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

IEEE Transactions on Mobile Computing 2025年第07期24卷 6315-6332页

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science Faculty of Environment Science and Economy ExeterEX4 4QF United Kingdom Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China University of Oslo Department of Informatics Oslo0316 Norway

Mobile Edge Computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. © 2025 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Joint Pre-Encoding Representation and Sturcture Embedding for Efficient and Low-Resource Knowledge Graph Completion

Joint Pre-Encoding Representation and Sturcture Embedding fo...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Qiu, Chenyu Qian, Pengjiang Wang, Chuang Yao, Jian Liu, Li Fang, Wei Ng, Eddie-Yin-Kwee School of Artificial Intelligence and Computer Science Jiangnan University China Engineering Research Center of Intelligent Technology for Healthcare Ministry of Education Jiangnan University China Big Data Center Affiliated Hospital of Jiangnan University China Nanyang Technological University Singapore

ISBN: (纸本)9798891761643

Knowledge graph completion (KGC) aims to infer missing or incomplete parts in knowledge graph. The existing models are generally divided into structure-based and description-based models, among description-based models often require longer training and inference times as well as increased memory usage. In this paper, we propose Pre-Encoded Masked Language Model (PEMLM) to efficiently solve KGC problem. By encoding textual descriptions into semantic representations before training, the necessary resources are significantly reduced. Furthermore, we introduce a straightforward but effective fusion framework to integrate structural embedding with pre-encoded semantic description, which enhances the model's prediction performance on 1-N relations. The experimental results demonstrate that our proposed strategy attains state-of-the-art performance on the WN18RR (MRR+5.4% and Hits@1+6.4%) and UMLS datasets. Compared to existing models, we have increased inference speed by 30x and reduced training memory by approximately 60%. © 2024 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

UARC:Unsupervised Anomalous Traffic Detection with Improved U-Shaped Autoencoder and RetNet Based Multi-clustering 26th

UARC:Unsupervised Anomalous Traffic Detection with Improved ...

引用

26th International Conference on Information and Communications Security, ICICS 2024

作者： Xie, Yunyang Chen, Kai Li, Shenghui Li, Bingqian Zhang, Ning Hubei Key Laboratory of Distributed System Security Hubei Engin eering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University Technology Wuhan430074 China

ISBN: (纸本)9789819787975

With the ongoing advancement of deep learning, modern network intrusion detection systems increasingly favor utilizing deep learning networks to improve their ability to learn traffic characteristics. To address the challenge of obtaining a substantial amount of labeled training data, many intrusion detection systems now focus on unsupervised anomaly detection methods. Despite this shift, researchers still face the daunting task of distinguishing a significant volume of anomalous traffic and dealing with data imbalance. To address these real-world challenges, we introduce UARC, a system capable of achieving unsupervised anomaly traffic detection through multi-clustering. UARC utilizes an enhanced U-shaped autoencoder and a feature fusion method incorporating Masked Retnet to effectively extract spatiotemporal features from network traffic. It combines these techniques with the HDBSCAN algorithm for multi-clustering of traffic, providing a form of reverse guidance for network learning. Experimental results on multiple datasets demonstrate that UARC can cluster various types of traffic with an impressive accuracy rate of up to 97.96%, while achieving a 99.70% AUC value for anomaly detection. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

Location-guided Head Pose Estimation for Fisheye Image

引用

IEEE Transactions on Cognitive and Developmental Systems 2024年第3期17卷 682-697页

作者： Li, Bing Zhang, Dong Huang, Cheng Xian, Yun Li, Ming Lee, Dah-Jye Sun Yat-sen University School of Electronics and Information Technology China Duke Kunshan University Data Science Research Center Kunshan215316 China Brigham Young University Department of Electric and Computer Engineering United States

Camera with a fisheye or ultra-wide lens covers a wide field of view that cannot be modeled by the perspective projection. Serious fisheye lens distortion in the peripheral region of the image leads to degraded performance of the existing head pose estimation models trained on undistorted images. This paper presents a new approach for head pose estimation that uses the knowledge of head location in the image to reduce the negative effect of fisheye distortion. We develop an end-to-end convolutional neural network to estimate the head pose with the multi-task learning of head pose and head location. Our proposed network estimates the head pose directly from the fisheye image without the operation of rectification or calibration. We also created a fisheye-distorted version of the three popular head pose estimation datasets, BIWI, 300W-LP, and AFLW2000 for our experiments. Experiments results show that our network remarkably improves the accuracy of head pose estimation compared with other state-of-the-art one-stage and two-stage methods. © 2016 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Towards High-throughput and Low-latency Billion-scale Vector Search via CPU/GPU Collaborative Filtering and Re-ranking 23

Towards High-throughput and Low-latency Billion-scale Vector...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Tian, Bing Liu, Haikun Tang, Yuhang Xiao, Shihai Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Xuecang Zhu, Junhua Zhang, Yu National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9781939133458

Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure. Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services. None of modern ANNS systems can address these issues simultaneously. In this paper, we present FusionANNS, a high-throughput, low-latency, cost-efficient, and high-accuracy ANNS system for billion-scale datasets using SSDs and only one entry-level GPU. The key idea of FusionANNS lies in CPU/GPU collaborative filtering and re-ranking mechanisms, which significantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically, we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We implement FusionANNS and compare it with the state-of-the-art SSD-based ANNS system-SPANN and GPU-accelerated in-memory ANNS system-RUMMY. Experimental results show that FusionANNS achieves 1) 9.4-13.1× higher query per second (QPS) and 5.7-8.8× higher cost efficiency compared with SPANN;2) and 2-4.9× higher QPS and 2.3-6.8× higher cost efficiency compared with RUMMY, while guaranteeing low latency and high accuracy. © 2025 FAST. All Rights Reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A Method of Emergency Volunteer Team Internal Participation in Rescue Decision-Making Considering Psychological Behavior

引用

Journal of Systems science and Information 2024年第1期12卷 64-80页

作者： Jie BAI Shengqun CHEN College of Computer and Information Sciences Fujian Agriculture and Forestry UniversityFuzhou 350002China School of Information Engineering Fujian Business UniversityFuzhou 350506China Engineering Research Center of Big Data Analytics for Business Intelligence Fujian Province UniversityFuzhou 350506China

A method for internal participation in rescue decision-making of emergency volunteer teams considering psychological behavior is proposed to address the time sequence of rescue ***,the problem of multi-tasking and multi-operation within the emergency volunteer team is ***,considering that task leaders are influenced by behavioral and psychological factors in the evaluation,the required time for the job is used as a reference point,and the expected time that volunteers can complete the job is used as an attribute *** task leader's prospect satisfaction value for each volunteer is calculated based on prospect theory,and the perceived utility values of disappointment theory and regret theory are calculated to measure the task leader's satisfaction with each ***,a multilayer coded genetic algorithm is used to construct an optimization model for emergency volunteer decision-making with the objective of maximizing the satisfaction ***,the feasibility and effectiveness of this method are illustrated by an example *** result shows that the efficiency of rescue tasks can be improved through decision optimization within the volunteer team.

关键词： emergency volunteers rescue task multi-layer coding genetic algorithm satisfaction value psychological behavior

来源：评论

学校读者我要写书评

暂无评论

RAUIE: A Relation-Augmented Document-Level Event Extraction Model Based on UIE 5

RAUIE: A Relation-Augmented Document-Level Event Extraction ...

引用

5th International Seminar on Artificial Intelligence, Networking and Information Technology, AINIT 2024

作者： Liang, Yiyuan Jia, Hong Wang, Licai Huang, Yangchen Yang, Zhe Big Data Research and Development Center North China Institute of Computing Technology Beijing China Tsinghua University Department of Computer Science and Technology Beijing China The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350385557

In document-level event extraction tasks, multiple event types often coexist within a document (the multi-event problem), and arguments may play different roles across different events (the argument intertwining problem). Existing methods often suffer from significantly reduced event extraction accuracy, mainly when focusing on scenarios with scarce annotated data and imbalanced event-type distributions. This paper emphasizes enhancing the correlation between event triggers and arguments to address these challenges. Therefore, we propose the Relation-Augmented UIE Model (RADIE), which introduces entity relationships into prompts using prompt-based learning and designs a relation-augmentation algorithm to improve the accuracy and completeness of event extraction. Experimental results demonstrate that this approach significantly outperforms baseline methods, mainly showcasing excellent performance on datasets with long-tail distributions. © 2024 IEEE.

关键词： document-level event extraction relation augment Universal Information Extraction

来源：评论

学校读者我要写书评

暂无评论

FedRKG: A Privacy-Preserving Federated Recommendation Framework via Knowledge Graph Enhancement 18th

FedRKG: A Privacy-Preserving Federated Recommendation Framew...

引用

18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023

作者： Yao, Dezhong Liu, Tongtong Cao, Qi Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Computing Science University of Glasgow Glasgow United Kingdom

ISBN: (纸本)9789819998951

Federated Learning (FL) has emerged as a promising approach for preserving data privacy in recommendation systems by training models locally. Recently, Graph Neural Networks (GNN) have gained popularity in recommendation tasks due to their ability to capture high-order interactions between users and items. However, privacy concerns prevent the global sharing of the entire user-item graph. To address this limitation, some methods create pseudo-interacted items or users in the graph to compensate for missing information for each client. Unfortunately, these methods introduce random noise and raise privacy concerns. In this paper, we propose FedRKG, a novel federated recommendation system, where a global knowledge graph (KG) is constructed and maintained on the server using publicly available item information, enabling higher-order user-item interactions. On the client side, a relation-aware GNN model leverages diverse KG relationships. To protect local interaction items and obscure gradients, we employ pseudo-labeling and Local Differential Privacy (LDP). Extensive experiments conducted on three real-world datasets demonstrate the competitive performance of our approach compared to centralized algorithms while ensuring privacy preservation. Moreover, FedRKG achieves an average accuracy improvement of 4% compared to existing federated learning baselines. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Self-training through Classifier Disagreement for Cross-Domain Opinion Target Extraction 23

Self-training through Classifier Disagreement for Cross-Doma...

引用

2023 World Wide Web Conference, WWW 2023

作者： Sun, Kai Zhang, Richong Samuel, Mensah Nikolaos, Aletras Mao, Yongyi Liu, Xudong Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China Department of Computer Science University of Sheffield Sheffield United Kingdom School of Electrical Engineering and Computer Science University of Ottawa Ottawa Canada

ISBN: (纸本)9781450394161

Opinion target extraction (OTE) or aspect extraction (AE) is a fundamental task in opinion mining that aims to extract the targets (or aspects) on which opinions have been expressed. Recent work focus on cross-domain OTE, which is typically encountered in real-world scenarios, where the testing and training distributions differ. Most methods use domain adversarial neural networks that aim to reduce the domain gap between the labelled source and unlabelled target domains to improve target domain performance. However, this approach only aligns feature distributions and does not account for class-wise feature alignment, leading to suboptimal results. Semi-supervised learning (SSL) has been explored as a solution, but is limited by the quality of pseudo-labels generated by the model. Inspired by the theoretical foundations in domain adaptation [2], we propose a new SSL approach that opts for selecting target samples whose model output from a domain-specific teacher and student network disagree on the unlabelled target data, in an effort to boost the target domain performance. Extensive experiments on benchmark cross-domain OTE datasets show that this approach is effective and performs consistently well in settings with large domain shifts. © 2023 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

HUSS:A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

引用

data Intelligence 2023年第3期5卷 537-559页

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S.Sheng Key Laboratory of Knowledge Engineering with Big Data(the Ministry of Education of China) Hefei University of TechnologyChinaSchool of Computer Science and Information EngineeringHefei University of TechnologyHefeiChina Research Institute of Artificial Intelligence Zhejiang LabHangzhouChina Department of Computer Science Texas Tech UniversityLubbockTX 79409USA

Spreadsheets contain a lot of valuable data and have many practical *** key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets,e.g.,identifying cell function types and discovering relationships between cell *** existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells.A few studies do,but they ignore the layout structure information of spreadsheets,which affects the performance of cell function classification and the discovery of different relationship types of cell *** this paper,we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets(HUSS).Specifically,for improving the cell function classification,we propose an error correction mechanism(ECM)based on an existing cell function classification model[11]and the layout features of *** improving the table structure analysis,we propose five types of heuristic rules to extract four different types of cell pairs,based on the cell style and spatial location *** experimental results on five real-world datasets demonstrate that HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Spreadsheet semantic structure Information extraction Heuristics Cell function analysis Table structure analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：