TY - CONF
AB - This paper presents a systematic approach for classifying and comparing modularity concepts that have been proposed for graph transformation systems. The approach is based on the following observation: Modules and module interconnections consist of basic specifications (forming, e.g., a module's body, import, or export interface), and relations between such specifications, like the implementation relation between export and body of a module. Hence, a natural approach for characterizing a module concept is to answer the following three questions: 1. What are the basic specifications? 2. Which relations between specifications are used? 3. How are specifications and relations combined to modules and interconnections? In this paper, these questions are considered in some detail for the following module concepts for graph transformation systems.
AU - Ehrig, Hartmut
AU - Engels, Gregor
AU - Heckel, Reiko
AU - Taentzer, Gabriele
ID - 8285
IS - tr-ri-98-201
T2 - Pre-Proceedings of the 6th International Workshop on Theory and Application of Graph Transformation (TAGT '98), Paderborn (Germany)
TI - Classification and Comparison of Modularity Concepts for Graph Transformation Systems
ER -
TY - CONF
AU - Cherchago, Alexey
ID - 7845
T2 - Proceedings of the Scientific and Technical Conference on Medical Information Systems (MIS 1998), Taganrog (Russia)
TI - A generalized schema of a decision-making process of a SCENAR-therapeutist
ER -
TY - CONF
AU - Karl, Holger
AU - Werner, Matthias
AU - Kuttner, Lars
ID - 879
T2 - 24th EUROMICRO '98 Conference, Engineering Systems and Software for the Next Decade, 25-27 August 1998, Vesteras, Sweden
TI - An Experimental Investigation of Message Latencies in the Totem Protocol in the Presence of Faults
ER -
TY - CONF
AU - Hemsel, Tobias
AU - Wallaschek, Jörg
ID - 8906
IS - 1
T2 - Proceedings of VIBROENGINEERING
TI - A piezoelectric linear vibration drive for high driving forces
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18213
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 876.12002]
TI - Delzell, Charles N., “Kreisel’s Unwinding of Artin’s Proof”, in P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 113–246
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18220
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 877.01042]
TI - Whitehead, Alfred North/Russell, Bertrand, Principia Mathematica to *56, Cambridge University Press: Cambridge 1997
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18232
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 877.03011]
TI - Sandu, Gabriel, “IF First-Order Logic, Kripke, and 3-Valued Logic”, in: J. Hintikka, The Principles of Mathematics Revisited, Cambridge 1996, 254–270
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18244
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 881.01013]
TI - Howard, William A., “Some Proof Theory in the 1960’s”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 275–288
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18237
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 878.03004]
TI - Dummett, Michael, “Introductory Remarks”, in: Czermak (Hg.) 1993 [9.4], 69–76
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18251
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 884.03003]
TI - Buschlinger, Wolfgang, Wider das Verbot der semantischen Geschlossenheit der Sprache. Der Wert unliebsamer sprachlicher Strukturen für die Reduktion von Graphentheorie auf Logik, Peter Lang: Frankfurt a.M. 1997
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18275
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 894.01010]
TI - Crick, Francis, “Georg Kreisel: A Few Personal Recollections”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 25–32
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18270
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 889.03045]
TI - Feferman, Solomon, “Kreisel’s ‘Unwinding’ Program”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 247–273
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18302
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 896.03005]
TI - Luckhardt, Horst, “Bounds Extracted by Georg Kreisel from Ineffective Proofs”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 247–273
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18299
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 895.01008]
TI - Platek, Richard A., “Kreisel, Generalized Recursion Theory, Stanford and Me”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 97–102
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18294
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 894.01013]
TI - Jockusch, Carl G. jun., “A Letter from Professor Kreisel”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 77–78
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18307
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 897.03005]
TI - Odifreddi, Piergiorgio, “Kreisel’s Church”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 389–415
ER -
TY - CHAP
AB - We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.
AU - Fischer, Matthias
AU - Lukovszki, Tamás
AU - Ziegler, Martin
ID - 17412
SN - 0302-9743
T2 - Algorithms — ESA’ 98
TI - Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time
ER -
TY - JOUR
AB - We investigate the performance of the GW approximation by comparison to exact results for small model systems. The role of the chemical potentials in Dyson's equation as well as the consequences of numerical resonance broadening are examined, and we show how a proper treatment can improve computational implementations of many-body perturbation theory in general. Exchange-only and GW calculations are performed over a wide range of fractional band fillings and correlation strengths. We thus identify the physical situations where these schemes are applicable.
AU - Pollehn, Thomas Joachim
AU - Schindlmayr, Arno
AU - Godby, Rex William
ID - 18624
IS - 6
JF - Journal of Physics: Condensed Matter
SN - 0953-8984
TI - Assessment of the GW approximation using Hubbard chains
VL - 10
ER -
TY - THES
AU - Vöcking, Berthold
ID - 19639
SN - 3-931466-45-0
TI - Static and Dynamic Data Management in Networks
ER -
TY - GEN
AB - The Paderborn University BSP (PUB) library is a parallel C library based on the BSP model. The basic library supports buffered and unbuffered asynchronous communication between any pair of processors, and a mechanism for synchronizing the processors in a barrier style. In addition, it provides routines for collective communication on arbitrary subsets of processors, partition operations, and a zero-cost synchronization mechanism. Furthermore, some techniques used in the implementation of the PUB library deviate significantly from the techniques used in other BSP libraries.
AU - Bonorden, Olaf
AU - Rieping, Ingo
AU - von Otte, Ingo
AU - Juurlink, Bernhardus
ID - 19735
TI - The Paderborn University BSP (PUB) Library - Design, Implementation and Performance
ER -