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

Robust initialization of differential algebraic equations

Robust initialization of differential algebraic equations

1st International Workshop on Equation-Based Object-Oriented Languages and Tools, EOOLT 2007 - In Conjunction with the ECOOP 2007 Conference

作者： Bachmann, Bernhard Aronsson, Peter Fritzson, Peter Dept. Mathematics and Engineering University of Applied Sciences D-33609 Bielefeld Germany MathCore Engineering AB Teknikringen 1F SE-583 30 Linköping Sweden Department of Computer Science PELAB Programming Environments Lab Linköping University SE-581 83 Linköping Sweden

This paper describes a new solution method applied to the problem initializing DAEs using the Modelica language. Modelica is primarily an object- oriented equ-tion-based modeling language that allows specification of mathematical models of complex natural or man-made systems. Major features of Modelica are the multidomain modeling capability and the reusability of model components corresponding to physical objects, which allow to build and simulate highly complex systems. However, initializing such models has been quite cumbersome, since initial equations have to be pro-vided at the system level, where the user needs to know details on the underlying transformation and index-reduction algorithms, that in general are applied to simulate a Modelica model.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Towards data tiling for whole programs in scratchpad memory allocation

Towards data tiling for whole programs in scratchpad memory ...

引用

12th Asia-Pacific computer Systems Architecture Conference, ACSAC 2007

作者： Li, An Wu, Hui Feng, Hui Xue, Jingling Programming Languages and Compilers Group University of New South Wales Sydney NSW 2052 Australia National ICT Australia University of New South Wales Sydney NSW 2052 Australia School of Computer Science and Engineering University of New South Wales Sydney NSW 2052 Australia

ISBN: (纸本)9783540743088

Data tiling is an array layout transformation technique that partitions an array into smaller subarray blocks. It was originally proposed to improve the cache performance of regular loops. Recently, researchers have applied this technique to scratchpad memory (SPM) allocation. Arrays whose sizes exceed a given SPM size can be tiled or divided into smaller subarray blocks or tiles and the program performance can be significantly improved by placing the smaller subarray tiles in SPM. Existing data tiling techniques are applicable to regularly-accessed arrays in individual loop nests. In embedded applications, arrays are often accessed in multiple loop nests via possibly aliased pointers. Tiling arrays in a loop nest alone will often affect the tiling and allocation decisions for arrays accessed in other loop nests. Moreover, tiling arrays accessed via aliased pointers is difficult since their access patterns are unknown at compile time. This paper presents a new data tiling approach to address these practical issues. We perform alias profiling to detect the most likely memory access patterns and use an ILP solver to select the best tiling schemes for all loop nests in the program as a whole. We have integrated data tiling in an existing SPM allocation framework. Our preliminary experimental results show that our approach can improve significantly the performance of a set of programs selected from the Mediabench suite. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

Artificial Immune Based Support Vector Machine Algorithm for Fault Diagnosis of Induction Motors

Artificial Immune Based Support Vector Machine Algorithm for...

引用

2007 International Aegean Conference on Electrical Machines and Power Electronics, vol.2

作者： I. AYDIN M. KARAKOSE E. AKIN Computer Technology and Programming Education ProgramKemaliye H. A. AKIN Technical Vocational School of Higher Education Erzincan University Kemaliye Erzincan Turkey Computer Engineering Department Firat University Elazig Turkey

The use of induction motors is widespread in industry. Many researchers have studied the condition monitoring and detecting the faults of induction motors at an early stage. Early detection of motor faults results in fast unscheduled maintenance. In this study, a new artificial immune based support vector machine algorithm is proposed for fault diagnosis of induction motors. Support vector machines (SVMs) have become one of the most popular classification methods in soft computing, recently. However, classification accuracy depends on kernel and penalty parameters. Artificial immune system has abilities of learning, memory and self adaptive control. The kernel and penalizes parameters of support vector machine are tuned using artificial immune system. The training data of support vector machine are extracted from three phase motor current. The new feature vector is constructed based on park's vector approach. The phase space of this feature vector is constructed using nonlinear time series analysis. Broken rotor bar and stator short circuit faults are classified in combined phase space using support vector machines. The experimental data are taken from a three phase induction motor. One, two and three broken rotor bar faults and 10% short circuit of stator faults are detected successfully.

