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

PGF: A portable run-time format for type-theoretical grammars

Journal of Logic, Language and Information 2010年第2期19卷 201-228页

作者： Angelov, Krasimir Bringert, Björn Ranta, Aarne Department of Computer Science and Engineering Chalmers University of Technology University of Gothenburg 412 96 Gothenburg Sweden Google Inc Mountain View CA United States

Portable Grammar Format (PGF) is a core language for type-theoretical grammars. It is the target language to which grammars written in the high-level formalism Grammatical Framework (GF) are compiled. Low-level and simple, PGF is easy to reason about, so that its language-theoretic properties can be established. It is also easy to write interpreters that perform parsing and generation with PGF grammars, and compilers converting PGF to other formats. This paper gives a concise description of PGF, covering syntax, semantics, and parser generation. It also discusses the technique of embedded grammars, where language processing tasks defined by PGF grammars are integrated in larger systems. © 2009 Springer science+Business Media B.V.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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) 2011年 6542 LNCS卷

作者： Erlingsson, Ulfar Wieringa, Roel Clavel, Manuel Google Inc. 1288 Pear Ave Mountain ViewCA94043 United States University of Twente Computer Science Department Drienerlolaan 5 Enschede7522 NB Netherlands Eindhoven University of Technology Faculty of Mathematics and Computer Science Den Dolech 2 Eindhoven5612 AZ Netherlands

来源：评论

学校读者我要写书评

暂无评论

Using web-scale N-grams to improve base NP parsing performance

Using web-scale N-grams to improve base NP parsing performan...

引用

23rd International Conference on Computational Linguistics, Coling 2010

作者： Pitler, Emily Bergsma, Shane Lin, Dekang Church, Kenneth Computer and Information Science University of Pennsylvania United States Department of Computing Science University of Alberta Canada Google Inc. United States Human Language Technology Center of Excellence Johns Hopkins University United States

We use web-scale N-grams in a base NP parser that correctly analyzes 95.4% of the base NPs in natural text. Web-scale data improves performance. That is, there is no data like more data. Performance scales log-linearly with the number of parameters in the model (the number of unique N-grams). The web-scale N-grams are particularly helpful in harder cases, such as NPs that contain conjunctions.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Direct construction of compact context-dependency transducers from data

Direct construction of compact context-dependency transducer...

引用

作者： Rybach, David Riley, Michael Human Language Technology and Pattern Recognition Computer Science Department RWTH Aachen University Germany Google Inc. 76 Ninth Avenue New York NY United States

This paper describes a new method for building compact context-dependency transducers for finite-state transducer-based ASR decoders. Instead of the conventional phonetic decision-tree growing followed by FST compilation, this approach incorporates the phonetic context splitting directly into the transducer construction. The objective function of the split optimization is augmented with a regularization term that measures the number of transducer states introduced by a split. We give results on a large spoken-query task for various n-phone orders and other phonetic features that show this method can greatly reduce the size of the resulting context-dependency transducer with no significant impact on recognition accuracy. This permits using context sizes and features that might otherwise be unmanageable. © 2010 ISCA.

关键词： Transducers

来源：评论

学校读者我要写书评

暂无评论

Comparative classification of species and the study of pathway evolution based on the alignment of metabolic pathways

Comparative classification of species and the study of pathw...

引用

8th Asia-Pacific Bioinformatics Conference, APBC 2010

作者： Mano, Adi Tuller, Tamir Béjà, Oded Pinter, Ron Y. Dept. of Computer Science Technion Israel Institute of Technology Haifa 32000 Israel School of Computer Science Tel Aviv University Ramat Aviv 69978 Israel Department of Molecular Microbiology and Biotechnology Tel Aviv University Ramat Aviv 69978 Israel Dept. of Biology Technion Israel Institute of Technology Haifa 32000 Israel Google Haifa MATAM 30 Haifa 31905 Israel Faculty of Mathematics and Computer Science Weizmann Institute of Science Rehovot 76100 Israel

