TY - CONF
AB - 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.
AU - Heckel, Reiko
ID - 7833
IS - B-19
T2 - Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science
TI - Embedding of Conditional Graph Transformations
ER -
TY - CHAP
AU - Euler, D.
AU - Kremer, H.-Hugo
AU - Theis, M.
ED - Braukmann, U.
ED - Euler, D.
ED - Kremer, H.-H.
ED - Theis, M
ID - 8076
T2 - Meisterprüfung - Lernen für die Praxis, Ausbilden im Handwerk. Dozentenhandbuch für Teil IV der Meisterausbildung.
TI - Grundfragen der Berufsbildung
ER -
TY - GEN
AU - Engels, Gregor
AU - Schürr, Andy
ID - 8196
TI - Encapsulated Hierarchical Graphs, Graph Types, and Meta Types
ER -
TY - CONF
AU - Groenewegen, Luuk
AU - Engels, Gregor
ID - 8266
T2 - Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)
TI - Coordination by Behavioural Views and Communication Patterns
VL - 913
ER -
TY - CHAP
AU - Golubitsky, Martin
AU - Marsden, Jerrold
AU - Stewart, Ian
AU - Dellnitz, Michael
ID - 16611
SN - 9780821803264
T2 - Normal Forms and Homoclinic Chaos
TI - The constrained Liapunov-Schmidt procedure and periodic orbits
ER -
TY - JOUR
AB - 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.
AU - Aston, Philip J.
AU - Dellnitz, Michael
ID - 16510
JF - International Journal of Bifurcation and Chaos
SN - 0218-1274
TI - Symmetry Breaking Bifurcations of Chaotic Attractors
ER -
TY - CONF
AU - Gamm, Stephan
AU - Haeb-Umbach, Reinhold
AU - Langmann, Det
ID - 11768
T2 - International Symposium on Human Factors in Telecommunications, Melbourne
TI - The Usability Engineering of a Voice-Controlled Answering Machine
ER -
TY - CONF
AB - 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.
AU - Haeb-Umbach, Reinhold
AU - Beyerlein, P.
AU - Thelen, E.
ID - 11787
T2 - ICASSP, Detroit
TI - Automatic Transcription of Unknown Words in a Speech Recognition System
ER -
TY - CONF
AU - Hellebrand, Sybille
AU - Reeb, Birgit
AU - Tarnick, Steffen
AU - Wunderlich, Hans-Joachim
ID - 13012
T2 - {ACM/IEEE International Conference on Computer Aided Design (ICCAD'95)}
TI - Pattern Generation for a Deterministic BIST Scheme
ER -
TY - GEN
AU - Hellebrand, Sybille
AU - Reeb, Birgit
AU - Tarnick, Steffen
AU - Wunderlich, Hans-Joachim
ID - 13086
KW - WORKSHOP
TI - Pattern Generation for a Deterministic BIST Scheme
ER -
TY - CONF
AU - Platzner, Marco
AU - Rinner, Bernhard
ID - 13473
T2 - Proceedings of the PDCS International Conference on Parallel and Distributed Computing Systems
TI - Improving Performance of the Qualitative Simulator QSIM - Design and Implementation of a Specialized Computer Architecture
ER -
TY - CONF
AU - Domik-Kienegger, Gitta
AU - Owen, GS
ID - 15272
T2 - Proceedings of the Third Eurographics Workshop on Graphics and Visualization
TI - Education for Visualization-Activities of the acm-siggraph Education Committee
ER -
TY - BOOK
AU - Krimphove, Dieter
ID - 1603
TI - Rechtliche Rahmenbedingungen des deutschen und internationalen Börsentermingeschäftes Ein Leitfaden für Banken, Sparkassen, Kreditinstitute, Anlagevermittler und Kunden mit Checklisten und Hinweisen zur Durchführung einer ordnungsgemäßen Anlageberatung
VL - Nr. 14
ER -
TY - CONF
AU - Meyer auf der Heide, Friedhelm
AU - Storch, Martin
AU - Wanka, Rolf
ID - 16706
SN - 0897917170
T2 - Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95
TI - Optimal trade-offs between size and slowdown for universal parallel networks
ER -
TY - CONF
AU - Röttger, Markus
AU - Schroeder, Ulf-Peter
AU - Simon, Jens
ID - 2447
T2 - Proc. Int. Conf. on High-Performance Computing and Networking
TI - Implementation of a Parallel and Distributed Mapping Kernel for PARIX
VL - 919
ER -
TY - CONF
AU - Meyer auf der Heide, Friedhelm
AU - Scheideler, Christian
ID - 2187
T2 - ESA
TI - Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
ER -
TY - CONF
AU - Meyer auf der Heide, Friedhelm
AU - Scheideler, Christian
ID - 2207
T2 - SPAA
TI - Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
ER -
TY - BOOK
AU - Betz, Stefan
ID - 2675
TI - Erfolgscontrolling unter besonderer Berücksichtigung produktionswirtschaftlicher Aspekte
ER -
TY - CHAP
AU - Euler, D.
AU - Kremer, H.-Hugo
AU - Theis, M.
ED - Euler, D.
ED - Kremer, H.-Hugo
ED - Theis, M.
ID - 8077
T2 - Meisterprüfung - Lernen für die Praxis, Ausbilden im Handwerk
TI - Grundfragen der Berufsbildung
ER -
TY - CONF
AB - 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.
AU - Corradini, Andrea
AU - Heckel, Reiko
ID - 8267
T2 - Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)
TI - A Compositional Approach to Structuring and Refinement of Typed Graph Grammars
VL - 2
ER -
TY - JOUR
AU - Dellnitz, M
AU - Melbourne, I
ID - 16542
JF - Nonlinearity
SN - 0951-7715
TI - A note on the shadowing lemma and symmetric periodic points
ER -