@book{SchneiderLambersOrejas2019,
  author    = {Schneider, Sven and Lambers, Leen and Orejas, Fernando},
  title     = {A logic-based incremental approach to graph repair},
  number    = {126},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-462-3},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-42751},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-427517},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {34},
  year      = {2019},
  abstract  = {Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.},
  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{NastanskyMehnertStrohe2014,
  author    = {Nastansky, Andreas and Mehnert, Alexander and Strohe, Hans Gerhard},
  title     = {A vector error correction model for the relationship between public debt and inflation in Germany},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-50246},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2014},
  abstract  = {In the paper, the interaction between public debt and inflation including mutual impulse response will be analysed. The European sovereign debt crisis brought once again the focus on the consequences of public debt in combination with an expansive monetary policy for the development of consumer prices. Public deficits can lead to inflation if the money supply is expansive. The high level of national debt, not only in the Euro-crisis countries, and the strong increase in total assets of the European Central Bank, as a result of the unconventional monetary policy, caused fears on inflating national debt. The transmission from public debt to inflation through money supply and long-term interest rate will be shown in the paper. Based on these theoretical thoughts, the variables public debt, consumer price index, money supply m3 and long-term interest rate will be analysed within a vector error correction model estimated by Johansen approach. In the empirical part of the article, quarterly data for Germany from 1991 by 2010 are to be examined.},
  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{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{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{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{Xhindi2013,
  author    = {Xhindi, Nevila},
  title     = {Albania towards a sustainable regional development},
  series = {Praxis Kultur- und Sozialgeographie | PKS},
  journal   = {Praxis Kultur- und Sozialgeographie | PKS},
  number    = {56},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-223-0},
  issn      = {0934-716X},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-62691},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {As Albania is accelerating its preparations towards the European Union candidate status, numerous areas of public policy and practices undergo intensive development processes. Regional development policy is a very new area of public policy in Albania, and needs research and development. This study focuses on the process of sustainable development in Albania, by analyzing and comparing the regional development of regions of Tirana, Shkodra and Kukes. The methodology used consists of a literature/desk review; analytical and comparative approach; qualitative interviews; quantitative data collection; analysis. The research is organized in five chapters. First chapter provides an overview of the study framework. The second outlines the theory and scientific framework for sustainable and regional development in relation with geography. The third chapter presents the picture of the regional development in Albania, analyzing the disparities and regional development in the light of EU requirements and NUTS division. Chapter 4 continues by analyzing and comparing the regional development of the regions: Tirana - driver for change, Shkodra - the North in Development and Kukes - the "shrinking" region. Chapter 5 presents the conclusions and recommendations. This research comes to the conclusions that if growth in Albania is to be increased and sustained, a regional development policy needs to be established.},
  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{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{BaltzerHradilakPfennigschmidtetal.2021,
  author    = {Baltzer, Wanda and Hradilak, Theresa and Pfennigschmidt, Lara and Prestin, Luc Maurice and Spranger, Moritz and Stadlinger, Simon and Wendt, Leo and Lincke, Jens and Rein, Patrick and Church, Luke and Hirschfeld, Robert},
  title     = {An individual-centered approach to visualize people's opinions and demographic information},
  number    = {136},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-504-0},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-49145},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-491457},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {326},
  year      = {2021},
  abstract  = {The noble way to substantiate decisions that affect many people is to ask these people for their opinions. For governments that run whole countries, this means asking all citizens for their views to consider their situations and needs. Organizations such as Africa's Voices Foundation, who want to facilitate communication between decision-makers and citizens of a country, have difficulty mediating between these groups. To enable understanding, statements need to be summarized and visualized. Accomplishing these goals in a way that does justice to the citizens' voices and situations proves challenging. Standard charts do not help this cause as they fail to create empathy for the people behind their graphical abstractions. Furthermore, these charts do not create trust in the data they are representing as there is no way to see or navigate back to the underlying code and the original data. To fulfill these functions, visualizations would highly benefit from interactions to explore the displayed data, which standard charts often only limitedly provide. To help improve the understanding of people's voices, we developed and categorized 80 ideas for new visualizations, new interactions, and better connections between different charts, which we present in this report. From those ideas, we implemented 10 prototypes and two systems that integrate different visualizations. We show that this integration allows consistent appearance and behavior of visualizations. The visualizations all share the same main concept: representing each individual with a single dot. To realize this idea, we discuss technologies that efficiently allow the rendering of a large number of these dots. With these visualizations, direct interactions with representations of individuals are achievable by clicking on them or by dragging a selection around them. This direct interaction is only possible with a bidirectional connection from the visualization to the data it displays. We discuss different strategies for bidirectional mappings and the trade-offs involved. Having unified behavior across visualizations enhances exploration. For our prototypes, that includes grouping, filtering, highlighting, and coloring of dots. Our prototyping work was enabled by the development environment Lively4. We explain which parts of Lively4 facilitated our prototyping process. Finally, we evaluate our approach to domain problems and our developed visualization concepts. Our work provides inspiration and a starting point for visualization development in this domain. Our visualizations can improve communication between citizens and their government and motivate empathetic decisions. Our approach, combining low-level entities to create visualizations, provides value to an explorative and empathetic workflow. We show that the design space for visualizing this kind of data has a lot of potential and that it is possible to combine qualitative and quantitative approaches to data analysis.},
  language  = {en}
}
@book{Pilipenko2014,
  author    = {Pilipenko, Andrey},
  title     = {An introduction to stochastic differential equations with reflection},
  series = {Lectures in pure and applied mathematics},
  journal   = {Lectures in pure and applied mathematics},
  number    = {1},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-297-1},
  issn      = {2199-4951},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-70782},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {ix, 75},
  year      = {2014},
  abstract  = {These lecture notes are intended as a short introduction to diffusion processes on a domain with a reflecting boundary for graduate students, researchers in stochastic analysis and interested readers. Specific results on stochastic differential equations with reflecting boundaries such as existence and uniqueness, continuity and Markov properties, relation to partial differential equations and submartingale problems are given. An extensive list of references to current literature is included. This book has its origins in a mini-course the author gave at the University of Potsdam and at the Technical University of Berlin in Winter 2013.},
  language  = {en}
}
@book{VanHalVanLoonMercelisetal.2023,
  author    = {Van Hal, Toon and Van Loon, Zanna and Mercelis, Wouter and Steckley, John and Peetermans, Andy and Van Rooy, Raf and Dionne, Fannie},
  title     = {Anchored in ink},
  editor    = {Van Loon, Zanna and Steckley, John and Van Hal, Toon and Peetermans, Andy},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-516-3},
  doi       = {10.25932/publishup-51306},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-513062},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {448},
  year      = {2023},
  abstract  = {This book serves as a gateway to the Elementa grammaticae Huronicae, an eighteenth-century grammar of the Wendat ('Huron') language by Jesuit Pierre-Philippe Potier (1708-1781). The volume falls into three main parts. The first part introduces the grammar and some of its contexts, offering information about the Huron-Wendat and Wyandot, the early modern Jesuit mission in New France and the Jesuits' linguistic output. The heart of the volume is made up by its second part, a text edition of the Elementa. The third part presents some avenues of research by way of specific case studies.},
  language  = {en}
}
@book{KunzeStrohe2010,
  author    = {Kunze, Karl-Kuno and Strohe, Hans Gerhard},
  title     = {Antipersistence in German stock returns},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-45582},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Persistence of stock returns is an extensively studied and discussed theme in the analysis of financial markets. Antipersistence is usually attributed to volatilities. However, not only volatilities but also stock returns can exhibit antipersistence. Antipersistent noise has a somewhat rougher appearance than Gaussian noise. Heuristically spoken, price movements are more likely followed by movements in the opposite direction than in the same direction. The pertaining integrated process exhibits a smaller range - prices seem to stay in the vicinity of the initial value. We apply a widely used test based upon the modified R/S-Method by Lo [1991] to daily returns of 21 German stocks from 1960 to 2008. Combining this test with the concept of moving windows by Carbone et al. [2004], we are able to determine periods of antipersistence for some of the series under examination. Our results suggest that antipersistence can be found for stocks and periods where extraordinary corporate actions such as mergers \& acquisitions or financial distress are present. These effects should be properly accounted for when choosing and designing models for inference.},
  language  = {en}
}
@book{OPUS4-724,
  title     = {Approaches and findings in oral, written and gestural language},
  editor    = {Dipper, Stefanie and G{\"o}tze, Michael and Stede, Manfred},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1866-4725},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-8255},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {244},
  year      = {2005},
  abstract  = {Der vorliegende dritte Band der Serie "Interdisciplinary Studies on Information Structure" enth{\"a}lt sieben Beitr{\"a}ge aus verschiedenen Projekten des Sonderforschungsbereiches "Informationsstruktur: Die sprachlichen Mittel der Gliederung von {\"A}ußerung, Satz und Text" (SFB 632). Der Titel "Approaches and Findings in Oral, Written and Gestural Language" reflektiert die Bandbreite der Untersuchungen zum Thema Informationsstruktur. In ihrem Artikel hinterfragt Elke Kasimir die Zuverl{\"a}ssigkeit des sog. Frage-Antwort-Tests zur Bestimmung des fokussierten Elementes in S{\"a}tzen. Ihr alternativer L{\"o}sungsvorschlag wird in dem Kommentar von Thomas Weskott kritisch diskutiert. Der Artikel von Paul Elbourne befasst sich mit Ph{\"a}nomenen der Ellipse und bietet eine neue semantische Analyse an. Spezielle morphologisch stark markierte Fokuskonstruktionen aus f{\"u}nf verschiedenen afrikanischen Sprachen der Gur- und Kwa-Sprachgruppe werden von Ines Fiedler und Anne Schwarz analysiert und diachronisch interpretiert. Ebenfalls sprachhistorisch ausgerichtet ist der Artikel von Roland Hinterh{\"o}lzl, Svetlana Petrova und Michael Solf, die Belege f{\"u}r die Interaktion von Wortstellung und Informationsstruktur bereits in der althochdeutschen Tatian-{\"U}bersetzung fanden. Anke Sennema, Ruben van de Vijver, Susanne E. Carroll und Anne Zimmer-Stahl diskutieren anhand einer Serie von Experimenten die Nutzung von Prosodie, Wortl{\"a}nge und -Stellung f{\"u}r die semantischen Interpretation in der Erst- und Zweitsprache. Die besondere Rolle von Gestik in Verbindung mit Intonation f{\"u}r die Strukturierung des sprachlichen Diskurses wird von Stefanie Jannedy und Norma Mendoza-Denton hervorgehoben.},
  language  = {en}
}
@book{OPUS4-2806,
  title     = {Armenia : a human rights perspective for peace and democracy; human rights, human rights education and minorities},
  editor    = {Mihr, Anja and Mkrtichyan, Artur and Mahler, Claudia and Toivanen, Reetta},
  isbn      = {978-3-937786-66-7},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29740},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2005},
  abstract  = {I. Human Rights and Democratic Movements in Armenia - Human Rights as an "Attractor" of Europeanization Processes of Transcaucasian "Neither War nor Peace Societies" (Artur Mkrtichyan) - Human Rights Defender's Office Armenia (Larisa Alaverdyan) - The Factor of Human Rights Protection as Criteria for the Development in the Social System (Hovhannes Hovhannisyan) - Two Priorities and Two Suggestions in Leading the Way to Human Rights Protection (Gevork Manoukian) - Intrastate Mechanisms of the Protection of Human Political Rights and Freedoms in Armenia (Ashot A. Alexanyan) - The Future of Democracy in Armenia: Institutional and Mass Beliefs Perspectives (Alexander Markarov) II. Human Rights and Education in Armenia - Human Rights in the System of Civic Education Values (Valery Poghosyan) - The Role of Academic Knowledge in Maintaining Tolerance (Ani Muradyan) - Rights of a Child or Duties of Adults...? (Mira Antonyan) - The Right to Education for Children with Special Needs: Inclusive Education in Armenia (Marina Hovhannissyan) - Human Rights Awareness and UNDP Evaluation in Armenia (Kristina Henschen) - Human Rights Education in Armenia - A Base Line Study (Litit Umroyan; Lucig Danielian) III. Human Rights and Minorities in Armenia - Human Rights, Minorities and Human Rights Education in Armenia: An External Perspective (Claudia Mahler; Anja Mihr; Reetta Toivanen) - Minorities and Identity in Armenia (Tatevik Margaryan) - Legal and Real Opportunities for the National Minorities Residing on the Territory of the Republic of Armenia (Hranush Kharatyan)},
  language  = {en}
}
@book{Taneja2007,
  author    = {Taneja, Preti},
  title     = {Assimilation, exodus, eradication},
  publisher = {Minority Rights Group International},
  address   = {London},
  isbn      = {1-904584-60-8},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-bbdig-87},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {40},
  year      = {2007},
  language  = {en}
}
@book{DyckGieseLambers2017,
  author    = {Dyck, Johannes and Giese, Holger and Lambers, Leen},
  title     = {Automatic verification of behavior preservation at the transformation level for relational model transformation},
  number    = {112},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-391-6},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-100279},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {viii, 112},
  year      = {2017},
  abstract  = {The correctness of model transformations is a crucial element for model-driven engineering of high quality software. In particular, behavior preservation is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of behavioral equivalence or refinement between source and target model of the transformation. Both kinds of behavior preservation verification goals have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic verification approach available at the transformation level, i.e. for all source and target models specified by the model transformation. In this report, we extend our results presented in [27] and outline a new sophisticated approach for the automatic verification of behavior preservation captured by bisimulation resp. simulation for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invariant checking for graph transformation and that the resulting checking problem can be addressed by our own invariant checker even for a complex example where a sequence chart is transformed into communicating automata. We further discuss today's limitations of invariant checking for graph transformation and motivate further lines of future work in this direction.},
  language  = {en}
}
@book{FelgentreffBorningHirschfeld2013,
  author    = {Felgentreff, Tim and Borning, Alan and Hirschfeld, Robert},
  title     = {Babelsberg : specifying and solving constraints on object behavior},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-265-0},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-67296},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {53},
  year      = {2013},
  abstract  = {Constraints allow developers to specify desired properties of systems in a number of domains, and have those properties be maintained automatically. This results in compact, declarative code, avoiding scattered code to check and imperatively re-satisfy invariants. Despite these advantages, constraint programming is not yet widespread, with standard imperative programming still the norm. There is a long history of research on integrating constraint programming with the imperative paradigm. However, this integration typically does not unify the constructs for encapsulation and abstraction from both paradigms. This impedes re-use of modules, as client code written in one paradigm can only use modules written to support that paradigm. Modules require redundant definitions if they are to be used in both paradigms. We present a language - Babelsberg - that unifies the constructs for en- capsulation and abstraction by using only object-oriented method definitions for both declarative and imperative code. Our prototype - Babelsberg/R - is an extension to Ruby, and continues to support Ruby's object-oriented se- mantics. It allows programmers to add constraints to existing Ruby programs in incremental steps by placing them on the results of normal object-oriented message sends. It is implemented by modifying a state-of-the-art Ruby virtual machine. The performance of standard object-oriented code without con- straints is only modestly impacted, with typically less than 10\% overhead compared with the unmodified virtual machine. Furthermore, our architec- ture for adding multiple constraint solvers allows Babelsberg to deal with constraints in a variety of domains. We argue that our approach provides a useful step toward making con- straint solving a generic tool for object-oriented programmers. We also provide example applications, written in our Ruby-based implementation, which use constraints in a variety of application domains, including interactive graphics, circuit simulations, data streaming with both hard and soft constraints on performance, and configuration file Management.},
  language  = {en}
}
@book{FelgentreffHirschfeldMillsteinetal.2015,
  author    = {Felgentreff, Tim and Hirschfeld, Robert and Millstein, Todd and Borning, Alan},
  title     = {Babelsberg/RML},
  number    = {103},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-348-0},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-83826},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {68},
  year      = {2015},
  abstract  = {New programming language designs are often evaluated on concrete implementations. However, in order to draw conclusions about the language design from the evaluation of concrete programming languages, these implementations need to be verified against the formalism of the design. To that end, we also have to ensure that the design actually meets its stated goals. A useful tool for the latter has been to create an executable semantics from a formalism that can execute a test suite of examples. However, this mechanism so far did not allow to verify an implementation against the design. Babelsberg is a new design for a family of object-constraint languages. Recently, we have developed a formal semantics to clarify some issues in the design of those languages. Supplementing this work, we report here on how this formalism is turned into an executable operational semantics using the RML system. Furthermore, we show how we extended the executable semantics to create a framework that can generate test suites for the concrete Babelsberg implementations that provide traceability from the design to the language. Finally, we discuss how these test suites helped us find and correct mistakes in the Babelsberg implementation for JavaScript.},
  language  = {en}
}
@book{OPUS4-4172,
  title     = {Baset - Bubastis - Tell Basta},
  series = {Arcus: Berichte aus Arch{\"a}ologie, Baugeschichte und Nachbargebieten},
  journal   = {Arcus: Berichte aus Arch{\"a}ologie, Baugeschichte und Nachbargebieten},
  number    = {9},
  editor    = {Tietze, Christian and Lange, Eva},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {3-937786-55-4},
  issn      = {0947-1081},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-43783},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {107},
  year      = {2005},
  language  = {en}
}
@book{OPUS4-4066,
  title     = {Baset - Bubastis - Tell Basta},
  series = {Arcus: Berichte aus Arch{\"a}ologie, Baugeschichte und Nachbargebieten},
  journal   = {Arcus: Berichte aus Arch{\"a}ologie, Baugeschichte und Nachbargebieten},
  number    = {8},
  editor    = {Tietze, Christian and Lange, Eva},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-937786-31-5},
  issn      = {0947-1081},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-42682},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {201},
  year      = {2005},
  abstract  = {Inhalt: Habachi, Labib: Tell Basta Chapter 1: Introductory: Bubatis and its monuments Chapter II: The temple of Pepi I [I]: Description Chapter III: The temple of Pepi [III]: Finds and importance Chapter IV: General notes on the great temple [I]: Mihos temple and entrance hall Chapter V: General notes on the great temple [II]: Festival hall and hypostyle hall Chapter VI: General notes on the great temple [III]: The temple of Nektanebos (Nekht-har-hebi) Chapter VII: Work outside the temples Chapter VIII: Blocks transferred to Bubastis Chapter IX: Blocks removed from Bubastis Farid, Shafik: Preliminary report on the excavations of the antiquities department at Tell Basta},
  language  = {en}
}
@book{MeinelGayvoronskayaSchnjakin2018,
  author    = {Meinel, Christoph and Gayvoronskaya, Tatiana and Schnjakin, Maxim},
  title     = {Blockchain},
  number    = {124},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-441-8},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-414525},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {102},
  year      = {2018},
  abstract  = {The term blockchain has recently become a buzzword, but only few know what exactly lies behind this approach. According to a survey, issued in the first quarter of 2017, the term is only known by 35 percent of German medium-sized enterprise representatives. However, the blockchain technology is very interesting for the mass media because of its rapid development and global capturing of different markets. For example, many see blockchain technology either as an all-purpose weapon— which only a few have access to—or as a hacker technology for secret deals in the darknet. The innovation of blockchain technology is found in its successful combination of already existing approaches: such as decentralized networks, cryptography, and consensus models. This innovative concept makes it possible to exchange values in a decentralized system. At the same time, there is no requirement for trust between its nodes (e.g. users). With this study the Hasso Plattner Institute would like to help readers form their own opinion about blockchain technology, and to distinguish between truly innovative properties and hype. The authors of the present study analyze the positive and negative properties of the blockchain architecture and suggest possible solutions, which can contribute to the efficient use of the technology. We recommend that every company define a clear target for the intended application, which is achievable with a reasonable cost-benefit ration, before deciding on this technology. Both the possibilities and the limitations of blockchain technology need to be considered. The relevant steps that must be taken in this respect are summarized /summed up for the reader in this study. Furthermore, this study elaborates on urgent problems such as the scalability of the blockchain, appropriate consensus algorithm and security, including various types of possible attacks and their countermeasures. New blockchains, for example, run the risk of reducing security, as changes to existing technology can lead to lacks in the security and failures. After discussing the innovative properties and problems of the blockchain technology, its implementation is discussed. There are a lot of implementation opportunities for companies available who are interested in the blockchain realization. The numerous applications have either their own blockchain as a basis or use existing and widespread blockchain systems. Various consortia and projects offer "blockchain-as-a-service{\"a}nd help other companies to develop, test and deploy their own applications. This study gives a detailed overview of diverse relevant applications and projects in the field of blockchain technology. As this technology is still a relatively young and fast developing approach, it still lacks uniform standards to allow the cooperation of different systems and to which all developers can adhere. Currently, developers are orienting themselves to Bitcoin, Ethereum and Hyperledger systems, which serve as the basis for many other blockchain applications. The goal is to give readers a clear and comprehensive overview of blockchain technology and its capabilities.},
  language  = {en}
}
@book{Dambacher2010,
  author    = {Dambacher, Michael},
  title     = {Bottom-up and top-down processes in reading : influences of frequency and predictability on event-related potentials and eye movements},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-059-5},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-42024},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {239},
  year      = {2010},
  abstract  = {In reading, word frequency is commonly regarded as the major bottom-up determinant for the speed of lexical access. Moreover, language processing depends on top-down information, such as the predictability of a word from a previous context. Yet, however, the exact role of top-down predictions in visual word recognition is poorly understood: They may rapidly affect lexical processes, or alternatively, influence only late post-lexical stages. To add evidence about the nature of top-down processes and their relation to bottom-up information in the timeline of word recognition, we examined influences of frequency and predictability on event-related potentials (ERPs) in several sentence reading studies. The results were related to eye movements from natural reading as well as to models of word recognition. As a first and major finding, interactions of frequency and predictability on ERP amplitudes consistently revealed top-down influences on lexical levels of word processing (Chapters 2 and 4). Second, frequency and predictability mediated relations between N400 amplitudes and fixation durations, pointing to their sensitivity to a common stage of word recognition; further, larger N400 amplitudes entailed longer fixation durations on the next word, a result providing evidence for ongoing processing beyond a fixation (Chapter 3). Third, influences of presentation rate on ERP frequency and predictability effects demonstrated that the time available for word processing critically co-determines the course of bottom-up and top-down influences (Chapter 4). Fourth, at a near-normal reading speed, an early predictability effect suggested the rapid comparison of top-down hypotheses with the actual visual input (Chapter 5). The present results are compatible with interactive models of word recognition assuming that early lexical processes depend on the concerted impact of bottom-up and top-down information. We offered a framework that reconciles the findings on a timeline of word recognition taking into account influences of frequency, predictability, and presentation rate (Chapter 4).},
  language  = {en}
}
@book{EidSabbaghHeweltWeske2013,
  author    = {Eid-Sabbagh, Rami-Habib and Hewelt, Marcin and Weske, Mathias},
  title     = {Business process architectures with multiplicities : transformation and correctness},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-257-5},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-66780},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {18},
  year      = {2013},
  abstract  = {Business processes are instrumental to manage work in organisations. To study the interdependencies between business processes, Business Process Architectures have been introduced. These express trigger and message ow relations between business processes. When we investigate real world Business Process Architectures, we find complex interdependencies, involving multiple process instances. These aspects have not been studied in detail so far, especially concerning correctness properties. In this paper, we propose a modular transformation of BPAs to open nets for the analysis of behavior involving multiple business processes with multiplicities. For this purpose we introduce intermediary nets to portray semantics of multiplicity specifications. We evaluate our approach on a use case from the public sector.},
  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}
}
@book{SchwalbKruegerPlattner2013,
  author    = {Schwalb, David and Kr{\"u}ger, Jens and Plattner, Hasso},
  title     = {Cache conscious column organization in in-memory column stores},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-228-5},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-63890},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {v, 84},
  year      = {2013},
  abstract  = {Cost models are an essential part of database systems, as they are the basis of query performance optimization. Based on predictions made by cost models, the fastest query execution plan can be chosen and executed or algorithms can be tuned and optimised. In-memory databases shifts the focus from disk to main memory accesses and CPU costs, compared to disk based systems where input and output costs dominate the overall costs and other processing costs are often neglected. However, modelling memory accesses is fundamentally different and common models do not apply anymore. This work presents a detailed parameter evaluation for the plan operators scan with equality selection, scan with range selection, positional lookup and insert in in-memory column stores. Based on this evaluation, a cost model based on cache misses for estimating the runtime of the considered plan operators using different data structures is developed. Considered are uncompressed columns, bit compressed and dictionary encoded columns with sorted and unsorted dictionaries. Furthermore, tree indices on the columns and dictionaries are discussed. Finally, partitioned columns consisting of one partition with a sorted and one with an unsorted dictionary are investigated. New values are inserted in the unsorted dictionary partition and moved periodically by a merge process to the sorted partition. An efficient attribute merge algorithm is described, supporting the update performance required to run enterprise applications on read-optimised databases. Further, a memory traffic based cost model for the merge process is provided.},
  language  = {en}
}
@book{Petersen2004,
  author    = {Petersen, Hans-Georg},
  title     = {Capital flight and capital income taxation},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-8969},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2004},
  abstract  = {Contents: Problems of Traditional Income and Profit Taxation -Basic Principles -Consequences of the Existing Traditional Tax and Transfer Schemes -Avalanche Effects -Cumulative Effects -Arbitrary Companies Taxation The Last Resort: Easy Tax},
  language  = {en}
}
@book{Huber2011,
  author    = {Huber, Stefan},
  title     = {Citizens participation in Latvia : still a long road to go?},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49715},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {On the 20.01.1991 the Latvian people defended the Latvian political elite from the Soviet OMON troops in order to achieve independence. After this impressive sign of civil society the people fell asleep, the level of mobility and the satisfaction with the functioning of democracy therefore is rather weak. The referendum (2008), to gain the right to dissolve the Parliament by the people, initiated by the Trade Unions can be assessed as a sign that there is something on the move. This paper is trying to give an impression of the situation of the civil society in terms of participation in the decision- making process. Hereby the focus lays on NGOs: What is the legal base and which problems do they face. To learn more about the situation interviews were organized with representatives of NGOs from different sectors like community development; Social inclusion; advocating gender issues as well as environment and sustainable development. As a result of the research it can be said that the civil society made some steps forward but it is still struggling with a high level of corruption, lack of interested from the elite and the ordinary people and the insecure financial state.},
  language  = {en}
}
@book{OPUS4-6813,
  title     = {Cloud security mechanisms},
  number    = {87},
  editor    = {Neuhaus, Christian and Polze, Andreas},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-281-0},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-68168},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {78},
  year      = {2014},
  abstract  = {Cloud computing has brought great benefits in cost and flexibility for provisioning services. The greatest challenge of cloud computing remains however the question of security. The current standard tools in access control mechanisms and cryptography can only partly solve the security challenges of cloud infrastructures. In the recent years of research in security and cryptography, novel mechanisms, protocols and algorithms have emerged that offer new ways to create secure services atop cloud infrastructures. This report provides introductions to a selection of security mechanisms that were part of the "Cloud Security Mechanisms" seminar in summer term 2013 at HPI.},
  language  = {en}
}
@book{MaximovaSchneiderGiese2020,
  author    = {Maximova, Maria and Schneider, Sven and Giese, Holger},
  title     = {Compositional analysis of probabilistic timed graph transformation systems},
  number    = {133},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-501-9},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-49013},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-490131},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {53},
  year      = {2020},
  abstract  = {The analysis of behavioral models is of high importance for cyber-physical systems, as the systems often encompass complex behavior based on e.g. concurrent components with mutual exclusion or probabilistic failures on demand. The rule-based formalism of probabilistic timed graph transformation systems is a suitable choice when the models representing states of the system can be understood as graphs and timed and probabilistic behavior is important. However, model checking PTGTSs is limited to systems with rather small state spaces. We present an approach for the analysis of large scale systems modeled as probabilistic timed graph transformation systems by systematically decomposing their state spaces into manageable fragments. To obtain qualitative and quantitative analysis results for a large scale system, we verify that results obtained for its fragments serve as overapproximations for the corresponding results of the large scale system. Hence, our approach allows for the detection of violations of qualitative and quantitative safety properties for the large scale system under analysis. We consider a running example in which we model shuttles driving on tracks of a large scale topology and for which we verify that shuttles never collide and are unlikely to execute emergency brakes. In our evaluation, we apply an implementation of our approach to the running example.},
  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{Weikard1997,
  author    = {Weikard, Hans-Peter},
  title     = {Contractarian approaches to intergenerational justice},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-8529},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {1997},
  abstract  = {In modern political philosophy social contract theory is the most prominent approach to individual rights and fair institutions. According to social contract theory the system of rights in a society ought to be justified by reconstructing its basic features as a contract between the mutually unconcerned members of society. This paper explores whether social contract theory can successfully be applied to justify rights of future generations. Three competing views are analysed: Rawls's theory of justice, Hobbes's radical liberalism and Gauthier's bargaining framework based on the Lockean proviso.},
  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{BauckmannAbedjanLeseretal.2012,
  author    = {Bauckmann, Jana and Abedjan, Ziawasch and Leser, Ulf and M{\"u}ller, Heiko and Naumann, Felix},
  title     = {Covering or complete? : Discovering conditional inclusion dependencies},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-212-4},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-62089},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {34},
  year      = {2012},
  abstract  = {Data dependencies, or integrity constraints, are used to improve the quality of a database schema, to optimize queries, and to ensure consistency in a database. In the last years conditional dependencies have been introduced to analyze and improve data quality. In short, a conditional dependency is a dependency with a limited scope defined by conditions over one or more attributes. Only the matching part of the instance must adhere to the dependency. In this paper we focus on conditional inclusion dependencies (CINDs). We generalize the definition of CINDs, distinguishing covering and completeness conditions. We present a new use case for such CINDs showing their value for solving complex data quality tasks. Further, we define quality measures for conditions inspired by precision and recall. We propose efficient algorithms that identify covering and completeness conditions conforming to given quality thresholds. Our algorithms choose not only the condition values but also the condition attributes automatically. Finally, we show that our approach efficiently provides meaningful and helpful results for our use case.},
  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}
}
@book{BeckerGiese2012,
  author    = {Becker, Basil and Giese, Holger},
  title     = {Cyber-physical systems with dynamic structure : towards modeling and verification of inductive invariants},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-217-9},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-62437},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {iv, 27},
  year      = {2012},
  abstract  = {Cyber-physical systems achieve sophisticated system behavior exploring the tight interconnection of physical coupling present in classical engineering systems and information technology based coupling. A particular challenging case are systems where these cyber-physical systems are formed ad hoc according to the specific local topology, the available networking capabilities, and the goals and constraints of the subsystems captured by the information processing part. In this paper we present a formalism that permits to model the sketched class of cyber-physical systems. The ad hoc formation of tightly coupled subsystems of arbitrary size are specified using a UML-based graph transformation system approach. Differential equations are employed to define the resulting tightly coupled behavior. Together, both form hybrid graph transformation systems where the graph transformation rules define the discrete steps where the topology or modes may change, while the differential equations capture the continuous behavior in between such discrete changes. In addition, we demonstrate that automated analysis techniques known for timed graph transformation systems for inductive invariants can be extended to also cover the hybrid case for an expressive case of hybrid models where the formed tightly coupled subsystems are restricted to smaller local networks.},
  language  = {en}
}
@book{BartzKrestel2021,
  author    = {Bartz, Christian and Krestel, Ralf},
  title     = {Deep learning for computer vision in the art domain},
  number    = {139},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-514-9},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-51290},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-512906},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {vii, 79},
  year      = {2021},
  abstract  = {In recent years, computer vision algorithms based on machine learning have seen rapid development. In the past, research mostly focused on solving computer vision problems such as image classification or object detection on images displaying natural scenes. Nowadays other fields such as the field of cultural heritage, where an abundance of data is available, also get into the focus of research. In the line of current research endeavours, we collaborated with the Getty Research Institute which provided us with a challenging dataset, containing images of paintings and drawings. In this technical report, we present the results of the seminar "Deep Learning for Computer Vision". In this seminar, students of the Hasso Plattner Institute evaluated state-of-the-art approaches for image classification, object detection and image recognition on the dataset of the Getty Research Institute. The main challenge when applying modern computer vision methods to the available data is the availability of annotated training data, as the dataset provided by the Getty Research Institute does not contain a sufficient amount of annotated samples for the training of deep neural networks. However, throughout the report we show that it is possible to achieve satisfying to very good results, when using further publicly available datasets, such as the WikiArt dataset, for the training of machine learning models.},
  language  = {en}
}
@book{GerkenUebernickeldePaula2022,
  author    = {Gerken, Stefanie and Uebernickel, Falk and de Paula, Danielly},
  title     = {Design Thinking: a Global Study on Implementation Practices in Organizations},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-525-5},
  doi       = {10.25932/publishup-53466},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-534668},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {230},
  year      = {2022},
  abstract  = {These days design thinking is no longer a "new approach". Among practitioners, as well as academics, interest in the topic has gathered pace over the last two decades. However, opinions are divided over the longevity of the phenomenon: whether design thinking is merely "old wine in new bottles," a passing trend, or still evolving as it is being spread to an increasing number of organizations and industries. Despite its growing relevance and the diffusion of design thinking, knowledge on the actual status quo in organizations remains scarce. With a new study, the research team of Prof. Uebernickel and Stefanie Gerken investigates temporal developments and changes in design thinking practices in organizations over the past six years comparing the results of the 2015 "Parts without a whole" study with current practices and future developments. Companies of all sizes and from different parts of the world participated in the survey. The findings from qualitative interviews with experts, i.e., people who have years of knowledge with design thinking, were cross-checked with the results from an exploratory analysis of the survey data. This analysis uncovers significant variances and similarities in how design thinking is interpreted and applied in businesses.},
  language  = {en}
}
@book{HebigGieseBatoulisetal.2015,
  author    = {Hebig, Regina and Giese, Holger and Batoulis, Kimon and Langer, Philipp and Zamani Farahani, Armin and Yao, Gary and Wolowyk, Mychajlo},
  title     = {Development of AUTOSAR standard documents at Carmeq GmbH},
  number    = {92},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-317-6},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-71535},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {52},
  year      = {2015},
  abstract  = {This report documents the captured MDE history of Carmeq GmbH, in context of the project Evolution of MDE Settings in Practice. The goal of the project is the elicitation of MDE approaches and their evolution.},
  language  = {en}
}
@book{OPUS4-3980,
  title     = {Die Einf{\"u}hrung des "Neuen Steuerungsmodells" im Landkreis Potsdam-Mittelmark : Chancen und Probleme unter besonderer Ber{\"u}cksichtigung von Personalfragen},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-30036},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {1996},
  abstract  = {Inhalt: 1. Einleitung 1.1. Forschungsziele 1.2. Arbeitsmethodik 1.3. Aufbau der Pilotstudie 2. Kommunale Verwaltungsreform in Brandenburg 3. Die Kreisverwaltung Potsdam-Mittelmark 3.1. Der Landkreis Potsdam-Mittelmark 3.2. Das Personal der Kreisverwaltung 3.3. Verbeamtungskonzept 3.4. Folgen der Kreisgebietsreform 3.5. Gleichstellungsfragen 4. Verwaltungsreform im Landkreis Potsdam-Mittelmark 4.1. Zum Reformansatz 4.2. Weitere Reformschritte 4.3. Ziele der Reform 4.4. Leitbilddiskussion 4.5. Mitarbeiter und Reform 4.6. Personalrat und Reform 4.7. {\"O}TV und Reform 5. Personalfragen bei der Verwaltungsreform im Landkreis Potsdam-Mittelmark 5.1. Defizite im Personalbereich 5.2. Zur Arbeitsmotivation der Mitarbeiter in der Kreisverwaltung 5.3. Elemente des modernen Personalmanagements 5.4. Instrumente in der Personalarbeit - 5.4.1. Mitarbeiterbefragung - 5.4.2. Weiterbildung - 5.4.2. Weiterbildung 6. Ergebnisse der Pilotstudie 6.1. Besonderheiten der Verwaltungsreform in den neuen Bundesl{\"a}ndern am Beispiel Potsdam-Mittelmark 6.2. Zwischenbilanz zur Umsetzung der Modernisierungskonzeption 6.3. Vorschl{\"a}ge f{\"u}r die Fortsetzung des Projekts},
  language  = {en}
}
@book{MeinelGalbasHageboelling2023,
  author    = {Meinel, Christoph and Galbas, Michael and Hageb{\"o}lling, David},
  title     = {Digital sovereignty: insights from Germany's education sector},
  number    = {157},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-561-3},
  issn      = {1613-5652},
  doi       = {10.25932/publishup-59772},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-597723},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {1 -- 27},
  year      = {2023},
  abstract  = {Digital technology offers significant political, economic, and societal opportunities. At the same time, the notion of digital sovereignty has become a leitmotif in German discourse: the state's capacity to assume its responsibilities and safeguard society's - and individuals' - ability to shape the digital transformation in a self-determined way. The education sector is exemplary for the challenge faced by Germany, and indeed Europe, of harnessing the benefits of digital technology while navigating concerns around sovereignty. It encompasses education as a core public good, a rapidly growing field of business, and growing pools of highly sensitive personal data. The report describes pathways to mitigating the tension between digitalization and sovereignty at three different levels - state, economy, and individual - through the lens of concrete technical projects in the education sector: the HPI Schul-Cloud (state sovereignty), the MERLOT data spaces (economic sovereignty), and the openHPI platform (individual sovereignty).},
  language  = {en}
}
@book{Strohe1995,
  author    = {Strohe, Hans Gerhard},
  title     = {Dynamic latent variables path models : an alternative PLS estimation},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29498},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {1995},
  abstract  = {In this paper a partial least squares (PLS) approach to dynamic modelling with latent variables is proposed. Let Y be a matrix of manifest variables and H the matrix of the corresponding latent variables. And let H = BH+ε be a structural PLS model with a coefficient matrix B. Then this model can be made a dynamic one by substituting for B a matrix F = B + CL containing the lag operator L. Then the structural dynamic model H = FH+ε is formally estimated like an ordinary PLS model. In an exploratory way the model can be used for forecasting purposes. The procedure is being programmed in ISP.},
  language  = {en}
}
@book{Petersen1995,
  author    = {Petersen, Hans-Georg},
  title     = {Economic aspects of agricultural areas mangement and land/water ecotones conservation},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-15862},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {1995},
  abstract  = {Part of the intorduction: The task of writing a reliable and convincing paper on this topic is a very uneasy one because it is threefold: one has to know at least a bit about the agricultural sector, biology (or more precisely ecology), and about the sometimes beneficial but often distorting consequences of human activities. And all that has to be judged from the perspective of an economist who is aware of the steadily increasing uncertainties which are closely connected with post-modem sciences. Especially with regard to global, but also regional environmental issues, neither the conventional applied sciences nor the traditional professional consultancy deliver promising results. Today scientists have to tackle problems which are created by political necessities overwhelmingly caused by short-term human behavior, due in part to a serious lack of information on the longterm behavioral consequences. In these issues, typically, information stacks are high, scientific facts uncertain, individual as well as collective values disputed, and political decisions very urgent. "In general, the post-normal situation is one where the traditional opposition of 'hard'facts and 'soft' values is inverted. Here we find decisions that are 'hard' in every sense, for which the scientific inputs are irremediably 'soft'" (FUNTOWICZ/RAVETZ, 1991, p. 138).},
  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}
}
@book{BeyhlGiese2015,
  author    = {Beyhl, Thomas and Giese, Holger},
  title     = {Efficient and scalable graph view maintenance for deductive graph databases based on generalized discrimination networks},
  number    = {99},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-339-8},
  issn      = {1613-5652},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-79535},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {148},
  year      = {2015},
  abstract  = {Graph databases provide a natural way of storing and querying graph data. In contrast to relational databases, queries over graph databases enable to refer directly to the graph structure of such graph data. For example, graph pattern matching can be employed to formulate queries over graph data. However, as for relational databases running complex queries can be very time-consuming and ruin the interactivity with the database. One possible approach to deal with this performance issue is to employ database views that consist of pre-computed answers to common and often stated queries. But to ensure that database views yield consistent query results in comparison with the data from which they are derived, these database views must be updated before queries make use of these database views. Such a maintenance of database views must be performed efficiently, otherwise the effort to create and maintain views may not pay off in comparison to processing the queries directly on the data from which the database views are derived. At the time of writing, graph databases do not support database views and are limited to graph indexes that index nodes and edges of the graph data for fast query evaluation, but do not enable to maintain pre-computed answers of complex queries over graph data. Moreover, the maintenance of database views in graph databases becomes even more challenging when negation and recursion have to be supported as in deductive relational databases. In this technical report, we present an approach for the efficient and scalable incremental graph view maintenance for deductive graph databases. The main concept of our approach is a generalized discrimination network that enables to model nested graph conditions including negative application conditions and recursion, which specify the content of graph views derived from graph data stored by graph databases. The discrimination network enables to automatically derive generic maintenance rules using graph transformations for maintaining graph views in case the graph data from which the graph views are derived change. We evaluate our approach in terms of a case study using multiple data sets derived from open source projects.},
  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{ChristevFitzRoy1999,
  author    = {Christev, Atanas and FitzRoy, Felix},
  title     = {Employment and wages in transition : panel evidence from Poland},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-48946},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {1999},
  abstract  = {New survey data for a panel of Polish firms is used to estimate employment and wage adjustments under various forms of ownership (insider vs. outsider) and asymmetric response to exogenous shocks. In contrast to earlier studies, dynamic panel data estimators (GMM) allow for endogeneity of observed variables and partial adjustment to shocks. Results differ from other findings in the transition literature: wages have little effect on dynamic labor demand and the firm-size wage effect is confirmed. Firms that expand employment have to pay significantly larger wage increases and rising sales add little to employment, suggesting labor hoarding. Dec1ining sales, however, significantly reduce employment and privatization (or anticipation thereof) has the expected benefits.},
  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}
}
@book{Liero2010,
  author    = {Liero, Hannelore},
  title     = {Estimation and testing the effect of covariates in accelerated life time models under censoring},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-52823},
  publisher      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {The accelerated lifetime model is considered. To test the influence of the covariate we transform the model in a regression model. Since censoring is allowed this approach leads to a goodness-of-fit problem for regression functions under censoring. So nonparametric estimation of regression functions under censoring is investigated, a limit theorem for a L2-distance is stated and a test procedure is formulated. Finally a Monte Carlo procedure is proposed.},
  language  = {en}
}