@article{23361, author = {{Trächtler, Ansgar and Wernsdörfer, Andreas}}, journal = {{Frontiers in Industrial Process Tomography, Engineering Foundation}}, pages = {{159--170,}}, title = {{{Direct Algebraic Reconstruction in Electromagnetic Flow Tomography}}}, year = {{1995}}, } @article{23362, author = {{Trächtler, Ansgar}}, journal = {{Frontiers in Industrial Process Tomography, Engineering Foundation}}, title = {{{Stress Tensor Tomography Using Integrated Photoelasticity}}}, year = {{1995}}, } @inproceedings{21786, author = {{Kienegger-Domik, Gitta}}, booktitle = {{Proceedings of ED-MEDIA `95}}, editor = {{Maurer, H.}}, pages = {{17--22}}, publisher = {{AACE}}, title = {{{Intelligent visualization systems in educational environments}}}, year = {{1995}}, } @inproceedings{2187, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{ESA}}, pages = {{341----354}}, title = {{{Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks}}}, doi = {{10.1007/3-540-60313-1_154}}, year = {{1995}}, } @inproceedings{2207, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{SPAA}}, pages = {{137----146}}, title = {{{Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}}}, year = {{1995}}, } @inproceedings{2208, author = {{Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}}, booktitle = {{STACS}}, pages = {{267----278}}, title = {{{Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}}}, year = {{1995}}, } @inproceedings{7831, abstract = {{We present a combination of recent extensions to single-pushout graph transformations, as there are attribution, application conditions and amalgamated graph transformations and add a simple transaction concept on top of this formalism. Thereby, we provide the formal basis for several examples, where these concepts are used in combination.}}, author = {{Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}}, booktitle = {{Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}}, number = {{B-19}}, publisher = {{Universitat de les Illes Balears}}, title = {{{Attributed Graph Transformations with Controlled Application of Rules}}}, year = {{1995}}, } @inproceedings{7832, author = {{Thoben, Wilfried and Appelrath, Hans-Jürgen and Sauer, Stefan}}, booktitle = {{Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany)}}, pages = {{412--419}}, publisher = {{Springer}}, title = {{{Record Linkage of Anonymous Data by Control Numbers}}}, year = {{1995}}, } @inproceedings{7833, abstract = {{Single pushout graph transformations at injective matches are extended by negative application conditions. It is shown, how right-sided application conditions can be transformed into equivalent left-sided ones. Based on this result, conditional derived rules are introduced and a theorem, similiar to the double pushout embedding theorem is shown. Finally, three variants of contextual application conditions are discussed with respect to their expressive power and expected results.}}, author = {{Heckel, Reiko}}, booktitle = {{Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}}, number = {{B-19}}, publisher = {{Universitat de les Illes Balears}}, title = {{{Embedding of Conditional Graph Transformations}}}, year = {{1995}}, } @inbook{7976, author = {{Kremer, H.-Hugo}}, booktitle = {{Meisterprüfung - Lernen für die Praxis, Ausbilden im Handwerk. Dozentenhandbuch für Teil IV der Meisterausbildung.}}, editor = {{Braukmann, U. and Euler, D. and Kremer, H.-H. and Theis, M.}}, pages = {{1--123}}, title = {{{Planung und Durchführung der Ausbildung}}}, year = {{1995}}, } @inbook{8076, author = {{Euler, D. and Kremer, H.-Hugo and Theis, M.}}, booktitle = {{Meisterprüfung - Lernen für die Praxis, Ausbilden im Handwerk. Dozentenhandbuch für Teil IV der Meisterausbildung.}}, editor = {{Braukmann, U. and Euler, D. and Kremer, H.-H. and Theis, M}}, pages = {{1--23}}, title = {{{Grundfragen der Berufsbildung}}}, year = {{1995}}, } @inbook{8077, author = {{Euler, D. and Kremer, H.-Hugo and Theis, M.}}, booktitle = {{Meisterprüfung - Lernen für die Praxis, Ausbilden im Handwerk}}, editor = {{Euler, D. and Kremer, H.-Hugo and Theis, M.}}, pages = {{13--42}}, title = {{{Grundfragen der Berufsbildung}}}, year = {{1995}}, } @inbook{8078, author = {{Kremer, H.-Hugo}}, booktitle = {{Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1}}, editor = {{Braukmann, U. and Diettrich, A. and Kremer, H.-H. and Sloane, P.F.E. and Stickling, E.}}, pages = {{19--94}}, title = {{{Existenzgründung}}}, year = {{1995}}, } @inproceedings{8097, author = {{Krauter, Stefan}}, booktitle = {{Proceedings of the ISES Solar World Congress 1995, Harare (Simbabwe), 11.–15. September 1995.}}, title = {{{Solar Electricity up to 30% less expensive by optical and thermal enhanced PV modules}}}, year = {{1995}}, } @inproceedings{8098, author = {{Onneken, K. and Krauter, Stefan}}, booktitle = {{Proceedings of the 1995 ISES Solar World Congress, Harare (Simbabwe), 11.–15. September 1995}}, title = {{{STOPV: A Development Tool for Thermal and Optical Optimization of PV Module Encapsulations}}}, year = {{1995}}, } @inproceedings{8099, author = {{Krauter, Stefan}}, booktitle = {{Proceedings of the ISES Solar World Congress 1995, Harare (Simbabwe), 11.–15. September 1995}}, title = {{{Actual Optical and Thermal Performance of PV-Modules}}}, year = {{1995}}, } @inproceedings{8100, author = {{Krauter, Stefan}}, booktitle = {{Proceedings of the 13th European Photovoltaic Solar Energy Conference, Nizza (Frankreich), 23.–27. Oktober 1995, S. 2306–2309.}}, title = {{{Thermal and Optical Enhanced PV-Modules}}}, year = {{1995}}, } @techreport{8194, author = {{Conrad, Mirko and Gajewsky, Magdalena and Holl-Biniasz, Rainer and Rudolf, Michael and Demuth, Jochen and Weber, Stephan and Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}}, title = {{{Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem}}}, year = {{1995}}, } @techreport{8195, abstract = {{Several object-oriented modeling approaches propose to describe the dynamic behaviour of objects by state transition diagrams. None of them provides precise rules or conditions for the interrelation between the behaviour description of classes and those of their subclasses. In this paper, we discuss this interrelation in detail. It turns out that one has to distinguish between the observable and the invocable behaviour of objects and that different compatibility requirements between the diagrams exist depending on the type of behaviour.}}, author = {{Ebert, Jürgen and Engels, Gregor}}, publisher = {{University of Koblenz-Landau}}, title = {{{Specialization of Object Life Cycle Definitions}}}, year = {{1995}}, } @techreport{8196, author = {{Engels, Gregor and Schürr, Andy}}, publisher = {{Vakgroep Informatica, Rijksuniversiteit Leiden}}, title = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}}, year = {{1995}}, } @inproceedings{8266, author = {{Groenewegen, Luuk and Engels, Gregor}}, booktitle = {{Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)}}, pages = {{189--192}}, publisher = {{Springer}}, title = {{{Coordination by Behavioural Views and Communication Patterns}}}, doi = {{http://dx.doi.org/10.1007/3-540-59205-9_56}}, volume = {{913}}, year = {{1995}}, } @inproceedings{8267, abstract = {{Based on a categorical semantics that has been developed for typed graph grammars we uses colimits (pushouts) to model composition and (reverse) graph grammar morphisms to describe refinements of typed graph grammars. Composition of graph grammars w.r.t. common subgrammars is shown to be compatible with the semantics, i.e. the semantics of the composed grammar is obtained as the composition of the semantics of the component grammars. Moreover, the structure of a composed grammar is preserved during a refinement step in the sense that compatible refinements of the components induce a refinement of the composition. The concepts and results are illustrated by an example.}}, author = {{Corradini, Andrea and Heckel, Reiko}}, booktitle = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}}, pages = {{46--55}}, publisher = {{Elsevier}}, title = {{{A Compositional Approach to Structuring and Refinement of Typed Graph Grammars}}}, volume = {{2}}, year = {{1995}}, } @inproceedings{8268, abstract = {{The overall aim of this paper is a proposal how to bridge the gap between formal specification techniques developed in research projects and semi--formal or informal specifications used in industrial practice. The main idea to overcome these problems is to develop graphical support for formal methods in order to increase acceptance by practitioners and to provide means for integration of formal and semi--formal methods. More specifically suitable concepts will be developed to combine algebraic specifications, Petri Nets, and Graph Grammars with each other and with distinguished graphical components to be used by industrial partners.}}, author = {{Bardohl, Bernhard and Bardohl, Roswitha and Castro, Paulo and Ehrig, Hartmut and Heckel, Reiko and Ribeiro, Leila and Nunes, Daltro and Martini, Alfio}}, booktitle = {{Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)}}, publisher = {{Forschungszentrum Jülich GmbH}}, title = {{{GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development}}}, volume = {{26}}, year = {{1995}}, } @inproceedings{8269, abstract = {{Currently existing graph grammar-based specification languages have serious problems with supporting any kind of “specification-in-the-large” activities. More precisely, they have deficiencies with respect to modeling hierarchical data structures or specifying meta activities like manipulation of graph schemata. Furthermore, already proposed graph grammar module concepts are still too abstract to be useful in practice. Our contribution addresses these problems by introducing a new hierarchical graph data model with an infinite number of schema, meta-schema, etc. layers. It forms the base for a forthcoming concrete modular graph grammar specification language where in addition information hiding aspects like explicit export and import interfaces are expressible.}}, author = {{Engels, Gregor and Schürr, Andy}}, booktitle = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}}, pages = {{101--109}}, publisher = {{Elsevier}}, title = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}}, doi = {{http://dx.doi.org/10.1016/S1571-0661(05)80186-0}}, year = {{1995}}, } @inproceedings{8270, author = {{Heckel, Reiko and Wagner, Annika}}, booktitle = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}}, pages = {{118--126}}, publisher = {{Elsevier}}, title = {{{Ensuring Consistency of Conditional Graph Grammars - A constructive Approach}}}, doi = {{http://dx.doi.org/10.1016/S1571-0661(05)80188-4}}, volume = {{2}}, year = {{1995}}, } @inbook{8354, author = {{Kremer, H.-Hugo}}, booktitle = {{Meisterprüfung - Lernen für die Praxis - Unternehmensführung 1}}, editor = {{Braukmann, U. and Diettrich, A. and Kremer, H.-H. and Sloane, P.F.E. and Stickling, E.}}, pages = {{19--94}}, title = {{{Existenzgründung}}}, year = {{1995}}, } @article{16510, abstract = {{ In an array of coupled oscillators, synchronous chaos may occur in the sense that all the oscillators behave identically although the corresponding motion is chaotic. When a parameter is varied this fully symmetric dynamical state can lose its stability, and the main purpose of this paper is to investigate which type of dynamical behavior is expected to be observed once the loss of stability has occurred. The essential tool is a classification of Lyapunov exponents based on the symmetry of the underlying problem. This classification is crucial in the derivation of the analytical results but it also allows an efficient computation of the dominant Lyapunov exponent associated with each symmetry type. We show how these dominant exponents determine the stability of invariant sets possessing various instantaneous symmetries, and this leads to the idea of symmetry breaking bifurcations of chaotic attractors. Finally, the results and ideas are illustrated for several systems of coupled oscillators. }}, author = {{Aston, Philip J. and Dellnitz, Michael}}, issn = {{0218-1274}}, journal = {{International Journal of Bifurcation and Chaos}}, pages = {{1643--1676}}, title = {{{Symmetry Breaking Bifurcations of Chaotic Attractors}}}, doi = {{10.1142/s021812749500123x}}, year = {{1995}}, } @article{16532, author = {{Dellnitz, M and Heinrich, C}}, issn = {{0951-7715}}, journal = {{Nonlinearity}}, pages = {{1039--1066}}, title = {{{Admissible symmetry increasing bifurcations}}}, doi = {{10.1088/0951-7715/8/6/009}}, year = {{1995}}, } @article{16542, author = {{Dellnitz, M and Melbourne, I}}, issn = {{0951-7715}}, journal = {{Nonlinearity}}, pages = {{1067--1075}}, title = {{{A note on the shadowing lemma and symmetric periodic points}}}, doi = {{10.1088/0951-7715/8/6/010}}, year = {{1995}}, } @article{16550, author = {{Dellnitz, Michael and Field, Michael and Golubitsky, Martin and Ma, Jun and Hohmann, Andreas}}, issn = {{0218-1274}}, journal = {{International Journal of Bifurcation and Chaos}}, pages = {{1243--1247}}, title = {{{Cycling Chaos}}}, doi = {{10.1142/s0218127495000909}}, year = {{1995}}, } @article{16551, abstract = {{ Spiral patterns have been observed experimentally, numerically, and theoretically in a variety of systems. It is often believed that these spiral wave patterns can occur only in systems of reaction–diffusion equations. We show, both theoretically (using Hopf bifurcation techniques) and numerically (using both direct simulation and continuation of rotating waves) that spiral wave patterns can appear in a single reaction–diffusion equation [ in u(x, t)] on a disk, if one assumes "spiral" boundary conditions (ur = muθ). Spiral boundary conditions are motivated by assuming that a solution is infinitesimally an Archimedian spiral near the boundary. It follows from a bifurcation analysis that for this form of spirals there are no singularities in the spiral pattern (technically there is no spiral tip) and that at bifurcation there is a steep gradient between the "red" and "blue" arms of the spiral. }}, author = {{Dellnitz, Michael and Golubitsky, Martin and Hohmann, Andreas and Stewart, Ian}}, issn = {{0218-1274}}, journal = {{International Journal of Bifurcation and Chaos}}, pages = {{1487--1501}}, title = {{{Spirals in Scalar Reaction–Diffusion Equations}}}, doi = {{10.1142/s0218127495001149}}, year = {{1995}}, } @article{16566, author = {{Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}}, issn = {{0020-0190}}, journal = {{Information Processing Letters}}, pages = {{103--110}}, title = {{{Transforming comparison model lower bounds to the parallel-random-access-machine}}}, doi = {{10.1016/s0020-0190(97)00032-x}}, year = {{1995}}, } @inbook{16611, author = {{Golubitsky, Martin and Marsden, Jerrold and Stewart, Ian and Dellnitz, Michael}}, booktitle = {{Normal Forms and Homoclinic Chaos}}, isbn = {{9780821803264}}, title = {{{The constrained Liapunov-Schmidt procedure and periodic orbits}}}, doi = {{10.1090/fic/004/05}}, year = {{1995}}, } @inbook{16704, author = {{Meyer auf der Heide, Friedhelm and Vöcking, Berthold}}, booktitle = {{STACS 95}}, isbn = {{9783540590422}}, issn = {{0302-9743}}, title = {{{A packet routing protocol for arbitrary networks}}}, doi = {{10.1007/3-540-59042-0_81}}, year = {{1995}}, } @inbook{16705, author = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540603139}}, issn = {{0302-9743}}, title = {{{Shared memory simulations with triple-logarithmic delay}}}, doi = {{10.1007/3-540-60313-1_133}}, year = {{1995}}, } @inproceedings{16706, author = {{Meyer auf der Heide, Friedhelm and Storch, Martin and Wanka, Rolf}}, booktitle = {{Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95}}, isbn = {{0897917170}}, title = {{{Optimal trade-offs between size and slowdown for universal parallel networks}}}, doi = {{10.1145/215399.215430}}, year = {{1995}}, } @inproceedings{16707, author = {{Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}}, booktitle = {{Proceedings Third Israel Symposium on the Theory of Computing and Systems}}, isbn = {{0818669152}}, title = {{{Improved optimal shared memory simulations, and the power of reconfiguration}}}, doi = {{10.1109/istcs.1995.377051}}, year = {{1995}}, } @inbook{16717, author = {{Meyer auf der Heide, Friedhelm and Westermann, Matthias}}, booktitle = {{Graph-Theoretic Concepts in Computer Science}}, isbn = {{9783540606185}}, issn = {{0302-9743}}, title = {{{Hot-potato routing on multi-dimensional tori}}}, doi = {{10.1007/3-540-60618-1_77}}, year = {{1995}}, } @inbook{16874, author = {{Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540603139}}, issn = {{0302-9743}}, title = {{{Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}}}, doi = {{10.1007/3-540-60313-1_131}}, year = {{1995}}, } @article{10610, author = {{Platzner, Marco and Rinner, Bernhard and Weiss, Reinhold}}, journal = {{J.UCS Journal of Universal Computer Science}}, pages = {{811--820}}, publisher = {{Springer}}, title = {{{Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation}}}, volume = {{12}}, year = {{1995}}, } @inproceedings{11757, abstract = {{Clustering techniques have been integrated at different levels into the training procedure of a continuous-density hidden Markov model (HMM) speech recognizer. These clustering techniques can be used in two ways. First acoustically similar states are tied together. It will help to reduce the number of parameters but also allow to train otherwise rarely seen states together with more robust ones (state-tying). Secondly densities are clustered across states, this reduces the number of densities while at the same time keeping the best performances of our recognizer (density-clustering). We have applied these techniques both to word-based small-vocabulary and phoneme-based large-vocabulary recognition tasks. On the WSJ task, we could achieve a reduction of the word error rate by 7%. On the TI/NIST-connected digit task, the number of parameters was reduced by a factor 2-3 while keeping the same string error rate.}}, author = {{Dugast, Christian and Beyerlein, Peter and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP, Detroit}}, title = {{{Application of Clustering Techniques to Mixture Density Modelling for Continuous-Speech Recognition}}}, year = {{1995}}, } @article{11764, abstract = {{Today speech recognition of a small vocabulary can be realized so cost-effectively that the technology can penetrate into consumer electronics. But, as first applications that failed on the market show, it is by no means obvious how to incorporate voice control in a user interface. This paper addresses the issue of how to design a voice control so that the user perceives it as a benefit. User interface guidelines that are adapted or specific to voice control are presented. Then the process of designing a voice control in the user-centred approach is described. By means of two examples, the car stereo and telephone answering machine, it is shown how this is turned into practice.}}, author = {{Gamm, Stephan and Haeb-Umbach, Reinhold}}, journal = {{Philips Journal of Research}}, title = {{{User interface design of voice controlled consumer electronics}}}, year = {{1995}}, } @inproceedings{11765, author = {{Gamm, Stephan and Haeb-Umbach, Reinhold}}, booktitle = {{Eurospeech, Madrid}}, title = {{{Human Factors of a Voice-Controlled Car Stereo}}}, year = {{1995}}, } @inproceedings{11768, author = {{Gamm, Stephan and Haeb-Umbach, Reinhold and Langmann, Det}}, booktitle = {{International Symposium on Human Factors in Telecommunications, Melbourne}}, title = {{{The Usability Engineering of a Voice-Controlled Answering Machine}}}, year = {{1995}}, } @article{11786, abstract = {{Recognition accuracy has been the primary objective of most speech recognition research, and impressive results have been obtained, e.g. less than 0.3% word error rate on a speaker-independent digit recognition task. When it comes to real-world applications, robustness and real-time response might be more important issues. For the first requirement we review some of the work on robustness and discuss one specific technique, spectral normalization, in more detail. The requirement of real-time response has to be considered in the light of the limited hardware resources in voice control applications, which are due to the tight cost constraints. In this paper we discuss in detail one specific means to reduce the processing and memory demands: a clustering technique applied at various levels within the acoustic modelling.}}, author = {{Haeb-Umbach, Reinhold and Beyerlein, Peter and Geller, Dieter}}, journal = {{Philips Journal of Research}}, title = {{{Speech recognition algorithms for voice control interfaces}}}, year = {{1995}}, } @inproceedings{11787, abstract = {{We address the problem of automatically finding an acoustic representation (i.e. a transcription) of unknown words as a sequence of subword units, given a few sample utterances of the unknown words, and an inventory of speaker-independent subword units. The problem arises if a user wants to add his own vocabulary to a speaker-independent recognition system simply by speaking the words a few times. Two methods are investigated which are both based on a maximum-likelihood formulation of the problem. The experimental results show that both automatic transcription methods provide a good estimate of the acoustic models of unknown words. The recognition error rates obtained with such models in a speaker-independent recognition task are clearly better than those resulting from separate whole-word models. They are comparable with the performance of transcriptions drawn from a dictionary.}}, author = {{Haeb-Umbach, Reinhold and Beyerlein, P. and Thelen, E.}}, booktitle = {{ICASSP, Detroit}}, title = {{{Automatic Transcription of Unknown Words in a Speech Recognition System}}}, year = {{1995}}, } @article{11905, abstract = {{This paper gives an overview of the Philips Research system for continuous-speech recognition. The recognition architecture is based on an integrated statistical approach. The system has been successfully applied to various tasks in American English and German, ranging from small vocabulary tasks to very large vocabulary tasks and from recognition only to speech understanding. Here, we concentrate on phoneme-based continuous-speech recognition for large vocabulary recognition as used for dictation, which covers a significant part of our research work on speech recognition. We describe this task and report on experimental results. In order to allow a comparison with the performance of other systems, a section with an evaluation on the standard North American Business news (NAB2) task (dictation of American English newspaper text) is supplied.}}, author = {{Steinbiss, Volker and Ney, Hermann J. and Aubert, Xavier L. and Besling, Stefan and Dugast, Christian and Essen, Ute and Geller, Dieter and Haeb-Umbach, Reinhold and Kneser, Reinhard and Meier, Hans Günter and Oerder, Martin and Tran, Bach Hiep}}, journal = {{Philips Journal of Research}}, title = {{{The Philips Research system for continuous-speech dictation}}}, year = {{1995}}, } @article{11948, abstract = {{This paper gives an overview of the Philips research system for phoneme-based, large-vocabulary, continuousspeech recognition. The system has been successfully applied to various tasks in the German and (American) English languages, ranging from small vocabulary tasks to very large vocabulary tasks. Here, we concentrate on continuousspeech recognition for dictation in real applications, the dictation of legal reports and radiology reports in German. We describe this task and report on experimental results. We also describe a commercial PC-based dictation system which includes a PC implementation of our scientific recognition prototype. In order to allow for a comparison with the performance of other systems, a section with an evaluation on the standard Wall Street Journal task (dictation of American English newspaper text) is supplied. The recognition architecture is based on an integrated statistical approach. We describe the characteristic features of the system as opposed to other systems: 1. the Viterbi criterion is consistently applied both in training and testing; 2. continuous mixture densities are used without tying or smoothing; 3. time-synchronous beam search in connection with a phoneme look-ahead is applied to a tree-organized lexicon.}}, author = {{Steinbiss, Volker and Ney, Hermann J. and Essen, Ute and Tran, Bach Hiep and Aubert, Xavier L. and Dugast, Christian and Kneser, Reinhard and Meier, Hans Günter and Oerder, Martin and Haeb-Umbach, Reinhold and Geller, Dieter and Hoellerbauer, W. and Bartosik, H.}}, journal = {{Speech Communication}}, title = {{{Continuous speech dictation - From theory to practice}}}, year = {{1995}}, } @techreport{13026, author = {{Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, title = {{{Synthesis Procedures for Self-Testable Controllers}}}, year = {{1995}}, } @techreport{13027, author = {{Hellebrand, Sybille and Wunderlich, Hans-Joachim and Goncalves, F. and Paulo Teixeira, Joao}}, title = {{{Evaluation of Self-Testable Controller Architectures Based on Realistic Fault Analysis}}}, year = {{1995}}, }