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

Efficient Cache Retrieving Scheme in VANET via Online Reinforcement Learning

IEEE Transactions on Vehicular technology 2025年

作者： Tan, Zhenhao Chen, Bin Li, Ruidong Yang, Lei Xu, Xiaohua University of Science and Technology of China School of Computer Science and Technology Hefei230026 China Kanazawa University Institute of Science and Engineering Ishikawa920-1192 Japan South China University of Technology School of Software Engineering Guangdong510640 China

The implementation of intelligent driving technology is inseparable from reliable wireless communication and efficient cache scheduling in Vehicle Ad-hoc Networks (VANETs). The purpose of cache scheduling in VANETs is to provide efficient and fast data services to vehicles. In response to difficult to handle wireless communication interference and high requirements for communication delay and energy consumption optimization in vehicle-road cooperation, we propose a new communication model of "Retrieving-Cast"to simplify the cache scheduling process oriented by data requirements. In V2I mode, consider the uplink of all roadside units(RSUs) retrieving data from vehicles, and prioritize data retrieving based on factors such as the number, density, and urgency of vehicles within the communication coverage range of RSUs. We hope that as many high-priority RSUs as possible to complete cached data retrieving as soon as possible under wireless communication interference. To overcome the limitations of traditional heuristic algorithms with low scheduling efficiency and deep learning methods requiring a large amount of training data, we propose a double-online reinforcement learning method, which efficiently solves the cache retrieval scheduling problem. Through experiments and analysis, our method achieved better scheduling results compared to traditional approximation algorithms and single greedy Deep Q-learning methods. The designed data transformation method also addresses the issue of requiring a large amount of training data, enabling rapid computation of scheduling requests in the network at an extremely low training cost, meeting the low-latency computation requirements in VANETs. © 1967-2012 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case

arXiv

引用

arXiv 2025年

作者： Bao, Lingchan Wei, Tong Wan, Yuanyu School of Computer Science and Engineering Southeast University Nanjing211189 China School of Software Technology Zhejiang University Ningbo315100 China

We revisit multi-agent asynchronous online optimization with delays, where only one of the agents becomes active for making the decision at each round, and the corresponding feedback is received by all the agents after unknown delays. Although previous studies have established an O(√dT) regret bound for this problem, they assume that the maximum delay d is knowable or the arrival order of feedback satisfies a special property, which may not hold in practice. In this paper, we surprisingly find that when the loss functions are strongly convex, these assumptions can be eliminated, and the existing regret bound can be significantly improved to O(dlog T) meanwhile. Specifically, to exploit the strong convexity of functions, we first propose a delayed variant of the classical follow-the-leader algorithm, namely FTDL, which is very simple but requires the full information of functions as feedback. Moreover, to handle the more general case with only the gradient feedback, we develop an approximate variant of FTDL by combining it with surrogate loss functions. Experimental results show that the approximate FTDL outperforms the existing algorithm in the strongly convex case. Copyright © 2025, The Authors. All rights reserved.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

Weighted layer aggregation with fast and local label expanding method for community detection in multiplex networks

引用

Physica A: Statistical Mechanics and its Applications 2025年 670卷

作者： Shahgholi, Pouya Bouyer, Asgarali Arasteh, Bahman Liu, Xiaoyang Department of software engineering Azarbaijan Shahid Madani University Tabriz Iran Department of software engineering Faculty of Engineering and Natural Science Istinye University İstanbul Turkey Department of Computer Science Khazar University Baku Azerbaijan School of Computer Science and Engineering Chongqing University of Technology Chongqing400054 China

Community detection in multiplex networks has emerged as a crucial research area due to its ability to capture complex interactions across multiple layers of interconnected data. Despite significant advancements, existing methods often face critical challenges, including computational time, resolution limit, free parameter tuning, training models, etc. To overcome these limitations, this paper presents LCDMN (Layer-Coupled Diffusion for Multiplex Networks) algorithm designed for accurate and efficient community detection in multiplex networks. LCDMN employs dynamic scaling and layer coupling to adaptively identify community structures across diverse network configurations, offering improved resilience to network's density and structural ambiguity. LCDMN addresses the challenges of layer diversity by: (1) dynamically weighting layers based on critical parameters such as layer correlation, layer nodes activity variance, and attractiveness, (2) developing a robust node scoring method, (3) the aggregating layers of multiplex network into a single-layer, weighted graph, (4) employing a label diffusion approach with mechanisms for handling overlapping nodes, and (5) refining community structures through a dynamic merging process that adaptively adjusts layer contributions and community boundaries during execution, ensuring context-sensitive resolution of structural ambiguity. Nodes and edges are scored using network topology and structural metrics to efficiently incorporate in label diffusion process for detecting initial communities. The approach balances computational efficiency with precision, enabling the detection of cohesive and well-defined communities in complex networks. Experimental evaluations on real-world and synthetic multiplex networks demonstrate that LCDMN consistently outperforms state-of-the-art methods, such as Infomap, MDLPA, MPBTV, LART, DGFM3 and GenLouvain, in terms of Normalized Mutual Information (NMI), Adjusted Rand Index (ARI), and modularity.

