@inbook{15004, author = {{Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}}, booktitle = {{Discovery Science}}, isbn = {{9783030337773}}, issn = {{0302-9743}}, title = {{{Feature Selection for Analogy-Based Learning to Rank}}}, doi = {{10.1007/978-3-030-33778-0_22}}, year = {{2019}}, } @inbook{15005, author = {{Ahmadi Fahandar, Mohsen and Hüllermeier, Eyke}}, booktitle = {{KI 2019: Advances in Artificial Intelligence}}, isbn = {{9783030301781}}, issn = {{0302-9743}}, title = {{{Analogy-Based Preference Learning with Kernels}}}, doi = {{10.1007/978-3-030-30179-8_3}}, year = {{2019}}, } @inbook{15006, author = {{Nguyen, Vu-Linh and Destercke, Sébastien and Hüllermeier, Eyke}}, booktitle = {{Discovery Science}}, isbn = {{9783030337773}}, issn = {{0302-9743}}, title = {{{Epistemic Uncertainty Sampling}}}, doi = {{10.1007/978-3-030-33778-0_7}}, year = {{2019}}, } @inproceedings{15080, author = {{Hartel, Rita and Dunst, Alexander}}, booktitle = {{International Conference on Multimedia Modeling, MMM}}, isbn = {{9783030057152}}, issn = {{0302-9743}}, location = {{Thessaloniki, Greece}}, pages = {{662--671}}, publisher = {{Springer}}, title = {{{How Good Is Good Enough? Establishing Quality Thresholds for the Automatic Text Analysis of Retro-Digitized Comics}}}, doi = {{10.1007/978-3-030-05716-9_59}}, year = {{2019}}, } @inbook{13872, author = {{Beyer, Dirk and Jakobs, Marie-Christine}}, booktitle = {{Fundamental Approaches to Software Engineering}}, isbn = {{9783030167219}}, issn = {{0302-9743}}, title = {{{CoVeriTest: Cooperative Verifier-Based Testing}}}, doi = {{10.1007/978-3-030-16722-6_23}}, year = {{2019}}, } @inbook{56579, abstract = {{Question answering engines have become one of the most popular type of applications driven by Semantic Web technologies. Consequently, the provision of means to quantify the performance of current question answering approaches on current datasets has become ever more important. However, a large percentage of the queries found in popular question answering benchmarks cannot be executed on current versions of their reference dataset. There is a consequently a clear need to curate question answering benchmarks periodically. However, the manual alteration of question answering benchmarks is often error-prone. We alleviate this problem by presenting QUANT, a novel framework for the creation and curation of question answering benchmarks. QUANT sup-ports the curation of benchmarks by generating smart edit suggestions for question-query pair and for the corresponding metadata. In addition, our framework supports the creation of new benchmark entries by pro-viding predefined quality checks for queries. We evaluate QUANT on 653questions obtained from QALD-1 to QALD-8 with 10 users. Our results show that our framework generates reliable suggestions and can reduce the curation effort for QA benchmarks by up to 91%.}}, author = {{Gusmita, Ria Hari and Jalota, Rricha and Vollmers, Daniel and Reineke, Jan and Ngonga Ngomo, Axel-Cyrille and Usbeck, Ricardo}}, booktitle = {{Semantic Systems. The Power of AI and Knowledge Graphs}}, editor = {{Acosta, Maribel and Cudr{\'e}-Mauroux, Philippe and Maleshkova, Maria and Pellegrini, Tassilo and Sack, Harald and Sure-Vetter, York}}, isbn = {{978-3-030-33219-8}}, issn = {{0302-9743}}, keywords = {{Benchmark, Question answering, Knowledge base}}, location = {{Karlsruhe, Germany}}, pages = {{343----358}}, publisher = {{Springer International Publishing}}, title = {{{QUANT - Question Answering Benchmark Curator}}}, doi = {{10.1007/978-3-030-33220-4_25}}, year = {{2019}}, } @inproceedings{2862, author = {{Blömer, Johannes and Eidens, Fabian and Juhnke, Jakob}}, booktitle = {{Topics in Cryptology - {CT-RSA} 2018 - The Cryptographers' Track at the {RSA} Conference 2018, Proceedings}}, isbn = {{9783319769523}}, issn = {{0302-9743}}, location = {{San Francisco, CA, USA}}, pages = {{470--490}}, publisher = {{Springer International Publishing}}, title = {{{Practical, Anonymous, and Publicly Linkable Universally-Composable Reputation Systems}}}, doi = {{10.1007/978-3-319-76953-0_25}}, year = {{2018}}, } @inproceedings{24396, abstract = {{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.}}, author = {{Markarian, Christine}}, booktitle = {{International Workshop on Combinatorial Algorithms (IWOCA)}}, issn = {{0302-9743}}, title = {{{An Optimal Algorithm for Online Prize-Collecting Node-Weighted Steiner Forest}}}, doi = {{10.1007/978-3-319-94667-2_18}}, year = {{2018}}, } @inproceedings{3362, abstract = {{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.}}, author = {{Lösch, Achim and Wiens, Alex and Platzner, Marco}}, booktitle = {{Proceedings of the International Conference on Architecture of Computing Systems (ARCS)}}, isbn = {{9783319776095}}, issn = {{0302-9743}}, pages = {{73--84}}, publisher = {{Springer International Publishing}}, title = {{{Ampehre: An Open Source Measurement Framework for Heterogeneous Compute Nodes}}}, doi = {{10.1007/978-3-319-77610-1_6}}, volume = {{10793}}, year = {{2018}}, } @inproceedings{3373, abstract = {{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.}}, author = {{Hansmeier, Tim and Platzner, Marco and Andrews, David}}, booktitle = {{ARC 2018: Applied Reconfigurable Computing. Architectures, Tools, and Applications}}, isbn = {{9783319788890}}, issn = {{0302-9743}}, location = {{Santorini, Greece}}, pages = {{153--165}}, publisher = {{Springer International Publishing}}, title = {{{An FPGA/HMC-Based Accelerator for Resolution Proof Checking}}}, doi = {{10.1007/978-3-319-78890-6_13}}, volume = {{10824}}, year = {{2018}}, } @inbook{3536, author = {{Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}}, booktitle = {{Software Engineering and Formal Methods}}, isbn = {{9783319929699}}, issn = {{0302-9743}}, pages = {{105--120}}, publisher = {{Springer International Publishing}}, title = {{{FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}}}, doi = {{10.1007/978-3-319-92970-5_7}}, year = {{2018}}, } @inproceedings{5774, abstract = {{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.}}, author = {{Töws, Manuel and Wehrheim, Heike}}, booktitle = {{Theoretical Aspects of Computing – ICTAC 2018}}, isbn = {{9783030025076}}, issn = {{0302-9743}}, pages = {{435--454}}, publisher = {{Springer International Publishing}}, title = {{{Information Flow Certificates}}}, doi = {{10.1007/978-3-030-02508-3_23}}, year = {{2018}}, } @inbook{6253, author = {{Senft, Björn and Fischer, Holger Gerhard and Oberthür, Simon and Patkar, Nitish}}, booktitle = {{Design, User Experience, and Usability: Theory and Practice}}, isbn = {{9783319917962}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{758--770}}, publisher = {{Springer International Publishing}}, title = {{{Assist Users to Straightaway Suggest and Describe Experienced Problems}}}, doi = {{10.1007/978-3-319-91797-9_52}}, volume = {{10918}}, year = {{2018}}, } @inbook{6254, author = {{Fischer, Holger Gerhard and Senft, Björn and Rittmeier, Florian and Sauer, Stefan}}, booktitle = {{Design, User Experience, and Usability: Theory and Practice. Proceedings of the 20th International Conference on Human-Computer Interaktion (HCI International 2018)}}, editor = {{Marcus, Aaron and Wang, Wentao}}, isbn = {{9783319917962}}, issn = {{0302-9743}}, location = {{Las Vegas, USA}}, pages = {{711--724}}, publisher = {{Springer International Publishing}}, title = {{{A Canvas Method to Foster Interdisciplinary Discussions on Digital Assistance Systems}}}, doi = {{10.1007/978-3-319-91797-9_49}}, volume = {{10918}}, year = {{2018}}, } @inbook{6423, author = {{Schäfer, Dirk and Hüllermeier, Eyke}}, booktitle = {{Discovery Science}}, isbn = {{9783030017705}}, issn = {{0302-9743}}, pages = {{161--175}}, publisher = {{Springer International Publishing}}, title = {{{Preference-Based Reinforcement Learning Using Dyad Ranking}}}, doi = {{10.1007/978-3-030-01771-2_11}}, year = {{2018}}, } @inbook{16392, author = {{Feldkord, Björn and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications}}, isbn = {{9783319125671}}, issn = {{0302-9743}}, title = {{{A Dynamic Distributed Data Structure for Top-k and k-Select Queries}}}, doi = {{10.1007/978-3-319-98355-4_18}}, year = {{2018}}, } @inproceedings{24398, abstract = {{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.}}, author = {{Khaluf, Yara and Markarian, Christine and Simoens, Pieter and Reina, Andreagiovanni}}, booktitle = {{International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2017)}}, issn = {{0302-9743}}, title = {{{Scheduling Access to Shared Space in Multi-robot Systems}}}, doi = {{10.1007/978-3-319-59930-4_12}}, year = {{2017}}, } @inproceedings{2967, author = {{Blömer, Johannes and Liske, Gennadij}}, booktitle = {{Proceedings of the International Conference of Mathematical Aspects of Computer and Information Sciences (MACIS)}}, isbn = {{9783319724522}}, issn = {{0302-9743}}, pages = {{438--453}}, publisher = {{Springer International Publishing}}, title = {{{Subtleties in Security Definitions for Predicate Encryption with Public Index}}}, doi = {{10.1007/978-3-319-72453-9_35}}, volume = {{10693}}, year = {{2017}}, } @inproceedings{2344, author = {{Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils}}, booktitle = {{Foundations and Practice of Security}}, isbn = {{9783319756493}}, issn = {{0302-9743}}, pages = {{3--17}}, publisher = {{Springer International Publishing}}, title = {{{Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}}}, doi = {{10.1007/978-3-319-75650-9_1}}, year = {{2017}}, } @inbook{2381, abstract = {{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.}}, author = {{Brauer, Sascha}}, booktitle = {{Lecture Notes in Computer Science}}, editor = {{Fotakis, Dimitris and Pagourtzis, Aris and Paschos, Vangelis Th.}}, isbn = {{9783319575858}}, issn = {{0302-9743}}, location = {{Athens, Greece}}, pages = {{116--127}}, publisher = {{Springer International Publishing}}, title = {{{Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems}}}, doi = {{10.1007/978-3-319-57586-5_11}}, volume = {{10236}}, year = {{2017}}, }