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

IEEE International Conference on computer-Aided Design

作者： Peter Fritzson Peter Aronsson Adrian Pop Hakan Lundvall Kaj Nystrom Levon Saldamli David Broman Anders Sandholm PELAB-Programming Environment Laboratory Department Computer Science Linköping University Linkoping Sweden MathCore Engineering AB Teknikringen 1B SE-583 30 Linköping Sweden EPACT AB Linköping Sweden

Modelica is a modern, strongly typed, declarative, and object-oriented language for modeling and simulation of complex systems. This paper gives a quick overview of some aspects of the OpenModelica environment - an open-source environment for modeling, simulation, and development of Modelica applications. An introduction of the objectives of the environment is given, an overview of the architecture is outlined and a number of examples are illustrated.

关键词： Open source software Education Load modeling Protection Equations Control systems System testing Packaging Connectors

来源：评论

学校读者我要写书评

暂无评论

Understanding the Relationship of VPN and SSL

引用

EDPACS 2006年第6期28卷 1-2页

作者： Michael Hines The Coordinator of Data Systems and Programming for the Schools of Engineering at Purdue University in West Lafayette Indiana. He has 35 years of combined IS audit and computing experience. Hines holds a B.S. in engineering and an MS in computer science and has completed additional coursework in management science in the Krannert Graduate School. He is active in the Central Indiana Chapter of ISACA and the Association of

T he VPN and SSL were both designed to negotiate telecom-munication security. The VPN is the Virtual Private Network; the SSL is the Secure Socket Layer or, more properly, Transport Layer Security.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic applications from the ground up

Dynamic applications from the ground up

引用

Haskell'05 - ACM SIGPLAN 2005 Haskell Workshop

作者： Stewart, Don Chakravarty, Manuel M. T. Programming Languages and Systems School of Computer Science and Engineering University of New South Wales

ISBN: (纸本)159593071X

Some Lisp programs such as Emacs, but also the Linux kernel (when fully modularised) are mostly dynamic;i.e., apart from a small static core, the significant functionality is dynamically loaded. In this paper, we explore fully dynamic applications in Haskell where the static core is minimal and code is hot swappable. We demonstrate the feasibility of this architecture by two applications: Yi, an extensible editor, and Lambdabot, a plugin-based IRC robot. Benefits of the approach include hot swappable code and sophisticated application configuration and extension via embedded DSLs. We illustrate both benefits in detail at the example of a novel embedded DSL for editor interfaces. Copyright © 2005 ACM.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Interprocedural side-effect analysis and optimisation in the presence of dynamic class loading

Interprocedural side-effect analysis and optimisation in the...

引用

28th Australasian computer Science Conference, ACSC 2005

作者： Hua, Phung Xue, Nguyen Jingling Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2032 Australia

ISBN: (纸本)1920682201

We introduce a new approach to computing interprocedural modification side effects for Java programs in the presence of dynamic class loading. When compile-time unknown classes can be loaded dynamically, the points-to and modification sets computed statically based on the analysed program, called internal world, may be incomplete. Thus, the modification side effects cannot be determined based on such sets alone. We present a technique, called internal analysis (IA), to classify the references, objects and call sites in the analysed program so that we can determine which points-to and modification sets are deffinitely complete and which may be not. By combining the points-to sets and this classification, we obtain a new IA-based interprocedural side-effect analysis for determining the modification side-effects of any statement on any variable with good accuracy. We have implemented our algorithms in Soot. This paper demonstrates two important applications of this work: partial redundancy elimination (PRE) and copy propagation for field accesses. We report significantly increased opportunities in performing these optimisations over benchmarks when compared with a recently proposed technique in these areas. Our techniques are simple since they are flow-insensitive and achieve these improvements at small analysis costs. Copyright © 2005, Australian computer Society, Inc.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Compiler-directed scratchpad memory management

Compiler-directed scratchpad memory management

引用

ICESS 2005 - 2nd International Conference on Embedded Software and Systems

作者： Jingling, Xue Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2052 Australia

ISBN: (纸本)0769525121

On-chip memory, in the form of (hardware-managed) cache,(software-managed) scratchpad memory (SPM) or some combination of both, is widely used in embedded systems. Most high-end embedded systems have both cache and SPM on-chip since each addresses a different need. Caches allow easy integration and are often effective but are un-predictable. SPMs are more energy-efficient than caches since they do not need complex tag-decoding logic. In addition, SPMs provide absolutely predictable performance but the programmer or compiler must schedule explicit data/instruction transfers between the SPM and off-chip main memory in an embedded system. In today's industry, this task is largely accomplished manually. The programmer often spends a lot of time on partitioning data and/or instructions and inserting explicit data/instruction transfers required between the SPM and main memory. Such a manual approach is time-consuming and error-prone. Obtaining satisfactory solutions for large application programs by hand can be challenging. Furthermore, hand-crafted code is not portable since it is usually customized for one particular architecture. This talk introduces a compiler approach, called memory coloring that we have recently developed to automatically allocating the arrays in a program to an SPM. The arrays are frequently used in embedded applications such as image processing and signal processing. The novelty of this approach lies in partitioning an SPM into a pseudo register file, splitting the live ranges of arrays to create potential data transfer statements between the SPM and of-chip main memory, and finally, adapting an existing graph-colouring algorithm for register allocation to assign the arrays in the program into the register file. This compiler-directed approach is efficient due to the practical efficiency of graph-colouring algorithms. We have implemented this work in the SUIF/mach SUIF compiler framework. Preliminary results over benchmarks show that this compiler

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

