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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Delay-derivative-dependent Stability Conditions for Uncertain T-S Fuzzy Systems with Interval Time-varying Delay

Delay-derivative-dependent Stability Conditions for Uncertai...

引用

第三十二届中国控制会议

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A long lifetime,low error rate RRAM design with self-repair module

引用

Journal of Semiconductors 2016年第11期37卷 94-98页

作者：尤志强胡飞黄黎明刘鹏邝继顺李实英 Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic EngineeringHunan University

Resistive random access memory （RRAM） is one of the promising candidates for future universal memory. However, it suffers from serious error rate and endurance problems. Therefore, exploring a technical solution is greatly demanded to enhance endurance and reduce error rate. In this paper, we propose a reliable RRAM architecture that includes two reliability modules： error correction code （ECC） and self-repair modules. The ECC module is used to detect errors and decrease error rate. The self-repair module, which is proposed for the first time for RRAM, can get the information of error bits and repair wear-out cells by a repair voltage. Simulation results show that the proposed architecture can achieve lowest error rate and longest lifetime compared to previous reliable designs.

关键词： self-repair ECC RRAM memristor

来源：评论

学校读者我要写书评

暂无评论

An Evidence Combination Method based on DBSCAN Clustering

引用

Computers, Materials & Continua 2018年第11期57卷 269-281页

作者： Kehua Yang Tian Tan Wei Zhang College of Computer Science and Electronic Engineering and Key Laboratory for Embedded and Network Computing of Hunan ProvinceHunan UniversityChangshaHunan410082China Department of Electrical and Computer Engineering Virginia Polytechnic Institute and State UniversityVirginiaBlacksburg24060USA

Dempster-Shafer(D-S)evidence theory is a key technology for integrating uncertain information from multiple ***,the combination rules can be paradoxical when the evidence seriously conflict with each *** the paper,we propose a novel combination algorithm based on unsupervised Density-Based Spatial Clustering of Applications with Noise(DBSCAN)density *** the proposed mechanism,firstly,the original evidence sets are preprocessed by DBSCAN density clustering,and a successfully focal element similarity criteria is used to mine the potential information between the evidence,and make a correct measure of the conflict ***,two different discount factors are adopted to revise the original evidence sets,based on the result of DBSCAN density ***,we conduct the information fusion for the revised evidence sets by D-S combination *** results show that the proposed method can effectively solve the synthesis problem of high-conflict evidence,with better accuracy,stability and convergence speed.

关键词： D-S evidence theory information fusion DBSCAN combination rules

来源：评论

学校读者我要写书评

暂无评论

Object-oriented program tailoring based on model 4

Object-oriented program tailoring based on model

引用

4th International Conference on Computer-Aided Design, Manufacturing, Modeling and Simulation, CDMMS2014

作者： Jin, Qing Kai Li, Jun Yi Zhang, Yan College of Information Science and Engineering Hunan University ChangshaHunan China Key Laboratory for Embedded and Network Computing of Hunan Province ChangshaHunan China

ISBN: (纸本)9783038351528

For the redundant codes caused by software reuse and rapid development in object-oriented program, the paper proposes a cutting model and designs a cutting scheme based on this model. Firstly, a cutting model is established. Then, static analysis is made for object-oriented codes and the cutting information base of objects to be clipped is established. Lastly, the cutting information base and cutting model is matched to cut the program. A test on a practical java project indicates that the cutting scheme can make the volume of the project reduce by about 21%. © (2014) Trans Tech Publications, Switzerland.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

A novel combination method for conflicting evidence in open frame of discernment 17

A novel combination method for conflicting evidence in open ...

引用

2017 International Conference on Data Mining, Communications and Information Technology, DMCIT 2017

作者： Yang, Kehua Liu, Youfang Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronics Hunan University Changsha China

ISBN: (纸本)9781450352185

Dempster-Shafer theory is a useful method in data fusion. To avoid counter-intuitive result of classical Dempster-Shafer's combination rule dealing with highly conflict evidences, many improved combination methods have been proposed through modifying the classical Dempster-Shafer's rule or original evidence by using a certain measure of the degree of conflict or uncertain data. However, usually the frame of discernment is incomplete, the current methods have limitation in handling this *** order to solve this problem, an improved combination method for conflicting evidence in open frame of discernment is proposed. In this paper, according to information theory the information entropy of each evidence is calculated and assigned to the unknown proposition which is added into the frame of discernment. Then reliability degree of evidences obtained by the Jousselme distance is used to revise source evidences. Finally, Dempster-Shafer's rule is applied to combine the mean of revised evidences several times. One numerical example is employed and in comparison with the existing alternatives, the proposed approach can effectively solve the conflicting problem and the incompleteness of frame. © 2017 Association for computing Machinery.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：