The Network as a Global Database: Challenges of (2009)
Peter C. Lockemann, Ulrike Kijlsch, Arne Koschel, Ralf Kramer, Ralf Nikolai, Mechtild Wallrath, ...
The current integrated developments in network and computing give rise to a technical infrastructure for the information society which one may variously circumscribe by terms such as ubiquitous...
Mario Trams, Tu Chemnitz, Fakultat Fur Informatik, Bearbeiter Mario Trams, Betreuender Hochschullehrer, ...
Die sich stark im Aufwind be ndliche Thematik des Cluster{Computing fordert immer bessere Kommunikationshardware. Dabei reicht es nicht nur aus, ein schnelles Medium als Basis einzusetzen, sondern...
Jurgen Schmidhuber, Stefan Heil, Fakultat Fur Informatik
The purpose of this paper is to show that neural networks may be promising tools for data compression without loss of information. We combine predictive neural nets and statistical coding techniques...
AParallel Programming Model for Irregular Dynamic Neural Networks (2008)
The compilation of high-level programming languages for parallel machines faces two challenges: maximizing data/process locality and balancing load. No solutions for the general case are known that...
Some Notes on Neural Learning Algorithm Benchmarking (2008)
New neural learning algorithms are often benchmarked only poorly. This article gathers some important DOs and DON'Ts for researchers in order to improve on that situation. The essential...
Multivariate Splines with Convex B-Patch Control Nets are Convex (2008)
Hartmut Prautzsch, Fakultat Fur Informatik
In this paper results from a forthcoming paper are presented concerning the convexity of multivariate spline functions built from B-patches. Conditions are given under which it is possible todefi a...
Reasoning With Qualitative Representations: Exploiting The Structure Of Space (2007)
Daniel Hernández, Fakultat Fur Informatik
We present a variety of mechanisms to reason with qualitative representations in general, and qualitative representations of 2-D positional information in particular. One of the simplest is...
HCI Aspects of a Framework for the Qualitative Representation of Space (2007)
Daniel Hernández, Fakultat Fur Informatik
Good user interfaces cannot be built on top of representations that ignore cognitive issues. This is particularly true for the representation of spatial knowledge, since space plays a preponderant...
Margit Kinder, Till Brychcy, Fakultat Fur Informatik
There exist all kinds of problems where both input and output data for neural networks are continuous and vector-valued. From our previous works we know that distributed representations of the input...
Fakult At F Ur Informatik (2007)
At F, Ur Informatik, Tu Munchen, Marc Fuchs, Marc Fuchs, ...
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of...
Cooperation in Object Bases through Alliances (2007)
Kottmann Lockemann, D. A. Kottmann, P. C. Lockemann, Fakultat Fur Informatik
Interaction of objects in today's object-oriented database systems is based on four premises: First, messages are procedures, which are executed instantaneously. Second, interaction is limited...
To Appear, Fakultat Fur Informatik, Jurgen Schmidhuber
We present a new algorithm for finding low complexity neural networks with high generalization capability. The algorithm searches for a "flat" minimum of the error function. A flat minimum...
On the Notion of Concept (2007)
Peter C. Lockemann, Guido Moerkotte, Fakultat Fur Informatik
The notion of concept is central to the notion of data model in databases. Its purpose is to provide construction mechanisms for organizing a universe of data into manageable segments with a...
Nonlinear ICA Through Low-Complexity Autoencoders (2007)
Sepp Hochreiter, Fakultat Fur Informatik, Jürgen Schmidhuber, W V (ffiw
We train autoencoders by Flat Minimum Search (FMS), a regularizer algorithm for finding low-complexity networks describable by few bits of information. As a by-product, this encourages nonlinear...
LONG SHORT TERM MEMORY Technical (2007)
Fakultat Fur Informatik, Jurgen Schmidhuber
"Recurrent backprop " for learning to store information over extended time intervals takes too long. The main reason is insufficient, decaying error back flow. We briefly review...
Fakultat Fur Informatik, Jurgen Schmidhuber
Learning to store information over extended time intervals via recurrent backpropagation takes a very long time, mostly due to insufficient, decaying error back flow. We briefly review...
multistep transformations (2007)
Gerhard Goos, Wolf Zimmermann, Fakultat Fur Informatik
Abstract. A verifying compiler ensures that the compiled code is always correct but the compiler may also terminate with an error mesage and then fails to generate code. We argue that with respect to...
On Closure Properties of #P in the Context of PF ffi #P (2007)
Mitsunori Ogihara, Thomas Thierauf, Fakultat Fur Informatik, Universtat Ulm, Seinosuke Toda, Osamu Watanabe
For any operator on integer-valued functions, we say that #P is closed under in context PFffi#P if, for every f 2 #P, [f] belongs to PF ffi #P. For several operators , it is shown that the closure...
Gradient Flow in Recurrent Nets: the Difficulty of Learning Long-Term Dependencies (2007)
Fakultat Fur Informatik, Yoshua Bengio, Paolo Frasconi, Jurgen Schmidhuber
1
Would you ever risk a non-monomorphic (2007)
Interner Bericht Nr, Fakultat Fur Informatik, Arno Schonegge, Arno Schonegge
specification?
Birgitta Konig-ries, Sven Helmer, Guido Moerkotte, Fakultat Fur Informatik
join ordering problems for cyclic queries
Orthogonal Processor Groups for Message-Passing Programs (2007)
Thomas Rauber, Robert Reilein, Gudula R Unger, Fakultat Fur Informatik
We consider a generalization of the SPMD programming model to orthogonal processor groups. In this model different partitions of the processors into disjoint processor groups can be exploited in a...
Mesh Generation On Piecewise Riemannian Surfaces (2007)
Maharavo Randrianarivony, Guido Brunnett, Fakultat Fur Informatik
this paper, we will suppose that every surface S is given in such a way. Every patch of a surface S is bounded by a list of curves C k which we will henceforth call 'curved' edges. In the...
Parallel Implementation of Curve and Surface Reconstructions from Noisy Samples (2004)
Maharavo Randrianarivony, Maharavo R, Guido Brunnett, Fakultat Fur Informatik
We consider the problem of reconstructing a curve or a surface from discrete noisy samples by approximating the point set with non-uniform rational B-splines. We show how to set up the free knot...
A Mechanically Verified Compiling Specification for a Realistic Compiler (2002)
A. Dold, V. Vialard, Abt Kunstliche Intelligenz, Fakultat Fur Informatik, W. Goerigk
We report on a large formal verification effort in mechanically proving correct a compiling specification for a realistic bootstrap compiler from ComLisp (a subset of ANSI Common Lisp sufficiently...
Formal Software Development using Generic Development Steps (2000)
Axel Dold, Fakultat Fur Informatik
This talk is concerned with a mechanized formal treatment of the transformational software development process in a unified framework. As a formal vehicle, the specification and verification system...
Memory Management in a combined VIA/SCI Hardware (2000)
Mario Trams, Wolfgang Rehm, Daniel Balkanski, Stanislav Simeonov, Fakultat Fur Informatik
Abstract In this document we make a brief review of memory management and DMA considerations in case of common SCI hardware and the Virtual Interface Architecture. On this basis we expose our ideas...
Lutz Prechelt, Fakultat Fur Informatik
How long do different software engineers take to solve the same task? In 1967, Grant and Sackman published their now famous number of 28:1 interpersonal performance differences, which is both...
An Experiment Measuring the E ects of (2000)
Lutz Prechelt, Barbara Unger, Fakultat Fur Informatik
The Personal Software Process is a process improvement methodology aiming at individual software engineers. It claims to improve software quality (in particular defect content), effort estimation...
An advanced PCI--SCI bridge with VIA support (1999)
Mario Trams, Wolfgang Rehm, Friedrich Seifert, Fakultat Fur Informatik
Verification of compilers (1999)
Gerhard Goos, Wolf Zimmermann, Fakultat Fur Informatik
Abstract. We report about a joint project of the universities at Karlsruhe, Kiel and Ulm on how to get correct compilers for realistic programming languages. Arguing about compiler correctness must...
Lutz Prechelt, Barbara Unger, Fakultat Fur Informatik
small simulation with experiment data
Jörg Fischer, Fakultat Fur Informatik
This paper deals with modularization concepts for an approach to specification of communication protocols. These concepts are related to the object oriented ones of ([EDS93]). The syntactical...
Clemens Ballarin, Fakultat Fur Informatik, Lawrence C. Paulson
. The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, that supports...
José Balcázar, Jorge Castro, David Guijarro, Fakultat Fur Informatik
We prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnability via...
Specification of Communication Protocols: Extending timing diagrams for that purpose. (1999)
Jörg Fischer, Fakultat Fur Informatik
This paper discusses ideas for an approach to specification which was initiated by the analysis of the peculiarities of communication protocols. The primary intuition is given by timing diagrams...
Formal Verification for Time-Triggered Clock Synchronization (1999)
Holger Pfeifer, Detlef Schwier, Fakultat Fur Informatik
Distributed dependable real-time systems crucially depend on faulttolerant clock synchronization. This paper reports on the formal analysis of the clock synchronization service provided as an...
Accelerating Learning from Experience: Avoiding Defects Faster (1999)
Lutz Prechelt, Fakultat Fur Informatik
Over time, any programmer will learn from repeated mistakes. Can we speed up this learning and save many unnecessary repetitions of similar errors? This article presents a technique called...
Lutz Prechelt, Fakultat Fur Informatik
Domain-specific constraints can be exploited to implement compiler optimizations that are not otherwise feasible: Compilers for neural network learning algorithms can achieve near-optimal co-locality...
Lutz Prechelt Prechelt, Barbara Unger, Fakultat Fur Informatik
The present report is a follow-up to our report on an experiment for investigating the effects from Personal Software Process (PSP) training [1]. It uses the work time data from the experiment plus...
Comparing Java vs. C/C++ efficiency differences to inter-personal differences (1999)
Lutz Prechelt, Fakultat Fur Informatik
this report were created by graduate students in the course of a controlled experiment on a different question [1]. There are 24 programs written in Java, 11 in C
Lutz Prechelt, Fakultat Fur Informatik
Domain-speci c constraints can be exploited to implement compiler optimizations that are not otherwise feasible: Compilers for neural network learning algorithms can achieve near-optimal co-locality...
Lutz Prechelt, Fakultat Fur Informatik
The relative e ciency of Java programs is much discussed today, in particular in comparison to well established implementation languages such as C or C++. Java is often considered very slow and...
Lutz Prechelt, Fakultat Fur Informatik, Christian Kramer
Abstract: The object-oriented design community has recently begun to collect socalled software design patterns: descriptions of proven solutions common software design problems, packaged in a...
Implications of memory mappings on cache misses (1998)
Daniela Genius, Jorn Eisenbiegler, Fakultat Fur Informatik
This paper proposes an optimization by an alternative approach to memory mapping. Low set associativity allows representing cache lines by corresponding memory areas. With the help of the notion of...
Case Studies in Meta-Level Theorem Proving (1998)
Stephan Pfab, Holger Pfeifer, Harald Rue, Fakultat Fur Informatik
Abstract. We describe an extension of the Pvs system that provides a reasonably efficient and practical notion of reflection and thus allows for soundly adding formalized and verified new proof...
A Planning Algorithm not based on Directional Search (1998)
Jussi Rintanen, Fakultat Fur Informatik
The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the partial-order or...
Compiling State Constraints (1998)
Hussien Oakasha, Gunter Saake, Fakultat Fur Informatik
The evaluation of constraints needs in many cases that a large portion of the database to be accessed. This makes the process of integrity checking very difficult to implement efficiently. Thus...
The Computational Complexity of Equivalence and Isomorphism Problems (1998)
Thomas Thierauf, Fakultat Fur Informatik
lar we consider Boolean formulas, circuits, and various kinds of branching programs. Acknowledgments I have to thank many people who contributed in various ways to this work. First of all I would...
Claudia Bangert, Hartmut Prautzsch, Fakultat Fur Informatik
In this paper we will present a geometric approach to piecewise quadric C 1 -interpolants constructed algebraically by Dahmen in 1989. These piecewise quadrics interpolate the vertices of a...
Lutz Prechelt, Fakultat Fur Informatik, Christian Kramer, Kanthor Ag Karlsruhe
: The object-oriented design community has recently begun to collect socalled software design patterns: descriptions of proven solutions common software design problems, packaged in a description...
Lutz Prechelt, Fakultat Fur Informatik, Christian Krämer, Kanthor Ag Karlsruhe
: The object-oriented design community has recently begun to collect socalled software design patterns: descriptions of proven solutions common software design problems, packaged in a description...
Feature-based Learning of Search-guiding Heuristics for Theorem Proving (1998)
Tu Munchen, Matthias Fuchs, Marc Fuchs, Marc Fuchs, Fakultat Fur Informatik
Automated reasoning or theorem proving essentially amounts to solving search problems. Despite significant progress in recent years theorem provers still have many shortcomings. The use of...
Claudia Bangert, Hartmut Prautzsch, Fakultat Fur Informatik
We derive a geometric criterion for the convexity of Powell-Sabin interpolants and present a multivariate generalization.
A Verification Environment for I/O Automata (1998)
Fakultat Fur Informatik, Olaf Müller, Olaf Muller
This thesis deals with the computer-assisted verification of embedded systems described as Input/Output automata. We achieve contributions in two fields: the theory of untimed I/O automata and its...
Lutz Prechelt, Fakultat Fur Informatik, Christian Kramer, Kanthor Ag Karlsruhe
Abstract: The object-oriented design community has recently begun to collect socalled software design patterns: descriptions of proven solutions common software design problems, packaged in a...
Fast subsumption checks using anti-links (1997)
Interner Bericht, Fakultat Fur Informatik, Anavai Ramesh, Anavai Ramesh, Neil V. Murray, Neil V. Murray, ...
This report has been submitted for publication elsewhere, and will be copyrighted if accepted.
Free variable tableaux for propositional modal logics (1997)
Interner Bericht, Fakultat Fur Informatik, Bernhard Beckert, Bernhard Beckert
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain "free" and "universal "...
Stephan Schulz, Andreas Küchler, Fakultat Fur Informatik, Christoph Goller
One of the major problems in theorem proving is control of the proof search. A promising approach is the application of machine learning techniques for the acquisition of search control knowledge by...
Wolfram Kahl, Fakultat Fur Informatik
We present a new approach to rewriting obtained by enhancing and unifying existing variants inside the algebraic (or better categorical) approach to (graph) rewriting. Our approach is motivated by...
Qualitative Representation of Positional Information (1997)
Eliseo Clementini, Paolino Di Felice, Daniel Hernández, Fakultat Fur Informatik
A framework for the qualitative representation of positional information in a two-dimensional space is presented. Qualitative representations use discrete quantity spaces, where a particular...
Sepp Hochreiter Fakultat, Fakultat Fur Informatik, Jurgen Schmidhuber
"Recurrent backprop" for learning to store information over extended time periods takes too long. The main reason is insufficient, decaying error back flow. We describe a novel, efficient...
Expressing Uniformity via Oracles (1997)
Carsten Damm, Markus Holzer, Peter Rossmanith, Fakultat Fur Informatik
We study under what circumstances different uniformity notions for NC 1 lead to the same complexity class. Our investigations are based on a characterization of uniformity in terms of oracle access...
High Performance ATP Systems by Combining Several AI Methods (1997)
Jörg Denzinger, Matthias Fuchs, Marc Fuchs, Fakultat Fur Informatik, Tu Munchen
We present a concept for an automated theorem prover that employs a search control based on ideas from several areas of artificial intelligence (AI). The combination of case-based reasoning, several...
Peter C. Lockemann, Ulrike Kölsch, Arne Koschel, Ralf Kramer, Ralf Nikolai, Mechtild Wallrath, ...
The current integrated developments in network and computing give rise to a technical infrastructure for the information society which one may variously circumscribe by terms such as ubiquitous...
Refinements in HOLCF: Implementation of Interactive Systems (1997)
Oscar Slotosch, Fakultat Fur Informatik
In this thesis refinement relations for the logic HOLCF are defined. We compare refinement relations defined by theory interpretations and by model inclusion. We use these refinements to implement...
Implications of Memory Mapping on Cache Misses (1997)
Daniela Genius, Jörn Eisenbiegler, Fakultat Fur Informatik
This paper proposes an optimization by an alternative approach to memory mapping. Caches with low set associativity suffer from conflict misses. When data is accessed regularly, as in nested loops,...
Sepp Hochreiter, Fakultat Fur Informatik, Jürgen Schmidhuber
We present a new algorithm for finding low complexity neural networks with high generalization capability. The algorithm searches for a "flat" minimum of the error function. A flat minimum...
Wolfram Kahl, Fakultat Fur Informatik
We present a new approach to rewriting obtained by enhancing and unifying existing variants inside the algebraic (or better categorical) approach to (graph) rewriting. Our approach is motivated by...
Sepp Hochreiter, Fakultat Fur Informatik, Jürgen Schmidhuber
Learning to store information over extended time intervals via recurrent backpropagation takes a very long time, mostly due to insufficient, decaying error back flow. We briefly review...
Investigation of the CasCor Family of Learning Algorithms (1997)
Lutz Prechelt, Fakultat Fur Informatik
To appear in \Neural Networks" Six learning algorithms are investigated and compared empirically. All of them are based on variants of the candidate training idea of the Cascade Correlation...
Connection pruning with static and adaptive pruning schedules (1997)
Lutz Prechelt, Fakultat Fur Informatik
Accepted article for \Neurocomputing" Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this...
Christian Kramer, Computec Gmbh, Fakultat Fur Informatik
The object-oriented design community has recently begun to collect so-called design patterns: cliches plus hints to their recommended use in software construction. The structural design patterns...
Object Migration in Non-Monolithic Distributed Applications (1996)
O. Ciupke, D. Kottmann, Interner Bericht, Fakultat Fur Informatik
\Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma \Gamma...
Common Syntax of the DFGSchwerpunktprogramm Deduction (1996)
Reiner Hahnle, Fakultat Fur Informatik, Manfred Kerber, Christoph Weidenbach, Im Stadtwald
A common exchange format for logic problems to be used by members of the DFG-Schwerpunktprogramm "Deduktion " is introduced. It is thought to be an internal format that can easily...
Common Syntax of the DFG-Schwerpunktprogramm Deduktion - Version 1.2 (1996)
Reiner Hähnle, Fakultat Fur Informatik, Manfred Kerber, Christoph Weidenbach, Im Stadtwald
A common exchange format for logic problems to be used by members of the DFG-Schwerpunktprogramm Deduktion is introduced. It is thought to be a format that can easily be parsed such that it forms a...
An Experiment to Assess the Benefits of Inter-Module Type Checking (1996)
Lutz Prechelt, Walter F. Tichy, Fakultat Fur Informatik
This paper reports on an experiment to assess the error detection capabilities of static, inter-module type checking. Type checking is considered an important mechanism for detecting programming...
Mechanized Semantics of Simple Imperative Programming Constructs (1996)
H. Pfeifer, A. Dold, H. Rueß, Abt Kunstliche Intelligenz, Fakultat Fur Informatik
In this paper a uniform formalization in PVS of various kinds of semantics of imperative programming language constructs is presented. Based on a comprehensive development of fixed point theory, the...
Comparing Adaptive and Non-Adaptive Connection Pruning with Pure Early Stopping (1996)
Lutz Prechelt, Fakultat Fur Informatik
Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this empirical study. However, an open problem in the...
Investigation of the CasCor Family of Learning Algorithms (1996)
Lutz Prechelt, Fakultat Fur Informatik
Six learning algorithms are investigated and compared empirically. All of them are based on variants of the candidate training idea of the Cascade Correlation method. The comparison was performed...
Guessing Can Outperform Many Long Time Lag Algorithms (1996)
Jürgen Schmidhuber, Sepp Hochreiter, Fakultat Fur Informatik
Numerous recent papers focus on standard recurrent nets' problems with long time lags between relevant signals. Some propose rather sophisticated, alternative methods. We show: many problems...
Universitat Karlsruhe Fakultat fur Informatik (1996)
Implementing Semantic Tableaux, Interner Bericht, Fakultat Fur Informatik, Joachim Posegga, Joachim Posegga, Peter H. Schmitt, ...
This report will appear as a chapter in the
Implementing Semantic Tableaux (1996)
Interner Bericht, Fakultat Fur Informatik, Joachim Posegga, Joachim Posegga, Peter H. Schmitt, Peter H. Schmitt
This report will appear as a chapter in the
Compressing Texts With Neural Nets (1996)
Jurgen Schmidhuber, Stefan Heil, Fakultat Fur Informatik
Neural networks are promising tools for data compression without loss of information. We combine predictive neural nets and statistical coding techniques to compress text files. We apply our methods...
Connection Pruning with Static and Adaptive Pruning Schedules (1996)
Lutz Prechelt, Fakultat Fur Informatik
Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this empirical study. However, an open problem in the...
Lutz Prechelt, Fakultat Fur Informatik
190 articles about neural network learning algorithms published in 1993 and 1994 are examined for the amount of experimental evaluation they contain. 29% of them employ not even a single realistic or...
Common Syntax of the DFG-Schwerpunktprogramm "Deduktion" (1996)
Reiner Hähnle, Reiner Hahnle, Fakultat Fur Informatik, Manfred Kerber, Manfred Kerber, Christoph Weidenbach, ...
A common exchange format for logic problems to be used by members of the DFG-Schwerpunktprogramm "Deduktion" is introduced. It is thought to be an internal format that can easily be parsed...
Fakultat Fur, Interner Bericht, Fakultat Fur Informatik, Bernhard Beckert, Bernhard Beckert
We present a sound, complete, modular and lean labelled tableau calculus for many propositional modal logics where the labels contain "free" and "universal" variables. Our...
Comparing Adaptive and Non-Adaptive Connection Pruning With Pure Early Stopping (1996)
Lutz Prechelt, Fakultat Fur Informatik
Abstract|Neural network pruning methods on the level of individual network parameters (e.g. connection weights) can improve generalization, as is shown in this empirical study. However, an open...
Christian Kramer, Computec Gmbh, Fakultat Fur Informatik
The object-oriented design community has recently begun to collect so-called design patterns: cliches plus hints to their recommended use in software construction. The structural design patterns...
leanEA: A Poor Man's Evolving Algebra Compiler, research report (1995)
Interner Bericht, Fakultat Fur Informatik, Bernhard Beckert, Bernhard Beckert, Joachim Posegga, Joachim Posegga
The Prolog program "termexpansion((define C as A with B), (C=?A:-B,!)). termexpansion((transition E if C then D), ((transition E):-C,!,B,A,(transition))):-serialize(D,B,A)....
Proof Obligations for Monomorphicity (1995)
Interner Bericht Nr, Fakultat Fur Informatik, Arno Schonegge, Arno Schonegge
In certain applications of formal methods to development of correct software one wants the requirement specification to be monomorphic, i.e. that every two term-generated models of it are isomorphic....
On Learning How to Learn Learning Strategies (1995)
Jürgen Schmidhuber, Fakultat Fur Informatik
This paper introduces the "incremental self-improvement paradigm". Unlike previous methods, incremental self-improvement encourages a reinforcement learning system to improve the way it...
Daniel Hernández, Fakultat Fur Informatik, Eliseo Clementini, Paolino Di Felice
A framework for the representation of qualitative distances is developed inspired by previous work on qualitative orientation. It is based on the concept of "distance systems" consisting of...
The CuPit Compiler for the MasPar MP-1 and MP-2 - A Literate Programming Document (1995)
Lutz Prechelt, Fakultat Fur Informatik
This document contains the complete source code of the CuPit compiler for the MasPar MP-1/MP-2 SIMD parallel machines. The compiler is presented as a FunnelWeb literate programming document that...
Formalization and Reasoning in a Reflective Architecture (1995)
H. Rueß, H. Pfeifer, Kunstliche Intelligenz, Fakultat Fur Informatik
This paper is concerned with developing a reflective architecture for formalizing and reasoning about entities that occur in the process of software development, such as specifications, theorems,...
Reinforcement Driven Information Acquisition In Non-Deterministic Environments (1995)
Jan Storck, Sepp Hochreiter, Fakultat Fur Informatik, Jürgen Schmidhuber
For an agent living in a non-deterministic Markov environment (NME), what is, in theory, the fastest way of acquiring information about its statistical properties? The answer is: to design...
Some Notes on Neural Learning Algorithm Benchmarking (1995)
Lutz Prechelt, Fakultat Fur Informatik
New neural learning algorithms are often benchmarked only poorly. This article gathers some important DOs and DON'Ts for researchers in order to improve on that situation. The essential...
Considerations for a Generic SAC Library (1995)
Sibylle Schupp, Rüdiger Loos, Fakultat Fur Informatik, Arbeitsbereich Computeralgebra, Of C
Moving the SACLIB from C to C ++ poses the question which language features of C ++ a new library can take advantage of. We argue by considering an algebraic algorithm in detail that generic...
Accepting Programmed Grammars without Nonterminals (1995)
Henning Bordihn, Fakultat Fur Informatik, Henning Fernau, Fur Informatik
this paper, we consider the pure versions of this grammar type where we give up the distinction between terminal and nonterminal symbols. Such pure grammars are of interest because of the following...
Extending Dynamic Logic for Reasoning about Evolving Algebras (1995)
Interner Bericht Nr, Fakultat Fur Informatik, Arno Schönegge, Arno Schonegge
The aim of this paper is to provide a logic for reasoning about evolving algebras [13, 14]. This is done by extending a variant of dynamic logic [10, 18] with additional program constructs: update of...
Accepting Grammars and Systems (1995)
Henning Bordihn, Fakultat Fur Informatik, Henning Fernau, Lehrstuhl Informatik Fur
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly...
A Parallel Programming Model for Irregular Dynamic Neural Networks (1995)
Lutz Prechelt, Fakultat Fur Informatik
The compilation of high-level programming languages for parallel machines faces two challenges: maximizing data/process locality and balancing load. No solutions for the general case are known that...
Automata That Take Advice (1995)
Fachbereich Iv-informatik, Fakultat Fur Informatik, Carsten Damm, Carsten Damm, Carsten Damm, Markus Holzer, ...
Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in...
Predictive Coding With Neural Nets: Application To Text Compression (1995)
Jurgen Schmidhuber, Stefan Heil, Fakultat Fur Informatik
To compress text files, a neural predictor network P is used to approximate the conditional probability distribution of possible "next characters", given n previous characters. P 's...
leanEA: A Poor Man's Evolving Algebra Compiler (1995)
Interner Bericht, Fakultat Fur Informatik, Bernhard Beckert, Bernhard Beckert, Joachim Posegga, Joachim Posegga
The Prolog program "termexpansion((define C as A with B), (C=?A:-B,!)). termexpansion((transition E if C then D), ((transition E):-C,!,B,A,(transition ))) :- serialize(D,B,A)....
OPTIMIX Language Report (for OPTIMIX 7.0) (1995)
Uwe Aßmann, Fakultat Fur Informatik
This is the language manual for OPTIMIX, the optimizer generator. It can be used to generate program analyses and transformations. Its input language is based on Datalog and graph rewriting....
Fakultat Fur Informatik, Martin Giese, Martin Giese, Arno Schönegge, Arno Schonegge
Georg Cantor in 1895 gave the first (informal) proof for the fact that any two countable, densely ordered sets without endpoints are isomorphic [1]. Here we report on a fully formal proof of this...
Simplifying Neural Nets By Discovering Flat Minima (1995)
Sepp Hochreiter, Jürgen Schmidhuber, Fakultat Fur Informatik
We present a new algorithm for finding low complexity networks with high generalization capability. The algorithm searches for large connected regions of so-called "flat" minima of the...
Unambiguous Auxiliary Pushdown Automata And Semi-Unbounded Fan-In Circuits* (1995)
Rolf Niedermeier And, Rolf Niedermeier, Fakultat Fur Informatik, Peter Rossmanith, Peter Rossmanith
Notions of unambiguity for uniform circuits and AuxPDAs are studied and related to each other. In particular, a coincidence for counting and unambiguous versions of AuxPDAs and semi-unbounded fan-in...
Object-Oriented Protocol Hierarchies for Distributed Workflow Systems (1995)
P. C. Lockemann, Interner Bericht, Fakultat Fur Informatik
Distributed software systems such as groupware and workflow systems will play a key role in the near future. While numerous models which promise highly sophisticated functionality are proposed in the...
Solving Higher-Order Equations: From Logic to Programming (1995)
At M Unchen, Fakultat Fur Informatik, Christian Prehofer, Christian Prehofer, ...
Higher-order constructs provide the necessary level of abstraction for concise and natural formulations in many areas of computer science. We present constructive methods for higher-order equational...
Sepp Hochreiter, Fakultat Fur Informatik, Jürgen Schmidhuber
"Recurrent backprop" for learning to store information over extended time periods takes too long. The main reason is insufficient, decaying error back flow. We describe a novel, efficient...
Unambiguous Auxiliary Pushdown Automata And Semi-Unbounded Fan-In Circuits (1995)
Fakultat Fur Informatik, Rolf Niedermeier, Rolf Niedermeier, Peter Rossmanith, Peter Rossmanith, Peter Rossmanith
Notions of unambiguity for uniform circuits and AuxPDAs are studied and related to each other. In particular, a coincidence for counting and unambiguous versions of AuxPDAs and semi-unbounded fan-in...
Multi-Object Cooperation in Distributed Object Bases (1995)
D. Kottmann, P. C. Lockemann, Interner Bericht, Fakultat Fur Informatik
It is an emerging trend to build large information systems in a component-based fashion where the components follow the concept of object. Applications are constructed by organizing pre-built objects...
Lutz Prechelt, Fakultat Fur Informatik
190 articles about neural network learning algorithms published in 1993 and 1994 are examined for the amount of experimental evaluation they contain. 29 % of them employ not even a single realistic...
The CuPit Compiler for the MasPar MP-1 and MP-2 A Literate Programming Document (1995)
Lutz Prechelt, Fakultat Fur Informatik
This document contains the complete source code of the CuPit compiler for the MasPar MP-1/MP-2 SIMD parallel machines. The compiler is presented as a FunnelWeb literate programming document that...
PROBEN1 - a set of neural network benchmark problems and benchmarking rules (1994)
Lutz Prechelt, Fakultat Fur Informatik
Proben1 is a collection of problems for neural network learning in the realm of pattern classi-cation and function approximation plus a set of rules and conventions for carrying out benchmark tests...
Autonomous Objects: A Natural Model for Complex Applications (1994)
Alfons Kemper, Peter C. Lockemann, Guido Moerkotte, Hans-dirk Walter, Fakultat Fur Informatik
Object-oriented database systems are emerging as the "next generation " DBMSs for advanced applications, e.g., VLSI design, mechanical CAD/CAM, software engineering, etc. However, a...
Valid Extensions of Introspective Systems: A Foundation for Reflective Theorem Provers (1994)
Interner Bericht Nr, Fakultat Fur Informatik, Arno Schonegge, Arno Schonegge
Introspective systems have been proved useful in several applications, especially in the area of automated reasoning. In this paper we propose to use structured algebraic specifications to describe...
Flat Minimum Search Finds Simple Nets (1994)
Sepp Hochreiter, Jürgen Schmidhuber, Fakultat Fur Informatik
We present a new algorithm for finding low complexity neural networks with high generalization capability. The algorithm searches for a "flat" minimum of the error function. A flat minimum...
Path Planning for Six-Joint Manipulators by Generalization from Example Paths (1994)
Margit Kinder, Till Brychcy, Fakultat Fur Informatik
This paper presents a novel kind of generalizing neural storage tailored for the problem of global motion planning for six-joint manipulators in complex, changing environments. Paths are stored in a...
Semilinear Predictability Minimization Produces Orientation Sensitive Edge Detectors (1994)
Jürgen Schmidhuber, Bernhard Foltin, Fakultat Fur Informatik
Static real world images are processed by a computationally simple and biologically plausible version of the recent predictability minimization algorithm for unsupervised redundancy reduction....
Lutz Prechelt, Fakultat Fur Informatik
113 articles about neural network learning algorithms published in 1993 and 1994 are examined for the amount of experimental evaluation they contain. Every third of them does employ not even a single...
Accepting Grammars and Systems (1994)
Henning Bordihn Fakultat, Henning Bordihn, Fakultat Fur Informatik, Henning Fernau, Lehrstuhl Informatik Fur
We investigate several kinds of regulated rewriting (programmed, matrix, with regular control, ordered, and variants thereof) and of parallel rewriting mechanisms (Lindenmayer systems, uniformly...
PROBEN1 - A Set of Neural Network Benchmark Problems and Benchmarking Rules (1994)
Lutz Prechelt, Fakultat Fur Informatik
Proben1 is a collection of problems for neural network learning in the realm of pattern classification and function approximation plus a set of rules and conventions for carrying out benchmark tests...
Autonomous Objects: A Natural Model for Complex Applications (1994)
Alfons Kemper Peter, Peter C. Lockemann, Guido Moerkotte, Hans-dirk Walter, Fakultat Fur Informatik, ...
this paper. The structural description of a type can be either one of the following: A tuple consists of a collection of typed attributes. The tuple constructor is denoted as [a 1 : t 1 ; : : : ; an...
--- A Set of Neural Network Benchmark Problems and Benchmarking Rules (1994)
Lutz Prechelt Prechelt, Fakultat Fur Informatik
Proben1 is a collection of problems for neural network learning in the realm of pattern classification and function approximation plus a set of rules and conventions for carrying out benchmark tests...
Autonomous Objects: A Natural Model for Complex Applications (1994)
Alfons Kemper Guido, Guido Moerkotte, Hans-dirk Walter, Fakultat Fur Informatik
this paper. The structural description of a type can be either one of the following: A tuple consists of a collection of typed attributes. The tuple constructor is denoted as [a 1 : t 1 ; : : : ; a n...
Low-complexity Art, Jürgen Schmidhuber, Fakultat Fur Informatik
Many artists try to depict "the essence" of objects to be represented. In an attempt to formalize certain aspects of the "the essence", I propose an art form called low-complexity...
Fakultat Fur, Fakultat Fur Informatik, Thomas Fuch, Thomas Fuch, Within The German
In this report we present the results of a case study with the KIV system (Karlsruhe Interactive Verifier). This case study deals with consistency proofs for entity relationship database...
Autonomous Objects: A Natural Model for Complex Applications (1994)
Alfons Kemper, Peter C. Lockemann, Guido Moerkotte, Hans-dirk Walter, Fakultat Fur Informatik, ...
this paper. The structural description of a type can be either one of the following: A tuple consists of a collection of typed attributes. The tuple constructor is denoted as [a 1 : t 1 ; : : : ; an...
Jürgen Schmidhuber, Fakultat Fur Informatik
Many machine learning algorithms aim at finding "simple" rules to explain training data. The expectation is: the "simpler" the rules, the better the generalization on test data (!...
113 articles about neural network learning algorithms published in 1993 and 1994 are examined for the amount of experimental evaluation they contain. Every third of them does employ not even a single...
PROBEN1 - a set of neural network benchmark problems and benchmarking rules (1994)
Lutz Prechelt, Fakultat Fur Informatik
Proben1 is a collection of problems for neural network learning in the realm of pattern classi-cation and function approximation plus a set of rules and conventions for carrying out benchmark tests...
A blackboard architecture for query optimization in object bases (1993)
Alfons Kemper, Guido Moerkotte, Fakultat Fur Informatik
kemper peithner
A Neural Trajectory Storage (1993)
Margit Kinder, Till Brychcy, Fakultat Fur Informatik
We present a neural trajectory storage for manipulator trajectories. Trajectories will be neurally stored as a sequence of discrete joint positions. Every time a trajectory needs to be generated, the...
Maintaining Qualitative Spatial Knowledge (1993)
Daniel Hernández, Fakultat Fur Informatik
We present mechanisms used to maintain the consistency of a knowledge base of spatial information based on a qualitative representation of 2-D positions. These include the propagation heuristics used...
The Modula-2* Environment for Parallel Programming (1993)
Stefan Hangen Ernst, Ernst A. Heinz, Paul Lukowicz, Walter F. Tichy, Fakultat Fur Informatik
This paper presents a portable parallel programming environment for Modula-2* -- an explicitly parallel machine-independent extension of Modula-2. Modula-2* offers synchronous and asynchronous...
Reuse of Proofs in Software Verification (1993)
Wolfgang Reif, Kurt Stenzel, Fakultat Fur Informatik
This paper sketches a method for automated reuse of proofs in software verification. Proofs about programs as well as proof attempts are used to guide the verification of modified programs,...
Controlled Redundancy in Object Bases: Optimization Methods for Organizational Data Modelling (1993)
Alfons Kemper, Guido Moerkotte, Michael Steinbrunn, Fakultat Fur Informatik
We review the definition and then analyse two optimization techniques that were developed for objectoriented databases. Both of these approaches are based on incorporating redundancy into the object...
Development of a Distributed Min/Max Component (1993)
Max Fuchs, Ketil Stølen, Fakultat Fur Informatik
We introduce a specification technique and a refinement calculus for networks of components communicating asynchronously via unbounded FIFO channels. Specifications are formulated in a relational...
Object-Orientation Axiomatised by Dynamic Logic (1992)
Alfons Kemper, Guido Moerkotte, Klaus Peithner, Fakultat Fur Informatik
The field of object-oriented databases is suffering from the lack of a---widely agreed upon---formal model. In this paper we develop the basics of a formal model for an object-oriented data model...
Optimizing Boolean Expressions in Object Bases (1992)
Alfons Kemper Guido, Guido Moerkotte, Michael Steinbrunn, Fakultat Fur Informatik
In this paper we address the problem of optimizing the evaluation of boolean expressions in the context of object-oriented data modelling. We develop a new heuristic for optimizing the evaluation...
Optimizing Boolean Expressions in Object Bases (1992)
Alfons Kemper Guido, Guido Moerkotte, Michael Steinbrunn, Fakultat Fur Informatik
In this paper we address the problem of optimizing the evaluation of boolean expressions in the context of object-oriented data modelling. We develop a new heuristic for optimizing the evaluation...
The First Implementation of the WAVE System for UNIX and TCP/IP Computer Networks (1992)
Peter M. Borst, Fakultat Fur Informatik
The WAVE paradigm [Sap92, Sap91, Sap90, Sap89, Sap87] is a new formalism and model for the highly parallel and distributed processing of arbitrary network structured data. It is based on the spatial...
Reactive Consistency Control in Deductive Databases (1991)
Guido Moerkotte, Peter C. Lockemann, Fakultat Fur Informatik
Classical treatment of consistency violations is to back out a database operation or transaction. In applications with large numbers of fairly complex consistency constraints this clearly is an...
Efficient Consistency Control in Deductive Databases (1988)
Guido Moerkotte, Stefan Karl, Fakultat Fur Informatik
In this paper a theoretical framework for efficiently checking the consistency of deductive databases is provided and proven to be correct. Our method is based on focussing on the relevant parts of...