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

International SoC Design Conference, ISOCC

作者： Ka Lok Man Abhinav Asthana K. Kapoor Hemangee Tomas Krilavicius Jian Chang Dept. of Computer Science and Software Engineering Xi'an Jiaotong-Liverpool University (XJTLU) China Bangalore India Indian Institute of Technology Guwahati Baltic Institute of Advanced Technologies (BPTI) Vilnius Lithuania Texas Instruments Inc USA

The purpose of this paper is to investigate applicability of Null Conventional Logic (NCL) for synthesising asynchronous control circuits using. The target implementation being delay insensitive (DI), the specification language also should be DI. Delay Insensitive Sequential Processes (DISP) is such a process algebraic language where the behaviour of asynchronous control logic blocks can be expressed as processes. We have mapped several basic DISP constructs to NCL and performed a small cases study. It is a step towards an alternative synthesis way for NCL circuits.

关键词： Logic gates Solid modeling Integrated circuit modeling Variable speed drives Lead Synchronization

来源：评论

学校读者我要写书评

暂无评论

software Language engineering: Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2010年 5969 LNCS卷 V-VI页

作者： Van Den Brand, Mark Gaševíc, Dragan Gray, Jeff Dept. of Mathematics and Computer Science Software Engineering and Technology Eindhoven University of Technology Den Dolech 2 5612 AZ Eindhoven Netherlands School of Computing and Information Systems Athabasca University 1 University Drive Athabasca AB T9S 3A3 Canada Department of Computer Science University of Alabama P.O. Box 870290 Tuscaloosa AL United States

来源：评论

学校读者我要写书评

暂无评论

Multi-layer Prefetching for Hybrid Storage Systems: Algorithms, Models, and Evaluations

Multi-layer Prefetching for Hybrid Storage Systems: Algorith...

引用

International Conference on Parallel Processing Workshops (ICPPW)

作者： Mais Nijim Ziliang Zong Xiao Qin Yousef Nijim Department of Electrical Engineering and Computer Science Texas A and M University Kingsville Kingsville TX USA Dept. of Math. & Comput. Sci. South Dakota Sch. of Mines & Technol. Rapid City SD USA Department of Computer Science and Software Engineering Aubum University Auburn AL USA IEEE Senior Member Cox Commun. Atlanta GA USA

Parallel storage systems have been highly scalable and widely used in support of data-intensive applications. In future systems with the nature of massive data processing and storing, hybrid storage systems opt for a solution to fulfill a variety of demands such as large storage capacity, high I/O performance and low cost. Hybrid storage systems (HSS) contain both high-end storage components (e.g. solid-state disks and hard disk drives) to guarantee performance, and low-end storage components (e.g. tapes) to reduce cost. In HSS, transferring data back and forth among solid-state disks (SSDs), hard disk drives (HDDs), and tapes plays a critical role in achieving high I/O performance. Prefetching is a promising solution to reduce the latency of data transferring in HSS. However, prefetching in the context of HSS is technically challenging due to an interesting dilemma: aggressive prefetching is required to efficiently reduce I/O latency, whereas overaggressive prefetching may waste I/O bandwidth by transferring useless data from HDDs to SSDs or from tapes to HDDs. To address this problem, we propose a multi-layer prefetching algorithm that can judiciously prefetch data from tapes to HDDs and from HDDs to SSDs. To evaluate our algorithm, we develop an analytical model and the experimental results reveal that our prefetching algorithm improves the performance in hybrid storage systems.

关键词： Prefetching Libraries Hard disks Bandwidth Switches Storage area networks Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Markov Decision Process-based analysis of rechargeable nodes in Wireless Sensor Networks 10

Markov Decision Process-based analysis of rechargeable nodes...

引用

Proceedings of the 2010 Spring Simulation Multiconference

作者： Misra, Sudip Rout, Rashmi Ranjan Krishna, T. Raghu Vamsi Manilal, Patel Manish Kumar Obaidat, Mohammad S. School of IT IIT Kharagpur Kharagpur India G.S. Sanyal School of Telecommunications IIT Kharagpur Kharagpur India SCS and IEEE Computer Science and Software Engineering Dept. Monmouth University W. Long Branch NJ United States

ISBN: (纸本)9781450300698