Completeness analysis for incomplete object-oriented programs

Completeness analysis for incomplete object-oriented program...

引用

14th International Conference on Compiler Construction, CC 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005

作者： Xue, Jingling Nguyen, Phung Hua Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney NSW 2032 Australia

We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynamic class loading. One distinctive feature of this work is that the access and modification properties of fields are taken into account. By combining with a whole-program points-to analysis, completeness analysis yields not only the required points-to sets but also determines which points-to sets and call sites are complete (when the pointed-to objects and target methods are statically resolvable) or not. Such a compositional approach yields more precise points-to sets than those computed by the points-to analysis alone. In addition, our technique also determines (for the first time) which objects may be incompletely detectable, i.e., may be missing in some statically computed points-to sets. We provide experimental evidence to demonstrate that better analysis precision in benchmarks is obtained when the field access and modification properties are exploited. In particular, we are able to find significantly more complete and mono call sites in an incomplete program, which is useful in devirtualisation and inlining. Our analysis is simple since it is flow- and context-insensitive and achieves these improvements at reasonably small analysis costs. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Personalizing and discussing algorithms within CS1 studio experiences: An observational study 05

Personalizing and discussing algorithms within CS1 studio ex...

引用

1st International Computing Education Research Workshop, ICER 2005

作者： Hundhausen, Christopher D. Brown, Jonathan Lee Visualization and End User Programming Lab School of Electrical Engineering and Computer Science Washington State University Pullman WA 99164-2752

ISBN: (纸本)1595930434

Pedagogical algorithm visualization technology aims to assist learners in understanding the dynamic behavior of computer algorithms. A key trend in past experimental studies is that learners benefit most when they are actively engaged with algorithm visualization technology. Inspired by this trend, we are exploring the pedagogical value of a novel active learning activity - the Studio Experience - within the context of an introductory CS1 unit on algorithmic problem-solving. In a Studio Experience, student pairs are given algorithm design problems, e.g., "design two alternative algorithms that reverse the values in a list." They are tasked both with constructing algorithmic solutions and accompanying visualizations, and with presenting their visualizations for feedback and discussion in a session modeled after an architectural "design crit." Through an observational study of studio experience sessions in which students used two alternative forms of visualization technology -art supplies and a computer-based tool - we gained insight into (a) the processes by which students construct visual presentations of algorithms, (b) the characteristics of their visual presentations;(c) the nature of conversations mediated by visual algorithmic solutions;and (d) the kind of visualization technology that best supports these activities. Based on our results, we suggest improvements to the approach, and propose an agenda for future empirical studies. Copyright 2004 ACM.

关键词： computer science

来源：评论

学校读者我要写书评

暂无评论

A dynamic compilation framework for controlling microprocessor energy and performance 38

A dynamic compilation framework for controlling microprocess...

引用

MICRO-38: 38th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Wu, Qiang Reddi, V.J. Wu, Youfeng Lee, Jin Connors, Dan Brooks, David Martonosi, Margaret Clark, Douglas W. Depts. of Computer Science Electrical Engjneering Princeton University Dept. of Electrical and Computer Engineering U. of Colorado Boulder Programming Systems Lab. Corporate Tech. Group Intel Corporation Division of Engineering and Applied Science Harvard University

ISBN: (纸本)0769524400

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 timeinterrupts, 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 industrialstrength 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 3X-5X better than static voltage scaling, and is more than 2X (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. © 2005 IEEE.

关键词： Microprocessor chips

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

What you see is what you code: a radically dynamic algorithm visualization development model for novice learners

What you see is what you code: a radically dynamic algorithm...

引用

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

作者： C.D. Hundhausen J.L. Brown Visualization and End User Programming Laboratory School of Electrical Engineering and Computer Science Washington State University Pullman WA USA

Pedagogical algorithm visualization systems produce graphical representations that aim to assist learners in understanding the dynamic behavior of computer algorithms. In order to foster active learning, educators have explored algorithm visualization systems that empower learners to construct their own visualizations of algorithms under study. Notably, these systems support a similar development model in which coding the algorithm is temporally distinct from viewing and interacting with the resulting visualization. To explore the benefits of narrowing the gap between coding an algorithm and viewing its visualization, we have implemented "What You See Is What You Code", a novel, "radically dynamic" development model to facilitate learner-constructed algorithm visualizations. In this model, the line of algorithm code currently being edited is reevaluated on every edit, leading to the dynamic update of an accompanying visualization of the algorithm. Analysis of usability studies involving introductory computer science students suggests that the immediacy of the model's feedback can help novices to quickly identify and correct programming errors, and ultimately to understand their code's execution.

关键词： Heuristic algorithms Visualization Feedback computer science programming profession Writing Dynamic programming Usability computer errors Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：