关键词： Support vector machines Artificial immune system Time series analysis Fault detection and diagnosis Induction motors Stator and broken rotor bar faults

来源：评论

学校读者我要写书评

暂无评论

Biochemical mathematical modeling with Modelica and the BioChem library 6

Biochemical mathematical modeling with Modelica and the BioC...

引用

6th International Conference APLIMAT 2007

作者： Fritzson, Peter Ulfhielm, Erik Belic, Ales Fransson, Martin Grèen, Henrik PELAB - Programming Environment Lab. Dept. of Computer and Information Science Linköpings Universitet LinköpingSE-581 83 Sweden Laboratory for Modeling Simulation and Control Faculty of Electrical Engineering University of Ljubljana LjubljanaSI-1000 Slovenia Clinical Pharmacology Dept. of Medicine and Care Linköpings Universitet LinköpingSE-581 85 Sweden

ISBN: (纸本)9788096956265

Considering the large amounts of data that is nowadays produced in the biochemistry (functional genomics) it is difficult to extract the information from the measurements. There is currently also a great interest in the development of novel analytical technologies for rapid screening of disease symptoms in pharmaceutical and clinical applications. Modeling and simulation can provide a useful help in understanding the relations of the measured substances and to minimize the need for measurements. The BioChem library presented here is the first free Modelica library available for mathematical modeling of biochemical processes. Three examples are shown to illustrate the library. First, a simple insulin model is presented. Then a simplified model of cholesterol together with simulations are shown. Next, a simple drug model together with parameter estimation in NONMEN are presented. The BioChem library allows for fast and end-user friendly modeling of biomedical systems. The graphical user interface provides graphics similar to that used in the description of metabolic pathways in biochemistry.

关键词： Cholesterol

来源：评论

学校读者我要写书评

暂无评论

Graphingwiki - A semantic wiki extension for visualising and inferring protocol dependency

Graphingwiki - A semantic wiki extension for visualising and...

引用

1st Workshop on Semantic Wikis - From Wiki to Semantics, SemWiki 2006 - Co-located with the ESWC 2006

作者： Eronen, Juhani Röning, Juha Secure Programming Group Computer Engineering Laboratory University of Oulu FIN-90014 Oulu Finland

This paper introduces the Graphingwiki extension toMoinMoin Wiki. Graphingwiki enables the deepened analysis of the Wiki data by augmenting it with semantic data in a simple, practical and easy-to-use manner. Visualisation tools are used to clarify the resulting body of knowledge so that only the data essential for an usage scenario is displayed. Logic inference rules can be applied to the data to perform automated reasoning based on the data. Perceiving dependencies among network protocols presents an example use case of the framework. The use case was applied in practice in mapping effects of software vulnerabilities on critical infrastructures.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

A Lifetime Optimal Algorithm for Speculative PRE

引用

ACM Transactions on Architecture and Code Optimization 2006年第2期3卷 115-155页

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

A lifetime optimal algorithm, called MC-PRE, is presented for the first time that performs speculative PRE based on edge profiles. In addition to being computationally optimal in the sense that the total number of dynamic computations for an expression in the transformed code is minimized, MC-PRE is also lifetime optimal since the lifetimes of introduced temporaries are also minimized. The key in achieving lifetime optimality lies not only in finding a unique minimum cut on a transformed graph of a given CFG, but also in performing a data-flow analysis directly on the CFG to avoid making unnecessary code insertions and deletions. The lifetime optimal results are rigorously proved. We evaluate our algorithm in GCC against three previously published PRE algorithms, namely,MC-PREcomp (Qiong and Xue’s computationally optimal version of MC-PRE), LCM (Knoop, R¨ uthing, and Steffen’s lifetime optimal algorithm for performing nonspeculative classic PRE), and CMP-PRE (Bodik, Gupta, and Soffa’s PRE algorithm based on code-motion preventing (CMP) regions, which is speculative but not computationally optimal). We report and analyze our experimental results, obtained from both actual program execution and instrumentation, for all 22 C, C++ and FORTRAN 77 benchmarks from SPECcpu2000 on an Itanium 2 computer system. Our results show that MC-PRE (or MC-PREcomp) is capable of eliminating more partial redundancies than both LCM and CMP-PRE (especially in functions with complex control flow), and, in addition, MC-PRE inserts temporaries with shorter lifetimes than MC-PREcomp. Each of both benefits has contributed to the performance improvements in benchmark programs at the costs of only small compile-time and code-size increases in some benchmarks. © 2006, ACM. All rights reserved.

