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

TLDI'05: 2005 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation

作者： Chlipala, Adam Petersen, Leaf Harper, Robert Computer Science Division University of California Berkeley United States Programming Systems Laboratory Intel Corporation United States Computer Science Department Carnegie Mellon University United States

ISBN: (纸本)1581139993

Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, the completely annotated forms are almost never used in practice, since partially annotated forms can be defined which still allow syntax directed type checking. An additional optimization that is used in some proof and type systems is to take advantage of the context of occurrence of terms to further elide type information using bidirectional type checking rules. While this technique is generally effective, we show that there exist bidirectional terms which exhibit asymptotic increases in the size of their type decorations when sequentialized into a named-form calculus (a common first step in compilation). In this paper, we introduce a refinement of the bidirectional type system based on strict logic which allows additional type decorations to be eliminated, and show that it is well-behaved under sequentialization. Copyright 2005 ACM.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

The use of a Reasoning process to solve the almost SLAM Challenge at the Robocup legged league

The use of a Reasoning process to solve the almost SLAM Chal...

引用

8th Catalan Conference on Artificial Intelligence, CCIA 2005

作者： Monferrer, M. Teresa Escrig Broch, Juan Carlos Peris Jaume I University Engineering and Computer Science Department Campus Riu Sec CastellónE-12071 Spain Jaume I University Programming Languages and Computer Systems Department Campus Riu Sec CastellónE-12071 Spain

ISBN: (纸本)1586035606

The problem that a robot navigates autonomously through its environment, builds its own map and localizes itself in the map (known a the SLAM problem), is still an open problem. Most of the approaches to solve the SLAM problem divide the space into regions and compute the probability that the robot is in each region. We propose in this paper a different solution based on the use of a reasoning process to build the map, which will provide the following advantages: (1) we will store in the map hybrid (qualitative + quantitative) information from landmarks. Qualitative representation will allow us the management of the uncertainty information provided by the robot sensors;and (2) we will store in the map relative information of the landmarks which appear in the environment, therefore the map will be independent of the point of view of the robot. Moreover, we are going to use a reasoning process which will allow us to solve three very important problems in robotics: (a) where the robot is;(b) which is the orientation of the map where the robot is;and (c) towards where the robot should go according to the map to follow a plan. © 2005 The authors. All rights reserved.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Heterogeneous computing

Heterogeneous computing

引用

作者： Kalinov, Alexey Lastovetsky, Alexey Robert, Yves Institue for System Programming Russain Academy of Sciences B. Kommunisticheskaya 25 109004 Moscow Russia Department of Computer Science University College Dublin Belfield Dublin 4 Ireland LIP Ecole Normale Supérieure de Lyon Laboratoire LIP F-69364 Lyon Cedex 07 France

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

A dynamic compilation framework for controlling microprocessor energy and performance

A dynamic compilation framework for controlling microprocess...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Qiang Wu V.J. Reddi Youfeng Wu Jin Lee D. Connors D. Brooks M. Martonosi D.W. Clark Depts. of Computer Science Electrical Engineering Princeton University USA Department of Electrical and Computer Engineering University of Colorado Boulder USA Programming Systems Laboratory Intel Corporation USA Division of Engineering and Applied Science Harvard University USA

Dynamic voltage and frequency scaling (DVFS) is an effective technique for controlling microprocessor energy and performance. Existing DVFS techniques are primarily based on hardware, OS time-interrupts, or static-compiler techniques. However, substantially greater gains can be realized when control opportunities are also explored in a dynamic compilation environment. There are several advantages to deploying DVFS and managing energy/performance tradeoffs through the use of a dynamic compiler. Most importantly, dynamic compiler driven DVFS is fine-grained, code-aware, and adaptive to the current microarchitecture environment. This paper presents a design framework of the run-time DVFS optimizer in a general dynamic compilation system. A prototype of the DVFS optimizer is implemented and integrated into an industrial-strength dynamic compilation system. The obtained optimization system is deployed in a real hardware platform that directly measures CPU voltage and current for accurate power and energy readings. Experimental results, based on physical measurements for over 40 SPEC or Olden benchmarks, show that significant energy savings are achieved with little performance degradation. SPEC2K FP benchmarks benefit with energy savings of up to 70% (with 0.5% performance loss). In addition, SPEC2K INT show up to 44% energy savings (with 5% performance loss), SPEC95 FP save up to 64% (with 4.9% performance loss), and Olden save up to 61% (with 4.5% performance loss). On average, the technique leads to an energy delay product (EDP) improvement that is 3times-5times better than static voltage scaling, and is more than 2times (22% vs. 9%) better than the reported DVFS results of prior static compiler work. While the proposed technique is an effective method for microprocessor voltage and frequency control, the design framework and methodology described in this paper have broader potential to address other energy and power issues such as di/dt and thermal control

关键词： Dynamic compiler Microprocessors Performance loss Voltage control Hardware Energy measurement Dynamic voltage scaling Frequency Energy management Microarchitecture

来源：评论

学校读者我要写书评

暂无评论

Efficient compilation of lazy evaluation

Efficient compilation of lazy evaluation

引用

作者： Johnsson, Thomas Programming Methodology Group Department of Computer Science Chalmers University of Technology S-412 96 Göteborg Sweden

This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined functions are used as rewrite rules in the graph. Each function is compiled into an instruction sequence for an abstract graph reduction machine, called the G-machine, the code reduces a function application graph to its value. The G-machine instructions are then translated into target code. Speed improvements by almost two orders of magnitude over previous lazy evaluators have been measured;we provide some performance figures.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