Background: Pathways provide topical descriptions of cellular circuitry. Comparing analogous pathways reveals intricate insights into individual functional differences among species. While previous works in the field performed genomic comparisons and evolutionary studies that were based on specific genes or proteins, whole genomic sequence, or even single pathways, none of them described a genomic system level comparative analysis of metabolic pathways. In order to properly implement such an analysis one should overcome two specific challenges: how to combine the effect of many pathways under a unified framework and how to appropriately analyze co-evolution of pathways. Here we present a computational approach for solving these two challenges. First, we describe a comprehensive, scalable, information theory based computational pipeline that calculates pathway alignment information and then compiles it in a novel manner that allows further analysis. This approach can be used for building phylogenies and for pointing out specific differences that can then be analyzed in depth. Second, we describe a new approach for comparing the evolution of metabolic pathways. This approach can be used for detecting co-evolutionary relationships between metabolic pathways. Results: We demonstrate the advantages of our approach by applying our pipeline to data from the MetaCyc repository (which includes a total of 205 organisms and 660 metabolic pathways). Our analysis revealed several surprising biological observations. For example, we show that the different habitats in which Archaea organisms reside are reflected by a pathway based phylogeny. In addition, we discover two striking clusters of metabolic pathways, each cluster includes pathways that have very similar evolution. Conclusion: We demonstrate that distance measures that are based on the topology and the content of metabolic networks are useful for studying evolution and co-evolution. © 2010 Mano et al;licensee BioMed Centr

关键词： Genome

来源：评论

学校读者我要写书评

暂无评论

Energy Constrained Dominating Set for Clustering in Wireless Sensor Networks

Energy Constrained Dominating Set for Clustering in Wireless...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Julia Albath Mayur Thakur Sanjay Madria Department of Computer Science Missouri University of Science and Technology Rolla MO USA Google Inc. Mountain View CA USA

Using partitioning in wireless sensor networks to create clusters for routing, data management, and other protocols has been proven as a way to ensure scalability and to deal with sensor network shortcomings such as limited communication ranges and energy. Choosing a cluster head within each cluster is important because cluster heads use additional energy for their responsibilities and that burden needs to be carefully passed around. Many existing protocols either choose cluster heads randomly or use nodes with the highest remaining energy. We introduce the energy constrained minimum dominating set (ECDS) to model the problem of optimally choosing cluster heads with energy constraints. We propose a distributed algorithm for the constrained dominating set which runs in O(log n log) rounds with high probability. We experimentally show that the distributed algorithm performs well in terms of energy usage, node lifetime, and clustering time and, thus, is very suitable for wireless sensor networks.

关键词： Wireless sensor networks Protocols computer science Distributed algorithms Sensor phenomena and characterization Base stations Energy consumption Application software computer network management Energy management

来源：评论

学校读者我要写书评

暂无评论

On the Equilibria of Alternating Move Games 10

On the Equilibria of Alternating Move Games

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete Algorithms

作者： Aaron Roth Maria Florina Balcan Adam Kalai Yishay Mansour Carnegie Mellon University Computer Science Department Georgia Institute of Technology Microsoft Research Google Research and Tel Aviv University

ISBN: (纸本)9780898717013

We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show that alternating move games are more tractable than simultaneous move games: we give an FPTAS for computing an ε-approximate equilibrium of an alternating move game with any number of players. In contrast, it is known that for k ≥ 3 players, there is no FPTAS for computing Nash equilibria of simultaneous move repeated games unless P = PPAD. We also consider equilibria in memoryless strategies, which are guaranteed to exist in two player games. We show that for the special case of k = 2 players, all but a negligible fraction of games admit an equilibrium in pure memoryless strategies that can be found in polynomial time. Moreover, we give a PTAS to compute an ε-approximate equilibrium in pure memoryless strategies in any 2 player game that admits an exact equilibrium in pure memoryless strategies.

关键词： Game theory Players Nash equilibrium FNTA gene

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2010 conference workshops

Reports of the AAAI 2010 conference workshops

引用