关键词： Algorithms Classic PRE Computational optimality Data-flow analysis Experimentation Languages Lifetime optimality Partial redundancy elimination Performance Speculative PRE

来源：评论

学校读者我要写书评

暂无评论

On ownership and accessibility

引用

20th European Conference on Object-Oriented programming, ECOOP 2006

作者： Lu, Yi Potter, John Programming Languages and Compilers Group School of Computer Science and Engineering University of New South Wales Sydney Australia

ISBN: (纸本)3540357262

Ownership types support information hiding by providing statically enforceable object encapsulation based on an ownership tree. However ownership type systems impose fixed ownership and an inflexible access policy. This paper proposes a novel type system which generalizes ownership types by separating object accessibility and reference capability. With the ability to hide owners, it provides a more flexible and useful model of object ownership. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A methodology for analyzing the temporal evolution of novice programs based on semantic components 06

A methodology for analyzing the temporal evolution of novice...

引用

ICER 2006 - 2nd International Computing Education Research Workshop

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

ISBN: (纸本)1595934944

Empirical studies of novice programming typically rely on code solutions or test responses as the basis of their analyses. While such data can provide insight into novice programming knowledge, they say little about the programming processes in which novices engage. For those interested in improving novice programming environments, a key research question arises: How can we collect and analyze data on novice programming that will enable us (a) to analyze and compare the programming processes promoted by alternative novice programming environments, and (b) ultimately to build better novice programming environments? To address this question, we have collected a large video corpus of novices as they construct code solutions in various versions of ALVIS Live! [17], a novice programming environment. Through detailed post-hoc analyses of our video corpus, we have developed a methodology for compiling the moment-by-moment evolution of novice code solutions. Based on an analysis of a model code solution's key semantic components, our methodology enables researchers to document, on a second-by-second basis, (a) what part of a code solution a programmer is focusing on, and (b) where the semantic feedback provided by the programming environment is helping. Although it is time and labor intensive, our methodology provides researchers with a standard set of data and representations for comparing the programming processes promoted by alternative programming environments. Copyright 2006 ACM.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

Adding procedures and pointers to the ALVIS algorithm visualization software: A preliminary design 06

Adding procedures and pointers to the ALVIS algorithm visual...

引用

SOFTVIS 06: ACM Symposium on Software Visualization

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

ISBN: (纸本)1595934642

Since the late 1990s, we have been developing ALVIS, a new breed of algorithm visualization software that supports a novel, "studio based" approach to teaching introductory programming. In this approach, students, working in pairs, use the ALVIS software to construct their own algorithmic solutions to appropriate algorithm design problems. ALVIS automatically generates accompanying algorithm visualizations, which students can augment with their own visual and storytelling elements prior to presenting them to their peers and instructor for feedback and discussion. We believe the pedagogical value of this approach rests in students' active engagement in constructing and subsequently discussing their algorithmic solutions. Previous versions of the ALVIS software have enabled students to create only single-procedure, array iterative algorithms. We describe here our preliminary work toward expanding ALVIS so that it supports parameterized procedures and pointers. Our ultimate aim is to explore the pedagogical value of using ALVIS as the basis of an entire "studio based" introductory programming course for students without prior programming experience. © 2006 by the Association for Computing Machinery, Inc.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Trace-based data cache leakage reduction at link time

Trace-based data cache leakage reduction at link time

引用

11th Asia-Pacific Conference on Advances in computer Systems Architecture, ACSAC 2006

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

ISBN: (纸本)3540400567

This paper investigates the benefits of conducting leakage energy optimisations for data caches at link time for embedded applications. We introduce an improved algorithm for identifying and constructing the traces in a binary program and present a trace-based optimisation for reducing leakage energy in data caches. Our experimental results using Mediabench benchmarks show that good leakage energy savings can be achieved at the cost of some small performance and code size penalties. Furthermore, by varying the granularity of optimisation regions, which is a tunable parameter, embedded application programmers can make the tradeoffs between energy savings and these associated costs. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：