@article{16201,
author = {Hüllermeier, Eyke},
journal = {International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems},
number = {2},
pages = {117--137},
title = {{A new approach to modelling and simulation of uncertain dynamical systems}},
volume = {5},
year = {1997},
}
@article{17015,
author = {Dellnitz, Michael and Hohmann, Andreas},
issn = {0029-599X},
journal = {Numerische Mathematik},
pages = {293--317},
title = {{A subdivision algorithm for the computation of unstable manifolds and global attractors}},
doi = {10.1007/s002110050240},
volume = {75},
year = {1997},
}
@inproceedings{14991,
author = {Gutkauf, Bernd and Thies, Stefanie and Domik, Gitta},
booktitle = {User Modeling},
pages = {159--170},
title = {{A user-adaptive chart editing system based on user modeling and critiquing}},
year = {1997},
}
@inproceedings{7839,
abstract = {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.},
author = {Engels, Gregor and Heckel, Reiko and Taentzer, Gabriele and Ehrig, Hartmut},
booktitle = {Proceedings European Software Engineering Conference (ESEC 1997), Zürich (Switzerland)},
editor = {Jazayeri, M. and Schauer, H.},
pages = {327--343},
publisher = {Springer},
title = {{A View-Oriented Approach to System Modelling Using Graph Transformations}},
doi = {http://dx.doi.org/10.1007/3-540-63531-9},
volume = {1301},
year = {1997},
}
@inproceedings{11852,
abstract = {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},
author = {Langmann, Detlev and Fischer, Alexander and Wuppermann, Friedhelm and Haeb-Umbach, Reinhold and Eisele, Thomas},
booktitle = {Eurospeech},
title = {{Acoustic Front Ends for Speaker-Independent Digit Recognition in Car Environments}},
year = {1997},
}
@inbook{7517,
abstract = {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.},
author = {Corradini, Andrea and Montanari, Ugo and Rossi, Francesca and Ehrig, Hartmut and Heckel, Reiko and Löwe, Michael},
booktitle = {Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations},
pages = {163--245},
publisher = {World Scientific},
title = {{Algebraic Approaches to Graph Transformation, Part I: Basic Concepts and Double Pushout Approach}},
year = {1997},
}
@inbook{7515,
abstract = {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.},
author = {Ehrig, Hartmut and Heckel, Reiko and Korff, Martin and Löwe, Michael and Ribeiro, Leila and Wagner, Annika and Corradini, Andrea},
booktitle = {Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations},
pages = {247--312},
publisher = {World Scientific},
title = {{Algebraic Approaches to Graph Transformation, Part II: Single Pushout Approach and Comparison with Double Pushout Approach}},
year = {1997},
}
@inproceedings{16604,
author = {Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Schröder, Klaus},
booktitle = {Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97},
isbn = {0897918908},
title = {{Allocating weighted jobs in parallel}},
doi = {10.1145/258492.258522},
year = {1997},
}
@article{16535,
abstract = { 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. },
author = {Dellnitz, Michael and Junge, Oliver},
issn = {0218-1274},
journal = {International Journal of Bifurcation and Chaos},
pages = {2475--2485},
title = {{Almost Invariant Sets in Chua's Circuit}},
doi = {10.1142/s0218127497001655},
year = {1997},
}
@article{3527,
author = {Gries, Thomas and Birk, Angela},
journal = {Wirtschaftsdienst – Zeitschrift für Wirtschaftspolitik (1949 - 2007)},
number = {2},
pages = {99--106},
title = {{Amerikanisches Job-Wunder versus deutsches Produktivitätswunder: Ein Vergleich der Arbeitsmarktstrategien}},
volume = {77},
year = {1997},
}
@article{16614,
author = {Guder, Rabbijah and Dellnitz, Michael and Kreuzer, Edwin},
issn = {0960-0779},
journal = {Chaos, Solitons & Fractals},
pages = {525--534},
title = {{An adaptive method for the approximation of the generalized cell mapping}},
doi = {10.1016/s0960-0779(96)00118-x},
year = {1997},
}
@inproceedings{8278,
author = {Gadducci, Fabio and Heckel, Reiko},
booktitle = {Proceedings of the 12th International Workshop on Recent Trends in Algebraic Development Techniques (WADT 1997), Tarquinia (Italy)},
pages = {223--237},
publisher = {Springer},
title = {{An Inductive View of Graph Transformation}},
volume = {1376},
year = {1997},
}
@article{13780,
author = {Schmidt, Wolf Gero and Bechstedt, F.},
issn = {0163-1829},
journal = {Physical Review B},
number = {19},
pages = {13051--13057},
title = {{Antimony-stabilized GaAs(001)(2×4) reconstructions}},
doi = {10.1103/physrevb.55.13051},
volume = {55},
year = {1997},
}
@inproceedings{15291,
author = {Hüllermeier, Eyke},
booktitle = {in Proceedings 4.Internationaler Workshop Fuzzy-Neuro-Systeme. Soest Germany},
editor = {Grauel, A. and Becker, W. and Belli, F.},
pages = {374--381},
title = {{Approximation of fuzzy functions}},
year = {1997},
}
@article{13777,
author = {Grossner, U. and Schmidt, Wolf Gero and Bechstedt, F.},
issn = {0163-1829},
journal = {Physical Review B},
number = {11},
pages = {6719--6726},
title = {{As on InP(110) studied within density-functional theory}},
doi = {10.1103/physrevb.56.6719},
volume = {56},
year = {1997},
}
@book{15611,
editor = {Hagengruber, Ruth and Stein, Otti and Wedig, Sigrid},
isbn = {3928961152},
publisher = {Quast-Verlag},
title = {{Begegnungen mit Philosophinnen : Seminar "Feministische Ethik" }},
year = {1997},
}
@misc{18208,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 873.01015]},
title = {{Benmakhlouf, Ali, Gottlob Frege. Logicien philosophe, Presses Universitaires de France: Paris 1997}},
year = {1997},
}
@inproceedings{20739,
author = {Hahn, O. and Meschut, Gerson},
booktitle = {Tagungsband zur Swiss Bonding ´97},
location = {Rapperswil (CH)},
title = {{Bonding of Aluminium Profile joints}},
year = {1997},
}
@inproceedings{19869,
abstract = {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$.},
author = {Czumaj, Artur and Strothmann, Willy-B.},
booktitle = {Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)},
isbn = {9783540633976},
issn = {0302-9743},
title = {{Bounded degree spanning trees}},
doi = {10.1007/3-540-63397-9_9},
year = {1997},
}
@phdthesis{19637,
author = {Strothmann, Willy-Bernhard},
isbn = {3-931466-34-5},
title = {{Bounded Degree Spanning Trees}},
year = {1997},
}
@misc{19480,
author = {Eke, Norbert Otto},
booktitle = {Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik},
editor = {Brunner, Horst and Moritz, Rainer},
pages = {58--60},
title = {{Bürgerliches Trauerspiel}},
year = {1997},
}
@article{3067,
author = {Gries, Thomas and Jungblut, Stefan},
journal = {Economia Internationale},
number = {4},
pages = {3--24},
title = {{Catching-up and Structural Change}},
volume = {50},
year = {1997},
}
@inbook{3526,
author = {Gries, Thomas and Jungblut, Stefan},
booktitle = {Banking, International Capital Flows and Growth in Europe},
editor = {Welfens, Paul J.J. and Wolf, Holger C.},
isbn = {9783540631927},
pages = {297 -- 311},
publisher = {Springer-Verlag},
title = {{Catching-up of Economies in Transformation}},
year = {1997},
}
@article{13778,
author = {Großner, U. and Schmidt, Wolf Gero and Bechstedt, F. and Santos, P.V. and Koopmans, B. and Esser, N.},
issn = {0039-6028},
journal = {Surface Science},
pages = {619--622},
title = {{Chemisorption of arsenic on InP(110)}},
doi = {10.1016/s0039-6028(96)01469-0},
volume = {377-379},
year = {1997},
}
@inproceedings{8277,
author = {Gadducci, Fabio and Heckel, Reiko and Koch, Manuel},
booktitle = {Proceedings of the Workshop on the General Theory of Graph Transformation Systems (GETGRATS 1997), Bordeaux (France)},
title = {{Combining Graph Transformations with Temporal Logic}},
year = {1997},
}
@phdthesis{19636,
author = {Dittrich, Wolfgang},
isbn = {3-931466-26-4},
title = {{Communication and I/O Efficient Parallel Data Structures}},
year = {1997},
}
@phdthesis{19631,
author = {Bäumker, Armin},
isbn = {3-931466-27-2},
title = {{Communication Efficient Parallel Searching}},
year = {1997},
}
@inbook{16605,
author = {Bäumker, Armin and Meyer auf der Heide, Friedhelm},
booktitle = {Solving Irregularly Structured Problems in Parallel},
isbn = {9783540631385},
issn = {0302-9743},
title = {{Communication efficient parallel searching}},
doi = {10.1007/3-540-63138-0_21},
year = {1997},
}
@article{13779,
author = {Schmidt, Wolf Gero and Bechstedt, F.},
issn = {0039-6028},
journal = {Surface Science},
pages = {11--14},
title = {{Comparison of As-rich and Sb-terminated GaAs(100)(2 × 4) reconstructions}},
doi = {10.1016/s0039-6028(96)01318-0},
volume = {377-379},
year = {1997},
}
@inproceedings{8279,
author = {Heckel, Reiko},
booktitle = {Proceedings of the Workshop on the General Theory of Graph Transformation Systems (GETGRATS 1997), Bordeaux (France)},
title = {{Compositional Development and Verification of Graph Transformation Systems Based on Views and View Integration}},
year = {1997},
}
@inproceedings{8106,
author = {Krauter, Stefan and Duwe, H.},
booktitle = {Zwölftes Nationales Symposium für Photovoltaische Energiewandlung, Staffelstein, 26.–28. Februar 1997, Band 1, S. 297–302.},
title = {{Das ECO–PV–System}},
year = {1997},
}
@misc{19483,
author = {Eke, Norbert Otto},
booktitle = {Literaturwissenschaftliches Lexikon. Grundbegriffe der Germanistik},
editor = {Brunner, Horst and Moritz, Rainer},
pages = {64--68},
title = {{DDR-Literatur}},
year = {1997},
}
@techreport{18955,
abstract = {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.},
author = {Strothmann, Willy-Bernhard and Lukovszki, Tamás},
title = {{Decremental Biconnectivity on Planar Graphs}},
year = {1997},
}
@inproceedings{16893,
author = {Thies, S. and Gutkauf, B. and Domik-Kienegger, Gitta},
booktitle = {Proceedings 5. GI Workshop Adaptivität und Benutzermodellierung in interaktiven Softwaresystemen},
location = {Saarbrücken},
title = {{Demo eines Intelligenten Diagramm Assistenten (IDIAS)}},
year = {1997},
}
@inbook{3029,
author = {Blömer, Johannes},
booktitle = {Algorithms — ESA '97},
isbn = {9783540633976},
issn = {0302-9743},
pages = {53--63},
publisher = {Springer Berlin Heidelberg},
title = {{Denesting by bounded degree radicals}},
doi = {10.1007/3-540-63397-9_5},
year = {1997},
}
@misc{18206,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 872.01030]},
title = {{DePauli-Schimanovich, Werner/Weibel, Peter, Kurt Gödel: ein mathematischer Mythos, Hölder-Pichler-Tempski: Wien 1997}},
year = {1997},
}
@inproceedings{3258,
author = {Rensink, Arend and Wehrheim, Heike},
booktitle = {Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings},
editor = {Pr{\'{\i}}vara, Igor and Ruzicka, Peter},
pages = {468----477},
title = {{Dependency-Based Action Refinement}},
doi = {10.1007/BFb0029990},
year = {1997},
}
@inproceedings{3259,
author = {Rensink, Arend and Wehrheim, Heike},
booktitle = {Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings},
editor = {Pr{\'{\i}}vara, Igor and Ruzicka, Peter},
pages = {468----477},
title = {{Dependency-Based Action Refinement}},
doi = {10.1007/BFb0029990},
year = {1997},
}
@inbook{1719,
author = {Krimphove, Dieter},
booktitle = {Festschrift für Axel Hunscha },
pages = {109--150},
publisher = {FHTW Schriftenreihe},
title = {{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"-}},
volume = {Nr. 26 / 97},
year = {1997},
}
@article{20738,
author = {Hahn, O. and Meschut, Gerson},
journal = {Welding in the World},
number = {2},
pages = {111--116},
title = {{Determination of the thermal conductivity of bonded joints}},
volume = {39},
year = {1997},
}
@article{8470,
author = {Kremer, H.-Hugo and Sloane, Peter F. E.},
journal = {Erziehungswissenschaft und Beruf},
number = {1},
pages = {137--138},
title = {{Didaktik des Rechnungswesens}},
year = {1997},
}
@techreport{2671,
author = {Betz, Stefan},
title = {{Die Zielkostenrechnung als Controllinginstrument}},
volume = {Neue Folge Nr. 49},
year = {1997},
}
@inproceedings{16568,
abstract = {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.
},
author = {Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, W. -B.},
booktitle = {5th Annual European Symposium on Algorithms (ESA '97)},
isbn = {9783540633976},
issn = {0302-9743},
pages = {1157 -- 170},
publisher = {Springer},
title = {{Dynamic data structures for realtime management of large geometric scenes}},
doi = {10.1007/3-540-63397-9_13},
volume = {1284},
year = {1997},
}
@inproceedings{7842,
author = {Knoke, Stefan and Depke, Ralph and Schöne, Wolfram and Brozek, O.S. and Tünnermann, Andreas and Welling, H.},
booktitle = {Verhandlungen der Deutschen Physikalischen Gesellschaft, Weinheim (Germany)},
number = {3},
publisher = {Physik-Verlag},
title = {{Einfrequenzbetrieb von Nd:YAG-Stablasersystemen hoher Ausgangsleistung}},
volume = {32},
year = {1997},
}
@article{13781,
author = {Nilen, R.W.N. and Connell, S.H. and Schmidt, Wolf Gero and Britton, D.T. and Verwoerd, W.S. and Sellschop, J.P.F. and Shrivastava, S.},
issn = {0169-4332},
journal = {Applied Surface Science},
pages = {330--334},
title = {{Electron-positron momentum density distribution in diamond}},
doi = {10.1016/s0169-4332(96)01078-1},
volume = {116},
year = {1997},
}
@inproceedings{2441,
author = {Fischer, Markus and Simon, Jens},
booktitle = {Proc. European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting (EuroPVM/MPI)},
pages = {175--184},
publisher = {Springer},
title = {{Embedding SCI into PVM}},
doi = {10.1007/3-540-63697-8_84},
volume = {1332},
year = {1997},
}
@inproceedings{18575,
author = {Sohler, Christian and Denny, Markus},
booktitle = {Proceedings of the 9th Canadian Conference on Computational Geometry},
pages = {39--43},
title = {{Encoding a Triangulation as a Permutation of its Point Set}},
year = {1997},
}
@inproceedings{11819,
abstract = {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.},
author = {Hoege, H. and Tropf, H. S. and Winsky, R. and van den Heuvel, H. and Haeb-Umbach, Reinhold and Choukri, K.},
booktitle = {ICASSP, Munich},
title = {{European Speech Databases for Telephone Applications}},
year = {1997},
}
@article{1665,
author = {Krimphove, Dieter},
journal = {Kommunale Aufgaben und Umweltrecht },
number = {Juli},
pages = {49 ff.},
title = {{Europäisches Arbeitsrecht - Konsequenzen für die betriebliche Praxis}},
year = {1997},
}
@inbook{1718,
author = {Krimphove, Dieter and Schollmeier, Andres},
booktitle = {Bleckmann, Europarecht},
pages = {650--717},
publisher = {Carl Heymanns Verlag KG},
title = {{Europäisches Wirtschaftsrecht}},
year = {1997},
}