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

第三十二届中国控制会议

作者： AN Ji-yao XIA Xian-zhong LI Ren-fa College of Information Science and Engineering Hunan University Key Laboratory of Embedded and Network Computing of Hunan Province Hunan University

ISBN: (纸本)9781479900305

This paper considers the problem of stability analysis of uncertain T-S fuzzy systems with interval time-varying delay. The system uncertainties are assumed to be time-varying and *** new delay-derivative-dependent stability conditions are derived by constructing a novel delay-dependent Lyapunov-Krasovskii functional and estimating a tighter upper bound of its time derivative without ignoring some useful terms and involving any direct *** proposed approach leads to some less conservative LMI conditions as shown through some numerical examples.

关键词： Uncertain systems T-S fuzzy systems Stability Lyapunov-Krasovskii Functional(LKF) LMI

来源：评论

学校读者我要写书评

暂无评论

An offline scheduling algorithm for certifiable mixed-critical embedded system

An offline scheduling algorithm for certifiable mixed-critic...

引用

26th International Conference on Parallel Computational Fluid Dynamics, ParCFD 2013

作者： Wu, Chengtao Li, Renfa Key Laboratory for Embedded and Network Computing of Hunan Province Changsha 410086 China

ISBN: (纸本)9783642539619

In modern embedded platforms, safety-critical functionalities that must be certified correctly to high level of assurance co-exist with less critical software that are not subjected to certification requirements. These caused many scheduling problems. Nowadays, many researches focused on promising techniques for meeting the following two goals: (1) being able to certify the safety-critical functionalities under very conservative assumptions, and (2) ensuring high utilization of platform resources under less pessimistic assumptions. In this paper we propose an offline scheduling algorithm called OSS for certifiable mixed-criticality systems on a uniprocessor platform. Compared to previous proposed algorithm CBEDF, OSS can supply better schedulability. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

The implementation of MapReduce scheduling algorithm based on priority

The implementation of MapReduce scheduling algorithm based o...

引用

26th International Conference on Parallel Computational Fluid Dynamics, ParCFD 2013

作者： Gu, Lianjun Tang, Zhuo Xie, Guoqi Key Laboratory for Embedded and Network Computing of Hunan Province Changsha 410082 China

ISBN: (纸本)9783642539619

Nowadays cloud computing has become a popular platform for scientific applications. Cloud computing intends to share a large scale resources and equipments of computation, storage, information and knowledge for scientific researches. Job Scheduling problem is a core and challenging research issue in the current cloud computation area, and the aim is to the reasonable control of the job execution sequence as well as the allocation of computing resources, making the job total completion time of the shortest and resources are fully utilized. Data locality is one of the main factors to influence scheduling algorithm. The paper proposed an improved scheduling algorithm based on priority, after taking full account of data locality (IPDSA), which can distinguish the user's job levels, so as to reduce the job execution time and avoid losing into locally optimal solution. The experimental results on the Hadoop platform show that the new scheduling algorithm can reduce the job average execution time, and raises the rate availability of resources. © Springer-Verlag Berlin Heidelberg 2014.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Dynamic slack reclamation with EDL scheduling for periodic multimode real-time task

Dynamic slack reclamation with EDL scheduling for periodic m...

引用

26th International Conference on Parallel Computational Fluid Dynamics, ParCFD 2013

作者： Hu, Huan Li, Renfa Key Laboratory for Embedded and Network Computing of Hunan Province Changsha 410086 China

ISBN: (纸本)9783642539619

The multiframe task has been considered in dynamic real-time scheduling, its different execution mode optional feature can handle the resource waste caused by pessimistic estimation of the execution requirement. But in runtime, the selection of an instance execution mode with more execution requirement may cause a deadline miss. In this paper, we propose a slack reclamation mechanism of configuring an appropriate execution mode under deadline guarantee. This mechanism is composed of offline phase and online phase. In offline, the initial execution mode of task instances is selected and the static slack is calculated. In online, on the basis of EDL scheduling list, mode upgrade list and actual execution requirement of the instance, the slack is assigned to the instance with the highest value of the r/R in Slack available zone. Our simulation shows that this scheme can obtain a better result of the accured reward when the task's BCET is greater than 40% of its WCET. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

PFV2: Packet fragmentation with variable size and vigorous mapping in time-sensitive networking

引用

Journal of Systems Architecture 2025年 166卷

作者： Wenyan Yan Bin Fu Dongsheng Wei Renfa Li Yixue Lei Yuhang Jia Guoqi Xie Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan University Changsha 410082 Hunan China Center for Convergence of Automobile and Cyberspace Research Institute of Hunan University in Chongqing Chongqing 401120 China Hunan Engineering Research Center of Advanced Embedded Computing and Intelligent Medical Systems School of Computer and Artificial Intelligence Xiangnan University Chenzhou 423000 Hunan China Future Network Laboratory Tencent Beijing 100080 China

