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

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

IEEE Transactions on Mobile Computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Long and Recent Preference Learning with Recent-k Items Distribution for Recommender System

引用

IEEE Transactions on Multimedia 2025年

作者： Gao, Yongbiao Niu, Sijie Lv, Guohua Ling, Miaogen Geng, Xin Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China Southeast University Ministry of Education Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Application China University of Jinan Shandong Provincial Key Laboratory of Ubiquitous Intelligent Computing School of Information Science and Engineering China Nanjing University of Information Science and Technology School of Computer Science China Southeast University School of Computer Science and Engineering China

Reinforcement learning (RL) aims to formulate the recommendation task as a Markov decision process (MDP) and trains an agent to automatically learn the optimal recommendation policy from interaction trajectories through trial-and-error and reward mechanisms. However, most existing RL-based approaches overlook the correlation between items and the dynamics of user interests implied in temporally close interactions. Therefore, in this paper, we propose a reinforcement learning method that incorporates a "recent-k items"distribution to capture users' local preferences. Specifically, we model the output layer as two distinct branches. The "recent-k items"branch, formulated with a Kullback-Leibler divergence loss, learns the recent interests of users, whereas the other branch utilizes a one-step temporal difference error to capture long-term preferences. The proposed structure is integrated into deep Q-learning and actor-critics, resulting in two enhanced methods named R k Q and R k AC, respectively. Furthermore, a novel soft inter-reward is carefully designed to enhance the proposed method, and we theoretically prove the convergence of the proposed algorithm. We perform extensive experiments on two large real-world datasets and conduct further analysis of the influences of different action sequences, time intervals, and enhancement capabilities for state-of-the-art models. The experimental results demonstrate the efficacy of our proposed methods. © 1999-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Wi-SFDAGR: WiFi-Based Cross-Domain Gesture Recognition via Source-Free Domain Adaptation

引用

IEEE Internet of Things Journal 2025年

作者： Yan, Huan Zhang, Xiang Huang, Jinyang Feng, Yuanhao Li, Meng Wang, Anzhi Ou, Weihua Wang, Hongbing Liu, Zhi Guizhou Normal University School of Big Data and Computer Science Guiyang550025 China University of Science and Technology of China CAS Key Laboratory of Electromagnetic Space Information Hefei230026 China Hefei University of Technology School of Computer and Information Hefei230601 China The University of Electro-Communications Department of Computer and Network Engineering Tokyo1828585 Japan

WiFi Channel State information (CSI)-based gesture recognition offers unique advantages, including cost-effectiveness and enhanced privacy protection, and has garnered significant attention in recent years. However, existing WiFi-based gesture recognition solutions exhibit poor generalization ability when deployed in new environment, orientation, or location. Although some methods combine labeled source domain and unlabeled target domain to learn domain-independent features, factors such as data privacy protection hinder access to source data during practical environment adaptation. Consequently, we consider realistic scenario where source data is unavailable during adaptation of unlabeled test data, and instead, a trained source domain model is used. In this paper, we propose Wi-SFDAGR, a WiFi-based Source-free Domain Adaptation Gesture Recognition framework. Specifically, we treat cross-domain as an unsupervised clustering problem, aiming to ensure that features within local neighborhoods exhibit similar prediction results while those farther apart display different prediction outcomes in the feature space. We theoretically analyze the effect of enhanced prediction consistency between neighbor points extracted from gestures on generalization error. Furthermore, we employ an attraction-dispersion network to strengthen prediction consistency among closely located features in the feature space while reducing it for distantly located features. To mitigate noise introduced during nearest neighbor sample selection in the feature space (where predictions may not align with the input sample’s prediction), we progressively improve nearby sample feature aggregation by estimating uncertainty to reweight local neighborhood predictions. Finally, extensive experiments are conducted on the Widar 3.0 and XRF55 datasets and the results show our proposed framework outperforms most cross-domain methods. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Towards Event Extraction with Massive Types: LLM-based Collaborative Annotation and Partitioning Extraction

arXiv

引用

arXiv 2025年

作者： Liu, Wenxuan Li, Zixuan Bai, Long Zuo, Yuxin Xu, Daozhu Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China State Key Laboratory of Geo-Information Engineering Shaanxi Xi’an China

Developing a general-purpose extraction system that can extract events with massive types is a long-standing target in Event Extraction (EE). In doing so, the challenge comes from two aspects: 1) The absence of an efficient and effective annotation method. 2) The absence of a powerful extraction method can handle massive types. For the first challenge, we propose a collaborative annotation method based on Large Language Models (LLMs). Through collaboration among multiple LLMs, it first refines annotations of trigger words from distant supervision and then carries out argument annotation. Next, a voting phase consolidates the annotation preferences across different LLMs. Finally, we create the EEMT dataset, the largest EE dataset to date, featuring over 200,000 samples, 3,465 event types, and 6,297 role types. For the second challenge, we propose an LLM-based Partitioning EE method called LLM-PEE. To overcome the limited context length of LLMs, LLM-PEE first recalls candidate event types and then splits them into multiple partitions for LLMs to extract events. The results in the supervised setting show that LLM-PEE outperforms the state-of-the-art methods by 5.4% in event detection and 6.1% in argument extraction. In the zero-shot setting, LLM-PEE achieves up to 12.9% improvement compared to mainstream LLMs, demonstrating its strong generalization capabilities. Copyright © 2025, The Authors. All rights reserved.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