关键词： Community detection Label diffusion Layer aggregation Multiplex networks Similarity

来源：评论

学校读者我要写书评

暂无评论

DALC: Distributed Arithmetic Coding Aided by Linear Codes

arXiv

引用

arXiv 2025年

作者： Zhou, Junwei Xiao, HaoYun Xiang, Jianwen Lin, Qiuzhen The School of Computer Science and Artificial Intelligence Wuhan University of Technology Wuhan China College of Computer Science and Software Engineering Shenzhen University China

Distributed Arithmetic Coding (DAC) has emerged as a feasible solution to the Slepian-Wolf problem, particularly in scenarios with non-stationary sources and for data sequences with lengths ranging from small to medium. Due to the inherent decoding ambiguity in DAC, the number of candidate paths grows exponentially with the increase in source length. To select the correct decoding path from the set of candidates, DAC decoders utilize the Maximum A Posteriori (MAP) metric to rank the decoding sequences, outputting the path with the highest MAP metric as the decoding result of the decoder. However, this method may still inadvertently output incorrect paths that have a MAP metric higher than the correct decoding path, despite not being the correct decoding path. To address the issue, we propose Distributed Arithmetic Coding Aided by Linear Codes (DALC), which employs linear codes to constrain the decoding process, thereby eliminating some incorrect paths and preserving the correct one. During the encoding phase, DALC generates the parity bits of the linear code for encoding the source data. In the decoding phase, each path in the set of candidate paths is verified in descending order according to the MAP metric until a path that meets the verification criteria is encountered, which is then outputted as the decoding result. DALC enhances the decoding performance of DAC by excluding candidate paths that do not meet the constraints imposed by linear codes. Our experimental results demonstrate that DALC reduces the Bit Error Rate(BER), with especially improvements in skewed source data scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

OMLog: Online Log Anomaly Detection for Evolving System with Meta-learning

引用

IEEE Internet of Things Journal 2025年

作者： Tian, Jiyu Li, Mingchu Wang, Zumin Chen, Liming Qin, Jing Zhang, Runfa Dalian University of Technology School of Software Technology Dalian China Jiangxi Normal University School of Computer and Information Engineering Jiangxi Nanchang China Dalian University College of Information Engineering Dalian China Dalian University of Technology School of Computer Science and Technology Dalian China Dalian University School of Software Engineering Dalian China Shanxi University School of Automation and Software Engineering Taiyuan China

Log anomaly detection (LAD) is essential to ensure the safe and stable operation of Cyeber-physical systems. Although current LAD methods exhibit significant potential in addressing challenges posed by unstable log events and temporal sequence patterns, their limitations in detection efficiency and generalization ability present a formidable challenge when dealing with evolving systems. To construct a real-time and reliable online log anomaly detection model, we propose OMLog, a semi-supervised online meta-learning method, to effectively tackle the distribution shift issue caused by changes in log event types and frequencies. Specifically, we introduce a maximum mean discrepancy-based distribution shift detection method to identify distribution changes in unseen log sequences. Depending on the identified distribution gap, the method can automatically trigger online fine-grained detection or offline fast inference. Furthermore, we design an online learning mechanism based on meta-learning, which can effectively learn the highly repetitive patterns of log sequences in the feature space, thereby enhancing the generalization ability of the model to evolving data. Extensive experiments conducted on two publicly available log datasets, HDFS and BGL, validate the effectiveness of the OMLog approach. When trained using only normal log sequences, the proposed approach achieves the F1-Score of 93.7% and 64.9%, respectively, surpassing the performance of the state-of-the-art (SOTA) LAD methods and demonstrating superior detection efficiency. © 2014 IEEE.

关键词： Log Anomaly Detection Maximum Mean Discrepancy Meta-learning Online Learning

来源：评论

学校读者我要写书评

暂无评论

DAISY: Dual-Granularity Contrastive Learning for Disease Similarity Prediction

IEEE Transactions on Computational Biology and Bioinformatic...

引用

IEEE Transactions on Computational Biology and Bioinformatics 2025年第2期22卷 757-768页

作者： Zihao Gao Huifang Ma Yike Wang Zhixin Li Liang Chang College of Computer Science and Engineering Northwest Normal University Lanzhou China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China School of Computer Science and Engineering Guangxi Normal University Guilin China School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China