Wireless Sensor Networks (WSNs) are popular nowadays for applications ranging from environmental monitoring to object tracking and surveillance. But the sensors which are deployed are energy constrained. The nodes in WSNs deplete of their very limited energy over time. In this work, we consider a network of rechargeable sensors deployed in a random sensing environment. Using Markov Decision Processes (MDP), we analyze the sensor nodes having different levels of energies in the batteries, so as to maximize a generalized system performance in terms of recharge delay and the number of sensor nodes recharged. We have formulated a relationship between the residual energy level of a sensor node and the recharge delay. The simulation results establish the effectiveness of our approach in decreasing the number of passive nodes and the recharge delay in WSNs. © 2010 SCS.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Feedback dynamic algorithms for preemptable job scheduling in cloud systems

Feedback dynamic algorithms for preemptable job scheduling i...

引用

2010 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2010

作者： Li, Jiayin Qiu, Meikang Niu, Jianwei Gao, Wenzhong Zong, Ziliang Qin, Xiao Dept. of Elec. and Comp. Engr. University of Kentucky Lexington KY 40506 United States School of Computer Science and Engineering Beihang University Beijing 100191 China Dept. of Elec. and Comp. Engr. University of Denver Denver CO 80210 United States Dept. of Math. and Comp. Sci. South Dakota School of Mines Rapid City SD 57702 United States Dept. of Comp. Sci. and Software Engr. Auburn University Auburn AL 36849 United States

ISBN: (纸本)9780769541914

An infrastructure-as-a-service cloud system provides computational capacities to remote users. Parallel processing in the cloud system can shorten the execution of jobs. Parallel processing requires a mechanism to scheduling the executions order as well as resource allocation. Furthermore, a preemptable scheduling mechanism can improve the utilization of resources in clouds. In this paper, we present a preemptable job scheduling mechanism in cloud system. We propose two feedback dynamic scheduling algorithms for this scheduling mechanism. We compare these two scheduling algorithms in simulations. The results show that the feedback procedure in our algorithms works well in the situation where resource contentions are fierce. © 2010 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Assessment of NER solutions against the first and second CALBC Silver Standard Corpus

Assessment of NER solutions against the first and second CAL...

引用

4th International Symposium on Semantic Mining in Biomedicine, SMBM 2010

作者： Rebholz-Schuhmann, Dietrich Yepes, Antonio Jimeno Li, Chen Kafkas, Senay Lewin, Ian Kang, Ning Corbett, Peter Milward, David Buyko, Ekaterina Beisswanger, Elena Hornbostel, Kerstin Kouznetsov, Alexandre Witte, René Laurila, Jonas B. Baker, Christopher J.O. Kuo, Cheng-Ju Clematide, Simone Rinaldi, Fabio Farkas, Richárd Móra, György Hara, Kazuo Furlong, Laura Rautschka, Michael Neves, Mariana Lara Pascual-Montano, Alberto Wei, Qi Collier, Nigel Chowdhury, Md. Faisal Mahbub Lavelli, Alberto Berlanga, Rafael Morante, Roser Van Asch, Vincent Daelemans, Walter Marina, José Luís Van Mulligen, Erik Kors, Jan Hahn, Udo EMBL Outstation European Bioinformatics Institute Hinxton Cambridge CB10 1SD United Kingdom Dept. of Medical Informatics Erasmus University Medical Center Rotterdam NL Netherlands Linguamatics Ltd. St. John's Innovation Centre Cambridge United Kingdom Lab. Friedrich-Schiller-Universität Jena Germany Dept. of Computer Science and Applied Statistics University of New Brunswick Canada Dept. of Computer Science and Software Engineering Concordia University Montreal Canada Institute of Information Science Academia Sinica Taipei 115 Taiwan University of Zürich Switzerland Research Group on Artificial Intelligence Hungarian Academy of Sciences Hungary Institute of Science and Technology Nara Japan IMIM DCEX Universitat Pompeu Fabra Barcelona Spain Madrid Spain National Institute of Informatics Tokyo Japan Fondazione Bruno Kessler Trento Italy Universitat Jaume I Spain CLiPS University of Antwerp Belgium Complutense University of Madrid Spain

Background: Text mining challenges have been organised to measure the performance of automatic text mining solutions against a manually annotated gold standard corpus (GSC). The preparation of the GSC is timeconsuming and costly and the final corpus consists at the most of a few thousand documents annotated with a limited set of semantic groups. To overcome these shortcomings, the CALBC project partners (PPs) have produced a large-scale annotated biomedical corpus with four different semantic groups through the harmonisation of annotations from automatic text mining solutions, the first version of the Silver Standard Corpus (SSC-I). The four semantic groups were chemical entities and drugs (CHED), genes and proteins (PRGE), diseases and disorders (DISO) and species (SPE). This corpus has been used for the First CALBC Challenge asking the participants to annotate the corpus with their annotation solutions.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Propagating Requirement Change into software High Level Designs towards Resilient software Evolution

