@phdthesis{Luckow2009, author = {Luckow, Andr{\´e}}, title = {A dependable middleware for enhancing the fault tolerance of distributed computations in grid environments}, address = {Potsdam}, pages = {235 S.}, year = {2009}, language = {en} } @phdthesis{Scherfenberg2012, author = {Scherfenberg, Ivonne}, title = {A logic-based Framwork to enable Attribute Assurance for Digital Identities in Service-oriented Architectures and the Web}, address = {Potsdam}, pages = {126 S.}, year = {2012}, language = {en} } @phdthesis{Wolter2010, author = {Wolter, Christian}, title = {A methodology for model-driven process security}, address = {Potsdam}, pages = {xv, 144 S. : graph. Darst.}, year = {2010}, language = {en} } @phdthesis{Mueller2012, author = {M{\"u}ller, J{\"u}rgen J.}, title = {A real-time in-memory discovery service}, address = {Potsdam}, pages = {XXV, 172 S.}, year = {2012}, language = {en} } @phdthesis{Zhou2008, author = {Zhou, Wei}, title = {Access control model and policies for collaborative environments}, address = {Potsdam}, pages = {199 S. : graph. Darst.}, year = {2008}, language = {en} } @phdthesis{Hetzer2006, author = {Hetzer, Dirk}, title = {Adaptive Quality of Service based Bandwidth Planning in Internet}, address = {Potsdam}, pages = {190 S. : graph. Darst.}, year = {2006}, language = {en} } @phdthesis{Mueller2016, author = {M{\"u}ller, Stephan Heinz}, title = {Aggregates Caching for Enterprise Applications}, school = {Universit{\"a}t Potsdam}, pages = {167}, year = {2016}, abstract = {The introduction of columnar in-memory databases, along with hardware evolution, has made the execution of transactional and analytical enterprise application workloads on a single system both feasible and viable. Yet, we argue that executing analytical aggregate queries directly on the transactional data can decrease the overall system performance. Despite the aggregation capabilities of columnar in-memory databases, the direct access to records of a materialized aggregate is always more efficient than aggregating on the fly. The traditional approach to materialized aggregates, however, introduces significant overhead in terms of materialized view selection, maintenance, and exploitation. When this overhead is handled by the application, it increases the application complexity, and can slow down the transactional throughput of inserts, updates, and deletes. In this thesis, we motivate, propose, and evaluate the aggregate cache, a materialized aggregate engine in the main-delta architecture of a columnar in-memory database that provides efficient means to handle costly aggregate queries of enterprise applications. For our design, we leverage the specifics of the main-delta architecture that separates a table into a main and delta partition. The central concept is to only cache the partial aggregate query result as defined on the main partition of a table, because the main partition is relatively stable as records are only inserted into the delta partition. We contribute by proposing incremental aggregate maintenance and query compensation techniques for mixed workloads of enterprise applications. In addition, we introduce aggregate profit metrics that increase the likelihood of persisting the most profitable aggregates in the aggregate cache. Query compensation and maintenance of materialized aggregates based on joins of multiple tables is expensive due to the partitioned tables in the main-delta architecture. Our analysis of enterprise applications has revealed several data schema and workload patterns. This includes the observation that transactional data is persisted in header and item tables, whereas in many cases, the insertion of related header and item records is executed in a single database transaction. We contribute by proposing an approach to transport these application object semantics to the database system and optimize the query processing using the aggregate cache by applying partition pruning and predicate pushdown techniques. For the experimental evaluation, we propose the FICO benchmark that is based on data from a productive ERP system with extracted mixed workloads. Our evaluation reveals that the aggregate cache can accelerate the execution of aggregate queries up to a factor of 60 whereas the speedup highly depends on the number of aggregated records in the main and delta partitions. In mixed workloads, the proposed aggregate maintenance and query compensation techniques perform up to an order of magnitude better than traditional materialized aggregate maintenance approaches. The introduced aggregate profit metrics outperform existing costbased metrics by up to 20\%. Lastly, the join pruning and predicate pushdown techniques can accelerate query execution in the aggregate cache in the presence of multiple partitioned tables by up to an order of magnitude.}, language = {en} } @phdthesis{Heinze2015, author = {Heinze, Theodor}, title = {Analyse von Patientendaten und Entscheidungsunterst{\"u}tzung in der Telemedizin}, school = {Universit{\"a}t Potsdam}, pages = {173}, year = {2015}, language = {de} } @phdthesis{AlSaffar2016, author = {Al-Saffar, Loay Talib Ahmed}, title = {Analysing prerequisites, expectations, apprehensions, and attitudes of University students studying computer science}, school = {Universit{\"a}t Potsdam}, pages = {128}, year = {2016}, language = {en} } @phdthesis{Feinbube2018, author = {Feinbube, Frank}, title = {Ans{\"a}tze zur Integration von Beschleunigern ins Betriebssystem}, school = {Universit{\"a}t Potsdam}, pages = {238}, year = {2018}, language = {de} } @phdthesis{Dmitriev2003, author = {Dmitriev, Alexej}, title = {Anwendung alternierender Signale zum Entwurf von Fehlererkennungsschaltungen und Kompaktoren}, pages = {97 S.}, year = {2003}, language = {de} } @phdthesis{Richter2011, author = {Richter, Michael}, title = {Anwendung nichtlinearer Codes zur Fehlererkennung und -korrektur}, address = {Potsdam}, pages = {134 S.}, year = {2011}, language = {de} } @phdthesis{Schult2009, author = {Schult, Wolfgang}, title = {Architektur komponenten-basierter Systeme mit LOOM : Aspekte, Muster, Werkzeuge}, publisher = {Cuvillier}, address = {G{\"o}ttingen}, isbn = {978-3-86955-031-2}, pages = {217 S.}, year = {2009}, language = {de} } @phdthesis{Reinke2003, author = {Reinke, Thomas}, title = {Architekturbasierte Konstruktion von Multiagentensystemen}, pages = {166 S.}, year = {2003}, language = {de} } @phdthesis{Alsadeh2013, author = {Alsadeh, Ahmad}, title = {Augmented secure neighbor discovery: aligning security, privacy and usability}, address = {Potsdam}, pages = {114 S.}, year = {2013}, language = {en} } @phdthesis{Rasche2008, author = {Rasche, Andreas}, title = {Ausf{\"u}hrung und Entwicklung Adaptiver Komponentenbasierter Anwendungen}, address = {Potsdam}, isbn = {978-3-86727-698-6}, pages = {195 S., graph. Darst.}, year = {2008}, language = {de} } @phdthesis{Rasche2008, author = {Rasche, Andreas}, title = {Ausf{\"u}hrung und Entwicklung adaptiver komponentenbasierter Anwendungen}, publisher = {Cuvillier}, address = {G{\"o}ttingen}, isbn = {978-3-86727-698-6}, pages = {195 S.: graph. Darst.}, year = {2008}, language = {de} } @phdthesis{Yang2013, author = {Yang, Haojin}, title = {Automatic video indexing and retrieval using video ocr technology}, address = {Potsdam}, pages = {182 S.}, year = {2013}, language = {en} } @phdthesis{Bog2012, author = {Bog, Anja}, title = {Benchmarking composite transaction and analytical processing systems : the creation of a mixed workload benchmark and its application in evaluating the impact of database schema optimizations in mixed workload scenarios}, address = {Potsdam}, pages = {173 S.}, year = {2012}, language = {en} } @phdthesis{Wildner1997, author = {Wildner, Uwe}, title = {CASC : compiler assisted self-checking of structural integrity}, pages = {XIV, 134 S. : graph. Darst.}, year = {1997}, language = {en} } @phdthesis{Glubudum2008, author = {Glubudum, Prisana}, title = {Clones of tree languages and non-deterministic hypersubstitutions}, pages = {3,IV, 74 Bl.}, year = {2008}, language = {en} } @phdthesis{Schnjakin2014, author = {Schnjakin, Maxim}, title = {Cloud-RAID}, pages = {137}, year = {2014}, language = {de} } @phdthesis{Kaminski2023, author = {Kaminski, Roland}, title = {Complex reasoning with answer set programming}, school = {Universit{\"a}t Potsdam}, pages = {301}, year = {2023}, abstract = {Answer Set Programming (ASP) allows us to address knowledge-intensive search and optimization problems in a declarative way due to its integrated modeling, grounding, and solving workflow. A problem is modeled using a rule based language and then grounded and solved. Solving results in a set of stable models that correspond to solutions of the modeled problem. In this thesis, we present the design and implementation of the clingo system---perhaps, the most widely used ASP system. It features a rich modeling language originating from the field of knowledge representation and reasoning, efficient grounding algorithms based on database evaluation techniques, and high performance solving algorithms based on Boolean satisfiability (SAT) solving technology. The contributions of this thesis lie in the design of the modeling language, the design and implementation of the grounding algorithms, and the design and implementation of an Application Programmable Interface (API) facilitating the use of ASP in real world applications and the implementation of complex forms of reasoning beyond the traditional ASP workflow.}, language = {en} } @phdthesis{Gros2013, author = {Gros, Oliver}, title = {Computergest{\"u}tzte Wissensextraktion aus befundtexten der Pathologie}, address = {Potsdam}, pages = {170 S.}, year = {2013}, language = {de} } @phdthesis{Grum2021, author = {Grum, Marcus}, title = {Construction of a concept of neuronal modeling}, year = {2021}, abstract = {The business problem of having inefficient processes, imprecise process analyses, and simulations as well as non-transparent artificial neuronal network models can be overcome by an easy-to-use modeling concept. With the aim of developing a flexible and efficient approach to modeling, simulating, and optimizing processes, this paper proposes a flexible Concept of Neuronal Modeling (CoNM). The modeling concept, which is described by the modeling language designed and its mathematical formulation and is connected to a technical substantiation, is based on a collection of novel sub-artifacts. As these have been implemented as a computational model, the set of CoNM tools carries out novel kinds of Neuronal Process Modeling (NPM), Neuronal Process Simulations (NPS), and Neuronal Process Optimizations (NPO). The efficacy of the designed artifacts was demonstrated rigorously by means of six experiments and a simulator of real industrial production processes.}, language = {en} } @phdthesis{Huong2001, author = {Huong, Dinh Thi Thanh}, title = {Correctness proofs and probabilistic tests for constructive specifications and functional programs}, pages = {154 S.}, year = {2001}, language = {en} } @phdthesis{Tarnick1995, author = {Tarnick, Steffen}, title = {Data compression techniques for concurrent error detection and built-in self test}, pages = {159 S. : Ill.}, year = {1995}, language = {en} } @phdthesis{Bleiholder2010, author = {Bleiholder, Jens}, title = {Data fusion and conflict resolution in integrated information systems}, address = {Potsdam}, pages = {171 S.}, year = {2010}, language = {en} } @phdthesis{Rabenalt2011, author = {Rabenalt, Thomas}, title = {Datenkompaktierung f{\"u}r Diagnose und Test}, address = {Potsdam}, pages = {116 S.}, year = {2011}, language = {de} } @phdthesis{Phusanga2013, author = {Phusanga, Dara}, title = {Derived algebraic systems}, address = {Potsdam}, pages = {81 S.}, year = {2013}, language = {en} } @phdthesis{Makowski2021, author = {Makowski, Silvia}, title = {Discriminative Models for Biometric Identification using Micro- and Macro-Movements of the Eyes}, school = {Universit{\"a}t Potsdam}, pages = {xi, 91}, year = {2021}, abstract = {Human visual perception is an active process. Eye movements either alternate between fixations and saccades or follow a smooth pursuit movement in case of moving targets. Besides these macroscopic gaze patterns, the eyes perform involuntary micro-movements during fixations which are commonly categorized into micro-saccades, drift and tremor. Eye movements are frequently studied in cognitive psychology, because they reflect a complex interplay of perception, attention and oculomotor control. A common insight of psychological research is that macro-movements are highly individual. Inspired by this finding, there has been a considerable amount of prior research on oculomotoric biometric identification. However, the accuracy of known approaches is too low and the time needed for identification is too long for any practical application. This thesis explores discriminative models for the task of biometric identification. Discriminative models optimize a quality measure of the predictions and are usually superior to generative approaches in discriminative tasks. However, using discriminative models requires to select a suitable form of data representation for sequential eye gaze data; i.e., by engineering features or constructing a sequence kernel and the performance of the classification model strongly depends on the data representation. We study two fundamentally different ways of representing eye gaze within a discriminative framework. In the first part of this thesis, we explore the integration of data and psychological background knowledge in the form of generative models to construct representations. To this end, we first develop generative statistical models of gaze behavior during reading and scene viewing that account for viewer-specific distributional properties of gaze patterns. In a second step, we develop a discriminative identification model by deriving Fisher kernel functions from these and several baseline models. We find that an SVM with Fisher kernel is able to reliably identify users based on their eye gaze during reading and scene viewing. However, since the generative models are constrained to use low-frequency macro-movements, they discard a significant amount of information contained in the raw eye tracking signal at a high cost: identification requires about one minute of input recording, which makes it inapplicable for real world biometric systems. In the second part of this thesis, we study a purely data-driven modeling approach. Here, we aim at automatically discovering the individual pattern hidden in the raw eye tracking signal. To this end, we develop a deep convolutional neural network DeepEyedentification that processes yaw and pitch gaze velocities and learns a representation end-to-end. Compared to prior work, this model increases the identification accuracy by one order of magnitude and the time to identification decreases to only seconds. The DeepEyedentificationLive model further improves upon the identification performance by processing binocular input and it also detects presentation-attacks. We find that by learning a representation, the performance of oculomotoric identification and presentation-attack detection can be driven close to practical relevance for biometric applications. Eye tracking devices with high sampling frequency and precision are expensive and the applicability of eye movement as a biometric feature heavily depends on cost of recording devices. In the last part of this thesis, we therefore study the requirements on data quality by evaluating the performance of the DeepEyedentificationLive network under reduced spatial and temporal resolution. We find that the method still attains a high identification accuracy at a temporal resolution of only 250 Hz and a precision of 0.03 degrees. Reducing both does not have an additive deteriorating effect.}, language = {en} } @phdthesis{Zarezadeh2012, author = {Zarezadeh, Aliakbar}, title = {Distributed smart cameras : architecture and communication protocols}, address = {Potsdam}, pages = {135 S.}, year = {2012}, language = {en} } @phdthesis{Schmidt1995, author = {Schmidt, Henning}, title = {Dynamisch ver{\"a}nderbare Betriebssystemstrukturen}, pages = {XII, 141 S.}, year = {1995}, language = {de} } @phdthesis{Troeger2008, author = {Tr{\"o}ger, Peter}, title = {Dynamische Ressourcenverwaltung f{\"u}r dienstbasierte Software-Systeme}, publisher = {Cuvillier}, address = {G{\"o}ttingen}, isbn = {978-3-86727-622-1}, pages = {v, 174 S.: Ill., garph. Darst.}, year = {2008}, language = {de} } @phdthesis{Troeger2008, author = {Tr{\"o}ger, Peter}, title = {Dynamische Ressourcenverwaltung f{\"u}r dienstbasierte Software-Systeme}, address = {Potsdam}, pages = {174 S., graph. Darst.}, year = {2008}, language = {de} } @phdthesis{Jung2015, author = {Jung, J{\"o}rg}, title = {Efficient credit based server load balancing}, school = {Universit{\"a}t Potsdam}, pages = {353}, year = {2015}, language = {en} } @phdthesis{Marienfeld2007, author = {Marienfeld, Daniel}, title = {Effiziente Fehlerkennung f{\"u}r arithmetische Einheiten}, address = {Potsdam}, pages = {VIII, 122 S. : graph. Darst.}, year = {2007}, language = {de} } @phdthesis{Quasthoff2011, author = {Quasthoff, Matthias}, title = {Effizientes Entwickeln von Semantic-Web-Software mit Object Triple Mapping}, address = {Potsdam}, pages = {138 S.}, year = {2011}, language = {de} } @phdthesis{Rostock2002, author = {Rostock, Gisbert}, title = {Ein polynomialer Algorithmus zur Erkennung von Isomorphie von Graphen}, pages = {63 S.}, year = {2002}, language = {de} } @phdthesis{Kiertscher2017, author = {Kiertscher, Simon}, title = {Energieeffizientes Clustermanagement im Server-Load-Balacing-Bereich, am Fallbeispiel eines Apache-Webserver-Clusters}, school = {Universit{\"a}t Potsdam}, pages = {185}, year = {2017}, language = {de} } @phdthesis{Tiwari2019, author = {Tiwari, Abhishek}, title = {Enhancing Users' Privacy: Static Resolution of the Dynamic Properties of Android}, school = {Universit{\"a}t Potsdam}, pages = {xiii, 111}, year = {2019}, abstract = {The usage of mobile devices is rapidly growing with Android being the most prevalent mobile operating system. Thanks to the vast variety of mobile applications, users are preferring smartphones over desktops for day to day tasks like Internet surfing. Consequently, smartphones store a plenitude of sensitive data. This data together with the high values of smartphones make them an attractive target for device/data theft (thieves/malicious applications). Unfortunately, state-of-the-art anti-theft solutions do not work if they do not have an active network connection, e.g., if the SIM card was removed from the device. In the majority of these cases, device owners permanently lose their smartphone together with their personal data, which is even worse. Apart from that malevolent applications perform malicious activities to steal sensitive information from smartphones. Recent research considered static program analysis to detect dangerous data leaks. These analyses work well for data leaks due to inter-component communication, but suffer from shortcomings for inter-app communication with respect to precision, soundness, and scalability. This thesis focuses on enhancing users' privacy on Android against physical device loss/theft and (un)intentional data leaks. It presents three novel frameworks: (1) ThiefTrap, an anti-theft framework for Android, (2) IIFA, a modular inter-app intent information flow analysis of Android applications, and (3) PIAnalyzer, a precise approach for PendingIntent vulnerability analysis. ThiefTrap is based on a novel concept of an anti-theft honeypot account that protects the owner's data while preventing a thief from resetting the device. We implemented the proposed scheme and evaluated it through an empirical user study with 35 participants. In this study, the owner's data could be protected, recovered, and anti-theft functionality could be performed unnoticed from the thief in all cases. IIFA proposes a novel approach for Android's inter-component/inter-app communication (ICC/IAC) analysis. Our main contribution is the first fully automatic, sound, and precise ICC/IAC information flow analysis that is scalable for realistic apps due to modularity, avoiding combinatorial explosion: Our approach determines communicating apps using short summaries rather than inlining intent calls between components and apps, which requires simultaneously analyzing all apps installed on a device. We evaluate IIFA in terms of precision, recall, and demonstrate its scalability to a large corpus of real-world apps. IIFA reports 62 problematic ICC-/IAC-related information flows via two or more apps/components. PIAnalyzer proposes a novel approach to analyze PendingIntent related vulnerabilities. PendingIntents are a powerful and universal feature of Android for inter-component communication. We empirically evaluate PIAnalyzer on a set of 1000 randomly selected applications and find 1358 insecure usages of PendingIntents, including 70 severe vulnerabilities.}, language = {en} } @phdthesis{AbuJarour2011, author = {AbuJarour, Mohammed}, title = {Enriched service descriptions: sources, approaches and usages}, address = {Potsdam}, pages = {140 S.}, year = {2011}, language = {en} } @phdthesis{Krueger2014, author = {Kr{\"u}ger, Jens}, title = {Enterprise-specific in-memory data managment : HYRISEc - an in-memory column store engine for OLXP}, publisher = {Hasso-Plattner-Insitut}, address = {Potsdam}, pages = {201 S.}, year = {2014}, language = {en} } @phdthesis{Petrasch1999, author = {Petrasch, Roland}, title = {Entwicklung von Modelltypen f{\"u}r das Qualit{\"a}tsmanagement in der Software-Entwicklung am Beispiel von ausgew{\"a}hlten Qualit{\"a}tssicherungsmaßnahmen}, pages = {Bl. i - viii; 173 Bl. : graph. Darst.}, year = {1999}, language = {de} } @phdthesis{Moschanin1999, author = {Moschanin, Wladimir}, title = {Entwurf selbstdualer digitaler Schaltungen zur Fehlererkennung}, address = {Potsdam}, pages = {III, 94 S. : graph. Darst.}, year = {1999}, language = {de} } @phdthesis{Otscheretnij2003, author = {Otscheretnij, Vitalij}, title = {Entwurf von fehlertoleranten kompinatorischen Schaltungen}, pages = {80 S.}, year = {2003}, language = {de} } @phdthesis{Morosov1996, author = {Morosov, Andrej}, title = {Entwurf von selbstpr{\"u}fenden digitalen Schaltungen mit monoton unabh{\"a}ngigen Ausg{\"a}ngen}, pages = {85 S.}, year = {1996}, language = {de} } @phdthesis{Lincke2014, author = {Lincke, Jens}, title = {Evolving Tools in a Collaborative Self-supporting Development Environment}, school = {Universit{\"a}t Potsdam}, pages = {164}, year = {2014}, language = {en} } @phdthesis{Freund2006, author = {Freund, Tessen}, title = {Experimentelles Software Engineering durch Modellierung wissensintensiver Entwicklungsprozesse}, address = {Potsdam}, pages = {XII, 316 S. : graph. Darst.}, year = {2006}, language = {de} } @phdthesis{Appeltauer2012, author = {Appeltauer, Malte}, title = {Extending Context-oriented Programming to New Application Domains: Run-time Adaptation Support for Java}, address = {Potsdam}, pages = {157 S.}, year = {2012}, language = {en} } @phdthesis{Repp2009, author = {Repp, Stephan}, title = {Extraktion von semantischen Informationen aus audivisuellen Vorlesungsaufzeichnungen : Sprachskripte der Vorlesungsvideos als Informationsressource}, address = {Potsdam}, pages = {183 S.}, year = {2009}, language = {de} } @phdthesis{Kuznetsov2007, author = {Kuznetsov, Grigory}, title = {Fehlererkennung in systemmetrischen Block-Chiffren}, address = {Potsdam}, pages = {118 S. : graph. Darst.}, year = {2007}, language = {de} } @phdthesis{Rzeha2007, author = {Rzeha, Jan}, title = {Generation and Storage of Diagnosis Data On-Chip}, address = {Potsdam}, pages = {VII, 94 S. : graph. Darst.}, year = {2007}, language = {en} } @phdthesis{Mueller2008, author = {M{\"u}ller, Claudia}, title = {Graphentheoretische Analyse der Evolution von Wiki-basierten Netzwerken f{\"u}r selbstorganisiertes Wissensmanagement}, address = {Potsdam}, pages = {x, 287 S. : graph. Darst.}, year = {2008}, language = {de} } @phdthesis{Kaufmann2015, author = {Kaufmann, Benjamin}, title = {High performance answer set solving}, pages = {182}, year = {2015}, language = {en} } @phdthesis{Schindler2016, author = {Schindler, Sven}, title = {Honeypot Architectures for IPv6 Networks}, school = {Universit{\"a}t Potsdam}, pages = {164}, year = {2016}, language = {en} } @phdthesis{Grund2012, author = {Grund, Martin}, title = {Hyrise : a main memory hybrid database storage engine}, address = {Potsdam}, pages = {175 S.}, year = {2012}, language = {en} } @phdthesis{Panchenko2012, author = {Panchenko, Oleksandr}, title = {In-Memory database support for source code querying and analytics}, address = {Potsdam}, pages = {113 S.}, year = {2012}, language = {en} } @phdthesis{Gharib2008, author = {Gharib, Mona}, title = {Incremental answer set programming}, address = {Potsdam}, pages = {184 S. : graph. Darst.}, year = {2008}, language = {en} } @phdthesis{Thomas2002, author = {Thomas, Marco}, title = {Informatische Modellbildung : modellieren von Modellen als ein zentrales Element der Informatik f{\"u}r den allgemeinbildenden Schulunterricht}, pages = {98 S.}, year = {2002}, language = {de} } @phdthesis{Schuschel2006, author = {Schuschel, Hilmar}, title = {Integrierte Prozessplanung und -ausf{\"u}hrung}, address = {Potsdam}, pages = {135 S.}, year = {2006}, language = {de} } @phdthesis{Kupries2000, author = {Kupries, Mario}, title = {Interagentenkonnektionen in Multi-Agentensystemen}, pages = {104 S. : Anl.}, year = {2000}, language = {de} } @phdthesis{Kersting2002, author = {Kersting, Oliver}, title = {Interaktive, dynamische 3D-Karten zur Kommunikation r{\"a}umlicher Information}, pages = {105 S.}, year = {2002}, language = {de} } @phdthesis{Gohlke1996, author = {Gohlke, Mario}, title = {Konzept, Entwurf und Anwendungsanalyse eines fehlertoleranten modellbasierten Objekterkennungssystems zur Auswertung von Farbbildern}, pages = {117 S. : Ill.}, year = {1996}, language = {de} } @phdthesis{Schacht2014, author = {Schacht, Alexander}, title = {Konzepte und Strategien mobiler Plattformen zur Erfassung und Anlayse von Vitalparametern in heterogenen Telemonotoring-Systemen}, pages = {215}, year = {2014}, language = {de} } @phdthesis{Hagedorn2016, author = {Hagedorn, Benjamin}, title = {Konzepte und Techniken zur servicebasierten Visualisierung von geovirtuellen 3D-Umgebungen}, school = {Universit{\"a}t Potsdam}, pages = {140}, year = {2016}, language = {de} } @phdthesis{Romeike2008, author = {Romeike, Ralf}, title = {Kreativit{\"a}t im Informatikunterricht}, pages = {153 S.}, year = {2008}, language = {de} } @phdthesis{Schmidt2012, author = {Schmidt, Alexander}, title = {KStructur : ein Ansatz zur Analyse und Beschreibung von Nebenl{\"a}ufigkeit in Betriebssystemen}, publisher = {Guvillier}, address = {G{\"o}ttingen}, isbn = {978-3-86955-977-1}, pages = {170 S.}, year = {2012}, language = {de} } @phdthesis{Kalkbrenner2001, author = {Kalkbrenner, Gerrit}, title = {Lernen und Lehren an der virtuellen Universit{\"a}t}, pages = {169 S.}, year = {2001}, language = {de} } @phdthesis{Kreutel2010, author = {Kreutel, J{\"o}rn}, title = {Metamodell und Beschreibungssprache f{\"u}r sprechgesteuerte Nutzerschnittstellen}, address = {Potsdam}, pages = {451 S.}, year = {2010}, language = {de} } @phdthesis{Wust2015, author = {Wust, Johannes}, title = {Mixed workload managment for in-memory databases}, pages = {VIII, 167}, year = {2015}, language = {en} } @phdthesis{Li2008, author = {Li, Nanjun}, title = {Modeling, Simulation and Evaluation of TCP/IP Networks}, address = {Potsdam}, pages = {124 S., ii-xi, : graph. Darst.}, year = {2008}, language = {en} } @phdthesis{Li2008, author = {Li, Nanjun}, title = {Modeling, simulation and evaluation of TCP/IP Networks}, pages = {xi, 124 S.: graph. Drst.}, year = {2008}, language = {en} } @phdthesis{Kratzke2007, author = {Kratzke, Nane}, title = {Modellbasierte Analyse interorganisationaler Wissensfl{\"u}sse}, publisher = {Gito-Verl.}, address = {Berlin}, isbn = {978-3-936771-92-3}, pages = {223 S. : graph. Darst.}, year = {2007}, language = {de} } @phdthesis{Wagner2012, author = {Wagner, Christian}, title = {Modellgetriebene Software-Migration}, address = {Potsdam}, pages = {276 S.}, year = {2012}, language = {de} } @phdthesis{Niess2016, author = {Nieß, G{\"u}nther}, title = {Modellierung und Erkennung von technischen Fehlern mittels linearer und nichtlinearer Codes}, school = {Universit{\"a}t Potsdam}, pages = {V, 97}, year = {2016}, language = {de} } @phdthesis{Hoellerer2016, author = {H{\"o}llerer, Reinhard}, title = {Modellierung und Optimierung von B{\"u}rgerdiensten am Beispiel der Stadt Landshut}, school = {Universit{\"a}t Potsdam}, pages = {244}, year = {2016}, abstract = {Die Projektierung und Abwicklung sowie die statische und dynamische Analyse von Gesch{\"a}ftsprozessen im Bereich des Verwaltens und Regierens auf kommunaler, L{\"a}nder- wie auch Bundesebene mit Hilfe von Informations- und Kommunikationstechniken besch{\"a}ftigen Politiker und Strategen f{\"u}r Informationstechnologie ebenso wie die {\"O}ffentlichkeit seit Langem. Der hieraus entstandene Begriff E-Government wurde in der Folge aus den unterschiedlichsten technischen, politischen und semantischen Blickrichtungen beleuchtet. Die vorliegende Arbeit konzentriert sich dabei auf zwei Schwerpunktthemen: > Das erste Schwerpunktthema behandelt den Entwurf eines hierarchischen Architekturmodells, f{\"u}r welches sieben hierarchische Schichten identifiziert werden k{\"o}nnen. Diese erscheinen notwendig, aber auch hinreichend, um den allgemeinen Fall zu beschreiben. Den Hintergrund hierf{\"u}r liefert die langj{\"a}hrige Prozess- und Verwaltungserfahrung als Leiter der EDV-Abteilung der Stadtverwaltung Landshut, eine kreisfreie Stadt mit rund 69.000 Einwohnern im Nordosten von M{\"u}nchen. Sie steht als Repr{\"a}sentant f{\"u}r viele Verwaltungsvorg{\"a}nge in der Bundesrepublik Deutschland und ist dennoch als Analyseobjekt in der Gesamtkomplexit{\"a}t und Prozessquantit{\"a}t {\"u}berschaubar. Somit k{\"o}nnen aus der Analyse s{\"a}mtlicher Kernabl{\"a}ufe statische und dynamische Strukturen extrahiert und abstrakt modelliert werden. Die Schwerpunkte liegen in der Darstellung der vorhandenen Bedienabl{\"a}ufe in einer Kommune. Die Transformation der Bedienanforderung in einem hierarchischen System, die Darstellung der Kontroll- und der Operationszust{\"a}nde in allen Schichten wie auch die Strategie der Fehlererkennung und Fehlerbehebung schaffen eine transparente Basis f{\"u}r umfassende Restrukturierungen und Optimierungen. F{\"u}r die Modellierung wurde FMC-eCS eingesetzt, eine am Hasso-Plattner-Institut f{\"u}r Softwaresystemtechnik GmbH (HPI) im Fachgebiet Kommunikationssysteme entwickelte Methodik zur Modellierung zustandsdiskreter Systeme unter Ber{\"u}cksichtigung m{\"o}glicher Inkonsistenzen >Das zweite Schwerpunktthema widmet sich der quantitativen Modellierung und Optimierung von E-Government-Bediensystemen, welche am Beispiel des B{\"u}rgerb{\"u}ros der Stadt Landshut im Zeitraum 2008 bis 2015 durchgef{\"u}hrt wurden. Dies erfolgt auf Basis einer kontinuierlichen Betriebsdatenerfassung mit aufwendiger Vorverarbeitung zur Extrahierung mathematisch beschreibbarer Wahrscheinlichkeitsverteilungen. Der hieraus entwickelte Dienstplan wurde hinsichtlich der erzielbaren Optimierungen im dauerhaften Echteinsatz verifiziert.}, language = {de} } @phdthesis{Huendling2008, author = {H{\"u}ndling, Jens}, title = {Modellierung von Qualit{\"a}tsmerkmalen f{\"u}r Services}, pages = {XVI, 216 S.}, year = {2008}, language = {de} } @phdthesis{Hosp2015, author = {Hosp, Sven}, title = {Modifizierte Cross-Party Codes zur schnellen Mehrbit-Fehlerkorrektur}, pages = {105}, year = {2015}, language = {de} } @phdthesis{Klockmann2022, author = {Klockmann, Alexander}, title = {Modifizierte Unidirektionale Codes f{\"u}r Speicherfehler}, pages = {92}, year = {2022}, abstract = {Das Promotionsvorhaben verfolgt das Ziel, die Zuverl{\"a}ssigkeit der Datenspeicherung und die Speicherdichte von neu entwickelten Speichern (Emerging Memories) mit Multi-Level-Speicherzellen zu verbessern bzw. zu erh{\"o}hen. Hierf{\"u}r werden Codes zur Erkennung von unidirektionalen Fehlern analysiert, modifiziert und neu entwickelt, um sie innerhalb der neuen Speicher anwenden zu k{\"o}nnen. Der Fokus liegt dabei auf sog. Berger-Codes und m-aus-n-Codes. Da Multi-Level-Speicherzellen nicht mehr bin{\"a}r, sondern mit mehreren Leveln arbeiten, k{\"o}nnen bisher verwendete Codes nicht mehr verwendet werden, bzw. m{\"u}ssen entsprechend angepasst werden. Auf Basis der Berger-Codes und m-aus-n-Codes werden in dieser Arbeit neue Codes abgeleitet, welche in der Lage sind, Daten auch in mehrwertigen Systemen zu sch{\"u}tzen.}, language = {de} } @phdthesis{Neumann2013, author = {Neumann, Stefan}, title = {Modular timing analysis of component-based real-time embedded systems}, address = {Potsdam}, pages = {218 S.}, year = {2013}, language = {en} } @phdthesis{Uflacker2010, author = {Uflacker, Matthias}, title = {Monitoring virtual team collaboration : methods, applications and experiences in engineering design}, address = {Potsdam}, pages = {203 S.}, year = {2010}, language = {en} } @phdthesis{Schaffner2013, author = {Schaffner, Jan}, title = {Multi tenancy for cloud-based in-memory column databases : workload management and data placement}, address = {Potsdam}, pages = {135 S.}, year = {2013}, language = {en} } @phdthesis{Duchrau2024, author = {Duchrau, Georg}, title = {M{\"o}glichkeiten und Grenzen des erweiterten Cross Parity Codes}, school = {Universit{\"a}t Potsdam}, pages = {93}, year = {2024}, language = {de} } @phdthesis{Weidling2016, author = {Weidling, Stefan}, title = {Neue Ans{\"a}tze zur Verbesserung der Fehlertoleranz gegen{\"u}ber transienten Fehlern in sequentiellen Schaltungen}, school = {Universit{\"a}t Potsdam}, pages = {XII, 181}, year = {2016}, language = {de} } @phdthesis{Leininger2006, author = {Leininger, Andreas}, title = {New diagnosis and test methods with high compaction rates}, publisher = {Mensch \& Buch Verl.}, address = {Berlin}, isbn = {3-86664-066-8}, pages = {IX, 98 S. : Ill., graph. Darst.}, year = {2006}, language = {en} } @phdthesis{Puhlmann2007, author = {Puhlmann, Frank}, title = {On the application of a theory for mobile systems to business process management}, address = {Potsdam}, pages = {xiv, 219 S. : graph. Darst.}, year = {2007}, language = {en} } @phdthesis{Bensch2008, author = {Bensch, Suna}, title = {Parallel systems as mildly context-sensitive grammar formalisms}, pages = {I, 103 S.}, year = {2008}, language = {en} } @phdthesis{Cheng2010, author = {Cheng, Feng}, title = {Physical separation technology and its lock-keeper implementation}, address = {Potsdam}, pages = {114 S.}, year = {2010}, language = {en} } @phdthesis{Hoang2008, author = {Hoang, Thi Thanh Mai}, title = {Planning of Multi-service Computer Networks}, address = {Potsdam}, pages = {372 S.}, year = {2008}, language = {en} } @phdthesis{Rafiee2014, author = {Rafiee, Hosnieh}, title = {Privacy and security issues in IPv6 networks}, address = {Potsdam}, pages = {141 S.}, year = {2014}, language = {en} } @phdthesis{Schapranow2012, author = {Schapranow, Matthieu-Patrick}, title = {Real-time security extensions for EPCglobal networks}, address = {Potsdam}, pages = {XVII, 108, XXX S.}, year = {2012}, language = {en} } @phdthesis{Nienhaus2005, author = {Nienhaus, Marc}, title = {Real-Time-Non-Photorealistic rendering techniques for illustrating 3D scenes and their dynamics}, address = {Potsdam}, pages = {x, 102 S. : graph. Darst.}, year = {2005}, language = {en} } @phdthesis{Alnemr2011, author = {Alnemr, Rehab}, title = {Reputation object representation model for enabling reputation interoperability}, address = {Potsdam}, pages = {179 S.}, year = {2011}, language = {en} } @phdthesis{Hartje2001, author = {Hartje, Hendrik}, title = {Schaltungsoptimierung durch Logiktransformationen w{\"a}hrend des Layoutentwurfs}, pages = {113 S.}, year = {2001}, language = {de} } @phdthesis{Saleh2016, author = {Saleh, Eyad}, title = {Securing Multi-tenant SaaS Environments}, school = {Universit{\"a}t Potsdam}, pages = {108}, year = {2016}, abstract = {Software-as-a-Service (SaaS) offers several advantages to both service providers and users. Service providers can benefit from the reduction of Total Cost of Ownership (TCO), better scalability, and better resource utilization. On the other hand, users can use the service anywhere and anytime, and minimize upfront investment by following the pay-as-you-go model. Despite the benefits of SaaS, users still have concerns about the security and privacy of their data. Due to the nature of SaaS and the Cloud in general, the data and the computation are beyond the users' control, and hence data security becomes a vital factor in this new paradigm. Furthermore, in multi-tenant SaaS applications, the tenants become more concerned about the confidentiality of their data since several tenants are co-located onto a shared infrastructure. To address those concerns, we start protecting the data from the provisioning process by controlling how tenants are being placed in the infrastructure. We present a resource allocation algorithm designed to minimize the risk of co-resident tenants called SecPlace. It enables the SaaS provider to control the resource (i.e., database instance) allocation process while taking into account the security of tenants as a requirement. Due to the design principles of the multi-tenancy model, tenants follow some degree of sharing on both application and infrastructure levels. Thus, strong security-isolation should be present. Therefore, we develop SignedQuery, a technique that prevents one tenant from accessing others' data. We use the Signing Concept to create a signature that is used to sign the tenant's request, then the server can verifies the signature and recognizes the requesting tenant, and hence ensures that the data to be accessed is belonging to the legitimate tenant. Finally, Data confidentiality remains a critical concern due to the fact that data in the Cloud is out of users' premises, and hence beyond their control. Cryptography is increasingly proposed as a potential approach to address such a challenge. Therefore, we present SecureDB, a system designed to run SQL-based applications over an encrypted database. SecureDB captures the schema design and analyzes it to understand the internal structure of the data (i.e., relationships between the tables and their attributes). Moreover, we determine the appropriate partialhomomorphic encryption scheme for each attribute where computation is possible even when the data is encrypted. To evaluate our work, we conduct extensive experiments with di↵erent settings. The main use case in our work is a popular open source HRM application, called OrangeHRM. The results show that our multi-layered approach is practical, provides enhanced security and isolation among tenants, and have a moderate complexity in terms of processing encrypted data.}, language = {en} } @phdthesis{Lass2017, author = {Lass, Sander}, title = {Simulationskonzept zur Nutzenvalidierung cyber-physischer Systeme in komplexen Fabrikumgebungen}, school = {Universit{\"a}t Potsdam}, pages = {323}, year = {2017}, language = {de} } @phdthesis{Hentschel2013, author = {Hentschel, Uwe}, title = {Steuerung der Daten{\"u}bertragung in {\"o}ffentlichen zellularen Funknetzen im Kontext telemedizinischer Anwendung}, address = {Potsdam}, pages = {224 S.}, year = {2013}, language = {de} } @phdthesis{Grunske2004, author = {Grunske, Lars}, title = {Strukturorientierte Optimierung der Qualit{\"a}tseigenschaften von softwareintensiven technischen Systemen im Architekturentwurf}, pages = {129 S.}, year = {2004}, language = {de} } @phdthesis{Fudickar2014, author = {Fudickar, Sebastian}, title = {Sub Ghz transceiver for indoor localisation of smartphones}, school = {Universit{\"a}t Potsdam}, pages = {IV, 167}, year = {2014}, language = {en} }