The weakest failure detectors to solve certain fundamental problems in distributed computing 04

The weakest failure detectors to solve certain fundamental p...

引用

Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing

作者： Delporte-Gallet, Carole Hadzilacos, Vassos Fauconnier, Hugues Kouznetsov, Petr Guerraoui, Rachid Toueg, Sam LIAFA Université Paris 7 France Department of Computer Science University of Toronto Canada Distributed Programming Laboratory EPFL Switzerland

ISBN: (纸本)9781581138023

We determine the weakest failure detectors to solve several fundamental problems in distributed message-passing systems, for all environments - i.e., regardless of the number and timing of crashes. The problems that we consider are: implementing an atomic register, solving consensus, solving quittable consensus (a variant of consensus in which processes have the option to decide 'quit' if a failure occurs), and solving non-blocking atomic commit.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Improving grammar-based evolutionary algorithms via attributed derivation trees

Improving grammar-based evolutionary algorithms via attribut...

引用

7th European Conference on Genetic programming, EuroGP 2004

作者： Zvada, Szilvia Ványi, Róbert Department of Programming Systems Friedrich-Alexander University Martensstraße 3 ErlangenD-91058 Germany Department of Theoretical Computer Science Friedrich-Alexander University Martensstraße 3 ErlangenD-91058 Germany

ISBN: (纸本)3540213465

Using Genetic programming difficult optimization problems can be solved, even if the candidate solutions are complex objects. In such cases, it is a costly procedure to correct or replace the invalid individuals that may appear during the evolutionary process. Instead of such post-processing, context-free grammars can be used to describe the syntax of valid solutions, and the algorithm can be modified to work on derivation trees, such that it does not generate invalid individuals. Although tree operators have the advantage of good parameterizability, it is not trivial to construct them correctly and efficiently. In this paper an already existing method for derivation tree evolution and its extension towards attributed derivation trees are discussed. As the result of this extension the operators are not only faster but they are easy to parameterize, moreover the algorithm is better guided, thus it can converge faster. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

EkSarva: an intelligent collaboration framework

EkSarva: an intelligent collaboration framework

引用

International IEEE Conference on Intelligent Systems, IS

作者： R. Reddy S. Selliah V. Bharadwaj Jinqiao Yu S. Kankanahalli S. Reddy Smart Internet Programming Laboratory Concurrent Engineering Research Center Lane Department of Computer Science and Electrical Engineering West Virginia University Morgantown WV USA

Ubiquitous computing and universal network connectivity have given rise to expectations of building a Digital Society, where many aspects of business and social activities may be accomplished by remote participants. Intelligent, context-aware, and workflow-centric collaboration is an essential prerequisite to fulfill that expectation. EkSarva is a framework, which enables realization of such collaborations in diverse domains. This is accomplished by identifying the key concepts and their inter-relationships (dubbed the PPP/SST paradigm), which form the foundation of this framework. The key concepts include: (a) Project, (b) Person, (c) Place, (d) Signal, (e) Situation, and (f) Transcript. This paper describes how these concepts collectively can give rise to an intelligent collaboration environment.

关键词： Collaboration Collaborative work Internet Java computer networks Intelligent networks Signal processing Intelligent structures Intelligent agent Laboratories

来源：评论

学校读者我要写书评

暂无评论

The Effects of Algorithm Visualizations with Storylines on Retention: An Experimental Study

The Effects of Algorithm Visualizations with Storylines on R...

引用

IEEE Symposium on Visual Languages and Human Centric Computing (VL/HCC)

作者： C.D. Hundhausen R. Patterson J. Lee Brown S. Farley Visualization and End User Programming Laboratory College of Electrical Engineering and Computer Science Washington State University Pullman WA USA Department of Psychology Washington State University Pullman WA USA

Algorithm visualizations graphically illustrate how algorithms work. In prior ethnographic studies of a computer science course in which students were required to construct and present their own algorithm visualizations, we observed that visualizations based on storylines tended to stimulate increased audience interest and involvement. This observation, coupled with the empirical research that substantiates the value of stories as mnemonic devices, raises an interesting research question: Do visualizations with storylines actually help students remember the procedural behavior of an algorithm better than visualizations that do not involve storylines? To investigate this question, we conducted an experimental study that compared the memorability of algorithm descriptions involving differing degrees of spatial and verbal embellishment. The study failed to detect significant differences. We reflect on our lack of significant results, and suggest two alternative paths for future research into the value of story-based algorithm visualization

关键词： Visualization computer science Laboratories Testing programming profession Educational institutions Psychology Motion pictures Feedback Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A general symbolic PDE solver generator: Beyond explicit schemes

引用

Scientific programming 2003年第3期11卷 225-235页

作者： Sheshadri, K. Fritzson, Peter Programming Environment Laboratory Department of Computer Science Linköping University S-581 83 Linköping Sweden

This paper presents an extension of our Mathematica- and MathCode-based symbolic-numeric framework for solving a variety of partial differential equation (PDE) problems. The main features of our earlier work, which implemented explicit finite-difference schemes, include the ability to handle (1) arbitrary number of dependent variables, (2) arbitrary dimensionality, and (3) arbitrary geometry, as well as (4) developing finite-difference schemes to any desired order of approximation. In the present paper, extensions of this framework to implicit schemes and the method of lines are discussed. While C++ code is generated, using the MathCode system for the implicit method, Modelica code is generated for the method of lines. The latter provides a preliminary PDE support for the Modelica language. Examples illustrating the various aspects of the solver generator are presented.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：