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

Simulating time harmonic flows with the lattice Boltzmann method

Physical Review E 2007年第3期75卷 036709-036709页

作者： Lilit Axner Alfons G. Hoekstra Peter M. A. Sloot []Section Computational Science Laboratory for Computing System Architecture and Programming Faculty of Science University of Amsterdam Kruislaan 403 Amsterdam 1098 SJ The Netherlands

We simulate time harmonic flows by the lattice Boltzmann method. We propose a general scheme to choose simulation parameters, under the constraints of fixed Reynolds and Womersley numbers, and with a specified simulation error. Under these constraints parameters are chosen to minimize the execution time. Numerical stability is studied in a range of Reynolds and Womersley numbers. As an example of time harmonic flow simulations, results of blood flow in a human abdominal aorta are presented.

关键词： NAVIER-STOKES EQUATION BGK METHOD STABILITY FLUID HYDRODYNAMICS TRANSITION MODELS MEDIA

来源：评论

学校读者我要写书评

暂无评论

Dynamics of control

Dynamics of control

引用

1st IEEE/IFIP International Symposium on Theoretical Aspects of Softwave Engineering

作者： Sanders, J. W. Turilli, Matteo United Nations University International Institute for Software Technology P O Box 3058 Macao Programming Research Group Oxford University Computing Laboratory Wolf Son Building Oxford OX1 3QD Parks Rd

ISBN: (纸本)9780769528564

This paper proposes a notion, the 'ambit' of an action, that allows the degree of distribution of an action in a multiagent system to be quantified without regard to its functionality. It demonstrates the use of that notion in the design, analysis and implementation of dynamically-reconfigurable multi-agent systems. It distinguishes between the extensional (or system) view and intensional (or agent-based) view of such a system and shows how, using the notion of ambit, the step-wise derivation paradigm of Formal Methods can be used to derive the latter from the former In closing it addresses the manner in which these ideas inform studies in the ethics of systems of artificial agents.

关键词： Control system analysis

来源：评论

学校读者我要写书评

暂无评论

Rewriting haskell strings 07

引用

Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

作者： Duncan Coutts Don Stewart Roman Leshchinskiy Programming Tools Group Oxford University Computing Laboratory Computer Science & Engineering University of New South Wales

ISBN: (纸本)9783540696087

The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict arrays with lazy evaluation. Equational transformations based on term rewriting are used to deforest intermediate ByteStrings automatically. We describe novel fusion combinators with improved expressiveness and performance over previous functional array fusion strategies. A library for ByteStrings is implemented, providing a purely functional interface, which approaches the speed of low-level mutable arrays in C.

关键词： deforestation functional programming program fusion

来源：评论

学校读者我要写书评

暂无评论

Clustering-Based Microcode Compression

Clustering-Based Microcode Compression

引用

IEEE International Conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Edson Borin Mauricio Breternitz Youfeg Wu Guido Araujo Institute of Computing State University of Campinas-UNICAMP Sao Paulo Brazil Programming System Laboratory Intel Corporation Santa Clara CA USA

Microcode enables programmability of (micro) architectural structures to enhance functionality and to apply patches to an existing design. As more features get added to a CPU core, the area and power costs associated with microcode increase. A recent Intel internal design targeted at low power and small footprint has estimated the costs of the microcode ROM to approach 20% of the total die area (and associated power consumption). Therefore, it is desirable to apply compression techniques to microcode. Microcode poses unique challenges for compression due to the long instruction format, the hand-coded nature of the programs and the stringent performance requirements that require fast decompression. This paper describes techniques for microcode compression that achieve .significant area and power savings, while presenting a streamlined architecture that enables high throughput within the constraints of a high performance CPU. The paper presents results for microcode compression on several commercial CPU designs which demonstrates compression ratios ranging from 50% to 62%.

关键词： Costs Energy consumption Encoding Engines Read only memory Throughput Functional programming Protection Delay Decoding

来源：评论

学校读者我要写书评

暂无评论

Dynamics of Control

Dynamics of Control

引用

Theoretical Aspects of Software Engineering (TASE)

作者： J W Sanders Matteo Turilli International Institute for Software Technology United Nations University Macau Macao China Programming Research Group Oxford University Computing Laboratory Oxford UK

This paper proposes a , the "ambit' of an action, that allows the degree of distribution of an action in a multiagent system to be quantified without regard to its functionality. It demonstrates the use of that notion in the design, analysis and implementation of dynamically-reconfigurable multi-agent systems. It distinguishes between the extensional (or system) view and intensional (or agent-based) view of such a system and shows how, using the notion of ambit, the step-wise derivation paradigm of formal methods can be used to derive the latter from the former. In closing it addresses the manner in which these ideas inform studies in the ethics of systems of artificial agents.

