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

International Conference on Computational Science, ICCS 2003

作者： Artoli, A.M. Kandhaiy, D. Hoefsloot, H.C.J. Hoekstra, A.G. Sloot, P.M.A. Section Computational Science Laboratory for Computing Systems Architecture and Programming Faculty of Science University of Amsterdam Kruislaan 403 Amsterdam1098 SJ Netherlands Kramers Laboratorium voor Fysische Technologie Faculty of Applied Sciences Delft Netherlands Department of Chemical Engineering Faculty of Science University of Amsterdam Amsterdam Netherlands

ISBN: (纸本)9783540448600

Surgical planning as a treatment for vascular diseases re- quires fast blood ow simulations that are eÆcient in handling changing geometry. It is, for example, necessary to try diþerent paths of a planned bypass and study the resulting hemodynamic ow ýelds before decid- ing the ýnal geometrical solution. With the aid of a real time interactive simulation environment that uses an eÆcient ow solver, this allows ex- ible treatment planning. In this article, we demonstrate that the lattice Boltzmann method can be an alternative robust CFD technique for such kind of applications. Steady ow in a 2D symmetric bifurcation is studied and the obtained ow ýelds and stress tensor components are compared to those obtained by a Navier-Stokes (NS) solver. We also demonstrate that the method is fully adaptive to interactively changing geometry. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Supporting mobility in content-based publish/subscribe middleware

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2672卷 103-122页

作者： Fiege, Ludger Gärtner, Felix C. Kasten, Oliver Zeidler, Andreas Department of Computer Science Databases Distributed System Group D-64283 Darmstadt Germany School of Computer and Communication Sciences Distributed Programming Laboratory CH-1015 Lausanne Switzerland Department of Computer Science Distributed Systems Group CH-8092 Zurich Switzerland

Publish/subscribe (pub/sub) is considered a valuable middleware architecture that proliferates loose coupling and leverages reconfigurability and evolution. Up to now, existing pub/sub middleware was optimized for static systems where users as well as the underlying system structure were rather fixed. We study the question whether existing pub/sub middleware can be extended to support mobile and location-dependent applications. We first analyze the requirements of such applications and distinguish two orthogonal forms of mobility the system-centric physical mobility and an application-centric logical mobility (where users are aware that they are changing location). We introduce location-dependent subscriptions as a suitable means to exploit the power of the event-based paradigm in mobile applications. Briefly spoken, location-dependency refines a subscription to accept only events related to a mobile user's current location. Implementations for both forms of mobility are presented within the content-based pub/sub middleware REBECA, drawing from its refined routing capabilities (namely, covering and merging). © IFIP International Federation for Information Processing 2003.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

A graphical user interface for evolutionary algorithms

引用

Acta Cybernetica 2003年第2期16卷 337-365页

作者： Tóth, Zoltán Institute of Informatics University of Szeged Árpád tér 2 H-6720 Szeged Hungary Department of Computer Science 2: Programming Systems Friedrich-Alexander University of Erlangen-Nuremberg Martensstr. 3 D-91058 Erlangen Germany

The purpose of Generic Evolutionary Algorithms programming Library (GEA1) system is to provide researchers with an easy-to-use, widely applicable and extendable programming library which solves real-world optimization problems by means of evolutionary algorithms. It contains algorithms for various evolutionary methods, implemented genetic operators for the most common representation forms for individuals, various selection methods, and examples on how to use and expand the library. All these functions assure that GEA can be effectively applied on many problems. GraphGEA is a graphical user interface to GEA written with the GTK API. The numerous parameters of the evolutionary algorithm can be set in appropriate dialog boxes. The program also checks the correctness of the parameters and saving/restoring of parameter sets is also possible. The selected evolutionary algorithm can be executed interactively on the specified optimization problem through the graphical user interface of GraphGEA, and the results and behavior of the EA can be observed on several selected graphs and drawings. While the main purpose of GEA is solving optimization problems, that of GraphGEA is education and analysis. It can be of great help for students understanding the characteristics of evolutionary algorithms and researchers of the area can use it to analyze an EA's behavior on particular problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable QoS approach in a core internet network

Scalable QoS approach in a core internet network

引用

Computer Science Society (SCCC) International Conference Chilean FLAGGED

作者： C.J. Barenco Abbas J.G. Villalba Department Electric Engineering University of Brasilia Brasilia Brazil Department Computer Systems and Programming Complutense University of Madrid Madrid Spain

QoS solutions for Core Internet Networks require that we pay special attention to scalability, as they deal with a lot of flows and demand many resources. In this paper, integrated solutions from the physical layer (SDH/SONET and DTM) to the IP layer (IntServ and DiffServ) are analysed and proposed, concentrating not only on scalability, but also on QoS guarantees.

关键词： Intelligent networks IP networks Quality of service Synchronous digital hierarchy Scalability SONET Diffserv networks Bandwidth Asynchronous transfer mode Circuits

来源：评论

学校读者我要写书评

暂无评论

Specification, implementation, and verification of Domain Specific Languages: A logic programming-based approach

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2002年 2407卷 211-239页

作者： Gupta, Gopal Pontelli, Enrico Applied Logic Programming Languages and Systems Lab. Department of Computer Science University of Texas at Dallas Richardson TX 95083 United States Laboratory for Logic Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM 88003 United States

ISBN: (纸本)3540439595

