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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An Efficient Three-Factor Privacy-Preserving Authentication and key Agreement Protocol for Vehicular Ad-Hoc network

引用

China Communications 2021年第12期18卷 315-331页

作者： Tao Xu Cheng Xu Zisang Xu School of Electronic Engineering Beijing University of Posts and TelecommunicationsBeijing 100876China Key Laboratory for Embedded and Network Computing of Hunan Province Changsha 410082China

As an indispensable part of the Intelli-gent Transportation System(ITS),the vehicular ad-hoc network(VANET)has attracted widespread atten-tion from academia and *** order to ensure the security of VANET,vehicles need to be authen-ticated before accessing the *** existing authentication protocols in VANET adopt the Trusted Authority(TA)with centralized structure which is re-sponsible for the authentication tasks of all ***,the large-scale network consume a lot of computing resources,which leads to unacceptable de-lay in message transmission in *** reducing the computational cost of TA,an efficient three-factor privacy-preserving authentication and key agreement protocol was proposed in our *** from before,the RoadSide Unit(RSU)no longer acts as an intermediate node but is responsible for assisting user authentication,which lead to the computational cost of TA is very *** formal and informal analysis,our protocol demonstrates excellent ***-pared with previous studies,our work emerges advan-tages and superiorities in the following aspects:com-putational cost,communication cost,security proper-ties and functions,message loss ratio,and message *** data and evidence indicate that our protocol is an ideal choice for large-scale VANET.

关键词： authentication vehicular ad-hoc network security three-factor

来源：评论

学校读者我要写书评

暂无评论

Holistic WCRT Analysis for Global Fixed-Priority Preemptive Multiprocessor Scheduling 23

Holistic WCRT Analysis for Global Fixed-Priority Preemptive ...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Guoqi Xie Chenglai Xiong Wei Wu Renfa Li Wanli Chang Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University China.

ISBN: (纸本)9798350323481

Many embedded applications demand both resource efficiency and timing guarantee. However, resource sharing naturally complicates the analysis that extracts the worst-case scenario out of contention. Global Fixed-Priority (GFP) preemptive multiprocessor scheduling is one of the mainstream strategies to resolve contention on computational resources. It allows jobs of the same task to be executed on different processors, hence potentially enabling better parallelism and more efficient resource utilization. Unfortunately, its worst-case response time (WCRT) analysis is challenging. Existing approaches divide a high-priority task into three workloads, namely, carry-in workload, body workload, and carry-out workload, trying to optimize them individually. In this work, we propose a holistic WCRT analysis for GFP preemptive multiprocessor scheduling, where a task is no longer divided. Specifically, (i) we establish the tight interference scenario for the task being analyzed to find the most interfering high-priority jobs in any time interval; (ii) we obtain the starting released instant of each high-priority task's first job to determine the maximum interference from high-priority tasks' first jobs to the task being analyzed; (iii) we build the worst-case tight interference scenario for the task being analyzed by combining the tight interference scenario and the starting released instants; (iv) we prove that the WCRT of the task being analyzed can be decided by the worst-case tight interference scenario. Evaluation on schedulability shows that our proposed analysis achieves 4.2%-8.6% higher acceptance ratio in randomly generated data sets than the state-of-the-art workload division approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

RTISM: Real-Time Inter-VM Communication Based on Shared Memory for Mixed-Criticality Flows 44

RTISM: Real-Time Inter-VM Communication Based on Shared Memo...

引用

44th IEEE Real-Time Systems Symposium, RTSS 2023

作者： Li, Zonghong Xie, Guoqi Ma, Wenhong Xiao, Xiongren Xie, Yong Ren, Wei Chang, Wanli College of Computer Science and Electronic Engineering Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province China Research Institute of Hunan University Chongqing China Nanjing University of Posts and Telecommunications China Huawei Technologies China

ISBN: (纸本)9798350328578

Virtual machines (VMs) have been increasingly deployed in real-time systems to enhance heterogeneous resource sharing. Despite being isolated for security and prevention of failure propagation, VMs need to communicate with each other to complete certain tasks jointly. A real-time inter-VM communication framework has been proposed based on VirtIO, which is in essence a mechanism of message passing with high latency and low scalability on data amount. In contrary, IVSHMEM implements inter-VM communication with shared memory, which is generally fast and large in throughput. Unfortunately, IVSHMEM does not resolve resource contention between flows and hence cannot be applied in real-time scenarios. In this work, we propose a real-time inter-VM communication framework RTISM built upon shared memory and IVSHMEM. RTISM provides priority-based scheduling and supports mixed-criticality flows. Worst-Case Response Time (WCRT) analysis is reported to bound the end-to-end communication delay and a Limited Priority Assignment (LPA) algorithm is developed to enhance schedulability. Experimental evaluation shows that (i) RTISM has about 4 times higher throughput than the VirtIO-based inter-VM communication framework;(ii) LPA improves schedulability by over 25% compared to the state-of-the-art;(iii) WCRT produces a tight bound. © 2023 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Real-Time Systems Symposium (RTSS)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Holistic WCRT Analysis for Global Fixed-Priority Preemptive Multiprocessor Scheduling

