@phdthesis{AbdelwahabHusseinAbdelwahabElsayed2019,
  author    = {Abdelwahab Hussein Abdelwahab Elsayed, Ahmed},
  title     = {Probabilistic, deep, and metric learning for biometric identification from eye movements},
  doi       = {10.25932/publishup-46798},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-467980},
  school      = {Universit{\"a}t Potsdam},
  pages     = {vi, 65},
  year      = {2019},
  abstract  = {A central insight from psychological studies on human eye movements is that eye movement patterns are highly individually characteristic. They can, therefore, be used as a biometric feature, that is, subjects can be identified based on their eye movements. This thesis introduces new machine learning methods to identify subjects based on their eye movements while viewing arbitrary content. The thesis focuses on probabilistic modeling of the problem, which has yielded the best results in the most recent literature. The thesis studies the problem in three phases by proposing a purely probabilistic, probabilistic deep learning, and probabilistic deep metric learning approach. In the first phase, the thesis studies models that rely on psychological concepts about eye movements. Recent literature illustrates that individual-specific distributions of gaze patterns can be used to accurately identify individuals. In these studies, models were based on a simple parametric family of distributions. Such simple parametric models can be robustly estimated from sparse data, but have limited flexibility to capture the differences between individuals. Therefore, this thesis proposes a semiparametric model of gaze patterns that is flexible yet robust for individual identification. These patterns can be understood as domain knowledge derived from psychological literature. Fixations and saccades are examples of simple gaze patterns. The proposed semiparametric densities are drawn under a Gaussian process prior centered at a simple parametric distribution. Thus, the model will stay close to the parametric class of densities if little data is available, but it can also deviate from this class if enough data is available, increasing the flexibility of the model. The proposed method is evaluated on a large-scale dataset, showing significant improvements over the state-of-the-art. Later, the thesis replaces the model based on gaze patterns derived from psychological concepts with a deep neural network that can learn more informative and complex patterns from raw eye movement data. As previous work has shown that the distribution of these patterns across a sequence is informative, a novel statistical aggregation layer called the quantile layer is introduced. It explicitly fits the distribution of deep patterns learned directly from the raw eye movement data. The proposed deep learning approach is end-to-end learnable, such that the deep model learns to extract informative, short local patterns while the quantile layer learns to approximate the distributions of these patterns. Quantile layers are a generic approach that can converge to standard pooling layers or have a more detailed description of the features being pooled, depending on the problem. The proposed model is evaluated in a large-scale study using the eye movements of subjects viewing arbitrary visual input. The model improves upon the standard pooling layers and other statistical aggregation layers proposed in the literature. It also improves upon the state-of-the-art eye movement biometrics by a wide margin. Finally, for the model to identify any subject — not just the set of subjects it is trained on — a metric learning approach is developed. Metric learning learns a distance function over instances. The metric learning model maps the instances into a metric space, where sequences of the same individual are close, and sequences of different individuals are further apart. This thesis introduces a deep metric learning approach with distributional embeddings. The approach represents sequences as a set of continuous distributions in a metric space; to achieve this, a new loss function based on Wasserstein distances is introduced. The proposed method is evaluated on multiple domains besides eye movement biometrics. This approach outperforms the state of the art in deep metric learning in several domains while also outperforming the state of the art in eye movement biometrics.},
  language  = {en}
}
@article{AbkeSchwirtlichSedelmaier2013,
  author    = {Abke, J{\"o}rg and Schwirtlich, Vincent and Sedelmaier, Yvonne},
  title     = {Kompetenzf{\"o}rderung im Software Engineering durch ein mehrstufiges Lehrkonzept im Studiengang Mechatronik},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64899},
  pages     = {79 -- 84},
  year      = {2013},
  abstract  = {Dieser Beitrag stellt das Lehr-Lern-Konzept zur Kompetenzf{\"o}rderung im Software Engineering im Studiengang Mechatronik der Hochschule Aschaffenburg dar. Dieses Konzept ist mehrstufig mit Vorlesungs-, Seminar- und Projektsequenzen. Dabei werden Herausforderungen und Verbesserungspotentiale identifiziert und dargestellt. Abschließend wird ein {\"U}berblick gegeben, wie im Rahmen eines gerade gestarteten Forschungsprojektes Lehr-Lernkonzepte weiterentwickelt werden k{\"o}nnen.},
  language  = {de}
}
@misc{AfantenosPeldszusStede2018,
  author    = {Afantenos, Stergos and Peldszus, Andreas and Stede, Manfred},
  title     = {Comparing decoding mechanisms for parsing argumentative structures},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {1062},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-47052},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-470527},
  pages     = {18},
  year      = {2018},
  abstract  = {Parsing of argumentative structures has become a very active line of research in recent years. Like discourse parsing or any other natural language task that requires prediction of linguistic structures, most approaches choose to learn a local model and then perform global decoding over the local probability distributions, often imposing constraints that are specific to the task at hand. Specifically for argumentation parsing, two decoding approaches have been recently proposed: Minimum Spanning Trees (MST) and Integer Linear Programming (ILP), following similar trends in discourse parsing. In contrast to discourse parsing though, where trees are not always used as underlying annotation schemes, argumentation structures so far have always been represented with trees. Using the 'argumentative microtext corpus' [in: Argumentation and Reasoned Action: Proceedings of the 1st European Conference on Argumentation, Lisbon 2015 / Vol. 2, College Publications, London, 2016, pp. 801-815] as underlying data and replicating three different decoding mechanisms, in this paper we propose a novel ILP decoder and an extension to our earlier MST work, and then thoroughly compare the approaches. The result is that our new decoder outperforms related work in important respects, and that in general, ILP and MST yield very similar performance.},
  language  = {en}
}
@misc{AguadoCabalarFandinnoetal.2019,
  author    = {Aguado, Felicidad and Cabalar, Pedro and Fandinno, Jorge and Pearce, David and Perez, Gilberto and Vidal, Concepcion},
  title     = {Revisiting explicit negation in answer set programming},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {1104},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-46969},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-469697},
  pages     = {908 -- 924},
  year      = {2019},
  abstract  = {A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in front of atoms, rather than allowing its use as a regular operator. In this paper we consider the arbitrary combination of explicit negation with nested expressions, as those defined by Lifschitz, Tang and Turner. We extend the concept of reduct for this new syntax and then prove that it can be captured by an extension of Equilibrium Logic with this second negation. We study some properties of this variant and compare to the already known combination of Equilibrium Logic with Nelson's strong negation.},
  language  = {en}
}
@phdthesis{Ahmad2014,
  author    = {Ahmad, Nadeem},
  title     = {People centered HMI's for deaf and functionally illiterate users},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-70391},
  school      = {Universit{\"a}t Potsdam},
  year      = {2014},
  abstract  = {The objective and motivation behind this research is to provide applications with easy-to-use interfaces to communities of deaf and functionally illiterate users, which enables them to work without any human assistance. Although recent years have witnessed technological advancements, the availability of technology does not ensure accessibility to information and communication technologies (ICT). Extensive use of text from menus to document contents means that deaf or functionally illiterate can not access services implemented on most computer software. Consequently, most existing computer applications pose an accessibility barrier to those who are unable to read fluently. Online technologies intended for such groups should be developed in continuous partnership with primary users and include a thorough investigation into their limitations, requirements and usability barriers. In this research, I investigated existing tools in voice, web and other multimedia technologies to identify learning gaps and explored ways to enhance the information literacy for deaf and functionally illiterate users. I worked on the development of user-centered interfaces to increase the capabilities of deaf and low literacy users by enhancing lexical resources and by evaluating several multimedia interfaces for them. The interface of the platform-independent Italian Sign Language (LIS) Dictionary has been developed to enhance the lexical resources for deaf users. The Sign Language Dictionary accepts Italian lemmas as input and provides their representation in the Italian Sign Language as output. The Sign Language dictionary has 3082 signs as set of Avatar animations in which each sign is linked to a corresponding Italian lemma. I integrated the LIS lexical resources with MultiWordNet (MWN) database to form the first LIS MultiWordNet(LMWN). LMWN contains information about lexical relations between words, semantic relations between lexical concepts (synsets), correspondences between Italian and sign language lexical concepts and semantic fields (domains). The approach enhances the deaf users' understanding of written Italian language and shows that a relatively small set of lexicon can cover a significant portion of MWN. Integration of LIS signs with MWN made it useful tool for computational linguistics and natural language processing. The rule-based translation process from written Italian text to LIS has been transformed into service-oriented system. The translation process is composed of various modules including parser, semantic interpreter, generator, and spatial allocation planner. This translation procedure has been implemented in the Java Application Building Center (jABC), which is a framework for extreme model driven design (XMDD). The XMDD approach focuses on bringing software development closer to conceptual design, so that the functionality of a software solution could be understood by someone who is unfamiliar with programming concepts. The transformation addresses the heterogeneity challenge and enhances the re-usability of the system. For enhancing the e-participation of functionally illiterate users, two detailed studies were conducted in the Republic of Rwanda. In the first study, the traditional (textual) interface was compared with the virtual character-based interactive interface. The study helped to identify usability barriers and users evaluated these interfaces according to three fundamental areas of usability, i.e. effectiveness, efficiency and satisfaction. In another study, we developed four different interfaces to analyze the usability and effects of online assistance (consistent help) for functionally illiterate users and compared different help modes including textual, vocal and virtual character on the performance of semi-literate users. In our newly designed interfaces the instructions were automatically translated in Swahili language. All the interfaces were evaluated on the basis of task accomplishment, time consumption, System Usability Scale (SUS) rating and number of times the help was acquired. The results show that the performance of semi-literate users improved significantly when using the online assistance. The dissertation thus introduces a new development approach in which virtual characters are used as additional support for barely literate or naturally challenged users. Such components enhanced the application utility by offering a variety of services like translating contents in local language, providing additional vocal information, and performing automatic translation from text to sign language. Obviously, there is no such thing as one design solution that fits for all in the underlying domain. Context sensitivity, literacy and mental abilities are key factors on which I concentrated and the results emphasize that computer interfaces must be based on a thoughtful definition of target groups, purposes and objectives.},
  language  = {en}
}
@misc{AlLabanRegerLucke2022,
  author    = {Al Laban, Firas and Reger, Martin and Lucke, Ulrike},
  title     = {Closing the Policy Gap in the Academic Bridge},
  series = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Zweitver{\"o}ffentlichungen der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {1310},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-58357},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-583572},
  pages     = {22},
  year      = {2022},
  abstract  = {The highly structured nature of the educational sector demands effective policy mechanisms close to the needs of the field. That is why evidence-based policy making, endorsed by the European Commission under Erasmus+ Key Action 3, aims to make an alignment between the domains of policy and practice. Against this background, this article addresses two issues: First, that there is a vertical gap in the translation of higher-level policies to local strategies and regulations. Second, that there is a horizontal gap between educational domains regarding the policy awareness of individual players. This was analyzed in quantitative and qualitative studies with domain experts from the fields of virtual mobility and teacher training. From our findings, we argue that the combination of both gaps puts the academic bridge from secondary to tertiary education at risk, including the associated knowledge proficiency levels. We discuss the role of digitalization in the academic bridge by asking the question: which value does the involved stakeholders expect from educational policies? As a theoretical basis, we rely on the model of value co-creation for and by stakeholders. We describe the used instruments along with the obtained results and proposed benefits. Moreover, we reflect on the methodology applied, and we finally derive recommendations for future academic bridge policies.},
  language  = {en}
}
@phdthesis{AlAreqi2017,
  author    = {Al-Areqi, Samih Taha Mohammed},
  title     = {Semantics-based automatic geospatial service composition},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-402616},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xvi, 163},
  year      = {2017},
  abstract  = {Although it has become common practice to build applications based on the reuse of existing components or services, technical complexity and semantic challenges constitute barriers to ensuring a successful and wide reuse of components and services. In the geospatial application domain, the barriers are self-evident due to heterogeneous geographic data, a lack of interoperability and complex analysis processes. Constructing workflows manually and discovering proper services and data that match user intents and preferences is difficult and time-consuming especially for users who are not trained in software development. Furthermore, considering the multi-objective nature of environmental modeling for the assessment of climate change impacts and the various types of geospatial data (e.g., formats, scales, and georeferencing systems) increases the complexity challenges. Automatic service composition approaches that provide semantics-based assistance in the process of workflow design have proven to be a solution to overcome these challenges and have become a frequent demand especially by end users who are not IT experts. In this light, the major contributions of this thesis are: (i) Simplification of service reuse and workflow design of applications for climate impact analysis by following the eXtreme Model-Driven Development (XMDD) paradigm. (ii) Design of a semantic domain model for climate impact analysis applications that comprises specifically designed services, ontologies that provide domain-specific vocabulary for referring to types and services, and the input/output annotation of the services using the terms defined in the ontologies. (iii) Application of a constraint-driven method for the automatic composition of workflows for analyzing the impacts of sea-level rise. The application scenario demonstrates the impact of domain modeling decisions on the results and the performance of the synthesis algorithm.},
  language  = {en}
}
@phdthesis{AlSaffar2016,
  author    = {Al-Saffar, Loay Talib Ahmed},
  title     = {Analysing prerequisites, expectations, apprehensions, and attitudes of university students studying Computer science},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-98437},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xii, 131},
  year      = {2016},
  abstract  = {The main objective of this dissertation is to analyse prerequisites, expectations, apprehensions, and attitudes of students studying computer science, who are willing to gain a bachelor degree. The research will also investigate in the students' learning style according to the Felder-Silverman model. These investigations fall in the attempt to make an impact on reducing the "dropout"/shrinkage rate among students, and to suggest a better learning environment. The first investigation starts with a survey that has been made at the computer science department at the University of Baghdad to investigate the attitudes of computer science students in an environment dominated by women, showing the differences in attitudes between male and female students in different study years. Students are accepted to university studies via a centrally controlled admission procedure depending mainly on their final score at school. This leads to a high percentage of students studying subjects they do not want. Our analysis shows that 75\% of the female students do not regret studying computer science although it was not their first choice. And according to statistics over previous years, women manage to succeed in their study and often graduate on top of their class. We finish with a comparison of attitudes between the freshman students of two different cultures and two different university enrolment procedures (University of Baghdad, in Iraq, and the University of Potsdam, in Germany) both with opposite gender majority. The second step of investigation took place at the department of computer science at the University of Potsdam in Germany and analyzes the learning styles of students studying the three major fields of study offered by the department (computer science, business informatics, and computer science teaching). Investigating the differences in learning styles between the students of those study fields who usually take some joint courses is important to be aware of which changes are necessary to be adopted in the teaching methods to address those different students. It was a two stage study using two questionnaires; the main one is based on the Index of Learning Styles Questionnaire of B. A. Solomon and R. M. Felder, and the second questionnaire was an investigation on the students' attitudes towards the findings of their personal first questionnaire. Our analysis shows differences in the preferences of learning style between male and female students of the different study fields, as well as differences between students with the different specialties (computer science, business informatics, and computer science teaching). The third investigation looks closely into the difficulties, issues, apprehensions and expectations of freshman students studying computer science. The study took place at the computer science department at the University of Potsdam with a volunteer sample of students. The goal is to determine and discuss the difficulties and issues that they are facing in their study that may lead them to think in dropping-out, changing the study field, or changing the university. The research continued with the same sample of students (with business informatics students being the majority) through more than three semesters. Difficulties and issues during the study were documented, as well as students' attitudes, apprehensions, and expectations. Some of the professors and lecturers opinions and solutions to some students' problems were also documented. Many participants had apprehensions and difficulties, especially towards informatics subjects. Some business informatics participants began to think of changing the university, in particular when they reached their third semester, others thought about changing their field of study. Till the end of this research, most of the participants continued in their studies (the study they have started with or the new study they have changed to) without leaving the higher education system.},
  language  = {en}
}
@article{AlSaffar2013,
  author    = {Al-Saffar, Loay Talib Ahmed},
  title     = {Where girls take the role of boys in CS},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-65034},
  pages     = {149 -- 154},
  year      = {2013},
  abstract  = {A survey has been carried out in the Computer Science (CS) department at the University of Baghdad to investigate the attitudes of CS students in a female dominant environment, showing the differences between male and female students in different academic years. We also compare the attitudes of the freshman students of two different cultures (University of Baghdad, Iraq, and the University of Potsdam).},
  language  = {en}
}
@phdthesis{Andjelkovic2021,
  author    = {Andjelkovic, Marko},
  title     = {A methodology for characterization, modeling and mitigation of single event transient effects in CMOS standard combinational cells},
  doi       = {10.25932/publishup-53484},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-534843},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xxiv, 216},
  year      = {2021},
  abstract  = {With the downscaling of CMOS technologies, the radiation-induced Single Event Transient (SET) effects in combinational logic have become a critical reliability issue for modern integrated circuits (ICs) intended for operation under harsh radiation conditions. The SET pulses generated in combinational logic may propagate through the circuit and eventually result in soft errors. It has thus become an imperative to address the SET effects in the early phases of the radiation-hard IC design. In general, the soft error mitigation solutions should accommodate both static and dynamic measures to ensure the optimal utilization of available resources. An efficient soft-error-aware design should address synergistically three main aspects: (i) characterization and modeling of soft errors, (ii) multi-level soft error mitigation, and (iii) online soft error monitoring. Although significant results have been achieved, the effectiveness of SET characterization methods, accuracy of predictive SET models, and efficiency of SET mitigation measures are still critical issues. Therefore, this work addresses the following topics: (i) Characterization and modeling of SET effects in standard combinational cells, (ii) Static mitigation of SET effects in standard combinational cells, and (iii) Online particle detection, as a support for dynamic soft error mitigation. Since the standard digital libraries are widely used in the design of radiation-hard ICs, the characterization of SET effects in standard cells and the availability of accurate SET models for the Soft Error Rate (SER) evaluation are the main prerequisites for efficient radiation-hard design. This work introduces an approach for the SPICE-based standard cell characterization with the reduced number of simulations, improved SET models and optimized SET sensitivity database. It has been shown that the inherent similarities in the SET response of logic cells for different input levels can be utilized to reduce the number of required simulations. Based on characterization results, the fitting models for the SET sensitivity metrics (critical charge, generated SET pulse width and propagated SET pulse width) have been developed. The proposed models are based on the principle of superposition, and they express explicitly the dependence of the SET sensitivity of individual combinational cells on design, operating and irradiation parameters. In contrast to the state-of-the-art characterization methodologies which employ extensive look-up tables (LUTs) for storing the simulation results, this work proposes the use of LUTs for storing the fitting coefficients of the SET sensitivity models derived from the characterization results. In that way the amount of characterization data in the SET sensitivity database is reduced significantly. The initial step in enhancing the robustness of combinational logic is the application of gate-level mitigation techniques. As a result, significant improvement of the overall SER can be achieved with minimum area, delay and power overheads. For the SET mitigation in standard cells, it is essential to employ the techniques that do not require modifying the cell structure. This work introduces the use of decoupling cells for improving the robustness of standard combinational cells. By insertion of two decoupling cells at the output of a target cell, the critical charge of the cell's output node is increased and the attenuation of short SETs is enhanced. In comparison to the most common gate-level techniques (gate upsizing and gate duplication), the proposed approach provides better SET filtering. However, as there is no single gate-level mitigation technique with optimal performance, a combination of multiple techniques is required. This work introduces a comprehensive characterization of gate-level mitigation techniques aimed to quantify their impact on the SET robustness improvement, as well as introduced area, delay and power overhead per gate. By characterizing the gate-level mitigation techniques together with the standard cells, the required effort in subsequent SER analysis of a target design can be reduced. The characterization database of the hardened standard cells can be utilized as a guideline for selection of the most appropriate mitigation solution for a given design. As a support for dynamic soft error mitigation techniques, it is important to enable the online detection of energetic particles causing the soft errors. This allows activating the power-greedy fault-tolerant configurations based on N-modular redundancy only at the high radiation levels. To enable such a functionality, it is necessary to monitor both the particle flux and the variation of particle LET, as these two parameters contribute significantly to the system SER. In this work, a particle detection approach based on custom-sized pulse stretching inverters is proposed. Employing the pulse stretching inverters connected in parallel enables to measure the particle flux in terms of the number of detected SETs, while the particle LET variations can be estimated from the distribution of SET pulse widths. This approach requires a purely digital processing logic, in contrast to the standard detectors which require complex mixed-signal processing. Besides the possibility of LET monitoring, additional advantages of the proposed particle detector are low detection latency and power consumption, and immunity to error accumulation. The results achieved in this thesis can serve as a basis for establishment of an overall soft-error-aware database for a given digital library, and a comprehensive multi-level radiation-hard design flow that can be implemented with the standard IC design tools. The following step will be to evaluate the achieved results with the irradiation experiments.},
  language  = {en}
}
@article{ApelBergBergneretal.2013,
  author    = {Apel, Rebecca and Berg, Tobias and Bergner, Nadine and Chatti, Mhamed Amine and Holz, Jan and Leicht-Scholten, Carmen and Schroeder, Ulrike},
  title     = {Ein vierstufiges F{\"o}rderkonzept f{\"u}r die Studieneingangsphase in der Informatik},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-65025},
  pages     = {143 -- 148},
  year      = {2013},
  abstract  = {Es wird ein vierstufiges F{\"o}rderkonzept f{\"u}r die Studieneingangsphase im Fach Informatik beschrieben, das derzeit im Rahmen des Projekts IGaDtools4MINT an der RWTH Aachen auf der Basis einer Literaturanalyse und eines daraus abgeleiteten Indikatorenkatalogs entwickelt wird.},
  language  = {de}
}
@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}
}
@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{BarnesKennewell2015,
  author    = {Barnes, Jan and Kennewell, Steve},
  title     = {Teacher Perceptions of Key Competencies in ICT},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82604},
  pages     = {61 -- 75},
  year      = {2015},
  abstract  = {Regardless of what is intended by government curriculum specifications and advised by educational experts, the competencies taught and learned in and out of classrooms can vary considerably. In this paper, we discuss in particular how we can investigate the perceptions that individual teachers have of competencies in ICT, and how these and other factors may influence students' learning. We report case study research which identifies contradictions within the teaching of ICT competencies as an activity system, highlighting issues concerning the object of the curriculum, the roles of the participants and the school cultures. In a particular case, contradictions in the learning objectives between higher order skills and the use of application tools have been resolved by a change in the teacher's perceptions which have not led to changes in other aspects of the activity system. We look forward to further investigation of the effects of these contradictions in other case studies and on forthcoming curriculum change.},
  language  = {en}
}
@article{BenderSteinert2009,
  author    = {Bender, Katrin and Steinert, Markus},
  title     = {Ein handlungsorientiertes, didaktisches Training f{\"u}r Tutoren im Bachelorstudium der Informatik},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {1},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29690},
  pages     = {119 -- 130},
  year      = {2009},
  abstract  = {Die didaktisch-p{\"a}dagogische Ausbildung studentischer Tutoren f{\"u}r den Einsatz im Bachelorstudium der Informatik ist Gegenstand dieser Arbeit. Um die theoretischen Inhalte aus Sozial- und Lernpsychologie handlungsorientiert und effizient zu vermitteln, wird das Training als Lehrform gew{\"a}hlt. Die in einer Tutor{\"u}bung zentrale Methode der Gruppenarbeit wird dabei explizit und implizit vermittelt. Erste praktische Erfahrungen mit ihrer zuk{\"u}nftigen Rolle gewinnen die Tutoren in Rollenspielen, wobei sowohl Standardsituationen als auch fachspezifisch und p{\"a}dagogisch problematische Situationen simuliert werden. W{\"a}hrend die Vermittlung der genannten Inhalte und die Rollenspiele im Rahmen einer Blockveranstaltung vor Beginn des Semesters durchgef{\"u}hrt werden, finden w{\"a}hrend des Semesters Hospitationen statt, in der die F{\"a}higkeiten der Tutoren anhand eines standardisierten Bewertungsbogens beurteilt werden.},
  language  = {de}
}
@article{BergesHubwieser2010,
  author    = {Berges, Marc and Hubwieser, Peter},
  title     = {Vorkurse in objektorientierter Programmierung},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {4},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64299},
  pages     = {13 -- 22},
  year      = {2010},
  abstract  = {Die Studienanf{\"a}nger der Informatik haben in Deutschland sehr unterschiedliche Grundkenntnisse in der Programmierung. Dies f{\"u}hrt immer wieder zu Schwierigkeiten in der Ausrichtung der Einf{\"u}hrungsveranstaltungen. An der TU M{\"u}nchen wird seit dem Wintersemester 2008/2009 nun eine neue Art von Vorkursen angeboten. In nur 2,5 Tagen erstellen die Teilnehmer ein kleines objektorientiertes Programm. Dabei arbeiten sie weitestgehend alleine, unterst{\"u}tzt von einem studentischen Tutor. In dieser Arbeit sollen nun das Konzept der sogenannten „Vorprojekte" sowie erste Forschungsans{\"a}tze vorgestellt werden},
  language  = {de}
}
@article{BergesMuehlingHubwieseretal.2013,
  author    = {Berges, Marc and M{\"u}hling, Andreas and Hubwieser, Peter and Steuer, Horst},
  title     = {Informatik f{\"u}r Nichtinformatiker},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64962},
  pages     = {105 -- 110},
  year      = {2013},
  abstract  = {Wir stellen die Konzeption und erste Ergebnisse einer neuartigen Informatik- Lehrveranstaltung f{\"u}r Studierende der Geod{\"a}sie vor. Das Konzept verbindet drei didaktische Ideen: Kontextorientierung, Peer-Tutoring und Praxisbezug (Course). Die Studierenden sollen dabei in zwei Semestern wichtige Grundlagen der Informatik verstehen und anzuwenden lernen. Durch enge Verzahnung der Aufgaben mit einem f{\"u}r Nichtinformatiker relevanten Kontext, sowie einem sehr hohen Anteil von Selbstt{\"a}tigkeit der Studierenden soll die Motivation f{\"u}r fachfremde Themen gesteigert werden. Die Ergebnisse zeigen, dass die Veranstaltung sehr erfolgreich war.},
  language  = {de}
}
@article{BergnerTaraschewskiSchroeder2015,
  author    = {Bergner, Nadine and Taraschewski, Christian and Schroeder, Ulrik},
  title     = {Beispiel eines Sch{\"u}lerwettbewerbs zum Thema Projektmanagement und App-Programmierung},
  series = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  volume    = {2015},
  journal   = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  number    = {9},
  editor    = {Schubert, Sigrid and Schwill, Andreas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-84726},
  pages     = {161 -- 168},
  year      = {2015},
  abstract  = {Es wird ein Informatik-Wettbewerb f{\"u}r Sch{\"u}lerinnen und Sch{\"u}ler der Sekundarstufe II beschrieben, der {\"u}ber mehrere Wochen m{\"o}glichst realit{\"a}tsnah die Arbeitswelt eines Informatikers vorstellt. Im Wettbewerb erarbeiten die Sch{\"u}lerteams eine Android-App und organisieren ihre Entwicklung durch Projektmanagementmethoden, die sich an professionellen, agilen Prozessen orientieren. Im Beitrag werden der theoretische Hintergrund zu Wettbewerben, die organisatorischen und didaktischen Entscheidung, eine erste Evaluation sowie Reflexion und Ausblick dargestellt.},
  language  = {de}
}
@phdthesis{Bickel2008,
  author    = {Bickel, Steffen},
  title     = {Learning under differing training and test distributions},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-33331},
  school      = {Universit{\"a}t Potsdam},
  year      = {2008},
  abstract  = {One of the main problems in machine learning is to train a predictive model from training data and to make predictions on test data. Most predictive models are constructed under the assumption that the training data is governed by the exact same distribution which the model will later be exposed to. In practice, control over the data collection process is often imperfect. A typical scenario is when labels are collected by questionnaires and one does not have access to the test population. For example, parts of the test population are underrepresented in the survey, out of reach, or do not return the questionnaire. In many applications training data from the test distribution are scarce because they are difficult to obtain or very expensive. Data from auxiliary sources drawn from similar distributions are often cheaply available. This thesis centers around learning under differing training and test distributions and covers several problem settings with different assumptions on the relationship between training and test distributions-including multi-task learning and learning under covariate shift and sample selection bias. Several new models are derived that directly characterize the divergence between training and test distributions, without the intermediate step of estimating training and test distributions separately. The integral part of these models are rescaling weights that match the rescaled or resampled training distribution to the test distribution. Integrated models are studied where only one optimization problem needs to be solved for learning under differing distributions. With a two-step approximation to the integrated models almost any supervised learning algorithm can be adopted to biased training data. In case studies on spam filtering, HIV therapy screening, targeted advertising, and other applications the performance of the new models is compared to state-of-the-art reference methods.},
  language  = {en}
}
@article{BieniusaDegenHeideggeretal.2009,
  author    = {Bieniusa, Annette and Degen, Markus and Heidegger, Phillip and Thiemann, Peter and Wehr, Stefan and Gasbichler, Martin and Crestani, Marcus and Klaeren, Herbert and Knauel, Eric and Sperber, Michael},
  title     = {Auf dem Weg zu einer robusten Programmierausbildung},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {1},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29655},
  pages     = {67 -- 79},
  year      = {2009},
  abstract  = {Die gelungene Durchf{\"u}hrung einer Vorlesung „Informatik I - Einf{\"u}hrung in die Programmierung" ist schwierig, trotz einer Vielfalt existierender Materialien und erprobter didaktischer Methoden. Gerade aufgrund dieser vielf{\"a}ltigen Auswahl hat sich bisher noch kein robustes Konzept durchgesetzt, das unabh{\"a}ngig von den Durchf{\"u}hrenden eine hohe Erfolgsquote garantiert. An den Universit{\"a}ten T{\"u}bingen und Freiburg wurde die Informatik I aus den gleichen Lehrmaterialien und unter {\"a}hnlichen Bedingungen durchgef{\"u}hrt, um das verwendete Konzept auf Robustheit zu {\"u}berpr{\"u}fen. Die Grundlage der Vorlesung bildet ein systematischer Ansatz zum Erlernen des Programmierens, der von der PLTGruppe in USA entwickelt worden ist. Hinzu kommen neue Ans{\"a}tze zur Betreuung, insbesondere das Betreute Programmieren, bei dem die Studierenden eine solide Basis f{\"u}r ihre Programmierf{\"a}higkeiten entwickeln. Der vorliegende Bericht beschreibt hierbei gesammelte Erfahrungen, erl{\"a}utert die Entwicklung der Unterrichtsmethodik und der Inhaltsauswahl im Vergleich zu vorangegangenen Vorlesungen und pr{\"a}sentiert Daten zum Erfolg der Vorlesung.},
  language  = {de}
}
@phdthesis{Blum2010,
  author    = {Blum, Niklas},
  title     = {Formalization of a converged internet and telecommunications service environment},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51146},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {The programmable network envisioned in the 1990s within standardization and research for the Intelligent Network is currently coming into reality using IPbased Next Generation Networks (NGN) and applying Service-Oriented Architecture (SOA) principles for service creation, execution, and hosting. SOA is the foundation for both next-generation telecommunications and middleware architectures, which are rapidly converging on top of commodity transport services. Services such as triple/quadruple play, multimedia messaging, and presence are enabled by the emerging service-oriented IPMultimedia Subsystem (IMS), and allow telecommunications service providers to maintain, if not improve, their position in the marketplace. SOA becomes the de facto standard in next-generation middleware systems as the system model of choice to interconnect service consumers and providers within and between enterprises. We leverage previous research activities in overlay networking technologies along with recent advances in network abstraction, service exposure, and service creation to develop a paradigm for a service environment providing converged Internet and Telecommunications services that we call Service Broker. Such a Service Broker provides mechanisms to combine and mediate between different service paradigms from the two domains Internet/WWW and telecommunications. Furthermore, it enables the composition of services across these domains and is capable of defining and applying temporal constraints during creation and execution time. By adding network-awareness into the service fabric, such a Service Broker may also act as a next generation network-to-service element allowing the composition of crossdomain and cross-layer network and service resources. The contribution of this research is threefold: first, we analyze and classify principles and technologies from Information Technologies (IT) and telecommunications to identify and discuss issues allowing cross-domain composition in a converging service layer. Second, we discuss service composition methods allowing the creation of converged services on an abstract level; in particular, we present a formalized method for model-checking of such compositions. Finally, we propose a Service Broker architecture converging Internet and Telecom services. This environment enables cross-domain feature interaction in services through formalized obligation policies acting as constraints during service discovery, creation, and execution time.},
  language  = {en}
}
@article{BollMeinhardtGronewoldetal.2010,
  author    = {Boll, Susanne and Meinhardt, Rolf and Gronewold, Sabine and Krekeler, Larissa},
  title     = {Informatik f{\"u}r Migratinnen und Migranten Einf{\"u}hrung eines neuen Studienprogramms an der Universit{\"a}t Oldenburg},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {4},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64370},
  pages     = {79 -- 86},
  year      = {2010},
  abstract  = {F{\"u}r die Integration und den Bedarf der hochqualifizierten Migranten auf dem Arbeitsmarkt in Deutschland gibt es viele {\"U}berlegungen, aber noch keine ausreichenden L{\"o}sungen. Dieser Artikel beschreibt eine praktische L{\"o}sung {\"u}ber die Umsetzung des Konzepts f{\"u}r die Qualifizierung der akademischen Migranten am Beispiel eines Studienprogramms in Informatik an der Universit{\"a}t Oldenburg.},
  language  = {de}
}
@phdthesis{Bordihn2011,
  author    = {Bordihn, Henning},
  title     = {Contributions to the syntactical analysis beyond context-freeness},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-59719},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Parsability approaches of several grammar formalisms generating also non-context-free languages are explored. Chomsky grammars, Lindenmayer systems, grammars with controlled derivations, and grammar systems are treated. Formal properties of these mechanisms are investigated, when they are used as language acceptors. Furthermore, cooperating distributed grammar systems are restricted so that efficient deterministic parsing without backtracking becomes possible. For this class of grammar systems, the parsing algorithm is presented and the feature of leftmost derivations is investigated in detail.},
  language  = {en}
}
@article{BottinoChioccariello2015,
  author    = {Bottino, Rosa and Chioccariello, Augusto},
  title     = {Computational Thinking},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82820},
  pages     = {301 -- 309},
  year      = {2015},
  abstract  = {Digital technology has radically changed the way people work in industry, finance, services, media and commerce. Informatics has contributed to the scientific and technological development of our society in general and to the digital revolution in particular. Computational thinking is the term indicating the key ideas of this discipline that might be included in the key competencies underlying the curriculum of compulsory education. The educational potential of informatics has a history dating back to the sixties. In this article, we briefly revisit this history looking for lessons learned. In particular, we focus on experiences of teaching and learning programming. However, computational thinking is more than coding. It is a way of thinking and practicing interactive dynamic modeling with computers. We advocate that learners can practice computational thinking in playful contexts where they can develop personal projects, for example building videogames and/or robots, share and discuss their construction with others. In our view, this approach allows an integration of computational thinking in the K-12 curriculum across disciplines.},
  language  = {en}
}
@phdthesis{Brauer2010,
  author    = {Brauer, Falk},
  title     = {Extraktion und Identifikation von Entit{\"a}ten in Textdaten im Umfeld der Enterprise Search},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-51409},
  school      = {Universit{\"a}t Potsdam},
  year      = {2010},
  abstract  = {Die automatische Informationsextraktion (IE) aus unstrukturierten Texten erm{\"o}glicht v{\"o}llig neue Wege, auf relevante Informationen zuzugreifen und deren Inhalte zu analysieren, die weit {\"u}ber bisherige Verfahren zur Stichwort-basierten Dokumentsuche hinausgehen. Die Entwicklung von Programmen zur Extraktion von maschinenlesbaren Daten aus Texten erfordert jedoch nach wie vor die Entwicklung von dom{\"a}nenspezifischen Extraktionsprogrammen. Insbesondere im Bereich der Enterprise Search (der Informationssuche im Unternehmensumfeld), in dem eine große Menge von heterogenen Dokumenttypen existiert, ist es oft notwendig ad-hoc Programm-module zur Extraktion von gesch{\"a}ftsrelevanten Entit{\"a}ten zu entwickeln, die mit generischen Modulen in monolithischen IE-Systemen kombiniert werden. Dieser Umstand ist insbesondere kritisch, da potentiell f{\"u}r jeden einzelnen Anwendungsfall ein von Grund auf neues IE-System entwickelt werden muss. Die vorliegende Dissertation untersucht die effiziente Entwicklung und Ausf{\"u}hrung von IE-Systemen im Kontext der Enterprise Search und effektive Methoden zur Ausnutzung bekannter strukturierter Daten im Unternehmenskontext f{\"u}r die Extraktion und Identifikation von gesch{\"a}ftsrelevanten Entit{\"a}ten in Doku-menten. Grundlage der Arbeit ist eine neuartige Plattform zur Komposition von IE-Systemen auf Basis der Beschreibung des Datenflusses zwischen generischen und anwendungsspezifischen IE-Modulen. Die Plattform unterst{\"u}tzt insbesondere die Entwicklung und Wiederverwendung von generischen IE-Modulen und zeichnet sich durch eine h{\"o}here Flexibilit{\"a}t und Ausdrucksm{\"a}chtigkeit im Vergleich zu vorherigen Methoden aus. Ein in der Dissertation entwickeltes Verfahren zur Dokumentverarbeitung interpretiert den Daten-austausch zwischen IE-Modulen als Datenstr{\"o}me und erm{\"o}glicht damit eine weitgehende Parallelisierung von einzelnen Modulen. Die autonome Ausf{\"u}hrung der Module f{\"u}hrt zu einer wesentlichen Beschleu-nigung der Verarbeitung von Einzeldokumenten und verbesserten Antwortzeiten, z. B. f{\"u}r Extraktions-dienste. Bisherige Ans{\"a}tze untersuchen lediglich die Steigerung des durchschnittlichen Dokumenten-durchsatzes durch verteilte Ausf{\"u}hrung von Instanzen eines IE-Systems. Die Informationsextraktion im Kontext der Enterprise Search unterscheidet sich z. B. von der Extraktion aus dem World Wide Web dadurch, dass in der Regel strukturierte Referenzdaten z. B. in Form von Unternehmensdatenbanken oder Terminologien zur Verf{\"u}gung stehen, die oft auch die Beziehungen von Entit{\"a}ten beschreiben. Entit{\"a}ten im Unternehmensumfeld haben weiterhin bestimmte Charakteristiken: Eine Klasse von relevanten Entit{\"a}ten folgt bestimmten Bildungsvorschriften, die nicht immer bekannt sind, auf die aber mit Hilfe von bekannten Beispielentit{\"a}ten geschlossen werden kann, so dass unbekannte Entit{\"a}ten extrahiert werden k{\"o}nnen. Die Bezeichner der anderen Klasse von Entit{\"a}ten haben eher umschreibenden Charakter. Die korrespondierenden Umschreibungen in Texten k{\"o}nnen variieren, wodurch eine Identifikation derartiger Entit{\"a}ten oft erschwert wird. Zur effizienteren Entwicklung von IE-Systemen wird in der Dissertation ein Verfahren untersucht, das alleine anhand von Beispielentit{\"a}ten effektive Regul{\"a}re Ausdr{\"u}cke zur Extraktion von unbekannten Entit{\"a}ten erlernt und damit den manuellen Aufwand in derartigen Anwendungsf{\"a}llen minimiert. Verschiedene Generalisierungs- und Spezialisierungsheuristiken erkennen Muster auf verschiedenen Abstraktionsebenen und schaffen dadurch einen Ausgleich zwischen Genauigkeit und Vollst{\"a}ndigkeit bei der Extraktion. Bekannte Regellernverfahren im Bereich der Informationsextraktion unterst{\"u}tzen die beschriebenen Problemstellungen nicht, sondern ben{\"o}tigen einen (annotierten) Dokumentenkorpus. Eine Methode zur Identifikation von Entit{\"a}ten, die durch Graph-strukturierte Referenzdaten vordefiniert sind, wird als dritter Schwerpunkt untersucht. Es werden Verfahren konzipiert, welche {\"u}ber einen exakten Zeichenkettenvergleich zwischen Text und Referenzdatensatz hinausgehen und Teil{\"u}bereinstimmungen und Beziehungen zwischen Entit{\"a}ten zur Identifikation und Disambiguierung heranziehen. Das in der Arbeit vorgestellte Verfahren ist bisherigen Ans{\"a}tzen hinsichtlich der Genauigkeit und Vollst{\"a}ndigkeit bei der Identifikation {\"u}berlegen.},
  language  = {de}
}
@article{BraunKappHaraetal.2018,
  author    = {Braun, Iris and Kapp, Felix and Hara, Tenshi and Kubica, Tommy},
  title     = {Erfolgsfaktoren beim Einsatz von Audience Response Systemen in der universit{\"a}ren Lehre},
  series = {E-Learning Symposium 2018},
  journal   = {E-Learning Symposium 2018},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  doi       = {10.25932/publishup-42195},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-421959},
  pages     = {65 -- 67},
  year      = {2018},
  abstract  = {Der vorliegende Beitrag berichtet auf der Grundlage von Erfahrungen mit dem Audience Response System (ARS) „Auditorium Mobile Classroom Service" von Erfolgsfaktoren f{\"u}r den Einsatz in der universit{\"a}ren Lehre. Dabei werden sowohl die technischen Rahmenbedingungen und Herausforderungen der Anwendungen ber{\"u}cksichtigt, als auch die unterschiedlichen didaktischen Konzepte und Ziele der beteiligten Akteure (Studierende, Lehrende und Institution). Ziel ist es, Einflussfaktoren f{\"u}r den erfolgreichen Einsatz sowohl f{\"u}r die Praxis als auch die wissenschaftliche Untersuchung und Weiterentwicklung der Systeme zu benennen und ein heuristisches Framework f{\"u}r Chancen und Herausforderungen beim Einsatz von ARS anzubieten.},
  language  = {de}
}
@inproceedings{BreitlauchNoskovaRensingetal.2014,
  author    = {Breitlauch, Linda and Noskova, Tatiana N. and Rensing, Christoph and Ifenthaler, Dirk and Owassapian, Dominik and Hensinger, Johannes and Buschmann, Jana and Glasemann, Marie and Dirwelis, Swenja and Mach, Michael and Kallookaran, Michael and Robra-Bissantz, Susanne and Zoerner, Dietmar and K{\"o}hlmann, Wiebke and Brandt, Christopher and Kutzner, Tobias and Steinert, Christian},
  title     = {E-Learning Symposium 2014},
  editor    = {Lucke, Ulrike and Gr{\"u}newald, Franka and Hafer, J{\"o}rg},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  doi       = {10.25932/publishup-6984},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-72154},
  pages     = {59},
  year      = {2014},
  abstract  = {Der Tagungsband zum E-Learning Symposium 2014 an der Universit{\"a}t Potsdam beleuchtet die diversen Zielgruppen und Anwendungsbereiche, die aktuell in der E-Learning-Forschung angesprochen werden. W{\"a}hrend im letzten Symposium 2012 der Dozierende mit den unterschiedlichen M{\"o}glichkeiten der Studierendenaktivierung und Lehrgestaltung im Fokus der Diskussionen stand, werden in diesem Jahr in einem großen Teil der Beitr{\"a}ge die Studierenden ins Zentrum der Aufmerksamkeit ger{\"u}ckt. Dass nicht nur der Inhalt des Lernmediums f{\"u}r den Lernerfolg eine Rolle spielt, sondern auch dessen Unterhaltungswert und die Freude, die die Lernenden w{\"a}hrend des Prozesses der Wissensakquise empfinden, zeigt sehr anschaulich die Keynote von Linda Breitlauch zum Thema „Faites vos Jeux" (Spielen Sie jetzt). Der Beitrag von Zoerner et al. verbindet den Gedanken des spiele-basierten Lernens mit dem nach wie vor aktuellen Thema des mobilen Lernens. Auch in diesem Forschungsbereich spielt die Fokussierung auf den Lernenden eine immer herausragendere Rolle. Einen Schritt weiter in Richtung Individualisierung geht in diesem Zusammenhang der eingeladene Vortrag von Christoph Rensing, der sich mit der Adaptivit{\"a}t von mobilen Lernanwendungen besch{\"a}ftigt. Mit Hilfe zur Verf{\"u}gung stehender Kontextinformationen sollen gezielt individuelle Lernprozesse unterst{\"u}tzt werden. Alle Beitr{\"a}ge, die sich auf mobile Applikationen und auf Spiele beziehen, sprechen auch die zwischenmenschliche Komponente am Lernen an. So wird neben der Mobilit{\"a}t insbesondere auch der Austausch von Lernobjekten zwischen Lernenden (vergleiche den Beitrag von Zoerner et al.) sowie die Kooperation zwischen Lernenden (siehe Beitrag von Kallookaran und Robra-Bissantz) diskutiert. Der interpersonelle Kontakt spielt allerdings ebenfalls in den Beitr{\"a}gen ohne Spiel- oder App-Fokussierung eine Rolle. Tutoren werden beispielsweise zur Moderation von Lernprozessen eingesetzt und Lerngruppen gegr{\"u}ndet um das problem-orientierte Lernen st{\"a}rker in den Mittelpunkt zu r{\"u}cken (siehe Beitrag von Mach und Dirwelis) bzw. n{\"a}her am Bedarf der Studierenden zu arbeiten (wie in eingeladenen Vortrag von Tatiana N. Noskova sowie in dem Beitrag von Mach und Dirwelis beschrieben). In der Evaluation wird ebenfalls der Schritt weg von anonymen, akkumulierten statistischen Auswertungen hin zu individualisierten Nutzerprofilen im Bereich des Learning Analytics untersucht (vergleiche dazu den Beitrag von Ifenthaler). Neben der Schwerpunktsetzung auf die Lernenden und deren Mobilit{\"a}t r{\"u}ckt das Thema Transmedialit{\"a}t st{\"a}rker ins Zentrum der Forschung. W{\"a}hrend schon die Keynote mit ihrem Spielefokus darauf anspricht, geht es in weiteren Beitr{\"a}gen darum Abl{\"a}ufe aus der analogen Welt bestm{\"o}glich in der digitalen Welt abzubilden. Lerninhalte, die bisher mittels Bildern und Texten f{\"u}r Lehrende und Lernende zug{\"a}nglich gemacht wurden, werden nunmehr mit weiteren Medien, insbesondere Videos, angereichert um deren Verst{\"a}ndnis zu erh{\"o}hen. Dies ist beispielsweise geeignet, um Bewegungsabl{\"a}ufe im Sport (vergleiche dazu den Beitrag von Owassapian und Hensinger) oder musikpraktische {\"U}bungen wie Bodyperkussion (beschrieben im Beitrag von Buschmann und Glasemann) zu erlernen Lernendenfokussierung, pers{\"o}nlicher Austausch, Mobilit{\"a}t und Transmedialit{\"a}t sind somit einige der Kernthemen, die Sie in diesem Sammelband erwarten. Auch zeigt die h{\"a}ufige Verkn{\"u}pfung verschedener dieser Kernthemen, dass keines davon ein Randthema ist, sondern sich die Summe aus allen im E-Learning b{\"u}ndelt und damit eine neue Qualit{\"a}t f{\"u}r Lehre, Studium und Forschung erreicht werden kann.},
  language  = {mul}
}
@article{Broeker2015,
  author    = {Br{\"o}ker, Kathrin},
  title     = {Unterst{\"u}tzung Informatik-Studierender durch ein Lernzentrum},
  series = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  volume    = {2015},
  journal   = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  number    = {9},
  editor    = {Schubert, Sigrid and Schwill, Andreas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-84754},
  pages     = {189 -- 197},
  year      = {2015},
  abstract  = {In diesem Papier wird das Konzept eines Lernzentrums f{\"u}r die Informatik (LZI) an der Universit{\"a}t Paderborn vorgestellt. Ausgehend von den fachspezifischen Schwierigkeiten der Informatik Studierenden werden die Angebote des LZIs erl{\"a}utert, die sich {\"u}ber die vier Bereiche Individuelle Beratung und Betreuung, „Offener Lernraum", Workshops und Lehrveranstaltungen sowie Forschung erstrecken. Eine erste Evaluation mittels Feedbackb{\"o}gen zeigt, dass das Angebot bei den Studierenden positiv aufgenommen wird. Zuk{\"u}nftig soll das Angebot des LZIs weiter ausgebaut und verbessert werden. Ausgangsbasis dazu sind weitere Studien.},
  language  = {de}
}
@article{BroekerKastensMagenheim2015,
  author    = {Br{\"o}ker, Kathrin and Kastens, Uwe and Magenheim, Johannes},
  title     = {Competences of Undergraduate Computer Science Students},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82613},
  pages     = {77 -- 96},
  year      = {2015},
  abstract  = {The paper presents two approaches to the development of a Computer Science Competence Model for the needs of curriculum development and evaluation in Higher Education. A normativetheoretical approach is based on the AKT and ACM/IEEE curriculum and will be used within the recommendations of the German Informatics Society (GI) for the design of CS curricula. An empirically oriented approach refines the categories of the first one with regard to specific subject areas by conducting content analysis on CS curricula of important universities from several countries. The refined model will be used for the needs of students' e-assessment and subsequent affirmative action of the CS departments.},
  language  = {en}
}
@phdthesis{Brueckner2012,
  author    = {Br{\"u}ckner, Michael},
  title     = {Prediction games : machine learning in the presence of an adversary},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-203-2},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-60375},
  school      = {Universit{\"a}t Potsdam},
  pages     = {x, 121},
  year      = {2012},
  abstract  = {In many applications one is faced with the problem of inferring some functional relation between input and output variables from given data. Consider, for instance, the task of email spam filtering where one seeks to find a model which automatically assigns new, previously unseen emails to class spam or non-spam. Building such a predictive model based on observed training inputs (e.g., emails) with corresponding outputs (e.g., spam labels) is a major goal of machine learning. Many learning methods assume that these training data are governed by the same distribution as the test data which the predictive model will be exposed to at application time. That assumption is violated when the test data are generated in response to the presence of a predictive model. This becomes apparent, for instance, in the above example of email spam filtering. Here, email service providers employ spam filters and spam senders engineer campaign templates such as to achieve a high rate of successful deliveries despite any filters. Most of the existing work casts such situations as learning robust models which are unsusceptible against small changes of the data generation process. The models are constructed under the worst-case assumption that these changes are performed such to produce the highest possible adverse effect on the performance of the predictive model. However, this approach is not capable to realistically model the true dependency between the model-building process and the process of generating future data. We therefore establish the concept of prediction games: We model the interaction between a learner, who builds the predictive model, and a data generator, who controls the process of data generation, as an one-shot game. The game-theoretic framework enables us to explicitly model the players' interests, their possible actions, their level of knowledge about each other, and the order at which they decide for an action. We model the players' interests as minimizing their own cost function which both depend on both players' actions. The learner's action is to choose the model parameters and the data generator's action is to perturbate the training data which reflects the modification of the data generation process with respect to the past data. We extensively study three instances of prediction games which differ regarding the order in which the players decide for their action. We first assume that both player choose their actions simultaneously, that is, without the knowledge of their opponent's decision. We identify conditions under which this Nash prediction game has a meaningful solution, that is, a unique Nash equilibrium, and derive algorithms that find the equilibrial prediction model. As a second case, we consider a data generator who is potentially fully informed about the move of the learner. This setting establishes a Stackelberg competition. We derive a relaxed optimization criterion to determine the solution of this game and show that this Stackelberg prediction game generalizes existing prediction models. Finally, we study the setting where the learner observes the data generator's action, that is, the (unlabeled) test data, before building the predictive model. As the test data and the training data may be governed by differing probability distributions, this scenario reduces to learning under covariate shift. We derive a new integrated as well as a two-stage method to account for this data set shift. In case studies on email spam filtering we empirically explore properties of all derived models as well as several existing baseline methods. We show that spam filters resulting from the Nash prediction game as well as the Stackelberg prediction game in the majority of cases outperform other existing baseline methods.},
  language  = {en}
}
@phdthesis{Buchholz2006,
  author    = {Buchholz, Henrik},
  title     = {Real-time visualization of 3D city models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-13337},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {An increasing number of applications requires user interfaces that facilitate the handling of large geodata sets. Using virtual 3D city models, complex geospatial information can be communicated visually in an intuitive way. Therefore, real-time visualization of virtual 3D city models represents a key functionality for interactive exploration, presentation, analysis, and manipulation of geospatial data. This thesis concentrates on the development and implementation of concepts and techniques for real-time city model visualization. It discusses rendering algorithms as well as complementary modeling concepts and interaction techniques. Particularly, the work introduces a new real-time rendering technique to handle city models of high complexity concerning texture size and number of textures. Such models are difficult to handle by current technology, primarily due to two problems: - Limited texture memory: The amount of simultaneously usable texture data is limited by the memory of the graphics hardware. - Limited number of textures: Using several thousand different textures simultaneously causes significant performance problems due to texture switch operations during rendering. The multiresolution texture atlases approach, introduced in this thesis, overcomes both problems. During rendering, it permanently maintains a small set of textures that are sufficient for the current view and the screen resolution available. The efficiency of multiresolution texture atlases is evaluated in performance tests. To summarize, the results demonstrate that the following goals have been achieved: - Real-time rendering becomes possible for 3D scenes whose amount of texture data exceeds the main memory capacity. - Overhead due to texture switches is kept permanently low, so that the number of different textures has no significant effect on the rendering frame rate. Furthermore, this thesis introduces two new approaches for real-time city model visualization that use textures as core visualization elements: - An approach for visualization of thematic information. - An approach for illustrative visualization of 3D city models. Both techniques demonstrate that multiresolution texture atlases provide a basic functionality for the development of new applications and systems in the domain of city model visualization.},
  language  = {en}
}
@misc{Baermann2006,
  type      = {Master Thesis},
  author    = {B{\"a}rmann, Daniel},
  title     = {Aufz{\"a}hlen von DNA-Codes},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-10264},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {In dieser Arbeit wird ein Modell zum Aufz{\"a}hlen von DNA-Codes entwickelt. Indem eine Ordnung auf der Menge aller DNA-Codew{\"o}rter eingef{\"u}hrt und auf die Menge aller Codes erweitert wird, erlaubt das Modell das Auffinden von DNA-Codes mit bestimmten Eigenschaften, wie {\"U}berlappungsfreiheit, Konformit{\"a}t, Kommafreiheit, Stickyfreiheit, {\"U}berhangfreiheit, Teilwortkonformit{\"a}t und anderer bez{\"u}glich einer gegebenen Involution auf der Menge der Codew{\"o}rter. Ein auf Grundlage des geschaffenen Modells entstandenes Werkzeug erlaubt das Suchen von Codes mit beliebigen Kombinationen von Codeeigenschaften. Ein weiterer wesentlicher Bestandteil dieser Arbeit ist die Untersuchung der Optimalit{\"a}t von DNA-Codes bez{\"u}glich ihrer Informationsrate sowie das Finden solider DNA-Codes.},
  subject      = {DNS},
  language  = {de}
}
@phdthesis{Boehm2013,
  author    = {B{\"o}hm, Christoph},
  title     = {Enriching the Web of Data with topics and links},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-68624},
  school      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {This thesis presents novel ideas and research findings for the Web of Data - a global data space spanning many so-called Linked Open Data sources. Linked Open Data adheres to a set of simple principles to allow easy access and reuse for data published on the Web. Linked Open Data is by now an established concept and many (mostly academic) publishers adopted the principles building a powerful web of structured knowledge available to everybody. However, so far, Linked Open Data does not yet play a significant role among common web technologies that currently facilitate a high-standard Web experience. In this work, we thoroughly discuss the state-of-the-art for Linked Open Data and highlight several shortcomings - some of them we tackle in the main part of this work. First, we propose a novel type of data source meta-information, namely the topics of a dataset. This information could be published with dataset descriptions and support a variety of use cases, such as data source exploration and selection. For the topic retrieval, we present an approach coined Annotated Pattern Percolation (APP), which we evaluate with respect to topics extracted from Wikipedia portals. Second, we contribute to entity linking research by presenting an optimization model for joint entity linking, showing its hardness, and proposing three heuristics implemented in the LINked Data Alignment (LINDA) system. Our first solution can exploit multi-core machines, whereas the second and third approach are designed to run in a distributed shared-nothing environment. We discuss and evaluate the properties of our approaches leading to recommendations which algorithm to use in a specific scenario. The distributed algorithms are among the first of their kind, i.e., approaches for joint entity linking in a distributed fashion. Also, we illustrate that we can tackle the entity linking problem on the very large scale with data comprising more than 100 millions of entity representations from very many sources. Finally, we approach a sub-problem of entity linking, namely the alignment of concepts. We again target a method that looks at the data in its entirety and does not neglect existing relations. Also, this concept alignment method shall execute very fast to serve as a preprocessing for further computations. Our approach, called Holistic Concept Matching (HCM), achieves the required speed through grouping the input by comparing so-called knowledge representations. Within the groups, we perform complex similarity computations, relation conclusions, and detect semantic contradictions. The quality of our result is again evaluated on a large and heterogeneous dataset from the real Web. In summary, this work contributes a set of techniques for enhancing the current state of the Web of Data. All approaches have been tested on large and heterogeneous real-world input.},
  language  = {en}
}
@phdthesis{Boehne2019,
  author    = {B{\"o}hne, Sebastian},
  title     = {Different degrees of formality},
  doi       = {10.25932/publishup-42379},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-423795},
  school      = {Universit{\"a}t Potsdam},
  pages     = {VI, 167},
  year      = {2019},
  abstract  = {In this thesis we introduce the concept of the degree of formality. It is directed against a dualistic point of view, which only distinguishes between formal and informal proofs. This dualistic attitude does not respect the differences between the argumentations classified as informal and it is unproductive because the individual potential of the respective argumentation styles cannot be appreciated and remains untapped. This thesis has two parts. In the first of them we analyse the concept of the degree of formality (including a discussion about the respective benefits for each degree) while in the second we demonstrate its usefulness in three case studies. In the first case study we will repair Haskell B. Curry's view of mathematics, which incidentally is of great importance in the first part of this thesis, in light of the different degrees of formality. In the second case study we delineate how awareness of the different degrees of formality can be used to help students to learn how to prove. Third, we will show how the advantages of proofs of different degrees of formality can be combined by the development of so called tactics having a medium degree of formality. Together the three case studies show that the degrees of formality provide a convincing solution to the problem of untapped potential.},
  language  = {en}
}
@article{BoehneKreitzKnobelsdorf2016,
  author    = {B{\"o}hne, Sebastian and Kreitz, Christoph and Knobelsdorf, Maria},
  title     = {Mathematisches Argumentieren und Beweisen mit dem Theorembeweiser Coq},
  series = {Commentarii informaticae didacticae (CID)},
  journal   = {Commentarii informaticae didacticae (CID)},
  number    = {10},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94824},
  pages     = {69 -- 80},
  year      = {2016},
  abstract  = {Informatik-Studierende haben in der Mehrzahl Schwierigkeiten, einen Einstieg in die Theoretische Informatik zu finden und die Leistungsanforderungen in den Endklausuren der zugeh{\"o}rigen Lehrveranstaltungen zu erf{\"u}llen. Wir argumentieren, dass dieser Symptomatik mangelnde Kompetenzen im Umgang mit abstrakten und stark formalisierten Themeninhalten zugrunde liegen und schlagen vor, einen Beweisassistenten als interaktives Lernwerkzeug in der Eingangslehre der Theoretischen Informatik zu nutzen, um entsprechende Kompetenzen zu st{\"a}rken.},
  language  = {de}
}
@phdthesis{Boeken2022,
  author    = {B{\"o}ken, Bj{\"o}rn},
  title     = {Improving prediction accuracy using dynamic information},
  doi       = {10.25932/publishup-58512},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-585125},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xii, 160},
  year      = {2022},
  abstract  = {Accurately solving classification problems nowadays is likely to be the most relevant machine learning task. Binary classification separating two classes only is algorithmically simpler but has fewer potential applications as many real-world problems are multi-class. On the reverse, separating only a subset of classes simplifies the classification task. Even though existing multi-class machine learning algorithms are very flexible regarding the number of classes, they assume that the target set Y is fixed and cannot be restricted once the training is finished. On the other hand, existing state-of-the-art production environments are becoming increasingly interconnected with the advance of Industry 4.0 and related technologies such that additional information can simplify the respective classification problems. In light of this, the main aim of this thesis is to introduce dynamic classification that generalizes multi-class classification such that the target class set can be restricted arbitrarily to a non-empty class subset M of Y at any time between two consecutive predictions. This task is solved by a combination of two algorithmic approaches. First, classifier calibration, which transforms predictions into posterior probability estimates that are intended to be well calibrated. The analysis provided focuses on monotonic calibration and in particular corrects wrong statements that appeared in the literature. It also reveals that bin-based evaluation metrics, which became popular in recent years, are unjustified and should not be used at all. Next, the validity of Platt scaling, which is the most relevant parametric calibration approach, is analyzed in depth. In particular, its optimality for classifier predictions distributed according to four different families of probability distributions as well its equivalence with Beta calibration up to a sigmoidal preprocessing are proven. For non-monotonic calibration, extended variants on kernel density estimation and the ensemble method EKDE are introduced. Finally, the calibration techniques are evaluated using a simulation study with complete information as well as on a selection of 46 real-world data sets. Building on this, classifier calibration is applied as part of decomposition-based classification that aims to reduce multi-class problems to simpler (usually binary) prediction tasks. For the involved fusing step performed at prediction time, a new approach based on evidence theory is presented that uses classifier calibration to model mass functions. This allows the analysis of decomposition-based classification against a strictly formal background and to prove closed-form equations for the overall combinations. Furthermore, the same formalism leads to a consistent integration of dynamic class information, yielding a theoretically justified and computationally tractable dynamic classification model. The insights gained from this modeling are combined with pairwise coupling, which is one of the most relevant reduction-based classification approaches, such that all individual predictions are combined with a weight. This not only generalizes existing works on pairwise coupling but also enables the integration of dynamic class information. Lastly, a thorough empirical study is performed that compares all newly introduced approaches to existing state-of-the-art techniques. For this, evaluation metrics for dynamic classification are introduced that depend on corresponding sampling strategies. Thereafter, these are applied during a three-part evaluation. First, support vector machines and random forests are applied on 26 data sets from the UCI Machine Learning Repository. Second, two state-of-the-art deep neural networks are evaluated on five benchmark data sets from a relatively recent reference work. Here, computationally feasible strategies to apply the presented algorithms in combination with large-scale models are particularly relevant because a naive application is computationally intractable. Finally, reference data from a real-world process allowing the inclusion of dynamic class information are collected and evaluated. The results show that in combination with support vector machines and random forests, pairwise coupling approaches yield the best results, while in combination with deep neural networks, differences between the different approaches are mostly small to negligible. Most importantly, all results empirically confirm that dynamic classification succeeds in improving the respective prediction accuracies. Therefore, it is crucial to pass dynamic class information in respective applications, which requires an appropriate digital infrastructure.},
  language  = {en}
}
@article{Buechner2015,
  author    = {B{\"u}chner, Steffen},
  title     = {Empirical and Normative Research on Fundamental Ideas of Embedded System Development},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82949},
  pages     = {393 -- 396},
  year      = {2015},
  language  = {en}
}
@phdthesis{Chen2023,
  author    = {Chen, Junchao},
  title     = {A self-adaptive resilient method for implementing and managing the high-reliability processing system},
  doi       = {10.25932/publishup-58313},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-583139},
  school      = {Universit{\"a}t Potsdam},
  pages     = {XXIII, 167},
  year      = {2023},
  abstract  = {As a result of CMOS scaling, radiation-induced Single-Event Effects (SEEs) in electronic circuits became a critical reliability issue for modern Integrated Circuits (ICs) operating under harsh radiation conditions. SEEs can be triggered in combinational or sequential logic by the impact of high-energy particles, leading to destructive or non-destructive faults, resulting in data corruption or even system failure. Typically, the SEE mitigation methods are deployed statically in processing architectures based on the worst-case radiation conditions, which is most of the time unnecessary and results in a resource overhead. Moreover, the space radiation conditions are dynamically changing, especially during Solar Particle Events (SPEs). The intensity of space radiation can differ over five orders of magnitude within a few hours or days, resulting in several orders of magnitude fault probability variation in ICs during SPEs. This thesis introduces a comprehensive approach for designing a self-adaptive fault resilient multiprocessing system to overcome the static mitigation overhead issue. This work mainly addresses the following topics: (1) Design of on-chip radiation particle monitor for real-time radiation environment detection, (2) Investigation of space environment predictor, as support for solar particle events forecast, (3) Dynamic mode configuration in the resilient multiprocessing system. Therefore, according to detected and predicted in-flight space radiation conditions, the target system can be configured to use no mitigation or low-overhead mitigation during non-critical periods of time. The redundant resources can be used to improve system performance or save power. On the other hand, during increased radiation activity periods, such as SPEs, the mitigation methods can be dynamically configured appropriately depending on the real-time space radiation environment, resulting in higher system reliability. Thus, a dynamic trade-off in the target system between reliability, performance and power consumption in real-time can be achieved. All results of this work are evaluated in a highly reliable quad-core multiprocessing system that allows the self-adaptive setting of optimal radiation mitigation mechanisms during run-time. Proposed methods can serve as a basis for establishing a comprehensive self-adaptive resilient system design process. Successful implementation of the proposed design in the quad-core multiprocessor shows its application perspective also in the other designs.},
  language  = {en}
}
@article{ChristensenKnezek2015,
  author    = {Christensen, Rhonda and Knezek, Gerald},
  title     = {The Technology Proficiency Self-Assessment Questionnaire (TPSA)},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82838},
  pages     = {311 -- 318},
  year      = {2015},
  abstract  = {The Technology Proficiency Self-Assessment (TPSA) questionnaire has been used for 15 years in the USA and other nations as a self-efficacy measure for proficiencies fundamental to effective technology integration in the classroom learning environment. Internal consistency reliabilities for each of the five-item scales have typically ranged from .73 to .88 for preservice or inservice technology-using teachers. Due to changing technologies used in education, researchers sought to renovate partially obsolete items and extend self-efficacy assessment to new areas, such as social media and mobile learning. Analysis of 2014 data gathered on a new, 34 item version of the TPSA indicates that the four established areas of email, World Wide Web (WWW), integrated applications, and teaching with technology continue to form consistent scales with reliabilities ranging from .81 to .93, while the 14 new items gathered to represent emerging technologies and media separate into two scales, each with internal consistency reliabilities greater than .9. The renovated TPSA is deemed to be worthy of continued use in the teaching with technology context.},
  language  = {en}
}
@phdthesis{Christgau2017,
  author    = {Christgau, Steffen},
  title     = {One-sided communication on a non-cache-coherent many-core architecture},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-403100},
  school      = {Universit{\"a}t Potsdam},
  pages     = {219},
  year      = {2017},
  abstract  = {Aktuelle Mehrkernprozessoren stellen parallele Systeme dar, die den darauf ausgef{\"u}hrten Programmen gemeinsamen Speicher zur Verf{\"u}gung stellen. Sowohl die ansteigende Kernanzahlen in sogenannten Vielkernprozessoren (many-core processors) als auch die weiterhin steigende Leistungsf{\"a}higkeit der einzelnen Kerne erfordert hohe Bandbreiten, die das Speichersystem des Prozessors liefern muss. Hardware-basierte Cache-Koh{\"a}renz st{\"o}ßt in aktuellen Vielkernprozessoren an Grenzen des praktisch Machbaren. Dementsprechend m{\"u}ssen alternative Architekturen und entsprechend geeignete Programmiermodelle untersucht werden. In dieser Arbeit wird der Single-Chip Cloud Computer (SCC), ein nicht-cachekoh{\"a}renter Vielkernprozessor betrachtet, der aus 48, {\"u}ber ein Gitternetzwerk verbundenen Kernen besteht. Obwohl der Prozessor f{\"u}r nachrichten-basierte Kommunikation entwickelt worden ist, zeigen die Ergebnisse dieser Arbeit, dass einseitige Kommunikation auf Basis gemeinsamen Speichers effizient auf diesem Architekturtyp realisiert werden kann. Einseitige Kommunikation erm{\"o}glicht Datenaustausch zwischen Prozessen, bei der der Empf{\"a}nger keine Details {\"u}ber die stattfindende Kommunikation besitzen muss. Im Sinne des MPI-Standards ist so ein Zugriff auf Speicher entfernter Prozesse m{\"o}glich. Zur Umsetzung dieses Konzepts auf nicht-koh{\"a}renten Architekturen werden in dieser Arbeit sowohl eine effiziente Prozesssynchronisation als auch ein Kommunikationsschema auf Basis von software-basierter Cache-Koh{\"a}renz erarbeitet und untersucht. Die Prozesssynchronisation setzt das Konzept der general active target synchronization aus dem MPI-Standard um. Ein existierendes Klassifikationsschema f{\"u}r dessen Implementierungen wird erweitert und zur Identifikation einer geeigneten Klasse f{\"u}r die nicht-koh{\"a}rente Plattform des SCC verwendet. Auf Grundlage der Klassifikation werden existierende Implementierungen analysiert, daraus geeignete Konzepte extrahiert und ein leichtgewichtiges Synchronisationsprotokoll f{\"u}r den SCC entwickelt, das sowohl gemeinsamen Speicher als auch ungecachete Speicherzugriffe verwendet. Das vorgestellte Schema ist nicht anf{\"a}llig f{\"u}r Verz{\"o}gerungen zwischen Prozessen und erlaubt direkte Kommunikation sobald beide Kommunikationspartner daf{\"u}r bereit sind. Die experimentellen Ergebnisse zeigen ein sehr gutes Skaliserungsverhalten und eine f{\"u}nffach geringere Latenz f{\"u}r die Prozesssynchronisation im Vergleich zu einer auf Nachrichten basierenden MPI-Implementierung des SCC. F{\"u}r die Kommunikation wird mit SCOSCo ein auf gemeinsamen Speicher und software-basierter Cache-Koh{\"a}renz basierenden Konzept vorgestellt. Entsprechende Anforderungen an die Koh{\"a}renz, die dem MPI-Standard entsprechen, werden aufgestellt und eine schlanke Implementierung auf Basis der Hard- und Software-Funktionalit{\"a}ten des SCCs entwickelt. Trotz einer aufgedecktem Fehlfunktion im Speichersubsystem des SCC kann in den experimentellen Auswertungen von Mikrobenchmarks eine f{\"u}nffach verbesserte Bandbreite und eine nahezu vierfach verringerte Latenz beobachtet werden. In Anwendungsexperimenten, wie einer dreidimensionalen schnellen Fourier-Transformation, kann der Anteil der Kommunikation an der Laufzeit um den Faktor f{\"u}nf reduziert werden. In Erg{\"a}nzung dazu werden in dieser Arbeit Konzepte aufgestellt, die in zuk{\"u}nftigen Architekturen, die Cache-Koh{\"a}renz nicht auf einer globalen Ebene des Prozessors liefern k{\"o}nnen, f{\"u}r die Umsetzung von Software-basierter Koh{\"a}renz f{\"u}r einseitige Kommunikation hilfreich sind.},
  language  = {en}
}
@misc{Cichalla2022,
  type      = {Master Thesis},
  author    = {Cichalla, Anika Katleen},
  title     = {Ein konstruktivistisches Modell f{\"u}r die Didaktik der Informatik im Bachelorstudium},
  doi       = {10.25932/publishup-55071},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-550710},
  school      = {Universit{\"a}t Potsdam},
  pages     = {66},
  year      = {2022},
  abstract  = {Lehrende in der Lehrkr{\"a}fteausbildung sind stets damit konfrontiert, dass sie den Studierenden innovative Methoden modernen Schulunterrichts traditionell rezipierend vorstellen. In Deutschland gibt es circa 40 Universit{\"a}ten, die Informatik mit Lehramtsbezug ausbilden. Allerdings gibt es nur wenige Konzepte, die sich mit der Verbindung von Bildungswissenschaften und der Informatik mit ihrer Didaktik besch{\"a}ftigen und keine Konzepte, die eine konstruktivistische Lehre in der Informatik verfolgen. Daher zielt diese Masterarbeit darauf ab, diese L{\"u}cke aufgreifen und anhand des „Didaktik der Informatik I" Moduls der Universit{\"a}t Potsdam ein Modell zur konstruktivistischen Hochschullehre zu entwickeln. Dabei soll ein bestehendes konstruktivistisches Lehrmodell auf die Informatikdidaktik {\"u}bertragen und Elemente zur Verbindung von Bildungswissenschaften, Fachwissenschaften und Fachdidaktiken mit einbezogen werden. Dies kann eine Grundlage f{\"u}r die Planung von Informatikdidaktischen Modulen bieten, aber auch als Inspiration zur {\"U}bertragung bestehender innovativer Lehrkonzepte auf andere Fachdidaktiken dienen. Um ein solches konstruktivistisches Lehr-Lern-Modell zu erstellen, wird zun{\"a}chst der Zusammenhang von Bildungswissenschaften, Fachwissenschaften und Fachdidaktiken erl{\"a}utert und anschließend die Notwendigkeit einer Vernetzung hervorgehoben. Hieran folgt eine Darstellung zu relevanten Lerntheorien und bereits entwickelten innovativen Lernkonzepten. Ankn{\"u}pfend wird darauf eingegangen, welche Anforderungen die Kultusminister- Konferenz an die Ausbildung von Lehrkr{\"a}ften stellt und wie diese Ausbildung f{\"u}r die Informatik momentan an der Universit{\"a}t Potsdam erfolgt. Aus allen Erkenntnissen heraus werden Anforderungen an ein konstruktivistisches Lehrmodell festgelegt. Unter Ber{\"u}cksichtigung der Voraussetzungen der Studienordnung f{\"u}r das Lehramt Informatik wird anschließend ein Modell f{\"u}r konstruktivistische Informatikdidaktik vorgestellt. Weiterf{\"u}hrende Forschung k{\"o}nnte sich damit auseinandersetzen, inwiefern sich die Motivation und Leistung im vergleich zum urspr{\"u}nglichen Modul {\"a}ndert und ob die Kompetenzen zur Unterrichtsplanung und Unterrichtsgestaltung durch das neue Modulkonzept st{\"a}rker ausgebaut werden k{\"o}nnen.},
  language  = {de}
}
@article{Curzon2015,
  author    = {Curzon, Paul},
  title     = {Unplugged Computational Thinking for Fun},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82575},
  pages     = {15 -- 27},
  year      = {2015},
  abstract  = {Computational thinking is a fundamental skill set that is learned by studying Informatics and ICT. We argue that its core ideas can be introduced in an inspiring and integrated way to both teachers and students using fun and contextually rich cs4fn 'Computer Science for Fun' stories combined with 'unplugged' activities including games and magic tricks. We also argue that understanding people is an important part of computational thinking. Computational thinking can be fun for everyone when taught in kinaesthetic ways away from technology.},
  language  = {en}
}
@inproceedings{CurzonKalasSchubertetal.2015,
  author    = {Curzon, Paul and Kalas, Ivan and Schubert, Sigrid and Schaper, Niclas and Barnes, Jan and Kennewell, Steve and Br{\"o}ker, Kathrin and Kastens, Uwe and Magenheim, Johannes and Dagiene, Valentina and Stupuriene, Gabriele and Ellis, Jason Brent and Abreu-Ellis, Carla Reis and Grillenberger, Andreas and Romeike, Ralf and Haugsbakken, Halvdan and Jones, Anthony and Lewin, Cathy and McNicol, Sarah and Nelles, Wolfgang and Neugebauer, Jonas and Ohrndorf, Laura and Schaper, Niclas and Schubert, Sigrid and Opel, Simone and Kramer, Matthias and Trommen, Michael and Pottb{\"a}cker, Florian and Ilaghef, Youssef and Passig, David and Tzuriel, David and Kedmi, Ganit Eshel and Saito, Toshinori and Webb, Mary and Weigend, Michael and Bottino, Rosa and Chioccariello, Augusto and Christensen, Rhonda and Knezek, Gerald and Gioko, Anthony Maina and Angondi, Enos Kiforo and Waga, Rosemary and Ohrndorf, Laura and Or-Bach, Rachel and Preston, Christina and Younie, Sarah and Przybylla, Mareen and Romeike, Ralf and Reynolds, Nicholas and Swainston, Andrew and Bendrups, Faye and Sysło, Maciej M. and Kwiatkowska, Anna Beata and Zieris, Holger and Gerstberger, Herbert and M{\"u}ller, Wolfgang and B{\"u}chner, Steffen and Opel, Simone and Schiller, Thomas and Wegner, Christian and Zender, Raphael and Lucke, Ulrike and Diethelm, Ira and Syrbe, J{\"o}rn and Lai, Kwok-Wing and Davis, Niki and Eickelmann, Birgit and Erstad, Ola and Fisser, Petra and Gibson, David and Khaddage, Ferial and Knezek, Gerald and Micheuz, Peter and Kloos, Carlos Delgado},
  title     = {KEYCIT 2014},
  editor    = {Brinda, Torsten and Reynolds, Nicholas and Romeike, Ralf and Schwill, Andreas},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-292-6},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-70325},
  pages     = {438},
  year      = {2015},
  abstract  = {In our rapidly changing world it is increasingly important not only to be an expert in a chosen field of study but also to be able to respond to developments, master new approaches to solving problems, and fulfil changing requirements in the modern world and in the job market. In response to these needs key competencies in understanding, developing and using new digital technologies are being brought into focus in school and university programmes. The IFIP TC3 conference "KEYCIT - Key Competences in Informatics and ICT (KEYCIT 2014)" was held at the University of Potsdam in Germany from July 1st to 4th, 2014 and addressed the combination of key competencies, Informatics and ICT in detail. The conference was organized into strands focusing on secondary education, university education and teacher education (organized by IFIP WGs 3.1 and 3.3) and provided a forum to present and to discuss research, case studies, positions, and national perspectives in this field.},
  language  = {en}
}
@article{DagieneStupuriene2015,
  author    = {Dagiene, Valentina and Stupuriene, Gabriele},
  title     = {Informatics Education based on Solving Attractive Tasks through a Contest},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82626},
  pages     = {97 -- 115},
  year      = {2015},
  abstract  = {The paper discusses the issue of supporting informatics (computer science) education through competitions for lower and upper secondary school students (8-19 years old). Competitions play an important role for learners as a source of inspiration, innovation, and attraction. Running contests in informatics for school students for many years, we have noticed that the students consider the contest experience very engaging and exciting as well as a learning experience. A contest is an excellent instrument to involve students in problem solving activities. An overview of infrastructure and development of an informatics contest from international level to the national one (the Bebras contest on informatics and computer fluency, originated in Lithuania) is presented. The performance of Bebras contests in 23 countries during the last 10 years showed an unexpected and unusually high acceptance by school students and teachers. Many thousands of students participated and got a valuable input in addition to their regular informatics lectures at school. In the paper, the main attention is paid to the developed tasks and analysis of students' task solving results in Lithuania.},
  language  = {en}
}
@article{DamnikGierlProskeetal.2018,
  author    = {Damnik, Gregor and Gierl, Mark and Proske, Antje and K{\"o}rndle, Hermann and Narciss, Susanne},
  title     = {Automatische Erzeugung von Aufgaben als Mittel zur Erh{\"o}hung von Interaktivit{\"a}t und Adaptivit{\"a}t in digitalen Lernressourcen},
  series = {E-Learning Symposium 2018},
  journal   = {E-Learning Symposium 2018},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  doi       = {10.25932/publishup-42184},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-421842},
  pages     = {5 -- 16},
  year      = {2018},
  abstract  = {Digitale Medien enthalten bislang vor allem Inhalte in verschiedenen Darstellungsformen. Dies allein erzeugt jedoch nur einen geringen Mehrwert zu klassischen Lernressourcen, da die Kriterien der Interaktivit{\"a}t und Adaptivit{\"a}t nicht mit einbezogen werden. Dies scheitert jedoch oft an dem damit verbundenen Erstellungsaufwand. Der folgende Beitrag zeigt, wie durch die automatische Erzeugung von Aufgaben ein hochwertiger Wissenserwerb mit digitalen Medien erm{\"o}glicht wird. Ferner werden Vor- und Nachteile der automatischen Erstellung von Aufgaben er{\"o}rtert.},
  language  = {de}
}
@phdthesis{Dawoud2013,
  author    = {Dawoud, Wesam},
  title     = {Scalability and performance management of internet applications in the cloud},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-68187},
  school      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {Cloud computing is a model for enabling on-demand access to a shared pool of computing resources. With virtually limitless on-demand resources, a cloud environment enables the hosted Internet application to quickly cope when there is an increase in the workload. However, the overhead of provisioning resources exposes the Internet application to periods of under-provisioning and performance degradation. Moreover, the performance interference, due to the consolidation in the cloud environment, complicates the performance management of the Internet applications. In this dissertation, we propose two approaches to mitigate the impact of the resources provisioning overhead. The first approach employs control theory to scale resources vertically and cope fast with workload. This approach assumes that the provider has knowledge and control over the platform running in the virtual machines (VMs), which limits it to Platform as a Service (PaaS) and Software as a Service (SaaS) providers. The second approach is a customer-side one that deals with the horizontal scalability in an Infrastructure as a Service (IaaS) model. It addresses the trade-off problem between cost and performance with a multi-goal optimization solution. This approach finds the scale thresholds that achieve the highest performance with the lowest increase in the cost. Moreover, the second approach employs a proposed time series forecasting algorithm to scale the application proactively and avoid under-utilization periods. Furthermore, to mitigate the interference impact on the Internet application performance, we developed a system which finds and eliminates the VMs suffering from performance interference. The developed system is a light-weight solution which does not imply provider involvement. To evaluate our approaches and the designed algorithms at large-scale level, we developed a simulator called (ScaleSim). In the simulator, we implemented scalability components acting as the scalability components of Amazon EC2. The current scalability implementation in Amazon EC2 is used as a reference point for evaluating the improvement in the scalable application performance. ScaleSim is fed with realistic models of the RUBiS benchmark extracted from the real environment. The workload is generated from the access logs of the 1998 world cup website. The results show that optimizing the scalability thresholds and adopting proactive scalability can mitigate 88\% of the resources provisioning overhead impact with only a 9\% increase in the cost.},
  language  = {en}
}
@phdthesis{Decker2009,
  author    = {Decker, Gero},
  title     = {Design and analysis of process choreographies},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-40761},
  school      = {Universit{\"a}t Potsdam},
  year      = {2009},
  abstract  = {With the rise of electronic integration between organizations, the need for a precise specification of interaction behavior increases. Information systems, replacing interaction previously carried out by humans via phone, faxes and emails, require a precise specification for handling all possible situations. Such interaction behavior is described in process choreographies. Choreographies enumerate the roles involved, the allowed interactions, the message contents and the behavioral dependencies between interactions. Choreographies serve as interaction contract and are the starting point for adapting existing business processes and systems or for implementing new software components. As a thorough analysis and comparison of choreography modeling languages is missing in the literature, this thesis introduces a requirements framework for choreography languages and uses it for comparing current choreography languages. Language proposals for overcoming the limitations are given for choreography modeling on the conceptual and on the technical level. Using an interconnection modeling style, behavioral dependencies are defined on a per-role basis and different roles are interconnected using message flow. This thesis reveals a number of modeling "anti-patterns" for interconnection modeling, motivating further investigations on choreography languages following the interaction modeling style. Here, interactions are seen as atomic building blocks and the behavioral dependencies between them are defined globally. Two novel language proposals are put forward for this modeling style which have already influenced industrial standardization initiatives. While avoiding many of the pitfalls of interconnection modeling, new anomalies can arise in interaction models. A choreography might not be realizable, i.e. there does not exist a set of interacting roles that collectively realize the specified behavior. This thesis investigates different dimensions of realizability.},
  language  = {en}
}
@phdthesis{Dehne2021,
  author    = {Dehne, Julian},
  title     = {M{\"o}glichkeiten und Limitationen der medialen Unterst{\"u}tzung forschenden Lernens},
  doi       = {10.25932/publishup-49789},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-497894},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xvii, 404},
  year      = {2021},
  abstract  = {Forschendes Lernen und die digitale Transformation sind zwei der wichtigsten Einfl{\"u}sse auf die Entwicklung der Hochschuldidaktik im deutschprachigen Raum. W{\"a}hrend das forschende Lernen als normative Theorie das sollen beschreibt, geben die digitalen Werkzeuge, alte wie neue, das k{\"o}nnen in vielen Bereichen vor. In der vorliegenden Arbeit wird ein Prozessmodell aufgestellt, was den Versuch unternimmt, das forschende Lernen hinsichtlich interaktiver, gruppenbasierter Prozesse zu systematisieren. Basierend auf dem entwickelten Modell wurde ein Softwareprototyp implementiert, der den gesamten Forschungsprozess begleiten kann. Dabei werden Gruppenformation, Feedback- und Reflexionsprozesse und das Peer Assessment mit Bildungstechnologien unterst{\"u}tzt. Die Entwicklungen wurden in einem qualitativen Experiment eingesetzt, um Systemwissen {\"u}ber die M{\"o}glichkeiten und Grenzen der digitalen Unterst{\"u}tzung von forschendem Lernen zu gewinnen.},
  language  = {de}
}
@article{DelgadoKloos2015,
  author    = {Delgado Kloos, Carlos},
  title     = {What about the Competencies of Educators in the New Era of Digital Education?},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-83015},
  pages     = {435 -- 438},
  year      = {2015},
  abstract  = {A lot has been published about the competencies needed by students in the 21st century (Ravenscroft et al., 2012). However, equally important are the competencies needed by educators in the new era of digital education. We review the key competencies for educators in light of the new methods of teaching and learning proposed by Massive Open Online Courses (MOOCs) and their on-campus counterparts, Small Private Online Courses (SPOCs).},
  language  = {en}
}
@article{DennertMoellerGarmann2016,
  author    = {Dennert-M{\"o}ller, Elisabeth and Garmann, Robert},
  title     = {Das „Startprojekt"},
  series = {Commentarii informaticae didacticae (CID)},
  journal   = {Commentarii informaticae didacticae (CID)},
  number    = {10},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94780},
  pages     = {11 -- 23},
  year      = {2016},
  abstract  = {Absolventinnen und Absolventen unserer Informatik-Bachelorstudieng{\"a}nge ben{\"o}tigen f{\"u}r kompetentes berufliches Handeln sowohl fachliche als auch {\"u}berfachliche Kompetenzen. Vielfach verlangen wir von Erstsemestern in Grundlagen-Lehrveranstaltungen fast ausschließlich den Aufbau von Fachkompetenz und vernachl{\"a}ssigen dabei h{\"a}ufig Selbstkompetenz, Methodenkompetenz und Sozialkompetenz. Gerade die drei letztgenannten sind f{\"u}r ein erfolgreiches Studium unabdingbar und sollten von Anfang an entwickelt werden. Wir stellen unser „Startprojekt" als einen Beitrag vor, im ersten Semester die eigenverantwortliche, {\"u}berfachliche Kompetenzentwicklung in einem fachlichen Kontext zu f{\"o}rdern.},
  language  = {de}
}
@inproceedings{DennertMoellerGarmannKujathetal.2016,
  author    = {Dennert-M{\"o}ller, Elisabeth and Garmann, Robert and Kujath, Bertold and Zscheyge, Oliver and Weicker, Karsten and B{\"o}hne, Sebastian and Knobelsdorf, Maria and Kreitz, Christoph and Steen, Alexander and Wisniewski, Max and Benzm{\"u}ller, Christoph and Gebhardt, Kai and Ehlenz, Matthias and Bergner, Nadine and Schroeder, Ulrik},
  title     = {Hochschuldidaktik der Informatik},
  editor    = {Schwill, Andreas and Lucke, Ulrike},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-93511},
  pages     = {102},
  year      = {2016},
  abstract  = {Die 7. Fachtagung f{\"u}r Hochschuldidaktik, die 2016 erneut mit der DeLFI E-Learning Fachtagung Informatik stattfand, setzte das erfolgreiche Modell einer Tagung fort, die sich mit hochschuldidaktischen Fragen und der Gestaltung von Studieng{\"a}ngen der Informatik besch{\"a}ftigt. Thema der Tagung waren alle Fragen, die sich der Vermittlung von Informatikgegenst{\"a}nden im Hochschulbereich widmen. Dazu geh{\"o}rten u.a.: • fachdidaktische Konzepte der Vermittlung einzelner Informatikgegenst{\"a}nde • methodische L{\"o}sungen, wie spezielle Lehr- und Lernformen, Durchf{\"u}hrungskonzepte • empirische Ergebnisse und Vergleichsstudien • E-Learning-Ans{\"a}tze, wenn sie ein erkennbares didaktisches Konzept verfolgen • Studienkonzepte und Curricula, organisatorische Fragen, wie Gewinnung von Studierenden, Studieneingangsphase, Abbrecher. Die Fachtagung widmete sich ausgew{\"a}hlten Fragestellungen dieses Themenkomplexes, die durch Vortr{\"a}ge ausgewiesener Experten, durch eingereichte Beitr{\"a}ge und durch Pr{\"a}sentationen und Poster intensiv behandelt wurden. Unser besonderer Dank gilt dem Programmkomitee und den hier nicht genannten Helfern f{\"u}r ihren Einsatz bei der Vorbereitung und Durchf{\"u}hrung der Tagung.},
  language  = {de}
}
@inproceedings{DeselOpelSiegerisetal.2023,
  author    = {Desel, J{\"o}rg and Opel, Simone and Siegeris, Juliane and Draude, Claude and Weber, Gerhard and Schell, Timon and Schwill, Andreas and Thorbr{\"u}gge, Carsten and Sch{\"a}fer, Len Ole and Netzer, Cajus Marian and Gerstenberger, Dietrich and Winkelnkemper, Felix and Schulte, Carsten and B{\"o}ttcher, Axel and Thurner, Veronika and H{\"a}fner, Tanja and Ottinger, Sarah and Große-B{\"o}lting, Gregor and Scheppach, Lukas and M{\"u}hling, Andreas and Baberowski, David and Leonhardt, Thiemo and Rentsch, Susanne and Bergner, Nadine and Bonorden, Leif and Stemme, Jonas and Hoppe, Uwe and Weicker, Karsten and Bender, Esther and Barbas, Helena and Hamann, Fabian and Soll, Marcus and Sitzmann, Daniel},
  title     = {Hochschuldidaktik Informatik HDI 2021},
  series = {Commentarii informaticae didacticae},
  booktitle = {Commentarii informaticae didacticae},
  number    = {13},
  editor    = {Desel, J{\"o}rg and Opel, Simone and Siegeris, Juliane},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-548-4},
  issn      = {1868-0844},
  doi       = {10.25932/publishup-56507},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-565070},
  pages     = {299},
  year      = {2023},
  abstract  = {Die Fachtagungen HDI (Hochschuldidaktik Informatik) besch{\"a}ftigen sich mit den unterschiedlichen Aspekten informatischer Bildung im Hochschulbereich. Neben den allgemeinen Themen wie verschiedenen Lehr- und Lernformen, dem Einsatz von Informatiksystemen in der Hochschullehre oder Fragen der Gewinnung von geeigneten Studierenden, deren Kompetenzerwerb oder auch der Betreuung der Studierenden widmet sich die HDI immer auch einem Schwerpunktthema. Im Jahr 2021 war dies die Ber{\"u}cksichtigung von Diversit{\"a}t in der Lehre. Diskutiert wurden beispielsweise die Einbeziehung von besonderen fachlichen und {\"u}berfachlichen Kompetenzen Studierender, der Unterst{\"u}tzung von Durchl{\"a}ssigkeit aus nichtakademischen Berufen, aber auch die Gestaltung inklusiver Lehr- und Lernszenarios, Aspekte des Lebenslangen Lernens oder sich an die Diversit{\"a}t von Studierenden adaptierte oder adaptierende Lehrsysteme. Dieser Band enth{\"a}lt ausgew{\"a}hlte Beitr{\"a}ge der 9. Fachtagung 2021, die in besonderer Weise die Konferenz und die dort diskutierten Themen repr{\"a}sentieren.},
  language  = {de}
}
@phdthesis{Dick2016,
  author    = {Dick, Uwe},
  title     = {Discriminative Classification Models for Internet Security},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-102593},
  school      = {Universit{\"a}t Potsdam},
  pages     = {x, 57},
  year      = {2016},
  abstract  = {Services that operate over the Internet are under constant threat of being exposed to fraudulent use. Maintaining good user experience for legitimate users often requires the classification of entities as malicious or legitimate in order to initiate countermeasures. As an example, inbound email spam filters decide for spam or non-spam. They can base their decision on both the content of each email as well as on features that summarize prior emails received from the sending server. In general, discriminative classification methods learn to distinguish positive from negative entities. Each decision for a label may be based on features of the entity and related entities. When labels of related entities have strong interdependencies---as can be assumed e.g. for emails being delivered by the same user---classification decisions should not be made independently and dependencies should be modeled in the decision function. This thesis addresses the formulation of discriminative classification problems that are tailored for the specific demands of the following three Internet security applications. Theoretical and algorithmic solutions are devised to protect an email service against flooding of user inboxes, to mitigate abusive usage of outbound email servers, and to protect web servers against distributed denial of service attacks. In the application of filtering an inbound email stream for unsolicited emails, utilizing features that go beyond each individual email's content can be valuable. Information about each sending mail server can be aggregated over time and may help in identifying unwanted emails. However, while this information will be available to the deployed email filter, some parts of the training data that are compiled by third party providers may not contain this information. The missing features have to be estimated at training time in order to learn a classification model. In this thesis an algorithm is derived that learns a decision function that integrates over a distribution of values for each missing entry. The distribution of missing values is a free parameter that is optimized to learn an optimal decision function. The outbound stream of emails of an email service provider can be separated by the customer IDs that ask for delivery. All emails that are sent by the same ID in the same period of time are related, both in content and in label. Hijacked customer accounts may send batches of unsolicited emails to other email providers, which in turn might blacklist the sender's email servers after detection of incoming spam emails. The risk of being blocked from further delivery depends on the rate of outgoing unwanted emails and the duration of high spam sending rates. An optimization problem is developed that minimizes the expected cost for the email provider by learning a decision function that assigns a limit on the sending rate to customers based on the each customer's email stream. Identifying attacking IPs during HTTP-level DDoS attacks allows to block those IPs from further accessing the web servers. DDoS attacks are usually carried out by infected clients that are members of the same botnet and show similar traffic patterns. HTTP-level attacks aim at exhausting one or more resources of the web server infrastructure, such as CPU time. If the joint set of attackers cannot increase resource usage close to the maximum capacity, no effect will be experienced by legitimate users of hosted web sites. However, if the additional load raises the computational burden towards the critical range, user experience will degrade until service may be unavailable altogether. As the loss of missing one attacker depends on block decisions for other attackers---if most other attackers are detected, not blocking one client will likely not be harmful---a structured output model has to be learned. In this thesis an algorithm is developed that learns a structured prediction decoder that searches the space of label assignments, guided by a policy. Each model is evaluated on real-world data and is compared to reference methods. The results show that modeling each classification problem according to the specific demands of the task improves performance over solutions that do not consider the constraints inherent to an application.},
  language  = {en}
}
@article{DiethelmSyrbe2015,
  author    = {Diethelm, Ira and Syrbe, J{\"o}rn},
  title     = {Let's talk about CS!},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82983},
  pages     = {411 -- 414},
  year      = {2015},
  abstract  = {To communicate about a science is the most important key competence in education for any science. Without communication we cannot teach, so teachers should reflect about the language they use in class properly. But the language students and teachers use to communicate about their CS courses is very heterogeneous, inconsistent and deeply influenced by tool names. There is a big lack of research and discussion in CS education regarding the terminology and the role of concepts and tools in our science. We don't have a consistent set of terminology that we agree on to be helpful for learning our science. This makes it nearly impossible to do research on CS competencies as long as we have not agreed on the names we use to describe these. This workshop intends to provide room to fill with discussion and first ideas for future research in this field.},
  language  = {en}
}
@phdthesis{Dietze2004,
  author    = {Dietze, Stefan},
  title     = {Modell und Optimierungsansatz f{\"u}r Open Source Softwareentwicklungsprozesse},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-0001594},
  school      = {Universit{\"a}t Potsdam},
  year      = {2004},
  abstract  = {Gerade in den letzten Jahren erfuhr Open Source Software (OSS) eine zunehmende Verbreitung und Popularit{\"a}t und hat sich in verschiedenen Anwendungsdom{\"a}nen etabliert. Die Prozesse, welche sich im Kontext der OSS-Entwicklung (auch: OSSD \– Open Source Software-Development) evolution{\"a}r herausgebildet haben, weisen in den verschiedenen OSS-Entwicklungsprojekten z.T. {\"a}hnliche Eigenschaften und Strukturen auf und auch die involvierten Entit{\"a}ten, wie z.B. Artefakte, Rollen oder Software-Werkzeuge sind weitgehend miteinander vergleichbar. Dies motiviert den Gedanken, ein verallgemeinerbares Modell zu entwickeln, welches die generalisierbaren Entwicklungsprozesse im Kontext von OSS zu einem {\"u}bertragbaren Modell abstrahiert. Auch in der Wissenschaftsdisziplin des Software Engineering (SE) wurde bereits erkannt, dass sich der OSSD-Ansatz in verschiedenen Aspekten erheblich von klassischen (propriet{\"a}ren) Modellen des SE unterscheidet und daher diese Methoden einer eigenen wissenschaftlichen Betrachtung bed{\"u}rfen. In verschiedenen Publikationen wurden zwar bereits einzelne Aspekte der OSS-Entwicklung analysiert und Theorien {\"u}ber die zugrundeliegenden Entwicklungsmethoden formuliert, aber es existiert noch keine umfassende Beschreibung der typischen Prozesse der OSSD-Methodik, die auf einer empirischen Untersuchung existierender OSS-Entwicklungsprojekte basiert. Da dies eine Voraussetzung f{\"u}r die weitere wissenschaftliche Auseinandersetzung mit OSSD-Prozessen darstellt, wird im Rahmen dieser Arbeit auf der Basis vergleichender Fallstudien ein deskriptives Modell der OSSD-Prozesse hergeleitet und mit Modellierungselementen der UML formalisiert beschrieben. Das Modell generalisiert die identifizierten Prozesse, Prozessentit{\"a}ten und Software-Infrastrukturen der untersuchten OSSD-Projekte. Es basiert auf einem eigens entwickelten Metamodell, welches die zu analysierenden Entit{\"a}ten identifiziert und die Modellierungssichten und -elemente beschreibt, die zur UML-basierten Beschreibung der Entwicklungsprozesse verwendet werden. In einem weiteren Arbeitsschritt wird eine weiterf{\"u}hrende Analyse des identifizierten Modells durchgef{\"u}hrt, um Implikationen, und Optimierungspotentiale aufzuzeigen. Diese umfassen beispielsweise die ungen{\"u}gende Plan- und Terminierbarkeit von Prozessen oder die beobachtete Tendenz von OSSD-Akteuren, verschiedene Aktivit{\"a}ten mit unterschiedlicher Intensit{\"a}t entsprechend der subjektiv wahrgenommenen Anreize auszu{\"u}ben, was zur Vernachl{\"a}ssigung einiger Prozesse f{\"u}hrt. Anschließend werden Optimierungszielstellungen dargestellt, die diese Unzul{\"a}nglichkeiten adressieren, und ein Optimierungsansatz zur Verbesserung des OSSD-Modells wird beschrieben. Dieser Ansatz umfasst die Erweiterung der identifizierten Rollen, die Einf{\"u}hrung neuer oder die Erweiterung bereits identifizierter Prozesse und die Modifikation oder Erweiterung der Artefakte des generalisierten OSS-Entwicklungsmodells. Die vorgestellten Modellerweiterungen dienen vor allem einer gesteigerten Qualit{\"a}tssicherung und der Kompensation von vernachl{\"a}ssigten Prozessen, um sowohl die entwickelte Software- als auch die Prozessqualit{\"a}t im OSSD-Kontext zu verbessern. Desweiteren werden Softwarefunktionalit{\"a}ten beschrieben, welche die identifizierte bestehende Software-Infrastruktur erweitern und eine gesamtheitlichere, softwaretechnische Unterst{\"u}tzung der OSSD-Prozesse erm{\"o}glichen sollen. Abschließend werden verschiedene Anwendungsszenarien der Methoden des OSS-Entwicklungsmodells, u.a. auch im kommerziellen SE, identifiziert und ein Implementierungsansatz basierend auf der OSS GENESIS vorgestellt, der zur Implementierung und Unterst{\"u}tzung des OSSD-Modells verwendet werden kann.},
  language  = {de}
}
@article{DittmarBuchholzKuehn2016,
  author    = {Dittmar, Anke and Buchholz, Gregor and K{\"u}hn, Mathias},
  title     = {Eine Studie zum kollaborativen Modellieren in der Softwaretechnik-Ausbildung},
  series = {Commentarii informaticae didacticae (CID)},
  journal   = {Commentarii informaticae didacticae (CID)},
  number    = {10},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94806},
  pages     = {41 -- 53},
  year      = {2016},
  abstract  = {Die Vermittlung von Modellierungsf{\"a}higkeiten in der Softwaretechnik-Ausbildung konzentriert sich meist auf Modellierungskonzepte, Notationen und Entwicklungswerkzeuge. Die Betrachtung der Modellierungsaktivit{\"a}ten, etwa die Entwicklung und Gegen{\"u}berstellung alternativer Modellvorschl{\"a}ge, steht weniger im Vordergrund. Die vorliegende Studie untersucht zwei Formen des kollaborativen Modellierens am Tabletop in Bezug auf ihren Einfluss auf die Modellierungsaktivit{\"a}ten in kleinen Gruppen. Die Ergebnisse zeigen, dass sowohl selbstorganisierte als auch moderierte Modellierungssitzungen das Entwickeln eines gemeinsamen Modellverst{\"a}ndnisses f{\"o}rdern. In moderierten Sitzungen wurden zudem mehr alternative L{\"o}sungsideen entwickelt und in st{\"a}rkerem Maße diskutiert.},
  language  = {de}
}
@phdthesis{Dornhege2006,
  author    = {Dornhege, Guido},
  title     = {Increasing information transfer rates for brain-computer interfacing},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-7690},
  school      = {Universit{\"a}t Potsdam},
  year      = {2006},
  abstract  = {The goal of a Brain-Computer Interface (BCI) consists of the development of a unidirectional interface between a human and a computer to allow control of a device only via brain signals. While the BCI systems of almost all other groups require the user to be trained over several weeks or even months, the group of Prof. Dr. Klaus-Robert M{\"u}ller in Berlin and Potsdam, which I belong to, was one of the first research groups in this field which used machine learning techniques on a large scale. The adaptivity of the processing system to the individual brain patterns of the subject confers huge advantages for the user. Thus BCI research is considered a hot topic in machine learning and computer science. It requires interdisciplinary cooperation between disparate fields such as neuroscience, since only by combining machine learning and signal processing techniques based on neurophysiological knowledge will the largest progress be made. In this work I particularly deal with my part of this project, which lies mainly in the area of computer science. I have considered the following three main points: <b>Establishing a performance measure based on information theory:</b> I have critically illuminated the assumptions of Shannon's information transfer rate for application in a BCI context. By establishing suitable coding strategies I was able to show that this theoretical measure approximates quite well to what is practically achieveable. <b>Transfer and development of suitable signal processing and machine learning techniques:</b> One substantial component of my work was to develop several machine learning and signal processing algorithms to improve the efficiency of a BCI. Based on the neurophysiological knowledge that several independent EEG features can be observed for some mental states, I have developed a method for combining different and maybe independent features which improved performance. In some cases the performance of the combination algorithm outperforms the best single performance by more than 50 \%. Furthermore, I have theoretically and practically addressed via the development of suitable algorithms the question of the optimal number of classes which should be used for a BCI. It transpired that with BCI performances reported so far, three or four different mental states are optimal. For another extension I have combined ideas from signal processing with those of machine learning since a high gain can be achieved if the temporal filtering, i.e., the choice of frequency bands, is automatically adapted to each subject individually. <b>Implementation of the Berlin brain computer interface and realization of suitable experiments:</b> Finally a further substantial component of my work was to realize an online BCI system which includes the developed methods, but is also flexible enough to allow the simple realization of new algorithms and ideas. So far, bitrates of up to 40 bits per minute have been achieved with this system by absolutely untrained users which, compared to results of other groups, is highly successful.},
  subject      = {Kybernetik},
  language  = {en}
}
@phdthesis{Dramlitsch2002,
  author    = {Dramlitsch, Thomas},
  title     = {Distributed computations in a dynamic, heterogeneous Grid environment},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-0000759},
  school      = {Universit{\"a}t Potsdam},
  year      = {2002},
  abstract  = {Die immer dichtere und schnellere Vernetzung von Rechnern und Rechenzentren {\"u}ber Hochgeschwindigkeitsnetzwerke erm{\"o}glicht eine neue Art des wissenschaftlich verteilten Rechnens, bei der geographisch weit auseinanderliegende Rechenkapazit{\"a}ten zu einer Gesamtheit zusammengefasst werden k{\"o}nnen. Dieser so entstehende virtuelle Superrechner, der selbst aus mehreren Grossrechnern besteht, kann dazu genutzt werden Probleme zu berechnen, f{\"u}r die die einzelnen Grossrechner zu klein sind. Die Probleme, die numerisch mit heutigen Rechenkapazit{\"a}ten nicht l{\"o}sbar sind, erstrecken sich durch s{\"a}mtliche Gebiete der heutigen Wissenschaft, angefangen von Astrophysik, Molek{\"u}lphysik, Bioinformatik, Meteorologie, bis hin zur Zahlentheorie und Fluiddynamik um nur einige Gebiete zu nennen. Je nach Art der Problemstellung und des L{\"o}sungsverfahrens gestalten sich solche "Meta-Berechnungen" mehr oder weniger schwierig. Allgemein kann man sagen, dass solche Berechnungen um so schwerer und auch um so uneffizienter werden, je mehr Kommunikation zwischen den einzelnen Prozessen (oder Prozessoren) herrscht. Dies ist dadurch begr{\"u}ndet, dass die Bandbreiten bzw. Latenzzeiten zwischen zwei Prozessoren auf demselben Grossrechner oder Cluster um zwei bis vier Gr{\"o}ssenordnungen h{\"o}her bzw. niedriger liegen als zwischen Prozessoren, welche hunderte von Kilometern entfernt liegen. Dennoch bricht nunmehr eine Zeit an, in der es m{\"o}glich ist Berechnungen auf solch virtuellen Supercomputern auch mit kommunikationsintensiven Programmen durchzuf{\"u}hren. Eine grosse Klasse von kommunikations- und berechnungsintensiven Programmen ist diejenige, die die L{\"o}sung von Differentialgleichungen mithilfe von finiten Differenzen zum Inhalt hat. Gerade diese Klasse von Programmen und deren Betrieb in einem virtuellen Superrechner wird in dieser vorliegenden Dissertation behandelt. Methoden zur effizienteren Durchf{\"u}hrung von solch verteilten Berechnungen werden entwickelt, analysiert und implementiert. Der Schwerpunkt liegt darin vorhandene, klassische Parallelisierungsalgorithmen zu analysieren und so zu erweitern, dass sie vorhandene Informationen (z.B. verf{\"u}gbar durch das Globus Toolkit) {\"u}ber Maschinen und Netzwerke zur effizienteren Parallelisierung nutzen. Soweit wir wissen werden solche Zusatzinformationen kaum in relevanten Programmen genutzt, da der Grossteil aller Parallelisierungsalgorithmen implizit f{\"u}r die Ausf{\"u}hrung auf Grossrechnern oder Clustern entwickelt wurde.},
  language  = {en}
}
@article{DrewsSchirmerMorisseetal.2013,
  author    = {Drews, Paul and Schirmer, Ingrid and Morisse, Marcel and Sagawe, Arno and Rolf, Arno},
  title     = {Reflexionsdialog mit DialogueMaps},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64983},
  pages     = {117 -- 123},
  year      = {2013},
  abstract  = {In einigen Bereichen der Informatiklehre ist es m{\"o}glich, die pers{\"o}nlichen Erfahrungen der Studierenden im Umgang mit Informationstechnik aufzugreifen und vor dem Hintergrund theoretischer Konzepte aus der Literatur gemeinsam mit ihnen zu reflektieren. Das hier vorgestellte Lehrkonzept des Reflexionsdialogs erstreckt sich {\"u}ber drei Seminartermine und vorbereitende Selbstlernphasen. Unterst{\"u}tzt wird das Konzept durch DialogueMaps, eine Software zur Visualisierung komplexer Sachverhalte und zur Unterst{\"u}tzung interaktiver Dialoge. Dieser Beitrag beschreibt die Hintergr{\"u}nde des Lehrkonzeptes, das Lehrkonzept selbst sowie die inhaltliche Ausgestaltung im Rahmen eines Mastermoduls „Computergest{\"u}tzte Kooperation".},
  language  = {de}
}
@article{Doerge2013,
  author    = {D{\"o}rge, Christina},
  title     = {Entwicklung eines methodologischen Verfahrens zur Ermittlung von informatischen Kompetenzen},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64906},
  pages     = {85 -- 90},
  year      = {2013},
  abstract  = {Der traditionelle Weg in der Informatik besteht darin, Kompetenzen entweder normativ durch eine Expertengruppe festzulegen oder als Ableitungsergebnis eines Bildungsstandards aus einem externen Feld. Dieser Artikel stellt einen neuartigen und alternativen Ansatz vor, der sich der Methodik der Qualitativen Inhaltsanalyse (QI) bedient. Das Ziel war die Ableitung von informatischen Schl{\"u}sselkompetenzen anhand bereits etablierter und erprobter didaktischer Ans{\"a}tze der Informatikdidaktik. Dazu wurde zun{\"a}chst aus einer Reihe von Informatikdidaktikb{\"u}chern eine Liste mit m{\"o}glichen Kandidaten f{\"u}r Kompetenzen generiert. Diese Liste wurde als QI-Kategoriensystem verwendet, mit der sechs verschiedene didaktische Ans{\"a}tze analysiert wurden. Ein abschließender Verfeinerungsschritt erfolgte durch die {\"U}berpr{\"u}fung, welche der gefundenen Kompetenzen in allen vier Kernbereichen der Informatik (theoretische, technische, praktische und angewandte Informatik) Anwendung finden. Diese Methode wurde f{\"u}r die informatische Schulausbildung exemplarisch entwickelt und umgesetzt, ist aber ebenfalls ein geeignetes Vorgehen f{\"u}r die Identifizierung von Schl{\"u}sselkompetenzen in anderen Gebieten, wie z. B. in der informatischen Hochschulausbildung, und soll deshalb hier kurz vorgestellt werden.},
  language  = {de}
}
@article{Doerge2013,
  author    = {D{\"o}rge, Christina},
  title     = {Entwicklung eines Kompetenzrahmenmodells f{\"u}r die universit{\"a}re Lehre},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64946},
  pages     = {91 -- 97},
  year      = {2013},
  abstract  = {Zurzeit haben wir es mit der folgenden Situation an Universit{\"a}ten zu tun: Studierende kommen mit unterschiedlichem Wissen und Kompetenzen zur Universit{\"a}t, um informatikbezogene Studieng{\"a}nge zu belegen. Diesem Umstand muss in den universit{\"a}ren Kursen entgegengewirkt werden, um ein einheitliches Bildungsziel zu erreichen. F{\"u}r einige Studierende bedeutet dies oft eine Lehrbelastung in einem ohnehin sehr zeitintensiven Studium, was nicht selten zum Studienabbruch f{\"u}hrt. Ein anderes Problem ist die fehlende Transparenz bez{\"u}glich der Gegenst{\"a}nde des Informatikstudiums: einige angehende Studierende kommen mit einem von der Realit{\"a}t abweichenden Bild der Informatik zur Universit{\"a}t, andere entscheiden sich u. U. deshalb gegen ein Informatikstudium, da ihnen nicht bewusst ist, dass das Studium f{\"u}r sie interessant sein k{\"o}nnte. In diesem Artikel soll ein L{\"o}sungsvorschlag anhand eines Kompetenzrahmenmodells vorgestellt werden, mit dessen Hilfe eine Verbesserung der Hochschulsituation erreicht werden kann.},
  language  = {de}
}
@article{DuennebierDiethelm2010,
  author    = {D{\"u}nnebier, Malte and Diethelm, Ira},
  title     = {Ein virtueller Lernraum f{\"u}r die Informatiklehrerweiterbildung},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {4},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64359},
  pages     = {65 -- 70},
  year      = {2010},
  abstract  = {Bei der Suche nach M{\"o}glichkeiten, die Weiterbildung f{\"u}r Informatiklehrkr{\"a}fte auszubauen, bietet sich der Einsatz virtueller Lernr{\"a}ume an. Dieses Papier berichtet {\"u}ber ein Projekt, in dem ein exemplarischer virtueller Lernraum f{\"u}r kollaboratives Lernen in der Lehrerweiterbildung in Informatik theoriegeleitet erstellt, erprobt und bewertet wurde. Die erzielten Ergebnisse {\"u}ber das Nutzungsverhalten k{\"o}nnen f{\"u}r weitere E-Learningprojekte in der Lehrerbildung hilfreich sein. Der Schwerpunkt dieses Papiers liegt auf der Gestaltung des Lernraums unter Beachtung der speziellen Situation der Informatiklehrkr{\"a}fte, nicht auf der didaktischen Aufbereitung der betreffenden Lerneinheit.},
  language  = {de}
}
@misc{EbertLamprechtSteffenetal.2012,
  author    = {Ebert, Birgitta E. and Lamprecht, Anna-Lena and Steffen, Bernhard and Blank, Lars M.},
  title     = {Flux-P},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {1054},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-47669},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-476696},
  pages     = {872 -- 890},
  year      = {2012},
  abstract  = {Quantitative knowledge of intracellular fluxes in metabolic networks is invaluable for inferring metabolic system behavior and the design principles of biological systems. However, intracellular reaction rates can not often be calculated directly but have to be estimated; for instance, via 13C-based metabolic flux analysis, a model-based interpretation of stable carbon isotope patterns in intermediates of metabolism. Existing software such as FiatFlux, OpenFLUX or 13CFLUX supports experts in this complex analysis, but requires several steps that have to be carried out manually, hence restricting the use of this software for data interpretation to a rather small number of experiments. In this paper, we present Flux-P as an approach to automate and standardize 13C-based metabolic flux analysis, using the Bio-jETI workflow framework. Exemplarily based on the FiatFlux software, it demonstrates how services can be created that carry out the different analysis steps autonomously and how these can subsequently be assembled into software workflows that perform automated, high-throughput intracellular flux analysis of high quality and reproducibility. Besides significant acceleration and standardization of the data analysis, the agile workflow-based realization supports flexible changes of the analysis workflows on the user level, making it easy to perform custom analyses.},
  language  = {en}
}
@article{EhlenzBergnerSchroeder2016,
  author    = {Ehlenz, Matthias and Bergner, Nadine and Schroeder, Ulrik},
  title     = {Synergieeffekte zwischen Fach- und Lehramtsstudierenden in Softwarepraktika},
  series = {Commentarii informaticae didacticae (CID)},
  journal   = {Commentarii informaticae didacticae (CID)},
  number    = {10},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94875},
  pages     = {99 -- 102},
  year      = {2016},
  abstract  = {Dieser Beitrag diskutiert die Konzeption eines Software-Projektpraktikums im Bereich E-Learning, welches Lehramts- und Fachstudierenden der Informatik erm{\"o}glicht, voneinander zu profitieren und praxisrelevante Ergebnisse generiert. Vorbereitungen, Organisation und Durchf{\"u}hrung werden vorgestellt und diskutiert. Den Abschluss bildet ein Ausblick auf die Fortf{\"u}hrung des Konzepts und den Ausbau des Forschungsgebietes.},
  language  = {de}
}
@article{EirundSethmann2009,
  author    = {Eirund, Helmut and Sethmann, Richard},
  title     = {NetS-X : Netzsicherheit lernen mit Spaß},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {1},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29660},
  pages     = {81 -- 92},
  year      = {2009},
  abstract  = {Das Gebiet der Netzsicherheit ist ein schwer zu lehrendes und m{\"u}hsam zu lernendes Fach in der Informatikausbildung. Dies hat verschiedene Gr{\"u}nde, z.B. erfordert es Fachkenntnis, die jenseits von bunten Bildern zu vermitteln ist und sich dabei mit geringer Halbwertszeit weiterentwickelt. Echte Bedrohungsszenarien m{\"u}ssen unter Laborbedingungen nachgestellt werden, und der Umgang mit den Sicherheitswerkzeugen ist sehr komplex. Auf der einen Seite muss das System konzeptionell verstanden werden und auf der anderen Seite sind viele Details in der Konfiguration von Firewalls, Netz-Komponenten und -Werkzeugen f{\"u}r klassische Pr{\"u}fungssituationen in der Ausbildung anzuwenden. Mit NetS-X (Network Security Experience) stellen wir einen laufenden Prototyp einer e-learning Plattform vor, mit der ein weiter Bereich von Sicherheitsszenarien vermittelt werden kann. Dabei wird der Lernende in einem Spielsystem mit Situationen konfrontiert, die er in einer echten, auf Linux basierenden typischen IT-Infrastruktur eines Unternehmens beherrschen muss. Die sicherheitsrelevanten Aktivit{\"a}ten des Lernenden, z.B. der Einsatz von Monitor-Werkzeugen oder die Konfiguration von Netz-Komponenten werden dabei nicht simuliert, sondern real durchgef{\"u}hrt und durch Prozesse des Spielsystems beobachtet und bewertet. Autorenwerkzeuge erm{\"o}glichen den Lehrenden und Spielern, selber neue Spielsituationen, Sicherheitsszenarien oder Wissenskomponenten in das System zu integrieren.},
  language  = {de}
}
@article{EllisAbreuEllis2015,
  author    = {Ellis, Jason Brent and Abreu-Ellis, Carla Reis},
  title     = {Student Perspectives of Social Networking use in Higher Education},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82632},
  pages     = {117 -- 131},
  year      = {2015},
  abstract  = {Social networks are currently at the forefront of tools that lend to Personal Learning Environments (PLEs). This study aimed to observe how students perceived PLEs, what they believed were the integral components of social presence when using Facebook as part of a PLE, and to describe student's preferences for types of interactions when using Facebook as part of their PLE. This study used mixed methods to analyze the perceptions of graduate and undergraduate students on the use of social networks, more specifically Facebook as a learning tool. Fifty surveys were returned representing a 65 \% response rate. Survey questions included both closed and open-ended questions. Findings suggested that even though students rated themselves relatively well in having requisite technology skills, and 94 \% of students used Facebook primarily for social use, they were hesitant to migrate these skills to academic use because of concerns of privacy, believing that other platforms could fulfil the same purpose, and by not seeing the validity to use Facebook in establishing social presence. What lies at odds with these beliefs is that when asked to identify strategies in Facebook that enabled social presence to occur in academic work, the majority of students identified strategies in five categories that lead to social presence establishment on Facebook during their coursework.},
  language  = {en}
}
@article{EngbringKlar2015,
  author    = {Engbring, Dieter and Klar, Tilman-Mathies},
  title     = {Medienbildung mit Informatik-Anteilen!?},
  series = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  volume    = {2015},
  journal   = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  number    = {9},
  editor    = {Schubert, Sigrid and Schwill, Andreas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-84693},
  pages     = {125 -- 142},
  year      = {2015},
  abstract  = {Auf der Grundlage der Planung, Durchf{\"u}hrung, Evaluation und Revision eines gemeinsamen Seminars von Medienp{\"a}dagogik und Didaktik der Informatik stellen wir in diesem Aufsatz dar, wo die Defizite klassischer Medienbildung in Bezug auf digitale bzw. interaktive Medien liegen und welche Inhalte der Informatik f{\"u}r Studierende aller Lehr{\"a}mter - im allgemeinbildenden Sinne - aus dieser Perspektive relevant erscheinen.},
  language  = {de}
}
@article{EngbringSelke2013,
  author    = {Engbring, Dieter and Selke, Harald},
  title     = {Informatik und Gesellschaft als Gebiet der Informatik},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64977},
  pages     = {111 -- 116},
  year      = {2013},
  abstract  = {In diesem Beitrag berichten wir {\"u}ber die Erfahrungen einer umgestalteten Lehre im Bereich Informatik und Gesellschft (IuG). Die Gr{\"u}nde f{\"u}r die Umge staltung und die Konzeption werden skizziert. Die Erfahrungen haben wir zu Thesen verdichtet: 1. Informatik und Gesellschaft sollte eine Pflichtveranstaltung im Bachelor-Studium sein, in der Studierende einen {\"U}berblick erhalten, welche gesellschaftlichen Rahmenbedingungen f{\"u}r sie relevant sind und wie man diese in die Praxis mit einbeziehen kann. 2. Historische Inhalte der Informatik sollen hier aufgearbeitet werden, indem man aktuelle Entwicklungen im Kontext ihrer Genese betrachtet.},
  language  = {de}
}
@misc{Fandinno2019,
  author    = {Fandinno, Jorge},
  title     = {Founded (auto)epistemic equilibrium logic satisfies epistemic splitting},
  series = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  journal   = {Postprints der Universit{\"a}t Potsdam : Mathematisch-Naturwissenschaftliche Reihe},
  number    = {1060},
  issn      = {1866-8372},
  doi       = {10.25932/publishup-46968},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-469685},
  pages     = {671 -- 687},
  year      = {2019},
  abstract  = {In a recent line of research, two familiar concepts from logic programming semantics (unfounded sets and splitting) were extrapolated to the case of epistemic logic programs. The property of epistemic splitting provides a natural and modular way to understand programs without epistemic cycles but, surprisingly, was only fulfilled by Gelfond's original semantics (G91), among the many proposals in the literature. On the other hand, G91 may suffer from a kind of self-supported, unfounded derivations when epistemic cycles come into play. Recently, the absence of these derivations was also formalised as a property of epistemic semantics called foundedness. Moreover, a first semantics proved to satisfy foundedness was also proposed, the so-called Founded Autoepistemic Equilibrium Logic (FAEEL). In this paper, we prove that FAEEL also satisfies the epistemic splitting property something that, together with foundedness, was not fulfilled by any other approach up to date. To prove this result, we provide an alternative characterisation of FAEEL as a combination of G91 with a simpler logic we called Founded Epistemic Equilibrium Logic (FEEL), which is somehow an extrapolation of the stable model semantics to the modal logic S5.},
  language  = {en}
}
@article{FietkauKindsmuellerGoettel2015,
  author    = {Fietkau, Julian and Kindsm{\"u}ller, Martin Christof and G{\"o}ttel, Timo},
  title     = {Rapid Prototyping von Interaktionskonzepten in der universit{\"a}ren MCI-Lehre},
  series = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  volume    = {2015},
  journal   = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  number    = {9},
  editor    = {Schubert, Sigrid and Schwill, Andreas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-84718},
  pages     = {153 -- 160},
  year      = {2015},
  abstract  = {In der Lehre zur MCI (Mensch-Computer-Interaktion) stellt sich immer wieder die Herausforderung, praktische {\"U}bungen mit spannenden Ergebnissen durchzuf{\"u}hren, die sich dennoch nicht in technischen Details verlieren sondern MCI-fokussiert bleiben. Im Lehrmodul „Interaktionsdesign" an der Universit{\"a}t Hamburg werden von Studierenden innerhalb von drei Wochen prototypische Interaktionskonzepte f{\"u}r das Spiel Neverball entworfen und praktisch umgesetzt. Anders als in den meisten Grundlagenkursen zur MCI werden hier nicht Mock-Ups, sondern lauff{\"a}hige Software entwickelt. Um dies innerhalb der Projektzeit zu erm{\"o}glichen, wurde Neverball um eine TCP-basierte Schnittstelle erweitert. So entf{\"a}llt die aufw{\"a}ndige Einarbeitung in den Quellcode des Spiels und die Studierenden k{\"o}nnen sich auf ihre Interaktionsprototypen konzentrieren. Wir beschreiben die Erfahrungen aus der mehrmaligen Durchf{\"u}hrung des Projektes und erl{\"a}utern unser Vorgehen bei der Umsetzung. Die Ergebnisse sollen Lehrende im Bereich MCI unterst{\"u}tzen, {\"a}hnliche praxisorientierte {\"U}bungen mit Ergebnissen „zum Anfassen" zu gestalten.},
  language  = {de}
}
@phdthesis{Floeter2005,
  author    = {Fl{\"o}ter, Andr{\´e}},
  title     = {Analyzing biological expression data based on decision tree induction},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-6416},
  school      = {Universit{\"a}t Potsdam},
  year      = {2005},
  abstract  = {Modern biological analysis techniques supply scientists with various forms of data. One category of such data are the so called "expression data". These data indicate the quantities of biochemical compounds present in tissue samples. Recently, expression data can be generated at a high speed. This leads in turn to amounts of data no longer analysable by classical statistical techniques. Systems biology is the new field that focuses on the modelling of this information. At present, various methods are used for this purpose. One superordinate class of these meth­ods is machine learning. Methods of this kind had, until recently, predominantly been used for classification and prediction tasks. This neglected a powerful secondary benefit: the ability to induce interpretable models. Obtaining such models from data has become a key issue within Systems biology. Numerous approaches have been proposed and intensively discussed. This thesis focuses on the examination and exploitation of one basic technique: decision trees. The concept of comparing sets of decision trees is developed. This method offers the pos­sibility of identifying significant thresholds in continuous or discrete valued attributes through their corresponding set of decision trees. Finding significant thresholds in attributes is a means of identifying states in living organisms. Knowing about states is an invaluable clue to the un­derstanding of dynamic processes in organisms. Applied to metabolite concentration data, the proposed method was able to identify states which were not found with conventional techniques for threshold extraction. A second approach exploits the structure of sets of decision trees for the discovery of com­binatorial dependencies between attributes. Previous work on this issue has focused either on expensive computational methods or the interpretation of single decision trees ­ a very limited exploitation of the data. This has led to incomplete or unstable results. That is why a new method is developed that uses sets of decision trees to overcome these limitations. Both the introduced methods are available as software tools. They can be applied consecu­tively or separately. That way they make up a package of analytical tools that usefully supplement existing methods. By means of these tools, the newly introduced methods were able to confirm existing knowl­edge and to suggest interesting and new relationships between metabolites.},
  subject      = {Molekulare Bioinformatik},
  language  = {en}
}
@article{Frank2012,
  author    = {Frank, Mario},
  title     = {Axiom relevance decision engine : technical report},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-72128},
  year      = {2012},
  abstract  = {This document presents an axiom selection technique for classic first order theorem proving based on the relevance of axioms for the proof of a conjecture. It is based on unifiability of predicates and does not need statistical information like symbol frequency. The scope of the technique is the reduction of the set of axioms and the increase of the amount of provable conjectures in a given time. Since the technique generates a subset of the axiom set, it can be used as a preprocessor for automated theorem proving. This technical report describes the conception, implementation and evaluation of ARDE. The selection method, which is based on a breadth-first graph search by unifiability of predicates, is a weakened form of the connection calculus and uses specialised variants or unifiability to speed up the selection. The implementation of the concept is evaluated with comparison to the results of the world championship of theorem provers of the year 2012 (CASC J6). It is shown that both the theorem prover leanCoP which uses the connection calculus and E which uses equality reasoning, can benefit from the selection approach. Also, the evaluation shows that the concept is applyable for theorem proving problems with thousands of formulae and that the selection is independent from the calculus used by the theorem prover.},
  language  = {en}
}
@misc{Frank2013,
  type      = {Master Thesis},
  author    = {Frank, Mario},
  title     = {TEMPLAR : efficient determination of relevant axioms in big formula sets for theorem proving},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-72112},
  school      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {This document presents a formula selection system for classical first order theorem proving based on the relevance of formulae for the proof of a conjecture. It is based on unifiability of predicates and is also able to use a linguistic approach for the selection. The scope of the technique is the reduction of the set of formulae and the increase of the amount of provable conjectures in a given time. Since the technique generates a subset of the formula set, it can be used as a preprocessor for automated theorem proving. The document contains the conception, implementation and evaluation of both selection concepts. While the one concept generates a search graph over the negation normal forms or Skolem normal forms of the given formulae, the linguistic concept analyses the formulae and determines frequencies of lexemes and uses a tf-idf weighting algorithm to determine the relevance of the formulae. Though the concept is built for first order logic, it is not limited to it. The concept can be used for higher order and modal logik, too, with minimal adoptions. The system was also evaluated at the world championship of automated theorem provers (CADE ATP Systems Competition, CASC-24) in combination with the leanCoP theorem prover and the evaluation of the results of the CASC and the benchmarks with the problems of the CASC of the year 2012 (CASC-J6) show that the concept of the system has positive impact to the performance of automated theorem provers. Also, the benchmarks with two different theorem provers which use different calculi have shown that the selection is independent from the calculus. Moreover, the concept of TEMPLAR has shown to be competitive to some extent with the concept of SinE and even helped one of the theorem provers to solve problems that were not (or slower) solved with SinE selection in the CASC. Finally, the evaluation implies that the combination of the unification based and linguistic selection yields more improved results though no optimisation was done for the problems.},
  language  = {en}
}
@book{Freischlad2009,
  author    = {Freischlad, Stefan},
  title     = {Entwicklung und Erprobung des Didaktischen Systems Internetworking im Informatikunterricht},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-058-8},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41851},
  publisher      = {Universit{\"a}t Potsdam},
  pages     = {XIV, 405},
  year      = {2009},
  abstract  = {Internetbasierte Informatiksysteme beeinflussen in steigendem Maße Situationen in unterschiedlichen Lebensbereichen. Kompetenzen zur Verwendung von Internetanwendungen und -diensten m{\"u}ssen explizit erworben werden, weil damit ein notwendiger Einblick in nicht beobachtbare Abl{\"a}ufe und nicht offen sichtbare Strukturen verbunden ist. Bisher gibt es Vorschl{\"a}ge f{\"u}r die Gestaltung schulischer Lehr-Lernprozesse zu ausgew{\"a}hlten Teilaspekten des Internets. Es fehlt eine systematische Analyse des Bildungsbedarfs und ein daraus resultierendes Unterrichtsmodell. In dieser Arbeit wird ein Gesamtkonzept f{\"u}r den Informatikunterricht in der Sekundarstufe II vorgestellt, das zu zielgerichteter und verantwortungsvoller Anwendung des Internets beitr{\"a}gt. Die vorliegende Arbeit umfasst den Prozess von der Analyse erforderlicher Kompetenzen bis zur Realisierung von Lehr-Lernprozessen im Informatikunterricht in der Sekundarstufe II. Es werden der Beitrag der Informatik zu identifizierten Kompetenzen untersucht und Bildungsanforderungen bestimmt. Bildungsempfehlungen und Forschungsergebnisse zu erfolgreichen Unterrichtseinheiten werden im Hinblick auf die Bildungsziele analysiert. Der Informatikunterricht unterst{\"u}tzt die Kompetenzentwicklung zu internetbasierten digitalen Medien. Es wird die Entwicklung eines Unterrichtsmodells zu Internetworking beschrieben. Dazu wird der Ansatz der Didaktischen Systeme untersucht, weiter entwickelt und auf den Bereich Internetworking {\"u}bertragen. Der theoretische Ansatz wird dazu in vier Unterrichtsprojekten zu Internetworking in der Praxis realisiert. Beziehungen zwischen Fachkonzepten zu Internetworking werden untersucht und durch Wissensstrukturen zur Planung von Unterrichtsprojekten eingesetzt und in der Praxis erprobt. Die Beschreibung von Lernaktivit{\"a}ten erfolgt auf der Basis von Aufgabenklassen, die das notwendige Wissen zur Bearbeitung einer Aufgabenstellung repr{\"a}sentieren. Auf der Grundlage des Ablaufs der Aufgabenbearbeitung werden Eigenschaften von Aufgaben beschrieben und zu deren Gestaltung nutzbar gemacht. Bisher nicht durchf{\"u}hrbare T{\"a}tigkeiten im Unterricht werden durch die Entwicklung der Lernsoftware Filius erm{\"o}glicht. Die Reduktion der komplexen Wirklichkeit durch Simulation realer internetbasierter Informatiksysteme und die Auswahl geeigneter Sichten auf den Untersuchungsgegenstand werden mit Ergebnissen der Informatikdidaktik begr{\"u}ndet. Unterrichtsprojekte zu den Zielen werden durchgef{\"u}hrt, um Lehr-Lernprozesse zu erkunden und das entwickelte Didaktische System zu erproben. Ausgehend von der theoretischen Fundierung erfolgt die praktische Realisierung von Lehr-Lernprozessen. Zur Erprobung im Informatikunterricht der Sekundarstufe II in Nordrhein-Westfalen werden Minimalziele aufgrund der Lehrvorgaben bestimmt. Die methodische Gestaltung in der Erprobung erfolgt unter Ber{\"u}cksichtigung der Vorgaben f{\"u}r den Informatikunterricht und allgemeinen Anforderungen der Fachdidaktik. Handlungsorientierte Unterrichtsmittel werden ausgew{\"a}hlt und in der Praxis zur Untersuchung der Lehr-Lernprozesse verwendet. Im Unterricht identifizierte Lernschwierigkeiten f{\"u}hren zur Modifikation der Wissensstrukturen und werden im Entwicklungsprozess von Filius ber{\"u}cksichtigt. Die Erkenntnisse aus Unterrichtsprojekten werden genutzt, um zu bestimmen, zu welchen Aufgabenklassen weitere Aufgaben erforderlich sind und inwieweit das aus den identifizierten Merkmalen abgeleitete Vorgehen zur Entwicklung niveaubestimmender Aufgaben genutzt werden kann. Die Erprobungen best{\"a}tigen die Tragf{\"a}higkeit des Didaktischen Systems Internetworking und leisten mit der Implementierung in der Praxis einen Beitrag zur Untersuchung von Kompetenzentwicklung im Informatikunterricht. Mit dem Didaktischen System Internetworking wird ein theoretisch fundiertes und empirisch erprobtes Unterrichtsmodell zur Entwicklung von Kompetenzen zur Einrichtung und Anwendung internetbasierter Informatiksysteme beschrieben.},
  language  = {de}
}
@article{FrenkelWeicker2010,
  author    = {Frenkel, Marcus and Weicker, Karsten},
  title     = {Pseudo},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {4},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64328},
  pages     = {47 -- 52},
  year      = {2010},
  abstract  = {Pseudo ist eine auf Pseudocode basierende Programmiersprache, welche in der akademischen Lehre zum Einsatz kommen und hier die Vermittlung und Untersuchung von Algorithmen und Datenstrukturen unterst{\"u}tzen soll. Dieser Beitrag geht auf die Besonderheiten der Sprache sowie m{\"o}gliche didaktische Szenarien ein.},
  language  = {de}
}
@article{FriedemannGroegerSchumann2013,
  author    = {Friedemann, Stefan and Gr{\"o}ger, Stefan and Schumann, Matthias},
  title     = {Was denken Studierende {\"u}ber SAP ERP?},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64995},
  pages     = {124 -- 130},
  year      = {2013},
  abstract  = {Viele Hochschulen nutzen SAP ERP in der Lehre, um den Studierenden einen Einblick in die Funktionsweise und den Aufbau von integrierter Standardsoftware zu erm{\"o}glichen. Im Rahmen solcher Schulungen bilden die Studierenden eine Meinung und Bewertung der Software. In diesem Artikel wird untersucht, wie sich klassische Modelle der Nutzungswahrnehmung auf die spezielle Situation von SAP ERP in der Lehre {\"u}bertragen lassen und welchen Einfluss bestimmte Faktoren haben. Dazu wurden vier Vorher-Nachher-Studien durchgef{\"u}hrt. Die Ergebnisse zeigen, dass die Funktionalit{\"a}t im Laufe der Schulung positiver und die Benutzungsfreundlichkeit als negativer bewertet wird.},
  language  = {de}
}
@article{FroitzheimBergnerSchroeder2015,
  author    = {Froitzheim, Manuel and Bergner, Nadine and Schroeder, Ulrik},
  title     = {Android-Workshop zur Vertiefung der Kenntnisse bez{\"u}glich Datenstrukturen und Programmierung in der Studieneingangsphase},
  series = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  volume    = {2015},
  journal   = {HDI 2014 : Gestalten von {\"U}berg{\"a}ngen},
  number    = {9},
  editor    = {Schwill, Andreas},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-80247},
  pages     = {11 -- 26},
  year      = {2015},
  abstract  = {Die Studieneingangsphase stellt f{\"u}r Studierende eine Schl{\"u}sselphase des terti{\"a}ren Ausbildungsabschnitts dar. Fachwissenschaftliches Wissen wird praxisfern vermittelt und die Studierenden k{\"o}nnen die Zusammenh{\"a}nge zwischen den Themenfeldern der verschiedenen Vorlesungen nicht erkennen. Zur Verbesserung der Situation wurde ein Workshop entwickelt, der die Verbindung der Programmierung und der Datenstrukturen vertieft. Dabei wird das Spiel Go-Moku1 als Android-App von den Studierenden selbst{\"a}ndig entwickelt. Die Kombination aus Software (Java, Android-SDK) und Hardware (Tablet-Computer) f{\"u}r ein kleines realistisches Softwareprojekt stellt f{\"u}r die Studierenden eine neue Erfahrung dar.},
  language  = {de}
}
@inproceedings{FroitzheimBergnerSchroederetal.2015,
  author    = {Froitzheim, Manuel and Bergner, Nadine and Schroeder, Ulrik and Hurtienne, Dominik and Spannagel, Christian and Roderus, Simon and Wienkop, Uwe and Leonhardt, Thiemo and Kwiecien, Alexandra and Schmetz, Arno and Bellgardt, Martin and Naumann, Uwe and Weßels, Doris and Metzger, Christiane and L{\"a}ngrich, Matthias and Schulze, J{\"o}rg and Jakoblew, Marcel and Keil, Reinhard and Winkelnkemper, Felix and Engbring, Dieter and Klar, Tilman-Mathies and Kujath, Bertold and Sch{\"u}tze, Christopher and Fietkau, Julian and Kindsm{\"u}ller, Martin Christof and G{\"o}ttel, Timo and Bergner, Nadine and Taraschewski, Christian and Vosseberg, Karin and Czernik, Sofie and Erb, Ulrike and Vielhaber, Michael and Schlierkamp, Kathrin and Thurner, Veronika and Br{\"o}ker, Kathrin},
  title     = {HDI 2014 - Gestalten von {\"U}berg{\"a}ngen},
  editor    = {Forbrig, Peter and Magenheim, Johannes},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-313-8},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-74920},
  pages     = {186},
  year      = {2015},
  abstract  = {Die Tagung HDI 2014 in Freiburg zur Hochschuldidaktik der Informatik HDI wurde erneut vom Fachbereich Informatik und Ausbildung / Didaktik der Informatik (IAD) in der Gesellschaft f{\"u}r Informatik e. V. (GI) organisiert. Sie dient den Lehrenden der Informatik in Studieng{\"a}ngen an Hochschulen als Forum der Information und des Austauschs {\"u}ber neue didaktische Ans{\"a}tze und bildungspolitische Themen im Bereich der Hochschulausbildung aus der fachlichen Perspektive der Informatik. Die HDI 2014 ist nun bereits die sechste Ausgabe der HDI. F{\"u}r sie wurde das spezielle Motto „Gestalten und Meistern von {\"U}berg{\"a}ngen" gew{\"a}hlt. Damit soll ein besonderes Augenmerk auf die {\"U}berg{\"a}nge von Schule zum Studium, vom Bachelor zum Master, vom Studium zur Promotion oder vom Studium zur Arbeitswelt gelegt werden.},
  language  = {de}
}
@article{Gebhardt2016,
  author    = {Gebhardt, Kai},
  title     = {Kooperative und kompetenzorientierte {\"U}bungen in der Softwaretechnik},
  series = {Commentarii informaticae didacticae (CID)},
  journal   = {Commentarii informaticae didacticae (CID)},
  number    = {10},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-376-3},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-94867},
  pages     = {95 -- 98},
  year      = {2016},
  abstract  = {Die Unterrichtsmethode Stationsarbeit kann verwendet werden, um Individualisierung und Differenzierung im Lernprozess zu erm{\"o}glichen. Dieser Beitrag schl{\"a}gt Aufgabenformate vor, die in einer Stationsarbeit {\"u}ber das Klassendiagramm aus der Unified Modeling Language verwendet werden k{\"o}nnen. Die Aufgabenformate wurden bereits mit Studierenden erprobt.},
  language  = {de}
}
@phdthesis{Gebser2011,
  author    = {Gebser, Martin},
  title     = {Proof theory and algorithms for answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-55425},
  school      = {Universit{\"a}t Potsdam},
  year      = {2011},
  abstract  = {Answer Set Programming (ASP) is an emerging paradigm for declarative programming, in which a computational problem is specified by a logic program such that particular models, called answer sets, match solutions. ASP faces a growing range of applications, demanding for high-performance tools able to solve complex problems. ASP integrates ideas from a variety of neighboring fields. In particular, automated techniques to search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, successfully applied in areas like, e.g., model checking and verification, are not yet established in ASP solving. We address these deficiencies by, for one, providing proof-theoretic frameworks that allow for characterizing, comparing, and analyzing approaches to answer set computation. For another, we devise modern ASP solving algorithms that integrate and extend state-of-the-art techniques for Boolean constraint solving. We thus contribute to the understanding of existing ASP solving approaches and their interconnections as well as to their enhancement by incorporating sophisticated search patterns. The central idea of our approach is to identify atomic as well as composite constituents of a propositional logic program with Boolean variables. This enables us to describe fundamental inference steps, and to selectively combine them in proof-theoretic characterizations of various ASP solving methods. In particular, we show that different concepts of case analyses applied by existing ASP solvers implicate mutual exponential separations regarding their best-case complexities. We also develop a generic proof-theoretic framework amenable to language extensions, and we point out that exponential separations can likewise be obtained due to case analyses on them. We further exploit fundamental inference steps to derive Boolean constraints characterizing answer sets. They enable the conception of ASP solving algorithms including search patterns of modern SAT solvers, while also allowing for direct technology transfers between the areas of ASP and SAT solving. Beyond the search for one answer set of a logic program, we address the enumeration of answer sets and their projections to a subvocabulary, respectively. The algorithms we develop enable repetition-free enumeration in polynomial space without being intrusive, i.e., they do not necessitate any modifications of computations before an answer set is found. Our approach to ASP solving is implemented in clasp, a state-of-the-art Boolean constraint solver that has successfully participated in recent solver competitions. Although we do here not address the implementation techniques of clasp or all of its features, we present the principles of its success in the context of ASP solving.},
  language  = {en}
}
@inproceedings{GebserHinrichsSchaubetal.2010,
  author    = {Gebser, Martin and Hinrichs, Henrik and Schaub, Torsten H. and Thiele, Sven},
  title     = {xpanda: a (simple) preprocessor for adding multi-valued propositions to ASP},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41466},
  year      = {2010},
  abstract  = {We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.},
  language  = {en}
}
@inproceedings{GeskeGoltz2010,
  author    = {Geske, Ulrich and Goltz, Hans-Joachim},
  title     = {Efficiency of difference-list programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41563},
  year      = {2010},
  abstract  = {The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG's, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.},
  language  = {en}
}
@inproceedings{GeskeWolf2010,
  author    = {Geske, Ulrich and Wolf, Armin},
  title     = {Preface},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-41401},
  year      = {2010},
  abstract  = {The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), W{\"u}rzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and W{\"u}rzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and logic programming (LP), including foundations of constraint/ logic programming. Some of the special topics are constraint solving and optimization, extensions of functional logic programming, deductive databases, data mining, nonmonotonic reasoning, , interaction of CP/LP with other formalisms like agents, XML, JAVA, program analysis, program transformation, program verification, meta programming, parallelism and concurrency, answer set programming, implementation and software techniques (e.g., types, modularity, design patterns), applications (e.g., in production, environment, education, internet), constraint/logic programming for semantic web systems and applications, reasoning on the semantic web, data modelling for the web, semistructured data, and web query languages.},
  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}
}
@phdthesis{Glander2012,
  author    = {Glander, Tassilo},
  title     = {Multi-scale representations of virtual 3D city models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64117},
  school      = {Universit{\"a}t Potsdam},
  year      = {2012},
  abstract  = {Virtual 3D city and landscape models are the main subject investigated in this thesis. They digitally represent urban space and have many applications in different domains, e.g., simulation, cadastral management, and city planning. Visualization is an elementary component of these applications. Photo-realistic visualization with an increasingly high degree of detail leads to fundamental problems for comprehensible visualization. A large number of highly detailed and textured objects within a virtual 3D city model may create visual noise and overload the users with information. Objects are subject to perspective foreshortening and may be occluded or not displayed in a meaningful way, as they are too small. In this thesis we present abstraction techniques that automatically process virtual 3D city and landscape models to derive abstracted representations. These have a reduced degree of detail, while essential characteristics are preserved. After introducing definitions for model, scale, and multi-scale representations, we discuss the fundamentals of map generalization as well as techniques for 3D generalization. The first presented technique is a cell-based generalization of virtual 3D city models. It creates abstract representations that have a highly reduced level of detail while maintaining essential structures, e.g., the infrastructure network, landmark buildings, and free spaces. The technique automatically partitions the input virtual 3D city model into cells based on the infrastructure network. The single building models contained in each cell are aggregated to abstracted cell blocks. Using weighted infrastructure elements, cell blocks can be computed on different hierarchical levels, storing the hierarchy relation between the cell blocks. Furthermore, we identify initial landmark buildings within a cell by comparing the properties of individual buildings with the aggregated properties of the cell. For each block, the identified landmark building models are subtracted using Boolean operations and integrated in a photo-realistic way. Finally, for the interactive 3D visualization we discuss the creation of the virtual 3D geometry and their appearance styling through colors, labeling, and transparency. We demonstrate the technique with example data sets. Additionally, we discuss applications of generalization lenses and transitions between abstract representations. The second technique is a real-time-rendering technique for geometric enhancement of landmark objects within a virtual 3D city model. Depending on the virtual camera distance, landmark objects are scaled to ensure their visibility within a specific distance interval while deforming their environment. First, in a preprocessing step a landmark hierarchy is computed, this is then used to derive distance intervals for the interactive rendering. At runtime, using the virtual camera distance, a scaling factor is computed and applied to each landmark. The scaling factor is interpolated smoothly at the interval boundaries using cubic B{\´e}zier splines. Non-landmark geometry that is near landmark objects is deformed with respect to a limited number of landmarks. We demonstrate the technique by applying it to a highly detailed virtual 3D city model and a generalized 3D city model. In addition we discuss an adaptation of the technique for non-linear projections and mobile devices. The third technique is a real-time rendering technique to create abstract 3D isocontour visualization of virtual 3D terrain models. The virtual 3D terrain model is visualized as a layered or stepped relief. The technique works without preprocessing and, as it is implemented using programmable graphics hardware, can be integrated with minimal changes into common terrain rendering techniques. Consequently, the computation is done in the rendering pipeline for each vertex, primitive, i.e., triangle, and fragment. For each vertex, the height is quantized to the nearest isovalue. For each triangle, the vertex configuration with respect to their isovalues is determined first. Using the configuration, the triangle is then subdivided. The subdivision forms a partial step geometry aligned with the triangle. For each fragment, the surface appearance is determined, e.g., depending on the surface texture, shading, and height-color-mapping. Flexible usage of the technique is demonstrated with applications from focus+context visualization, out-of-core terrain rendering, and information visualization. This thesis presents components for the creation of abstract representations of virtual 3D city and landscape models. Re-using visual language from cartography, the techniques enable users to build on their experience with maps when interpreting these representations. Simultaneously, characteristics of 3D geovirtual environments are taken into account by addressing and discussing, e.g., continuous scale, interaction, and perspective.},
  language  = {en}
}
@article{GrillenbergerRomeike2015,
  author    = {Grillenberger, Andreas and Romeike, Ralf},
  title     = {Teaching Data Management},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82648},
  pages     = {133 -- 150},
  year      = {2015},
  abstract  = {Data management is a central topic in computer science as well as in computer science education. Within the last years, this topic is changing tremendously, as its impact on daily life becomes increasingly visible. Nowadays, everyone not only needs to manage data of various kinds, but also continuously generates large amounts of data. In addition, Big Data and data analysis are intensively discussed in public dialogue because of their influences on society. For the understanding of such discussions and for being able to participate in them, fundamental knowledge on data management is necessary. Especially, being aware of the threats accompanying the ability to analyze large amounts of data in nearly real-time becomes increasingly important. This raises the question, which key competencies are necessary for daily dealings with data and data management. In this paper, we will first point out the importance of data management and of Big Data in daily life. On this basis, we will analyze which are the key competencies everyone needs concerning data management to be able to handle data in a proper way in daily life. Afterwards, we will discuss the impact of these changes in data management on computer science education and in particular database education.},
  language  = {en}
}
@phdthesis{Groene2004,
  author    = {Gr{\"o}ne, Bernhard},
  title     = {Konzeptionelle Patterns und ihre Darstellung},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-2302},
  school      = {Universit{\"a}t Potsdam},
  pages     = {vii ; 120},
  year      = {2004},
  abstract  = {Zur Beherrschung großer Systeme, insbesondere zur Weitergabe und Nutzung von Erfahrungswissen in der fr{\"u}hen Entwurfs- und Planungsphase, ben{\"o}tigt man Abstraktionen f{\"u}r deren Strukturen. Trennt man Software- von Systemstrukturen, kann man mit letzteren Systeme auf ausreichend hohem Abstraktionsgrad beschreiben.Software-Patterns dienen dazu, Erfahrungswissen bez{\"u}glich programmierter Systeme strukturiert weiterzugeben. Dabei wird unterschieden zwischen Idiomen, die sich auf L{\"o}sungen mit einer bestimmten Programmiersprache beziehen, Design-Patterns, die nur einen kleinen Teil des Programms betreffen und Architektur-Patterns, deren Einfluss {\"u}ber einen gr{\"o}ßeren Teil oder gar das komplette Programm reicht. Eine Untersuchung von existierenden Patterns zeigt, dass deren Konzepte n{\"u}tzlich zum Finden von Systemstrukturen sind. Die grafische Darstellung dieser Patterns ist dagegen oft auf Software-Strukturen eingeschr{\"a}nkt und ist f{\"u}r die Vermittlung von Erfahrungen zum Finden von Systemstrukturen meist nicht geeignet. Daher wird die Kategorie der konzeptionellen Patterns mit einer darauf abgestimmten grafischen Darstellungsform vorgeschlagen, bei denen Problem und L{\"o}sungsvorschlag im Bereich der Systemstrukturen liegen. Sie betreffen informationelle Systeme, sind aber nicht auf L{\"o}sungen mit Software beschr{\"a}nkt. Die Systemstrukturen werden grafisch dargestellt, wobei daf{\"u}r die Fundamental Modeling Concepts (FMC) verwendet werden, die zur Darstellung von Systemstrukturen entwickelt wurden.},
  language  = {de}
}
@article{Goettel2013,
  author    = {G{\"o}ttel, Timo},
  title     = {Schnupperveranstaltungen Informatik in der Hochschullandschaft},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64860},
  pages     = {45 -- 55},
  year      = {2013},
  abstract  = {Die vorliegende Arbeit er{\"o}rtert die Frage, wie Nachwuchs f{\"u}r das Informatikstudium nachhaltig gesichert werden kann. Dazu werden Befragungen unter Sch{\"u}lerinnen und Sch{\"u}lern (13-16 Jahre), sowie aktuelle Informatik-Schnupperangebote f{\"u}r Sch{\"u}lerinnen und Sch{\"u}ler an deutschsprachigen Hochschulen vorgestellt und untersucht. Diese Gegen{\"u}berstellung zeigt deutlich, dass die Angebote nur bedingt eine breite Zielgruppe ansprechen und dass weitere Formate und Inhalte notwendig sind, um Sch{\"u}lerinnen und Sch{\"u}ler fr{\"u}hzeitig und in voller Breite zu erreichen und f{\"u}r das Informatikstudium zu begeistern. Daraus wird abgeleitet, dass Missverst{\"a}ndnisse und Probleme mit der Informatik im Schulkontext aufgegriffen werden m{\"u}ssen. Das vorgestellte Programm Schulbotschafter Informatik stellt einen m{\"o}glichen Weg dar, um dies zu erreichen und {\"u}bliche Schnupperangebote zu erg{\"a}nzen.},
  language  = {de}
}
@article{GoetzBrinda2013,
  author    = {G{\"o}tz, Christian and Brinda, Torsten},
  title     = {Sind soziale Netzwerke geeignet, um darin f{\"u}r Informatikstudieng{\"a}nge zu werben?},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-65017},
  pages     = {137 -- 142},
  year      = {2013},
  abstract  = {Durch den bundesweiten R{\"u}ckgang der Sch{\"u}lerzahlen und einer steigenden Zahl von Bildungsangeboten geraten Universit{\"a}ten und Hochschulen in den n{\"a}chsten Jahren weiter in eine Wettbewerbssituation, weshalb sie effektive Marketingmaßnahmen entwickeln m{\"u}ssen, um Sch{\"u}lerinnen und Sch{\"u}ler m{\"o}glichst fr{\"u}hzeitig f{\"u}r das jeweilige Angebot (z. B. Informatik- und informatiknahe Studieng{\"a}nge) zu interessieren. Ein Medium, {\"u}ber das sich potenziell sehr viele Jugendliche erreichen lassen, sind dabei soziale Netzwerke. Diese Arbeit pr{\"a}sentiert Ergebnisse einer Studie unter Informatikstudienanf{\"a}ngerinnen und -anf{\"a}ngern zum Nutzungsverhalten sozialer Netzwerke und zieht Schlussfolgerungen zu deren Eignung als Werbe- und Informationskanal f{\"u}r die Zielgruppe der Informatikinteressierten.},
  language  = {de}
}
@article{HaferLudwigSchumann2010,
  author    = {Hafer, J{\"o}rg and Ludwig, Joachim and Schumann, Marlen},
  title     = {Fallstudien in medialen R{\"a}umen},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {4},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64431},
  pages     = {93 -- 98},
  year      = {2010},
  abstract  = {Ziel dieses Beitrages ist es, das didaktische Konzept Fallstudien und seine lerntheoretisch-didaktische Begr{\"u}ndung vorzustellen. Es wird die These begr{\"u}ndet, dass mediale R{\"a}ume f{\"u}r die Bearbeitung von Fallstudien lernunterst{\"u}tzend wirken und sich in besonderer Weise f{\"u}r Prozesse der Lernberatung und Lernbegleitung in der Hochschule eignen. Diese These wird entlang dem lerntheoretischen Konzept der Bedeutungsr{\"a}ume von Studierenden in Verbindung mit den Spezifika medialer R{\"a}ume entfaltet. F{\"u}r den daraus entstandenen E-Learning-Ansatz Online-Fallstudien kann hier lediglich ein Ausblick gegeben werden.},
  language  = {de}
}
@phdthesis{Haider2013,
  author    = {Haider, Peter},
  title     = {Prediction with Mixture Models},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-69617},
  school      = {Universit{\"a}t Potsdam},
  year      = {2013},
  abstract  = {Learning a model for the relationship between the attributes and the annotated labels of data examples serves two purposes. Firstly, it enables the prediction of the label for examples without annotation. Secondly, the parameters of the model can provide useful insights into the structure of the data. If the data has an inherent partitioned structure, it is natural to mirror this structure in the model. Such mixture models predict by combining the individual predictions generated by the mixture components which correspond to the partitions in the data. Often the partitioned structure is latent, and has to be inferred when learning the mixture model. Directly evaluating the accuracy of the inferred partition structure is, in many cases, impossible because the ground truth cannot be obtained for comparison. However it can be assessed indirectly by measuring the prediction accuracy of the mixture model that arises from it. This thesis addresses the interplay between the improvement of predictive accuracy by uncovering latent cluster structure in data, and further addresses the validation of the estimated structure by measuring the accuracy of the resulting predictive model. In the application of filtering unsolicited emails, the emails in the training set are latently clustered into advertisement campaigns. Uncovering this latent structure allows filtering of future emails with very low false positive rates. In order to model the cluster structure, a Bayesian clustering model for dependent binary features is developed in this thesis. Knowing the clustering of emails into campaigns can also aid in uncovering which emails have been sent on behalf of the same network of captured hosts, so-called botnets. This association of emails to networks is another layer of latent clustering. Uncovering this latent structure allows service providers to further increase the accuracy of email filtering and to effectively defend against distributed denial-of-service attacks. To this end, a discriminative clustering model is derived in this thesis that is based on the graph of observed emails. The partitionings inferred using this model are evaluated through their capacity to predict the campaigns of new emails. Furthermore, when classifying the content of emails, statistical information about the sending server can be valuable. Learning a model that is able to make use of it requires training data that includes server statistics. In order to also use training data where the server statistics are missing, a model that is a mixture over potentially all substitutions thereof is developed. Another application is to predict the navigation behavior of the users of a website. Here, there is no a priori partitioning of the users into clusters, but to understand different usage scenarios and design different layouts for them, imposing a partitioning is necessary. The presented approach simultaneously optimizes the discriminative as well as the predictive power of the clusters. Each model is evaluated on real-world data and compared to baseline methods. The results show that explicitly modeling the assumptions about the latent cluster structure leads to improved predictions compared to the baselines. It is beneficial to incorporate a small number of hyperparameters that can be tuned to yield the best predictions in cases where the prediction accuracy can not be optimized directly.},
  language  = {en}
}
@phdthesis{Harmeling2004,
  author    = {Harmeling, Stefan},
  title     = {Independent component analysis and beyond},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-0001540},
  school      = {Universit{\"a}t Potsdam},
  year      = {2004},
  abstract  = {'Independent component analysis' (ICA) ist ein Werkzeug der statistischen Datenanalyse und Signalverarbeitung, welches multivariate Signale in ihre Quellkomponenten zerlegen kann. Obwohl das klassische ICA Modell sehr n{\"u}tzlich ist, gibt es viele Anwendungen, die Erweiterungen von ICA erfordern. In dieser Dissertation pr{\"a}sentieren wir neue Verfahren, die die Funktionalit{\"a}t von ICA erweitern: (1) Zuverl{\"a}ssigkeitsanalyse und Gruppierung von unabh{\"a}ngigen Komponenten durch Hinzuf{\"u}gen von Rauschen, (2) robuste und {\"u}berbestimmte ('over-complete') ICA durch Ausreissererkennung, und (3) nichtlineare ICA mit Kernmethoden.},
  language  = {en}
}
@article{Haugsbakken2015,
  author    = {Haugsbakken, Halvdan},
  title     = {The Student Learning Ecology},
  series = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  journal   = {KEYCIT 2014 - Key Competencies in Informatics and ICT},
  number    = {7},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-82659},
  pages     = {151 -- 169},
  year      = {2015},
  abstract  = {Educational research on social media has showed that students use it for socialisation, personal communication, and informal learning. Recent studies have argued that students to some degree use social media to carry out formal schoolwork. This article gives an explorative account on how a small sample of Norwegian high school students use social media to self-organise formal schoolwork. This user pattern can be called a "student learning ecology", which is a user perspective on how participating students gain access to learning resources.},
  language  = {en}
}
@phdthesis{Hecher2021,
  author    = {Hecher, Markus},
  title     = {Advanced tools and methods for treewidth-based problem solving},
  doi       = {10.25932/publishup-51251},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-512519},
  school      = {Universit{\"a}t Potsdam},
  pages     = {xv, 184},
  year      = {2021},
  abstract  = {In the last decades, there was a notable progress in solving the well-known Boolean satisfiability (Sat) problem, which can be witnessed by powerful Sat solvers. One of the reasons why these solvers are so fast are structural properties of instances that are utilized by the solver's interna. This thesis deals with the well-studied structural property treewidth, which measures the closeness of an instance to being a tree. In fact, there are many problems parameterized by treewidth that are solvable in polynomial time in the instance size when parameterized by treewidth. In this work, we study advanced treewidth-based methods and tools for problems in knowledge representation and reasoning (KR). Thereby, we provide means to establish precise runtime results (upper bounds) for canonical problems relevant to KR. Then, we present a new type of problem reduction, which we call decomposition-guided (DG) that allows us to precisely monitor the treewidth when reducing from one problem to another problem. This new reduction type will be the basis for a long-open lower bound result for quantified Boolean formulas and allows us to design a new methodology for establishing runtime lower bounds for problems parameterized by treewidth. Finally, despite these lower bounds, we provide an efficient implementation of algorithms that adhere to treewidth. Our approach finds suitable abstractions of instances, which are subsequently refined in a recursive fashion, and it uses Sat solvers for solving subproblems. It turns out that our resulting solver is quite competitive for two canonical counting problems related to Sat.},
  language  = {en}
}
@article{HeinischRomeike2013,
  author    = {Heinisch, Isabelle and Romeike, Ralf},
  title     = {Outcome-orientierte Neuausrichtung in der Hochschullehre Informatik},
  series = {Commentarii informaticae didacticae : (CID)},
  journal   = {Commentarii informaticae didacticae : (CID)},
  number    = {5},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  issn      = {1868-0844},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-64831},
  pages     = {9 -- 20},
  year      = {2013},
  abstract  = {Die Orientierung am Outcome eines Lernprozesses stellt einen wichtigen Pfeiler einer kompetenzorientierten Informatiklehre dar. Im Beitrag werden Konzeption und Erfahrungen eines Projekts zur outcome-orientierten Neuausrichtung der Informatiklehre unter Ber{\"u}cksichtigung der Theorie des Constructive Alignment beschrieben. Nach der theoretischen Fundierung der Kompetenzproblematik wird anhand eines Formulierungsmodells ein Prozess zur Erarbeitung beobachtbarer Lernergebnisse dargestellt. Die Diskussion der Projektziele und Erfahrungen in der Umsetzung und Evaluierung unterstreichen die Chancen und Herausforderungen f{\"u}r eine Steigerung der Studienqualit{\"a}t.},
  language  = {de}
}
@inproceedings{HeinischRomeikeKnobelsdorfetal.2013,
  author    = {Heinisch, Isabelle and Romeike, Ralf and Knobelsdorf, Maria and Kreitz, Christoph and Nyl{\´e}n, Aletta and D{\"o}rge, Christina and G{\"o}ttel, Timo and Holz, Jan and Bergner, Nadine and Schroeder, Ulrik and Metzger, Christiane and Haag, Johann and Abke, J{\"o}rg and Schwirtlich, Vincent and Sedelmaier, Yvonne and M{\"u}ller, Dorothee and Frommer, Andreas and Humbert, Ludger and Berges, Marc and M{\"u}hling, Andreas and Hubwieser, Peter and Steuer, Horst and Engbring, Dieter and Selke, Harald and Drews, Paul and Schirmer, Ingrid and Morisse, Marcel and Sagawe, Arno and Rolf, Arno and Friedemann, Stefan and Gr{\"o}ger, Stefan and Schumann, Matthias and Klinger, Melanie and Polutina, Olena and Bibel, Ariane and G{\"o}tz, Christian and Brinda, Torsten and Apel, Rebecca and Berg, Tobias and Bergner, Nadine and Chatti, Mohamed Amine and Leicht-Scholten, Carmen and Schroeder, Ulrik and Al-Saffar, Loay Talib and Petre, Marian and Schirmer, Ingrid and Rick, Detlef},
  title     = {HDI 2012 - Informatik f{\"u}r eine nachhaltige Zukunft : 5. Fachtagung Hochschuldidaktik der Informatik ; 06.-07. November 2012, Universit{\"a}t Hamburg},
  editor    = {Forbrig, Peter and Rick, Detlef and Schmolitzky, Axel},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  isbn      = {978-3-86956-220-9},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-62891},
  pages     = {169},
  year      = {2013},
  abstract  = {Die Tagungsreihe zur Hochschuldidaktik der Informatik HDI wird vom Fachbereich Informatik und Ausbildung / Didaktik der Informatik (IAD) in der Gesellschaft f{\"u}r Informatik e. V. (GI) organisiert. Sie dient den Lehrenden der Informatik in Studieng{\"a}ngen an Hochschulen als Forum der Information und des Austauschs {\"u}ber neue didaktische Ans{\"a}tze und bildungspolitische Themen im Bereich der Hochschulausbildung aus der fachlichen Perspektive der Informatik. Diese f{\"u}nfte HDI 2012 wurde an der Universit{\"a}t Hamburg organisiert. F{\"u}r sie wurde das spezielle Motto „Informatik f{\"u}r eine nachhaltige Zukunft" gew{\"a}hlt, um insbesondere Fragen der Bildungsrelevanz informatischer Inhalte, der Kompetenzen f{\"u}r Studierende informatisch gepr{\"a}gter Studieng{\"a}nge und der Rolle der Informatik in der Hochschulentwicklung zu diskutieren.},
  language  = {de}
}
@article{HerbstreitMaekerSzalai2018,
  author    = {Herbstreit, Stephanie and M{\"a}ker, Daniela and Szalai, Cynthia},
  title     = {Einsatz einer mobilen Lern-App - Ein Werkzeug zur Verbesserung von klinisch-praktischem Unterricht},
  series = {E-Learning Symposium 2018},
  journal   = {E-Learning Symposium 2018},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  doi       = {10.25932/publishup-42194},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-421942},
  pages     = {53 -- 63},
  year      = {2018},
  abstract  = {Der Unterricht am Krankenbett ist im Medizinstudium eine wertvolle M{\"o}glichkeit klinisch-praktische Fertigkeiten zu erlernen. Eine optimale Vorbereitung der Studierenden ist dabei Voraussetzung. Eine mobile Lern-App wurde entwickelt, die den Studierenden, neben Lernzielen, Kursinhalte und Anleitungen zu Untersuchungstechniken bietet, um die Vorbereitung auf einen klinisch-praktischen Kurs zu f{\"o}rdern und Kurzinformationen auch w{\"a}hrend des Kurses zur Verf{\"u}gung zu stellen. 175 Studierende hatten die M{\"o}glichkeit die App parallel zu einem klinischen Untersuchungs-Kurs im Semester zu nutzen. Im Anschluss beantworteten die Studierenden einen Fragebogen zur N{\"u}tzlichkeit und Vielseitigkeit der App und zur Zufriedenheit mit der App unter Verwendung eine 5-Punkt-Likert-Skala und zwei offenen Fragen. In diesem Beitrag wird das Kurskonzept zusammen mit der Lern-App, die Ergebnisse aus dem Fragebogen und unsere Schlussfolgerungen daraus vorgestellt. Studierende bewerteten die App grunds{\"a}tzlich als hilfreich. Sie sollte dabei gr{\"u}ndlich eingef{\"u}hrt werden. Patienten sollten {\"u}ber die Nutzung von Smartphones im Studentenunterricht zu Lernzwecken informiert werden.},
  language  = {de}
}
@article{HilseLucke2013,
  author    = {Hilse, Michael and Lucke, Ulrike},
  title     = {eLiS - E-Learning in Studienbereichen},
  series = {E-Learning Symposium 2012 : Aktuelle Anwendungen, innovative Prozesse und neueste Ergebnisse aus der E-Learning-Praxis ; Potsdam, 17. November 2012},
  journal   = {E-Learning Symposium 2012 : Aktuelle Anwendungen, innovative Prozesse und neueste Ergebnisse aus der E-Learning-Praxis ; Potsdam, 17. November 2012},
  publisher = {Universit{\"a}tsverlag Potsdam},
  address   = {Potsdam},
  doi       = {10.25932/publishup-44227},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-442275},
  pages     = {73 -- 75},
  year      = {2013},
  abstract  = {Deutsche Universit{\"a}ten erweitern ihre E-Learning-Angebote als Service f{\"u}r die Studierenden und Lehrenden. Diese sind je nach Fakult{\"a}t unterschiedlich ausgepr{\"a}gt. Dieser Artikel zeigt, wie durch technische Erweiterung der Infrastruktur, einer Anpassung der Organisationsstruktur und einer gezielten Inhaltsentwicklung eine durchg{\"a}ngige und personalisierbare Lehr- und Lernumgebung (Personal Learning Environment, PLE) geschaffen und damit die Akzeptanz bei den Lehrenden und Studierenden f{\"u}r E-Learning erh{\"o}ht werden kann. Aus der vorausgehenden, systematischen Anforderungsanalyse k{\"o}nnen Kennzahlen f{\"u}r die Qualit{\"a}tssicherung von E-Learning-Angeboten abgeleitet werden.},
  language  = {de}
}
@phdthesis{Hitz2021,
  author    = {Hitz, Michael},
  title     = {Modellierung und Generierung kombinierbarer Benutzungsschnittstellenvarianten und deren gemeinschaftliche Nutzung in Dienst-Ökosystemen},
  doi       = {10.25932/publishup-50022},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-500224},
  school      = {Universit{\"a}t Potsdam},
  pages     = {viii, 313},
  year      = {2021},
  abstract  = {Digitalisierung erm{\"o}glicht es uns, mit Partnern (z.B. Unternehmen, Institutionen) in einer IT-unterst{\"u}tzten Umgebung zu interagieren und T{\"a}tigkeiten auszuf{\"u}hren, die vormals manuell erledigt wurden. Ein Ziel der Digitalisierung ist dabei, Dienstleistungen unterschiedlicher fachlicher Dom{\"a}nen zu Prozessen zu kombinieren und vielen Nutzergruppen bedarfsgerecht zug{\"a}nglich zu machen. Hierzu stellen Anbieter technische Dienste bereit, die in unterschiedliche Anwendungen integriert werden k{\"o}nnen. Die Digitalisierung stellt die Anwendungsentwicklung vor neue Herausforderungen. Ein Aspekt ist die bedarfsgerechte Anbindung von Nutzern an Dienste. Zur Interaktion menschlicher Nutzer mit den Diensten werden Benutzungsschnittstellen ben{\"o}tigt, die auf deren Bed{\"u}rfnisse zugeschnitten sind. Hierzu werden Varianten f{\"u}r spezifische Nutzergruppen (fachliche Varianten) und variierende Umgebungen (technische Varianten) ben{\"o}tigt. Zunehmend m{\"u}ssen diese mit Diensten anderer Anbieter kombiniert werden k{\"o}nnen, um dom{\"a}nen{\"u}bergreifend Prozesse zu Anwendungen mit einem erh{\"o}hten Mehrwert f{\"u}r den Endnutzer zu verkn{\"u}pfen (z.B. eine Flugbuchung mit einer optionalen Reiseversicherung). Die Vielf{\"a}ltigkeit der Varianten l{\"a}sst die Erstellung von Benutzungsschnittstellen komplex und die Ergebnisse sehr individuell erscheinen. Daher werden die Varianten in der Praxis vorwiegend manuell erstellt. Dies f{\"u}hrt zur parallelen Entwicklung einer Vielzahl sehr {\"a}hnlicher Anwendungen, die nur geringes Potential zur Wiederverwendung besitzen. Die Folge sind hohe Aufw{\"a}nde bei Erstellung und Wartung. Dadurch wird h{\"a}ufig auf die Unterst{\"u}tzung kleiner Nutzerkreise mit speziellen Anforderungen verzichtet (z.B. Menschen mit physischen Einschr{\"a}nkungen), sodass diese weiterhin von der Digitalisierung ausgeschlossen bleiben. Die Arbeit stellt eine konsistente L{\"o}sung f{\"u}r diese neuen Herausforderungen mit den Mitteln der modellgetriebenen Entwicklung vor. Sie präsentiert einen Ansatz zur Modellierung von Benutzungsschnittstellen, Varianten und Kompositionen und deren automatischer Generierung f{\"u}r digitale Dienste in einem verteilten Umfeld. Die Arbeit schafft eine L{\"o}sung zur Wiederverwendung und gemeinschaftlichen Nutzung von Benutzungsschnittstellen {\"u}ber Anbietergrenzen hinweg. Sie f{\"u}hrt zu einer Infrastruktur, in der eine Vielzahl von Anbietern ihre Expertise in gemeinschaftliche Anwendungen einbringen k{\"o}nnen. Die Beitr{\"a}ge bestehen im Einzelnen in Konzepten und Metamodellen zur Modellierung von Benutzungsschnittstellen, Varianten und Kompositionen sowie einem Verfahren zu deren vollst{\"a}ndig automatisierten Transformation in funktionale Benutzungsschnittstellen. Zur Umsetzung der gemeinschaftlichen Nutzbarkeit werden diese erg{\"a}nzt um eine universelle Repr{\"a}sentation der Modelle, einer Methodik zur Anbindung unterschiedlicher Dienst-Anbieter sowie einer Architektur zur verteilten Nutzung der Artefakte und Verfahren in einer dienstorientierten Umgebung. Der Ansatz bietet die Chance, unterschiedlichste Menschen bedarfsgerecht an der Digitalisierung teilhaben zu lassen. Damit setzt die Arbeit Impulse f{\"u}r zuk{\"u}nftige Methoden zur Anwendungserstellung in einem zunehmend vielf{\"a}ltigen Umfeld.},
  language  = {de}
}