A two-path fiber-optic AE demodulation algorithm based on Numerically Stable Direct Least Squares Fitting of Ellipses

引用

Journal of Lightwave Technology 2025年

作者： Li, Xinhao Zhang, Faxiang Sun, Zhihui Jiang, Shaodong Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

The 3 × 3 coupler demodulation algorithm commonly employs ellipse fitting algorithms (EFAs) to eliminate coupler asymmetry. In the detection scenario of fiber-optic acoustic emission (AE) sensor arrays, the amount of data increases significantly due to the high sampling rate and multi-channel characteristics. Traditional EFAs require substantial computational resources and involve complex calculations, which severely hinder demodulation efficiency. To address these issues, We propose a two-path demodulation algorithm based on Numerically Stable Direct Least Squares Fitting of Ellipses (NSDLS). The algorithm only two input signals and divides the fitting process into linear and quadratic components, reducing computational complexity. The triggered ellipse fitting judgment method is introduced to mitigate background noise impact on fitting results and enhance demodulation efficiency. Experimental results demonstrate that the proposed two-path demodulation algorithm based on NSDLS reduces time consumption by approximately 40 times and the CPU utilization by 40% compared with traditional EFAs demodulation algorithm, improves SINAD by 18.93 dB compared with the improved Naval Postgraduate School (NPS) method. The algorithm achieves a dynamic range of 126.04 dB @ 1 kHz, 0.075% THD, and 99.999% response linearity. This method maintains high demodulation accuracy while significantly reducing computational resource demands, lowering hardware costs, and improving overall demodulation efficiency. © 1983-2012 IEEE.

关键词： Acoustic emission testing

来源：评论

学校读者我要写书评

暂无评论

Towards Expanding Precise Timing for Collaborative Its with Deterministic Communications in 6G

Towards Expanding Precise Timing for Collaborative Its with ...

引用

IEEE Conference on Wireless Communications and networking

作者： Hongxing Li Haotian Li Qianhan Gao Guochu Shou Yaqiong Liu Zhigang Guo Yihong Hu State Key Laboratory of Networking and Switching Technology School of Computer Science (National Pilot Software Engineering School) Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

The demand for precise timing continues to grow with the rapid development of smart cities, where intelligent transportation emerges as a critical application heavily dependent on accurate time distribution. Deterministic communication is anticipated to be a defining feature of nextgeneration mobile networks (6G), enabling end-to-end timecritical applications, and unlocking new possibilities for achieving end-to-end precise time synchronization as well. To cope with the challenge of delivering precise time synchronization across broader areas at a lower cost, this paper proposes a method to achieve end-to-end precise time synchronization by leveraging the deterministic characteristics of communication networks. Specially, the proposed approach adopts the Software-Defined networking (SDN) paradigm to implement deterministic networking for the seamless integration of Time-Sensitive networking (TSN) and cellular networks. Furthermore, to mitigate the impact of wireless channel uncertainties on synchronization accuracy, we propose a network delay measurement mechanism based on the principle of time redundancy, designed to reduce end-to-end network delay variation. Experimental results validate the effectiveness of the proposed method, demonstrating its capability to constrain the end-to-end relative time error of wired and wireless converged networks to the microsecond scale, without necessitating modifications to the existing network infrastructure.

关键词： 6G mobile communication Wireless communication Cellular networks Uncertainty Accuracy Measurement uncertainty Transportation Delays Synchronization Software defined networking

来源：评论

学校读者我要写书评

暂无评论

S2KAN-SLAM: Elastic Neural LiDAR SLAM with SDF Submaps and Kolmogorov-Arnold networks

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Wang, Zhong Zhang, Lin Wang, Hesheng Shanghai Jiao Tong University State Key Laboratory of Avionics Integration and Aviation System-of-Systems Synthesis Department of Automation Key Laboratory of System Control and Information Processing of Ministry of Education Shanghai200240 China Tongji University School of Computer Science and Technology National Pilot Software Engineering School with Chinese Characteristics Shanghai201804 China