Propagating Requirement Change into Software High Level Desi...

引用

16th Asia-Pacific software engineering Conference

作者： Ibrahim, Noraini Kadir, Wan M. N. Wan Deris, Safaai Software Engineering Dept. Faculty of Computer Science and Information System Universiti Teknologi Malaysia Malaysia

ISBN: (纸本)9780769539096

Uncertain and incomplete requirements throughout the whole software life cycle contribute to volatility of the requirements. In a situation where the volatile requirement is changed to satisfy stakeholder needs, all the affected requirements and other impacted software artefacts (such as designs, codes, and tests) must be identified and changed accordingly. This paper introduces an approach to facilitate both engineers and users in propagating changes from requirements to the software high-level designs during software development and evolution. The two main pillars of this approach, namely product metamodel and process model are described in details. Firstly, the metamodel highlights on explicit conceptual model for volatile requirement and its characteristics. Next, the focus will be placed on the systematic process model specified using the SPEM that offers guidelines to perform the requirement change process. The applicability of the product metamodel and its elements are evaluated using the IFAMMS case study application.

关键词： Volatile Requirement Change Propagation software High Level Designs software Evolution

来源：评论

学校读者我要写书评

暂无评论

A Re-examination of Lexical Association Measures

A Re-examination of Lexical Association Measures

引用

2009 Workshop on Multiword Expressions: Identification, Interpretation, Disambiguation, Applications, MWE 2009

作者： Hoang, Hung Huu Kim, Su Nam Kan, Min-Yen Dept. of Computer Science National University of Singapore Singapore Dept. of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)1932432604

We review lexical Association Measures (AMs) that have been employed by past work in extracting multiword expressions. Our work contributes to the understanding of these AMs by categorizing them into two groups and suggesting the use of rank equivalence to group AMs with the same ranking performance. We also examine how existing AMs can be adapted to better rank English verb particle constructions and light verb constructions. Specifically, we suggest normalizing (Pointwise) Mutual Information and using marginal frequencies to construct penalization terms. We empirically validate the effectiveness of these modified AMs in detection tasks in English, performed on the Penn Treebank, which shows significant improvement over the original AMs. © 2009 ACL and AFNLP

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Ballot permutations in Prêt à voter

Ballot permutations in Prêt à voter

引用

2009 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections, EVT/WOTE 2009, Held in Conjunction with the 18th USENIX Security Symposium

作者： Ryan, Peter Y.A. Teague, Vanessa Dept. Computer Science and Communications University of Luxembourg Luxembourg Dept. Computer Science and Software Engineering University of Melbourne Australia

Handling full permutations of the candidate list along with re-encryption mixes is rather difficult in Prêt à Voter but handling cyclic shifts is straightforward. One of the versions of Prêt à Voter that uses Paillier encryption allows general permutations of candidates on the ballot, rather than just cyclic shifts. This improves the robustness of the system against an adversary who tries to alter checkmarks on ballots before they are posted to the bulletin board. Even if the adversary could predict which voters would fail to check their vote on the bulletin board, the best they could do would be to choose another random candidate. By contrast, when using only cyclic shifts the adversary can systematically shift a biased distribution from one candidate to another. We show in this note that the Paillier version of Prêt à Voter with full permutations of the candidates is not receipt-free when the number of possible permutations is much larger than the number of voters, and we propose a construction that addresses this issue while retaining the defence against an adversary who can shift checkmarks. © EVT/WOTE 2009 - 2009 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections. All rights reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2010年第PART 3期6278 LNAI卷 VI页

作者： Setchi, Rossitza Jordanov, Ivan Howlett, Robert J. Jain, Lakhmi C. Cardiff University School of Engineering The Parade Cardiff CF24 3AA United Kingdom University of Portsmouth Dept. of Computer Science and Software Engineering Buckingham Building Lion Terrace Portsmouth PO1 3HE United Kingdom KES International 145-157 St. John Street London EC1V 4PY United Kingdom University of South Australia School of Electrical and Information Engineering Mawson Lakes Campus Adelaide SA 5095 Australia

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：