@book{OPUS4-3141,
  title     = {Java language conversion assistant : an analysis},
  editor    = {Richter, Stefan and Henze, Stefan and B{\"u}ttner, Eiko and Bach, Steffen and Polze, Andreas},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-10-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33151},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {166},
  year      = {2004},
  abstract  = {This document is an analysis of the 'Java Language Conversion Assistant'. Itr will also cover a language analysis of the Java Programming Language as well as a survey of related work concerning Java and C\# interoperability on the one hand and language conversion in general on the other. Part I deals with language analysis. Part II covers the JLCA tool and tests used to analyse the tool. Additionally, it gives an overview of the above mentioned related work. Part III presents a complete project that has been translated using the JLCA.},
  language  = {en}
}
@book{OPUS4-3143,
  title     = {Conceptual architecture patterns : FMC-based representations},
  editor    = {Gr{\"o}ne, Bernhard and Keller, Frank},
  isbn      = {978-3-935024-98-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33173},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2004},
  abstract  = {This document presents the results of the seminar "Coneptual Arachitecture Patterns" of the winter term 2002 in the Hasso-Plattner-Institute. It is a compilation of the student's elaborations dealing with some conceptual architecture patterns which can be found in literature. One important focus laid on the runtime structures and the presentation of the patterns. 1. Introduction 1.1. The Seminar 1.2. Literature 2 Pipes and Filters (Andr{\´e} Langhorst and Martin Steinle) 3 Broker (Konrad H{\"u}bner and Einar L{\"u}ck) 4 Microkernel (Eiko B{\"u}ttner and Stefan Richter) 5 Component Configurator (Stefan R{\"o}ck and Alexander Gierak) 6 Interceptor (Marc F{\"o}rster and Peter Aschenbrenner) 7 Reactor (Nikolai Cieslak and Dennis Eder) 8 Half-Sync/Half-Async (Robert Mitschke and Harald Schubert) 9 Leader/Followers (Dennis Klemann and Steffen Schmidt)},
  language  = {en}
}
@book{GroeneKnoepfelKugeletal.2004,
  author    = {Gr{\"o}ne, Bernhard and Kn{\"o}pfel, Andreas and Kugel, Rudolf and Schmidt, Oliver},
  title     = {The Apache Modeling Project},
  isbn      = {978-3-937786-14-8},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33147},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2004},
  abstract  = {This document presents an introduction to the Apache HTTP Server, covering both an overview and implementation details. It presents results of the Apache Modelling Project done by research assistants and students of the Hasso-Plattner-Institute in 2001, 2002 and 2003. The Apache HTTP Server was used to introduce students to the application of the modeling technique FMC, a method that supports transporting knowledge about complex systems in the domain of information processing (software and hardware as well). After an introduction to HTTP servers in general, we will focus on protocols and web technology. Then we will discuss Apache, its operational environment and its extension capabilities— the module API. Finally we will guide the reader through parts of the Apache source code and explain the most important pieces.},
  language  = {en}
}
@book{Wendt2004,
  author    = {Wendt, Siegfried},
  title     = {Auf dem Weg zu einem Softwareingenieurwesen},
  isbn      = {978-3-937786-37-7},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33184},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2004},
  abstract  = {(1) {\"U}ber die Notwendigkeit, die bisherige Informatik in eine Grundlagenwissenschaft und eine Ingenieurwissenschaft aufzuspalten (2) Was ist Ingenieurskultur? (3) Das Kommunikationsproblem der Informatiker und ihre Unf{\"a}higkeit, es wahrzunehmen (4) Besonderheiten des Softwareingenieurwesens im Vergleich mit den klassischen Ingenieurdisziplinen (5) Softwareingenieurspl{\"a}ne k{\"o}nnen auch f{\"u}r Nichtfachleute verst{\"a}ndlich sein (6) Principles for Planning Curricula in Software Engineering},
  language  = {de}
}
@book{KuropkaMeyer2005,
  author    = {Kuropka, Dominik and Meyer, Harald},
  title     = {Survey on Service Composition},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {3-937786-78-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33787},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {35},
  year      = {2005},
  abstract  = {It is predicted that Service-oriented Architectures (SOA) will have a high impact on future electronic business and markets. Services will provide an self-contained and standardised interface towards business and are considered as the future platform for business-to-business and business-toconsumer trades. Founded by the complexity of real world business scenarios a huge need for an easy, flexible and automated creation and enactment of service compositions is observed. This survey explores the relationship of service composition with workflow management—a technology/ concept already in use in many business environments. The similarities between the both and the key differences between them are elaborated. Furthermore methods for composition of services ranging from manual, semi- to full-automated composition are sketched. This survey concludes that current tools for service composition are in an immature state and that there is still much research to do before service composition can be used easily and conveniently in real world scenarios. However, since automated service composition is a key enabler for the full potential of Service-oriented Architectures, further research on this field is imperative. This survey closes with a formal sample scenario presented in appendix A to give the reader an impression on how full-automated service composition works.},
  language  = {en}
}
@book{DoellnerKirschNienhaus2005,
  author    = {D{\"o}llner, J{\"u}rgen Roland Friedrich and Kirsch, Florian and Nienhaus, Marc},
  title     = {Visualizing Design and Spatial Assembly of Interactive CSG},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-56-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33771},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {8},
  year      = {2005},
  abstract  = {For interactive construction of CSG models understanding the layout of a model is essential for its efficient manipulation. To understand position and orientation of aggregated components of a CSG model, we need to realize its visible and occluded parts as a whole. Hence, transparency and enhanced outlines are key techniques to assist comprehension. We present a novel real-time rendering technique for visualizing design and spatial assembly of CSG models. As enabling technology we combine an image-space CSG rendering algorithm with blueprint rendering. Blueprint rendering applies depth peeling for extracting layers of ordered depth from polygonal models and then composes them in sorted order facilitating a clear insight of the models. We develop a solution for implementing depth peeling for CSG models considering their depth complexity. Capturing surface colors of each layer and later combining the results allows for generating order-independent transparency as one major rendering technique for CSG models. We further define visually important edges for CSG models and integrate an image-space edgeenhancement technique for detecting them in each layer. In this way, we extract visually important edges that are directly and not directly visible to outline a model's layout. Combining edges with transparency rendering, finally, generates edge-enhanced depictions of image-based CSG models and allows us to realize their complex, spatial assembly.},
  language  = {en}
}
@book{OPUS4-3139,
  title     = {Konzepte der Softwarevisualisierung f{\"u}r komplexe, objektorientierte Softwaresysteme},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-54-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33136},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {99},
  year      = {2005},
  abstract  = {1. Grundlagen der Softwarevisualisierung Johannes Bohnet und J{\"u}rgen D{\"o}llner 2. Visualisierung und Exploration von Softwaresystemen mit dem Werkzeug SHriMP/Creole Alexander Gierak 3. Annex: SHriMP/Creole in der Anwendung Nebojsa Lazic 4. Metrikbasierte Softwarevisualisierung mit dem Reverse-Engineering-Werkzeug CodeCrawler Daniel Brinkmann 5. Annex: CodeCrawler in der Anwendung Benjamin Hagedorn 6. Quellcodezeilenbasierte Softwarevisualisierung Nebojsa Lazic 7. Landschafts- und Stadtmetaphern zur Softwarevisualisierung Benjamin Hagedorn 8. Visualisierung von Softwareevolution Michael Sch{\"o}bel 9. Ergebnisse und Ausblick Johannes Bohnet Literaturverzeichnis Autorenverzeichnis},
  language  = {de}
}
@book{Lendholt2005,
  author    = {Lendholt, Matthias},
  title     = {Ressourcenpartitionierung f{\"u}r Grid-Systeme},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-72-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33121},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {97},
  year      = {2005},
  abstract  = {1 Einleitung 1.1 Motivation 1.2 Aufgabenstellung 1.3 Aufbau der Arbeit 2 Fachliches Umfeld 2.1 Grid Computing 2.2 Idle Time Computing 3 Ressourcenpartitionierung 3.1 Ressourcenpartitionierung und Scheduling 3.2 Ressourcenpartitionierung in Idle Time Computing 3.2.1 Administrative Kontrolle der Ressourcen 3.2.2 Mindestgarantien zur Sicherstellung der Lauff{\"a}higkeit 3.3 Vorhandene L{\"o}sungen und verwandte Arbeiten 3.3.3 Ressourcenmanagement im Globus Toolkit 3.3.4 Ressourcenmanagement in Condor 3.3.5 Das GARA Framework 3.3.6 Distributed Resource Management Application API 3.3.7 Grid Resource Allocation Agreement Protocol 3.3.8 SNAP 3.3.9 OGSI-Agreement 3.3.10 PBS/Maui und andere Batch Systeme 3.3.11 Wide Area Distributed Computing 3.3.12 Weitere verwandte Arbeiten 3.3.13 {\"U}berlegungen zum Ressourcenbedarf 4 Ressourcenkontrolle in Desktopbetriebssystemen 4.1 Ressourcen 4.2 Ressourcenpartitionierung unter Linux 4.2.14 Festplattenkapazit{\"a}t 4.2.15 Arbeitsspeicher 4.2.16 Netzwerkbandbreite 4.2.17 CPU Kapazit{\"a}t 4.3 Ressourcenpartitionierung unter Microsoft Windows XP 4.3.18 Festplattenkapazit{\"a}t 4.3.19 Arbeitsspeicher 4.3.20 Netzwerkbandbreite 4.3.21 CPU Kapazit{\"a}t 4.4 Fazit 5 Entwurf und Design des Frameworks 5.1 Entwurfsgrundlage - Komponentenarchitektur 5.2 Architektur 5.2.22 Broker Server 5.2.23 Broker Software auf den Clients 5.2.24 Schnittstellen 5.3 Komponententypmodell 5.4 Ressourcenidentifikation und Ressourcenzuordnung 5.5 Anbindung ans Grid 5.6 Datenbankentwurf 5.7 XML RPC Schnittstelle 6 Implementierung 6.1 Broker Server 6.1.25 Datenbank 6.1.26 Komponenten 6.1.27 Webserverskripte 6.1.28 Database Crawler 6.2 Komponenten 6.2.29 Network 6.2.30 DSCP 6.2.31 Quota 6.2.32 FSF 6.3 Linux Client 6.3.33 Broker Client 6.3.34 Komponenten 6.4 Windows Client 6.5 Abh{\"a}ngigkeiten 7 Evaluierung 7.1 Durchgef{\"u}hrte Test- und Anwendungsf{\"a}lle 7.1.35 Test der Clientsoftware 7.1.36 Test der Serversoftware 7.1.37 Durchf{\"u}hrbare Anwendungsf{\"a}lle 7.2 Evaluierung der Frameworkimplementierung 7.2.38 Performanz der Serverimplementierung 7.2.39 Zuverl{\"a}ssigkeit der Partitionierungen 7.3 Evaluierung von Traffic Shaping mit iproute2 7.3.40 Szenario 1 7.3.41 Szenario 2 7.3.42 Szenario 3 7.3.43 Fazit 8 Zusammenfassung und Ausblick 8.1 Fazit 8.2 Weiterentwicklung 8.2.44 Weiterentwicklungen auf Entwurfsebene 8.2.45 Weiterentwicklungen auf Implementierungsebene Anhang A: Details zum Datenbankentwurf Anhang B: Bildschirmfotos der Weboberfl{\"a}che Anhang C: Quellcode Linux Broker Client Anhang D: Inhalt des beiliegenden Datentr{\"a}gers},
  language  = {de}
}
@book{Nicolai2005,
  author    = {Nicolai, Johannes},
  title     = {Sichere Ausf{\"u}hrung nicht vertrauensw{\"u}rdiger Programme : Evaluation verschiedener Ans{\"a}tze und Einsatz an vier Fallbeispielen},
  isbn      = {978-3-937786-73-5},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33101},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2005},
  abstract  = {Vorwort 1. Einleitung 2. Statische vs. dynamische Analyse 3. Kriterien f{\"u}r den Erfolg statischer Quellcodeanalysemethoden 3.1. Theoretische Vor{\"u}berlegungen 3.2. 1. Kriterium: Verf{\"u}gbarkeit des Quellcodes 3.3. 2. Kriterium: Unterst{\"u}tzung der Programmiersprache 3.4. 3. Kriterium: Zulassung von „echten" Programmen der Problemdom{\"a}ne 3.5. 4. Kriterium: Bew{\"a}ltigung der auftretenden Komplexit{\"a}t 3.6. 5. Kriterium: Schutz vor b{\"o}swilliger Speichermanipulation 3.7. 6. Kriterium: Garantie f{\"u}r die Umgebung des laufenden Prozesses 3.8. Fazit 3.9. Verwandte Arbeiten 4. Bewertung von statischen Methoden f{\"u}r C/C++ typische Programme 4.1. Hintergrund 4.2. Pr{\"a}missen 4.3. 1. Problemfeld: Programmgr{\"o}ße und Interferenz 4.4. 2. Problemfeld: Semantik 4.5. 3. Problemfeld: Programmfluss 4.6. 4. Problemfeld: Zeigerarithmetik 4.7. Dynamische Konzepte zur Erf{\"u}llung des f{\"u}nften Kriteriums auf Quellcodebasis 4.8. Fazit 4.9. Verwandte Arbeiten 5. Kriterien f{\"u}r den Erfolg dynamischer Ans{\"a}tze 5.1. Hintergrund 5.2. Verf{\"u}gbarkeit des Quellcodes 5.3. Unterst{\"u}tzung der Programmiersprache 5.4. Zulassung von „echten" Programmen aus der Problemdom{\"a}ne 5.5. Bew{\"a}ltigung der auftretenden Komplexit{\"a}t 5.6. Schutz vor b{\"o}swilliger Speichermanipulation 5.7. Garantie f{\"u}r die Umgebung des laufenden Prozesses 5.8. Fazit 6. Klassifikation und Evaluation dynamischer Ans{\"a}tze 6.1. Hintergrund 6.2. Quellcodesubstitution 6.3. Bin{\"a}rcodemodifikation/Binary-Rewriting 6.4. Maschinencodeinterpreter 6.5. Intrusion-Detection-Systeme 6.6. Virtuelle Maschinen/Safe Languages 6.7. Mechanismen zur „H{\"a}rtung" von bestehenden Code 6.8. SandBoxing/System-Call-Interposition 6.9. Herk{\"o}mmliche Betriebssystemmittel 6.10. Access-Control-Lists/Domain-Type-Enforcement 6.11. Fazit 7. Sichere Ausf{\"u}hrung nicht vertrauensw{\"u}rdiger Programme im Kontext von RealTimeBattle 7.1. Vorstellung von RealTimeBattle 7.2. Charakterisierung des Problems 7.3. Alternative L{\"o}sungsvarianten/Rekapitulation 7.4. {\"U}bertragung der Ergebnisse statischer Analysemethoden auf RealTimeBattle 7.5. {\"U}bertragung der Ergebnisse dynamischer Analysemethoden auf RealTimeBattle 7.5.1. Vorstellung der RSBAC basierten L{\"o}sung 7.5.2. Vorstellung der Systrace basierten L{\"o}sung 7.6. Fazit 7.7. Verwandte Arbeiten 8. Sichere Ausf{\"u}hrung nicht vertrauensw{\"u}rdiger Programme im Kontext von Asparagus 8.1. Vorstellung von Asparagus 8.2. Charakterisierung des Problems 8.3. L{\"o}sung des Problems 8.4. Fazit 8.5. Verwandte Arbeiten 9. Sichere Ausf{\"u}hrung nicht vertrauensw{\"u}rdiger Programme im Kontext vom DCL 9.1. Vorstellung des DCL 9.2. Charakterisierung des Problems 9.3. Experimente im DCL und die jeweilige L{\"o}sung 9.3.1. Foucaultsches Pendel 9.3.2. Lego Mindstorm Roboter 9.3.3. Hau den Lukas 9.4. Fazit 9.5. Verwandte Arbeiten 10. Sichere Ausf{\"u}hrung nicht vertrauensw{\"u}rdiger Programme im Kontext der semiautomatischen Korrektur von Betriebssystemarchitektur-{\"U}bungsaufgaben 10.1. Vorstellung des {\"U}bungsbetriebes zur Vorlesung „Betriebssystsemarchitektur 10.2. Charakterisierung des Problems 10.3. L{\"o}sungsvorschl{\"a}ge 10.3.1. L{\"o}sungsvorschl{\"a}ge f{\"u}r das Authentifizierungs-Problem 10.3.2. L{\"o}sungsvorschl{\"a}ge f{\"u}r das Transport-Problem 10.3.3. L{\"o}sungsvorschl{\"a}ge f{\"u}r das Build-Problem 10.3.4. L{\"o}sungsvorschl{\"a}ge f{\"u}r das Ausf{\"u}hrungs-Problem 10.3.5. L{\"o}sungsvorschl{\"a}ge f{\"u}r das Ressourcen-Problem 10.3.6. L{\"o}sungsvorschl{\"a}ge f{\"u}r das Portabilit{\"a}ts-Problem 10.4. Fazit 10.5. Verwandte Arbeiten 11. Schlussbetrachtungen Literaturverzeichnis Anhang -create_guardedrobot.sh: Die RealTimeBattle Security Infrastructure -vuln.c: Ein durch Puffer{\"u}berlauf ausnutzbares Programm -exploit.c: Ein Beispielexploit f{\"u}r vuln.c. -aufg43.c: L{\"o}sung f{\"u}r eine Aufgabe im Rahmen der Betriebssystemarchitektur-{\"U}bung -Handout: Sichere Ausf{\"u}hrung nicht vertrauensw{\"u}rdiger Programme},
  language  = {de}
}
@book{MeyerKuropka2005,
  author    = {Meyer, Harald and Kuropka, Dominik},
  title     = {Requirements for service composition},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-81-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33096},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {27},
  year      = {2005},
  abstract  = {1 Introduction 2 Use case Scenario 3 General Composition Requirements 4 Functional Requirements of Service Composition 5 Non-Functional Requirements 6 Conclusion},
  language  = {en}
}
@book{PolzeSchnor2005,
  author    = {Polze, Andreas and Schnor, Bettina},
  title     = {Grid-Computing : [Seminar im Sommersemester 2003]},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-28-7},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33162},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {1-34 ; 2-36},
  year      = {2005},
  abstract  = {1. Applikationen f{\"u}r weitverteiltes Rechnen Dennis Klemann, Lars Schmidt-Bielicke, Philipp Seuring 2. Das Globus-Toolkit Dietmar Bremser, Alexis Krepp, Tobias Rausch 3. Open Grid Services Architecture Lars Trieloff 4. Condor, Condor-G, Classad Stefan Henze, Kai K{\"o}hne 5. The Cactus Framework Thomas Hille, Martin Karlsch 6. High Performance Scheduler mit Maui/PBS Ole Weidner, J{\"o}rg Schummer, Benedikt Meuthrath 7. Bandbreiten-Monitoring mit NWS Alexander Ritter, Gregor H{\"o}fert 8. The Paradyn Parallel Performance Measurement Tool Jens Ulferts, Christian Liesegang 9. Grid-Applikationen in der Praxis Steffen Bach, Michael Blume, Helge Issel},
  language  = {de}
}
@book{LinckelsMeinel2005,
  author    = {Linckels, Serge and Meinel, Christoph},
  title     = {An e-librarian service : natural language interface for an efficient semantic search within multimedia resources},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-89-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33088},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {40},
  year      = {2005},
  abstract  = {1 Introduction 1.1 Project formulation 1.2 Our contribution 2 Pedagogical Aspect 4 2.1 Modern teaching 2.2 Our Contribution 2.2.1 Autonomous and exploratory learning 2.2.2 Human machine interaction 2.2.3 Short multimedia clips 3 Ontology Aspect 3.1 Ontology driven expert systems 3.2 Our contribution 3.2.1 Ontology language 3.2.2 Concept Taxonomy 3.2.3 Knowledge base annotation 3.2.4 Description Logics 4 Natural language approach 4.1 Natural language processing in computer science 4.2 Our contribution 4.2.1 Explored strategies 4.2.2 Word equivalence 4.2.3 Semantic interpretation 4.2.4 Various problems 5 Information Retrieval Aspect 5.1 Modern information retrieval 5.2 Our contribution 5.2.1 Semantic query generation 5.2.2 Semantic relatedness 6 Implementation 6.1 Prototypes 6.2 Semantic layer architecture 6.3 Development 7 Experiments 7.1 Description of the experiments 7.2 General characteristics of the three sessions, instructions and procedure 7.3 First Session 7.4 Second Session 7.5 Third Session 7.6 Discussion and conclusion 8 Conclusion and future work 8.1 Conclusion 8.2 Open questions A Description Logics B Probabilistic context-free grammars},
  language  = {en}
}
@book{AdamBrehmerHuettenrauchetal.2006,
  author    = {Adam, Christian and Brehmer, Bastian and H{\"u}ttenrauch, Stefan and Jeske, Janin and Polze, Andreas and Rasche, Andreas and Sch{\"u}ler, Benjamin and Schult, Wolfgang},
  title     = {Aspektorientierte Programmierung : {\"U}berblick {\"u}ber Techniken und Werkzeuge},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-939469-23-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33796},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {88},
  year      = {2006},
  abstract  = {Inhaltsverzeichnis 1 Einf{\"u}hrung 2 Aspektorientierte Programmierung 2.1 Ein System als Menge von Eigenschaften 2.2 Aspekte 2.3 Aspektweber 2.4 Vorteile Aspektorientierter Programmierung 2.5 Kategorisierung der Techniken und Werkzeuge f ¨ ur Aspektorientierte Programmierung 3 Techniken und Werkzeuge zur Analyse Aspektorientierter Softwareprogramme 3.1 Virtual Source File 3.2 FEAT 3.3 JQuery 3.4 Aspect Mining Tool 4 Techniken und Werkzeuge zum Entwurf Aspektorientierter Softwareprogramme 4.1 Concern Space Modeling Schema 4.2 Modellierung von Aspekten mit UML 4.3 CoCompose 4.4 Codagen Architect 5 Techniken und Werkzeuge zur Implementierung Aspektorientierter Softwareprogramme 5.1 Statische Aspektweber 5.2 Dynamische Aspektweber 6 Zusammenfassung},
  language  = {de}
}
@book{BreestBoucheGrundetal.2006,
  author    = {Breest, Martin and Bouch{\´e}, Paul and Grund, Martin and Haubrock, S{\"o}ren and H{\"u}ttenrauch, Stefan and Kylau, Uwe and Ploskonos, Anna and Queck, Tobias and Schreiter, Torben},
  title     = {Fundamentals of Service-Oriented Engineering},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-939469-35-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33801},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {Getr. Z{\"a}hlung},
  year      = {2006},
  abstract  = {Since 2002, keywords like service-oriented engineering, service-oriented computing, and service-oriented architecture have been widely used in research, education, and enterprises. These and related terms are often misunderstood or used incorrectly. To correct these misunderstandings, a deeper knowledge of the concepts, the historical backgrounds, and an overview of service-oriented architectures is demanded and given in this paper.},
  language  = {en}
}
@book{NienhausGoochDoellner2006,
  author    = {Nienhaus, Marc and Gooch, Bruce and D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Visualizing movement dynamics in virtual urban environments},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-939469-52-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33065},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {7},
  year      = {2006},
  abstract  = {Dynamics in urban environments encompasses complex processes and phenomena such as related to movement (e.g.,traffic, people) and development (e.g., construction, settlement). This paper presents novel methods for creating human-centric illustrative maps for visualizing the movement dynamics in virtual 3D environments. The methods allow a viewer to gain rapid insight into traffic density and flow. The illustrative maps represent vehicle behavior as light threads. Light threads are a familiar visual metaphor caused by moving light sources producing streaks in a long-exposure photograph. A vehicle's front and rear lights produce light threads that convey its direction of motion as well as its velocity and acceleration. The accumulation of light threads allows a viewer to quickly perceive traffic flow and density. The light-thread technique is a key element to effective visualization systems for analytic reasoning, exploration, and monitoring of geospatial processes.},
  language  = {en}
}
@book{HuCordelMeinel2006,
  author    = {Hu, Ji and Cordel, Dirk and Meinel, Christoph},
  title     = {A virtual machine architecture for creating IT-security laboratories},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-939469-13-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33077},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {50},
  year      = {2006},
  abstract  = {E-learning is a flexible and personalized alternative to traditional education. Nonetheless, existing e-learning systems for IT security education have difficulties in delivering hands-on experience because of the lack of proximity. Laboratory environments and practical exercises are indispensable instruction tools to IT security education, but security education in con-ventional computer laboratories poses the problem of immobility as well as high creation and maintenance costs. Hence, there is a need to effectively transform security laboratories and practical exercises into e-learning forms. This report introduces the Tele-Lab IT-Security architecture that allows students not only to learn IT security principles, but also to gain hands-on security experience by exercises in an online laboratory environment. In this architecture, virtual machines are used to provide safe user work environments instead of real computers. Thus, traditional laboratory environments can be cloned onto the Internet by software, which increases accessibilities to laboratory resources and greatly reduces investment and maintenance costs. Under the Tele-Lab IT-Security framework, a set of technical solutions is also proposed to provide effective functionalities, reliability, security, and performance. The virtual machines with appropriate resource allocation, software installation, and system configurations are used to build lightweight security laboratories on a hosting computer. Reliability and availability of laboratory platforms are covered by the virtual machine management framework. This management framework provides necessary monitoring and administration services to detect and recover critical failures of virtual machines at run time. Considering the risk that virtual machines can be misused for compromising production networks, we present security management solutions to prevent misuse of laboratory resources by security isolation at the system and network levels. This work is an attempt to bridge the gap between e-learning/tele-teaching and practical IT security education. It is not to substitute conventional teaching in laboratories but to add practical features to e-learning. This report demonstrates the possibility to implement hands-on security laboratories on the Internet reliably, securely, and economically.},
  language  = {en}
}
@book{WistWollowski2007,
  author    = {Wist, Dominic and Wollowski, Ralf},
  title     = {STG decomposition : avoiding irreducible CSC conflicts by internal communication},
  isbn      = {978-3-940793-02-7},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-32968},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2007},
  abstract  = {Inhalt: 1 Introduction 2 Basic Definitions 3 Achieving SI Implementability by Internal Communication 4 Towards a Structural Method 5 Examples 6 Conclusions and Future Work},
  language  = {en}
}
@book{PolyvyanyyKuropka2007,
  author    = {Polyvyanyy, Artem and Kuropka, Dominik},
  title     = {A quantitative evaluation of the enhanced topic-based vector space model},
  isbn      = {978-3-939469-95-7},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33816},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2007},
  abstract  = {This contribution presents a quantitative evaluation procedure for Information Retrieval models and the results of this procedure applied on the enhanced Topic-based Vector Space Model (eTVSM). Since the eTVSM is an ontology-based model, its effectiveness heavily depends on the quality of the underlaying ontology. Therefore the model has been tested with different ontologies to evaluate the impact of those ontologies on the effectiveness of the eTVSM. On the highest level of abstraction, the following results have been observed during our evaluation: First, the theoretically deduced statement that the eTVSM has a similar effecitivity like the classic Vector Space Model if a trivial ontology (every term is a concept and it is independet of any other concepts) is used has been approved. Second, we were able to show that the effectiveness of the eTVSM raises if an ontology is used which is only able to resolve synonyms. We were able to derive such kind of ontology automatically from the WordNet ontology. Third, we observed that more powerful ontologies automatically derived from the WordNet, dramatically dropped the effectiveness of the eTVSM model even clearly below the effectiveness level of the Vector Space Model. Fourth, we were able to show that a manually created and optimized ontology is able to raise the effectiveness of the eTVSM to a level which is clearly above the best effectiveness levels we have found in the literature for the Latent Semantic Index model with compareable document sets.},
  language  = {en}
}
@book{HagedornSchoebelUflackeretal.2007,
  author    = {Hagedorn, Benjamin and Sch{\"o}bel, Michael and Uflacker, Matthias and Copaciu, Flavius and Milanovic, Nikola},
  title     = {Proceedings of the fall 2006 workshop of the HPI research school on service-oriented systems engineering},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-939469-58-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33052},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {Getr. Z{\"a}hlung},
  year      = {2007},
  abstract  = {1. Design and Composition of 3D Geoinformation Services Benjamin Hagedorn 2. Operating System Abstractions for Service-Based Systems Michael Sch{\"o}bel 3. A Task-oriented Approach to User-centered Design of Service-Based Enterprise Applications Matthias Uflacker 4. A Framework for Adaptive Transport in Service- Oriented Systems based on Performance Prediction Flavius Copaciu 5. Asynchronicity and Loose Coupling in Service-Oriented Architectures Nikola Milanovic},
  language  = {en}
}
@book{Giese2008,
  author    = {Giese, Holger},
  title     = {Quo vadis, Modellierung? : Antrittsvorlesung 2008-12-11},
  publisher = {Univ.-Bibl.},
  address   = {Potsdam},
  year      = {2008},
  abstract  = {Zum Thema "Quo vadis, Modellierung?" h{\"a}lt Prof. Dr. Holger Giese am 11. Dezember 2008 seine Antrittsvorlesung an der Universit{\"a}t Potsdam. Der Wissenschaftler bekleidet eine Professur f{\"u}r Systemanalyse und Modellierung. Es handelt sich um eine gemeinsame Berufung der Universit{\"a}t Potsdam mit dem Hasso-Plattner- Institut f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam. Seit den Anf{\"a}ngen der Informatik vollzieht sich die Entwicklung von detaillierten, l{\"o}sungsorientierten und eher technisch gepr{\"a}gten Modellen hin zu solchen, die immer abstrakter und eher an den Problemen beziehungsweise Anwendungsbereichen orientiert sind. Diese erm{\"o}glichen es, die Komplexit{\"a}t heutiger Systeme besser zu beherrschen. Der Einsatz f{\"u}hrt in einigen Anwendungsbereichen heute schon zu bedeutend h{\"o}herer Produktivit{\"a}t und Qualit{\"a}t sowie geringeren Entwicklungszeiten. Anderseits hat sich aber auch in anderen Anwendungsgebieten gezeigt, dass die st{\"a}ndige Anpassung der Software an sich {\"a}ndernde Anforderungen oder Organisationsstrukturen dazu f{\"u}hrt, dass in fr{\"u}hen Entwicklungsphasen entstandene Modelle in der Praxis oft sehr schnell nicht mehr mit der Software {\"u}bereinstimmen. In seiner Antrittsvorlesung will Holger Giese diese Entwicklung Revue passieren lassen und der Frage nachgehen, was dies f{\"u}r die Zukunft der Modellierung bedeutet, mit welchen aktuellen Ans{\"a}tzen man diesem Problem zu begegnen versucht und welche zuk{\"u}nftigen Entwicklungen f{\"u}r die Modellierung zu erwarten sind.},
  language  = {de}
}
@book{HerschelNaumann2008,
  author    = {Herschel, Melanie and Naumann, Felix},
  title     = {Space and time scalability of duplicate detection in graph data},
  isbn      = {978-3-940793-46-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-32851},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2008},
  abstract  = {Duplicate detection consists in determining different representations of real-world objects in a database. Recent research has considered the use of relationships among object representations to improve duplicate detection. In the general case where relationships form a graph, research has mainly focused on duplicate detection quality/effectiveness. Scalability has been neglected so far, even though it is crucial for large real-world duplicate detection tasks. In this paper we scale up duplicate detection in graph data (DDG) to large amounts of data and pairwise comparisons, using the support of a relational database system. To this end, we first generalize the process of DDG. We then present how to scale algorithms for DDG in space (amount of data processed with limited main memory) and in time. Finally, we explore how complex similarity computation can be performed efficiently. Experiments on data an order of magnitude larger than data considered so far in DDG clearly show that our methods scale to large amounts of data not residing in main memory.},
  language  = {en}
}
@book{PolyvyanyySmirnovWeske2008,
  author    = {Polyvyanyy, Artem and Smirnov, Sergey and Weske, Mathias},
  title     = {The triconnected abstraction of process models},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-940793-65-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-32847},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {17},
  year      = {2008},
  abstract  = {Contents: Artem Polyvanny, Sergey Smirnow, and Mathias Weske The Triconnected Abstraction of Process Models 1 Introduction 2 Business Process Model Abstraction 3 Preliminaries 4 Triconnected Decomposition 4.1 Basic Approach for Process Component Discovery 4.2 SPQR-Tree Decomposition 4.3 SPQR-Tree Fragments in the Context of Process Models 5 Triconnected Abstraction 5.1 Abstraction Rules 5.2 Abstraction Algorithm 6 Related Work and Conclusions},
  language  = {en}
}
@book{OPUS4-3213,
  title     = {Proceedings of the 2nd International Workshop on e-learning and Virtual and Remote Laboratories},
  editor    = {Rabe, Bernhard and Rasche, Andreas},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-940793-17-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-34315},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {vi, 98},
  year      = {2008},
  abstract  = {Content Session 1: Architecture of Virtual \& Remote Laboratory Infrastructures (I) An Internet-Based Laboratory Course in Chemical Reaction Engineering and Unit Operations Internet Based Laboratory for Experimentation with Multilevel Medium-Power Converters Session 2: Architecture of Virtual \& Remote Laboratory Infrastructures (II) Content management and architectural issues of a remote learning laboratory Distributed Software Architecture and Applications for Remote Laboratories Tele-Lab IT-Security: an architecture for an online virtual IT security lab Session 3: New e-learning Techniques for Virtual \& Remote Laboratories NeOS: Neuchˆatel Online System A Flexible Instructional Electronics Laboratory with Local and Remote LabWorkbenches in a Grid Simulation of an Intelligent Network - Basic Call State Model Remote Laboratory Session 4: Service-Orientation in Virtual \& Remote Laboratories SOA Meets Robots - A Service-Based Software Infrastructure For Remote Laboratories Service Orientation in Education - Intelligent Networks for eLearning / mLearning},
  language  = {de}
}
@book{PolyvyanyySmirnovWeske2008,
  author    = {Polyvyanyy, Artem and Smirnov, Sergey and Weske, Mathias},
  title     = {Reducing the complexity of large EPCs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-32959},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2008},
  abstract  = {Inhalt: 1 Introduction 2 Motivation and Goal 3 Fundamentals 4 Elementary Abstractions 5 Real World Example 6 Conclusions},
  language  = {en}
}
@book{OPUS4-3118,
  title     = {Proceedings of the 2. Ph.D. retreat of the HPI Research School on Service-oriented Systems Engineering},
  editor    = {Meinel, Christoph and Polze, Andreas and Weske, Mathias and D{\"o}llner, J{\"u}rgen Roland Friedrich and Hirschfeld, Robert and Naumann, Felix and Giese, Holger and Plattner, Hasso},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-940793-42-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-32887},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {Getr. Z{\"a}hlung},
  year      = {2008},
  abstract  = {Contents 1. Styling for Service-Based 3D Geovisualization Benjamin Hagedorn 2. The Windows Monitoring Kernel Michael Sch{\"o}bel 3. A Resource-Oriented Information Network Platform for Global Design Processes Matthias Uflacker 4. Federation in SOA - Secure Service Invocation across Trust Domains Michael Menzel 5. KStruct: A Language for Kernel Runtime Inspection Alexander Schmidt 6. Deconstructing Resources Hagen Overdick 7. FMC-QE - Case Studies Stephan Kluth 8. A Matter of Trust Rehab Al-Nemr 9. From Semi-automated Service Composition to Semantic Conformance Harald Meyer},
  language  = {en}
}
@book{MeinelSackBross2008,
  author    = {Meinel, Christoph and Sack, Harald and Bross, Justus},
  title     = {Erster Deutscher IPv6 Gipfel},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-32865},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2008},
  abstract  = {Inhalt: KOMMUNIQU{\´E} GRUßWORT PROGRAMM HINTERGR{\"U}NDE UND FAKTEN REFERENTEN: BIOGRAFIE \& VOTRAGSZUSAMMENFASSUNG 1.) DER ERSTE DEUTSCHE IPV6 GIPFEL AM HASSO PLATTNER INSTITUT IN POTSDAM - PROF. DR. CHRISTOPH MEINEL - VIVIANE REDING 2.) IPV6, ITS TIME HAS COME - VINTON CERF 3.) DIE BEDEUTUNG VON IPV6 F{\"U}R DIE {\"O}FFENTLICHE VERWALTUNG IN DEUTSCHLAND - MARTIN SCHALLBRUCH 4.) TOWARDS THE FUTURE OF THE INTERNET - PROF. DR. LUTZ HEUSER 5.) IPV6 STRATEGY \& DEPLOYMENT STATUS IN JAPAN - HIROSHI MIYATA 6.) IPV6 STRATEGY \& DEPLOYMENT STATUS IN CHINA - PROF. WU HEQUAN 7.) IPV6 STRATEGY AND DEPLOYMENT STATUS IN KOREA - DR. EUNSOOK KIM 8.) IPV6 DEPLOYMENT EXPERIENCES IN GREEK SCHOOL NETWORK - ATHANASSIOS LIAKOPOULOS 9.) IPV6 NETWORK MOBILITY AND IST USAGE - JEAN-MARIE BONNIN 10.) IPV6 - R{\"U}STZEUG F{\"U}R OPERATOR \& ISP IPV6 DEPLOYMENT UND STRATEGIEN DER DEUTSCHEN TELEKOM - HENNING GROTE 11.) VIEW FROM THE IPV6 DEPLOYMENT FRONTLINE - YVES POPPE 12.) DEPLOYING IPV6 IN MOBILE ENVIRONMENTS - WOLFGANG FRITSCHE 13.) PRODUCTION READY IPV6 FROM CUSTOMER LAN TO THE INTERNET - LUTZ DONNERHACKE 14.) IPV6 - DIE BASIS F{\"U}R NETZWERKZENTRIERTE OPERATIONSF{\"U}HRUNG (NETOPF{\"U}) IN DER BUNDESWEHR HERAUSFORDERUNGEN - ANWENDUNGSFALLBETRACHTUNGEN - AKTIVIT{\"A}TEN - CARSTEN HATZIG 15.) WINDOWS VISTA \& IPV6 - BERND OURGHANLIAN 16.) IPV6 \& HOME NETWORKING TECHINCAL AND BUSINESS CHALLENGES - DR. TAYEB BEN MERIEM 17.) DNS AND DHCP FOR DUAL STACK NETWORKS - LAWRENCE HUGHES 18.) CAR INDUSTRY: GERMAN EXPERIENCE WITH IPV6 - AMARDEO SARMA 19.) IPV6 \& AUTONOMIC NETWORKING - RANGANAI CHAPARADZA 20.) P2P \& GRID USING IPV6 AND MOBILE IPV6 - DR. LATIF LADID},
  language  = {en}
}
@article{GlanderDoellner2009,
  author    = {Glander, Tassilo and D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Abstract representations for interactive visualization of virtual 3D city models},
  issn      = {0198-9715},
  doi       = {10.1016/j.compenvurbsys.2009.07.003},
  year      = {2009},
  abstract  = {Virtual 3D city models increasingly cover whole city areas; hence, the perception of complex urban structures becomes increasingly difficult. Using abstract visualization, complexity of these models can be hidden where its visibility is unnecessary, while important features are maintained and highlighted for better comprehension and communication. We present a technique to automatically generalize a given virtual 3D city model consisting of building models, an infrastructure network and optional land coverage data; this technique creates several representations of increasing levels of abstraction. Using the infrastructure network, our technique groups building models and replaces them with cell blocks, while preserving local landmarks. By computing a landmark hierarchy, we reduce the set of initial landmarks in a spatially balanced manner for use in higher levels of abstraction. In four application examples, we demonstrate smooth visualization of transitions between precomputed representations; dynamic landmark highlighting according to virtual camera distance; an implementation of a cognitively enhanced route representation, and generalization lenses to combine precomputed representations in focus + context visualization.},
  language  = {en}
}
@article{DeckerKoppLeymannetal.2009,
  author    = {Decker, Gero and Kopp, Oliver and Leymann, Frank and Weske, Mathias},
  title     = {Interacting services : from specification to execution},
  issn      = {0169-023X},
  doi       = {10.1016/j.datak.2009.04.003},
  year      = {2009},
  abstract  = {Interacting services play a key role to realize business process integration among different business partners by means of electronic message exchange. In order to provide seamless integration of these services, the messages exchanged as well as their dependencies must be well-defined. Service choreographies are a means to describe the allowed conversations. This article presents a requirements framework for service choreography languages, along which existing choreography languages are assessed. The requirements framework provides the basis for introducing the language BPEL4Chor, which extends the industry standard WS-BPEL with choreography-specific concepts. A validation is provided and integration with executable service orchestrations is discussed.},
  language  = {en}
}
@article{DeckerMendling2009,
  author    = {Decker, Gero and Mendling, Jan},
  title     = {Process instantiation},
  issn      = {0169-023X},
  doi       = {10.1016/j.datak.2009.02.013},
  year      = {2009},
  abstract  = {Although several process modeling languages allow one to specify processes with multiple start elements, the precise semantics of such models are often unclear, both from a pragmatic and from a theoretical point of view. This paper addresses the lack of research on this problem and introduces the CASU framework (from Creation, Activation, subscription, Unsubscription). The contribution of this framework is a systematic description of design alternatives for the specification of instantiation semantics of process modeling languages. We classify six prominent languages by the help of this framework. We validate the relevance of the CASU framework through empirical investigations involving a large set of process models from practice. Our work provides the basis for the design of new correctness criteria as well as for the formalization of Event-driven Process Chains (EPCs) and extension of the Business Process Modeling Notation (BPMN). It complements research such as the workflow patterns.},
  language  = {en}
}
@article{TroegerPolze2009,
  author    = {Troeger, Peter and Polze, Andreas},
  title     = {Object and process migration in .NET},
  issn      = {0267-6192},
  year      = {2009},
  abstract  = {Many of today's distributed computing systems in the field do not Support the migration of execution entities among computing nodes (luring runtime. The relatively static association between units of processing and computing nodes makes it difficult to implement fault-tolerant behavior or load-balancing schemes. The concept of code migration may provide a solution to the above-mentioned problems. it can be defined as the movement of processes, objects, or components from one computing node to another during system runtime in a distributed environment. With the advent of the virtual machine-based NET framework, many of the cross-language heterogeneity issues have been resolved. With the commercial implementation, the shared source "Rotor", and the open-source "Mono" implementation on hand, we have focused on cross-operating system heterogeneity issues and present interoperability and migration schemes for applications distributed over different operating systems (namely Linux and Windows 2000) as well as various NET implementations. Within this paper, we describe the integration of a migration facility with the hell) of Aspect- Oriented Programming (AOP) into the NET framework. AOP is interesting as it addresses non-functional system properties on the middleware level, without the need to manipulate lower system layers like the operating system itself. Most features required to implement object or process migration (such as reflection mechanisms or a machine-independent executable format) are already present in the NET frameworks, so the integration of such a concept is a natural extension of the system capabilities. We have implemented several proof-of-concept applications for different use case scenarios. The paper contains an experimental evaluation of the performance impact of object migration in context of those applications.},
  language  = {en}
}
@article{WistWollowskiSchaeferetal.2009,
  author    = {Wist, Dominic and Wollowski, Ralf and Schaefer, Mark and Vogler, Walter},
  title     = {Avoiding irreducible CSC conflicts by internal communication},
  issn      = {0169-2968},
  doi       = {10.3233/Fi-2009-140},
  year      = {2009},
  abstract  = {Resynthesis of handshake specifications obtained e. g. from BALSA or TANGRAM with speed-independent logic synthesis from STGs is a promising approach. To deal with state-space explosion, we suggested STG decomposition; a problem is that decomposition can lead to irreducible CSC conflicts. Here, we present a new approach to solve such conflicts by introducing internal communication between the components. We give some first, very encouraging results for very large STGs concerning synthesis time and circuit area.},
  language  = {en}
}
@misc{Fink2009,
  author    = {Fink, Hans-Peter},
  title     = {Von Biopolymeren und Biokunststoffen : Antrittsvorlesung 2009-06-04},
  publisher = {Univ.-Bibl.},
  address   = {Potsdam},
  year      = {2009},
  abstract  = {Prof. Fink wird zum einen auf die industriell schon lange genutzten nat{\"u}rlichen Polymere wie Cellulose, St{\"a}rke und Lignin eingehen, zum anderen auf neue Entwicklungen bei biobasierten Kunststoffen. Von besonderer Bedeutung ist dabei die Aufkl{\"a}rung von Zusammenh{\"a}ngen zwischen Prozessparametern, Strukturen und Eigenschaften.},
  language  = {de}
}
@article{KhomenkoSchaeferVogleretal.2009,
  author    = {Khomenko, Victor and Sch{\"a}fer, Mark and Vogler, Walter and Wollowski, Ralf},
  title     = {STG decomposition strategies in combination with unfolding},
  issn      = {0001-5903},
  doi       = {10.1007/s00236-009-0102-y},
  year      = {2009},
  abstract  = {For synthesising efficient asynchronous circuits one has to deal with the state space explosion problem. In order to alleviate this problem one can decompose the STG into smaller components. This paper deals with the decomposition method of Vogler and Wollowski and introduces several strategies for its efficient implementations. Furthermore, this approach is combined with another method to alleviate state space explosion, which is based on Petri net unfoldings. The developed algorithms are compared by means of benchmark examples, and the experimental results show significant improvement in terms of memory usage and runtime compared with other existing methods.},
  language  = {en}
}
@article{HauptAdamsTimbermontetal.2009,
  author    = {Haupt, Michael and Adams, Bram and Timbermont, Stijn and Gibbs, Celina and Coady, Yvonne and Hirschfeld, Robert},
  title     = {Disentangling virtual machine architecture},
  issn      = {1751-8806},
  doi       = {10.1049/iet-sen.2007.0121},
  year      = {2009},
  abstract  = {Virtual machine (VM) implementations are made of intricately intertwined subsystems, interacting largely through implicit dependencies. As the degree of crosscutting present in VMs is very high, VM implementations exhibit significant internal complexity. This study proposes an architecture approach for VMs that regards a VM as a composite of service modules coordinated through explicit bidirectional interfaces. Aspect-oriented programming techniques are used to establish these interfaces, to coordinate module interaction, and to declaratively express concrete VM architectures. A VM architecture description language is presented in a case study, illustrating the application of the proposed architectural principles.},
  language  = {en}
}
@article{GieseWagner2009,
  author    = {Giese, Holger and Wagner, Robert},
  title     = {From model transformation to incremental bidirectional model synchronization},
  issn      = {1619-1366},
  doi       = {10.1007/s10270-008-0089-9},
  year      = {2009},
  abstract  = {The model-driven software development paradigm requires that appropriate model transformations are applicable in different stages of the development process. The transformations have to consistently propagate changes between the different involved models and thus ensure a proper model synchronization. However, most approaches today do not fully support the requirements for model synchronization and focus only on classical one-way batch-oriented transformations. In this paper, we present our approach for an incremental model transformation which supports model synchronization. Our approach employs the visual, formal, and bidirectional transformation technique of triple graph grammars. Using this declarative specification formalism, we focus on the efficient execution of the transformation rules and how to achieve an incremental model transformation for synchronization purposes. We present an evaluation of our approach and demonstrate that due to the speedup for the incremental processing in the average case even larger models can be tackled.},
  language  = {en}
}
@book{SmirnovWeidlichMendlingetal.2009,
  author    = {Smirnov, Sergey and Weidlich, Matthias and Mendling, Jan and Weske, Mathias},
  title     = {Action patterns in business process models},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-009-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33586},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {19},
  year      = {2009},
  abstract  = {Business process management experiences a large uptake by the industry, and process models play an important role in the analysis and improvement of processes. While an increasing number of staff becomes involved in actual modeling practice, it is crucial to assure model quality and homogeneity along with providing suitable aids for creating models. In this paper we consider the problem of offering recommendations to the user during the act of modeling. Our key contribution is a concept for defining and identifying so-called action patterns - chunks of actions often appearing together in business processes. In particular, we specify action patterns and demonstrate how they can be identified from existing process model repositories using association rule mining techniques. Action patterns can then be used to suggest additional actions for a process model. Our approach is challenged by applying it to the collection of process models from the SAP Reference Model.},
  language  = {en}
}
@book{BeckerGieseNeumann2009,
  author    = {Becker, Basil and Giese, Holger and Neumann, Stefan},
  title     = {Correct dynamic service-oriented architectures : modeling and compositional verification with dynamic collaborations},
  organization    = {System Analysis and Modeling Group},
  isbn      = {978-3-940793-91-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-30473},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2009},
  abstract  = {Service-oriented modeling employs collaborations to capture the coordination of multiple roles in form of service contracts. In case of dynamic collaborations the roles may join and leave the collaboration at runtime and therefore complex structural dynamics can result, which makes it very hard to ensure their correct and safe operation. We present in this paper our approach for modeling and verifying such dynamic collaborations. Modeling is supported using a well-defined subset of UML class diagrams, behavioral rules for the structural dynamics, and UML state machines for the role behavior. To be also able to verify the resulting service-oriented systems, we extended our former results for the automated verification of systems with structural dynamics [7, 8] and developed a compositional reasoning scheme, which enables the reuse of verification results. We outline our approach using the example of autonomous vehicles that use such dynamic collaborations via ad-hoc networking to coordinate and optimize their joint behavior.},
  language  = {en}
}
@book{GieseHildebrandt2009,
  author    = {Giese, Holger and Hildebrandt, Stephan},
  title     = {Efficient model synchronization of large-scale models},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-940793-84-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29281},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {27},
  year      = {2009},
  abstract  = {Model-driven software development requires techniques to consistently propagate modifications between different related models to realize its full potential. For large-scale models, efficiency is essential in this respect. In this paper, we present an improved model synchronization algorithm based on triple graph grammars that is highly efficient and, therefore, can also synchronize large-scale models sufficiently fast. We can show, that the overall algorithm has optimal complexity if it is dominating the rule matching and further present extensive measurements that show the efficiency of the presented model transformation and synchronization technique.},
  language  = {en}
}
@book{OPUS4-2793,
  title     = {Proceedings of the 3rd Ph.D. Retreat of the HPI Research School on Service-oriented Systems Engineering},
  editor    = {Meinel, Christoph and Plattner, Hasso and D{\"o}llner, J{\"u}rgen Roland Friedrich and Weske, Mathias and Polze, Andreas and Hirschfeld, Robert and Naumann, Felix and Giese, Holger},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-940793-81-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29148},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {Getr. Z{\"a}hlung},
  year      = {2009},
  abstract  = {Design and Implementation of service-oriented architectures imposes a huge number of research questions from the fields of software engineering, system analysis and modeling, adaptability, and application integration. Component orientation and web services are two approaches for design and realization of complex web-based system. Both approaches allow for dynamic application adaptation as well as integration of enterprise application. Commonly used technologies, such as J2EE and .NET, form de facto standards for the realization of complex distributed systems. Evolution of component systems has lead to web services and service-based architectures. This has been manifested in a multitude of industry standards and initiatives such as XML, WSDL UDDI, SOAP, etc. All these achievements lead to a new and promising paradigm in IT systems engineering which proposes to design complex software solutions as collaboration of contractually defined software services. Service-Oriented Systems Engineering represents a symbiosis of best practices in object-orientation, component-based development, distributed computing, and business process management. It provides integration of business and IT concerns. The annual Ph.D. Retreat of the Research School provides each member the opportunity to present his/her current state of their research and to give an outline of a prospective Ph.D. thesis. Due to the interdisciplinary structure of the Research Scholl, this technical report covers a wide range of research topics. These include but are not limited to: Self-Adaptive Service-Oriented Systems, Operating System Support for Service-Oriented Systems, Architecture and Modeling of Service-Oriented Systems, Adaptive Process Management, Services Composition and Workflow Planning, Security Engineering of Service-Based IT Systems, Quantitative Analysis and Optimization of Service-Oriented Systems, Service-Oriented Systems in 3D Computer Graphics, as well as Service-Oriented Geoinformatics.},
  language  = {en}
}
@book{SmirnovReijersNugterenetal.2010,
  author    = {Smirnov, Sergey and Reijers, Hajo A. and Nugteren, Thijs and Weske, Mathias},
  title     = {Business process model abstraction : theory and practice},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-054-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41782},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {17},
  year      = {2010},
  abstract  = {Business process management aims at capturing, understanding, and improving work in organizations. The central artifacts are process models, which serve different purposes. Detailed process models are used to analyze concrete working procedures, while high-level models show, for instance, handovers between departments. To provide different views on process models, business process model abstraction has emerged. While several approaches have been proposed, a number of abstraction use case that are both relevant for industry and scientifically challenging are yet to be addressed. In this paper we systematically develop, classify, and consolidate different use cases for business process model abstraction. The reported work is based on a study with BPM users in the health insurance sector and validated with a BPM consultancy company and a large BPM vendor. The identified fifteen abstraction use cases reflect the industry demand. The related work on business process model abstraction is evaluated against the use cases, which leads to a research agenda.},
  language  = {en}
}
@phdthesis{Brauer2010,
  author    = {Brauer, Falk},
  title     = {Extraktion und Identifikation von Entit{\"a}ten in Textdaten im Umfeld der Enterprise Search},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51409},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Die automatische Informationsextraktion (IE) aus unstrukturierten Texten erm{\"o}glicht v{\"o}llig neue Wege, auf relevante Informationen zuzugreifen und deren Inhalte zu analysieren, die weit {\"u}ber bisherige Verfahren zur Stichwort-basierten Dokumentsuche hinausgehen. Die Entwicklung von Programmen zur Extraktion von maschinenlesbaren Daten aus Texten erfordert jedoch nach wie vor die Entwicklung von dom{\"a}nenspezifischen Extraktionsprogrammen. Insbesondere im Bereich der Enterprise Search (der Informationssuche im Unternehmensumfeld), in dem eine große Menge von heterogenen Dokumenttypen existiert, ist es oft notwendig ad-hoc Programm-module zur Extraktion von gesch{\"a}ftsrelevanten Entit{\"a}ten zu entwickeln, die mit generischen Modulen in monolithischen IE-Systemen kombiniert werden. Dieser Umstand ist insbesondere kritisch, da potentiell f{\"u}r jeden einzelnen Anwendungsfall ein von Grund auf neues IE-System entwickelt werden muss. Die vorliegende Dissertation untersucht die effiziente Entwicklung und Ausf{\"u}hrung von IE-Systemen im Kontext der Enterprise Search und effektive Methoden zur Ausnutzung bekannter strukturierter Daten im Unternehmenskontext f{\"u}r die Extraktion und Identifikation von gesch{\"a}ftsrelevanten Entit{\"a}ten in Doku-menten. Grundlage der Arbeit ist eine neuartige Plattform zur Komposition von IE-Systemen auf Basis der Beschreibung des Datenflusses zwischen generischen und anwendungsspezifischen IE-Modulen. Die Plattform unterst{\"u}tzt insbesondere die Entwicklung und Wiederverwendung von generischen IE-Modulen und zeichnet sich durch eine h{\"o}here Flexibilit{\"a}t und Ausdrucksm{\"a}chtigkeit im Vergleich zu vorherigen Methoden aus. Ein in der Dissertation entwickeltes Verfahren zur Dokumentverarbeitung interpretiert den Daten-austausch zwischen IE-Modulen als Datenstr{\"o}me und erm{\"o}glicht damit eine weitgehende Parallelisierung von einzelnen Modulen. Die autonome Ausf{\"u}hrung der Module f{\"u}hrt zu einer wesentlichen Beschleu-nigung der Verarbeitung von Einzeldokumenten und verbesserten Antwortzeiten, z. B. f{\"u}r Extraktions-dienste. Bisherige Ans{\"a}tze untersuchen lediglich die Steigerung des durchschnittlichen Dokumenten-durchsatzes durch verteilte Ausf{\"u}hrung von Instanzen eines IE-Systems. Die Informationsextraktion im Kontext der Enterprise Search unterscheidet sich z. B. von der Extraktion aus dem World Wide Web dadurch, dass in der Regel strukturierte Referenzdaten z. B. in Form von Unternehmensdatenbanken oder Terminologien zur Verf{\"u}gung stehen, die oft auch die Beziehungen von Entit{\"a}ten beschreiben. Entit{\"a}ten im Unternehmensumfeld haben weiterhin bestimmte Charakteristiken: Eine Klasse von relevanten Entit{\"a}ten folgt bestimmten Bildungsvorschriften, die nicht immer bekannt sind, auf die aber mit Hilfe von bekannten Beispielentit{\"a}ten geschlossen werden kann, so dass unbekannte Entit{\"a}ten extrahiert werden k{\"o}nnen. Die Bezeichner der anderen Klasse von Entit{\"a}ten haben eher umschreibenden Charakter. Die korrespondierenden Umschreibungen in Texten k{\"o}nnen variieren, wodurch eine Identifikation derartiger Entit{\"a}ten oft erschwert wird. Zur effizienteren Entwicklung von IE-Systemen wird in der Dissertation ein Verfahren untersucht, das alleine anhand von Beispielentit{\"a}ten effektive Regul{\"a}re Ausdr{\"u}cke zur Extraktion von unbekannten Entit{\"a}ten erlernt und damit den manuellen Aufwand in derartigen Anwendungsf{\"a}llen minimiert. Verschiedene Generalisierungs- und Spezialisierungsheuristiken erkennen Muster auf verschiedenen Abstraktionsebenen und schaffen dadurch einen Ausgleich zwischen Genauigkeit und Vollst{\"a}ndigkeit bei der Extraktion. Bekannte Regellernverfahren im Bereich der Informationsextraktion unterst{\"u}tzen die beschriebenen Problemstellungen nicht, sondern ben{\"o}tigen einen (annotierten) Dokumentenkorpus. Eine Methode zur Identifikation von Entit{\"a}ten, die durch Graph-strukturierte Referenzdaten vordefiniert sind, wird als dritter Schwerpunkt untersucht. Es werden Verfahren konzipiert, welche {\"u}ber einen exakten Zeichenkettenvergleich zwischen Text und Referenzdatensatz hinausgehen und Teil{\"u}bereinstimmungen und Beziehungen zwischen Entit{\"a}ten zur Identifikation und Disambiguierung heranziehen. Das in der Arbeit vorgestellte Verfahren ist bisherigen Ans{\"a}tzen hinsichtlich der Genauigkeit und Vollst{\"a}ndigkeit bei der Identifikation {\"u}berlegen.},
  language  = {de}
}
@inproceedings{PalixLawallThomasetal.2010,
  author    = {Palix, Nicolas and Lawall, Julia L. and Thomas, Ga{\"e}l and Muller, Gilles},
  title     = {How Often do Experts Make Mistakes?},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41327},
  year      = {2010},
  abstract  = {Large open-source software projects involve developers with a wide variety of backgrounds and expertise. Such software projects furthermore include many internal APIs that developers must understand and use properly. According to the intended purpose of these APIs, they are more or less frequently used, and used by developers with more or less expertise. In this paper, we study the impact of usage patterns and developer expertise on the rate of defects occurring in the use of internal APIs. For this preliminary study, we focus on memory management APIs in the Linux kernel, as the use of these has been shown to be highly error prone in previous work. We study defect rates and developer expertise, to consider e.g., whether widely used APIs are more defect prone because they are used by less experienced developers, or whether defects in widely used APIs are more likely to be fixed.},
  language  = {en}
}
@inproceedings{OPUS4-3948,
  title     = {Preface},
  editor    = {Adams, Bram and Haupt, Michael and Lohmann, Daniel},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41338},
  year      = {2010},
  abstract  = {Aspect-oriented programming, component models, and design patterns are modern and actively evolving techniques for improving the modularization of complex software. In particular, these techniques hold great promise for the development of "systems infrastructure" software, e.g., application servers, middleware, virtual machines, compilers, operating systems, and other software that provides general services for higher-level applications. The developers of infrastructure software are faced with increasing demands from application programmers needing higher-level support for application development. Meeting these demands requires careful use of software modularization techniques, since infrastructural concerns are notoriously hard to modularize. Aspects, components, and patterns provide very different means to deal with infrastructure software, but despite their differences, they have much in common. For instance, component models try to free the developer from the need to deal directly with services like security or transactions. These are primary examples of crosscutting concerns, and modularizing such concerns are the main target of aspect-oriented languages. Similarly, design patterns like Visitor and Interceptor facilitate the clean modularization of otherwise tangled concerns. Building on the ACP4IS meetings at AOSD 2002-2009, this workshop aims to provide a highly interactive forum for researchers and developers to discuss the application of and relationships between aspects, components, and patterns within modern infrastructure software. The goal is to put aspects, components, and patterns into a common reference frame and to build connections between the software engineering and systems communities.},
  language  = {en}
}
@inproceedings{BynensVanLanduytTruyenetal.2010,
  author    = {Bynens, Maarten and Van Landuyt, Dimitri and Truyen, Eddy and Joosen, Wouter},
  title     = {Towards reusable aspects: the callback mismatch problem},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41347},
  year      = {2010},
  abstract  = {Because software development is increasingly expensive and timeconsuming, software reuse gains importance. Aspect-oriented software development modularizes crosscutting concerns which enables their systematic reuse. Literature provides a number of AOP patterns and best practices for developing reusable aspects based on compelling examples for concerns like tracing, transactions and persistence. However, such best practices are lacking for systematically reusing invasive aspects. In this paper, we present the 'callback mismatch problem'. This problem arises in the context of abstraction mismatch, in which the aspect is required to issue a callback to the base application. As a consequence, the composition of invasive aspects is cumbersome to implement, difficult to maintain and impossible to reuse. We motivate this problem in a real-world example, show that it persists in the current state-of-the-art, and outline the need for advanced aspectual composition mechanisms to deal with this.},
  language  = {en}
}
@inproceedings{Harrison2010,
  author    = {Harrison, William},
  title     = {Malleability, obliviousness and aspects for broadcast service attachment},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41389},
  year      = {2010},
  abstract  = {An important characteristic of Service-Oriented Architectures is that clients do not depend on the service implementation's internal assignment of methods to objects. It is perhaps the most important technical characteristic that differentiates them from more common object-oriented solutions. This characteristic makes clients and services malleable, allowing them to be rearranged at run-time as circumstances change. That improvement in malleability is impaired by requiring clients to direct service requests to particular services. Ideally, the clients are totally oblivious to the service structure, as they are to aspect structure in aspect-oriented software. Removing knowledge of a method implementation's location, whether in object or service, requires re-defining the boundary line between programming language and middleware, making clearer specification of dependence on protocols, and bringing the transaction-like concept of failure scopes into language semantics as well. This paper explores consequences and advantages of a transition from object-request brokering to service-request brokering, including the potential to improve our ability to write more parallel software.},
  language  = {en}
}
@book{GellerHirschfeldBracha2010,
  author    = {Geller, Felix and Hirschfeld, Robert and Bracha, Gilad},
  title     = {Pattern Matching for an object-oriented and dynamically typed programming language},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-065-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-43035},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {81},
  year      = {2010},
  abstract  = {Pattern matching is a well-established concept in the functional programming community. It provides the means for concisely identifying and destructuring values of interest. This enables a clean separation of data structures and respective functionality, as well as dispatching functionality based on more than a single value. Unfortunately, expressive pattern matching facilities are seldomly incorporated in present object-oriented programming languages. We present a seamless integration of pattern matching facilities in an object-oriented and dynamically typed programming language: Newspeak. We describe language extensions to improve the practicability and integrate our additions with the existing programming environment for Newspeak. This report is based on the first author's master's thesis.},
  language  = {en}
}
@article{SeibelNeumannGiese2010,
  author    = {Seibel, Andreas and Neumann, Stefan and Giese, Holger},
  title     = {Dynamic hierarchical mega models : comprehensive traceability and its efficient maintenance},
  issn      = {1619-1366},
  doi       = {10.1007/s10270-009-0146-z},
  year      = {2010},
  abstract  = {In the world of model-driven engineering (MDE) support for traceability and maintenance of traceability information is essential. On the one hand, classical traceability approaches for MDE address this need by supporting automated creation of traceability information on the model element level. On the other hand, global model management approaches manually capture traceability information on the model level. However, there is currently no approach that supports comprehensive traceability, comprising traceability information on both levels, and efficient maintenance of traceability information, which requires a high-degree of automation and scalability. In this article, we present a comprehensive traceability approach that combines classical traceability approaches for MDE and global model management in form of dynamic hierarchical mega models. We further integrate efficient maintenance of traceability information based on top of dynamic hierarchical mega models. The proposed approach is further outlined by using an industrial case study and by presenting an implementation of the concepts in form of a prototype.},
  language  = {en}
}
@book{LangeBoehmNaumann2010,
  author    = {Lange, Dustin and B{\"o}hm, Christoph and Naumann, Felix},
  title     = {Extracting structured information from Wikipedia articles to populate infoboxes},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-081-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-45714},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {27},
  year      = {2010},
  abstract  = {Roughly every third Wikipedia article contains an infobox - a table that displays important facts about the subject in attribute-value form. The schema of an infobox, i.e., the attributes that can be expressed for a concept, is defined by an infobox template. Often, authors do not specify all template attributes, resulting in incomplete infoboxes. With iPopulator, we introduce a system that automatically populates infoboxes of Wikipedia articles by extracting attribute values from the article's text. In contrast to prior work, iPopulator detects and exploits the structure of attribute values for independently extracting value parts. We have tested iPopulator on the entire set of infobox templates and provide a detailed analysis of its effectiveness. For instance, we achieve an average extraction precision of 91\% for 1,727 distinct infobox template attributes.},
  language  = {en}
}
@book{WistSchaeferVogleretal.2010,
  author    = {Wist, Dominic and Schaefer, Mark and Vogler, Walter and Wollowski, Ralf},
  title     = {STG decomposition : internal communication for SI implementability},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-037-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-40786},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {36},
  year      = {2010},
  abstract  = {STG decomposition is a promising approach to tackle the complexity problems arising in logic synthesis of speed independent circuits, a robust asynchronous (i.e. clockless) circuit type. Unfortunately, STG decomposition can result in components that in isolation have irreducible CSC conflicts. Generalising earlier work, it is shown how to resolve such conflicts by introducing internal communication between the components via structural techniques only.},
  language  = {en}
}
@book{OPUS4-3946,
  title     = {Proceedings of the 9th Workshop on Aspects, Components, and Patterns for Infrastructure Software (ACP4IS '10)},
  editor    = {Adams, Bram and Haupt, Michael and Lohmann, Daniel},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-043-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41221},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {47},
  year      = {2010},
  abstract  = {Aspect-oriented programming, component models, and design patterns are modern and actively evolving techniques for improving the modularization of complex software. In particular, these techniques hold great promise for the development of "systems infrastructure" software, e.g., application servers, middleware, virtual machines, compilers, operating systems, and other software that provides general services for higher-level applications. The developers of infrastructure software are faced with increasing demands from application programmers needing higher-level support for application development. Meeting these demands requires careful use of software modularization techniques, since infrastructural concerns are notoriously hard to modularize. Aspects, components, and patterns provide very different means to deal with infrastructure software, but despite their differences, they have much in common. For instance, component models try to free the developer from the need to deal directly with services like security or transactions. These are primary examples of crosscutting concerns, and modularizing such concerns are the main target of aspect-oriented languages. Similarly, design patterns like Visitor and Interceptor facilitate the clean modularization of otherwise tangled concerns. Building on the ACP4IS meetings at AOSD 2002-2009, this workshop aims to provide a highly interactive forum for researchers and developers to discuss the application of and relationships between aspects, components, and patterns within modern infrastructure software. The goal is to put aspects, components, and patterns into a common reference frame and to build connections between the software engineering and systems communities.},
  language  = {en}
}
@inproceedings{FanMasuharaAotanietal.2010,
  author    = {Fan, Yang and Masuhara, Hidehiko and Aotani, Tomoyuki and Nielson, Flemming and Nielson, Hanne Riis},
  title     = {AspectKE*: Security aspects with program analysis for distributed systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41369},
  year      = {2010},
  abstract  = {Enforcing security policies to distributed systems is difficult, in particular, when a system contains untrusted components. We designed AspectKE*, a distributed AOP language based on a tuple space, to tackle this issue. In AspectKE*, aspects can enforce access control policies that depend on future behavior of running processes. One of the key language features is the predicates and functions that extract results of static program analysis, which are useful for defining security aspects that have to know about future behavior of a program. AspectKE* also provides a novel variable binding mechanism for pointcuts, so that pointcuts can uniformly specify join points based on both static and dynamic information about the program. Our implementation strategy performs fundamental static analysis at load-time, so as to retain runtime overheads minimal. We implemented a compiler for AspectKE*, and demonstrate usefulness of AspectKE* through a security aspect for a distributed chat system.},
  language  = {en}
}
@inproceedings{HannousseArdourelDouence2010,
  author    = {Hannousse, Abdelhakim and Ardourel, Gilles and Douence, R{\´e}mi},
  title     = {Views for aspectualizing component models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41359},
  year      = {2010},
  abstract  = {Component based software development (CBSD) and aspectoriented software development (AOSD) are two complementary approaches. However, existing proposals for integrating aspects into component models are direct transposition of object-oriented AOSD techniques to components. In this article, we propose a new approach based on views. Our proposal introduces crosscutting components quite naturally and can be integrated into different component models.},
  language  = {en}
}
@book{BauckmannLeserNaumann2010,
  author    = {Bauckmann, Jana and Leser, Ulf and Naumann, Felix},
  title     = {Efficient and exact computation of inclusion dependencies for data integration},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-048-9},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41396},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {36},
  year      = {2010},
  abstract  = {Data obtained from foreign data sources often come with only superficial structural information, such as relation names and attribute names. Other types of metadata that are important for effective integration and meaningful querying of such data sets are missing. In particular, relationships among attributes, such as foreign keys, are crucial metadata for understanding the structure of an unknown database. The discovery of such relationships is difficult, because in principle for each pair of attributes in the database each pair of data values must be compared. A precondition for a foreign key is an inclusion dependency (IND) between the key and the foreign key attributes. We present with Spider an algorithm that efficiently finds all INDs in a given relational database. It leverages the sorting facilities of DBMS but performs the actual comparisons outside of the database to save computation. Spider analyzes very large databases up to an order of magnitude faster than previous approaches. We also evaluate in detail the effectiveness of several heuristics to reduce the number of necessary comparisons. Furthermore, we generalize Spider to find composite INDs covering multiple attributes, and partial INDs, which are true INDs for all but a certain number of values. This last type is particularly relevant when integrating dirty data as is often the case in the life sciences domain - our driving motivation.},
  language  = {en}
}
@phdthesis{Awad2010,
  author    = {Awad, Ahmed Mahmoud Hany Aly},
  title     = {A compliance management framework for business process models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49222},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Companies develop process models to explicitly describe their business operations. In the same time, business operations, business processes, must adhere to various types of compliance requirements. Regulations, e.g., Sarbanes Oxley Act of 2002, internal policies, best practices are just a few sources of compliance requirements. In some cases, non-adherence to compliance requirements makes the organization subject to legal punishment. In other cases, non-adherence to compliance leads to loss of competitive advantage and thus loss of market share. Unlike the classical domain-independent behavioral correctness of business processes, compliance requirements are domain-specific. Moreover, compliance requirements change over time. New requirements might appear due to change in laws and adoption of new policies. Compliance requirements are offered or enforced by different entities that have different objectives behind these requirements. Finally, compliance requirements might affect different aspects of business processes, e.g., control flow and data flow. As a result, it is infeasible to hard-code compliance checks in tools. Rather, a repeatable process of modeling compliance rules and checking them against business processes automatically is needed. This thesis provides a formal approach to support process design-time compliance checking. Using visual patterns, it is possible to model compliance requirements concerning control flow, data flow and conditional flow rules. Each pattern is mapped into a temporal logic formula. The thesis addresses the problem of consistency checking among various compliance requirements, as they might stem from divergent sources. Also, the thesis contributes to automatically check compliance requirements against process models using model checking. We show that extra domain knowledge, other than expressed in compliance rules, is needed to reach correct decisions. In case of violations, we are able to provide a useful feedback to the user. The feedback is in the form of parts of the process model whose execution causes the violation. In some cases, our approach is capable of providing automated remedy of the violation.},
  language  = {en}
}
@book{OPUS4-4677,
  title     = {Selected Papers of the International Workshop on Smalltalk Technologies (IWST'10) : Barcelona, Spain, September 14, 2010},
  editor    = {Haupt, Michael and Hirschfeld, Robert},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-106-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-48553},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {34},
  year      = {2010},
  abstract  = {The goal of the IWST workshop series is to create and foster a forum around advancements of or experience in Smalltalk. The workshop welcomes contributions to all aspects, theoretical as well as practical, of Smalltalk-related topics.},
  language  = {en}
}
@book{GieseHildebrandtLambers2010,
  author    = {Giese, Holger and Hildebrandt, Stephan and Lambers, Leen},
  title     = {Toward bridging the gap between formal semantics and implementation of triple graph grammars},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-078-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-45219},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {26},
  year      = {2010},
  abstract  = {The correctness of model transformations is a crucial element for the model-driven engineering of high quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the employed implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches it is usually not really clear under which constraints particular implementations are really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. Whereas the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static analysis can be employed to guarantee these criteria.},
  language  = {en}
}
@inproceedings{SurajbaliGraceCoulson2010,
  author    = {Surajbali, Bholanathsingh and Grace, Paul and Coulson, Geoff},
  title     = {Preserving dynamic reconfiguration consistency in aspect oriented middleware},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41379},
  year      = {2010},
  abstract  = {Aspect-oriented middleware is a promising technology for the realisation of dynamic reconfiguration in heterogeneous distributed systems. However, like other dynamic reconfiguration approaches, AO-middleware-based reconfiguration requires that the consistency of the system is maintained across reconfigurations. AO-middleware-based reconfiguration is an ongoing research topic and several consistency approaches have been proposed. However, most of these approaches tend to be targeted at specific contexts, whereas for distributed systems it is crucial to cover a wide range of operating conditions. In this paper we propose an approach that offers distributed, dynamic reconfiguration in a consistent manner, and features a flexible framework-based consistency management approach to cover a wide range of operating conditions. We evaluate our approach by investigating the configurability and transparency of our approach and also quantify the performance overheads of the associated consistency mechanisms.},
  language  = {en}
}
@article{HildebrandtDoellner2010,
  author    = {Hildebrandt, Dieter and D{\"o}llner, J{\"u}rgen},
  title     = {Service-oriented, standards-based 3D geovisualization : potential and challenges},
  issn      = {0198-9715},
  doi       = {10.1016/j.compenvurbsys.2010.05.003},
  year      = {2010},
  abstract  = {The application of the architectural concept of service-oriented architectures (SOA) in combination with open standards when building distributed, 3D geovisualization systems offers the potential to cover and take advantage of the opportunities and demands created by the rise of ubiquitous computer networks and the Internet as well as to overcome prevalent interoperability barriers. In this paper, based on a literature study and our own experiences, we discuss the potential and challenges that arise when building standards-based, distributed systems according to the SOA paradigm for 3D geovisualization, with a particular focus on 3D geovirtual environments and virtual 3D city models. First, we briefly introduce fundamentals of the SOA paradigm, identify requirements for service-oriented 3D geovisualization systems, and present an architectural framework that relates SOA concepts, geovisualization concepts, and standardization proposals by the Open Geospatial Consortium in a common frame of reference. Next, we discuss the potential and challenges driven by the SOA paradigm on four different levels of abstraction, namely service fundamentals, service composition, interaction services, performance, and overarching aspects, and we discuss those driven by standardization. We further exemplify and substantiate the discussion in the scope of a case study and the image-based provisioning of and interaction with visual representations of remote virtual 3D city models.},
  language  = {en}
}
@book{AlnemrPolyvyanyyAbuJarouretal.2010,
  author    = {Alnemr, Rehab and Polyvyanyy, Artem and AbuJarour, Mohammed and Appeltauer, Malte and Hildebrandt, Dieter and Thomas, Ivonne and Overdick, Hagen and Sch{\"o}bel, Michael and Uflacker, Matthias and Kluth, Stephan and Menzel, Michael and Schmidt, Alexander and Hagedorn, Benjamin and Pascalau, Emilian and Perscheid, Michael and Vogel, Thomas and Hentschel, Uwe and Feinbube, Frank and Kowark, Thomas and Tr{\"u}mper, Jonas and Vogel, Tobias and Becker, Basil},
  title     = {Proceedings of the 4th Ph.D. Retreat of the HPI Research School on Service-oriented Systems Engineering},
  editor    = {Meinel, Christoph and Plattner, Hasso and D{\"o}llner, J{\"u}rgen Roland Friedrich and Weske, Mathias and Polze, Andreas and Hirschfeld, Robert and Naumann, Felix and Giese, Holger},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-036-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-40838},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {Getr. Z{\"a}hlung},
  year      = {2010},
  language  = {en}
}
@book{OPUS4-4643,
  title     = {Dritter Deutscher IPv6 Gipfel 2010},
  editor    = {Meinel, Christoph and Sack, Harald},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-092-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-46134},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {112},
  year      = {2010},
  abstract  = {Am 24. und 25. Juni 2010 fand am Hasso-Plattner-Institut f{\"u}r Softwaresystemtechnik GmbH in Potsdam der 3. Deutsche IPv6 Gipfel 2010 statt, dessen Dokumentation der vorliegende technische Report dient. Als nationaler Arm des weltweiten IPv6-Forums f{\"o}rdert der Deutsche IPv6-Rat den {\"U}bergangsprozess zur neuen Internetgeneration und brachte in diesem Rahmen nationale und internationale Experten aus Wirtschaft, Wissenschaft und {\"o}ffentlicher Verwaltung zusammen, um Awareness f{\"u}r das Zukunftsthema IPv6 zu schaffen und um ein Resum{\´e} {\"u}ber die bislang erzielten Fortschritte zu ziehen. Die Grenzen des alten Internetprotokolls IPv4 sind in den vergangenen zwei Jahren deutlicher denn je zutage getreten. Waren im vergangenen Jahr anl{\"a}sslich des 2. IPv6 Gipfels noch 11\% aller zu vergebenden IPv4 Adressen verf{\"u}gbar, ist diese Zahl mittlerweile auf nur noch 6\% geschrumpft. Ehrengast war in diesem Jahr der „europ{\"a}ische Vater" des Internets, Prof. Peter T. Kirstein vom University College London, dessen Hauptvortrag von weiteren Beitr{\"a}gen hochrangiger Vertretern aus Politik, Wissenschaft und Wirtschaft erg{\"a}nzt wurde.},
  language  = {mul}
}
@book{MeyerSmirnovWeske2011,
  author    = {Meyer, Andreas and Smirnov, Sergey and Weske, Mathias},
  title     = {Data in business processes},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-144-8},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-53046},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {40},
  year      = {2011},
  abstract  = {Process and data are equally important for business process management. Process data is especially relevant in the context of automated business processes, process controlling, and representation of organizations' core assets. One can discover many process modeling languages, each having a specific set of data modeling capabilities and the level of data awareness. The level of data awareness and data modeling capabilities vary significantly from one language to another. This paper evaluates several process modeling languages with respect to the role of data. To find a common ground for comparison, we develop a framework, which systematically organizes process- and data-related aspects of the modeling languages elaborating on the data aspects. Once the framework is in place, we compare twelve process modeling languages against it. We generalize the results of the comparison and identify clusters of similar languages with respect to data awareness.},
  language  = {de}
}
@phdthesis{Kluth2011,
  author    = {Kluth, Stephan},
  title     = {Quantitative modeling and analysis with FMC-QE},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-52987},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {The modeling and evaluation calculus FMC-QE, the Fundamental Modeling Concepts for Quanti-tative Evaluation [1], extends the Fundamental Modeling Concepts (FMC) for performance modeling and prediction. In this new methodology, the hierarchical service requests are in the main focus, because they are the origin of every service provisioning process. Similar to physics, these service requests are a tuple of value and unit, which enables hierarchical service request transformations at the hierarchical borders and therefore the hierarchical modeling. Through reducing the model complexity of the models by decomposing the system in different hierarchical views, the distinction between operational and control states and the calculation of the performance values on the assumption of the steady state, FMC-QE has a scalable applica-bility on complex systems. According to FMC, the system is modeled in a 3-dimensional hierarchical representation space, where system performance parameters are described in three arbitrarily fine-grained hierarchi-cal bipartite diagrams. The hierarchical service request structures are modeled in Entity Relationship Diagrams. The static server structures, divided into logical and real servers, are de-scribed as Block Diagrams. The dynamic behavior and the control structures are specified as Petri Nets, more precisely Colored Time Augmented Petri Nets. From the structures and pa-rameters of the performance model, a hierarchical set of equations is derived. The calculation of the performance values is done on the assumption of stationary processes and is based on fundamental laws of the performance analysis: Little's Law and the Forced Traffic Flow Law. Little's Law is used within the different hierarchical levels (horizontal) and the Forced Traffic Flow Law is the key to the dependencies among the hierarchical levels (vertical). This calculation is suitable for complex models and allows a fast (re-)calculation of different performance scenarios in order to support development and configuration decisions. Within the Research Group Zorn at the Hasso Plattner Institute, the work is embedded in a broader research in the development of FMC-QE. While this work is concentrated on the theoretical background, description and definition of the methodology as well as the extension and validation of the applicability, other topics are in the development of an FMC-QE modeling and evaluation tool and the usage of FMC-QE in the design of an adaptive transport layer in order to fulfill Quality of Service and Service Level Agreements in volatile service based environments. This thesis contains a state-of-the-art, the description of FMC-QE as well as extensions of FMC-QE in representative general models and case studies. In the state-of-the-art part of the thesis in chapter 2, an overview on existing Queueing Theory and Time Augmented Petri Net models and other quantitative modeling and evaluation languages and methodologies is given. Also other hierarchical quantitative modeling frameworks will be considered. The description of FMC-QE in chapter 3 consists of a summary of the foundations of FMC-QE, basic definitions, the graphical notations, the FMC-QE Calculus and the modeling of open queueing networks as an introductory example. The extensions of FMC-QE in chapter 4 consist of the integration of the summation method in order to support the handling of closed networks and the modeling of multiclass and semaphore scenarios. Furthermore, FMC-QE is compared to other performance modeling and evaluation approaches. In the case study part in chapter 5, proof-of-concept examples, like the modeling of a service based search portal, a service based SAP NetWeaver application and the Axis2 Web service framework will be provided. Finally, conclusions are given by a summary of contributions and an outlook on future work in chapter 6. [1] Werner Zorn. FMC-QE - A New Approach in Quantitative Modeling. In Hamid R. Arabnia, editor, Procee-dings of the International Conference on Modeling, Simulation and Visualization Methods (MSV 2007) within WorldComp '07, pages 280 - 287, Las Vegas, NV, USA, June 2007. CSREA Press. ISBN 1-60132-029-9.},
  language  = {en}
}
@book{HauptMarrHirschfeld2011,
  author    = {Haupt, Michael and Marr, Stefan and Hirschfeld, Robert},
  title     = {CSOM/PL : a virtual machine product line},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-134-9},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-52332},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {26},
  year      = {2011},
  abstract  = {CSOM/PL is a software product line (SPL) derived from applying multi-dimensional separation of concerns (MDSOC) techniques to the domain of high-level language virtual machine (VM) implementations. For CSOM/PL, we modularised CSOM, a Smalltalk VM implemented in C, using VMADL (virtual machine architecture description language). Several features of the original CSOM were encapsulated in VMADL modules and composed in various combinations. In an evaluation of our approach, we show that applying MDSOC and SPL principles to a domain as complex as that of VMs is not only feasible but beneficial, as it improves understandability, maintainability, and configurability of VM implementations without harming performance.},
  language  = {en}
}
@article{RichterDoellner2011,
  author    = {Richter, Rico and D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Integrated real-time visualisation of massive 3D-Point clouds and geo-referenced textured dates},
  series = {Photogrammetrie, Fernerkundung, Geoinformation},
  journal   = {Photogrammetrie, Fernerkundung, Geoinformation},
  number    = {3},
  publisher = {Schweizerbart},
  address   = {Stuttgart},
  issn      = {1432-8364},
  pages     = {145 -- 154},
  year      = {2011},
  language  = {de}
}
@article{KuehneHuitemaCarle2011,
  author    = {K{\"u}hne, Ralph and Huitema, George and Carle, Georg},
  title     = {A simple distributed mechanism for accounting system self-configuration in next-generation charging and billing},
  series = {Computer communications},
  volume    = {34},
  journal   = {Computer communications},
  number    = {7},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0140-3664},
  doi       = {10.1016/j.comcom.2010.10.012},
  pages     = {898 -- 920},
  year      = {2011},
  abstract  = {Modern communication systems are becoming increasingly dynamic and complex. In this article a novel mechanism for next generation charging and billing is presented that enables self-configurability for accounting systems consisting of heterogeneous components. The mechanism is required to be simple, effective, efficient, scalable and fault-tolerant. Based on simulation results it is shown that the proposed simple distributed mechanism is competitive with usual cost-based or random mechanisms under realistic assumptions and up to non-extreme workload situations as well as fulfilling the posed requirements.},
  language  = {en}
}
@article{BogPlattnerZeier2011,
  author    = {Bog, Anja and Plattner, Hasso and Zeier, Alexander},
  title     = {A mixed transaction processing and operational reporting benchmark},
  series = {Information systems frontiers},
  volume    = {13},
  journal   = {Information systems frontiers},
  number    = {3},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {1387-3326},
  doi       = {10.1007/s10796-010-9283-8},
  pages     = {321 -- 335},
  year      = {2011},
  abstract  = {The importance of reporting is ever increasing in today's fast-paced market environments and the availability of up-to-date information for reporting has become indispensable. Current reporting systems are separated from the online transaction processing systems (OLTP) with periodic updates pushed in. A pre-defined and aggregated subset of the OLTP data, however, does not provide the flexibility, detail, and timeliness needed for today's operational reporting. As technology advances, this separation has to be re-evaluated and means to study and evaluate new trends in data storage management have to be provided. This article proposes a benchmark for combined OLTP and operational reporting, providing means to evaluate the performance of enterprise data management systems for mixed workloads of OLTP and operational reporting queries. Such systems offer up-to-date information and the flexibility of the entire data set for reporting. We describe how the benchmark provokes the conflicts that are the reason for separating the two workloads on different systems. In this article, we introduce the concepts, logical data schema, transactions and queries of the benchmark, which are entirely based on the original data sets and real workloads of existing, globally operating enterprises.},
  language  = {en}
}
@article{LinckeAppeltauerSteinertetal.2011,
  author    = {Lincke, Jens and Appeltauer, Malte and Steinert, Bastian and Hirschfeld, Robert},
  title     = {An open implementation for context-oriented layer composition in ContextJS},
  series = {Science of computer programming},
  volume    = {76},
  journal   = {Science of computer programming},
  number    = {12},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0167-6423},
  doi       = {10.1016/j.scico.2010.11.013},
  pages     = {1194 -- 1209},
  year      = {2011},
  abstract  = {Context-oriented programming (COP) provides dedicated support for defining and composing variations to a basic program behavior. A variation, which is defined within a layer, can be de-/activated for the dynamic extent of a code block. While this mechanism allows for control flow-specific scoping, expressing behavior adaptations can demand alternative scopes. For instance, adaptations can depend on dynamic object structure rather than control flow. We present scenarios for behavior adaptation and identify the need for new scoping mechanisms. The increasing number of scoping mechanisms calls for new language abstractions representing them. We suggest to open the implementation of scoping mechanisms so that developers can extend the COP language core according to their specific needs. Our open implementation moves layer composition into objects to be affected and with that closer to the method dispatch to be changed. We discuss the implementation of established COP scoping mechanisms using our approach and present new scoping mechanisms developed for our enhancements to Lively Kernel.},
  language  = {en}
}
@article{HenklerOberthuerGieseetal.2011,
  author    = {Henkler, Stefan and Oberthuer, Simon and Giese, Holger and Seibel, Andreas},
  title     = {Model-driven runtime resource predictions for advanced mechatronic systems with dynamic data structures},
  series = {Computer systems science and engineering},
  volume    = {26},
  journal   = {Computer systems science and engineering},
  number    = {6},
  publisher = {IOP Publ. Ltd.},
  address   = {Leicester},
  issn      = {0267-6192},
  pages     = {505 -- 518},
  year      = {2011},
  abstract  = {The next generation of advanced mechatronic systems is expected to enhance their functionality and improve their performance by context-dependent behavior. Therefore, these systems require to represent information about their complex environment and changing sets of collaboration partners internally. This requirement is in contrast to the usually assumed static structures of embedded systems. In this paper, we present a model-driven approach which overcomes this situation by supporting dynamic data structures while still guaranteeing that valid worst-case execution times can be derived. It supports a flexible resource manager which avoids to operate with the prohibitive coarse worst-case boundaries but instead supports to run applications in different profiles which guarantee different resource requirements and put unused resources in a profile at other applications' disposal. By supporting the proper estimation of worst case execution time (WCET) and worst case number of iteration (WCNI) at runtime, we can further support to create new profiles, add or remove them at runtime in order to minimize the over-approximation of the resource consumption resulting from the dynamic data structures required for the outlined class of advanced systems.},
  language  = {en}
}
@article{DeckerWeske2011,
  author    = {Decker, Gero and Weske, Mathias},
  title     = {Interaction-centric modeling of process choreographies},
  series = {Information systems},
  volume    = {36},
  journal   = {Information systems},
  number    = {2},
  publisher = {Elsevier},
  address   = {Oxford},
  issn      = {0306-4379},
  doi       = {10.1016/j.is.2010.06.005},
  pages     = {292 -- 312},
  year      = {2011},
  abstract  = {With the rise of electronic integration between organizations, the need for a precise specification of interaction behavior increases. Information systems, replacing interaction previously carried out by humans via phone, faxes and emails, require a precise specification for handling all possible situations. Such interaction behavior is described in process choreographies. While many proposals for choreography languages have already been made, most of them fall into the category of interconnection models, where the observable behavior of the different partners is described and then related via message flow. As this article will show, this modeling approach fails to support fundamental design principles of choreographies and typically leads to modeling errors. This motivates an alternative modeling style, namely interaction modeling, for overcoming these limitations. While the main concepts are independent of a concrete modeling language, iBPMN is introduced as novel interaction modeling language. Formal execution semantics are provided and a comprehensive toolset implementing the approach is presented.},
  language  = {en}
}
@article{AwadWeidlichWeske2011,
  author    = {Awad, Ahmed Mahmoud Hany Aly and Weidlich, Matthias and Weske, Mathias},
  title     = {Visually specifying compliance rules and explaining their violations for business processes},
  series = {Journal of visual languages and computing},
  volume    = {22},
  journal   = {Journal of visual languages and computing},
  number    = {1},
  publisher = {Elsevier},
  address   = {London},
  issn      = {1045-926X},
  doi       = {10.1016/j.jvlc.2010.11.002},
  pages     = {30 -- 55},
  year      = {2011},
  abstract  = {A business process is a set of steps designed to be executed in a certain order to achieve a business value. Such processes are often driven by and documented using process models. Nowadays, process models are also applied to drive process execution. Thus, correctness of business process models is a must. Much of the work has been devoted to check general, domain-independent correctness criteria, such as soundness. However, business processes must also adhere to and show compliance with various regulations and constraints, the so-called compliance requirements. These are domain-dependent requirements. In many situations, verifying compliance on a model level is of great value, since violations can be resolved in an early stage prior to execution. However, this calls for using formal verification techniques, e.g., model checking, that are too complex for business experts to apply. In this paper, we utilize a visual language. BPMN-Q to express compliance requirements visually in a way similar to that used by business experts to build process models. Still, using a pattern based approach, each BPMN-Qgraph has a formal temporal logic expression in computational tree logic (CTL). Moreover, the user is able to express constraints, i.e., compliance rules, regarding control flow and data flow aspects. In order to provide valuable feedback to a user in case of violations, we depend on temporal logic querying approaches as well as BPMN-Q to visually highlight paths in a process model whose execution causes violations.},
  language  = {en}
}
@article{WeidlichPolyvyanyyMendlingetal.2011,
  author    = {Weidlich, Matthias and Polyvyanyy, Artem and Mendling, Jan and Weske, Mathias},
  title     = {Causal behavioural profiles - efficient computation, applications, and evaluation},
  series = {Fundamenta informaticae},
  volume    = {113},
  journal   = {Fundamenta informaticae},
  number    = {3-4},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {0169-2968},
  doi       = {10.3233/FI-2011-614},
  pages     = {399 -- 435},
  year      = {2011},
  abstract  = {Analysis of behavioural consistency is an important aspect of software engineering. In process and service management, consistency verification of behavioural models has manifold applications. For instance, a business process model used as system specification and a corresponding workflow model used as implementation have to be consistent. Another example would be the analysis to what degree a process log of executed business operations is consistent with the corresponding normative process model. Typically, existing notions of behaviour equivalence, such as bisimulation and trace equivalence, are applied as consistency notions. Still, these notions are exponential in computation and yield a Boolean result. In many cases, however, a quantification of behavioural deviation is needed along with concepts to isolate the source of deviation. In this article, we propose causal behavioural profiles as the basis for a consistency notion. These profiles capture essential behavioural information, such as order, exclusiveness, and causality between pairs of activities of a process model. Consistency based on these profiles is weaker than trace equivalence, but can be computed efficiently for a broad class of models. In this article, we introduce techniques for the computation of causal behavioural profiles using structural decomposition techniques for sound free-choice workflow systems if unstructured net fragments are acyclic or can be traced back to S-or T-nets. We also elaborate on the findings of applying our technique to three industry model collections.},
  language  = {en}
}
@article{WeidlichPolyvyanyyDesaietal.2011,
  author    = {Weidlich, Matthias and Polyvyanyy, Artem and Desai, Nirmit and Mendling, Jan and Weske, Mathias},
  title     = {Process compliance analysis based on behavioural profiles},
  series = {Information systems},
  volume    = {36},
  journal   = {Information systems},
  number    = {7},
  publisher = {Elsevier},
  address   = {Oxford},
  issn      = {0306-4379},
  doi       = {10.1016/j.is.2011.04.002},
  pages     = {1009 -- 1025},
  year      = {2011},
  abstract  = {Process compliance measurement is getting increasing attention in companies due to stricter legal requirements and market pressure for operational excellence. In order to judge on compliance of the business processing, the degree of behavioural deviation of a case, i.e., an observed execution sequence, is quantified with respect to a process model (referred to as fitness, or recall). Recently, different compliance measures have been proposed. Still, nearly all of them are grounded on state-based techniques and the trace equivalence criterion, in particular. As a consequence, these approaches have to deal with the state explosion problem. In this paper, we argue that a behavioural abstraction may be leveraged to measure the compliance of a process log - a collection of cases. To this end, we utilise causal behavioural profiles that capture the behavioural characteristics of process models and cases, and can be computed efficiently. We propose different compliance measures based on these profiles, discuss the impact of noise in process logs on our measures, and show how diagnostic information on non-compliance is derived. As a validation, we report on findings of applying our approach in a case study with an international service provider.},
  language  = {en}
}
@article{LaueAwad2011,
  author    = {Laue, Ralf and Awad, Ahmed Mahmoud Hany Aly},
  title     = {Visual suggestions for improvements in business process diagrams},
  series = {Journal of visual languages and computing},
  volume    = {22},
  journal   = {Journal of visual languages and computing},
  number    = {5},
  publisher = {Elsevier},
  address   = {London},
  issn      = {1045-926X},
  doi       = {10.1016/j.jvlc.2011.04.003},
  pages     = {385 -- 399},
  year      = {2011},
  abstract  = {Business processes are commonly modeled using a graphical modeling language. The most widespread notation for this purpose is business process diagrams in the Business Process Modeling Notation (BPMN). In this article, we use the visual query language BPMN-Q for expressing patterns that are related to possible problems in such business process diagrams. We discuss two classes of problems that can be found frequently in real-world models: sequence flow errors and model fragments that can make the model difficult to understand. By using a query processor, a business process modeler is able to identify possible errors in business process diagrams. Moreover, the erroneous parts of the business process diagram can be highlighted when an instance of an error pattern is found. This way, the modeler gets an easy-to-understand feedback in the visual modeling language he or she is familiar with. This is an advantage over current validation methods, which usually lack this kind of intuitive feedback.},
  language  = {en}
}
@article{ProtzmannSchuenemannRadusch2011,
  author    = {Protzmann, Robert and Sch{\"u}nemann, Bjoern and Radusch, Ilja},
  title     = {The Influences of communication models on the simulated effectiveness of V2X Applications},
  series = {IEEE communications magazine},
  volume    = {49},
  journal   = {IEEE communications magazine},
  number    = {11},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {Piscataway},
  issn      = {0163-6804},
  pages     = {149 -- 155},
  year      = {2011},
  abstract  = {In this article, we aim to evaluate the influences of different propagation models on the results of V2X simulations. First, we analyze how the models free space propagation, Rayleigh fading, and Ricean fading in synthetic scenarios with and without background communication influence the simulation of communication in general. After that, we investigate the impact of the models on the simulated behavior of a V2X traffic efficiency application in a real inner city scenario. Our results show that the selection of the propagation model affects the number of delivered messages, but exerts no significant influence on the simulated effectiveness of a V2X traffic efficiency application in urban areas. Under those circumstances, a simplified propagation model is sufficient.},
  language  = {en}
}
@article{WistSchaeferVogleretal.2011,
  author    = {Wist, Dominic and Schaefer, Mark and Vogler, Walter and Wollowski, Ralf},
  title     = {Signal transition graph decomposition internal communication for speed independent circuit implementation},
  series = {IET Computers and digital techniques},
  volume    = {5},
  journal   = {IET Computers and digital techniques},
  number    = {6},
  publisher = {Institution of Engineering and Technology},
  address   = {Hertford},
  issn      = {1751-8601},
  doi       = {10.1049/iet-cdt.2010.0162},
  pages     = {440 -- 451},
  year      = {2011},
  abstract  = {Logic synthesis of speed independent circuits based on signal transition graph (STG) decomposition is a promising approach to tackle complexity problems like state-space explosion. Unfortunately, decomposition can result in components that in isolation have irreducible complete state coding conflicts. In earlier work, the authors showed how to resolve such conflicts by introducing internal communication between components, but only for very restricted specification structures. Here, they improve their former work by presenting algorithms for identifying delay transitions and inserting gyroscopes for specifications having a much more general structure. Thus, the authors are now able to synthesise controllers from real-life specifications. For all algorithms, they present correctness proofs and show their successful application to benchmarks, including very complex STGs arising in the context of control resynthesis.},
  language  = {en}
}
@phdthesis{Weidlich2011,
  author    = {Weidlich, Matthias},
  title     = {Behavioural profiles : a relational approach to behaviour consistency},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-55590},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Business Process Management (BPM) emerged as a means to control, analyse, and optimise business operations. Conceptual models are of central importance for BPM. Most prominently, process models define the behaviour that is performed to achieve a business value. In essence, a process model is a mapping of properties of the original business process to the model, created for a purpose. Different modelling purposes, therefore, result in different models of a business process. Against this background, the misalignment of process models often observed in the field of BPM is no surprise. Even if the same business scenario is considered, models created for strategic decision making differ in content significantly from models created for process automation. Despite their differences, process models that refer to the same business process should be consistent, i.e., free of contradictions. Apparently, there is a trade-off between strictness of a notion of consistency and appropriateness of process models serving different purposes. Existing work on consistency analysis builds upon behaviour equivalences and hierarchical refinements between process models. Hence, these approaches are computationally hard and do not offer the flexibility to gradually relax consistency requirements towards a certain setting. This thesis presents a framework for the analysis of behaviour consistency that takes a fundamentally different approach. As a first step, an alignment between corresponding elements of related process models is constructed. Then, this thesis conducts behavioural analysis grounded on a relational abstraction of the behaviour of a process model, its behavioural profile. Different variants of these profiles are proposed, along with efficient computation techniques for a broad class of process models. Using behavioural profiles, consistency of an alignment between process models is judged by different notions and measures. The consistency measures are also adjusted to assess conformance of process logs that capture the observed execution of a process. Further, this thesis proposes various complementary techniques to support consistency management. It elaborates on how to implement consistent change propagation between process models, addresses the exploration of behavioural commonalities and differences, and proposes a model synthesis for behavioural profiles.},
  language  = {en}
}
@phdthesis{Smirnov2011,
  author    = {Smirnov, Sergey},
  title     = {Business process model abstraction},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-60258},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Business process models are used within a range of organizational initiatives, where every stakeholder has a unique perspective on a process and demands the respective model. As a consequence, multiple process models capturing the very same business process coexist. Keeping such models in sync is a challenge within an ever changing business environment: once a process is changed, all its models have to be updated. Due to a large number of models and their complex relations, model maintenance becomes error-prone and expensive. Against this background, business process model abstraction emerged as an operation reducing the number of stored process models and facilitating model management. Business process model abstraction is an operation preserving essential process properties and leaving out insignificant details in order to retain information relevant for a particular purpose. Process model abstraction has been addressed by several researchers. The focus of their studies has been on particular use cases and model transformations supporting these use cases. This thesis systematically approaches the problem of business process model abstraction shaping the outcome into a framework. We investigate the current industry demand in abstraction summarizing it in a catalog of business process model abstraction use cases. The thesis focuses on one prominent use case where the user demands a model with coarse-grained activities and overall process ordering constraints. We develop model transformations that support this use case starting with the transformations based on process model structure analysis. Further, abstraction methods considering the semantics of process model elements are investigated. First, we suggest how semantically related activities can be discovered in process models-a barely researched challenge. The thesis validates the designed abstraction methods against sets of industrial process models and discusses the method implementation aspects. Second, we develop a novel model transformation, which combined with the related activity discovery allows flexible non-hierarchical abstraction. In this way this thesis advocates novel model transformations that facilitate business process model management and provides the foundations for innovative tool support.},
  language  = {en}
}
@book{OPUS4-5707,
  title     = {Web-based development in the lively kernel},
  editor    = {Lincke, Jens and Hirschfeld, Robert},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-160-8},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-55605},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {I, 55},
  year      = {2011},
  abstract  = {The World Wide Web as an application platform becomes increasingly important. However, the development of Web applications is often more complex than for the desktop. Web-based development environments like Lively Webwerkstatt can mitigate this problem by making the development process more interactive and direct. By moving the development environment into the Web, applications can be developed collaboratively in a Wiki-like manner. This report documents the results of the project seminar on Web-based Development Environments 2010. In this seminar, participants extended the Web-based development environment Lively Webwerkstatt. They worked in small teams on current research topics from the field of Web-development and tool support for programmers and implemented their results in the Webwerkstatt environment.},
  language  = {en}
}
@book{KleineHirschfeldBracha2011,
  author    = {Kleine, Matthias and Hirschfeld, Robert and Bracha, Gilad},
  title     = {An abstraction for version control systems},
  series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam},
  journal   = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam},
  number    = {54},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-158-5},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-55629},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {77},
  year      = {2011},
  abstract  = {Versionsverwaltungssysteme (VCS) erm{\"o}glichen es Entwicklern, {\"A}nderungen an Softwareartifakten zu verwalten. VCS werden mit Hilfe einer Vielzahl verschiedener Werkzeuge bedient, wie z.\,B. graphische Front-ends oder Kommandozeilenwerkzeuge. Es ist w{\"u}nschenswert mit einzelnen solcher Werkzeuge unterschiedliche VCS bedienen zu k{\"o}nnen. Bislang hat sich jedoch keine Abstraktion f{\"u}r Versionsverwaltungssysteme durchgesetzt, mit deren Hilfe solche Werkzeuge erstellt werden k{\"o}nnen. Stattdessen implementieren Werkzeuge zur Interaktion mit mehreren VCS ad-hoc L{\"o}sungen. Diese Masterarbeit stellt Pur vor, eine Abstraktion {\"u}ber Versionsverwaltungskonzepte. Mit Hilfe von Pur k{\"o}nnen Anwendungsprogramme entwickelt werden, die mit mehreren Versionsverwaltungssystemen interagieren k{\"o}nnen. Im Rahmen dieser Arbeit wird eine Implementierung dieser Abstraktion bereitgestellt und mit Hilfe eines Anwendungsprogramms validiert.},
  language  = {en}
}
@book{Luebbe2011,
  author    = {L{\"u}bbe, Alexander},
  title     = {The effect of tangible media on individuals in business process modeling : a controlled experiment = Der Einfluss greifbarer Medien auf einzelne Personen bei der Gesch{\"a}ftsprozessmodellierung : ein kontrolliertes Experiment},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-108-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49001},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {42},
  year      = {2011},
  abstract  = {In current practice, business processes modeling is done by trained method experts. Domain experts are interviewed to elicit their process information but not involved in modeling. We created a haptic toolkit for process modeling that can be used in process elicitation sessions with domain experts. We hypothesize that this leads to more effective process elicitation. This paper brakes down "effective elicitation" to 14 operationalized hypotheses. They are assessed in a controlled experiment using questionnaires, process model feedback tests and video analysis. The experiment compares our approach to structured interviews in a repeated measurement design. We executed the experiment with 17 student clerks from a trade school. They represent potential users of the tool. Six out of fourteen hypotheses showed significant difference due to the method applied. Subjects reported more fun and more insights into process modeling with tangible media. Video analysis showed significantly more reviews and corrections applied during process elicitation. Moreover, people take more time to talk and think about their processes. We conclude that tangible media creates a different working mode for people in process elicitation with fun, new insights and instant feedback on preliminary results.},
  language  = {en}
}
@phdthesis{Wist2011,
  author    = {Wist, Dominic},
  title     = {Attacking complexity in logic synthesis of asynchronous circuits},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-59706},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Most of the microelectronic circuits fabricated today are synchronous, i.e. they are driven by one or several clock signals. Synchronous circuit design faces several fundamental challenges such as high-speed clock distribution, integration of multiple cores operating at different clock rates, reduction of power consumption and dealing with voltage, temperature, manufacturing and runtime variations. Asynchronous or clockless design plays a key role in alleviating these challenges, however the design and test of asynchronous circuits is much more difficult in comparison to their synchronous counterparts. A driving force for a widespread use of asynchronous technology is the availability of mature EDA (Electronic Design Automation) tools which provide an entire automated design flow starting from an HDL (Hardware Description Language) specification yielding the final circuit layout. Even though there was much progress in developing such EDA tools for asynchronous circuit design during the last two decades, the maturity level as well as the acceptance of them is still not comparable with tools for synchronous circuit design. In particular, logic synthesis (which implies the application of Boolean minimisation techniques) for the entire system's control path can significantly improve the efficiency of the resulting asynchronous implementation, e.g. in terms of chip area and performance. However, logic synthesis, in particular for asynchronous circuits, suffers from complexity problems. Signal Transitions Graphs (STGs) are labelled Petri nets which are a widely used to specify the interface behaviour of speed independent (SI) circuits - a robust subclass of asynchronous circuits. STG decomposition is a promising approach to tackle complexity problems like state space explosion in logic synthesis of SI circuits. The (structural) decomposition of STGs is guided by a partition of the output signals and generates a usually much smaller component STG for each partition member, i.e. a component STG with a much smaller state space than the initial specification. However, decomposition can result in component STGs that in isolation have so-called irreducible CSC conflicts (i.e. these components are not SI synthesisable anymore) even if the specification has none of them. A new approach is presented to avoid such conflicts by introducing internal communication between the components. So far, STG decompositions are guided by the finest output partitions, i.e. one output per component. However, this might not yield optimal circuit implementations. Efficient heuristics are presented to determine coarser partitions leading to improved circuits in terms of chip area. For the new algorithms correctness proofs are given and their implementations are incorporated into the decomposition tool DESIJ. The presented techniques are successfully applied to some benchmarks - including 'real-life' specifications arising in the context of control resynthesis - which delivered promising results.},
  language  = {en}
}
@phdthesis{Lorenz2011,
  author    = {Lorenz, Haik},
  title     = {Texturierung und Visualisierung virtueller 3D-Stadtmodelle},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-53879},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Im Mittelpunkt dieser Arbeit stehen virtuelle 3D-Stadtmodelle, die Objekte, Ph{\"a}nomene und Prozesse in urbanen R{\"a}umen in digitaler Form repr{\"a}sentieren. Sie haben sich zu einem Kernthema von Geoinformationssystemen entwickelt und bilden einen zentralen Bestandteil geovirtueller 3D-Welten. Virtuelle 3D-Stadtmodelle finden nicht nur Verwendung als Mittel f{\"u}r Experten in Bereichen wie Stadtplanung, Funknetzplanung, oder L{\"a}rmanalyse, sondern auch f{\"u}r allgemeine Nutzer, die realit{\"a}tsnah dargestellte virtuelle St{\"a}dte in Bereichen wie B{\"u}rgerbeteiligung, Tourismus oder Unterhaltung nutzen und z. B. in Anwendungen wie GoogleEarth eine r{\"a}umliche Umgebung intuitiv erkunden und durch eigene 3D-Modelle oder zus{\"a}tzliche Informationen erweitern. Die Erzeugung und Darstellung virtueller 3D-Stadtmodelle besteht aus einer Vielzahl von Prozessschritten, von denen in der vorliegenden Arbeit zwei n{\"a}her betrachtet werden: Texturierung und Visualisierung. Im Bereich der Texturierung werden Konzepte und Verfahren zur automatischen Ableitung von Fototexturen aus georeferenzierten Schr{\"a}gluftbildern sowie zur Speicherung oberfl{\"a}chengebundener Daten in virtuellen 3D-Stadtmodellen entwickelt. Im Bereich der Visualisierung werden Konzepte und Verfahren f{\"u}r die multiperspektivische Darstellung sowie f{\"u}r die hochqualitative Darstellung nichtlinearer Projektionen virtueller 3D-Stadtmodelle in interaktiven Systemen vorgestellt. Die automatische Ableitung von Fototexturen aus georeferenzierten Schr{\"a}gluftbildern erm{\"o}glicht die Veredelung vorliegender virtueller 3D-Stadtmodelle. Schr{\"a}gluftbilder bieten sich zur Texturierung an, da sie einen Großteil der Oberfl{\"a}chen einer Stadt, insbesondere Geb{\"a}udefassaden, mit hoher Redundanz erfassen. Das Verfahren extrahiert aus dem verf{\"u}gbaren Bildmaterial alle Ansichten einer Oberfl{\"a}che und f{\"u}gt diese pixelpr{\"a}zise zu einer Textur zusammen. Durch Anwendung auf alle Oberfl{\"a}chen wird das virtuelle 3D-Stadtmodell fl{\"a}chendeckend texturiert. Der beschriebene Ansatz wurde am Beispiel des offiziellen Berliner 3D-Stadtmodells sowie der in GoogleEarth integrierten Innenstadt von M{\"u}nchen erprobt. Die Speicherung oberfl{\"a}chengebundener Daten, zu denen auch Texturen z{\"a}hlen, wurde im Kontext von CityGML, einem international standardisierten Datenmodell und Austauschformat f{\"u}r virtuelle 3D-Stadtmodelle, untersucht. Es wird ein Datenmodell auf Basis computergrafischer Konzepte entworfen und in den CityGML-Standard integriert. Dieses Datenmodell richtet sich dabei an praktischen Anwendungsf{\"a}llen aus und l{\"a}sst sich dom{\"a}nen{\"u}bergreifend verwenden. Die interaktive multiperspektivische Darstellung virtueller 3D-Stadtmodelle erg{\"a}nzt die gewohnte perspektivische Darstellung nahtlos um eine zweite Perspektive mit dem Ziel, den Informationsgehalt der Darstellung zu erh{\"o}hen. Diese Art der Darstellung ist durch die Panoramakarten von H. C. Berann inspiriert; Hauptproblem ist die {\"U}bertragung des multiperspektivischen Prinzips auf ein interaktives System. Die Arbeit stellt eine technische Umsetzung dieser Darstellung f{\"u}r 3D-Grafikhardware vor und demonstriert die Erweiterung von Vogel- und Fußg{\"a}ngerperspektive. Die hochqualitative Darstellung nichtlinearer Projektionen beschreibt deren Umsetzung auf 3D-Grafikhardware, wobei neben der Bildwiederholrate die Bildqualit{\"a}t das wesentliche Entwicklungskriterium ist. Insbesondere erlauben die beiden vorgestellten Verfahren, dynamische Geometrieverfeinerung und st{\"u}ckweise perspektivische Projektionen, die uneingeschr{\"a}nkte Nutzung aller hardwareseitig verf{\"u}gbaren, qualit{\"a}tssteigernden Funktionen wie z.~B. Bildraumgradienten oder anisotroper Texturfilterung. Beide Verfahren sind generisch und unterst{\"u}tzen verschiedene Projektionstypen. Sie erm{\"o}glichen die anpassungsfreie Verwendung g{\"a}ngiger computergrafischer Effekte wie Stilisierungsverfahren oder prozeduraler Texturen f{\"u}r nichtlineare Projektionen bei optimaler Bildqualit{\"a}t. Die vorliegende Arbeit beschreibt wesentliche Technologien f{\"u}r die Verarbeitung virtueller 3D-Stadtmodelle: Zum einen lassen sich mit den Ergebnissen der Arbeit Texturen f{\"u}r virtuelle 3D-Stadtmodelle automatisiert herstellen und als eigenst{\"a}ndige Attribute in das virtuelle 3D-Stadtmodell einf{\"u}gen. Somit tr{\"a}gt diese Arbeit dazu bei, die Herstellung und Fortf{\"u}hrung texturierter virtueller 3D-Stadtmodelle zu verbessern. Zum anderen zeigt die Arbeit Varianten und technische L{\"o}sungen f{\"u}r neuartige Projektionstypen f{\"u}r virtueller 3D-Stadtmodelle in interaktiven Visualisierungen. Solche nichtlinearen Projektionen stellen Schl{\"u}sselbausteine dar, um neuartige Benutzungsschnittstellen f{\"u}r und Interaktionsformen mit virtuellen 3D-Stadtmodellen zu erm{\"o}glichen, insbesondere f{\"u}r mobile Ger{\"a}te und immersive Umgebungen.},
  language  = {de}
}
@book{SmirnovZamaniFarahaniWeske2011,
  author    = {Smirnov, Sergey and Zamani Farahani, Armin and Weske, Mathias},
  title     = {State propagation in abstracted business processes},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-130-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51480},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {16},
  year      = {2011},
  abstract  = {Business process models are abstractions of concrete operational procedures that occur in the daily business of organizations. To cope with the complexity of these models, business process model abstraction has been introduced recently. Its goal is to derive from a detailed process model several abstract models that provide a high-level understanding of the process. While techniques for constructing abstract models are reported in the literature, little is known about the relationships between process instances and abstract models. In this paper we show how the state of an abstract activity can be calculated from the states of related, detailed process activities as they happen. The approach uses activity state propagation. With state uniqueness and state transition correctness we introduce formal properties that improve the understanding of state propagation. Algorithms to check these properties are devised. Finally, we use behavioral profiles to identify and classify behavioral inconsistencies in abstract process models that might occur, once activity state propagation is used.},
  language  = {en}
}
@book{NeuhausPolzeChowdhuryy2011,
  author    = {Neuhaus, Christian and Polze, Andreas and Chowdhuryy, Mohammad M. R.},
  title     = {Survey on healthcare IT systems : standards, regulations and security},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-128-8},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51463},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {53},
  year      = {2011},
  abstract  = {IT systems for healthcare are a complex and exciting field. One the one hand, there is a vast number of improvements and work alleviations that computers can bring to everyday healthcare. Some ways of treatment, diagnoses and organisational tasks were even made possible by computer usage in the first place. On the other hand, there are many factors that encumber computer usage and make development of IT systems for healthcare a challenging, sometimes even frustrating task. These factors are not solely technology-related, but just as well social or economical conditions. This report describes some of the idiosyncrasies of IT systems in the healthcare domain, with a special focus on legal regulations, standards and security.},
  language  = {en}
}
@book{AbedjanNaumann2011,
  author    = {Abedjan, Ziawasch and Naumann, Felix},
  title     = {Advancing the discovery of unique column combinations},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-148-6},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-53564},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {25},
  year      = {2011},
  abstract  = {Unique column combinations of a relational database table are sets of columns that contain only unique values. Discovering such combinations is a fundamental research problem and has many different data management and knowledge discovery applications. Existing discovery algorithms are either brute force or have a high memory load and can thus be applied only to small datasets or samples. In this paper, the wellknown GORDIAN algorithm and "Apriori-based" algorithms are compared and analyzed for further optimization. We greatly improve the Apriori algorithms through efficient candidate generation and statistics-based pruning methods. A hybrid solution HCAGORDIAN combines the advantages of GORDIAN and our new algorithm HCA, and it significantly outperforms all previous work in many situations.},
  language  = {en}
}
@book{OPUS4-4807,
  title     = {Proceedings of the Fall 2010 Future SOC Lab Day},
  editor    = {Meinel, Christoph and Polze, Andreas and Zeier, Alexander},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-114-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49761},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {ii, 75},
  year      = {2011},
  abstract  = {In Kooperation mit Partnern aus der Industrie etabliert das Hasso-Plattner-Institut (HPI) ein "HPI Future SOC Lab", das eine komplette Infrastruktur von hochkomplexen on-demand Systemen auf neuester, am Markt noch nicht verf{\"u}gbarer, massiv paralleler (multi-/many-core) Hardware mit enormen Hauptspeicherkapazit{\"a}ten und daf{\"u}r konzipierte Software bereitstellt. Das HPI Future SOC Lab verf{\"u}gt {\"u}ber prototypische 4- und 8-way Intel 64-Bit Serversysteme von Fujitsu und Hewlett-Packard mit 32- bzw. 64-Cores und 1 - 2 TB Hauptspeicher. Es kommen weiterhin hochperformante Speichersysteme von EMC² sowie Virtualisierungsl{\"o}sungen von VMware zum Einsatz. SAP stellt ihre neueste Business by Design (ByD) Software zur Verf{\"u}gung und auch komplexe reale Unternehmensdaten stehen zur Verf{\"u}gung, auf die f{\"u}r Forschungszwecke zugegriffen werden kann. Interessierte Wissenschaftler aus universit{\"a}ren und außeruniversit{\"a}ren Forschungsinstitutionen k{\"o}nnen im HPI Future SOC Lab zuk{\"u}nftige hoch-komplexe IT-Systeme untersuchen, neue Ideen / Datenstrukturen / Algorithmen entwickeln und bis hin zur praktischen Erprobung verfolgen. Dieser Technische Bericht stellt erste Ergebnisse der im Rahmen der Er{\"o}ffnung des Future SOC Labs im Juni 2010 gestarteten Forschungsprojekte vor. Ausgew{\"a}hlte Projekte stellten ihre Ergebnisse am 27. Oktober 2010 im Rahmen der Future SOC Lab Tag Veranstaltung vor.},
  language  = {en}
}
@book{MeinelThomasWarschofskyetal.2011,
  author    = {Meinel, Christoph and Thomas, Ivonne and Warschofsky, Robert and Menzel, Michael and Junker, Holger and Schwenk, J{\"o}rg and Roth, Volker and Peters, Jan and Raepple, Martin and St{\"o}rtkuhl, Thomas and Quint, Bruno and Kleinhenz, Michael and Wagner, Daniel},
  title     = {SOA Security 2010 : Symposium f{\"u}r Sicherheit in Service-orientierten Architekturen ; 28. / 29. Oktober 2010 am Hasso-Plattner-Institut},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-110-3},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49696},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {80},
  year      = {2011},
  abstract  = {"Forschung meets Business" - diese Kombination hat in den vergangenen Jahren immer wieder zu zahlreichen interessanten und fruchtbaren Diskussionen gef{\"u}hrt. Mit dem Symposium "Sicherheit in Service-orientierten Architekturen" f{\"u}hrt das Hasso-Plattner-Institut diese Tradition fort und lud alle Interessenten zu einem zweit{\"a}gigen Symposium nach Potsdam ein, um gemeinsam mit Fachvertretern aus der Forschung und Industrie {\"u}ber die aktuellen Entwicklungen im Bereich Sicherheit von SOA zu diskutieren. Die im Rahmen dieses Symposiums vorgestellten Beitr{\"a}ge fokussieren sich auf die Sicherheitsthemen "Sichere Digitale Identit{\"a}ten und Identit{\"a}tsmanagement", "Trust Management", "Modell-getriebene SOA-Sicherheit", "Datenschutz und Privatsph{\"a}re", "Sichere Enterprise SOA", und "Sichere IT-Infrastrukturen".},
  language  = {de}
}
@book{BoeddinghausMeinelSack2011,
  author    = {Boeddinghaus, Wilhelm and Meinel, Christoph and Sack, Harald},
  title     = {Einf{\"u}hrung von IPv6 in Unternehmensnetzen : ein Leitfaden},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-156-1},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-54582},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {51},
  year      = {2011},
  language  = {de}
}
@book{OPUS4-5053,
  title     = {Proceedings of the 5th Ph.D. Retreat of the HPI Research School on Service-oriented Systems Engineering},
  editor    = {Meinel, Christoph and Plattner, Hasso and D{\"o}llner, J{\"u}rgen Roland Friedrich and Weske, Mathias and Polze, Andreas and Hirschfeld, Robert and Naumann, Felix and Giese, Holger},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-129-5},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51472},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {II, 228},
  year      = {2011},
  language  = {en}
}
@phdthesis{Menzel2011,
  author    = {Menzel, Michael},
  title     = {Model-driven security in service-oriented architectures : leveraging security patterns to transform high-level security requirements to technical policies},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-59058},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Service-oriented Architectures (SOA) facilitate the provision and orchestration of business services to enable a faster adoption to changing business demands. Web Services provide a technical foundation to implement this paradigm on the basis of XML-messaging. However, the enhanced flexibility of message-based systems comes along with new threats and risks. To face these issues, a variety of security mechanisms and approaches is supported by the Web Service specifications. The usage of these security mechanisms and protocols is configured by stating security requirements in security policies. However, security policy languages for SOA are complex and difficult to create due to the expressiveness of these languages. To facilitate and simplify the creation of security policies, this thesis presents a model-driven approach that enables the generation of complex security policies on the basis of simple security intentions. SOA architects can specify these intentions in system design models and are not required to deal with complex technical security concepts. The approach introduced in this thesis enables the enhancement of any system design modelling languages - for example FMC or BPMN - with security modelling elements. The syntax, semantics, and notion of these elements is defined by our security modelling language SecureSOA. The metamodel of this language provides extension points to enable the integration into system design modelling languages. In particular, this thesis demonstrates the enhancement of FMC block diagrams with SecureSOA. To enable the model-driven generation of security policies, a domain-independent policy model is introduced in this thesis. This model provides an abstraction layer for security policies. Mappings are used to perform the transformation from our model to security policy languages. However, expert knowledge is required to generate instances of this model on the basis of simple security intentions. Appropriate security mechanisms, protocols and options must be chosen and combined to fulfil these security intentions. In this thesis, a formalised system of security patterns is used to represent this knowledge and to enable an automated transformation process. Moreover, a domain-specific language is introduced to state security patterns in an accessible way. On the basis of this language, a system of security configuration patterns is provided to transform security intentions related to data protection and identity management. The formal semantics of the security pattern language enable the verification of the transformation process introduced in this thesis and prove the correctness of the pattern application. Finally, our SOA Security LAB is presented that demonstrates the application of our model-driven approach to facilitate a dynamic creation, configuration, and execution of secure Web Service-based composed applications.},
  language  = {en}
}
@article{YeungNollGibbinsetal.2011,
  author    = {Yeung, Ching-man Au and Noll, Michael G. and Gibbins, Nicholas and Meinel, Christoph and Shadbolt, Nigel},
  title     = {Spear spamming-resistant expertise analysis and ranking incollaborative tagging systems},
  series = {Computational intelligence},
  volume    = {27},
  journal   = {Computational intelligence},
  number    = {3},
  publisher = {Wiley-Blackwell},
  address   = {Hoboken},
  issn      = {0824-7935},
  doi       = {10.1111/j.1467-8640.2011.00384.x},
  pages     = {458 -- 488},
  year      = {2011},
  abstract  = {In this article, we discuss the notions of experts and expertise in resource discovery in the context of collaborative tagging systems. We propose that the level of expertise of a user with respect to a particular topic is mainly determined by two factors. First, an expert should possess a high-quality collection of resources, while the quality of a Web resource in turn depends on the expertise of the users who have assigned tags to it, forming a mutual reinforcement relationship. Second, an expert should be one who tends to identify interesting or useful resources before other users discover them, thus bringing these resources to the attention of the community of users. We propose a graph-based algorithm, SPEAR (spamming-resistant expertise analysis and ranking), which implements the above ideas for ranking users in a folksonomy. Our experiments show that our assumptions on expertise in resource discovery, and SPEAR as an implementation of these ideas, allow us to promote experts and demote spammers at the same time, with performance significantly better than the original hypertext-induced topic search algorithm and simple statistical measures currently used in most collaborative tagging systems.},
  language  = {en}
}
@phdthesis{Wang2011,
  author    = {Wang, Long},
  title     = {X-tracking the usage interest on web sites},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51077},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {The exponential expanding of the numbers of web sites and Internet users makes WWW the most important global information resource. From information publishing and electronic commerce to entertainment and social networking, the Web allows an inexpensive and efficient access to the services provided by individuals and institutions. The basic units for distributing these services are the web sites scattered throughout the world. However, the extreme fragility of web services and content, the high competence between similar services supplied by different sites, and the wide geographic distributions of the web users drive the urgent requirement from the web managers to track and understand the usage interest of their web customers. This thesis, "X-tracking the Usage Interest on Web Sites", aims to fulfill this requirement. "X" stands two meanings: one is that the usage interest differs from various web sites, and the other is that usage interest is depicted from multi aspects: internal and external, structural and conceptual, objective and subjective. "Tracking" shows that our concentration is on locating and measuring the differences and changes among usage patterns. This thesis presents the methodologies on discovering usage interest on three kinds of web sites: the public information portal site, e-learning site that provides kinds of streaming lectures and social site that supplies the public discussions on IT issues. On different sites, we concentrate on different issues related with mining usage interest. The educational information portal sites were the first implementation scenarios on discovering usage patterns and optimizing the organization of web services. In such cases, the usage patterns are modeled as frequent page sets, navigation paths, navigation structures or graphs. However, a necessary requirement is to rebuild the individual behaviors from usage history. We give a systematic study on how to rebuild individual behaviors. Besides, this thesis shows a new strategy on building content clusters based on pair browsing retrieved from usage logs. The difference between such clusters and the original web structure displays the distance between the destinations from usage side and the expectations from design side. Moreover, we study the problem on tracking the changes of usage patterns in their life cycles. The changes are described from internal side integrating conceptual and structure features, and from external side for the physical features; and described from local side measuring the difference between two time spans, and global side showing the change tendency along the life cycle. A platform, Web-Cares, is developed to discover the usage interest, to measure the difference between usage interest and site expectation and to track the changes of usage patterns. E-learning site provides the teaching materials such as slides, recorded lecture videos and exercise sheets. We focus on discovering the learning interest on streaming lectures, such as real medias, mp4 and flash clips. Compared to the information portal site, the usage on streaming lectures encapsulates the variables such as viewing time and actions during learning processes. The learning interest is discovered in the form of answering 6 questions, which covers finding the relations between pieces of lectures and the preference among different forms of lectures. We prefer on detecting the changes of learning interest on the same course from different semesters. The differences on the content and structure between two courses leverage the changes on the learning interest. We give an algorithm on measuring the difference on learning interest integrated with similarity comparison between courses. A search engine, TASK-Moniminer, is created to help the teacher query the learning interest on their streaming lectures on tele-TASK site. Social site acts as an online community attracting web users to discuss the common topics and share their interesting information. Compared to the public information portal site and e-learning web site, the rich interactions among users and web content bring the wider range of content quality, on the other hand, provide more possibilities to express and model usage interest. We propose a framework on finding and recommending high reputation articles in a social site. We observed that the reputation is classified into global and local categories; the quality of the articles having high reputation is related with the content features. Based on these observations, our framework is implemented firstly by finding the articles having global or local reputation, and secondly clustering articles based on their content relations, and then the articles are selected and recommended from each cluster based on their reputation ranks.},
  language  = {en}
}
@book{MeinelWillemsRoschkeetal.2011,
  author    = {Meinel, Christoph and Willems, Christian and Roschke, Sebastian and Schnjakin, Maxim},
  title     = {Virtualisierung und Cloud Computing : Konzepte, Technologiestudie, Markt{\"u}bersicht},
  isbn      = {978-3-86956-113-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49708},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Virtualisierung und Cloud Computing geh{\"o}ren derzeit zu den wichtigsten Schlagworten f{\"u}r Betreiber von IT Infrastrukturen. Es gibt eine Vielzahl unterschiedlicher Technologien, Produkte und Gesch{\"a}ftsmodelle f{\"u}r vollkommen verschiedene Anwendungsszenarien. Die vorliegende Studie gibt zun{\"a}chst einen detaillierten {\"U}berblick {\"u}ber aktuelle Entwicklungen in Konzepten und Technologien der Virtualisierungstechnologie - von klassischer Servervirtualisierung {\"u}ber Infrastrukturen f{\"u}r virtuelle Arbeitspl{\"a}tze bis zur Anwendungsvirtualisierung und macht den Versuch einer Klassifikation der Virtualisierungsvarianten. Bei der Betrachtung des Cloud Computing-Konzepts werden deren Grundz{\"u}ge sowie verschiedene Architekturvarianten und Anwendungsf{\"a}lle eingef{\"u}hrt. Die ausf{\"u}hrliche Untersuchung von Vorteilen des Cloud Computing sowie m{\"o}glicher Bedenken, die bei der Nutzung von Cloud-Ressourcen im Unternehmen beachtet werden m{\"u}ssen, zeigt, dass Cloud Computing zwar große Chancen bietet, aber nicht f{\"u}r jede Anwendung und nicht f{\"u}r jeden rechtlichen und wirtschaftlichen Rahmen in Frage kommt.. Die anschließende Markt{\"u}bersicht f{\"u}r Virtualisierungstechnologie zeigt, dass die großen Hersteller - Citrix, Microsoft und VMware - jeweils Produkte f{\"u}r fast alle Virtualisierungsvarianten anbieten und hebt entscheidende Unterschiede bzw. die St{\"a}rken der jeweiligen Anbieter heraus. So ist beispielsweise die L{\"o}sung von Citrix f{\"u}r Virtual Desktop Infrastructures sehr ausgereift, w{\"a}hrend Microsoft hier nur auf Standardtechnologie zur{\"u}ckgreifen kann. VMware hat als Marktf{\"u}hrer die gr{\"o}ßte Verbreitung in Rechenzentren gefunden und bietet als einziger Hersteller echte Fehlertoleranz. Microsoft hingegen punktet mit der nahtlosen Integration ihrer Virtualisierungsprodukte in bestehende Windows-Infrastrukturen. Im Bereich der Cloud Computing-Systeme zeigen sich einige quelloffene Softwareprojekte, die durchaus f{\"u}r den produktiven Betrieb von sogenannten privaten Clouds geeignet sind.},
  language  = {de}
}
@book{DraisbachNaumannSzottetal.2012,
  author    = {Draisbach, Uwe and Naumann, Felix and Szott, Sascha and Wonneberg, Oliver},
  title     = {Adaptive windows for duplicate detection},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-143-1},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-53007},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {41},
  year      = {2012},
  abstract  = {Duplicate detection is the task of identifying all groups of records within a data set that represent the same real-world entity, respectively. This task is difficult, because (i) representations might differ slightly, so some similarity measure must be defined to compare pairs of records and (ii) data sets might have a high volume making a pair-wise comparison of all records infeasible. To tackle the second problem, many algorithms have been suggested that partition the data set and compare all record pairs only within each partition. One well-known such approach is the Sorted Neighborhood Method (SNM), which sorts the data according to some key and then advances a window over the data comparing only records that appear within the same window. We propose several variations of SNM that have in common a varying window size and advancement. The general intuition of such adaptive windows is that there might be regions of high similarity suggesting a larger window size and regions of lower similarity suggesting a smaller window size. We propose and thoroughly evaluate several adaption strategies, some of which are provably better than the original SNM in terms of efficiency (same results with fewer comparisons).},
  language  = {en}
}
@book{PlattnerZeier2012,
  author    = {Plattner, Hasso and Zeier, Alexander},
  title     = {In-Memory Data Management},
  publisher = {Springer},
  address   = {Wiesbaden},
  isbn      = {978-3-8349-4378-1},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {200},
  year      = {2012},
  abstract  = {Nach 50 Jahren erfolgreicher Entwicklunghat die Business-IT einen neuenWendepunkt erreicht. Hier zeigen die Autoren erstmalig, wieIn-Memory Computing dieUnternehmensprozesse k{\"u}nftig ver{\"a}ndern wird. Bisher wurden Unternehmensdaten aus Performance-Gr{\"u}nden auf verschiedene Datenbanken verteilt: Analytische Datenresidieren in Data Warehouses und werden regelm{\"a}ßig mithilfe transaktionaler Systeme synchronisiert. Diese Aufspaltung macht flexibles Echtzeit-Reporting aktueller Daten unm{\"o}glich. Doch dank leistungsf{\"a}higerMulti-Core-CPUs, großer Hauptspeicher, Cloud Computing und immerbesserer mobiler Endger{\"a}te lassen die Unternehmen dieses restriktive Modell zunehmend hinter sich. Die Autoren stellen Techniken vor, die eine analytische und transaktionale Verarbeitung in Echtzeit erlauben und so dem Gesch{\"a}ftsleben neue Wege bahnen.},
  language  = {de}
}
@book{KrauseGiese2012,
  author    = {Krause, Christian and Giese, Holger},
  title     = {Quantitative modeling and analysis of service-oriented real-time systems using interval probabilistic timed automata},
  publisher = {Universit{\"a}tsverlah Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-171-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-57845},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {45},
  year      = {2012},
  abstract  = {One of the key challenges in service-oriented systems engineering is the prediction and assurance of non-functional properties, such as the reliability and the availability of composite interorganizational services. Such systems are often characterized by a variety of inherent uncertainties, which must be addressed in the modeling and the analysis approach. The different relevant types of uncertainties can be categorized into (1) epistemic uncertainties due to incomplete knowledge and (2) randomization as explicitly used in protocols or as a result of physical processes. In this report, we study a probabilistic timed model which allows us to quantitatively reason about nonfunctional properties for a restricted class of service-oriented real-time systems using formal methods. To properly motivate the choice for the used approach, we devise a requirements catalogue for the modeling and the analysis of probabilistic real-time systems with uncertainties and provide evidence that the uncertainties of type (1) and (2) in the targeted systems have a major impact on the used models and require distinguished analysis approaches. The formal model we use in this report are Interval Probabilistic Timed Automata (IPTA). Based on the outlined requirements, we give evidence that this model provides both enough expressiveness for a realistic and modular specifiation of the targeted class of systems, and suitable formal methods for analyzing properties, such as safety and reliability properties in a quantitative manner. As technical means for the quantitative analysis, we build on probabilistic model checking, specifically on probabilistic time-bounded reachability analysis and computation of expected reachability rewards and costs. To carry out the quantitative analysis using probabilistic model checking, we developed an extension of the Prism tool for modeling and analyzing IPTA. Our extension of Prism introduces a means for modeling probabilistic uncertainty in the form of probability intervals, as required for IPTA. For analyzing IPTA, our Prism extension moreover adds support for probabilistic reachability checking and computation of expected rewards and costs. We discuss the performance of our extended version of Prism and compare the interval-based IPTA approach to models with fixed probabilities.},
  language  = {en}
}
@book{GieseHildebrandtNeumannetal.2012,
  author    = {Giese, Holger and Hildebrandt, Stephan and Neumann, Stefan and W{\"a}tzoldt, Sebastian},
  title     = {Industrial case study on the integration of SysML and AUTOSAR with triple graph grammars},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-191-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-60184},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {vi, 51},
  year      = {2012},
  abstract  = {During the overall development of complex engineering systems different modeling notations are employed. For example, in the domain of automotive systems system engineering models are employed quite early to capture the requirements and basic structuring of the entire system, while software engineering models are used later on to describe the concrete software architecture. Each model helps in addressing the specific design issue with appropriate notations and at a suitable level of abstraction. However, when we step forward from system design to the software design, the engineers have to ensure that all decisions captured in the system design model are correctly transferred to the software engineering model. Even worse, when changes occur later on in either model, today the consistency has to be reestablished in a cumbersome manual step. In this report, we present in an extended version of [Holger Giese, Stefan Neumann, and Stephan Hildebrandt. Model Synchronization at Work: Keeping SysML and AUTOSAR Models Consistent. In Gregor Engels, Claus Lewerentz, Wilhelm Sch{\"a}fer, Andy Sch{\"u}rr, and B. Westfechtel, editors, Graph Transformations and Model Driven Enginering - Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday, volume 5765 of Lecture Notes in Computer Science, pages 555-579. Springer Berlin / Heidelberg, 2010.] how model synchronization and consistency rules can be applied to automate this task and ensure that the different models are kept consistent. We also introduce a general approach for model synchronization. Besides synchronization, the approach consists of tool adapters as well as consistency rules covering the overlap between the synchronized parts of a model and the rest. We present the model synchronization algorithm based on triple graph grammars in detail and further exemplify the general approach by means of a model synchronization solution between system engineering models in SysML and software engineering models in AUTOSAR which has been developed for an industrial partner. In the appendix as extension to [19] the meta-models and all TGG rules for the SysML to AUTOSAR model synchronization are documented.},
  language  = {en}
}
@article{SemmoHildebrandtTrappetal.2012,
  author    = {Semmo, Amir and Hildebrandt, Dieter and Trapp, Matthias and D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Concepts for cartography-oriented visualization of virtual 3D city models},
  series = {Photogrammetrie, Fernerkundung, Geoinformation},
  journal   = {Photogrammetrie, Fernerkundung, Geoinformation},
  number    = {4},
  publisher = {Schweizerbart},
  address   = {Stuttgart},
  issn      = {1432-8364},
  doi       = {10.1127/1432-8364/2012/0131},
  pages     = {455 -- 465},
  year      = {2012},
  abstract  = {Virtual 3D city models serve as an effective medium with manifold applications in geoinformation systems and services. To date, most 3D city models are visualized using photorealistic graphics. But an effective communication of geoinformation significantly depends on how important information is designed and cognitively processed in the given application context. One possibility to visually emphasize important information is based on non-photorealistic rendering, which comprehends artistic depiction styles and is characterized by its expressiveness and communication aspects. However, a direct application of non-photorealistic rendering techniques primarily results in monotonic visualization that lacks cartographic design aspects. In this work, we present concepts for cartography-oriented visualization of virtual 3D city models. These are based on coupling non-photorealistic rendering techniques and semantics-based information for a user, context, and media-dependent representation of thematic information. This work highlights challenges for cartography-oriented visualization of 3D geovirtual environments, presents stylization techniques and discusses their applications and ideas for a standardized visualization. In particular, the presented concepts enable a real-time and dynamic visualization of thematic geoinformation.},
  language  = {en}
}
@article{SemmoTrappKyprianidisetal.2012,
  author    = {Semmo, Amir and Trapp, Matthias and Kyprianidis, Jan Eric and D{\"o}llner, J{\"u}rgen Roland Friedrich},
  title     = {Interactive visualization of generalized virtual 3D city models using level-of-abstraction transitions},
  series = {Computer graphics forum : journal of the European Association for Computer Graphics},
  volume    = {31},
  journal   = {Computer graphics forum : journal of the European Association for Computer Graphics},
  number    = {3},
  publisher = {Wiley-Blackwell},
  address   = {Hoboken},
  issn      = {0167-7055},
  doi       = {10.1111/j.1467-8659.2012.03081.x},
  pages     = {885 -- 894},
  year      = {2012},
  abstract  = {Virtual 3D city models play an important role in the communication of complex geospatial information in a growing number of applications, such as urban planning, navigation, tourist information, and disaster management. In general, homogeneous graphic styles are used for visualization. For instance, photorealism is suitable for detailed presentations, and non-photorealism or abstract stylization is used to facilitate guidance of a viewer's gaze to prioritized information. However, to adapt visualization to different contexts and contents and to support saliency-guided visualization based on user interaction or dynamically changing thematic information, a combination of different graphic styles is necessary. Design and implementation of such combined graphic styles pose a number of challenges, specifically from the perspective of real-time 3D visualization. In this paper, the authors present a concept and an implementation of a system that enables different presentation styles, their seamless integration within a single view, and parametrized transitions between them, which are defined according to tasks, camera view, and image resolution. The paper outlines potential usage scenarios and application fields together with a performance evaluation of the implementation.},
  language  = {en}
}
@article{HirschfeldPerscheidHaupt2012,
  author    = {Hirschfeld, Robert and Perscheid, Michael and Haupt, Michael},
  title     = {Explicit use-case representation in object-oriented programming languages},
  series = {ACM SIGPLAN notices},
  volume    = {47},
  journal   = {ACM SIGPLAN notices},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {0362-1340},
  doi       = {10.1145/2168696.2047856},
  pages     = {51 -- 60},
  year      = {2012},
  abstract  = {Use-cases are considered an integral part of most contemporary development processes since they describe a software system's expected behavior from the perspective of its prospective users. However, the presence of and traceability to use-cases is increasingly lost in later more code-centric development activities. Use-cases, being well-encapsulated at the level of requirements descriptions, eventually lead to crosscutting concerns in system design and source code. Tracing which parts of the system contribute to which use-cases is therefore hard and so limits understandability. In this paper, we propose an approach to making use-cases first-class entities in both the programming language and the runtime environment. Having use-cases present in the code and the running system will allow developers, maintainers, and operators to easily associate their units of work with what matters to the users. We suggest the combination of use-cases, acceptance tests, and dynamic analysis to automatically associate source code with use-cases. We present UseCasePy, an implementation of our approach to use-case-centered development in Python, and its application to the Django Web framework.},
  language  = {en}
}