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

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LIDS: A Lightweight Intrusion Detection System for Controller Area network

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Yu, Zhangwei Liu, Yan Li, Renfa Chang, Wanli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Changsha410082 China Research Institute of Hunan University in Chongqing Research and Innovation Center for Convergence of Automobile and Cyberspace Chongqing401120 China

Controller Area network (CAN) is widely adopted in automobiles and susceptible to cyber attacks with the development of intelligent connected vehicles. While neural networks have demonstrated high accuracy in detection of such attacks, they consume a large amount of resources, hence unsuitable to be directly used for the automotive domain. In this work, we propose LIDS, a lightweight intrusion detection system for CAN. It first filters out DoS (Denial of Service) and Fuzzy attacks through list screening, following which, a Multi-Layer Perceptron (MLP) model is deployed to predict Impersonation attacks. Leveraging this combination, the detection accuracy is kept and the resources required are significantly reduced. LIDS is able to run on small hardware with 520KB memory and CPU of 240MHz. Its power consumption is one order of magnitude lower than the existing works, thus an excellent candidate for protection of CAN in automobiles. © 1982-2012 IEEE.

关键词： Automobiles

来源：评论

学校读者我要写书评

暂无评论

Zram Instance Pool Framework for Adaptive Memory Compression in Resource-Sensitive embedded Operating Systems

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Deng, Yin Xie, Guoqi Xiong, Chenglai Zhao, Sirong 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

Memory compression can reduce the size of the inactive data in the random access memory (RAM), thereby freeing up unused space and allowing more programs to run;however, current mainstream memory compression frameworks (e.g., Zram and Zswap) and algorithms (e.g., Zstd and Lz4) do not effectively solve the problem of increased CPU utilization, causing they cannot be directly applied to the resource-sensitive embedded operating system that is sensitive to both CPU utilization and memory usage. In this study, we develop a Zram instance pool framework called ZramPool for adaptive memory compression. The framework consists of the swap space with multiple Zram instances and the adaptive Zram compression module. Through introducing linear regression analysis, the number of Zram instances can be adaptively adjusted based on the size of the compressed data, allowing Zram instances to work in parallel to match the workload. In ZramPool, we achieve two different requirements of reducing CPU utilization while keeping compression speed and increasing compression speed while keeping CPU utilization. ZramPool is deployed in the embedded Linux OS with a 8GB memory size running on the ARMv8 architecture. For the first requirement, ZramPool can reduce CPU utilization by an average of 11.42% while the compression speed only decreases by an average of 2.4%. For the second requirement, ZramPool can increase compression speed by an average of 11.71% while the CPU utilization only increases by an average of 1.9%. © 1982-2012 IEEE.

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Multivariate Time Series Anomaly Detection in IoT

引用

Computers, Materials & Continua 2023年第6期75卷 5027-5047页

作者： Shiming He Meng Guo Bo Yang Osama Alfarraj Amr Tolba Pradip Kumar Sharma Xi’ai Yan School of Computer&Communication Engineering Changsha University of Science&TechnologyChangsha410114China Computer Science Department Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Department of Computing Science University of AberdeenAberdeenAB243FXUK Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Police AcademyChangsha410138China

Sensors produce a large amount of multivariate time series data to record the states of Internet of Things(IoT)*** time series timestamp anomaly detection(TSAD)can identify timestamps of attacks and ***,it is necessary to determine which sensor or indicator is abnormal to facilitate a more detailed diagnosis,a process referred to as fine-grained anomaly detection(FGAD).Although further FGAD can be extended based on TSAD methods,existing works do not provide a quantitative evaluation,and the performance is ***,to tackle the FGAD problem,this paper first verifies that the TSAD methods achieve low performance when applied to the FGAD task directly because of the excessive fusion of features and the ignoring of the relationship’s dynamic changes between ***,this paper proposes a mul-tivariate time series fine-grained anomaly detection(MFGAD)*** avoid excessive fusion of features,MFGAD constructs two sub-models to independently identify the abnormal timestamp and abnormal indicator instead of a single model and then combines the two kinds of abnormal results to detect the fine-grained *** on this framework,an algorithm based on Graph Attention Neural network(GAT)and Attention Convolutional Long-Short Term Memory(A-ConvLSTM)is proposed,in which GAT learns temporal features of multiple indicators to detect abnormal timestamps and A-ConvLSTM captures the dynamic relationship between indicators to identify abnormal *** simulations on a real-world dataset demonstrate that the proposed algorithm can achieve a higher F1 score and hit rate than the extension of existing TSAD methods with the benefit of two independent sub-models for timestamp and indicator detection.

