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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Government open systems interconnection: Profile in progress

引用

Library Hi Tech 1990年第4期8卷 111-118页

作者： Mills, Kevin L. Systems and Network Architecture Division National Computer Systems Laboratory National Institute of Standards and Technology United States

The emergence of Open systems Interconnection protocols, as specified within the U.S. Government Open systems Interconnection Profile (GOSIP) Federal Information Processing Standard (FTPS), provides both an opportunity for, and a means of achieving, interoperability within multi-vendor networks. The GOSIP can easily benefit inexperienced users, yet provides the flexibility to serve more sophisticated users. The standard mandates specifications that will be met by a multitude of vendor products, with initial offerings already available. While meeting a useful set of initial networking needs, the FIPS will evolve to include new applications, improvements to the initial applications, new network technologies, and major new functions. GOSIP will permit government agencies to gain better control over their computer network procurements, accruing greater and greater cost savings as the number of government computer networks increases. © 1990, MCB UP Limited

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multiple personal security domains

Multiple personal security domains

引用

2006 International Wireless Communications and Mobile Computing Conference, IWCMC 2006

作者： Matushima, Reinaldo Venturini, Yeda R. Sakuragui, Rony R. M. Carvalho, Tereza C. M. B. Ruggiero, Wilson V. Naslund, Mats Pourzandi, Makan Laboratory of Computer Architecture and Network PCS-EP University of São Paulo São Paulo Brazil Ericsson Research Stockholm Sweden Ericsson Research Open Systems Laboratory Mont-Royal Canada

ISBN: (纸本)1595933069

Mobility, usability and security are major requirements for any Ad Hoc network systems, and there have been numerous papers in regards to them. However, often these requirements are addressed separately. For a valid solution, these requirements must be considered from an integrated view. In this paper, taking into account mobility and usability, we implement a framework which allows to securely share resources and services between devices in Ad-hoc networks, based on security policies defined by the owners of those devices. In addition, we extend our framework to support inter-domain sharing of services and resources. We detail our design, present the preliminary results of our prototype, and discuss the lessons learned, in particular how user experience led to several re-designs of the initial security solution. Copyright 2006 ACM.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Research and implementation of CDP disaster recovery system based on oracle

International Journal of Control and Automation

引用

International Journal of Control and Automation 2015年第11期8卷 325-336页

作者： Ren, Yongjian Ye, Jiaolong Zhang, Jilin Zhou, Li Wang, Jue Zhang, Lei School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education China College of Electrical Engineering Zhejiang University Hangzhou China Supercomputing Center of Computer Network Information Center Chinese Academy of Sciences Beijing China Computer Science Department Beijing University of Civil Engineering and Architecture Beijing China

The OraCDP disaster recovery system uses CDP disaster recovery technology based on the combination of block level, combining with the communication coupling between the underlying I/O and Oracle database. The experimental results show that the OraCDP system can not only maintain the normal operation of the original system without any negative influence, but also guarantee the recovery of data and service at specific time quickly, fully and accurately. © 2015 SERSC.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

An efficient storage technology for object-based distributed storage system

International Journal of Control and Automation

引用

International Journal of Control and Automation 2015年第11期8卷 337-348页

作者： Zhang, Jilin Su, Yucheng Wan, Jian Zhou, Li Wang, Jue Zhang, Lei College of Electrical Engineering Zhejiang University Hangzhou China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education China Supercomputing Center of Computer Network Information Center Chinese Academy of Sciences Beijing China Computer Science Department Beijing University of Civil Engineering and Architecture Beijing China

There have two effective ways to improve the overall efficiency of the object-based distributed storage system, one is network caching technology and the other is metadata server cluster load balancing strategy. Under the heterogeneous storage environments, object-based distributed file system face the key challenge of lacking caching mechanism for the high-frequency access files, metadata server load imbalance also reduce the overall efficiency. To address these challenges, we discuss the design and implementation of an object-based distributed file storage caching system, and propose a weight-based metadata server cluster load balancing strategy. It effectively improve the metadata processing capacity. Based on the results, it demonstrated the feasibility and the efficiency of our methods. © 2015 SERSC.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