作者： Aha, David W. Boddy, Mark Bulitko, Vadim D'Avila Garcez, Artur S. Doshi, Prashant Edelkamp, Stefan Geib, Christopher Gmytrasiewicz, Piotr Goldman, Robert P. Halevy, Alon Hitzler, Pascal Isbell, Charles Josyula, Darsana Kaelbling, Leslie Pack Kersting, Kristian Kunda, Maithilee Lamb, Luis C. Marthi, Bhaskara McGreggor, Keith Mihalkova, Lilyana Nastase, Vivi Natarajan, Sriraam Provan, Gregory Raja, Anita Ram, Ashwin Riedl, Mark Russell, Stuart Sabharwal, Ashish Smaus, Jan-Georg Sukthankar, Gita Tuyls, Karl Van Der Meyden, Ron Adaptive Systems Section Naval Research Laboratory Washington DC United States Adventium Labs. Minneapolis MN United States Department of Computer Science University of Alberta Canada City University London United Kingdom University of Georgia United States University of Bremen Germany School of Informatics University of Edinburgh United Kingdom University of Illinois Chicago United States Smart Information Flow Technologies LLC Minneapolis MN United States Structured Data Group Google Research United States Department of Computer Science Wright State University Dayton OH United States School of Interactive Computing Georgia Institute of Technology Atlanta GA United States Department of Computer Science Bowie State University United States Department of Computer Science and Engineering Massachusetts Institute of Technology United States Statistical Relational Mining Group Fraunhofer IAIS Germany Department of Computer Science Federal University of Rio Grande Do sul Brazil Willow Garage Inc. CA United States Computer Science Department University of Maryland College Park United States Heidelberg Institute for Theoretical Studies Heidelberg Germany Department of Computer Science University of Wisconsin Madison United States University College Cork Ireland Cork Complex Systems Lab. Ireland Department of Software and Information Systems University of North Carolina Charlotte United States Department of Computer Science and Engineering University of California Berkeley United States Department of Computer Science Cornell University United States Institute for Computational Sustainability United States University of Freiburg Germany School of Electrical Engineering and Computer Science University of Central Florida United States Maastricht University Netherlands University of New South Wales NICTA Australia

The AAAI-10 workshop program was held on July 11-12, 2010, at the Westin Peachtree Plaza in Atlanta, Georgia. The workshop program included 13 workshops covering a wide range of topics in artificial intelligence. There were several presentations on particular formalisms for combining the levels of planning from the perspectives of classical planning, motion planning, POMDPs, search-based planning, and temporal logic-based constraints. Henry Lieberman from Massachusetts Institute of technology Media Laboratory presented work developing a platform for knowledge acquisition and usage from expert users, built upon experience with eliciting information from nonexperts in a collaborative manner. The objective of the AAAI Workshop on Goal-Directed Autonomy (GDA) was to encourage discussion and novel contributions on intelligent agents that can self-select their goals. Jeremy Baxter from QinetiQ focused on user interaction, while Nick Hawes described a goal-directed reasoning framework for controlling a mobile robot.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A high-level synthesis flow for custom instruction set extensions for application-specific processors 10

A high-level synthesis flow for custom instruction set exten...

引用

Asia and South Pacific Design Automation Conference

作者： Nagaraju Pothineni Philip Brisk Paolo Ienne Anshul Kumar Kolin Paul Google India Private Limited Bangalore India Department of Computer Science and Engineering Bourns College of Engineering University of California Riverside CA USA School of Computer and Communication Sciences Ecole Polytechnique Fédérale de Lausanne Lausanne Switzerland Department of Computer Science and Engineering Indian Institute of Technology Delhi New Delhi India

ISBN: (纸本)9781605588377

Custom instruction set extensions (ISEs) are added to an extensible base processor to provide application-specific functionality at a low cost. As only one ISE executes at a time, resources can be shared. This paper presents a new high-level synthesis flow targeting ISEs. We emphasize a new technique for resource allocation, binding, and port assignment during synthesis. Our method is derived from prior work on datapath merging, and increases area reduction by accounting for the cost of multiplexors that must be inserted into the resulting datapath to achieve multi-operational functionality.

关键词： High level synthesis Application specific processors Delay Clocks Processor scheduling Resource management Registers computer science Cost function Merging

来源：评论

学校读者我要写书评

暂无评论

Effective EFSM generation for HW/SW-design verification

Effective EFSM generation for HW/SW-design verification

引用

International Baltic Electronics Conference, BEC

作者： Michele Bertasi Giuseppe Di Guglielmo Franco Fummi Graziano Pravadelli Italy Department of Computer Science University of Verona Italy AOL Research Mountain View USA Google Inc. New York USA College of Information Sciences and Technology University Park PA USA

The paper presents an automatic procedure for generating a particular kind of extended finite state machine, which allows a more uniform exploration of the state space of a design under verification. The proposed approach avoids the transition-incompatibility problem which typically arises in actual HW/SW-system descriptions. A EFSM-based ATPG, which exploits such a model, is able to more uniformly analyze the state space of the system with respect to using a generic EFSM.

关键词： Automatic test pattern generation Silicon Unified modeling language Timing Control systems Registers Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：