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

AADEBUG 2005: 6th International Symposium on Automated and Analysis-Driven Debugging

作者： Pop, Adrian Fritzson, Peter Programming Environments Laboratory Department of Computer and Information Science Linköping University S-58183 Linköping

ISBN: (纸本)1595930507

In this paper we present the design and usage of a debugging framework for the Relational Meta-Language (RML), which is a language for writing executable Natural Semantics specifications. The language is successfully used at our department for writing large specifications for a range of languages like Java, Modelica, Pascal, MiniML etc. The RML system previously had no debugging facilities, which made it hard for programmers to debug their specifications. With this work we address these issues by providing a debugging framework for debugging high level Natural Semantics specifications in RML. Copyright 2005 ACM.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Component + aspect = An extensible and adaptable system software

Component + aspect = An extensible and adaptable system soft...

引用

2005 International Conference on Software Engineering Research and Practice, SERP'05

作者： Netinant, Paniti Department of Computer Science Bangkok University Bangkok Thailand Concurrent Programming Research Group Computer Science Department Illinois Institute of Technology Chicago IL United States

ISBN: (纸本)9781932415490

The benefits associated with separation of concerns are well established. Aspect-Orientation is a methodology that aims at separating components and aspects from the early stages of the software life cycle, and using techniques to combining them together at the implementation phase. Componentbased programming systems have shown themselves to be a natural way of constructing extensible software. Well-defined interfaces, encapsulation, late binding and polymorphism promote extensibility, yet despite this synergy, components have not been widely employed at the systems level. This is primarily due to the failure of existing component technologies to provide the protection and performance required of systems software. In this paper we identify the requirements for a component system to support extensions, and describe an extensibility and adaptability in the design of system software. We discuss an aspect-oriented framework that can simplify system design by expressing it at a higher level of abstraction. Our work concentrates on how to achieve a higher separation of aspects, components, and layers from each other. Our goal is to achieve a better design model for system software in terms of extensibility, reuse and adaptability.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Strict bidirectional type checking

Strict bidirectional type checking

引用

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

来源：评论

学校读者我要写书评

暂无评论

Inventory of deteriorating complementary and substitute items with stock dependent demand

引用

American Journal of Mathematical and Management Sciences 2005年第1-2期25卷 83-96页

作者： Maity, K. Maiti, M. Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore - 721 102 India

The optimal production for an inventory control system of deteriorating multi-items where items are of complementary or substitute types is formulated with a resource constraint. Here, it is assumed that substitute products have linearly negative effect on one another's demands and this effect is positive for the complementary items. The effect of an item on the demand of the other item depends on the inventory level of the first item. The rate of deterioration of the items is stock dependent. An item's own demand is also stock dependent, shortages are not allowed, and deteriorated items are salvaged. The total profit which consists of the sales proceeds, production cost, inventory holding cost, salvage value is formulated as a Pontryagin Optimal Control problem for both steady and transient states and evaluated using optimal control theory satisfying the Generalized Legendre condition. The model is formulated in general form for n-items and in particular, is illustrated with two items for some numerical data. The optimum results are presented both in tabular form and graphically. Copyright © 2005 by American Sciences Press, Inc.

关键词： Inventory control

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

New Algorithm for the Identification and Analysis of the Parallel Robots Singularities

引用

PAMM 2005年第1期5卷

作者： Doina Pisla Department for Mechanics and Computer Programming TU Cluj-Napoca C. Daicoviciu Str. 15 RO-400020 Cluj-Napoca Romania

The paper presents a new algorithm for the analysis of the kinematic singularities for different parallel structures using a testing stand. The derived expressions are used to superimpose graphical representations of the manipulators singularity and workspace. The analytical description of the singularity loci can be successfully used for the optimisation of the kinematic design. The derived algorithm for singularities analysis has been integrated in an already developed parallel robots simulation system, which provides an easy to read graphical representation of the singularities that enables their isolation within the working space and their avoiding in the path programming activity. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

OREGON'S GET TOUGH SENTENCING REFORM: A LESSON IN JUSTICE SYSTEM ADAPTATION

引用

Criminology & Public Policy 2006年第1期5卷

作者： NANCY MERRITT TERRY FAIN SUSAN TURNER Extensive experience conducting justice system policy studies at the state and local level. As a Policy Analyst with the RAND Corporation and government agencies she designed and directed studies focused on the development implementation and evaluation of sentencing policy as well as juvenile and adult correctional programs. Her current work focuses on the implementation and impact of mandatory sentencing laws cross-jurisdictional variations in their application and the effects of prosecutorial discretion. Additional areas of interest include the development implementation and evaluation of juvenile justice programming. Ms. Merritt received her M.S. from the Pennsylvania State University University Park and is a Ph.D. candidate with the Rutgers University School of Criminal Justice. M.A. M.S. is a Senior project associate in the Behavioral Sciences Department at RAND Corporation. He has extensive research experience in criminal justice and substance abuse. He is expert in computer statistical techniques as well as in managing large datasets. He has conducted analysis for many RAND projects and is author or co-author of numerous publications both from RAND and in peer-reviewed journals. His research interests include alternatives to incarceration substance abuse and treatment racial disparities in prison admissions and research collaborations with state and local justice agencies. Professor in the Department of Criminology Law and Society at the University of California's Irvine campus. She received her Ph.D. in Social Psychology from the University of North Carolina at Chapel Hill. She has led a variety of research projects including studies on racial disparity field experiments of private sector alternatives for serious juvenile offenders work release day fines and a 14–site evaluation of intensive supervision probation. Dr. Turner's areas of expertise include the design and implementation of randomized field experiments and research collaborations with state and local justice agencies. He

Research Summary: Oregon's Measure 11, a mandatory minimum sentencing policy passed in 1994, had fewer negative system impacts than had been anticipated by many state and local criminal justice administrators, due largely to the fact that prosecutors exercised the discretion provided them under the law to selectively prosecute cases. Consequently, fewer Measure 11-eligible cases were sentenced under the relevant statues than before passage of the measure, and more were sentenced to lesser related offenses. At the same time, incarceration rates and sentence lengths increased for both Measure 11 and lesser related offenses. Trial rates increased for two years after Measure 11 took effect before reverting to previous levels. Policy Implications: The “unintended consequences” that Measure 11 produced should not have been unexpected. Our research indicates that the entire system will quickly adapt to mitigate the more draconian outcomes predicted by those who assume a simplistic implementation, which underscores the importance of understanding system dynamics and inter-relationships before implementing reform, as well as the pitfalls of designing legislation for either symbolic appeal or formal logic rather than for actual effect.

关键词： Sentencing Reform Mandatory Minimums Prosecutorial Discretion “Get Tough” Sentencing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：