An Improvement on the Linear Algebraic Attack for the Indeterminate Equation Encryption Scheme

An Improvement on the Linear Algebraic Attack for the Indete...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Yasuhiko Ikematsu Koichiro Akiyama Tsuyoshi Takagi Department of Mathematical Informatics The University of Tokyo Tokyo Japan Computer Architecture and Network Systems Laboratory Corporate R&D Center Toshiba Corporation

ISBN: (纸本)9781538682234;9784885523182

At SAC2017, Akiyama et al. proposed the indeterminate equation encryption scheme whose security is based on a solution problem of indeterminate equation. It is an extension of algebraic surface encryption scheme. A public key X for this scheme is a polynomial in two variables over a finite ring. Akiyama et al. also proposed two attacks, the linear algebraic attack (LAA) and the key recovery attack (KRA), by using the lattice structure associated with this scheme. In this paper, we give an improvement on LAA. Also we explain the relation between our improvement and the improvement on LAA proposed by Xagawa and examine parameters that those attacks fail by experiments. As a result, we conclude that if the total degree of the public key X is one, then KRA is more efficient than LAA and if that of X is two, then LAA is more efficient than KRA.

关键词： Encryption Lattices Public key Informatics Quantum computing

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm 29

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

29th IEEE International Conference on Parallel and Distributed systems, ICPADS 2023

作者： Zeng, Yan Huang, Chengchuang Ni, Yijie Zhou, Chunbao Zhang, Jilin Wang, Jue Zhou, Mingyao Xue, Meiting Zhang, Yunquan Hangzhou Dianzi University School of Computer Science and Technology Hangzhou310018 China Ministry of Education Key Laboratory for Modeling and Simulation of Complex Systems Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Hangzhou Dianzi University School of ITMO Joint Institute Hangzhou310018 China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing100086 China HuaWei China Institute of Computing Technology of the Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100086 China

ISBN: (纸本)9798350330717

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network's dataflow graph and device cluster's topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method. © 2023 IEEE.

关键词： Auto-Parallel Distributed machine learning Genetic algorithm Integer linear programming Model parallelism

来源：评论

学校读者我要写书评

暂无评论

Safety Guaranteed Power-Delivered-to-Load Maximization for Magnetic Wireless Power Transfer

Safety Guaranteed Power-Delivered-to-Load Maximization for M...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Wangqiu Zhou Xinyu Wang Hao Zhou Shenyao Jiang Zhi Liu Yusheng Ji LINKE Lab School of Computer Science and Technology University of Science and Technology of China CAS Key Laboratory of Wireless-Optical Communications University of Science and Technology of China Deqing Alpha Innovation Institute Huzhou China Department of Computer and Network Engineering The University of Electro-Communications Tokyo Japan Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Electromagnetic radiation (EMR) safety has always been a critical reason for hindering the development of magneticenabled wireless power transfer technology. People focus on the actual received energy at charging devices while paying attention to their health. Thus, we study this significant problem in this paper, and propose a universal safety guaranteed power-delivered-to-load (PDL) maximization scheme (called SafeGuard). Technically, we first utilize the off-the-shelf electromagnetic simulator to perform the EMR distribution analysis to ensure the universality of the method. Then, we innovatively introduce the concept of multiple importance sampling for achieving efficient EMR safety constraint extraction. Finally, we treat the proposed optimization problem as an optimal boundary point search problem from the perspective of space geometry, and devise a brand-new grid-based multi-constraint parallel processing algorithm to efficiently solve it. We implement a system prototype for SafeGuard, and conduct extensive experiments to evaluate it. The results indicate that our SafeGuard can obviously improve the achieved PDL by up to 1.75× compared with the state-of-the-art baseline while guaranteeing EMR safety. Furthermore, SafeGuard can accelerate the solution process by 29.12× compared with the traditional numerical method to satisfy the fast optimization requirement of wireless charging systems.

关键词： Performance evaluation Monte Carlo methods System performance Inductive charging Prototypes Wireless power transfer Parallel processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：