关键词： Multivariate time series graph attention neural network fine-grained anomaly detection

来源：评论

学校读者我要写书评

暂无评论

CityGPT: Towards Urban IoT Learning, Analysis and Interaction with Multi-Agent System

arXiv

引用

arXiv 2024年

作者： Guan, Qinghua Ouyang, Jinhui Wu, Di Yu, Weiren Zhu, Yi Yuan, Xiang The Key Laboratory for Embedded and Network Computing of Hunan Province Hunan University Hunan Changsha410082 China The Department of Computer Science University of Warwick CoventryCV4 7AL United Kingdom

The spatiotemporal data generated by massive sensors in the Internet of Things (IoT) is extremely dynamic, heterogeneous, large scale and time-dependent. It poses great challenges (e.g. accuracy, reliability, and stability) in real-time analysis and decision making for different IoT applications. The complexity of IoT data prevents the common people from gaining a deeper understanding of it. Agentized systems help address the lack of data insight for the common people. We propose a generic framework, namely CityGPT, to facilitate the learning and analysis of IoT time series with an end-to-end paradigm. CityGPT employs three agents to accomplish the spatiotemporal analysis of IoT data. The requirement agent facilitates user inputs based on natural language. Then, the analysis tasks are decomposed into temporal and spatial analysis processes, completed by corresponding data analysis agents (temporal and spatial agents). Finally, the spatiotemporal fusion agent visualizes the system’s analysis results by receiving analysis results from data analysis agents and invoking sub-visualization agents, and can provide corresponding textual descriptions based on user demands. To increase the insight for common people using our framework, we have agnentized the framework, facilitated by a large language model (LLM), to increase the data comprehensibility. Our evaluation results on real-world data with different time dependencies show that the CityGPT framework can guarantee robust performance in IoT computing. Copyright © 2024, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Parallel and Distributed Systems (ICPADS)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Real-Time Systems Symposium (RTSS)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Personalized News Recommendation Based on the Text and Image Integration

引用

Computers, Materials & Continua 2020年第7期64卷 557-570页

作者： Kehua Yang Shaosong Long Wei Zhang Jiqing Yao Jing Liu College of Computer Science and Electronic Engineering and Key Laboratory for Embedded and Network Computing of Hunan Province Hunan UniversityChangsha410082China Oath Verizon Company New York10007USA

The personalized news recommendation has been very popular in the news recommendation *** most research,the picture information in the news is ignored,but the information conveyed to the users through pictures is more intuitive and more likely to affect the users’reading interests than the one in the textual ***,in this paper,a model that combines images and texts in the news is *** this model,the new tags are extracted from the images and texts in the news,and based on these new tags,an adaptive tag(AT)algorithm is *** AT algorithm selects the tags the user is interested in based on the user *** particular,the AT algorithm can predict tags that a user may be interested in with the help of the tag correlation graph without any user *** proposed AT algorithm is verified by *** experimental results verified the AT algorithm regarding three evaluation indexes F1-score(F1),area under curve(AUC)and mean reciprocal rank(MRR).The recommended effect of the proposed algorithm is found to be better than those of the various baseline algorithms on real-world datasets.

关键词： News recommendation F1 AUC MRR feedback correlation graph

来源：评论

学校读者我要写书评

暂无评论

A Novel ICD Coding Method Based on Associated and Hierarchical Code Description Distillation

arXiv

引用

arXiv 2024年

作者： Zhang, Bin Wang, Junli Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai201804 China Collaborative Innovation Center for Financial Network Security Tongji University Shanghai201804 China

ICD(International Classification of Diseases) coding involves assigning ICD codes to patients visit based on their medical notes. ICD coding is a challenging multilabel text classification problem due to noisy medical document inputs. Recent advancements in automated ICD coding have enhanced performance by integrating additional data and knowledge bases with the encoding of medical notes and codes. However, most of them ignore the code hierarchy, leading to improper code assignments. To address these problems, we propose a novel method based on associated and hierarchical code description distillation (AHDD) for better code representation learning and avoidance of improper code *** utilize the code description and the hierarchical structure inherent to the ICD codes. Therefore, in this paper, we leverage the code description and the hierarchical structure inherent to the ICD codes. The code description is also applied to aware the attention layer and output layer. Experimental results on the benchmark dataset show the superiority of the proposed method over several state-of-the-art baselines. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：