TY - JOUR AU - Trächtler, Ansgar AU - Wernsdörfer, Andreas ID - 23361 JF - Frontiers in Industrial Process Tomography, Engineering Foundation TI - Direct Algebraic Reconstruction in Electromagnetic Flow Tomography ER - TY - JOUR AU - Trächtler, Ansgar ID - 23362 JF - Frontiers in Industrial Process Tomography, Engineering Foundation TI - Stress Tensor Tomography Using Integrated Photoelasticity ER - TY - CONF AU - Kienegger-Domik, Gitta ED - Maurer, H. ID - 21786 T2 - Proceedings of ED-MEDIA `95 TI - Intelligent visualization systems in educational environments 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 - CONF AU - Meyer auf der Heide, Friedhelm AU - Scheideler, Christian AU - Stemann, Volker ID - 2208 T2 - STACS TI - Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations ER - TY - CONF AB - 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. AU - Heckel, Reiko AU - Müller, Jürgen AU - Taentzer, Gabriele AU - Wagner, Annika ID - 7831 IS - B-19 T2 - Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science TI - Attributed Graph Transformations with Controlled Application of Rules ER - TY - CONF AU - Thoben, Wilfried AU - Appelrath, Hans-Jürgen AU - Sauer, Stefan ID - 7832 T2 - Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany) TI - Record Linkage of Anonymous Data by Control Numbers ER - 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 - Kremer, H.-Hugo ED - Braukmann, U. ED - Euler, D. ED - Kremer, H.-H. ED - Theis, M. ID - 7976 T2 - Meisterprüfung - Lernen für die Praxis, Ausbilden im Handwerk. Dozentenhandbuch für Teil IV der Meisterausbildung. TI - Planung und Durchführung der Ausbildung ER -