TY - JOUR
AU - Nilen, R.W.N.
AU - Connell, S.H.
AU - Britton, D.T.
AU - Fischer, C.G.
AU - Sendezera, E.J.
AU - Schmidt, Wolf Gero
AU - Sellschop, J.P.F.
AU - Verwoerd, W.S.
ID - 13859
JF - Materials Science Forum
SN - 1662-9752
TI - A High Resolution Investigation of the Anisotropic Electron-Positron Momentum Distribution in Diamond
VL - 255-257
ER -
TY - JOUR
AU - Grigoriev, Dima
AU - Karpinski, Marek
AU - Meyer auf der Heide, Friedhelm
AU - Smolensky, Roman
ID - 16564
JF - computational complexity
SN - 1016-3328
TI - A lower bound for randomized algebraic decision trees
ER -
TY - JOUR
AU - Hüllermeier, Eyke
ID - 16201
IS - 2
JF - International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
TI - A new approach to modelling and simulation of uncertain dynamical systems
VL - 5
ER -
TY - JOUR
AU - Dellnitz, Michael
AU - Hohmann, Andreas
ID - 17015
JF - Numerische Mathematik
SN - 0029-599X
TI - A subdivision algorithm for the computation of unstable manifolds and global attractors
VL - 75
ER -
TY - CONF
AU - Gutkauf, Bernd
AU - Thies, Stefanie
AU - Domik, Gitta
ID - 14991
T2 - User Modeling
TI - A user-adaptive chart editing system based on user modeling and critiquing
ER -
TY - CONF
AB - The idea of a combined reference model- and view-based specification approach has been proposed recently in the software engineering community. In this paper we present a specification technique based on graph transformations which supports such a development approach. The use of graphs and graph transformations supports an intuitive understanding and an integration of static and dynamic aspects on a well-defined semantical base. On this background, formal notions of view and view relation are developed and the behaviour of views is described by a loose semantics. We define a construction for automatic view integration which assumes that the dependencies between different views are described by a reference model. The views and the reference model are kept consistent manually, which is the task of a model manager. All concepts and results are illustrated at the well-known example of a banking system.
AU - Engels, Gregor
AU - Heckel, Reiko
AU - Taentzer, Gabriele
AU - Ehrig, Hartmut
ED - Jazayeri, M.
ED - Schauer, H.
ID - 7839
T2 - Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)
TI - A View-Oriented Approach to System Modelling Using Graph Transformations
VL - 1301
ER -
TY - CONF
AB - This paper describes speaker-independent speech recognition experiments concerning acoustic front end processing on a speech database that was recorded in 3 different cars. We investigate different feature analysis approaches (mel-filter bank, mel-cepstrum, perceptually linear predictive coding) and present results with noise compensation techniques based on spectral subtraction. Although the methods employed lead to considerable error rate reduction the error analysis shows that low signal-to-noise ratios are still a problem
AU - Langmann, Detlev
AU - Fischer, Alexander
AU - Wuppermann, Friedhelm
AU - Haeb-Umbach, Reinhold
AU - Eisele, Thomas
ID - 11852
T2 - Eurospeech
TI - Acoustic Front Ends for Speaker-Independent Digit Recognition in Car Environments
ER -
TY - CHAP
AB - The algebraic approaches to graph transformation are based on the concept of gluing of graphs, modelled by pushouts in suitable categories of graphs and graph morphisms. This allows one not only to give an explicit algebraic or set theoretical description of the constructions, but also to use concepts and results from category theory in order to build up a rich theory and to give elegant proofs even in complex situations. In this chapter we start with an overwiev of the basic notions common to the two algebraic approaches, the double-pushout (DPO) approach and the singlepushout (SPO) approach; next we present the classical theory and some recent development of the double-pushout approach. The next chapter is devoted instead to the single-pushout approach, and it is closed by a comparison between the two approaches.
AU - Corradini, Andrea
AU - Montanari, Ugo
AU - Rossi, Francesca
AU - Ehrig, Hartmut
AU - Heckel, Reiko
AU - Löwe, Michael
ID - 7517
T2 - Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations
TI - Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach
ER -
TY - CHAP
AB - The algebraic approaches to graph transformation are based on the concept of gluing of graphs corresponding to pushouts in suitable categories of graphs and graph morphisms. This allows one to give not only an explicit algebraic or set theoretical description of the constructions but also to use concepts and results from category theory in order to build up a rich theory and to give elegant proofs even in complex situations. In the previous chapter we have presented an overview of the basic notions and problems common to the two algebraic approaches the double pushout DPO approach and the single pushout SPO approach and their solutions in the DPO approach. In this chapter we introduce the SPO approach to graph transformation and some of its main results. We study application conditions for graph productions and the transformation of more general structures than graphs in the SPO approach where similar generalizations have been or could be studied also in the DPO approach. Finally we present a detailed comparison of the DPO and the SPO approach especially concerning the solutions to the problems discussed for both approaches in the previous chapter.
AU - Ehrig, Hartmut
AU - Heckel, Reiko
AU - Korff, Martin
AU - Löwe, Michael
AU - Ribeiro, Leila
AU - Wagner, Annika
AU - Corradini, Andrea
ID - 7515
T2 - Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations
TI - Algebraic Approaches to Graph Transformation, Part II: Single Pushout Approach and Comparison with Double Pushout Approach
ER -
TY - CONF
AU - Berenbrink, Petra
AU - Meyer auf der Heide, Friedhelm
AU - Schröder, Klaus
ID - 16604
SN - 0897918908
T2 - Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97
TI - Allocating weighted jobs in parallel
ER -
TY - JOUR
AB - Recently multilevel subdivision techniques have been introduced in the numerical investigation of complicated dynamical behavior. We illustrate the applicability and efficiency of these methods by a detailed numerical study of Chua's circuit. In particular we will show that there exist two regions in phase space which are almost invariant in the sense that typical trajectories stay inside each of these sets on average for quite a long time.
AU - Dellnitz, Michael
AU - Junge, Oliver
ID - 16535
JF - International Journal of Bifurcation and Chaos
SN - 0218-1274
TI - Almost Invariant Sets in Chua's Circuit
ER -
TY - JOUR
AU - Gries, Thomas
AU - Birk, Angela
ID - 3527
IS - 2
JF - Wirtschaftsdienst – Zeitschrift für Wirtschaftspolitik (1949 - 2007)
TI - Amerikanisches Job-Wunder versus deutsches Produktivitätswunder: Ein Vergleich der Arbeitsmarktstrategien
VL - 77
ER -
TY - JOUR
AU - Guder, Rabbijah
AU - Dellnitz, Michael
AU - Kreuzer, Edwin
ID - 16614
JF - Chaos, Solitons & Fractals
SN - 0960-0779
TI - An adaptive method for the approximation of the generalized cell mapping
ER -
TY - CONF
AU - Gadducci, Fabio
AU - Heckel, Reiko
ID - 8278
T2 - Proceedings of the 12th International Workshop on Recent Trends in Algebraic Development Techniques (WADT 1997), Tarquinia (Italy)
TI - An Inductive View of Graph Transformation
VL - 1376
ER -
TY - JOUR
AU - Schmidt, Wolf Gero
AU - Bechstedt, F.
ID - 13780
IS - 19
JF - Physical Review B
SN - 0163-1829
TI - Antimony-stabilized GaAs(001)(2×4) reconstructions
VL - 55
ER -
TY - CONF
AU - Hüllermeier, Eyke
ED - Grauel, A.
ED - Becker, W.
ED - Belli, F.
ID - 15291
T2 - in Proceedings 4.Internationaler Workshop Fuzzy-Neuro-Systeme. Soest Germany
TI - Approximation of fuzzy functions
ER -
TY - JOUR
AU - Grossner, U.
AU - Schmidt, Wolf Gero
AU - Bechstedt, F.
ID - 13777
IS - 11
JF - Physical Review B
SN - 0163-1829
TI - As on InP(110) studied within density-functional theory
VL - 56
ER -
TY - BOOK
ED - Hagengruber, Ruth
ED - Stein, Otti
ED - Wedig, Sigrid
ID - 15611
SN - 3928961152
TI - Begegnungen mit Philosophinnen : Seminar "Feministische Ethik"
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18208
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 873.01015]
TI - Benmakhlouf, Ali, Gottlob Frege. Logicien philosophe, Presses Universitaires de France: Paris 1997
ER -
TY - CONF
AU - Hahn, O.
AU - Meschut, Gerson
ID - 20739
T2 - Tagungsband zur Swiss Bonding ´97
TI - Bonding of Aluminium Profile joints
ER -
TY - CONF
AB - Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning tree of $G$ of maximum degree bounded by $dT$. It is well known that for each $dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning tree is NP-complete. In this paper we investigate this problem when additionally connectivity and maximum degree of the graph are given. A complete characterization of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$ is provided. Our first result is that given a biconnected graph of maximum degree $2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand, we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$ has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge 3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$ has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$. This extends the well known result for $k=3$ and fully characterizes the case $dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG > dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$. On the other hand, we show how to find in polynomial (linear or almost linear) time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.
AU - Czumaj, Artur
AU - Strothmann, Willy-B.
ID - 19869
SN - 0302-9743
T2 - Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)
TI - Bounded degree spanning trees
ER -
TY - THES
AU - Strothmann, Willy-Bernhard
ID - 19637
SN - 3-931466-34-5
TI - Bounded Degree Spanning Trees
ER -
TY - GEN
AU - Eke, Norbert Otto
ED - Brunner, Horst
ED - Moritz, Rainer
ID - 19480
T2 - Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik
TI - Bürgerliches Trauerspiel
ER -
TY - JOUR
AU - Gries, Thomas
AU - Jungblut, Stefan
ID - 3067
IS - 4
JF - Economia Internationale
TI - Catching-up and Structural Change
VL - 50
ER -
TY - CHAP
AU - Gries, Thomas
AU - Jungblut, Stefan
ED - Welfens, Paul J.J.
ED - Wolf, Holger C.
ID - 3526
SN - 9783540631927
T2 - Banking, International Capital Flows and Growth in Europe
TI - Catching-up of Economies in Transformation
ER -
TY - JOUR
AU - Großner, U.
AU - Schmidt, Wolf Gero
AU - Bechstedt, F.
AU - Santos, P.V.
AU - Koopmans, B.
AU - Esser, N.
ID - 13778
JF - Surface Science
SN - 0039-6028
TI - Chemisorption of arsenic on InP(110)
VL - 377-379
ER -
TY - CONF
AU - Gadducci, Fabio
AU - Heckel, Reiko
AU - Koch, Manuel
ID - 8277
T2 - Proceedings of the Workshop on the General Theory of Graph Transformation Systems (GETGRATS 1997), Bordeaux (France)
TI - Combining Graph Transformations with Temporal Logic
ER -
TY - THES
AU - Dittrich, Wolfgang
ID - 19636
SN - 3-931466-26-4
TI - Communication and I/O Efficient Parallel Data Structures
ER -
TY - THES
AU - Bäumker, Armin
ID - 19631
SN - 3-931466-27-2
TI - Communication Efficient Parallel Searching
ER -
TY - CHAP
AU - Bäumker, Armin
AU - Meyer auf der Heide, Friedhelm
ID - 16605
SN - 0302-9743
T2 - Solving Irregularly Structured Problems in Parallel
TI - Communication efficient parallel searching
ER -
TY - JOUR
AU - Schmidt, Wolf Gero
AU - Bechstedt, F.
ID - 13779
JF - Surface Science
SN - 0039-6028
TI - Comparison of As-rich and Sb-terminated GaAs(100)(2 × 4) reconstructions
VL - 377-379
ER -
TY - CONF
AU - Heckel, Reiko
ID - 8279
T2 - Proceedings of the Workshop on the General Theory of Graph Transformation Systems (GETGRATS 1997), Bordeaux (France)
TI - Compositional Development and Verification of Graph Transformation Systems Based on Views and View Integration
ER -
TY - CONF
AU - Krauter, Stefan
AU - Duwe, H.
ID - 8106
T2 - Zwölftes Nationales Symposium für Photovoltaische Energiewandlung, Staffelstein, 26.–28. Februar 1997, Band 1, S. 297–302.
TI - Das ECO–PV–System
ER -
TY - GEN
AU - Eke, Norbert Otto
ED - Brunner, Horst
ED - Moritz, Rainer
ID - 19483
T2 - Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik
TI - DDR-Literatur
ER -
TY - GEN
AB - In this paper we present a (randomized) algorithm for maintaining the biconnected components of a dynamic planar graph of $n$ vertices under deletions of edges. The biconnected components can be maintained under any sequence of edge deletions in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$ amortized time per edge deletion, which improves previous (deterministic) results due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed. Our work describes a simplification of the data structures from [GiIt96] and uses dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi and Italiano, we only need $O(n)$ space. Finally we describe some simply additional operations on the decremental data structure. By aid of them this the data structure is applicable for finding efficiently a $Delta$-spanning tree in a biconnected planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann.
AU - Strothmann, Willy-Bernhard
AU - Lukovszki, Tamás
ID - 18955
TI - Decremental Biconnectivity on Planar Graphs
ER -
TY - CONF
AU - Thies, S.
AU - Gutkauf, B.
AU - Domik-Kienegger, Gitta
ID - 16893
T2 - Proceedings 5. GI Workshop Adaptivität und Benutzermodellierung in interaktiven Softwaresystemen
TI - Demo eines Intelligenten Diagramm Assistenten (IDIAS)
ER -
TY - CHAP
AU - Blömer, Johannes
ID - 3029
SN - 0302-9743
T2 - Algorithms — ESA '97
TI - Denesting by bounded degree radicals
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18206
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 872.01030]
TI - DePauli-Schimanovich, Werner/Weibel, Peter, Kurt Gödel: ein mathematischer Mythos, Hölder-Pichler-Tempski: Wien 1997
ER -
TY - CONF
AU - Rensink, Arend
AU - Wehrheim, Heike
ED - Pr{\'{\i}}vara, Igor
ED - Ruzicka, Peter
ID - 3258
T2 - Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
TI - Dependency-Based Action Refinement
ER -
TY - CONF
AU - Rensink, Arend
AU - Wehrheim, Heike
ED - Pr{\'{\i}}vara, Igor
ED - Ruzicka, Peter
ID - 3259
T2 - Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
TI - Dependency-Based Action Refinement
ER -
TY - CHAP
AU - Krimphove, Dieter
ID - 1719
T2 - Festschrift für Axel Hunscha
TI - Der Gutgläubige Erwerb von Fahrnis in den Rechtsordnungen Europas -Ein Beitrag zur Rechtsvergleichung und Europäischen Rechtsharmonisierung unter Beachtung der Grundsätze der ökonomischen Analyse des "Europäischen Sachenrechts"-
VL - Nr. 26 / 97
ER -
TY - JOUR
AU - Hahn, O.
AU - Meschut, Gerson
ID - 20738
IS - 2
JF - Welding in the World
TI - Determination of the thermal conductivity of bonded joints
VL - 39
ER -
TY - JOUR
AU - Kremer, H.-Hugo
AU - Sloane, Peter F. E.
ID - 8470
IS - 1
JF - Erziehungswissenschaft und Beruf
TI - Didaktik des Rechnungswesens
ER -
TY - GEN
AU - Betz, Stefan
ID - 2671
TI - Die Zielkostenrechnung als Controllinginstrument
VL - Neue Folge Nr. 49
ER -
TY - CONF
AB - We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.
AU - Fischer, Matthias
AU - Meyer auf der Heide, Friedhelm
AU - Strothmann, W. -B.
ID - 16568
SN - 0302-9743
T2 - 5th Annual European Symposium on Algorithms (ESA '97)
TI - Dynamic data structures for realtime management of large geometric scenes
VL - 1284
ER -
TY - CONF
AU - Knoke, Stefan
AU - Depke, Ralph
AU - Schöne, Wolfram
AU - Brozek, O.S.
AU - Tünnermann, Andreas
AU - Welling, H.
ID - 7842
IS - 3
T2 - Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)
TI - Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung
VL - 32
ER -
TY - JOUR
AU - Nilen, R.W.N.
AU - Connell, S.H.
AU - Schmidt, Wolf Gero
AU - Britton, D.T.
AU - Verwoerd, W.S.
AU - Sellschop, J.P.F.
AU - Shrivastava, S.
ID - 13781
JF - Applied Surface Science
SN - 0169-4332
TI - Electron-positron momentum density distribution in diamond
VL - 116
ER -
TY - CONF
AU - Fischer, Markus
AU - Simon, Jens
ID - 2441
T2 - Proc. European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting (EuroPVM/MPI)
TI - Embedding SCI into PVM
VL - 1332
ER -
TY - CONF
AU - Sohler, Christian
AU - Denny, Markus
ID - 18575
T2 - Proceedings of the 9th Canadian Conference on Computational Geometry
TI - Encoding a Triangulation as a Permutation of its Point Set
ER -
TY - CONF
AB - The SpeechDat project aims to produce speech databases for all official languages of the European Union and some major dialectal variants and minority languages resulting in 28 speech databases. They will be recorded over fixed and mobile telephone networks. This will provide a realistic basis for training and assessment of both isolated and continuous-speech utterances, employing whole-word or subword approaches, and thus can be used for developing voice driven teleservices including speaker verification. The specification of the databases has been developed jointly, and is essentially the same for each language to facilitate dissemination and use. There will be a controlled variation among the speakers concerning sex, age, dialect, environment of call, etc. The validation of all databases will be carried out centrally. The SpeechDat databases will be transferred to ELRA for distribution. The next databases to be recorded will cover East European languages.
AU - Hoege, H.
AU - Tropf, H. S.
AU - Winsky, R.
AU - van den Heuvel, H.
AU - Haeb-Umbach, Reinhold
AU - Choukri, K.
ID - 11819
T2 - ICASSP, Munich
TI - European Speech Databases for Telephone Applications
ER -