With the rapid advancement of intelligent automobiles, the ever-growing communication data put forward high bandwidth and low latency requirements. To meet these requirements, automotive Original Equipment Manufacturers (OEMs) widely adopt domain-centralized Electrical/Electronic (E/E) architecture. In this architecture, Time-Sensitive networking (TSN) is expected to serve as the backbone network because of its high bandwidth and deterministic communication. TSN uses the Gate Control List (GCL) to divide its time length into multiple time slots, and the time intervals of these time slots are non-uniform (equal or unequal). Different flows have varying requirements for time slot sizes. To enhance the acceptance ratio of Time-Triggered (TT) flows through GCL time slot allocation, packet fragmentation (i.e., flow fragmentation) is introduced into TSN in the recent study. The state-of-the-art packet fragmentation solution divides one un-schedulable TT flow into multiple equal-sized packets (i.e., equal-sized time slots). In other words, these fixed-size packets are difficult to be mapped into the time slots with different sizes. This study develops a Packet Fragmentation with Variable-size and Vigorous-mapping (PFV2) technique based on the following three innovations: (1) we implement variable-size packet fragmentation, which iteratively divides the un-schedulable TT flow into smaller packets and then dynamically reschedules these packets; (2) we implement the vigorous mapping solution from packets to time slots by deeply searching for available time slots within the flow’s deadline; and (3) we verify PFV2 based on the LS1028A with Cortex-A72 (i.e., the NXP automotive-grade development board). PFV2 improves the acceptance ratio by up to 20.18% and bandwidth utilization by up to 7.024% compared with the state-of-the-art solution. The theoretical and practical co-verification experiments demonstrate that the PFV2 can effectively improve the flow acceptance ratio and outpe

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Learning Based on Transfer Learning and Label Correlation

引用

Computers, Materials & Continua 2019年第7期61卷 155-169页

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

In recent years,multi-label learning has received a lot of ***,most of the existing methods only consider global label correlation or local label *** fact,on the one hand,both global and local label correlations can appear in real-world situation at same *** the other hand,we should not be limited to pairwise labels while ignoring the high-order label *** this paper,we propose a novel and effective method called GLLCBN for multi-label ***,we obtain the global label correlation by exploiting label semantic ***,we analyze the pairwise labels in the label space of the data set to acquire the local ***,we build the original version of the label dependency model by global and local label *** that,we use graph theory,probability theory and Bayesian networks to eliminate redundant dependency structure in the initial version model,so as to get the optimal label dependent ***,we obtain the feature extraction model by adjusting the Inception V3 model of convolution neural network and combine it with the GLLCBN model to achieve the multi-label *** experimental results show that our proposed model has better performance than other multi-label learning methods in performance evaluating.

关键词： Bayesian networks multi-label learning global and local label correlations transfer learning

来源：评论

学校读者我要写书评

暂无评论

keyphrase Generation Based on Self-Attention Mechanism

引用

Computers, Materials & Continua 2019年第8期61卷 569-581页

作者： Kehua Yang Yaodong Wang Wei Zhang Jiqing Yao Yuquan Le College of Computer Science and Electronic Engineering and Key Laboratory for Embedded and Network Computing of Hunan Province Hunan UniversityChangsha410082China Oath Verizon Company ManhattanNew York10007USA

keyphrase greatly provides summarized and valuable *** information can help us not only understand text semantics,but also organize and retrieve text content *** task of automatically generating it has received considerable attention in recent *** the previous studies,we can see many workable solutions for obtaining *** method is to divide the content to be summarized into multiple blocks of text,then we rank and select the most important *** disadvantage of this method is that it cannot identify keyphrase that does not include in the text,let alone get the real semantic meaning hidden in the *** approach uses recurrent neural networks to generate keyphrases from the semantic aspects of the text,but the inherently sequential nature precludes parallelization within training examples,and distances have limitations on context *** works have demonstrated the benefits of the self-attention mechanism,which can learn global text dependency features and can be *** by the above observation,we propose a keyphrase generation model,which is based entirely on the self-attention *** is an encoder-decoder model that can make up the above disadvantage *** addition,we also consider the semantic similarity between keyphrases,and add semantic similarity processing module into the *** proposed model,which is demonstrated by empirical analysis on five datasets,can achieve competitive performance compared to baseline methods.

关键词： keyphrase generation self-attention mechanism encoder-decoder framework

来源：评论

学校读者我要写书评

暂无评论

FPGA based unified architecture for public key and private key cryptosystems

引用

Frontiers of Computer Science 2013年第3期7卷 307-316页

作者： Yi WANG Renfa LI Embedded Systems and Networking Laboratory Hunan Province Key Laboratory of Network and Information Security Hunan University Changsha 410082 China Department of Electrical and Computer Engineering National University of Singapore Singapore 117576 Singapore

Recently, security in embedded system arises attentions because of modern electronic devices need cau- tiously either exchange or communicate with the sensitive data. Although security is classical research topic in world- wide communication, the researchers still face the problems of how to deal with these resource constraint devices and en- hance the features of assurance and certification. Therefore, some computations of cryptographic algorithms are built on hardware platforms, such as field program gate arrays （FPGAs）. The commonly used cryptographic algorithms for digital signature algorithm （DSA） are rivest-shamir-adleman （RSA） and elliptic curve cryptosystems （ECC） which based on the presumed difficulty of factoring large integers and the algebraic structure of elliptic curves over finite fields. Usu- ally, RSA is computed over GF（p）, and ECC is computed over GF（p） or GF（2P）. Moreover, embedded applications need advance encryption standard （AES） algorithms to pro- cess encryption and decryption procedures. In order to reuse the hardware resources and meet the trade-off between area and performance, we proposed a new triple functional arith- metic unit for computing high radix RSA and ECC operations over GF（p） and GF（2P）, which also can be extended to support AES operations. A new high radix signed digital （SD） adder has been proposed to eliminate the carry propagations over GF（p）. The proposed unified design took up 28.7% less hardware resources than implementing RSA, ECC, and AES individually, and the experimental results show that our proposed architecture can achieve 141.8 MHz using approxi- mately 5.5k CLBs on Virtex-5 FPGA.

关键词： AES RSA ECC signed-digit number FPGA cryptographic algorithms high radix arithmetic unit

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：