Traditional LiDAR SLAM approaches prioritize localization over mapping, yet high-precision dense maps are essential for numerous applications involving intelligent agents. Recent advancements have introduced methods leveraging neural fields to enhance mapping capabilities;however, these approaches still face several limitations. Firstly, concerning scene representation, they typically employ neural fields with high-dimensional features and multi-layer perceptron decoders utilizing non-continuous activation functions. This results in low learning efficiency and challenges in capturing high-frequency signals. Secondly, in terms of scene organization, these methods often treat the entire scene as a singular neural field, leading to inefficiencies, inflexibility, and difficulties in rectifying accumulated errors when mapping large-scale environments over extended periods. To tackle the first issue, we propose a lightweight continuous SDF regression approach by encoding the scene in single-valued embeddings and decoding SDF values from a Kolmogorov-Arnold network. By minimizing discrepancies in measuring range, sampling distance, and decoded SDF values, we facilitate iterative frame-to-model tracking and bundle adjustment neural mapping. To mitigate the second challenge, we propose structuring the whole scene into multiple neural SDF submaps. By establishing node-node, node-submap, and loop closure constraints into a global pose graph, the system can create dense neural maps with global consistency across large-scale scenes. Experimental evaluations in both real-world and simulated settings indicate that our system achieves superior mapping completeness and accuracy, enhanced learning efficiency, reduced memory consumption, and greater flexibility compared to its counterparts. © 2025 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Semantic-Aware Prompt Learning for Multimodal Sarcasm Detection

Semantic-Aware Prompt Learning for Multimodal Sarcasm Detect...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Guangjin Wang Bao Wang Fuyong Xu Zhenfang Zhu Peipei Wang Ru Wang Peiyu Liu School of Information Science and Engineering Shandong Normal University Jinan China School of Information Science and Electrical Engineering Shandong Jiao Tong University Jinan China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal sarcasm detection aims to identify whether utterances express sarcastic intentions contrary to their literal meaning based on multimodal information. However, existing methods fail to explore the model’s "ability to understand" the semantics expressed by sentences in the image context from semantic diversity perspectives. In this paper, we propose a multi-view semantic awareness method, which concretizes semantics from multiple perspectives to improve the model’s ability to capture different semantic features. Specifically, two learnable prefixes are attached to the text representation respectively to construct semantic representations from both the literal meaning and sarcastic intention perspectives. Then, image-text information is further fused through cross-attention to guide the semantic representation of different perspectives in the image context. Finally, the semantics expressed by prefixes are strengthened through KL divergence, thereby encouraging the model to capture two distinctive semantic features. Experiments on benchmark datasets demonstrate the effectiveness of our method.

关键词： Semantics Benchmark testing Speech enhancement Signal processing Vectors Acoustics Context modeling

来源：评论

学校读者我要写书评

暂无评论

Multimodal Dialogue Emotion Recognition Based on Label Optimization and Coarse-Grained Assisted Fine-Grained

Multimodal Dialogue Emotion Recognition Based on Label Optim...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhibo Zhang Zhenyu Yang Yan Huang Baojie Xu Wenyue Hu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal dialogue emotion recognition integrates data from multiple modalities to accurately identify emotional states in conversations. However, differences in expression and information density across modalities complicate the fusion of features. Traditional methods may introduce redundant information from other utterances, reducing the accuracy of emotion recognition. Existing one-hot labels often fail to capture the full range of emotional expressions, leading to biased results. To address these issues, we propose a model that fuses different modalities within the same utterance to avoid redundancy. It employs a progressive classification process, refining emotion recognition from coarse to fine granularity. Additionally, we use emotion polarity probabilities as weights for fine-grained classification and introduce a multimodal information-rich label that considers both the data and their interactions. Experiments on IEMOCAP and MELD datasets demonstrate the model’s effectiveness, significantly improving dialog emotion recognition accuracy. Our code is available at https://***/r/LOCG-188E.

关键词： Emotion recognition Accuracy Fuses Refining Termination of employment Speech recognition Signal processing Speech processing Optimization Faces

来源：评论

学校读者我要写书评

暂无评论

A Traceable Privacy-Preserving Transaction Protocol With Evolutionary Threshold Authentication

引用

IEEE Internet of Things Journal 2025年

作者： Xie, Ninghai Li, Jiguo Lin, Chao Zhang, Yichen Shen, Jian Fujian Normal University College of Computer and Cyber Security Fuzhou350117 China School of Mathematics and Statistics Key Laboratory of Analytical Mathematics and Applications Ministry of Education Fujian Fuzhou350117 China Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou350117 China Fujian Normal University Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fuzhou350117 China Guangzhou University Guangdong Key Laboratory of Blockchain Security Guangzhou510006 China Zhejiang Sci-Tech University School of Information Science and Engineering Hangzhou310018 China

Decentralized payment systems, such as Bitcoin, enable immutable and transparent payments in a distributed manner. To address the issue of user privacy leakage due to transaction transparency, some efforts have enhanced privacy protection in decentralized payment systems. However, the lack of regulatory functions in these systems allows malicious users to engage in illegal activities. To balance user privacy protection and the regulation of malicious users, some efforts have attempted to introduce decentralized agencies. However, they have not considered the issue of agency corruption. In this paper, we propose a new traceable privacy-preserving transaction protocol, which tracks the addresses and transaction amounts of anonymous parties through decentralized institutions. To address the problem of committee corruption, we present a traceable privacy-preserving protocol with evolving threshold authentication based on a distributed random beacon (TPETA-to-DRB), enabling committee member updates. Furthermore, we prove that the protocol is secure under the random oracle model and conduct a comprehensive performance evaluation. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：