Holistic WCRT Analysis for Global Fixed-Priority Preemptive ...

引用

Design Automation Conference

Many embedded applications demand both resource efficiency and timing guarantee. However, resource sharing naturally complicates the analysis that extracts the worst-case scenario out of contention. Global Fixed-Priority (GFP) preemptive multiprocessor scheduling is one of the mainstream strategies to resolve contention on computational resources. It allows jobs of the same task to be executed on different processors, hence potentially enabling better parallelism and more efficient resource utilization. Unfortunately, its worst-case response time (WCRT) analysis is challenging. Existing approaches divide a high-priority task into three workloads, namely, carry-in workload, body workload, and carry-out workload, trying to optimize them individually. In this work, we propose a holistic WCRT analysis for GFP preemptive multiprocessor scheduling, where a task is no longer divided. Specifically, (i) we establish the tight interference scenario for the task being analyzed to find the most interfering high-priority jobs in any time interval; (ii) we obtain the starting released instant of each high-priority task’s first job to determine the maximum interference from high-priority tasks’ first jobs to the task being analyzed; (iii) we build the worst-case tight interference scenario for the task being analyzed by combining the tight interference scenario and the starting released instants; (iv) we prove that the WCRT of the task being analyzed can be decided by the worst-case tight interference scenario. Evaluation on schedulability shows that our proposed analysis achieves 4.2%-8.6% higher acceptance ratio in randomly generated data sets than the state-of-the-art workload division approaches.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Rolling Bearing Fault Diagnosis Method Using Multi-Sensor Data and Periodic Sampling

A Rolling Bearing Fault Diagnosis Method Using Multi-Sensor ...

引用

2022 IEEE International Conference on Multimedia and Expo, ICME 2022

作者： Zheng, Jianbo Yang, Chao Zheng, Fangrong Jiang, Bin College of Computer Science and Electronic Engineering Hunan University China Key Laboratory for Embedded and Network Computing of Hunan Province China School of Computational Science and Electronics Hunan Institute of Engineering China

ISBN: (数字)9781665485630

ISBN: (纸本)9781665485630

In recent years, bearing fault diagnosis based on deep learning has gradually become the mainstream. However, the existing studies still have some defects, such as unreasonable sampling and incomplete utilization of bearing data, limiting the further improvement of the performance of the fault diagnosis model. This paper proposes a fault diagnosis method using multi-sensor data and periodic sampling to solve the problems above. First, the vibration data of different bearing positions are fused into multi-channel fusion data to improve the defect of insufficient data utilization. Second, based on the sampling length and sampling stride, periodic sampling is carried out for the fusion data to solve the problem of unreasonable sampling. Third, the traditional convolutional neural network is adjusted to extract more detailed fault features and obtain the best recognition effect. Finally, the experimental results verify the effectiveness of the proposed method. © 2022 IEEE.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance in Time-Sensitive networking with Mixed-Critical Traffic 23

Fault Tolerance in Time-Sensitive Networking with Mixed-Crit...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Wenhong Ma Xiangzhen Xiao Guoqi Xie Nan Guan Yu Jiang Wanli Chang Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University City University of Hong Kong Tsinghua University China

ISBN: (纸本)9798350323481

As an Ethernet-based communication protocol with timing determinism, TSN (time-sensitive networking) has become a well-recognized promising in-vehicle network solution for increasingly automated automobiles. To satisfy the reliability requirement of safety-critical applications, existing works towards fault-tolerant TSN trade too much bandwidth for redundancy, limiting their scope of applicability. Targeting mixed-critical traffic, which is widely found in practice, we define a shared fault-tolerant segment that is compatible with the TSN standard. It serves the critical flows when faults occur, to improve their reliability and serves the non-critical flows when otherwise, to improve their quality of service (QoS). On top of this, we propose a space-time redundancy scheduling algorithm, aiming to make the most efficient use of bandwidth, i.e., to fulfill both the reliability as well as hard real-time requirements, and maximize the QoS with the least bandwidth. In essence, we formulate a bi-objective design space exploration problem with hundreds of thousands of decision variables and solve it with customized heuristics. Experimental results show that compared to the state-of-the-art methods, our reported work increases the number of critical flows that can be accommodated on a resource-constrained network by 3 to 4 times, and achieve the highest QoS with an average reduction of 60.3% in bandwidth. As the first work along sharing of bandwidth between mixed-critical traffic in fault-tolerant TSN, this idea can be further pursued towards higher efficiency and may be applied in general autonomous systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：