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

VmPTP: Precise Time Protocol for Inter-VM Communication in embedded Virtualized Systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 897-910页

作者： Zhao, Sirong Xie, Guoqi Ma, Wenhong Ren, Wei Li, Kenli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan Changsha410082 China Huawei Technology Co. Ltd. Central Software Institute Guangdong Shenzhen518129 China

System virtualization techniques are gradually applied to embedded systems with the performance improvement of embedded devices;however, there is a large time offset (i.e., deviation) of hundreds of ms between virtual machines (VMs) due to the drift of the virtualization abstraction layer and the jitter phenomenon. It is urgent to significantly reduce this offset by time synchronization techniques. Unfortunately, the current mainstream time synchronization software (e.g., Chrony and LinuxPTP) cannot be used in the embedded virtualized system connected by the fieldbus, such as controller area network (CAN);meanwhile, drift correction-based time synchronization techniques dedicated to CAN bus cannot be utilized for virtualized systems. In this study, we design a general vmPTP, which is a precise time protocol (PTP) for inter-VM communication in embedded virtualized systems based on Linux kernel-based VM (KVM). This is the first time synchronization work focused on embedded virtualized systems. We implement two vmPTP versions based on VirtIO and inter-VM shared memory (IVSHMEM) according to the four message (i.e., packet) exchanges of PTP. We propose an asymmetry compensation strategy to solve the problem of asymmetric rate of I/O operations in the message exchange process, which optimizes the offset computation. We further produce a convergence stopping approach which can continuously converge the offset until the offset is within the given bound and stop. We conduct experimental evaluations on both X86-64 and ARM64 architectures. For two versions of vmPTP, the experimental results show that: 1) the offsets are always within 1μ s on two architectures;2) the offsets are less than that of LinuxPTP and Chrony;and 3) the vmPTP's CPU and memory utilization on the X86-64 architecture are merely 0.3% and 0.1%, respectively, whereas those on the ARM64 architecture are 3.8% and 0.1%, respectively. We experiment with vmPTP in real-time application and the result demonstrates th

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Instance-Aware Style-Swap for Disentangled Attribute-Level Image Editing 17th

Instance-Aware Style-Swap for Disentangled Attribute-Level ...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Zhou, Xinjiao Jiang, Bin Yang, Chao Hu, Haotian Sun, Minyu College of Computer Science and Electronic Engineering Hunan University Hunan Changsha410082 China Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Hunan Changsha410082 China

ISBN: (纸本)9789819923847

Recent studies have shown that attribute-level image editing could be achieved by modifying the latent code of style-based Generative Adversarial network (StyleGAN). However, many existing methods suffer from semantic entanglement, which leads to undesirable changes when editing a specific attribute. To solve this problem, we focus on the S space of StyleGAN2 and propose a simple and effective Optimization-based Instance-Aware Style-Swap method, which could perform a natural transformation effect on arbitrary source images and reference images by searching instance-aware swap coefficients with the guidance of prior information. By further analyzing the learned swapping coefficients, we can identify the style channels connected with a specific target attribute. We verify the effectiveness of our proposed methods in the field of face attribute editing. Extensive experiments have demonstrated that our method can achieve controllable and fine-grained image editing along various attributes. Qualitative and quantitative results show the advantages of our method compared with other semantic image editing methods. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Collaborative Multi-head Contextualized Sparse Representations for Real-Time Open-Domain Question Answering 17th

Collaborative Multi-head Contextualized Sparse Representatio...

引用

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Sun, Minyu Jiang, Bin Zhou, Xinjiao Zhang, Bolin Yang, Chao College of Computer Science and Electronic Engineering Hunan University Hunan Changsha410082 China Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Hunan Changsha410082 China

ISBN: (纸本)9789819923847

An efficient method of representing and retrieving information is an essential component of open domain QA. There are question and answer models that allow for real-time responses with speed benefit and scalability. Nonetheless, due to the limitations of existing phrase models, their accuracy is low. In this paper, we improve the contextualized sparse representation to strengthen the connection between contextual information. We achieve better answer retrieval by enhancing the embedding quality of the model for phrase representation. Specifically, based on original contextualized sparse representations, we transform the single self-attention into collaborative multi-head attention so that attention heads can connect and pay attention to crucial information in different context locations. Compared with learning sparse vectors in n-gram vocabulary space by rectified self-attention, collaborative multi-head attention performs better on the SQuAD dataset. Due to the increased efficiency of critical information representation, the model improves to varying degrees on both of the two evaluation metrics. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Brief Industry Paper: Response Time Evaluation of Cross-Domain Communication in CAN-FD and TSN 44

Brief Industry Paper: Response Time Evaluation of Cross-Doma...

引用

44th IEEE Real-Time Systems Symposium, RTSS 2023

作者： Ma, Wenhong Huang, Xiaoyi Wei, Dongsheng Li, Renfa Zhang, Yunfei Xie, Guoqi Chang, Wanli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province China Tencent Future Network Lab Tencent Corporation China

ISBN: (纸本)9798350328578

