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

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

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

arXiv

引用

arXiv 2025年

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

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Internet network Resource Information Model

引用

Journal of computer Science & Technology 2002年第6期17卷 908-914页

作者：陈传峰李增智唐亚哲刘康平 Institute of Computer System Architecture and Network Xi'an Jiaotong University Xi'an 710049 P.R. China

The foundation of any network management systens is a database that con-tains information about the network resources relevant to the management tasks. A networkinformation model is an abstraction of network resources, including both managed resources andmanaging resources. In the SNMP-based management framework, management information isdefined almost exclusively from a "device" viewpoint, namely, managing a network is equiva-lent to managing a collection of individual nodes. Aiming at making use of recent advances indistributed computing and in object-oriented analysis and design, the Internet management ar-chitecture can also be based on the Open Distributed Processing Reference Model (RM-ODP).The purpose of this article is to provide an Internet network Resource Information ***, a layered management information architecture will be discussed. Then the Internetnetwork resource information model is presented. The information model is specified usingObject-Z.

关键词： network management managed object object-orientation formal semantics management information

来源：评论

学校读者我要写书评

暂无评论

A New Paradigm of User-Centric Wireless Communication Driven by Large Language Models

arXiv

引用

arXiv 2025年

作者： Ding, Kuiyuan Guo, Caili Yang, Yang Hu, Wuxia Eldar, Yonina C. Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Beijing Laboratory of Advanced Information Net works School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Faculty of Mathematics and Computer Science Weizmann Institute of Science Rehovot7610001 Israel

The next generation of wireless communications seeks to deeply integrate artificial intelligence (AI) with user-centric communication networks, with the goal of developing AI-native networks that more accurately address user requirements. The rapid development of large language models (LLMs) offers significant potential in realizing these goals. However, existing efforts that leverage LLMs for wireless communication often overlook the considerable gap between human natural language and the intricacies of real-world communication systems, thus failing to fully exploit the capabilities of LLMs. To address this gap, we propose a novel LLM-driven paradigm for wireless communication that innovatively incorporates the nature language to structured query language (NL2SQL) tool. Specifically, in this paradigm, user personal requirements is the primary focus. Upon receiving a user request, LLMs first analyze the user intent in terms of relevant communication metrics and system parameters. Subsequently, a structured query language (SQL) statement is generated to retrieve the specific parameter values from a high-performance real-time database. We further utilize LLMs to formulate and solve an optimization problem based on the user request and the retrieved parameters. The solution to this optimization problem then drives adjustments in the communication system to fulfill the user’s requirements. To validate the feasibility of the proposed paradigm, we present a prototype system. In this prototype, we consider user-request centric semantic communication (URC-SC) system in which a dynamic semantic representation network at the physical layer adapts its encoding depth to meet user requirements, such as improved data transmission quality or reduced data transmission latency. Additionally, two LLMs are employed to analyze user requests and generate SQL statements, respectively. Simulation results demonstrate the effectiveness of the prototype in personalizing and addressing user r

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Revisiting Multiple Pattern Matching Algorithms for Multi-Core architecture

引用

Journal of computer Science & Technology 2011年第5期26卷 866-874页

作者：谭光明刘萍卜东波刘燕兵 Key Laboratory of Computer System and Architecture Institute of Computing TechnologyChinese Academy of Sciences Key Laboratory of Network Technology Institute of Computing TechnologyChinese Academy of Sciences

Due to the huge size of patterns to be searched,multiple pattern searching remains a challenge to several newly-arising applications like network intrusion *** this paper,we present an attempt to design efficient multiple pattern searching algorithms on multi-core *** observe an important feature which indicates that the multiple pattern matching time mainly depends on the number and minimal length of *** multi-core algorithm proposed in this paper leverages this feature to decompose pattern set so that the parallel execution time is *** formulate the problem as an optimal decomposition and scheduling of a pattern set,then propose a heuristic algorithm,which takes advantage of dynamic programming and greedy algorithmic techniques,to solve the optimization *** results suggest that our decomposition approach can increase the searching speed by more than 200% on a 4-core AMD Barcelona system.

关键词： parallel algorithm multi-core multiple pattern matching

来源：评论

学校读者我要写书评

暂无评论

Lightweight Task-Oriented Semantic Communication Empowered by Large-Scale AI Models

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Liu, Chuanhong Guo, Caili Yang, Yang Chen, Mingzhe Quek, Tony Q. S. Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing100876 China Beijing University of Posts and Telecommunications Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL United States Singapore University of Technology and Design Dept. of Information Systems Technology and Design 487372 Singapore

