@article{7694,
author = {Tscheuschner, Ralf D. and Hoch, Sascha and Leschinsky, Eva and Meier, Cedrik and Theis, Sabine and Wieck, Andreas D.},
issn = {0217-9792},
journal = {International Journal of Modern Physics B},
number = {11},
pages = {1147--1170},
publisher = {World Scientific Pub Co Pte Lt},
title = {{Robustness of the Quantum Hall Effect, Sample Size Versus Sample Topology, and Quality Control Management of III–V Molecular Beam Epitaxy}},
doi = {10.1142/s0217979298000636},
volume = {12},
year = {1998},
}
@misc{18271,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 891.00007]},
title = {{Rodych, Victor, “Wittgenstein on Mathematical Meaningfulness, Decidability, and Application”, Notre Dame Journal of Formal Logic 38 (1997), Nr. 2, 195–224}},
year = {1998},
}
@article{16503,
author = {Meyer auf der Heide, Friedhelm and Schröder, Klaus and Schwarze, Frank},
issn = {0304-3975},
journal = {Theoretical Computer Science},
pages = {181--200},
title = {{Routing on networks of optical crossbars}},
doi = {10.1016/s0304-3975(97)86791-6},
volume = {196},
year = {1998},
}
@inproceedings{2009,
abstract = {RSD (Resource and Service Description) is a scheme for specifying resources and services in complex heterogeneous computing systems and metacomputing environments. At the system administrator level, RSD is used to specify the available system components, such as the number of nodes, their interconnection topology, CPU speeds, and available software packages. At the user level, a GUI provides a comfortable, high-level interface for specifying system requests. A textual editor can be used for defining repetitive and recursive structures. This gives service providers the necessary flexibility for fine-grained specification of system topologies, interconnection networks, system and software dependent properties. All these representations are mapped onto a single, coherent internal object-oriented resource representation.
Dynamic aspects (like network performance, availability of compute nodes, and compute node loads) are traced at runtime and included in the resource description to allow for optimal process mapping and dynamic task load balancing at runtime at the metacomputer level. This is done in a self-organizing way, with human system operators becoming only involved when new hardware/software components are installed.},
author = {Brune, Matthias and Gehring, Jörn and Keller, Axel and Reinefeld, Alexander},
booktitle = {Proc. Int. Conf. on High-Performance Computing Systems (HPCS)},
title = {{RSD - Resource and Service Description}},
doi = {10.1007/978-1-4615-5611-4_18},
year = {1998},
}
@misc{18222,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 877.03001; Erstdruck mit falscher bibliographischer Angabe Zbl. 865.03001]},
title = {{Russell, Bertrand, Introduction to Mathematical Philosophy. With a New Introduction by John G. Slater, Reprint der Ausgabe von 1919, Routledge: London/New York 1993}},
year = {1998},
}
@inbook{3396,
author = {Gries, Thomas and Jungblut, Stefan and Meyer, H.},
booktitle = {Vestnik Sankt Peterskogo Universiteta – Seraja Ekonomiceskaja, St. Petersburg},
title = {{Russland vor der Schuldenfalle?}},
year = {1998},
}
@misc{18298,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 895.01007]},
title = {{Sacks, Gerald E., “Kreisel, Generalized Recursion Theory and I”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 103–108}},
year = {1998},
}
@misc{18232,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 877.03011]},
title = {{Sandu, Gabriel, “IF First-Order Logic, Kripke, and 3-Valued Logic”, in: J. Hintikka, The Principles of Mathematics Revisited, Cambridge 1996, 254–270}},
year = {1998},
}
@misc{18269,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 889.03002]},
title = {{Schroeder-Heister, Peter, “Frege and the Resolution Calculus”, History and Philosophy of Logic 18 (1997), 95–108}},
year = {1998},
}
@misc{18245,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 881.03002]},
title = {{Schulz, Klaus-Dieter, Die These von Church. Zur erkenntnistheoretischen und sprachphilosophischen Bedeutung der Rekursionstheorie, Peter Lang: Frankfurt a.M. u.a. 1997}},
year = {1998},
}
@article{8466,
author = {Kremer, H.-Hugo and Schwetz, U.},
journal = {Kölner Zeitschrift für Wirtschaft und Pädagogik},
number = {25},
pages = {189--193},
title = {{Selbstgesteuerte Weiterbildung von Ausbildern. Eine betriebspädagogische Studie}},
year = {1998},
}
@inproceedings{13008,
author = {Hellebrand, Sybille and Wunderlich, Hans-Joachim and N. Yarmolik, Vyacheslav},
booktitle = {{IEEE Design, Automation and Test in Europe (DATE'98)}},
pages = {173--179},
publisher = {{IEEE (Comput.Soc)}},
title = {{Self-Adjusting Output Data Compression: An Efficient BIST Technique for RAMs}},
doi = {10.1109/date.1998.655853},
year = {1998},
}
@proceedings{7793,
abstract = {During the last 20 years several different formal and semi-formal specification techniques have been successfully developed and used. Applications comprise the specification of simple programs, data types and processes as well as complex hardware and software systems. The variety of specification techniques ranges from formal set theoretical, algebraic, and logic approaches for specifying sequential systems and from Petri-nets, process algebras, automata, and graph grammars for specifying concurrent and distributed behaviors to semi-formal software engineering methods for developing complex systems. Formal and semi-formal approaches have their advantages and disadvantages: the informal diagrammatic methods are easier to understand and to apply but they can be ambiguous. Due to the different nature of the employed diagrams and descriptions it is often difficult to get a comprehensive view of all functional and dynamic properties. On the other hand, the formal approaches are more difficult to learn and require mathematical training. But they provide mathematical rigor for analysis and prototyping of designs. Verification is possible only with formal techniques. Since a few years many researchers and research groups are putting more and more effort in closing this gap by integrating semi-formal and formal specification techniques. Their studies and experiences show the added value of combining semi-formal and formal techniques and at the same time open a whole range of new problems and questions which cannot be asked when studying formalisms in isolation. In this seminar more than 40 scientists came together in 28 talks and two panel discussions to study possibilities and solutions for integrating and validating different formal and semi-formal specification techniques. Similarities and differences of formal and semi-formal specification formalisms as well as possibilities for combining such techniques were discussed. Most talks of this seminar analysed, compared, or integrated at least two such methods. On behalf of all participants the organizers would like to thank the staff of Schloss Dagstuhl for providing an excellent environment to the conference. The support of the TMR programme of the European Community is gratefully acknowledged. Due to this programme it was possible to fund the participation of several young researchers and of three key note speakers.},
editor = {Engels, Gregor and Ehrig, Hartmut and Orejas, Fernando and Wirsing, M.},
publisher = {Schloss Dagstuhl, Leibniz Center for Informatics},
title = {{Semi-Formal and Formal Specification Techniques}},
volume = {218},
year = {1998},
}
@inproceedings{8282,
author = {Heckel, Reiko and Hoffmann, Berthold and Knirsch, Peter and Kuske, Sabine},
booktitle = {Selected papers of the 6th International Workshop on Theory and Application of Graph Transformation (TAGT 1998), Paderborn (Germany)},
pages = {215--224},
publisher = {Springer},
title = {{Simple Modules for Grace}},
volume = {1764 },
year = {1998},
}
@article{10193,
author = {Brinkmann, Gunnar and Steffen, Eckhard},
journal = {Ars Combinatoria},
pages = {292 -- 296},
title = {{Snarks and reducibility}},
volume = {50},
year = {1998},
}
@misc{18212,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 876.00012]},
title = {{Spalt, Detlef D., „Exaktheit als Konstante, Begriffe im Wandel des mathematischen Denkens. Zur Analysis im 19. und 20. Jahrhundert“, in: Czermak (Hg.) 1993 [9.4], 45–59}},
year = {1998},
}
@article{2012,
abstract = {With a steadily increasing number of services, metacomputing is now gaining importance in science and industry. Virtual organizations, autonomous agents, mobile computing services, and high-performance client–server applications are among the many examples of metacomputing services. For all of them, resource description plays a major role in organizing access, use, and administration of the computing components and software services. We present a generic Resource and Service Description (RSD) for specifying the hardware and software components of (meta-) computing environments. Its graphical interface allows metacomputer users to specify their resource requests. Its textual counterpart gives service providers the necessary flexibility to specify topology and properties of the available system and software resources. Finally, its internal object-oriented representation is used to link different resource management systems and service tools. With these three representations, our generic RSD approach is a key component for building metacomputer environments.},
author = {Brune, Matthias and Gehring, Jörn and Keller, Axel and Monien, Burkhard},
journal = {Parallel Computing},
pages = {1751--1776},
publisher = {Elsevier},
title = {{Specifying Resources and Services in Metacomputing Environments}},
doi = {10.1016/S0167-8191(98)00076-3},
volume = {24},
year = {1998},
}
@article{18620,
abstract = {With the aim of identifying universal trends, we compare fully self-consistent electronic spectra and total energies obtained from the GW approximation with those from an extended GWΓ scheme that includes a nontrivial vertex function and the fundamentally distinct Bethe-Goldstone approach based on the T matrix. The self-consistent Green’s function G, as derived from Dyson’s equation, is used not only in the self-energy but also to construct the screened interaction W for a model system. For all approximations we observe a similar deterioration of the spectrum, which is not removed by vertex corrections. In particular, satellite peaks are systematically broadened and move closer to the chemical potential. The corresponding total energies are universally raised, independent of the system parameters. Our results, therefore, suggest that any improvement in total energy due to self-consistency, such as for the electron gas in the GW approximation, may be fortuitous.},
author = {Schindlmayr, Arno and Pollehn, Thomas Joachim and Godby, Rex William},
issn = {1095-3795},
journal = {Physical Review B},
number = {19},
pages = {12684--12690},
publisher = {American Physical Society},
title = {{Spectra and total energies from self-consistent many-body perturbation theory}},
doi = {10.1103/PhysRevB.58.12684},
volume = {58},
year = {1998},
}
@phdthesis{19639,
author = {Vöcking, Berthold},
isbn = {3-931466-45-0},
title = {{Static and Dynamic Data Management in Networks}},
year = {1998},
}
@inproceedings{8281,
author = {Corradini, Andrea and Große-Rhode, Martin and Heckel, Reiko},
booktitle = {Proceedings of the First Workshop on Coalgebraic Methods in Computer Science (CMCS 1998), Lisbon (Portugal)},
publisher = {Elsevier},
title = {{Structured Transition Systems as Lax Coalgebras}},
volume = {11},
year = {1998},
}
@article{13064,
author = {Hellebrand, Sybille and Hertwig, Andre and Wunderlich, Hans-Joachim},
journal = {{IEEE Design and Test}},
number = {4},
pages = {36--41},
title = {{Synthesis of Fast On-Line Testable Controllers for Data-Dominated Applications}},
volume = {15},
year = {1998},
}
@article{18622,
abstract = {We present a general procedure for obtaining progressively more accurate functional expressions for the electron self-energy by iterative solution of Hedin's coupled equations. The iterative process starting from Hartree theory, which gives rise to the GW approximation, is continued further, and an explicit formula for the vertex function from the second full cycle is given. Calculated excitation energies for a Hubbard Hamiltonian demonstrate the convergence of the iterative process and provide further strong justification for the GW approximation.},
author = {Schindlmayr, Arno and Godby, Rex William},
issn = {1079-7114},
journal = {Physical Review Letters},
number = {8},
pages = {1702--1705},
publisher = {American Physical Society},
title = {{Systematic vertex corrections through iterative solution of Hedin's equations beyond the GW approximation}},
doi = {10.1103/PhysRevLett.80.1702},
volume = {80},
year = {1998},
}
@misc{18296,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 894.01015]},
title = {{Takeuti, Gaisi, “Kreisel and I”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 107–109}},
year = {1998},
}
@inproceedings{16891,
author = {Vollbracht, S. and Domik-Kienegger, Gitta and Backe-Neuwald, D. and Rinkens, H.-D.},
booktitle = {Proceedings of ED-MEDIA},
location = {Freiburg},
title = {{Teaching Spatial Orientation using Virtual Worlds}},
year = {1998},
}
@techreport{13029,
author = {Hellebrand, Sybille and Wunderlich, Hans-Joachim},
title = {{Test und Synthese schneller eingebetteter Systeme}},
year = {1998},
}
@article{15070,
author = {Volbracht, Sabine and Domik, Gitta and Backe-Neuwald, Dorothea and Rinkens, Hans-Dieter},
journal = {Journal of Universal Computer Science},
number = {4},
pages = {461--465},
title = {{The City Game: An Example of a Virtual Environment for Teaching Spatial Orientation.}},
volume = {4},
year = {1998},
}
@inbook{3361,
author = {Gries, Thomas and Jungblut, Stefan},
booktitle = {Operations Research Proceedings 1997},
pages = {241--246},
publisher = {Springer},
title = {{The Dynamics of Growth and Employment in a Two-Sector Model of Job Matching}},
year = {1998},
}
@inproceedings{17879,
author = {Peckhaus, Volker},
booktitle = {Twentieth World Congress of Philosophy. Abstracts of Invited and Contributed Papers},
editor = {Dawson, Stephen and a., u.},
pages = {156},
title = {{The Heuristic Function of the Axiomatic Method [Abstract]}},
year = {1998},
}
@inbook{3360,
author = {Gries, Thomas and Jungblut, Stefan},
booktitle = {Economic Aspects of Digital Information Technology, DUV},
editor = {Gries, Thomas and Suhl, Leena},
title = {{The Impacts of Information Technologies on Innovation Dynamics and Labor Demand}},
year = {1998},
}
@article{2437,
author = {Simon, Jens and Wierum, Jens-Michael},
issn = {0020-0190},
journal = {Information Processing Letters - Special Issue on Models of Computation},
number = {5},
pages = {255--261},
publisher = {Elsevier},
title = {{The Latency-of-Data-Access model for Analyzing Parallel Computation}},
doi = {10.1016/S0020-0190(98)00062-3},
volume = {66},
year = {1998},
}
@techreport{19735,
abstract = {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.},
author = {Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus},
title = {{The Paderborn University BSP (PUB) Library - Design, Implementation and Performance}},
year = {1998},
}
@inproceedings{8115,
author = {Krauter, Stefan and Schroer, S. and Araújo, R. G. and Stephan, R.},
booktitle = {Elftes Internationales Sonnenforum, 26.−30. Juli 1998, Köln (Deutschland), S. 368–375},
title = {{Thermisch aktive PV-Module zur Fassadenintegration}},
year = {1998},
}
@inproceedings{8908,
author = {Sextro, Walter and Popp, Karl and Wolter, I},
booktitle = {The 7th International Symposium on Transport Phenomena and Dynamics of Rotating Machinery, Proceedings of ISROMAC-7},
pages = {621--630},
title = {{Three-Dimensional Vibration of Bladed Disk Assemblies with Friction Dampers}},
volume = {B},
year = {1998},
}
@misc{15576,
author = {Hagengruber, Ruth},
booktitle = {Philosophischer Literaturanzeiger},
number = {1},
pages = {9--12},
title = {{Tommaso Campanella: Philosophische Gedichte. Übersetzt und hrsg. von Thomas Flasch. Frankfurt a. M.: Klostermann, 1996}},
volume = {51},
year = {1998},
}
@article{16504,
author = {Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm},
issn = {0304-3975},
journal = {Theoretical Computer Science},
pages = {175--203},
title = {{Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}},
doi = {10.1016/s0304-3975(98)00020-6},
year = {1998},
}
@article{13810,
author = {Hauptmann, Peter and Lucklum, Ralf and Püttmer, Alf and Henning, Bernd},
journal = {Sensors and Actuators A: Physical},
number = {1-3},
pages = {32--48},
title = {{Ultrasonic sensors for process monitoring and chemical analysis state of the art and trends}},
doi = {10.1016/S0924-4247(97)01725-1},
volume = {67},
year = {1998},
}
@article{2168,
author = {Scheideler, Christian and Vöcking, Berthold},
journal = {Theory Comput. Syst.},
number = {4},
pages = {425----449},
title = {{Universal Continuous Routing Strategies}},
doi = {10.1007/s002240000096},
volume = {31},
year = {1998},
}
@book{2185,
author = {Scheideler, Christian},
isbn = {978-3-540-69792-3},
title = {{Universal Routing Strategies for Interconnection Networks}},
doi = {10.1007/BFb0052928},
volume = {1390},
year = {1998},
}
@inproceedings{8280,
author = {Kolmschlag, Silvia and Engels, Gregor},
booktitle = {Proceedings of the workshop on "Integration heterogener Softwaresysteme" (satellite event of the GI-Jahrestagung Informatik 1998), Magdeburg (Germany)},
pages = {13--24},
publisher = {GI},
title = {{Unterstützung der Flexibilität eines Electronic Commerce Systems durch Evolutionstechniken}},
year = {1998},
}
@article{20741,
author = {Meschut, Gerson},
journal = {Adhäsion},
number = {4},
pages = {6},
title = {{Untersuchungen zur Wärmeleitfähigkeit und zum Festigkeits- und Alterungsverhalten von Klebverbindungen mit und ohne Füllstoffzusatz}},
volume = {42},
year = {1998},
}
@phdthesis{20744,
author = {Meschut, Gerson},
publisher = {Shaker Verlag},
title = {{Untersuchungen zur Wärmeleitfähigkeit von Klebverbindungen unter Berücksichtigung klebspezifischer Randbedingungen}},
year = {1998},
}
@inproceedings{15617,
author = {Hagengruber, Ruth},
location = {Boston},
title = {{Utility and Universality versus Utility and the General Good}},
year = {1998},
}
@inproceedings{20743,
author = {Meschut, Gerson and Hahn, O. and Eis, M.},
booktitle = {Tagungsband zur Swissbondung 98},
location = {Rapperswil (CH)},
title = {{Vermeidung von Abzeichnungen an Stahlblechklebungen}},
year = {1998},
}
@techreport{4940,
author = {Sadowski, Dieter and Pull, Kerstin and Schneider, Martin},
title = {{Vertrauen: Voraussetzung oder Ergebnis effizienter Arbeitsbeziehungen?-Gutenbergs Solidaritätsaxiom und die institutionenökonomische Unternehmenstheorie.}},
year = {1998},
}
@inproceedings{8907,
author = {Sextro, Walter and Popp, Karl and Wolter, I},
booktitle = {International Congress on Combustion Engines, Proceedings of the 22nd CIMAC},
pages = {257--270},
title = {{Vibrational Behaviour of Tuned and Detuned Bladed Disks with Friction Dampers}},
volume = {1},
year = {1998},
}
@article{8467,
author = {Kremer, H.-Hugo and Wilbers, K.},
journal = {Kölner Zeitschrift für Wirtschaft und Pädagogik},
number = {25},
pages = {99--117},
title = {{Virtuelles Seminar "Wipäd Köln - München" - Konzeption und erste Erfahrungen}},
year = {1998},
}
@inproceedings{21785,
author = {D. Stuwe, J. and Lenz, C. and Domik, Gitta},
booktitle = {Proceedings. Computer Graphics International (Cat. No.98EX149)},
pages = {111--112},
title = {{Visualization of geographic data using VRML-an Internet client, for a geographic information system (GIS)}},
doi = {10.1109/CGI.1998.694258},
volume = {1},
year = {1998},
}
@inproceedings{15271,
author = {Koenig, M and Lenz, Christian and Domik, Gitta},
booktitle = {Proceedings. Computer Graphics International (Cat. No. 98EX149)},
pages = {402--403},
title = {{Visualization of meteorological data using an interactive flight}},
year = {1998},
}
@misc{18238,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 878.03005]},
title = {{Wang, Hao, “What is Logic?”, in: Puhl (Hg.) 1993 [9.5], 11–23}},
year = {1998},
}
@misc{18308,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 897.03006]},
title = {{Weingartner, Paul, “Some Critical Remarks on Definitions and on Philosophical and Logical Ideals”, in: P. Odifreddi (ed.), Kreiseliana, Wellesley, MA 1996, 417–438}},
year = {1998},
}
@article{3601,
author = {Harteis, Christian and Prenzel, Manfred},
journal = {Zeitschrift für Pädagogik, H},
pages = {583----601},
title = {{Welche Kompetenzen brauchen betriebliche Weiterbildner in Zukunft}},
year = {1998},
}
@misc{18220,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 877.01042]},
title = {{Whitehead, Alfred North/Russell, Bertrand, Principia Mathematica to *56, Cambridge University Press: Cambridge 1997}},
year = {1998},
}
@inbook{15614,
author = {Hagengruber, Ruth},
booktitle = {Perspektiven der Frauenforschung},
editor = {von Bardeleben, Renate and Plummer, Patricia},
pages = {19--27},
publisher = {Stauffenberg-Verlag},
title = {{Widersprüche, Paradoxien und Klärungen. Überlegungen grundsätzlicher Art zur Frauenforschung aus der Sicht von Philosophinnen}},
year = {1998},
}
@article{15616,
author = {Hagengruber, Ruth},
journal = {Ethica. Wissenschaft und Verantwortung},
number = {2},
pages = {182--189},
title = {{Wirtschaften als Erhalt der Güter - eine Utopie?}},
volume = {6},
year = {1998},
}
@book{15508,
editor = {Hagengruber, Ruth},
title = {{Wissen und Handeln}},
year = {1998},
}
@article{20745,
author = {Hahn, O. and Koyro, M. and Meschut, Gerson},
journal = {Schweißen und Schneiden},
number = {7},
pages = {424--430},
title = {{Wärmeleitfähigkeit, Festigkeit und Alterungsverhalten von Klebverbindungen mit füllstoffmodifizierten Klebstoffen}},
volume = {50},
year = {1998},
}
@misc{17647,
author = {Peckhaus, Volker},
booktitle = {Routledge Encyclopedia of Philosophy, Bd. 9: Sociology of knowledge to Zoroastrianism},
editor = {Craig, Edward},
pages = {853--855},
publisher = {Routledge},
title = {{Zermelo, Ernst (1871–1953)}},
year = {1998},
}
@article{2582,
author = {Betz, Stefan},
journal = {Zeitschrift für Planung},
pages = {pp. 249--268},
title = {{Zielkostenplanung und -kontrolle auf Basis der Erfahrungskurve}},
volume = {9},
year = {1998},
}
@article{3675,
author = {Harteis, Christian},
journal = {Personal},
pages = {332----339},
title = {{Zur Qualitätsdebatte in der betrieblichen Bildungsarbeit}},
volume = {50},
year = {1998},
}
@misc{17781,
author = {Peckhaus, Volker},
booktitle = {Russell},
number = {2 (Winter 1997/98)},
pages = {181–185 [überarbeitete englische Fassung von “Russell y las ‘Paradojas’”)},
title = {{“Russell’s Paradox”, Rezension von Alejandro R. Garciadiego. Bertrand Russell and the Origins of the Set-theoretic ‘Paradoxes’. Basel, Boston and Berlin: Birkhäuser Verlag, 1992. Spanish edition: Bertrand Russell y los origines de las “paradojas” de la theoría de conjuntos. Madrid: Alianza Editorial, 1992}},
volume = {17},
year = {1998},
}
@book{1606,
author = {Krimphove, Dieter},
pages = {251},
publisher = {Lit Verlag},
title = {{"Wir haben ein Gesetz..." rechtliche Anmerkungen zum Strafverfahren gegen Jesus}},
year = {1997},
}
@article{13775,
author = {Schmidt, Wolf Gero},
issn = {0947-8396},
journal = {Applied Physics A: Materials Science & Processing},
pages = {581--586},
title = {{(4×2) and (2×4) reconstructions of GaAs and InP(001) surfaces}},
doi = {10.1007/s003390050625},
volume = {65},
year = {1997},
}
@article{10196,
author = {Brinkmann, Gunnar and Steffen, Eckhard},
journal = {Discrete Mathematics},
pages = { 193 --197},
title = {{3- and 4-critical graphs of small even order}},
volume = {188},
year = {1997},
}
@inproceedings{8276,
author = {Gadducci, Fabio and Heckel, Reiko},
booktitle = {Proceedings of the Workshop on the General Theory of Graph Transformation Systems (GETGRATS 1997), Bordeaux (France)},
title = {{A 2-Categorical Presentation of Distributed Graph Transformation}},
year = {1997},
}
@inproceedings{2013,
author = {Brune, Matthias and Hellmann, Christian and Keller, Axel},
booktitle = {Proc. Workshop Hypercomputing at ITG/GI-Conference Architekur von Rechensystemen},
title = {{A Closer Step towards Management of Metacomputing-Resources}},
year = {1997},
}
@article{7403,
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 allows to satisfy the general requirements of an intuitive understanding and the integration of static and dynamic aspects on a well-defined and sound 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. View relations are shown to preserve the behaviour of views. Moreover, we define a construction for the automatic integration of views 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. In case of more than two views more general scenarios are developed and discussed. We are able to show that the automatic view integration is compatible with the loose semantics, i.e., the behaviour of the system model is exactly the integration of the behaviours of the views. 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},
journal = {Int. Journal of Software and Knowledge Engeneering},
number = {4},
pages = {457--477},
title = {{A Combined Reference Model- and View-Based Approach to System Specification}},
volume = {7},
year = {1997},
}
@article{10609,
author = {Platzner, Marco and Rinner, Bernhard and Weiss, Reinhold},
journal = {e & i Elektrotechnik und Informationstechnik},
pages = {13--18},
publisher = {Springer},
title = {{A Computer Architecture to Support Qualitative Simulation in Industrial Applications}},
volume = {114},
year = {1997},
}
@article{13859,
author = {Nilen, R.W.N. and Connell, S.H. and Britton, D.T. and Fischer, C.G. and Sendezera, E.J. and Schmidt, Wolf Gero and Sellschop, J.P.F. and Verwoerd, W.S.},
issn = {1662-9752},
journal = {Materials Science Forum},
pages = {475--478},
title = {{A High Resolution Investigation of the Anisotropic Electron-Positron Momentum Distribution in Diamond}},
doi = {10.4028/www.scientific.net/msf.255-257.475},
volume = {255-257},
year = {1997},
}
@article{16564,
author = {Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman},
issn = {1016-3328},
journal = {computational complexity},
pages = {357--375},
title = {{A lower bound for randomized algebraic decision trees}},
doi = {10.1007/bf01270387},
year = {1997},
}
@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},
}