With the advancement of intelligence and networked automotive, the domain-centralized architecture, which employs time sensitive networking (TSN) as the inter-domain backbone network and control area network with flexible data rate (CAN-FD) as the intra-domain network, has garnered significant attention. However, cross-domain end-to-end communication involves multiple components, and significant disparities between TSN and CAN-FD render response time analysis within domain-centralized architecture for mixed-critical traffic exceptionally complex. In this paper, we develop a cross-domain with TSN and CAN-FD end-to-end response time evaluation tool, which analyzes the response time of mixed-critical traffic under different design options segment by segment. We specifically analyze the waiting times of different messages in the domain control unit when faced with the design options of one-to-one and multi-to-one conversion of CAN-FD and TSN frames. The proposed evaluation tool can be easily extended to different design options to support more application scenarios. Theoretical computational analysis and real hardware measurements show the effectiveness of our tool. © 2023 IEEE.

关键词： network architecture

来源：评论

学校读者我要写书评

暂无评论

TrafficGPT: Towards Multi-Scale Traffic Analysis and Generation with Spatial-Temporal Agent Framework

arXiv

引用

arXiv 2024年

作者： Ouyang, Jinhui Zhu, Yijie Yuan, Xiang Wu, Di Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Changsha Hunan410082 China

The precise prediction of multi-scale traffic is a ubiquitous challenge in the urbanization process for car owners, road administrators, and governments. In the case of complex road networks, current and past traffic information from both upstream and downstream roads are crucial since various road networks have different semantic information about traffic. Rationalizing the utilization of semantic information can realize short-term, long-term, and unseen road traffic prediction. As the demands of multi-scale traffic analysis increase, on-demand interactions and visualizations are expected to be available for transportation participants. We have designed a multi-scale traffic generation system, namely TrafficGPT, using three AI agents to process multi-scale traffic data, conduct multi-scale traffic analysis, and present multi-scale visualization results. TrafficGPT consists of three essential AI agents: 1) a text-todemand agent that is employed with Question & Answer AI to interact with users and extract prediction tasks through texts;2) a traffic prediction agent that leverages multi-scale traffic data to generate temporal features and similarity, and fuse them with limited spatial features and similarity, to achieve accurate prediction of three tasks;and 3) a suggestion and visualization agent that uses the prediction results to generate suggestions and visualizations, providing users with a comprehensive understanding of traffic conditions. Our TrafficGPT system focuses on addressing concerns about traffic prediction from transportation participants, and conducted extensive experiments on five realworld road datasets to demonstrate its superior predictive and interactive performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Cyber-Physical Systems Design in An Uncertain Environment with Time Uncertainty Concern 29

Cyber-Physical Systems Design in An Uncertain Environment wi...

引用

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

作者： Chen, Si Huang, Lida Xiao, Xiongren Liu, Yan Xie, Guoqi Li, Renfa Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Changsha China Research Institute of Hunan University in Chongqing Center for Convergence of Automobile and Cyberspace Chongqing China

ISBN: (纸本)9798350330717

Multiple processors system on chip (MPSoC) has been the trend in cyber-physical systems (CPSs), and reasonable partitioning for MPSoC resources is a critical step in CPSs design. The uncertainties of environment and time are both important factors that need to be considered in the design, but none of the previous work pays attention to two uncertainties at the same time. The state-of-the-art work presented a detailed process of applying uncertain programming to solve the partitioning problem, which provides a solution for designing in an uncertain environment. However, this work only considers the bipartition scenario which cannot be directly applied to MPSoC, and it does not focus specifically on time uncertainty. In this paper, we propose a method for modeling the MPSoC partitioning problem in an uncertain environment, with the time uncertainty concern. We present the uncertain model that can be applied to the multiple optional resources scenario. We build the optimization model with the objective of minimizing time, analyze two different cases of minimizing the uncertain time, and finally prove a unified deterministic model to solve. We come up with three algorithms, including the heuristic algorithm, the genetic algorithm, and the exact algorithm, and experiments show that the heuristic algorithm and the genetic algorithm can obtain good approximate solutions compared with the exact algorithm. © 2023 IEEE.

关键词： Cyber-physical systems (CPSs) design multiple processors system on chip (MPSoC) partitioning time uncertainty uncertain environment

来源：评论

学校读者我要写书评

暂无评论

DTS: Dynamic Traffic Scrubbing Against Link Flooding Attacks with Programmable Data Plane

DTS: Dynamic Traffic Scrubbing Against Link Flooding Attacks...

引用

2024 International Conference on Mechatronics and Intelligent Control, ICMIC 2024

作者： Zhao, Zheng Liu, Fang Meng, Zhaoran Zhao, Qi Xie, Xin Dalian Maritime University Dalian China Northeastern University Shenyang China Hunan University of Information Technology Changsha China Hunan Province Higher Education Key Laboratory of Intelligent Sensing and Computing Changsha China

ISBN: (数字)9781510686847

ISBN: (纸本)9781510686830