Domain Specific Languages (DSLs) are high level languages designed for solving problems in a particular domain, and have been suggested as means for developing reliable software systems. We present a (constraint) logic programming-based framework for specification, efficient implementation, and automatic verification of domain specific languages (DSLs). Our framework is based on using Horn logic (or pure Prolog), and eventually constraints, to specify denotational semantics of domain specific languages. Both the syntax as well as the semantic specification of the DSL in question are directly executable in our framework: the specification itself serves as an interpreter for the DSL. More efficient implementations of this DSL-a compiler-can be automatically derived via partial evaluation. Additionally, the executable specification can be used for automatic or semi-automatic verification of programs written in the DSL as well as for automatically obtaining traditional debuggers and profilers. The ability to verify DSL programs is a distinct advantage of our approach. In this paper we give a general outline of our approach, and illustrate it with practical examples. © 2002 Springer-Verlag Berlin Heidelberg.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Automated regression testing of CTI-systems

Automated regression testing of CTI-systems

引用

IEEE European Test Workshop, ETW 2001

作者： Niese, Oliver Margaria, Tiziana Hagerer, Andreas Steffen, Bernhard Brune, Georg Goerigk, Werner Ide, Hans-Dieter METAFrame Technologies GmbH Dortmund Germany Department of Programming Systems Univ. of Dortmund Germany Siemens AG Witten Germany

ISBN: (纸本)0769510167

In this paper we present an integrated testing environment for the automated regression test of Computer Telephony Integrated applications. Its novelty consists of a coordinative test management layer that instantiates a general-purpose environment for the specification and verification of workflows in the testing domain. This results in a test environment that controls not only the individual test tools, but also the whole life-cycle of functional system-level tests, comprising test design, test generation, test execution, test evaluation and test reporting. Special attention is devoted to the simplification of the test case design and the checking of admissibility criteria, of interdependencies between the actions of test cases, and of assumptions about the state of the system's resources. We discuss the key features of our testing environment along a concrete industrial application, which illustrates in particular the coarse grain, workflow-like test case representation and the validation and formal verification capabilities. Field results document an efficiency improvement of factors during the test execution phase. © 2001 IEEE.

关键词： Formal verification

来源：评论

学校读者我要写书评

暂无评论

The constraint language for lambda structures

引用

Journal of Logic, Language and Information 2001年第4期10卷 457-485页

作者： Egg, Markus Koller, Alexander Niehren, Joachim Department of Computational Linguistics University of the Saarland 66041 Saarbrücken P.O. Box 15 11 50 Germany Programming Systems Lab. University of the Saarland 66041 Saarbrücken P.O. Box 15 11 50 Germany

This paper presents the Constraint Language for Lambda Structures (CLLS), a first-order language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, tree-like structures that encode λ-terms. Based on CLLS, we present an underspecified, uniform analysis of scope, ellipsis, anaphora, and their interactions. CLLS solves a variable capturing problem that is omnipresent in scope underspecification and can be processed efficiently. © 2001 Kluwer Academic Publishers.

关键词： Anaphora Ellipsis Scope ambiguity Tree descriptions Underspecification

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for the configuration problem of dominance graphs

An efficient algorithm for the configuration problem of domi...

引用

2001 Operating Section Proceedings, American Gas Association

作者： Althaus, Ernst Duchier, Denys Koller, Alexander Mehlhorn, Kurt Niehren, Joachim Thiel, Sven Max-Planck-Institute for Computer Science Saarbrücken Germany Programming Systems Lab. Fachbereich Informatik Universität des Saarlandes Saarbrücken Germany Department of Computational Linguistics Universität des Saarlandes Saarbrücken Germany

ISBN: (纸本)0898714907

Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only normal dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known. Copyright © 2009 ACM, Inc.

关键词： Human factors Languages Verification

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for the configuration problem of dominance graphs 01

An efficient algorithm for the configuration problem of domi...

引用

Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

作者： Ernst Althaus Denys Duchier Alexander Koller Kurt Mehlhorn Joachim Niehren Sven Thiel Max-Planck-Institute for Computer Science Saarbrücken Germany programming Systems Lab Fachbereich Informatik Universität des Saarlandes Saarbrücken Germany Department of Computational Linguistics Universität des Saarlandes Saarbrücken Germany

ISBN: (纸本)9780898714906

关键词：

来源：评论

学校读者我要写书评

暂无评论

Relaxing underspecified semantic representations for reinterpretation

引用

Grammars 2000年第2-3期3卷 217-241页

作者： Koller, Alexander Niehren, Joachim Striegnitz, Kristina Department of Computational Linguistics University of the Saarland 66041 Saarbrücken Germany Programming Systems Lab. University of the Saarland 66041 Saarbrücken Germany

Type and sort conflicts in semantics are usually resolved by a process of reinterpretation, which introduces an operator into the semantic representation. We elaborate on the foundations of a recent approach to reinterpretation within a framework for semantic underspecification. In this approach, relaxed underspecified semantic representations are inferred from the syntactic structure, leaving space for subsequent addition of reinterpretation operators. Unfortunately, a structural danger of overgeneration is inherent to the relaxation of underspecified semantic representations. We identify the problem and distinguish structural properties that avoid it. We furthermore develop techniques for proving these properties and apply them to prove the safety of relaxation in a prototypical syntax/semantics interface. In doing so, we present some novel properties of tree descriptions in the constraint language over lambda structures (CLLS). © 2001 Kluwer Academic Publishers.

关键词： Constraints Natural language semantics Reinterpretation Tree descriptions Underspecification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：