The quantification of similarities among human diseases is crucial for enhancing our understanding of disease biology, which can aid in improving disease diagnosis, prognosis and treatment, and drug development. Recently, efforts have been devoted to quantifying disease similarity by integrating multi-view data sources from disparate biological data. However, disease data are often sparse due to their rarity or privacy, leading to suboptimal representation of disease when biological entity relationships and labeled disease data are not adequately modeled. To address this challenge, we propose DAISY (Dual-grAnularity contrastIve learning for diSease similaritY prediction), an effective deep learning model for disease representation modeling. DAISY leverages a novel dual-granularity contrastive learning mechanism to enhance the representation of diverse biological entities. Its ability to enable the collaborative supervision of diseases represented by both homogeneous and heterogeneous information is of great significance, leading to a high level of disease representation learning. Besides, this contrastive learning mechanism combines two independent and complementary components: a hierarchical biological entity relationship-aware module to capture disease features on other biological entities, and a disease association capturing module based on signed random walk with precious disease data. Experimental results demonstrate that DAISY achieves outstanding performance on the disease similarity prediction problem.

关键词： Diseases Biological information theory Contrastive learning Biological system modeling Biology Semantics Ontologies Bioinformatics Data models Biomedical measurement

来源：评论

学校读者我要写书评

暂无评论

Multiscale Graph Transformer for Brain Disorder Diagnosis

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Shehzad, Ahsan Zhang, Dongyu Yu, Shuo Abid, Shagufta Kumar, Dinesh Kant Xia, Feng School of Software Technology Dalian University of Technology Dalian116620 China School of Foreign Languages School of Software Technology Dalian University of Technology Dalian116024 China School of Computer Science and Technology Dalian University of Technology Dalian116024 China School of Engineering RMIT University MelbourneVIC3000 Australia School of Computing Technologies RMIT University MelbourneVIC3000 Australia

—Multiscale brain networks are crucial for diagnosing brain disorders by revealing the hierarchical organization of brain function and connectivity. However, previous methods that explored multi-atlas approaches to model these networks often failed to represent this organization across multiple spatial and temporal scales, leading to limited representations and potentially inaccurate diagnoses. To address this issue, we propose the Multiscale Brain Graph Transformer (BrainMGT), which captures the hierarchical organization of brain connectivity at various spatial and temporal scales to improve the diagnosis of brain disorders. BrainMGT constructs multiscale brain networks that model spatial hierarchies, i.e. microscale, mesoscale, and macroscale, while preserving their modular structure. It also incorporates multiple temporal scales, i.e. fast, intermediate, and slow, for estimating connectivity, rather than relying on a single temporal scale from blood-oxygen-level-dependent (BOLD) signals. Using self-attention and cross-attention mechanisms, BrainMGT extracts and integrates features both within and between these scales, generating fine-coarse feature representations that improve diagnostic precision. We validated BrainMGT on three real-world functional magnetic resonance imaging (fMRI) datasets, and the results show that BrainMGT outperformed existing methods in diagnosing neurological disorders. © 2025 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

A Survey on Intelligent Solutions for Increased Video Delivery Quality in Cloud-Edge-End Networks

引用

IEEE Communications Surveys and Tutorials 2025年第2期27卷 1363-1394页

作者： Shi, Wanxin Li, Qing Yu, Qian Wang, Fulin Shen, Gengbiao Jiang, Yong Xu, Yang Ma, Lianbo Muntean, Gabriel-Miro Tsinghua University Tsinghua Shenzhen International Graduate School Shenzhen518055 China Fudan University School of Computer Science Shanghai200433 China Peng Cheng Laboratory Department of Strategic and Advanced Interdisciplinary Research Shenzhen518066 China Institute of Future Networks Southern University of Science and Technology Shenzhen518055 China Tecorigin Software Department Shanghai200120 China Peng Cheng Laboratory Department of Strategic and Advanced Interdisciplinary Research Shenzhen518055 China Northeastern University College of Software Shenyang110819 China Dublin City University Performance Engineering Laboratory School of Electronic Engineering DublinD09 DD7R Ireland

The digital age has brought a significant increase in video traffic. This traffic growth, driven by rapid Internet advancements and a surge in multimedia applications, presents both challenges and opportunities to video transmissions. Users seek high-quality video content, prompting service providers to offer high-definition options to improve user experience and increase profits. However, traditional end-to-end best-effort networks struggle to meet the demands of extensive video streaming and ensure good user Quality of Experience (QoE), especially in high user mobility scenarios or fluctuating network conditions. Addressing some of these challenges, content delivery networks (CDN) are instrumental in delivering video content, but they are under increased pressure to support high quality and reduce their deployment and maintenance costs. Currently, cloud-edge-end fusion technologies have become one of the optimization directions for network services due to their flexibility and scalability. At the same time, in the context of the recent advancements in computing-focused network paradigms, intelligent enhancement techniques (e.g., super-resolution), commonly utilized in image optimization, have been adopted as a pivotal solution for increasing video delivery quality. To illustrate the essence and employment of the intelligent enhancement solutions for video streaming, this paper first outlines the video streaming process, discusses relevant evaluation metrics, and examines aspects related to the intelligent solutions. Then the paper presents the intelligent enhancement process of video streaming, analyzes various typical intelligent models for content enhancement and highlights their distinct characteristics. This exploration delves deeper into various intelligent quality-improved solutions, scrutinizing their applicability across different transmission scenarios like Video on Demand (VoD) and live streaming, and shedding light on their strengths and weaknesses from

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

