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 -