Link flood attacks (LFA) represent a significant cybersecurity threat due to their ability to cause extensive network disruptions. Traditional traffic scrubbing methods, relying on static rules, often struggle to counter dynamic LFAs effectively. This paper introduces the dynamic traffic scrubbing (DTS) method, leveraging programmable data planes. DTS integrates moving target defense principles into traffic scrubbing, dynamically deploying and adjusting scrubbing rules to thwart attackers. Game theory is employed to analyze the distributed denial of service attack and defense strategies. Experimental results demonstrate that DTS effectively mitigates dynamic LFAs with minimal overhead, showcasing its robustness in defending against sophisticated cyber threats. © 2025 SPIE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

QSM: A Quick Shuffling Method for Defending Against Low-Rate Denial of Service Attacks in Microservice Systems

QSM: A Quick Shuffling Method for Defending Against Low-Rate...

引用

2024 International Conference on Mechatronics and Intelligent Control, ICMIC 2024

作者： Zhao, Zheng Fan, Qiqi Zhao, Chunchang Zhao, Qi Xie, Xin Dalian Maritime University Dalian China Northeastern University Shenyang China Hunan University of Information Technology Changsha China Hunan Province Higher Education Key Laboratory of Intelligent Sensing and Computing Changsha China

ISBN: (数字)9781510686847

ISBN: (纸本)9781510686830

Microservice architecture, renowned for its flexible scalability and loose coupling, has seen widespread adoption. However, this architecture has also become a prime target for network attackers, with low-rate denial of service (LDoS) attacks posing significant threats to microservice systems. Due to their covert nature, traditional passive defense methods often fall short in countering LDoS attacks. To address this challenge, this paper introduces a microservice-oriented quick shuffling method (QSM), based on the moving target defense (MTD) principle. The QSM framework leverages the dynamic and flexible properties of microservices to implement a rapid shuffling mechanism, ensuring the protection of innocent clients. Experimental results demonstrate the effectiveness of QSM in robustly defending microservice systems against LDoS attacks. © 2025 SPIE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

ASTGNN: Adaptive Spatio-Temporal Graph Neural network for Motor Imagery Recognition

ASTGNN: Adaptive Spatio-Temporal Graph Neural Network for Mo...

引用

2024 International Conference on Mechatronics and Intelligent Control, ICMIC 2024

作者： Zhao, Zheng Xue, Haixiao Huang, Yuwen Zhao, Qi Xie, Xin Dalian Maritime University Dalian China Northeastern University Shenyang China Hunan University of Information Technology Changsha China Hunan Province Higher Education Key Laboratory of Intelligent Sensing and Computing Changsha China

ISBN: (数字)9781510686847

ISBN: (纸本)9781510686830

Motor imagery electroencephalogram recognition is a key area in brain-computer interfaces, with applications in human-computer interaction, rehabilitation, and virtual reality. Traditional methods often overlook the brain's topological characteristics and the correlations between EEG channels, resulting in suboptimal decoding. To address this, we propose an adaptive spatio-temporal graph neural network (ASTGNN), which constructs a brain graph topology and adaptively learns the topological adjacency matrix, exploring both common and individual electrode connections. The spatial features are extracted using a graph convolutional network, while a gated position-aware self-attention mechanism captures movement information and global dependencies, enhancing temporal feature extraction. Experiments show that ASTGNN significantly improves recognition, achieving an average accuracy of 87.36%. © 2025 SPIE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Multi-Attribute Resource Bidding Mechanism with Privacy Protection in Edge computing

引用

Computers, Materials & Continua 2023年第4期75卷 373-391页

作者： Shujuan Tian Wenjian Ding Gang Liu Yuxia Sun Saiqin Long Jiang Zhu Xiangtan University Xiangtan411105China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan411105China Hunan International Scientific and Technological Cooperation Base of Intelligent Network Xiangtan411105China Hunan University Changsha410082China Jinan University Guangzhou510632China

In edge computing,a reasonable edge resource bidding mechanism can enable edge providers and users to obtain benefits in a relatively fair *** maximize such benefits,this paper proposes a dynamic multiattribute resource bidding mechanism(DMRBM).Most of the previous work mainly relies on a third-party agent to exchange information to gain optimal *** isworth noting thatwhen edge providers and users trade with thirdparty agents which are not entirely reliable and trustworthy,their sensitive information is prone to be ***,the privacy protection of edge providers and users must be considered in the dynamic pricing/transaction process,which is also very ***,this paper first adopts a privacy protection algorithm to prevent sensitive information from *** the premise that the sensitive data of both edge providers and users are protected,the prices of providers fluctuate within a certain ***,users can choose appropriate edge providers by the price-performance ratio(PPR)standard and the reward of lower price(LPR)standard according to their *** two standards can be evolved by two evaluation ***,this paper employs an approximate computing method to get an approximate solution of DMRBM in polynomial ***,this paper models the bidding process as a non-cooperative game and obtains the approximate optimal solution based on two standards according to the game *** the extensive experiments,this paper demonstrates that the DMRBM satisfies the individual rationality,budget balance,and privacy protection and it can also increase the task offloading rate and the system benefits.

关键词： Edge computing approximate computing nash equilibrium privacy protection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：