AND CONSTRAINT LOGIC PR OGRAMMING (2009)
Arb Eitspapiere, Bericht Nr, Frank Mora Wietz, R Ms
pap er we presen ta first step tow ard the dev elopmen tof aconstrain tlogic programming (CLP) language
Ingenieurwissenschaften (Dr.-Ing.) genehmigte Abhandlung (2009)
Christiane Förster, Bericht Nr, C Christiane Förster, Christiane Förster
Robust methods for fluid-structure interaction with stabilised finite elements von
Using Relational Methods in Computer Science (2007)
Gunther Schmidt (eds, Bericht Nr, Ali Jaoua, Ali Jaoua, Peter Kempf, ...
The motivation of the RelMiCS events since 1994 is to bring together researchers who use the calculus of relations as a conceptual or methodological tool in some aspect of Computer Science. The first...
Johannes Lthi, Catalina M. Llad, Bericht Nr
URL: www.informatik.unibw-muenchen.de/inst4/luethi 2
Johannes Lthi, Catalina M. Llad, Bericht Nr
URL: www.informatik.unibw-muenchen.de/inst4/luethi
Kontrolle Projektbereich Diskrete, Diskrete Optimierung, Volker Kaibel, Gunter Rote, Bericht Nr, Endgultige Fassung Janner
We prove two new upper bounds on the number of facets that a d-dimensional 0/1-polytope can have. The first one is 2(d \Gamma 1)! + 2(d \Gamma 1) (which is the best one currently known for small...
Kontrolle Projektbereich Diskrete, Spezialforschungsbereich F, Bericht Nr, Helmut Alt, Helmut Alt, ...
This paper deals with questions from convex geometry related to shape matching. In particular, we consider the problem of moving one convex #gure over another, minimizing the area of their symmetric...
Definiteness In The Hebrew Noun Phrase (2007)
. This paper suggests an analysis of Modern Hebrew noun phrases in the framework of HPSG. It focuses on the peculiar properties of the definite article, including the requirement for definiteness...
On the Decidability of Cryptographic Protocols with Open-ended Data Structures (2007)
Ralf K Usters, Ralf K Usters, Bericht Nr
Formal analysis of cryptographic protocols has mainly concentrated on protocols with closed-ended data structures, where closed-ended data structure means that the messages exchanged between...
,,Sprachtheoretische Grundlagen fur die Computerlinguistik" A Study in Grammar Design (2007)
Arbeitspapiere Des, Esther Konig, Bericht Nr
This paper provides a set of criteria and guidelines for grammar design, which are illustrated by an implemented grammar fragment (for German) including semantic composition rules. The connection...
Usage-Based Storyboarding for Web Information Systems (2006)
Klaus-dieter Schewe, Bernhard Thalheim, Bericht Nr, Klaus-dieter Schewe, Bernhard Thalheim, Bericht Nr
On a high level of abstraction a Web Information System (WIS) can be described by a storyboard, which in an abstract way specifies who will be using the system, in which way and for which goals....
A Dolev-Yao-based Definition of Abuse-free Protocols (2006)
Bericht Nr, Detlef Kähler, Detlef Kähler, Ralf Küsters, Ralf Küsters, Thomas Wilke, ...
Abstract. We propose a Dolev-Yao-based definition of abuse freeness for optimistic contract-signing protocols which, unlike other definitions, incorporates a rigorous notion of what it means for an...
Implementing Closures using Run-time Code Generation (2006)
Martin Grabmüller, Bericht Nr, Martin Grabmüller
This report describes an implementation of a purely functional strict programming language which relies heavily on run-time code generation. Closures are not implemented as data structures containing...
A Novel Representation for Two-dimensional Image Structures (2006)
Di Zang, Gerald Sommer, Bericht Nr, Di Zang, Gerald Sommer, Bericht Nr
Dieser Bericht ist als persönliche Mitteilung aufzufassen. This paper presents a novel approach towards two-dimensional (2D) image structures modeling. To obtain more degrees of freedom, a 2D image...
Deciding Properties of Contract-Signing Protocols (2005)
Bericht Nr, Detlef Kähler, Detlef Kähler, Detlef Kähler, Ralf Küsters, Ralf Küsters, ...
We show that for infinite transition systems induced by cryptographic protocols in the Rusinowitch/Turuani style with finite number of sessions, unbounded message size, and the Dolev-Yao intruder...
The Twist Representation of Shape (2004)
Gerald Sommer, Bodo Rosenhahn, Christian Perwass, Gerald Sommer, Bodo Rosenhahn, Christian Perwass, ...
Bodo Rosenhahn, Gerald Sommer, Reinhard Klette, Bericht Nr, Bodo Rosenhahn, Gerald Sommer, ...
4 In this report we present geometric foundations and an algorithmic approach to deal with the 2D-3D pose estimation problem for free-form surface models. This work is an extension to earlier studies...
Michael Koch, Georg Groh, Christian Hillebr, Natalie Fremuth, ...
www.prof-reichwald.de
Tree Transducer-based Analysis of Cryptographic Protocols (2003)
Ralf Küsters, Ralf K Usters, Bericht Nr
In many cryptographic protocols, the actions performed by principals are iterative processes. However, in contrast to other classes of protocols, only very little is known about deciding the security...
Ralf Küsters, Thomas Wilke, Bericht Nr, Ralf Küsters, Thomas Wilke, Bericht Nr, ...
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for instance, single rewrite...
A Software Agent for Adaptive Navigation Support in a Restricted Internet Area (2002)
Dirk Kukulenz, Bericht Nr, Dirk Kukulenz, Bericht Nr
Dieser Bericht enthält die Dissertation des Verfassers This thesis deals with the development of a software system that helps a user to search for information in the World Wide Web. The particular...
On the Decidability of Cryptographic Group Protocols (2002)
Ralf Küsters, Ralf K Usters, Bericht Nr
We propose a protocol model in which principals are described by transducers (Mealy machines), i.e., nite automata with output. This allows the principals to process messages with an unbounded number...
Deciding the First Level of the µ-calculus Alternation Hierarchy (2002)
D Kiel, Ralf Küsters, Ralf K Usters, Bericht Nr, Thomas Wilke, Thomas Wilke, ...
We show that the following problem is decidable and complete for deterministic exponential time. Given a formula of modal µ-calculus, determine if the formula is equivalent to a formula without...
Abstract A Depth-Cueing Scheme Based on Linear Transformations in Tristimulus Space (2002)
Fakultät Informatik, Interaktive Systeme, Daniel Weiskopf, Thomas Ertl, Bericht Nr, ...
We propose a generic and flexible depth-cueing scheme which subsumes many well-known and new color-based depth-cueing approaches. In particular, it includes standard intensity depth-cueing and rather...
Approximate orientation steerability based on angular gaussians (2001)
Bericht Nr, Weichuan Yu, Weichuan Yu, Weichuan Yu, Kostas Daniilidis, Kostas Daniilidis, ...
Junctions are significant features in images with an intensity variation that exhibits multiple orientations. This makes the detection and characterization of junctions a challenging problem. In this...
Bericht Nr, Michael Felsberg, Michael Felsberg, Gerald Sommer, Gerald Sommer
This paper introduces a two-dimensional generalization of the analytic signal. This novel approach is based on the Riesz transform, which is used instead of the Hilbert transform. The combination of...
Simulation Relations for Alternating Büchi Automata (2001)
Carsten Fritz, Carsten Fritz, Thomas Wilke, Thomas Wilke, Bericht Nr, Bericht Nr
We adapt direct, delayed, and fair simulation to alternating Büchi automata. Unlike with nondeterministic Büchi automata...
Multiple motion analysis using 3d orientation steerable filters (2000)
Bericht Nr, Bericht Nr, Weichuan Yu, Weichuan Yu, Weichuan Yu, Gerald Sommer, ...
In this paper, we study the characterization of multiple motions from the standpoint of orientation in spatiotemporal volume. Using the fact that multiple motions are equivalent to multiple planes in...
The Compiling Specification from ComLisp to Executable Machine Code (1998)
Bericht Nr, Wolfgang Goerigk, Wolfgang Goerigk, Ulrich Hoffmann, Ulrich Hoffmann
This report is one part of a series of documents describing the fully verified specification, construction and implementation of a ComLisp--compiler. ComLisp is a subset of ANSI-CommonLisp. Programs...
W.: A Study on Symmetric Quotients (1998)
Bericht Nr, Hitoshi Furusawa, Wolfram Kahl, Wolfram Kahl
Symmetric quotients, introduced in the context of heterogeneous relation algebras, have proven useful for applications comprising for example program semantics and databases. Recently, the increased...
The Automata-Theoretic Method Works for TCTL Model Checking (1998)
Martin Dickhöfer, Martin Dickhofer, Thomas Wilke, Thomas Wilke, Bericht Nr
We introduce timed alternating tree automata, prove that the "one-node acceptance problem" (a certain type of word problem) for these automata is decidable, determine upper bounds for its...
On the Distribution of Powers in Finite Fields (1997)
. Using a special ordering fx 0 ; : : : ; x p f \Gamma1 g of the elements of an arbitrary finite field and the term semicyclic consecutive elements, defined in Winterhof [10], some distribution...
Cyclic Codes and the Frobenius Automorphism (1997)
Arne Winterhof, Bericht Nr, Is Solved
Using the theory of cyclic codes some results connected with the Frobenius automorphism are proved. So the following problem of K.Burde's on characterizing finite fields GF (q n ) is solved:...
Modular Construction of Strategies Winning Infinite Games (1997)
Helmut Lescow, Bericht Nr, Bericht Nr
this paper, such solutions exist (for an overview see [Tho94]). But usually the solutions have exponential size in the size of the controlled system. For some special specifications of systems are...
Resource-Adaptive Action Planning in a Dialogue System for Repair Support (1997)
Ressourcenadaptive Kognitive Prozesse, Leitung Prof, Dr. W. Wahlster, Bericht Nr, Kognitive Prozesse, ...
Abstract. For reasonable application in critical domains dialogue systems not only have to pay attention to user knowledge and dialogue goals but they also have to adapt their dialogue behaviour to...
On the Distribution of Squares in Finite Fields (1996)
. By ordering the elements of an arbitrary finite field in a natural way, we get a tool to investigate the distribution of powers in arbitrary finite fields F p f ( instead of the special finite...
The Use of Tree Transducers to Compute Translations Between Graph Algebras (1996)
Bericht Nr, Frank Drewes, Frank Drewes
. The power of top-down tree transducers and tree-to-graphto -tree transducers (tgt transducers) to compute translations between hyperedge-replacement algebras is investigated. It turns out that...
Congruence Proofs for Weak Bisimulation Equivalences on Higher-order Process Calculi (1995)
Bericht Nr, Prof Bernd Mahr, Michael Baldamus, Michael Baldamus, Thomas Frauenstein, Thomas Frauenstein
Congruence proofs for bisimulation equivalences on higher-order process calculi tend to be significantly more complex than their counterparts in first-order process algebra frameworks. The fact that...
Bericht Nr, Axel Klawonn, Axel Klawonn
. Iterative methods are considered for saddle point problems with a penalty term. A positive definite preconditioner is constructed and it is proved that the condition number of the preconditioned...
The DEVS Model Interchange Format OpenDEVS. A Proposal (1995)
Carsten Thomas, Schwerpunktthema Modellbasierte Systeme, Verfasser Carsten Thomas, Bericht Nr
models are models without a completely implemented functionality which cannot be used for simulation. Copyright liegt bei der Daimler-Benz AG. Weitergabe an Dritte sowie Vervielf altigung ist nicht...
Bericht Nr, Jens Knoop, Jens Knoop, Oliver Rüthing, Oliver Ruthing, Bernhard Steffen, ...
We present a bit-vector algorithm for the optimal and economical placement of computations within flow graphs, which is as efficient as standard uni-directional analyses. The point of our algorithm...
Bernd Meyer, Gerhard D. Westerman Martin Gogolla (1990)
Bernd Meyer, Bernd Meyer, Gerhard D. Westerman, Martin Gogolla, ...
The combination of logic programming and databases has been given broad attention in recent years. However, mainly the connections between the relational data model and logic programming have been...
QUEER: A Prolog-based prototype for an Extended ER Approach (1990)
Gerhard D. Westerman, Bernd Meyer, Bernd Meyer, Gerhard D. Westerman, Martin Gogolla, ...
The combination of logic programming and databases has been given broad attention in recent years. However, mainly the connections between the relational data model and logic programming have been...
CHRISTIAN-ALBRECHTS-UNIVERSITÄT
Michael Hanus, Bernd Braßel (hrsg, Bericht Nr, Programmiersprachen Und Rechenkonzepte, Michael Hanus, Bernd Braßel (hrsg, ...
Seit 1984 veranstaltet die GI–Fachgruppe ” Programmiersprachen und Rechenkonzepte“, die aus
Bericht ist als persönliche Mitteilung aufzufassen.
Programmiersprachen Und, Wolfgang Goerigk (hrsg, Programmiersprachen Und Rechenkonzepte, Wolfgang Goerigk (hrsg, Bericht Nr, Kiel Januar, ...
Workshop. Dieser Bericht enthält eine Zusammenstellung der Beiträge. Das