@article{Respondek2014,
  author    = {Respondek, Tobias},
  title     = {A workflow for computing potential areas for wind turbines},
  series = {Process design for natural scientists: an agile model-driven approach},
  journal   = {Process design for natural scientists: an agile model-driven approach},
  number    = {500},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {978-3-662-45005-5},
  pages     = {200 -- 215},
  year      = {2014},
  abstract  = {This paper describes the implementation of a workflow model for service-oriented computing of potential areas for wind turbines in jABC. By implementing a re-executable model the manual effort of a multi-criteria site analysis can be reduced. The aim is to determine the shift of typical geoprocessing tools of geographic information systems (GIS) from the desktop to the web. The analysis is based on a vector data set and mainly uses web services of the "Center for Spatial Information Science and Systems" (CSISS). This paper discusses effort, benefits and problems associated with the use of the web services.},
  language  = {en}
}
@phdthesis{Hu2006,
  author    = {Hu, Ji},
  title     = {A virtual machine architecture for IT-security laboratories},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7818},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {This thesis discusses challenges in IT security education, points out a gap between e-learning and practical education, and presents a work to fill the gap. 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 conventional computer laboratories poses particular problems such as 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. In this thesis, we introduce 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 accessibility 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 a 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 a security management solution to prevent the 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 thesis demonstrates the possibility to implement hands-on security laboratories on the Internet reliably, securely, and economically.},
  subject      = {Computersicherheit},
  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}
}
@inproceedings{GoltzPieth2010,
  author    = {Goltz, Hans-Joachim and Pieth, Norbert},
  title     = {A tool for generating partition schedules of multiprocessor systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41556},
  year      = {2010},
  abstract  = {A deterministic cycle scheduling of partitions at the operating system level is supposed for a multiprocessor system. In this paper, we propose a tool for generating such schedules. We use constraint based programming and develop methods and concepts for a combined interactive and automatic partition scheduling system. This paper is also devoted to basic methods and techniques for modeling and solving this partition scheduling problem. Initial application of our partition scheduling tool has proved successful and demonstrated the suitability of the methods used.},
  language  = {en}
}
@article{DoerrKrejca2021,
  author    = {Doerr, Benjamin and Krejca, Martin Stefan},
  title     = {A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes},
  series = {Theoretical computer science},
  volume    = {851},
  journal   = {Theoretical computer science},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2020.11.028},
  pages     = {121 -- 128},
  year      = {2021},
  abstract  = {With elementary means, we prove a stronger run time guarantee for the univariate marginal distribution algorithm (UMDA) optimizing the LEADINGONES benchmark function in the desirable regime with low genetic drift. If the population size is at least quasilinear, then, with high probability, the UMDA samples the optimum in a number of iterations that is linear in the problem size divided by the logarithm of the UMDA's selection rate. This improves over the previous guarantee, obtained by Dang and Lehre (2015) via the deep level-based population method, both in terms of the run time and by demonstrating further run time gains from small selection rates. Under similar assumptions, we prove a lower bound that matches our upper bound up to constant factors.},
  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}
}
@inproceedings{GruenerMuehleGayvoronskayaetal.2019,
  author    = {Gr{\"u}ner, Andreas and M{\"u}hle, Alexander and Gayvoronskaya, Tatiana and Meinel, Christoph},
  title     = {A quantifiable trustmModel for Blockchain-based identity management},
  series = {IEEE 2018 International Congress on Cybermatics / 2018 IEEE Conferences on Internet of Things, Green Computing and Communications, cyber, physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology},
  booktitle = {IEEE 2018 International Congress on Cybermatics / 2018 IEEE Conferences on Internet of Things, Green Computing and Communications, cyber, physical and Social Computing, Smart Data, Blockchain, Computer and Information Technology},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-1-5386-7975-3},
  doi       = {10.1109/Cybermatics_2018.2018.00250},
  pages     = {1475 -- 1482},
  year      = {2019},
  language  = {en}
}
@inproceedings{HerreHummel2010,
  author    = {Herre, Heinrich and Hummel, Axel},
  title     = {A paraconsistent semantics for generalized logic programs},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41496},
  year      = {2010},
  abstract  = {We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].},
  language  = {en}
}
@misc{NeherKniepertElimelechetal.2016,
  author    = {Neher, Dieter and Kniepert, Juliane and Elimelech, Arik and Koster, L. Jan Anton},
  title     = {A New Figure of Merit for Organic Solar Cells with Transport-limited Photocurrents},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-91414},
  pages     = {9},
  year      = {2016},
  abstract  = {Compared to their inorganic counterparts, organic semiconductors suffer from relatively low charge carrier mobilities. Therefore, expressions derived for inorganic solar cells to correlate characteristic performance parameters to material properties are prone to fail when applied to organic devices. This is especially true for the classical Shockley-equation commonly used to describe current-voltage (JV)-curves, as it assumes a high electrical conductivity of the charge transporting material. Here, an analytical expression for the JV-curves of organic solar cells is derived based on a previously published analytical model. This expression, bearing a similar functional dependence as the Shockley-equation, delivers a new figure of merit α to express the balance between free charge recombination and extraction in low mobility photoactive materials. This figure of merit is shown to determine critical device parameters such as the apparent series resistance and the fill factor.},
  language  = {en}
}
@article{NeherKniepertElimelechetal.2016,
  author    = {Neher, Dieter and Kniepert, Juliane and Elimelech, Arik and Koster, L. Jan Anton},
  title     = {A New Figure of Merit for Organic Solar Cells with Transport-limited Photocurrents},
  series = {Scientific reports},
  volume    = {6},
  journal   = {Scientific reports},
  publisher = {Nature Publishing Group},
  address   = {London},
  issn      = {2045-2322},
  doi       = {10.1038/srep24861},
  pages     = {9},
  year      = {2016},
  abstract  = {Compared to their inorganic counterparts, organic semiconductors suffer from relatively low charge carrier mobilities. Therefore, expressions derived for inorganic solar cells to correlate characteristic performance parameters to material properties are prone to fail when applied to organic devices. This is especially true for the classical Shockley-equation commonly used to describe current-voltage (JV)-curves, as it assumes a high electrical conductivity of the charge transporting material. Here, an analytical expression for the JV-curves of organic solar cells is derived based on a previously published analytical model. This expression, bearing a similar functional dependence as the Shockley-equation, delivers a new figure of merit α to express the balance between free charge recombination and extraction in low mobility photoactive materials. This figure of merit is shown to determine critical device parameters such as the apparent series resistance and the fill factor.},
  language  = {en}
}
@phdthesis{Ghasemzadeh2005,
  author    = {Ghasemzadeh, Mohammad},
  title     = {A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-6378},
  school      = {Universit{\"a}t Potsdam},
  year      = {2005},
  abstract  = {Quantified Boolean formulas (QBFs) play an important role in theoretical computer science. QBF extends propositional logic in such a way that many advanced forms of reasoning can be easily formulated and evaluated. In this dissertation we present our ZQSAT, which is an algorithm for evaluating quantified Boolean formulas. ZQSAT is based on ZBDD: Zero-Suppressed Binary Decision Diagram , which is a variant of BDD, and an adopted version of the DPLL algorithm. It has been implemented in C using the CUDD: Colorado University Decision Diagram package. The capability of ZBDDs in storing sets of subsets efficiently enabled us to store the clauses of a QBF very compactly and let us to embed the notion of memoization to the DPLL algorithm. These points led us to implement the search algorithm in such a way that we could store and reuse the results of all previously solved subformulas with a little overheads. ZQSAT can solve some sets of standard QBF benchmark problems (known to be hard for DPLL based algorithms) faster than the best existing solvers. In addition to prenex-CNF, ZQSAT accepts prenex-NNF formulas. We show and prove how this capability can be exponentially beneficial.},
  subject      = {Bin{\"a}res Entscheidungsdiagramm},
  language  = {en}
}
@article{NavarroOrejasPinoetal.2021,
  author    = {Navarro, Marisa and Orejas, Fernando and Pino, Elvira and Lambers, Leen},
  title     = {A navigational logic for reasoning about graph properties},
  series = {Journal of logical and algebraic methods in programming},
  volume    = {118},
  journal   = {Journal of logical and algebraic methods in programming},
  publisher = {Elsevier Science},
  address   = {Amsterdam [u.a.]},
  issn      = {2352-2208},
  doi       = {10.1016/j.jlamp.2020.100616},
  pages     = {33},
  year      = {2021},
  abstract  = {Graphs play an important role in many areas of Computer Science. In particular, our work is motivated by model-driven software development and by graph databases. For this reason, it is very important to have the means to express and to reason about the properties that a given graph may satisfy. With this aim, in this paper we present a visual logic that allows us to describe graph properties, including navigational properties, i.e., properties about the paths in a graph. The logic is equipped with a deductive tableau method that we have proved to be sound and complete.},
  language  = {en}
}
@misc{GieseHenklerHirsch2017,
  author    = {Giese, Holger and Henkler, Stefan and Hirsch, Martin},
  title     = {A multi-paradigm approach supporting the modular execution of reconfigurable hybrid systems},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-402896},
  pages     = {34},
  year      = {2017},
  abstract  = {Advanced mechatronic systems have to integrate existing technologies from mechanical, electrical and software engineering. They must be able to adapt their structure and behavior at runtime by reconfiguration to react flexibly to changes in the environment. Therefore, a tight integration of structural and behavioral models of the different domains is required. This integration results in complex reconfigurable hybrid systems, the execution logic of which cannot be addressed directly with existing standard modeling, simulation, and code-generation techniques. We present in this paper how our component-based approach for reconfigurable mechatronic systems, M ECHATRONIC UML, efficiently handles the complex interplay of discrete behavior and continuous behavior in a modular manner. In addition, its extension to even more flexible reconfiguration cases is presented.},
  language  = {en}
}
@article{PerachAlexandron2021,
  author    = {Perach, Shai and Alexandron, Giora},
  title     = {A MOOC-Based Computer Science Program for Middle School},
  series = {EMOOCs 2021},
  volume    = {2021},
  journal   = {EMOOCs 2021},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-512-5},
  doi       = {10.25932/publishup-51713},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-517133},
  pages     = {111 -- 127},
  year      = {2021},
  abstract  = {In an attempt to pave the way for more extensive Computer Science Education (CSE) coverage in K-12, this research developed and made a preliminary evaluation of a blended-learning Introduction to CS program based on an academic MOOC. Using an academic MOOC that is pedagogically effective and engaging, such a program may provide teachers with disciplinary scaffolds and allow them to focus their attention on enhancing students' learning experience and nurturing critical 21st-century skills such as self-regulated learning. As we demonstrate, this enabled us to introduce an academic level course to middle-school students. In this research, we developed the principals and initial version of such a program, targeting ninth-graders in science-track classes who learn CS as part of their standard curriculum. We found that the middle-schoolers who participated in the program achieved academic results on par with undergraduate students taking this MOOC for academic credit. Participating students also developed a more accurate perception of the essence of CS as a scientific discipline. The unplanned school closure due to the COVID19 pandemic outbreak challenged the research but underlined the advantages of such a MOOCbased blended learning program above classic pedagogy in times of global or local crises that lead to school closure. While most of the science track classes seem to stop learning CS almost entirely, and the end-of-year MoE exam was discarded, the program's classes smoothly moved to remote learning mode, and students continued to study at a pace similar to that experienced before the school shut down.},
  language  = {en}
}
@article{Weise2013,
  author    = {Weise, Martin},
  title     = {A model for teaching informatics to German secondary school students in English-language bilingual education},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {6},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64568},
  pages     = {127 -- 137},
  year      = {2013},
  abstract  = {Informatics as a school subject has been virtually absent from bilingual education programs in German secondary schools. Most bilingual programs in German secondary education started out by focusing on subjects from the field of social sciences. Teachers and bilingual curriculum experts alike have been regarding those as the most suitable subjects for bilingual instruction - largely due to the intercultural perspective that a bilingual approach provides. And though one cannot deny the gain that ensues from an intercultural perspective on subjects such as history or geography, this benefit is certainly not limited to social science subjects. In consequence, bilingual curriculum designers have already begun to include other subjects such as physics or chemistry in bilingual school programs. It only seems a small step to extend this to informatics. This paper will start out by addressing potential benefits of adding informatics to the range of subjects taught as part of English-language bilingual programs in German secondary education. In a second step it will sketch out a methodological (= didactical) model for teaching informatics to German learners through English. It will then provide two items of hands-on and tested teaching material in accordance with this model. The discussion will conclude with a brief outlook on the chances and prerequisites of firmly establishing informatics as part of bilingual school curricula in Germany.},
  language  = {en}
}
@article{HartungBorghardt2020,
  author    = {Hartung, Niklas and Borghardt, Jens Markus},
  title     = {A mechanistic framework for a priori pharmacokinetic predictions of orally inhaled drugs},
  series = {PLoS Computational Biology : a new community journal},
  volume    = {16},
  journal   = {PLoS Computational Biology : a new community journal},
  number    = {12},
  publisher = {PLoS},
  address   = {San Fransisco},
  issn      = {1553-734X},
  doi       = {10.1371/journal.pcbi.1008466},
  pages     = {24},
  year      = {2020},
  abstract  = {Author summary <br /> The use of orally inhaled drugs for treating lung diseases is appealing since they have the potential for lung selectivity, i.e. high exposure at the site of action -the lung- without excessive side effects. However, the degree of lung selectivity depends on a large number of factors, including physiochemical properties of drug molecules, patient disease state, and inhalation devices. To predict the impact of these factors on drug exposure and thereby to understand the characteristics of an optimal drug for inhalation, we develop a predictive mathematical framework (a "pharmacokinetic model"). In contrast to previous approaches, our model allows combining knowledge from different sources appropriately and its predictions were able to adequately predict different sets of clinical data. Finally, we compare the impact of different factors and find that the most important factors are the size of the inhaled particles, the affinity of the drug to the lung tissue, as well as the rate of drug dissolution in the lung. In contrast to the common belief, the solubility of a drug in the lining fluids is not found to be relevant. These findings are important to understand how inhaled drugs should be designed to achieve best treatment results in patients. <br /> The fate of orally inhaled drugs is determined by pulmonary pharmacokinetic processes such as particle deposition, pulmonary drug dissolution, and mucociliary clearance. Even though each single process has been systematically investigated, a quantitative understanding on the interaction of processes remains limited and therefore identifying optimal drug and formulation characteristics for orally inhaled drugs is still challenging. To investigate this complex interplay, the pulmonary processes can be integrated into mathematical models. However, existing modeling attempts considerably simplify these processes or are not systematically evaluated against (clinical) data. In this work, we developed a mathematical framework based on physiologically-structured population equations to integrate all relevant pulmonary processes mechanistically. A tailored numerical resolution strategy was chosen and the mechanistic model was evaluated systematically against data from different clinical studies. Without adapting the mechanistic model or estimating kinetic parameters based on individual study data, the developed model was able to predict simultaneously (i) lung retention profiles of inhaled insoluble particles, (ii) particle size-dependent pharmacokinetics of inhaled monodisperse particles, (iii) pharmacokinetic differences between inhaled fluticasone propionate and budesonide, as well as (iv) pharmacokinetic differences between healthy volunteers and asthmatic patients. Finally, to identify the most impactful optimization criteria for orally inhaled drugs, the developed mechanistic model was applied to investigate the impact of input parameters on both the pulmonary and systemic exposure. Interestingly, the solubility of the inhaled drug did not have any relevant impact on the local and systemic pharmacokinetics. Instead, the pulmonary dissolution rate, the particle size, the tissue affinity, and the systemic clearance were the most impactful potential optimization parameters. In the future, the developed prediction framework should be considered a powerful tool for identifying optimal drug and formulation characteristics.},
  language  = {en}
}
@article{SchneiderLambersOrejas2021,
  author    = {Schneider, Sven and Lambers, Leen and Orejas, Fernando},
  title     = {A logic-based incremental approach to graph repair featuring delta preservation},
  series = {International journal on software tools for technology transfer : STTT},
  volume    = {23},
  journal   = {International journal on software tools for technology transfer : STTT},
  number    = {3},
  publisher = {Springer},
  address   = {Berlin ; Heidelberg},
  issn      = {1433-2779},
  doi       = {10.1007/s10009-020-00584-x},
  pages     = {369 -- 410},
  year      = {2021},
  abstract  = {We introduce a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing graph repairs from which a user may select a graph repair based on non-formalized further requirements. This incremental approach features delta preservation as it allows to restrict the generation of graph repairs to delta-preserving graph repairs, which do not revert the additions and deletions of the most recent consistency-violating graph update. We specify consistency of graphs using the logic of nested graph conditions, which is equivalent to first-order logic on graphs. Technically, the incremental approach encodes if and how the graph under repair satisfies a graph condition using the novel data structure of satisfaction trees, which are adapted incrementally according to the graph updates applied. In addition to the incremental approach, we also present two state-based graph repair algorithms, which restore consistency of a graph independent of the most recent graph update and which generate additional graph repairs using a global perspective on the graph under repair. We evaluate the developed algorithms using our prototypical implementation in the tool AutoGraph and illustrate our incremental approach using a case study from the graph database domain.},
  language  = {en}
}
@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}
}
@article{Arnold2007,
  author    = {Arnold, Holger},
  title     = {A linearized DPLL calculus with learning},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-15421},
  year      = {2007},
  abstract  = {This paper describes the proof calculus LD for clausal propositional logic, which is a linearized form of the well-known DPLL calculus extended by clause learning. It is motivated by the demand to model how current SAT solvers built on clause learning are working, while abstracting from decision heuristics and implementation details. The calculus is proved sound and terminating. Further, it is shown that both the original DPLL calculus and the conflict-directed backtracking calculus with clause learning, as it is implemented in many current SAT solvers, are complete and proof-confluent instances of the LD calculus.},
  language  = {en}
}
@unpublished{Arnold2009,
  author    = {Arnold, Holger},
  title     = {A linearized DPLL calculus with clause learning (2nd, revised version)},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29080},
  year      = {2009},
  abstract  = {Many formal descriptions of DPLL-based SAT algorithms either do not include all essential proof techniques applied by modern SAT solvers or are bound to particular heuristics or data structures. This makes it difficult to analyze proof-theoretic properties or the search complexity of these algorithms. In this paper we try to improve this situation by developing a nondeterministic proof calculus that models the functioning of SAT algorithms based on the DPLL calculus with clause learning. This calculus is independent of implementation details yet precise enough to enable a formal analysis of realistic DPLL-based SAT algorithms.},
  language  = {en}
}
@misc{Wallenta2014,
  author    = {Wallenta, Daniel},
  title     = {A Lefschetz fixed point formula for elliptic quasicomplexes},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch Naturwissenschaftliche Reihe},
  number    = {885},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-43547},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-435471},
  pages     = {577 -- 587},
  year      = {2014},
  abstract  = {In a recent paper, the Lefschetz number for endomorphisms (modulo trace class operators) of sequences of trace class curvature was introduced. We show that this is a well defined, canonical extension of the classical Lefschetz number and establish the homotopy invariance of this number. Moreover, we apply the results to show that the Lefschetz fixed point formula holds for geometric quasiendomorphisms of elliptic quasicomplexes.},
  language  = {en}
}
@article{KreowskyStabernack2021,
  author    = {Kreowsky, Philipp and Stabernack, Christian Benno},
  title     = {A full-featured FPGA-based pipelined architecture for SIFT extraction},
  series = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  volume    = {9},
  journal   = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {New York, NY},
  issn      = {2169-3536},
  doi       = {10.1109/ACCESS.2021.3104387},
  pages     = {128564 -- 128573},
  year      = {2021},
  abstract  = {Image feature detection is a key task in computer vision. Scale Invariant Feature Transform (SIFT) is a prevalent and well known algorithm for robust feature detection. However, it is computationally demanding and software implementations are not applicable for real-time performance. In this paper, a versatile and pipelined hardware implementation is proposed, that is capable of computing keypoints and rotation invariant descriptors on-chip. All computations are performed in single precision floating-point format which makes it possible to implement the original algorithm with little alteration. Various rotation resolutions and filter kernel sizes are supported for images of any resolution up to ultra-high definition. For full high definition images, 84 fps can be processed. Ultra high definition images can be processed at 21 fps.},
  language  = {en}
}
@article{IhdePufahlVoelkeretal.2022,
  author    = {Ihde, Sven and Pufahl, Luise and V{\"o}lker, Maximilian and Goel, Asvin and Weske, Mathias},
  title     = {A framework for modeling and executing task},
  series = {Computing : archives for informatics and numerical computation},
  volume    = {104},
  journal   = {Computing : archives for informatics and numerical computation},
  publisher = {Springer},
  address   = {Wien},
  issn      = {0010-485X},
  doi       = {10.1007/s00607-022-01093-2},
  pages     = {2405 -- 2429},
  year      = {2022},
  abstract  = {As resources are valuable assets, organizations have to decide which resources to allocate to business process tasks in a way that the process is executed not only effectively but also efficiently. Traditional role-based resource allocation leads to effective process executions, since each task is performed by a resource that has the required skills and competencies to do so. However, the resulting allocations are typically not as efficient as they could be, since optimization techniques have yet to find their way in traditional business process management scenarios. On the other hand, operations research provides a rich set of analytical methods for supporting problem-specific decisions on resource allocation. This paper provides a novel framework for creating transparency on existing tasks and resources, supporting individualized allocations for each activity in a process, and the possibility to integrate problem-specific analytical methods of the operations research domain. To validate the framework, the paper reports on the design and prototypical implementation of a software architecture, which extends a traditional process engine with a dedicated resource management component. This component allows us to define specific resource allocation problems at design time, and it also facilitates optimized resource allocation at run time. The framework is evaluated using a real-world parcel delivery process. The evaluation shows that the quality of the allocation results increase significantly with a technique from operations research in contrast to the traditional applied rule-based approach.},
  language  = {en}
}
@article{KaitouaRablMarkl2020,
  author    = {Kaitoua, Abdulrahman and Rabl, Tilmann and Markl, Volker},
  title     = {A distributed data exchange engine for polystores},
  series = {Information technology : methods and applications of informatics and information technology},
  volume    = {62},
  journal   = {Information technology : methods and applications of informatics and information technology},
  number    = {3-4},
  publisher = {De Gruyter},
  address   = {Berlin},
  issn      = {1611-2776},
  doi       = {10.1515/itit-2019-0037},
  pages     = {145 -- 156},
  year      = {2020},
  abstract  = {There is an increasing interest in fusing data from heterogeneous sources. Combining data sources increases the utility of existing datasets, generating new information and creating services of higher quality. A central issue in working with heterogeneous sources is data migration: In order to share and process data in different engines, resource intensive and complex movements and transformations between computing engines, services, and stores are necessary. Muses is a distributed, high-performance data migration engine that is able to interconnect distributed data stores by forwarding, transforming, repartitioning, or broadcasting data among distributed engines' instances in a resource-, cost-, and performance-adaptive manner. As such, it performs seamless information sharing across all participating resources in a standard, modular manner. We show an overall improvement of 30 \% for pipelining jobs across multiple engines, even when we count the overhead of Muses in the execution time. This performance gain implies that Muses can be used to optimise large pipelines that leverage multiple engines.},
  language  = {en}
}
@article{StaufferMengeshaSeifertetal.2022,
  author    = {Stauffer, Maxime and Mengesha, Isaak and Seifert, Konrad and Krawczuk, Igor and Fischer, Jens and Serugendo, Giovanna Di Marzo},
  title     = {A computational turn in policy process studies},
  series = {Complexity},
  volume    = {2022},
  journal   = {Complexity},
  publisher = {Wiley-Hindawi},
  address   = {London},
  issn      = {1076-2787},
  doi       = {10.1155/2022/8210732},
  pages     = {17},
  year      = {2022},
  abstract  = {The past three decades of policy process studies have seen the emergence of a clear intellectual lineage with regard to complexity. Implicitly or explicitly, scholars have employed complexity theory to examine the intricate dynamics of collective action in political contexts. However, the methodological counterparts to complexity theory, such as computational methods, are rarely used and, even if they are, they are often detached from established policy process theory. Building on a critical review of the application of complexity theory to policy process studies, we present and implement a baseline model of policy processes using the logic of coevolving networks. Our model suggests that an actor's influence depends on their environment and on exogenous events facilitating dialogue and consensus-building. Our results validate previous opinion dynamics models and generate novel patterns. Our discussion provides ground for further research and outlines the path for the field to achieve a computational turn.},
  language  = {en}
}
@phdthesis{Awad2010,
  author    = {Awad, Ahmed Mahmoud Hany Aly},
  title     = {A compliance management framework for business process models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-49222},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Companies develop process models to explicitly describe their business operations. In the same time, business operations, business processes, must adhere to various types of compliance requirements. Regulations, e.g., Sarbanes Oxley Act of 2002, internal policies, best practices are just a few sources of compliance requirements. In some cases, non-adherence to compliance requirements makes the organization subject to legal punishment. In other cases, non-adherence to compliance leads to loss of competitive advantage and thus loss of market share. Unlike the classical domain-independent behavioral correctness of business processes, compliance requirements are domain-specific. Moreover, compliance requirements change over time. New requirements might appear due to change in laws and adoption of new policies. Compliance requirements are offered or enforced by different entities that have different objectives behind these requirements. Finally, compliance requirements might affect different aspects of business processes, e.g., control flow and data flow. As a result, it is infeasible to hard-code compliance checks in tools. Rather, a repeatable process of modeling compliance rules and checking them against business processes automatically is needed. This thesis provides a formal approach to support process design-time compliance checking. Using visual patterns, it is possible to model compliance requirements concerning control flow, data flow and conditional flow rules. Each pattern is mapped into a temporal logic formula. The thesis addresses the problem of consistency checking among various compliance requirements, as they might stem from divergent sources. Also, the thesis contributes to automatically check compliance requirements against process models using model checking. We show that extra domain knowledge, other than expressed in compliance rules, is needed to reach correct decisions. In case of violations, we are able to provide a useful feedback to the user. The feedback is in the form of parts of the process model whose execution causes the violation. In some cases, our approach is capable of providing automated remedy of the violation.},
  language  = {en}
}
@article{DagieneJevsikovaSchuleetal.2013,
  author    = {Dagiene, Valentina and Jevsikova, Tatjana and Schule, Carsten and Sentance, Sue and Thota, Neena},
  title     = {A comparison of current trends within computer science teaching in school in Germany and the UK},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {6},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64504},
  pages     = {63 -- 75},
  year      = {2013},
  abstract  = {In the last two years, CS as a school subject has gained a lot of attention worldwide, although different countries have differing approaches to and experiences of introducing CS in schools. This paper reports on a study comparing current trends in CS at school, with a major focus on two countries, Germany and UK. A survey was carried out of a number of teaching professionals and experts from the UK and Germany with regard to the content and delivery of CS in school. An analysis of the quantitative data reveals a difference in foci in the two countries; putting this into the context of curricular developments we are able to offer interpretations of these trends and suggest ways in which curricula in CS at school should be moving forward.},
  language  = {en}
}
@phdthesis{Holz2013,
  author    = {Holz, Christian},
  title     = {3D from 2D touch},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-67796},
  school      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {While interaction with computers used to be dominated by mice and keyboards, new types of sensors now allow users to interact through touch, speech, or using their whole body in 3D space. These new interaction modalities are often referred to as "natural user interfaces" or "NUIs." While 2D NUIs have experienced major success on billions of mobile touch devices sold, 3D NUI systems have so far been unable to deliver a mobile form factor, mainly due to their use of cameras. The fact that cameras require a certain distance from the capture volume has prevented 3D NUI systems from reaching the flat form factor mobile users expect. In this dissertation, we address this issue by sensing 3D input using flat 2D sensors. The systems we present observe the input from 3D objects as 2D imprints upon physical contact. By sampling these imprints at very high resolutions, we obtain the objects' textures. In some cases, a texture uniquely identifies a biometric feature, such as the user's fingerprint. In other cases, an imprint stems from the user's clothing, such as when walking on multitouch floors. By analyzing from which part of the 3D object the 2D imprint results, we reconstruct the object's pose in 3D space. While our main contribution is a general approach to sensing 3D input on 2D sensors upon physical contact, we also demonstrate three applications of our approach. (1) We present high-accuracy touch devices that allow users to reliably touch targets that are a third of the size of those on current touch devices. We show that different users and 3D finger poses systematically affect touch sensing, which current devices perceive as random input noise. We introduce a model for touch that compensates for this systematic effect by deriving the 3D finger pose and the user's identity from each touch imprint. We then investigate this systematic effect in detail and explore how users conceptually touch targets. Our findings indicate that users aim by aligning visual features of their fingers with the target. We present a visual model for touch input that eliminates virtually all systematic effects on touch accuracy. (2) From each touch, we identify users biometrically by analyzing their fingerprints. Our prototype Fiberio integrates fingerprint scanning and a display into the same flat surface, solving a long-standing problem in human-computer interaction: secure authentication on touchscreens. Sensing 3D input and authenticating users upon touch allows Fiberio to implement a variety of applications that traditionally require the bulky setups of current 3D NUI systems. (3) To demonstrate the versatility of 3D reconstruction on larger touch surfaces, we present a high-resolution pressure-sensitive floor that resolves the texture of objects upon touch. Using the same principles as before, our system GravitySpace analyzes all imprints and identifies users based on their shoe soles, detects furniture, and enables accurate touch input using feet. By classifying all imprints, GravitySpace detects the users' body parts that are in contact with the floor and then reconstructs their 3D body poses using inverse kinematics. GravitySpace thus enables a range of applications for future 3D NUI systems based on a flat sensor, such as smart rooms in future homes. We conclude this dissertation by projecting into the future of mobile devices. Focusing on the mobility aspect of our work, we explore how NUI devices may one day augment users directly in the form of implanted devices.},
  language  = {en}
}
@inproceedings{OPUS4-39635,
  title     = {11. Workshop Testmethoden und Zuverl{\"a}ssigkeit von Schaltungen und Systemen},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-9806494-1-4},
  pages     = {137 Seiten},
  year      = {1999},
  language  = {de}
}
@article{SentanceHodges2013,
  author    = {Sentance, Sue and Hodges, Steve},
  title     = {.NET Gadgeteer Workshop},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {6},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64654},
  pages     = {159},
  year      = {2013},
  language  = {en}
}
@article{vonSteinauSteinrueckBeismann2020,
  author    = {von Steinau-Steinr{\"u}ck, Robert and Beismann, Lukas},
  title     = {(Corona-)Homeoffice und betriebliche {\"U}bung},
  series = {NJW spezial},
  volume    = {17},
  journal   = {NJW spezial},
  number    = {20},
  publisher = {C.H. Beck},
  address   = {M{\"u}nchen},
  issn      = {1613-4621},
  pages     = {626 -- 627},
  year      = {2020},
  abstract  = {Homeoffice und mobiles Arbeiten haben sich infolge der Covid-19-Pandemie bei vielen Unternehmen bekanntlich etabliert. Die Anweisung bzw. „Duldung" des Homeoffice beruhte allerdings meist mehr auf tats{\"a}chlicher als auf rechtlicher Grundlage. Letztere k{\"o}nnte aber aus betrieblicher {\"U}bung erwachsen. Dieser Beitrag geht dem rechtlichen Rahmen daf{\"u}r nach.},
  language  = {de}
}