关键词： Multiagent systems Dynamic programming Ethics Personal digital assistants Control systems Functional programming Distributed computing Laboratories Buildings Information technology

来源：评论

学校读者我要写书评

暂无评论

Computations and relational bundles

引用

9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006

作者： Sanders, J.W. Computing Laboratory Programming Research Group Oxford University Parks Road Oxford OX1 3QD United Kingdom

ISBN: (纸本)3540378731

We explore the view of a computation as a relational section of a (trivial) fibre bundle: initial states lie in the base of the bundle and final states lie in the fibres located at their initial states. This leads us to represent a computation in 'fibre-form' as the angelic choice of its behaviours from each initial state. That view is shown to have the advantage also of permitting final states to be of different types, as might be used for example in a semantics of probabilistic computations, and of providing a natural setting for refinement of computations. However we apply that view in a different direction. On computations more general than code the two standard models, the relational and the predicate-transformer models, obey different laws. One way to understand that difference is to study the laws of more refined models, like the semantics of probabilistic computations. Another is to characterise each model by its laws. In spite of their differences, the relational model is embedded in the transformer model by a Galois connection which can be used to transfer much of the structure on transformers to the relational model. We investigate the extent to which the conjugate on predicate transformers translates to relations and use the result to motivate a characterisation of relational computations, achieved by using fibre-forms. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

CodeQuest: Scalable source code queries with datalog

引用

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

作者： Hajiyev, Elnar Verbaere, Mathieu De Moor, Oege Programming Tools Group Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD United Kingdom

ISBN: (纸本)3540357262

Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines two previous proposals, namely the use of logic programming and database systems. As the query language we use safe Datalog, which was originally introduced in the theory of databases. That provides just the right level of expressiveness;in particular recursion is indispensable for source code queries. Safe Datalog is like Prolog, but all queries are guaranteed to terminate, and there is no need for extra-logical annotations. Our implementation of Datalog maps queries to a relational database system. We are thus able to capitalise on the query optimiser provided by such a system. For recursive queries we implement our own optimisations in the translation from Datalog to SQL. Experiments confirm that this strategy yields an efficient, scalable code querying system. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Making Slicing Mainstream How can we be Weiser?

Making Slicing Mainstream How can we be Weiser?

引用

Beyond Program Slicing 2005

作者： Kalleberg, Karl Trygve Hall, Tracy Ettinger, Ran Institutt for Informatikk Universitetet i Bergen PB 7800 NorwayN-5020 Norway Department of Computer Science Hertfordshire University HertfordshireAL10 9LB United Kingdom Programming Tools Group Computing Laboratory Oxford University OxfordOX1 3QD United Kingdom

By now, the concept of program slicing has been known in the research community for around 25 years. As a research topic, it has enjoyed a fair share of popularity, evidenced by the number of articles published on the topic following Mark Weiser’s seminal paper. However, outside research circles, program slicing appears to be virtually unknown. In this report, we take the premise that program slicing is both technically relevant, and has a sufficient theoretical foundation, to be applied in practice within the software industry. With this premise in mind, we ask ourselves, "what are the mechanisms by which we as a community could make program slicing mainstream"? © 2006 Dagstuhl Seminar Proceedings. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Untangling: A slice extraction refactoring

Untangling: A slice extraction refactoring

引用

AOSD 2004: 3rd International Conference on Aspect-Oriented Software Development - Conference Proceedings

作者： Ettinger, Ran Verbaere, Mathieu Programming Tools Group Computing Laboratory University of Oxford

ISBN: (纸本)1581138423

Separation of concerns in existing code can be achieved by specific refactoring techniques. Modern refactoring tools support a number of well-known refactoring transformations, including method extraction. In this paper, we examine how method extraction can be improved through program slicing. Furthermore, we show how a generalization of such slice extraction can be applied to untangle existing code by extracting aspects. Copyright 2004 ACM.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Towards grid-aware time warp 04

Towards grid-aware time warp

引用

Workshop on Principles of Advanced and Distributed Simulation (PADS)

作者： K.A. Iskra G.D. van Albada P.M.A. Sloot Computing System Architecture and Programming Laboratory Universiteit van Amsterdam Amsterdam Netherlands

ISBN: (纸本)9780769521114

We study the adaptation of an optimistic time warp kernel to cross-cluster computing on the grid. Wide area communication, the primary source of overhead, is off-loaded onto dedicated routing processes. This allows the simulation processes to run at full speed and it thus significantly decreases the performance gap caused by the wide area distribution. Further improvements are obtained by employing message aggregation on the wide area links. We achieve many of our objectives for lazy cancellation and moderate communication, but high communication rates with aggressive cancellation remains a challenge.

关键词： Grid computing Kernel Routing Computational modeling Discrete event simulation Distributed computing Delay Computer architecture Laboratories Electronic mail

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：