TY - CONF AU - Weidmann, Nils AU - Anjorin, Anthony ED - Wehrheim, Heike ED - Cabot, Jordi ID - 17084 SN - 0302-9743 T2 - Proceedings of the 23rd International Conference on Fundamental Approaches to Software Engineering, FASE 2020 TI - Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming ER - TY - CONF AU - Schwichtenberg, Bahar AU - Schwichtenberg, Simon AU - Küster, Jochen AU - Zimmermann, Olaf AU - Engels, Gregor ID - 17085 SN - 0302-9743 T2 - Advanced Information Systems Engineering TI - Modeling and Analyzing Architectural Diversity of Open Platforms ER - TY - CONF AB - Modern cryptographic protocols, such as TLS 1.3 and QUIC, can send cryptographically protected data in “zero round-trip times (0-RTT)”, that is, without the need for a prior interactive handshake. Such protocols meet the demand for communication with minimal latency, but those currently deployed in practice achieve only rather weak security properties, as they may not achieve forward security for the first transmitted payload message and require additional countermeasures against replay attacks.Recently, 0-RTT protocols with full forward security and replay resilience have been proposed in the academic literature. These are based on puncturable encryption, which uses rather heavy building blocks, such as cryptographic pairings. Some constructions were claimed to have practical efficiency, but it is unclear how they compare concretely to protocols deployed in practice, and we currently do not have any benchmark results that new protocols can be compared with.We provide the first concrete performance analysis of a modern 0-RTT protocol with full forward security, by integrating the Bloom Filter Encryption scheme of Derler et al. (EUROCRYPT 2018) in the Chromium QUIC implementation and comparing it to Google’s original QUIC protocol. We find that for reasonable deployment parameters, the server CPU load increases approximately by a factor of eight and the memory consumption on the server increases significantly, but stays below 400 MB even for medium-scale deployments that handle up to 50K connections per day. The difference of the size of handshake messages is small enough that transmission time on the network is identical, and therefore not significant.We conclude that while current 0-RTT protocols with full forward security come with significant computational overhead, their use in practice is feasible, and may be used in applications where the increased CPU and memory load can be tolerated in exchange for full forward security and replay resilience on the cryptographic protocol level. Our results serve as a first benchmark that can be used to assess the efficiency of 0-RTT protocols potentially developed in the future. AU - Dallmeier, Fynn AU - Drees, Jan P. AU - Gellert, Kai AU - Handirk, Tobias AU - Jager, Tibor AU - Klauke, Jonas AU - Nachtigall, Simon AU - Renzelmann, Timo AU - Wolf, Rudi ID - 28997 SN - 0302-9743 T2 - Cryptology and Network Security TI - Forward-Secure 0-RTT Goes Live: Implementation and Performance Analysis in QUIC ER - TY - CONF AU - zur Heiden, Philipp ID - 20706 SN - 0302-9743 T2 - Designing for Digital Transformation. Co-Creating Services with Citizens and Industry TI - Considering Context in Design Science Research: A Systematic Literature Review ER - TY - CONF AU - Mahmood, Yasir AU - Meier, Arne ID - 45848 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic ER - TY - CHAP AU - Haney, Julie M. AU - Furman, Susanne M. AU - Acar, Yasemin ID - 47261 SN - 0302-9743 T2 - HCI for Cybersecurity, Privacy and Trust TI - Smart Home Security and Privacy Mitigations: Consumer Perceptions, Practices, and Challenges ER - TY - CHAP AU - Senft, Björn AU - Rittmeier, Florian AU - Fischer, Holger Gerhard AU - Oberthür, Simon ID - 11952 SN - 0302-9743 T2 - Design, User Experience, and Usability. Practice and Case Studies TI - A Value-Centered Approach for Unique and Novel Software Applications ER - TY - CHAP AU - Kuhlemann, Stefan AU - Sellmann, Meinolf AU - Tierney, Kevin ID - 14890 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Exploiting Counterfactuals for Scalable Stochastic Optimization ER - TY - CHAP AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke ID - 15004 SN - 0302-9743 T2 - Discovery Science TI - Feature Selection for Analogy-Based Learning to Rank ER - TY - CHAP AU - Ahmadi Fahandar, Mohsen AU - Hüllermeier, Eyke ID - 15005 SN - 0302-9743 T2 - KI 2019: Advances in Artificial Intelligence TI - Analogy-Based Preference Learning with Kernels ER - TY - CHAP AU - Nguyen, Vu-Linh AU - Destercke, Sébastien AU - Hüllermeier, Eyke ID - 15006 SN - 0302-9743 T2 - Discovery Science TI - Epistemic Uncertainty Sampling ER - TY - CONF AU - Hartel, Rita AU - Dunst, Alexander ID - 15080 SN - 0302-9743 T2 - International Conference on Multimedia Modeling, MMM TI - How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics ER - TY - CHAP AU - Beyer, Dirk AU - Jakobs, Marie-Christine ID - 13872 SN - 0302-9743 T2 - Fundamental Approaches to Software Engineering TI - CoVeriTest: Cooperative Verifier-Based Testing ER - TY - CONF AU - Mahmood, Yasir AU - Meier, Arne AU - Schmidt, Johannes ID - 45818 SN - 0302-9743 T2 - Logical Foundations of Computer Science TI - Parameterised Complexity of Abduction in Schaefer’s Framework ER - TY - CONF AU - Blömer, Johannes AU - Eidens, Fabian AU - Juhnke, Jakob ID - 2862 SN - 0302-9743 T2 - Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings TI - Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems ER - TY - CONF AB - We study the Online Prize-collecting Node-weighted Steiner Forest problem (OPC-NWSF) in which we are given an undirected graph \(G=(V, E)\) with \(|V| = n\) and node-weight function \(w: V \rightarrow \mathcal {R}^+\). A sequence of k pairs of nodes of G, each associated with a penalty, arrives online. OPC-NWSF asks to construct a subgraph H such that each pair \(\{s, t\}\) is either connected (there is a path between s and t in H) or its associated penalty is paid. The goal is to minimize the weight of H and the total penalties paid. The current best result for OPC-NWSF is a randomized \(\mathcal {O}(\log ^4 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014). We improve this by proposing a randomized \(\mathcal {O}(\log n \log k)\)-competitive algorithm for OPC-NWSF, which is optimal up to constant factor since OPC-NWSF has a randomized lower bound of \(\varOmega (\log ^2 n)\) due to Korman [11]. Moreover, our result also implies an improvement for two special cases of OPC-NWSF, the Online Prize-collecting Node-weighted Steiner Tree problem (OPC-NWST) and the Online Node-weighted Steiner Forest problem (ONWSF). In OPC-NWST, there is a distinguished node which is one of the nodes in each pair. In ONWSF, all penalties are set to infinity. The currently best known results for OPC-NWST and ONWSF are a randomized \(\mathcal {O}(\log ^3 n)\)-competitive algorithm due to Hajiaghayi et al. (ICALP 2014) and a randomized \(\mathcal {O}(\log n \log ^2 k)\)-competitive algorithm due to Hajiaghayi et al. (FOCS 2013), respectively. AU - Markarian, Christine ID - 24396 SN - 0302-9743 T2 - International Workshop on Combinatorial Algorithms (IWOCA) TI - An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest ER - TY - CONF AB - Profiling applications on a heterogeneous compute node is challenging since the way to retrieve data from the resources and interpret them varies between resource types and manufacturers. This holds especially true for measuring the energy consumption. In this paper we present Ampehre, a novel open source measurement framework that allows developers to gather comparable measurements from heterogeneous compute nodes, e.g., nodes comprising CPU, GPU, and FPGA. We explain the architecture of Ampehre and detail the measurement process on the example of energy measurements on CPU and GPU. To characterize the probing effect, we quantitatively analyze the trade-off between the accuracy of measurements and the CPU load imposed by Ampehre. Based on this analysis, we are able to specify reasonable combinations of sampling periods for the different resource types of a compute node. AU - Lösch, Achim AU - Wiens, Alex AU - Platzner, Marco ID - 3362 SN - 0302-9743 T2 - Proceedings of the International Conference on Architecture of Computing Systems (ARCS) TI - Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes VL - 10793 ER - TY - CONF AB - Modern Boolean satisfiability solvers can emit proofs of unsatisfiability. There is substantial interest in being able to verify such proofs and also in using them for further computations. In this paper, we present an FPGA accelerator for checking resolution proofs, a popular proof format. Our accelerator exploits parallelism at the low level by implementing the basic resolution step in hardware, and at the high level by instantiating a number of parallel modules for proof checking. Since proof checking involves highly irregular memory accesses, we employ Hybrid Memory Cube technology for accelerator memory. The results show that while the accelerator is scalable and achieves speedups for all benchmark proofs, performance improvements are currently limited by the overhead of transitioning the proof into the accelerator memory. AU - Hansmeier, Tim AU - Platzner, Marco AU - Andrews, David ID - 3373 SN - 0302-9743 T2 - ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications TI - An FPGA/HMC-Based Accelerator for Resolution Proof Checking VL - 10824 ER - TY - CHAP AU - Schellhorn, Gerhard AU - Wedel, Monika AU - Travkin, Oleg AU - König, Jürgen AU - Wehrheim, Heike ID - 3536 SN - 0302-9743 T2 - Software Engineering and Formal Methods TI - FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity ER - TY - CONF AB - Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs. AU - Töws, Manuel AU - Wehrheim, Heike ID - 5774 SN - 0302-9743 T2 - Theoretical Aspects of Computing – ICTAC 2018 TI - Information Flow Certificates ER - TY - CHAP AU - Senft, Björn AU - Fischer, Holger Gerhard AU - Oberthür, Simon AU - Patkar, Nitish ID - 6253 SN - 0302-9743 T2 - Design, User Experience, and Usability: Theory and Practice TI - Assist Users to Straightaway Suggest and Describe Experienced Problems VL - 10918 ER - TY - CHAP AU - Fischer, Holger Gerhard AU - Senft, Björn AU - Rittmeier, Florian AU - Sauer, Stefan ED - Marcus, Aaron ED - Wang, Wentao ID - 6254 SN - 0302-9743 T2 - Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018) TI - A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems VL - 10918 ER - TY - CHAP AU - Schäfer, Dirk AU - Hüllermeier, Eyke ID - 6423 SN - 0302-9743 T2 - Discovery Science TI - Preference-Based Reinforcement Learning Using Dyad Ranking ER - TY - CHAP AU - Feldkord, Björn AU - Malatyali, Manuel AU - Meyer auf der Heide, Friedhelm ID - 16392 SN - 0302-9743 T2 - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications TI - A Dynamic Distributed Data Structure for Top-k and k-Select Queries ER - TY - CONF AB - Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations. AU - Khaluf, Yara AU - Markarian, Christine AU - Simoens, Pieter AU - Reina, Andreagiovanni ID - 24398 SN - 0302-9743 T2 - International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017) TI - Scheduling Access to Shared Space in Multi-robot Systems ER - TY - CONF AU - Blömer, Johannes AU - Liske, Gennadij ID - 2967 SN - 0302-9743 T2 - Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS) TI - Subtleties in Security Definitions for Predicate Encryption with Public Index VL - 10693 ER - TY - CHAP AU - Gerking, Christopher AU - Schubert, David AU - Budde, Ingo ID - 23396 SN - 0302-9743 T2 - Theory and Practice of Model Transformation TI - Reducing the Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities ER - TY - CONF AU - Blömer, Johannes AU - Günther, Peter AU - Krummel, Volker AU - Löken, Nils ID - 2344 SN - 0302-9743 T2 - Foundations and Practice of Security TI - Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations ER - TY - CHAP AB - Metric facility location and K-means are well-known problems of combinatorial optimization. Both admit a fairly simple heuristic called single-swap, which adds, drops or swaps open facilities until it reaches a local optimum. For both problems, it is known that this algorithm produces a solution that is at most a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated facility location and weighted discrete K-means problem is tightly PLS-complete and hence has exponential worst-case running time. AU - Brauer, Sascha ED - Fotakis, Dimitris ED - Pagourtzis, Aris ED - Paschos, Vangelis Th. ID - 2381 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems VL - 10236 ER - TY - CONF AB - Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis. In this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs. AU - Töws, Manuel AU - Wehrheim, Heike ID - 5769 SN - 0302-9743 T2 - Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods (ICFEM 2017) TI - Policy Dependent and Independent Information Flow Analyses ER - TY - CHAP AU - Fischer, Holger Gerhard AU - Engler, Michael AU - Sauer, Stefan ID - 6255 SN - 0302-9743 T2 - Design, User Experience, and Usability: Theory, Methodology, and Management TI - A Human-Centered Perspective on Software Quality: Acceptance Criteria for Work 4.0 VL - 10288 ER - TY - CHAP AU - Bemmann, Pascal AU - Biermeier, Felix AU - Bürmann, Jan AU - Kemper, Arne AU - Knollmann, Till AU - Knorr, Steffen AU - Kothe, Nils AU - Mäcker, Alexander AU - Malatyali, Manuel AU - Meyer auf der Heide, Friedhelm AU - Riechers, Sören AU - Schaefer, Johannes Sebastian AU - Sundermeier, Jannik ID - 16461 SN - 0302-9743 T2 - Structural Information and Communication Complexity TI - Monitoring of Domain-Related Problems in Distributed Data Streams ER - TY - CHAP AU - Beckschäfer, Michaela AU - Malberg, Simon AU - Tierney, Kevin AU - Weskamp, Christoph ID - 14857 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Simulating Storage Policies for an Automated Grid-Based Warehouse System ER - TY - CONF AU - Hamann, Heiko AU - Valentini, Gabriele AU - Dorigo, Marco ID - 20000 SN - 0302-9743 T2 - 10th Int. Conf. on Swarm Intelligence, ANTS 2016 TI - Population Coding: A New Design Paradigm for Embodied Distributed Systems ER - TY - CONF AU - Valentini, Gabriele AU - Brambilla, Davide AU - Hamann, Heiko AU - Dorigo, Marco ID - 20004 SN - 0302-9743 T2 - 10th Int. Conf. on Swarm Intelligence, ANTS 2016 TI - Collective Perception of Environmental Features in a Robot Swarm ER - TY - CHAP AU - Günther, Peter AU - Krummel, Volker ID - 2948 SN - 0302-9743 T2 - Mathematical Aspects of Computer and Information Sciences TI - Implementing Cryptographic Pairings on Accumulator Based Smart Card Architectures ER - TY - CHAP AU - Blömer, Johannes AU - Lammersen, Christiane AU - Schmidt, Melanie AU - Sohler, Christian ID - 2968 SN - 0302-9743 T2 - Algorithm Engineering TI - Theoretical Analysis of the k-Means Algorithm – A Survey ER - TY - CHAP AU - Blömer, Johannes AU - Bujna, Kathrin ID - 2970 SN - 0302-9743 T2 - Advances in Knowledge Discovery and Data Mining TI - Adaptive Seeding for Gaussian Mixture Models ER - TY - CONF AB - Integrating apps on mobile devices into applications running on other devices is usually difficult. For instance, using a messenger on a smartphone to share a text written on a desktop computer often ends up in a cumbersome solution to transfer the text, because many applications are not designed for such scenarios. In this paper, we present an approach enabling the integration of apps running on Android devices into applications running on other devices and even other platforms. This is achieved by specifying adapters for Android apps, which map their services to a platform-independent service interface. For this purpose, we have developed a domain-specific language to ease the specification of such mappings. Our approach is applicable without the need to modify the existing Android apps providing the service. We analyzed its feasibility by implementing our approach and by specifying mappings for several popular Android apps, e.g., phone book, camera, and file explorer. AU - Wolters, Dennis AU - Kirchhoff, Jonas AU - Gerth, Christian AU - Engels, Gregor ED - Sheng, Quan Z. ED - Stroulia, Eleni ED - Tata, Samir ED - Bhiri, Sami ID - 5825 KW - Cross-Device KW - Integration KW - Android KW - Adapter KW - DSL SN - 0302-9743 T2 - Service-Oriented Computing TI - Cross-Device Integration of Android Apps ER - TY - CHAP AU - Fischer, Holger Gerhard AU - Senft, Björn ED - Bogdan, Christian ID - 6257 SN - 0302-9743 T2 - Human-Centered and Error-Resilient Systems Development TI - Human-Centered Software Engineering as a Chance to Ensure Software Quality Within the Digitization of Human Workflows VL - 9856 ER - TY - CHAP AU - Blömer, Johannes AU - Bujna, Kathrin ID - 2978 SN - 0302-9743 T2 - Advances in Knowledge Discovery and Data Mining TI - Adaptive Seeding for Gaussian Mixture Models ER - TY - CHAP AU - Blazy, Olivier AU - Kakvi, Saqib AU - Kiltz, Eike AU - Pan, Jiaxin ID - 2921 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Tightly-Secure Signatures from Chameleon Hash Functions ER - TY - CHAP AU - Altmeier, Christian AU - Mainka, Christian AU - Somorovsky, Juraj AU - Schwenk, Jörg ID - 15897 SN - 0302-9743 T2 - Data Privacy Management, and Security Assurance - 10th International Workshop, {DPM} 2015, and 4th International Workshop, {QASA} 2015 TI - AdIDoS – Adaptive and Intelligent Fully-Automatic Detection of Denial-of-Service Weaknesses in Web Services ER - TY - CHAP AU - Jager, Tibor AU - Schwenk, Jörg AU - Somorovsky, Juraj ID - 15899 SN - 0302-9743 T2 - Computer Security -- ESORICS 2015 TI - Practical Invalid Curve Attacks on TLS-ECDH ER - TY - CONF AU - Böttcher, Stefan AU - Hartel, Rita AU - Jacobs, Thomas AU - Jeromin, Markus ID - 15088 SN - 0302-9743 T2 - Data Science - 30th British International Conference on Databases, BICOD 2015 TI - ECST – Extended Context-Free Straight-Line Tree Grammars ER - TY - CHAP AU - Geierhos, Michaela AU - Bäumer, Frederik S. AU - Schulze, Sabine AU - Klotz, Caterina ID - 25338 SN - 0302-9743 T2 - Modeling and Using Context TI - Understanding the Patient 2.0 ER - TY - CHAP AU - Geierhos, Michaela AU - Bäumer, Frederik S. AU - Schulze, Sabine AU - Klotz, Caterina ID - 25337 SN - 0302-9743 T2 - Modeling and Using Context TI - Understanding the Patient 2.0 ER - TY - CONF AU - Hamann, Heiko AU - Valentini, Gabriele ID - 20008 SN - 0302-9743 T2 - Ninth Int. Conf. on Swarm Intelligence (ANTS 2014) TI - Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins ER - TY - CHAP AB - Real-time software-intensive embedded systems complexity, as in the automotive domain, requires rigorous Requirements Engineering (RE) approaches. Scenario-based RE formalisms like Modal Sequence Diagrams (MSDs) enable an intuitive specication and the simulative validation of functional requirements. However, the dependencies between events occurring in different MSD scenarios are implicit so that it is difficult to find causes of requirements defects, if any. The automotive architecture description language EAST-ADL addresses this problem by relying on event chains, which make dependencies between events explicit. However, EAST-ADL event chains have a low abstraction level, and their relationship to functional requirements has seldom been investigated. Based on the EAST-ADL functional architecture, we propose to use its central notion of event to conciliate both approaches. We conceived an automatic transformation from the high abstraction level requirements specified in MSDs to the low abstraction level event chains. AU - Koch, Thorsten AU - Holtmann, Jörg AU - DeAntoni, Julien ID - 20982 SN - 0302-9743 T2 - Software Architecture TI - Generating EAST-ADL Event Chains from Scenario-Based Requirements Specifications ER - TY - CONF AU - Bokermann, Dennis AU - Gerth, Christian AU - Engels, Gregor ID - 6741 SN - 0302-9743 T2 - 12th International Conference on Business Process Management (BPM 2014) TI - Use Your Best Device! Enabling Device Changes at Runtime VL - 8659 ER - TY - BOOK ED - Flocchini, Paola ED - Gao, Jie ED - Kranakis, Evangelos ED - Meyer auf der Heide, Friedhelm ID - 16870 SN - 0302-9743 TI - Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013 VL - 8243 ER - TY - CONF AU - Böttcher, Stefan AU - Hartel, Rita AU - Rabe, Jonathan ID - 15092 SN - 0302-9743 T2 - Database and Expert Systems Applications - 25th International Conference, DEXA 2014 TI - Efficient XML Keyword Search Based on DAG-Compression ER - TY - CHAP AU - Lukovszki, Tamás AU - Meyer auf der Heide, Friedhelm ID - 16394 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots ER - TY - CHAP AU - Abshoff, Sebastian AU - Meyer auf der Heide, Friedhelm ID - 16395 SN - 0302-9743 T2 - Structural Information and Communication Complexity TI - Continuous Aggregation in Dynamic Ad-Hoc Networks ER - TY - CHAP AU - Fourné, Marcel AU - Stegemann, Kevin AU - Petersen, Dominique AU - Pohlmann, Norbert ID - 47839 SN - 0302-9743 T2 - Information and Communication Technology TI - Aggregation of Network Protocol Data Near Its Source ER - TY - CHAP AU - Blömer, Johannes AU - Günther, Peter AU - Liske, Gennadij ID - 2979 SN - 0302-9743 T2 - Constructive Side-Channel Analysis and Secure Design TI - Improved Side Channel Attacks on Pairing Based Cryptography ER - TY - CHAP AU - Klompmaker, Florian AU - Paelke, Volker AU - Fischer, Holger Gerhard ID - 6276 SN - 0302-9743 T2 - Distributed, Ambient, and Pervasive Interactions TI - A Taxonomy-Based Approach towards NUI Interaction Design VL - 8028 ER - TY - CHAP AU - Fischer, Holger Gerhard AU - Strenge, Benjamin AU - Nebe, Karsten ID - 6279 SN - 0302-9743 T2 - Design, User Experience, and Usability. Design Philosophy, Methods, and Tools TI - Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design VL - 8012 ER - TY - CONF AU - Place, Thomas AU - van Rooijen, Lorijn AU - Zeitoun, Marc ID - 6732 SN - 0302-9743 T2 - Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013 TI - Separating Regular Languages by Piecewise Testable and Unambiguous Languages ER - TY - CONF AU - Böttcher, Stefan AU - Hartel, Rita AU - Jacobs, Thomas ID - 15093 SN - 0302-9743 T2 - Big Data - 29th British National Conference on Databases, BNCOD 2013, TI - Fast Multi-update Operations on Compressed XML Data ER - TY - CHAP AB - In order to evaluate the efficiency of algorithms for real-time 3D rendering, different properties like rendering time, occluded triangles, or image quality, need to be investigated. Since these properties depend on the position of the camera, usually some camera path is chosen, along which the measurements are performed. As those measurements cover only a small part of the scene, this approach hardly allows drawing conclusions regarding the algorithm's properties at arbitrary positions in the scene. The presented method allows the systematic and position-independent evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate the distribution of a property (like rendering time) for all positions in the scene. This approximation can be visualized to produce an intuitive impression of the algorithm's behavior or be statistically analyzed for objectively rating and comparing algorithms. We demonstrate our method by evaluating performance aspects of a known occlusion culling algorithm. AU - Jähn, Claudius AU - Eikel, Benjamin AU - Fischer, Matthias AU - Petring, Ralf AU - Meyer auf der Heide, Friedhelm ID - 16406 SN - 0302-9743 T2 - Advances in Visual Computing TI - Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties ER - TY - CHAP AB - Many virtual 3D scenes, especially those that are large, are not structured evenly. For such heterogeneous data, there is no single algorithm that is able to render every scene type at each position fast and with the same high image quality. For a small set of scenes, this situation can be improved if different rendering algorithms are manually assigned to particular parts of the scene by an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically deploys different rendering algorithms simultaneously for a broad range of scene types. The method divides the scene into subregions and measures the behavior of different algorithms for each region in a preprocessing step. During runtime, this data is utilized to compute an estimate for the quality and running time of the available rendering algorithms from the observer's point of view. By solving an optimizing problem, the image quality can be optimized by an assignment of algorithms to regions while keeping the frame rate almost constant. AU - Petring, Ralf AU - Eikel, Benjamin AU - Jähn, Claudius AU - Fischer, Matthias AU - Meyer auf der Heide, Friedhelm ID - 16407 SN - 0302-9743 T2 - Advances in Visual Computing TI - Real-Time 3D Rendering of Heterogeneous Scenes ER - TY - CONF AU - Hamann, Heiko AU - Engelbrecht, Andreas AU - Birattari, Mauro AU - Dorigo, Marco AU - Blum, Christian AU - Stuetzle, Thomas AU - Christensen, Anders Lyhne AU - Gross, Roderich ID - 20179 SN - 0302-9743 T2 - Swarm Intelligence: 8th International Conference, ANTS 2012 TI - Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions VL - 7461 ER - TY - CHAP AU - Kakvi, Saqib AU - Kiltz, Eike AU - May, Alexander ID - 2918 SN - 0302-9743 T2 - Advances in Cryptology – ASIACRYPT 2012 TI - Certifying RSA ER - TY - CHAP AU - Kakvi, Saqib AU - Kiltz, Eike ID - 2919 SN - 0302-9743 T2 - Advances in Cryptology – EUROCRYPT 2012 TI - Optimal Security Proofs for Full Domain Hash, Revisited ER - TY - CHAP AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16445 SN - 0302-9743 T2 - Experimental Algorithms TI - Continuous Local Strategies for Robotic Formation Problems ER - TY - CHAP AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16448 SN - 0302-9743 T2 - Algorithms for Sensor Systems TI - Local, Self-organizing Strategies for Robotic Formation Problems ER - TY - CHAP AU - Baier, Robert AU - Molo, Mirko Hessel-von ID - 16516 SN - 0302-9743 T2 - Large-Scale Scientific Computing TI - Newton’s Method and Secant Method for Set-Valued Mappings ER - TY - CHAP AU - Jager, Tibor AU - Schinzel, Sebastian AU - Somorovsky, Juraj ID - 15891 SN - 0302-9743 T2 - Computer Security – ESORICS 2012 TI - Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption ER - TY - CONF AB - We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes’ memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time. AU - Suess, Tim AU - Koch, Clemens AU - Jähn, Claudius AU - Fischer, Matthias AU - Meyer auf der Heide, Friedhelm ID - 16408 SN - 0302-9743 T2 - Advances in Visual Computing TI - Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes VL - 7431 ER - TY - CONF AU - Hamann, Heiko AU - Schmickl, Thomas AU - Crailsheim, Karl ID - 20183 SN - 0302-9743 T2 - 10th European Conference on Artificial Life (ECAL'09) TI - Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System VL - 5777 ER - TY - JOUR AU - Lettmann, Theodor AU - Baumann, Michael AU - Eberling, Markus AU - Kemmerich, Thomas ID - 3332 JF - Transactions on Computational Collective Intelligence V SN - 0302-9743 TI - Modeling Agents and Agent Systems ER - TY - CHAP AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - auf der Heide, Friedhelm Meyer AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 20709 SN - 0302-9743 T2 - SOFSEM 2011: Theory and Practice of Computer Science TI - Collisionless Gathering of Robots with an Extent ER - TY - CHAP AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - Meyer auf der Heide, Friedhelm AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 20710 SN - 0302-9743 T2 - Automata, Languages and Programming TI - A New Approach for Analyzing Convergence Algorithms for Mobile Robots ER - TY - CHAP AU - Nebe, Karsten AU - Klompmaker, Florian AU - Jung, Helge AU - Fischer, Holger Gerhard ED - Jacko, Julie Anne ID - 6293 SN - 0302-9743 T2 - Human-Computer Interaction. Interaction Techniques and Environments. TI - Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction VL - 6762 ER - TY - CHAP AU - Fischer, Holger Gerhard AU - Nebe, Karsten AU - Klompmaker, Florian ED - Kurosu, Masaaki ID - 6300 SN - 0302-9743 T2 - Human Centered Design TI - A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities VL - 6776 ER - TY - CONF AB - Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version. AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - Meyer auf der Heide, Friedhelm AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 16410 IS - 6543 SN - 0302-9743 T2 - 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011) TI - Collisionless Gathering of Robots with an Extent ER - TY - CHAP AU - Brandes, Philipp AU - Degener, Bastian AU - Kempkes, Barbara AU - Meyer auf der Heide, Friedhelm ID - 16459 SN - 0302-9743 T2 - Structural Information and Communication Complexity TI - Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally ER - TY - CONF AU - Benter, Markus AU - Böttcher, Stefan AU - Hartel, Rita ID - 15097 SN - 0302-9743 T2 - East European Conference on Advances in Databases and Information Systems TI - Mixing Bottom-Up and Top-Down XPath Query Evaluation ER - TY - CONF AU - Bätz, Alexander AU - Böttcher, Stefan AU - Hartel, Rita ID - 15099 SN - 0302-9743 T2 - Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers TI - Updates on Grammar-Compressed XML Data ER - TY - CONF AU - Böttcher, Stefan AU - Hartel, Rita AU - Stey, Sebastian ID - 15100 SN - 0302-9743 T2 - Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers TI - TraCX: Transformation of Compressed XML ER - TY - CHAP AB - Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes. AU - Cord-Landwehr, Andreas AU - Degener, Bastian AU - Fischer, Matthias AU - Hüllmann, Martina AU - Kempkes, Barbara AU - Klaas, Alexander AU - Kling, Peter AU - Kurras, Sven AU - Märtens, Marcus AU - Meyer auf der Heide, Friedhelm AU - Raupach, Christoph AU - Swierkot, Kamil AU - Warner, Daniel AU - Weddemann, Christoph AU - Wonisch, Daniel ID - 16409 SN - 0302-9743 T2 - Automata, Languages and Programming TI - A New Approach for Analyzing Convergence Algorithms for Mobile Robots ER - TY - CONF AB - We introduce the Read-Write-Coding-System (RWC) – a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \leq r,w \leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\left(n,k,d\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data. AU - Mense, Mario AU - Schindelhauer, Christian ID - 19796 SN - 0302-9743 T2 - Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems TI - Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks VL - 5873 ER - TY - CONF AU - Hamann, Heiko AU - Meyer, Bernd AU - Schmickl, Thomas AU - Crailsheim, Karl ID - 20226 SN - 0302-9743 T2 - From Animals to Animats 11 TI - A Model of Symmetry Breaking in Collective Decision-Making VL - 6226 ER - TY - JOUR AU - Grza̧ślewicz, Ryszard AU - Kutyłowski, Jarosław AU - Kutyłowski, Mirosław AU - Pietkiewicz, Wojciech ID - 24282 JF - ICCSA'05: Proceedings of the 2005 international conference on Computational Science and Its Applications SN - 0302-9743 TI - Robust Undetectable Interference Watermarks ER - TY - CHAP AU - Ackermann, Marcel R. AU - Blömer, Johannes ID - 2988 SN - 0302-9743 T2 - SWAT 2010 TI - Bregman Clustering for Separable Instances ER - TY - CHAP AB - Self-healing promises to improve the dependability of systems. In particular safety-critical systems like automotive systems are well suited application, since safe operation is required in these systems even in case of failures. Prerequisite for the improved dependability is the correct realization of the self-healing techniques. Consequently, self-healing activities should be rigorously specified and appropriately integrated with the rest of the system. In this paper, we present an approach for designing self-healing mechanisms in automotive systems. The approach contains a construction model which consist of a structural description as well as an extensive set of constraints. The constraints specify a correct system structure and are also used in the self-healing activities. We exemplify the self-healing approach using the adaptive cruise control system of modern cars. AU - Seebach, Hella AU - Nafz, Florian AU - Holtmann, Jörg AU - Meyer, Jan AU - Tichy, Matthias AU - Reif, Wolfgang AU - Schäfer, Wilhelm ID - 20961 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Designing Self-healing in Automotive Systems ER - TY - CONF AU - Briest, Patrick AU - Chalermsook, Parinya AU - Khanna, Sanjeev AU - Laekhanukit, Bundit AU - Nanongkai, Danupon ID - 19029 SN - 0302-9743 T2 - Workshop on Internet and Network Economics (WINE) TI - Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing ER - TY - CHAP AB - We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset. AU - Eikel, Benjamin AU - Jähn, Claudius AU - Fischer, Matthias ID - 16505 SN - 0302-9743 T2 - Advances in Visual Computing TI - Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware ER - TY - CONF AU - Böttcher, Stefan AU - Hartel, Rita AU - Messinger, Christian ID - 15137 SN - 0302-9743 T2 - Database and XML Technologies - 7th International XML Database Symposium, XSym 2010 TI - Searchable Compression of Office Documents by XML Schema Subtraction ER - TY - CHAP AU - Degener, Bastian AU - Kempkes, Barbara AU - Kling, Peter AU - Meyer auf der Heide, Friedhelm ID - 16365 SN - 0302-9743 T2 - Structural Information and Communication Complexity TI - A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots ER - TY - BOOK ED - Abramsky, Samson ED - Gavoille, Cyril ED - Kirchner, Claude ED - Meyer auf der Heide, Friedhelm ED - Spirakis, Paul G. ID - 16403 SN - 0302-9743 TI - Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. ER - TY - BOOK ED - Abramsky, Samson ED - Gavoille, Cyril ED - Kirchner, Claude ED - Meyer auf der Heide, Friedhelm ED - Spirakis, Paul G. ID - 16404 SN - 0302-9743 TI - Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. ER - TY - CHAP AU - Trier, Matthias AU - Müller, Claudia ID - 13301 SN - 0302-9743 T2 - Practical Aspects of Knowledge Management TI - Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes ER - TY - CHAP AB - We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\classP$ or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\bigO(\log^*n)$ communication rounds. AU - Bonorden, Olaf AU - Degener, Bastian AU - Kempkes, Barbara AU - Pietrzyk, Peter ID - 19724 SN - 0302-9743 T2 - Algorithmic Aspects of Wireless Sensor Networks TI - Complexity and Approximation of a Geometric Local Robot Assignment Problem ER - TY - CHAP AU - Kakvi, Saqib ID - 2920 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Reinforcement Learning for Blackjack ER - TY - CHAP AU - Schrieb, Jonas AU - Wehrheim, Heike AU - Wonisch, Daniel ID - 3000 SN - 0302-9743 T2 - FM 2009: Formal Methods TI - Three-Valued Spotlight Abstractions ER - TY - CHAP AB - In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset of the items. We focus on the case of computationally bounded followers who cannot optimize exactly over the range of all feasible subsets, but apply some publicly known algorithm to determine the set of items to purchase. This corresponds to general multi-dimensional pricing assuming that consumers cannot optimize over the full domain of their valuation functions but still aim to act rationally to the best of their ability. We consider two versions of this novel type of Stackelberg pricing games. Assuming that items are weighted objects and the follower seeks to purchase a min-cost selection of objects of some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate algorithm, we show how an extension of the known single-price algorithm can be used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s revenue maximization problem based on so-called near-uniform price assignments. We also prove the problem to be strongly NP-hard. Considering the case that items are subsets of some ground set which the follower seeks to cover (the Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform price assignments fail to yield a good approximation guarantee. However, in the special case of elements with frequency 2 (the Vertex-Cover problem) it turns out that exact revenue maximization can be done in polynomial-time. This stands in sharp contrast to the fact that revenue maximization becomes APX-hard already for elements with frequency 3. AU - Briest, Patrick AU - Hoefer, Martin AU - Gualà, Luciano AU - Ventre, Carmine ID - 23744 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - On Stackelberg Pricing with Computationally Bounded Consumers ER - TY - CHAP AU - Biermann, Thorsten AU - Schwabe, Arne AU - Karl, Holger ID - 1830 SN - 0302-9743 T2 - NETWORKING 2009 TI - Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE ER - TY - CHAP AU - Kakvi, Saqib ID - 9616 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Reinforcement Learning for Blackjack ER -