Recent studies have focused on leveraging large-scale artificial intelligence (LAI) models to improve semantic representation and compression capabilities. However, the substantial computational demands of LAI models pose significant challenges for real-time communication scenarios. To address this, this paper proposes utilizing knowledge distillation (KD) techniques to extract and condense knowledge from LAI models, effectively reducing model complexity and computation latency. Nevertheless, the inherent complexity of LAI models leads to prolonged inference times during distillation, while their lack of channel awareness compromises the distillation performance. These limitations make standard KD methods unsuitable for task-oriented semantic communication scenarios. To address these issues, we propose a fast distillation method featuring a pre-stored compression mechanism that eliminates the need for repetitive inference, significantly improving efficiency. Furthermore, a channel adaptive module is incorporated to dynamically adjust the transmitted semantic information based on varying channel conditions, enhancing communication reliability and adaptability. In addition, an information bottleneck-based loss function is derived to guide the fast distillation process. Simulation results verify that the proposed scheme outperform baselines in term of task accuracy, model size, computation latency, and training data requirements. © 1967-2012 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

STUDY ON NONLINEAR DYNAMICS OF TCP-RENO TRAFFIC UNDER RED

引用

Journal of Pharmaceutical Analysis 2006年第1期18卷 21-23,27页

作者：王立李增智薛可 Institute of Computer System Architecture & Network Xi'an Jiaotong UniversityXi'an 710049China

A discrete time feedback control system model based on a multi-router network has been presented. The model can be described by a set of recurrence equations. The numerical examples about the bifurcation of average and instantaneous queue size along with the variety of RED control parameter are shown. The simulate experiments about those of the RED control parameters are also presented. All of these results show that instability in TCP-Reno traffic under RED can be induced by the inherent nonlinear behavior of the network.

关键词： service management nonlinear dynamics TCP-Reno RED

来源：评论

学校读者我要写书评

暂无评论

Fusing Bluetooth with Pedestrian Dead Reckoning: A Floor Plan-Assisted Positioning Approach

arXiv

引用

arXiv 2025年

作者： Pan, Wenxuan Yang, Yang Chen, Mingzhe Wei, Dong Guo, Caili Mao, Shiwen Beijing Key Laboratory of Network System Architecture and Convergence School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical and Computer Engineering the Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Beijing Laboratory of Advanced Information Networks School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing100876 China Wireless Engineering Research and Education Center Auburn University AuburnAL36849 United States

Floor plans can provide valuable prior information that helps enhance the accuracy of indoor positioning systems. However, existing research typically faces challenges in efficiently leveraging floor plan information and applying it to complex indoor layouts. To fully exploit information from floor plans for positioning, we propose a floor plan-assisted fusion positioning algorithm (FP-BP) using Bluetooth low energy (BLE) and pedestrian dead reckoning (PDR). In the considered system, a user holding a smartphone walks through a positioning area with BLE beacons installed on the ceiling, and can locate himself in real time. In particular, FP-BP consists of two phases. In the offline phase, FP-BP programmatically extracts map features from a stylized floor plan based on their binary masks, and constructs a mapping function to identify the corresponding map feature of any given position on the map. In the online phase, FP-BP continuously computes BLE positions and PDR results from BLE signals and smartphone sensors, where a novel grid-based maximum likelihood estimation (GML) algorithm is introduced to enhance BLE positioning. Then, a particle filter is used to fuse them and obtain an initial estimate. Finally, FP-BP performs post-position correction to obtain the final position based on its specific map feature. Experimental results show that FP-BP can achieve a real-time mean positioning accuracy of 1.19 m, representing an improvement of over 28% compared to existing floor plan-fused baseline algorithms. Copyright © 2025, The Authors. All rights reserved.

关键词： Photomapping

来源：评论

学校读者我要写书评

暂无评论

Attribute reduction theory and approach to concept lattice

引用

Science in China(Series F) 2005年第6期48卷 713-726页

作者： ZHANG Wenxiu WEI Ling QI Jianjun Institute for Information and System Sciences Faculty of Science Xi'an Jiaotong University Xi'an 710049 China Department of Mathematics Northwest University Xi'an 710069 China Institute of Computer Architecture & Network Xi'an Jiaotong University Xi'an 710049 China

The theory of the concept lattice is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. This paper proposes the theory of attribute reduction in the concept lattice, which extends the theory of the concept lattice. In this paper, the judgment theorems of consistent sets are examined, and the discernibility matrix of a formal context is introduced, by which we present an approach to attribute reduction in the concept lattice. The characteristics of three types of attributes are analyzed.

关键词： formal context concept lattice attribute reduction discernibility matrix

来源：评论

学校读者我要写书评

暂无评论

Online discovery of quantitative model for web service management

Online discovery of quantitative model for web service manag...

引用

First International Conference on Natural Computation, ICNC 2005

作者： Chen, Jing Yin, Xiao-Chuan Zhang, Shui-Ping Telecommunication Engineering Institute Air Force Engineering University Xi'an 710077 China Institute of Computer System Architecture and Network Xian Jiaotong University Xian 710049 China

Due to the existence of strong correlation between database metrics and response times, an online discovery quantitative models system of web service management with the linear least-squares regression algorithms was proposed. The model used the stepwise linear regression algorithms to choose a particular subset from the numerous metrics as the explanatory variables of the model, so it can be updated continuously in response to the changes made in provider configurations and the evolution of business demands. The simulation experiment for Oracle Universal Database under a TPC-W workload chose three most influential metrics that weight 66% of the variability of response *** results show that the effectiveness of quantitative model constructing system and model constructing algorithms. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：