MOALF-UAV-MEC: Adaptive Multi-Objective Optimization for UAV-Assisted Mobile Edge Computing in Dynamic IoT Environments

引用

IEEE Internet of Things Journal 2025年

作者： Al-Bakhrani, Ali A. Li, Mingchu Obaidat, Mohammad S. Amran, Gehad Abdullah Dalian University of Technology School of Software Dalian116024 China Albaydha University Al Bayda Yemen Jiangxi Normal University School of Computer and Information Engineering Jiangxi China School of Software Technology Dalian University of Technology Nanchang Dalian China University of Science and Technology School of Computer and Communication Engineering Beijing100083 China SRM University School of Computing Department of Computational Intelligence TN Kattankulathur603203 India The Amity University School of Engineering UP Noida201301 India Dalian University of Technology Department of Management Science and Engineering Dalian116024 China

The proliferation of Internet of Things (IoT) devices and computation-intensive applications has led to unprecedented demands on network resources and computing capabilities. This paper presents MOALF-UAV-MEC, a novel Multi-Objective Adaptive Learning Framework for UAV-Assisted Mobile Edge Computing (MEC) tailored for dynamic IoT environments. The framework integrates Multi-Objective Reinforcement Learning (MORL), Model Predictive Control (MPC), Adaptive Particle Swarm Optimization (APSO), and Lyapunov Optimization to optimize UAV trajectories, dynamic resource allocation, and system stability. MOALF-UAV-MEC addresses critical challenges in UAV-assisted MEC, including multi-objective optimization, adaptive resource allocation, energy efficiency, scalability, and quality of service guarantees. Our approach employs a unique burst mode feature for UAVs, enabling temporary performance boosts in high-demand situations. Extensive simulations demonstrate the framework's efficiency in enhancing task completion rates, energy efficiency, and long-term system sustainability. Results show a task completion rate of 94.50%, significantly outperforming existing approaches, with an average of 1,890 completed tasks per UAV and a load balancing efficiency of 96%. The framework exhibits robust adaptive behavior, achieving a 38% reduction in UAV route optimization and a 55% increase in task completion during high-load periods. This research contributes to the advancement of edge computing in IoT environments, offering a scalable and adaptive solution for deploying computational resources in areas with limited infrastructure, during temporary events, or in emergency situations. © 2014 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

Probabilistic-Search and Neighbor-Density Based Doppler-Shift Acquisition in Space Communications

引用

IEEE Transactions on Communications 2025年

作者： Zhang, Zhaowei Du, Shuai Liu, Lin Liu, Hui Zuo, Jiakuo Miao, Wang Zhao, Haitao Nanjing University of Posts and Telecommunications School of Internet of Things China Nanjing University State Key Laboratory for Novel Software Technology China Jinling Institute of Technology School of Software Engineering China University of Exeter Department of Computer Science United Kingdom

In space communications, the signal's long-distance transmission between a flying transmitter-receiver pair encounters two obstacles: a huge path-loss and a high-speed movement. The huge path-loss results in a low signal-to-noise ratio (SNR) and the high-speed movement brings a dynamic Doppler-shift, thus posing a great challenge for Doppler-shift acquisition. Under the low SNR, the Doppler-shift acquisition has to accumulate many symbols in a long-time period. However, during this period, the dynamic Doppler-shift disperses all these symbols' total energy over a wide range, thus causing the energy dispersion problem. To address this problem, we propose a probabilistic-search and neighbor-density (PSND) scheme, where the probabilistic-search considers the element's amplitude and sacrifices some redundant signal elements for a narrower search-range, while the neighbordensity sums the signal element's all neighbors for a larger signal energy. The PSND scheme includes two algorithms: the Generic PSND and Iterative PSND. The Generic PSND algorithm first selects some search-elements with their probabilities to construct a probabilistic-search-range, then selects some density-elements with their neighbor-elements to derive the neighbor-densities, and finally searches the largest neighbor-density to obtain the acquisition result. Built upon the Generic PSND algorithm above, the Iterative PSND algorithm iteratively updates the searchelements to further strengthen the neighbor-density in a narrower probabilistic-search-range. Moreover, the simulations results have demonstrated our PSND scheme's higher acquisition probability, as compared with the existing schemes. © 1972-2012 IEEE.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：