Dokument-ID Dokumenttyp Verfasser/Autoren Herausgeber Haupttitel Abstract Auflage Verlagsort Verlag Erscheinungsjahr Seitenzahl Schriftenreihe Titel Schriftenreihe Bandzahl ISBN Quelle der Hochschulschrift Konferenzname Quelle:Titel Quelle:Jahrgang Quelle:Heftnummer Quelle:Erste Seite Quelle:Letzte Seite URN DOI Abteilungen OPUS4-53951 misc Frank, Mario; Kreitz, Christoph A theorem prover for scientific and educational purposes We present a prototype of an integrated reasoning environment for educational purposes. The presented tool is a fragment of a proof assistant and automated theorem prover. We describe the existing and planned functionality of the theorem prover and especially the functionality of the educational fragment. This currently supports working with terms of the untyped lambda calculus and addresses both undergraduate students and researchers. We show how the tool can be used to support the students' understanding of functional programming and discuss general problems related to the process of building theorem proving software that aims at supporting both research and education. Sydney Open Publishing Association 2018 11 Electronic proceedings in theoretical computer science 267 59 69 10.4204/EPTCS.267.4 Institut für Informatik und Computational Science OPUS4-61012 misc Xenikoudakis, Georgios; Ahmed, Mayeesha; Harris, Jacob Colt; Wadleigh, Rachel; Paijmans, Johanna L. A.; Hartmann, Stefanie; Barlow, Axel; Lerner, Heather; Hofreiter, Michael Ancient DNA reveals twenty million years of aquatic life in beavers Xenikoudakis et al. report a partial mitochondrial genome of the extinct giant beaver Castoroides and estimate the origin of aquatic behavior in beavers to approximately 20 million years. This time estimate coincides with the extinction of terrestrial beavers and raises the question whether the two events had a common cause. London Current Biology Ltd. 2020 2 Current biology : CB 30 3 R110 R111 10.1016/j.cub.2019.12.041 Institut für Informatik und Computational Science OPUS4-53927 misc Schäpers, Björn; Niemueller, Tim; Lakemeyer, Gerhard; Gebser, Martin; Schaub, Torsten H. ASP-Based Time-Bounded Planning for Logistics Robots Manufacturing industries are undergoing a major paradigm shift towards more autonomy. Automated planning and scheduling then becomes a necessity. The Planning and Execution Competition for Logistics Robots in Simulation held at ICAPS is based on this scenario and provides an interesting testbed. However, the posed problem is challenging as also demonstrated by the somewhat weak results in 2017. The domain requires temporal reasoning and dealing with uncertainty. We propose a novel planning system based on Answer Set Programming and the Clingo solver to tackle these problems and incentivize robot cooperation. Our results show a significant performance improvement, both, in terms of lowering computational requirements and better game metrics. Palo Alto ASSOC Association for the Advancement of Artificial Intelligence 2018 9 Twenty-Eighth International Conference on Automated Planning and Scheduling (ICAPS 2018) 509 517 Institut für Informatik und Computational Science OPUS4-53920 misc Klieme, Eric; Tietz, Christian; Meinel, Christoph Beware of SMOMBIES Several research evaluated the user's style of walking for the verification of a claimed identity and showed high authentication accuracies in many settings. In this paper we present a system that successfully verifies a user's identity based on many real world smartphone placements and yet not regarded interactions while walking. Our contribution is the distinction of all considered activities into three distinct subsets and a specific one-class Support Vector Machine per subset. Using sensor data of 30 participants collected in a semi-supervised study approach, we prove that unsupervised verification is possible with very low false-acceptance and false-rejection rates. We furthermore show that these subsets can be distinguished with a high accuracy and demonstrate that this system can be deployed on off-the-shelf smartphones. New York IEEE 2018 10 The 17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom 2018)/the 12th IEEE International Conference on Big Data Science and Engineering (IEEE BigDataSE 2018) 978-1-5386-4387-7 651 660 10.1109/TrustCom/BigDataSE.2018.00096 Institut für Informatik und Computational Science OPUS4-56286 misc Fabian, Benjamin; Baumann, Annika; Ehlert, Mathias; Ververis, Vasilis; Ermakova, Tatiana CORIA - Analyzing internet connectivity risks using network graphs The Internet can be considered as the most important infrastructure for modern society and businesses. A loss of Internet connectivity has strong negative financial impacts for businesses and economies. Therefore, assessing Internet connectivity, in particular beyond their own premises and area of direct control, is of growing importance in the face of potential failures, accidents, and malicious attacks. This paper presents CORIA, a software framework for an easy analysis of connectivity risks based on large network graphs. It provides researchers, risk analysts, network managers and security consultants with a tool to assess an organization's connectivity and paths options through the Internet backbone, including a user-friendly and insightful visual representation of results. CORIA is flexibly extensible in terms of novel data sets, graph metrics, and risk scores that enable further use cases. The performance of CORIA is evaluated by several experiments on the Internet graph and further randomly generated networks. Piscataway IEEE 2017 6 2017 IEEE International Conference on Communications (ICC) 978-1-4673-8999-0 10.1109/ICC.2017.7996828 Institut für Informatik und Computational Science OPUS4-50623 misc Fichte, Johannes Klaus; Hecher, Markus; Meier, Arne Counting Complexity for Reasoning in Abstract Argumentation In this paper, we consider counting and projected model counting of extensions in abstract argumentation for various semantics. When asking for projected counts we are interested in counting the number of extensions of a given argumentation framework while multiple extensions that are identical when restricted to the projected arguments count as only one projected extension. We establish classical complexity results and parameterized complexity results when the problems are parameterized by treewidth of the undirected argumentation graph. To obtain upper bounds for counting projected extensions, we introduce novel algorithms that exploit small treewidth of the undirected argumentation graph of the input instance by dynamic programming (DP). Our algorithms run in time double or triple exponential in the treewidth depending on the considered semantics. Finally, we take the exponential time hypothesis (ETH) into account and establish lower bounds of bounded treewidth algorithms for counting extensions and projected extension. Palo Alto AAAI Press 2019 8 The Thirty-Third AAAI Conference on Artificial Intelligence, the Thirty-First Innovative Applications of Artificial Intelligence Conference, the Ninth AAAI Symposium on Educational Advances in Artificial Intelligence 978-1-57735-809-1 2827 2834 Institut für Informatik und Computational Science OPUS4-33848 misc Plattner, Hasso; Meinel, Christoph; Leifer, Larry Design thinking : understand - improve - apply Berlin, Heidelberg Springer-Verlag Berlin Heidelberg 2011 236 S. 978-3-642-13756-3 Institut für Informatik und Computational Science OPUS4-50686 misc Alhosseini Almodarresi Yasin, Seyed Ali; Bin Tareaf, Raad; Najafi, Pejman; Meinel, Christoph Detect me if you can Spam Bots have become a threat to online social networks with their malicious behavior, posting misinformation messages and influencing online platforms to fulfill their motives. As spam bots have become more advanced over time, creating algorithms to identify bots remains an open challenge. Learning low-dimensional embeddings for nodes in graph structured data has proven to be useful in various domains. In this paper, we propose a model based on graph convolutional neural networks (GCNN) for spam bot detection. Our hypothesis is that to better detect spam bots, in addition to defining a features set, the social graph must also be taken into consideration. GCNNs are able to leverage both the features of a node and aggregate the features of a node's neighborhood. We compare our approach, with two methods that work solely on a features set and on the structure of the graph. To our knowledge, this work is the first attempt of using graph convolutional neural networks in spam bot detection. New York Association for Computing Machinery 2019 6 Companion Proceedings of The 2019 World Wide Web Conference 978-1-4503-6675-5 148 153 10.1145/3308560.3316504 Institut für Informatik und Computational Science OPUS4-11070 misc Marques de Carvalho, Jackson W.; Jürgensen, Helmut Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007 Potsdam Univ. 2007 5 S. Preprint / Universität Potsdam, Institut für Informatik 2007, 1 Institut für Informatik und Computational Science OPUS4-55818 misc Giese, Holger Kouchnarenko, Olga; Khosravi, Ramtin Formal models and analysis for self-adaptive cyber-physical systems In this extended abstract, we will analyze the current challenges for the envisioned Self-Adaptive CPS. In addition, we will outline our results to approach these challenges with SMARTSOS [10] a generic approach based on extensions of graph transformation systems employing open and adaptive collaborations and models at runtime for trustworthy self-adaptation, self-organization, and evolution of the individual systems and the system-of-systems level taking the independent development, operation, management, and evolution of these systems into account. Cham Springer 2017 7 Lecture notes in computer science 10231 978-3-319-57666-4 3 9 10.1007/978-3-319-57666-4_1 Institut für Informatik und Computational Science OPUS4-55804 misc Saint-Dizier, Patrick; Stede, Manfred Foundations of the language of argumentation Amsterdam IOS Press 2017 3 Argument & computation 8 2 Special issue 91 93 10.3233/AAC-170018 Institut für Informatik und Computational Science OPUS4-56735 misc Mühlbauer, Felix; Schröder, Lukas; Skoncej, Patryk; Schölzel, Mario Handling manufacturing and aging faults with software-based techniques in tiny embedded systems Non-volatile memory area occupies a large portion of the area of a chip in an embedded system. Such memories are prone to manufacturing faults, retention faults, and aging faults. The paper presents a single software based technique that allows for handling all of these fault types in tiny embedded systems without the need for hardware support. This is beneficial for low-cost embedded systems with simple memory architectures. A software infrastructure and a flow are presented that demonstrate how the presented technique is used in general for fault handling right after manufacturing and in-the-field. Moreover, a full implementation is presented for a MSP430 microcontroller, along with a discussion of the performance, overhead, and reliability impacts. New York IEEE 2017 6 18th IEEE Latin American Test Symposium (LATS 2017) 978-1-5386-0415-1 10.1109/LATW.2017.7906756 Institut für Informatik und Computational Science OPUS4-48924 misc Przybylla, Mareen Interactive objects in physical computing and their role in the learning process The target article discusses the question of how educational makerspaces can become places supportive of knowledge construction. This question is too often neglected by people who run makerspaces, as they mostly explain how to use different tools and focus on the creation of a product. In makerspaces, often pupils also engage in physical computing activities and thus in the creation of interactive artifacts containing embedded systems, such as smart shoes or wristbands, plant monitoring systems or drink mixing machines. This offers the opportunity to reflect on teaching physical computing in computer science education, where similarly often the creation of the product is so strongly focused upon that the reflection of the learning process is pushed into the background. Bussels Vrije Univ. 2019 3 Constructivist foundations 14 3 264 266 Institut für Informatik und Computational Science OPUS4-52393 misc Brewka, Gerhard; Schaub, Torsten H.; Woltran, Stefan Interview with Gerhard Brewka This interview with Gerhard Brewka was conducted by correspondance in May 2018. The question set was compiled by Torsten Schaub and Stefan Woltran. Heidelberg Springer 2018 3 Künstliche Intelligenz 32 2-3 219 221 10.1007/s13218-018-0549-5 Institut für Informatik und Computational Science OPUS4-52392 misc Lifschitz, Vladimir; Schaub, Torsten H.; Woltran, Stefan Interview with Vladimir Lifschitz This interview with Vladimir Lifschitz was conducted by Torsten Schaub at the University of Texas at Austin in August 2017. The question set was compiled by Torsten Schaub and Stefan Woltran. Heidelberg Springer 2018 6 Künstliche Intelligenz 32 2-3 213 218 10.1007/s13218-018-0552-x Institut für Informatik und Computational Science OPUS4-53976 misc Bosser, Anne-Gwenn; Cabalar, Pedro; Dieguez, Martin; Schaub, Torsten H. Introducing temporal stable models for linear dynamic logic We propose a new temporal extension of the logic of Here-and-There (HT) and its equilibria obtained by combining it with dynamic logic over (linear) traces. Unlike previous temporal extensions of HT based on linear temporal logic, the dynamic logic features allow us to reason about the composition of actions. For instance, this can be used to exercise fine grained control when planning in robotics, as exemplified by GOLOG. In this paper, we lay the foundations of our approach, and refer to it as Linear Dynamic Equilibrium Logic, or simply DEL. We start by developing the formal framework of DEL and provide relevant characteristic results. Among them, we elaborate upon the relationships to traditional linear dynamic logic and previous temporal extensions of HT. Palo Alto ASSOC Association for the Advancement of Artificial Intelligence 2018 10 16th International Conference on Principles of Knowledge Representation and Reasoning 12 21 Institut für Informatik und Computational Science OPUS4-54078 misc Böhne, Sebastian; Kreitz, Christoph Learning how to prove We have developed an alternative approach to teaching computer science students how to prove. First, students are taught how to prove theorems with the Coq proof assistant. In a second, more difficult, step students will transfer their acquired skills to the area of textbook proofs. In this article we present a realisation of the second step. Proofs in Coq have a high degree of formality while textbook proofs have only a medium one. Therefore our key idea is to reduce the degree of formality from the level of Coq to textbook proofs in several small steps. For that purpose we introduce three proof styles between Coq and textbook proofs, called line by line comments, weakened line by line comments, and structure faithful proofs. While this article is mostly conceptional we also report on experiences with putting our approach into practise. Sydney Open Publishing Association 2018 18 Electronic proceedings in theoretical computer science 267 1 18 10.4204/EPTCS.267.1 Institut für Informatik und Computational Science OPUS4-50588 misc Cabalar, Pedro; Fandinno, Jorge; Schaub, Torsten H.; Schellhorn, Sebastian Lower Bound Founded Logic of Here-and-There A distinguishing feature of Answer Set Programming is that all atoms belonging to a stable model must be founded. That is, an atom must not only be true but provably true. This can be made precise by means of the constructive logic of Here-and-There, whose equilibrium models correspond to stable models. One way of looking at foundedness is to regard Boolean truth values as ordered by letting true be greater than false. Then, each Boolean variable takes the smallest truth value that can be proven for it. This idea was generalized by Aziz to ordered domains and applied to constraint satisfaction problems. As before, the idea is that a, say integer, variable gets only assigned to the smallest integer that can be justified. In this paper, we present a logical reconstruction of Aziz' idea in the setting of the logic of Here-and-There. More precisely, we start by defining the logic of Here-and-There with lower bound founded variables along with its equilibrium models and elaborate upon its formal properties. Finally, we compare our approach with related ones and sketch future work. Cham Springer 2019 17 Logics in Artificial Intelligence 11468 978-3-030-19570-0 509 525 10.1007/978-3-030-19570-0_34 Institut für Informatik und Computational Science OPUS4-56734 misc Mühlbauer, Felix; Schröder, Lukas; Schölzel, Mario On hardware-based fault-handling in dynamically scheduled processors This paper describes architectural extensions for a dynamically scheduled processor, so that it can be used in three different operation modes, ranging from high-performance, to high-reliability. With minor hardware-extensions of the control path, the resources of the superscalar data-path can be used either for high-performance execution, fail-safe-operation, or fault-tolerant-operation. This makes the processor-architecture a very good candidate for applications with dynamically changing reliability requirements, e.g. for automotive applications. The paper reports the hardware-overhead for the extensions, and investigates the performance penalties introduced by the fail-safe and fault-tolerant mode. Furthermore, a comprehensive fault simulation was carried out in order to investigate the fault-coverage of the proposed approach. New York IEEE 2017 6 20th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS) 2017 978-1-5386-0472-4 201 206 10.1109/DDECS.2017.7934572 Institut für Informatik und Computational Science OPUS4-54127 misc Sahlmann, Kristina; Schwotzer, Thomas Ontology-based virtual IoT devices for edge computing An IoT network may consist of hundreds heterogeneous devices. Some of them may be constrained in terms of memory, power, processing and network capacity. Manual network and service management of IoT devices are challenging. We propose a usage of an ontology for the IoT device descriptions enabling automatic network management as well as service discovery and aggregation. Our IoT architecture approach ensures interoperability using existing standards, i.e. MQTT protocol and SemanticWeb technologies. We herein introduce virtual IoT devices and their semantic framework deployed at the edge of network. As a result, virtual devices are enabled to aggregate capabilities of IoT devices, derive new services by inference, delegate requests/responses and generate events. Furthermore, they can collect and pre-process sensor data. These tasks on the edge computing overcome the shortcomings of the cloud usage regarding siloization, network bandwidth, latency and speed. We validate our proposition by implementing a virtual device on a Raspberry Pi. New York Association for Computing Machinery 2018 7 Proceedings of the 8th International Conference on the Internet of Things 978-1-4503-6564-2 1 7 10.1145/3277593.3277597 Institut für Informatik und Computational Science OPUS4-11071 misc Stöpel, Christoph; Schubert, Wolfgang; Margaria-Steffen, Tiziana Plug-ins und Dienste : Ansätze zu Bewältigung zeitvarianter Geschäftsprozesse Potsdam Univ. 2007 14 S. Preprint / Universität Potsdam, Institut für Informatik 2007, 2 Institut für Informatik und Computational Science OPUS4-53110 misc Bordihn, Henning; Nagy, Benedek; Vaszil, György Preface: Non-classical models of automata and applications VIII Les Ulis EDP Sciences 2018 2 RAIRO-Theoretical informatics and appli and applications 52 2-4 87 88 10.1051/ita/2018019 Institut für Informatik und Computational Science OPUS4-54074 misc Krstić, Miloš; Jentzsch, Anne-Kristin Reliability, safety and security of the electronics in automated driving vehicles - joint lab lecturing approach This paper proposes an education approach for master and bachelor students to enhance their skills in the area of reliability, safety and security of the electronic components in automated driving. The approach is based on the active synergetic work of research institutes, academia and industry in the frame of joint lab. As an example, the jointly organized summer school with the respective focus is organized and elaborated. New York IEEE 2018 2 2018 12TH European Workshop on Microelectronics Education (EWME) 978-1-5386-1157-9 21 22 Institut für Informatik und Computational Science OPUS4-53924 misc Marwecki, Sebastian; Baudisch, Patrick Scenograph When developing a real-walking virtual reality experience, designers generally create virtual locations to fit a specific tracking volume. Unfortunately, this prevents the resulting experience from running on a smaller or differently shaped tracking volume. To address this, we present a software system called Scenograph. The core of Scenograph is a tracking volume-independent representation of real-walking experiences. Scenograph instantiates the experience to a tracking volume of given size and shape by splitting the locations into smaller ones while maintaining narrative structure. In our user study, participants' ratings of realism decreased significantly when existing techniques were used to map a 25m2 experience to 9m2 and an L-shaped 8m2 tracking volume. In contrast, ratings did not differ when Scenograph was used to instantiate the experience. New York Association for Computing Machinery 2018 10 UIST '18: Proceedings of the 31st Annual ACM Symposium on User Interface Software and Technology 978-1-4503-5948-1 511 520 10.1145/3242587.3242648 Institut für Informatik und Computational Science OPUS4-52381 misc Schaub, Torsten H.; Woltran, Stefan Special issue on answer set programming Heidelberg Springer 2018 3 Künstliche Intelligenz 32 2-3 101 103 10.1007/s13218-018-0554-8 Institut für Informatik und Computational Science OPUS4-36993 misc Patil, Kaustubh R.; Haider, Peter; Pope, Phillip B.; Turnbaugh, Peter J.; Morrison, Mark; Scheffer, Tobias; McHardy, Alice C. Taxonomic metagenome sequence assignment with structured output models London Nature Publ. Group 2011 2 Nature methods : techniques for life scientists and chemists 8 3 191 192 10.1038/nmeth0311-191 Institut für Informatik und Computational Science OPUS4-54584 misc Neubauer, Kai; Haubelt, Christian; Wanko, Philipp; Schaub, Torsten H. Utilizing quad-trees for efficient design space exploration with partial assignment evaluation Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and routing options in order to obtain a feasible system level implementation. In combination with various background theories, a feasibility analysis of the resulting system may already be performed on partial solutions. That is, infeasible subsets of mapping and routing options can be pruned early in the decision process, which fastens the solving accordingly. However, allowing a proper design space exploration including multi-objective optimization also requires an efficient structure for storing and managing non-dominated solutions. In this work, we propose and study the usage of the Quad-Tree data structure in the context of partial assignment evaluation during system synthesis. Out experiments show that unnecessary dominance checks can be avoided, which indicates a preference of Quad-Trees over a commonly used list-based implementation for large combinatorial optimization problems. New York IEEE 2018 6 2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC) 978-1-5090-0602-1 434 439 10.1109/ASPDAC.2018.8297362 Institut für Informatik und Computational Science OPUS4-15029 misc Meinel, Christoph; Sack, Harald WWW : Kommunikation, Internetworking, Web-Technologien Berlin Springer 2004 1179 S. 3-540-44276-6 Institut für Informatik und Computational Science