@inproceedings{6976, abstract = {{We investigate the maintenance of overlay networks under massive churn, i.e. nodes joining and leaving the network. We assume an adversary that may churn a constant fraction $\alpha n$ of nodes over the course of $\mathcal{O}(\log n)$ rounds. In particular, the adversary has an almost up-to-date information of the network topology as it can observe an only slightly outdated topology that is at least $2$ rounds old. Other than that, we only have the provably minimal restriction that new nodes can only join the network via nodes that have taken part in the network for at least one round. Our contributions are as follows: First, we show that it is impossible to maintain a connected topology if adversary has up-to-date information about the nodes' connections. Further, we show that our restriction concerning the join is also necessary. As our main result present an algorithm that constructs a new overlay- completely independent of all previous overlays - every $2$ rounds. Furthermore, each node sends and receives only $\mathcal{O}(\log^3 n)$ messages each round. As part of our solution we propose the Linearized DeBruijn Swarm (LDS), a highly churn resistant overlay, which will be maintained by the algorithm. However, our approaches can be transferred to a variety of classical P2P Topologies where nodes are mapped into the $[0,1)$-interval.}}, author = {{Götte, Thorsten and Vijayalakshmi, Vipin Ravindran and Scheideler, Christian}}, booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}}, location = {{Rio de Janeiro, Brazil}}, publisher = {{IEEE}}, title = {{{Always be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-date Adversary}}}, year = {{2019}}, } @article{16709, author = {{Sahai, Tuhin and Ziessler, Adrian and Klus, Stefan and Dellnitz, Michael}}, issn = {{0924-090X}}, journal = {{Nonlinear Dynamics}}, title = {{{Continuous relaxations for the traveling salesman problem}}}, doi = {{10.1007/s11071-019-05092-5}}, year = {{2019}}, } @unpublished{16853, abstract = {{State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing.}}, author = {{Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}}, booktitle = {{Fourth Workshop on Approximate Computing (AxC 2019)}}, keywords = {{Approximate computing, parameter selection, search space exploration, verification, circuit synthesis}}, pages = {{2}}, title = {{{Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}}}, year = {{2019}}, } @inproceedings{10577, abstract = {{State-of-the-art frameworks for generating approximate circuits automatically explore the search space in an iterative process - often greedily. Synthesis and verification processes are invoked in each iteration to evaluate the found solutions and to guide the search algorithm. As a result, a large number of approximate circuits is subjected to analysis - leading to long runtimes - but only a few approximate circuits might form an acceptable solution. In this paper, we present our Jump Search (JS) method which seeks to reduce the runtime of an approximation process by reducing the number of expensive synthesis and verification steps. To reduce the runtime, JS computes impact factors for each approximation candidate in the circuit to create a selection of approximate circuits without invoking synthesis or verification processes. We denote the selection as path from which JS determines the final solution. In our experimental results, JS achieved speed-ups of up to 57x while area savings remain comparable to the reference search method, Simulated Annealing.}}, author = {{Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}}, booktitle = {{Proceedings of the 2019 on Great Lakes Symposium on VLSI - GLSVLSI '19}}, isbn = {{9781450362528}}, keywords = {{Approximate computing, design automation, parameter selection, circuit synthesis}}, location = {{Tysons Corner, VA, USA}}, publisher = {{ACM}}, title = {{{Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}}}, doi = {{10.1145/3299874.3317998}}, year = {{2019}}, } @article{10578, author = {{Tagne, V. K. and Fotso, S. and Fono, L. A. and Hüllermeier, Eyke}}, journal = {{New Mathematics and Natural Computation}}, number = {{2}}, pages = {{191--213}}, title = {{{Choice Functions Generated by Mallows and Plackett–Luce Relations}}}, volume = {{15}}, year = {{2019}}, } @inproceedings{10586, abstract = {{We consider the problem of transforming a given graph G_s into a desired graph G_t by applying a minimum number of primitives from a particular set of local graph transformation primitives. These primitives are local in the sense that each node can apply them based on local knowledge and by affecting only its 1-neighborhood. Although the specific set of primitives we consider makes it possible to transform any (weakly) connected graph into any other (weakly) connected graph consisting of the same nodes, they cannot disconnect the graph or introduce new nodes into the graph, making them ideal in the context of supervised overlay network transformations. We prove that computing a minimum sequence of primitive applications (even centralized) for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set of local graph transformation primitives satisfying the aforementioned properties. On the other hand, we show that this problem admits a polynomial time algorithm with a constant approximation ratio.}}, author = {{Scheideler, Christian and Setzer, Alexander}}, booktitle = {{Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}}, keywords = {{Graphs transformations, NP-hardness, approximation algorithms}}, location = {{Patras, Greece}}, pages = {{150:1----150:14}}, publisher = {{Dagstuhl Publishing}}, title = {{{On the Complexity of Local Graph Transformations}}}, doi = {{10.4230/LIPICS.ICALP.2019.150}}, volume = {{132}}, year = {{2019}}, } @article{10593, abstract = {{We present a new framework for optimal and feedback control of PDEs using Koopman operator-based reduced order models (K-ROMs). The Koopman operator is a linear but infinite-dimensional operator which describes the dynamics of observables. A numerical approximation of the Koopman operator therefore yields a linear system for the observation of an autonomous dynamical system. In our approach, by introducing a finite number of constant controls, the dynamic control system is transformed into a set of autonomous systems and the corresponding optimal control problem into a switching time optimization problem. This allows us to replace each of these systems by a K-ROM which can be solved orders of magnitude faster. By this approach, a nonlinear infinite-dimensional control problem is transformed into a low-dimensional linear problem. Using a recent convergence result for the numerical approximation via Extended Dynamic Mode Decomposition (EDMD), we show that the value of the K-ROM based objective function converges in measure to the value of the full objective function. To illustrate the results, we consider the 1D Burgers equation and the 2D Navier–Stokes equations. The numerical experiments show remarkable performance concerning both solution times and accuracy.}}, author = {{Peitz, Sebastian and Klus, Stefan}}, issn = {{0005-1098}}, journal = {{Automatica}}, pages = {{184--191}}, title = {{{Koopman operator-based model reduction for switched-system control of PDEs}}}, doi = {{10.1016/j.automatica.2019.05.016}}, volume = {{106}}, year = {{2019}}, } @article{10595, abstract = {{In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems where only a subset of the set of objective functions is taken into account. If the Pareto critical set is completely described by its boundary (e.g., if we have more objective functions than dimensions in decision space), then this can be used to efficiently solve the MOP by solving a number of MOPs with fewer objective functions. If this is not the case, the results can still give insight into the structure of the Pareto critical set.}}, author = {{Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}}, issn = {{0925-5001}}, journal = {{Journal of Global Optimization}}, number = {{4}}, pages = {{891--913}}, title = {{{On the hierarchical structure of Pareto critical sets}}}, doi = {{10.1007/s10898-019-00737-6}}, volume = {{73}}, year = {{2019}}, } @inproceedings{10597, abstract = {{In comparison to classical control approaches in the field of electrical drives like the field-oriented control (FOC), model predictive control (MPC) approaches are able to provide a higher control performance. This refers to shorter settling times, lower overshoots, and a better decoupling of control variables in case of multi-variable controls. However, this can only be achieved if the used prediction model covers the actual behavior of the plant sufficiently well. In case of model deviations, the performance utilizing MPC remains below its potential. This results in effects like increased current ripple or steady state setpoint deviations. In order to achieve a high control performance, it is therefore necessary to adapt the model to the real plant behavior. When using an online system identification, a less accurate model is sufficient for commissioning of the drive system. In this paper, the combination of a finite-control-set MPC (FCS-MPC) with a system identification is proposed. The method does not require high-frequency signal injection, but uses the measured values already required for the FCS-MPC. An evaluation of the least squares-based identification on a laboratory test bench showed that the model accuracy and thus the control performance could be improved by an online update of the prediction models.}}, author = {{Hanke, Soren and Peitz, Sebastian and Wallscheid, Oliver and Böcker, Joachim and Dellnitz, Michael}}, booktitle = {{2019 IEEE International Symposium on Predictive Control of Electrical Drives and Power Electronics (PRECEDE)}}, isbn = {{9781538694145}}, title = {{{Finite-Control-Set Model Predictive Control for a Permanent Magnet Synchronous Motor Application with Online Least Squares System Identification}}}, doi = {{10.1109/precede.2019.8753313}}, year = {{2019}}, } @inproceedings{11709, author = {{Potthast, Martin and Gienapp, Lukas and Euchner, Florian and Heilenkötter, Nick and Weidmann, Nico and Wachsmuth, Henning and Stein, Benno and Hagen, Matthias}}, booktitle = {{42nd International ACM Conference on Research and Development in Information Retrieval (SIGIR 2019)}}, pages = {{1117 -- 1120}}, publisher = {{ACM}}, title = {{{Argument Search: Assessing Argument Relevance}}}, doi = {{10.1145/3331184.3331327}}, year = {{2019}}, } @misc{11713, author = {{Wachsmuth, Henning}}, booktitle = {{Computational Linguistics}}, number = {{3}}, pages = {{603 -- 606}}, publisher = {{ACL}}, title = {{{Book Review: Argumentation Mining}}}, volume = {{45}}, year = {{2019}}, } @inproceedings{11714, author = {{Ajjour, Yamen and Wachsmuth, Henning and Kiesel, Johannes and Potthast, Martin and Hagen, Matthias and Stein, Benno}}, booktitle = {{Proceedings of the 42nd Edition of the German Conference on Artificial Intelligence}}, pages = {{48--59}}, title = {{{Data Acquisition for Argument Search: The args.me Corpus}}}, year = {{2019}}, } @article{11950, abstract = {{Advances in electromyographic (EMG) sensor technology and machine learning algorithms have led to an increased research effort into high density EMG-based pattern recognition methods for prosthesis control. With the goal set on an autonomous multi-movement prosthesis capable of performing training and classification of an amputee’s EMG signals, the focus of this paper lies in the acceleration of the embedded signal processing chain. We present two Xilinx Zynq-based architectures for accelerating two inherently different high density EMG-based control algorithms. The first hardware accelerated design achieves speed-ups of up to 4.8 over the software-only solution, allowing for a processing delay lower than the sample period of 1 ms. The second system achieved a speed-up of 5.5 over the software-only version and operates at a still satisfactory low processing delay of up to 15 ms while providing a higher reliability and robustness against electrode shift and noisy channels.}}, author = {{Boschmann, Alexander and Agne, Andreas and Thombansen, Georg and Witschen, Linus Matthias and Kraus, Florian and Platzner, Marco}}, issn = {{0743-7315}}, journal = {{Journal of Parallel and Distributed Computing}}, keywords = {{High density electromyography, FPGA acceleration, Medical signal processing, Pattern recognition, Prosthetics}}, pages = {{77--89}}, publisher = {{Elsevier}}, title = {{{Zynq-based acceleration of robust high density myoelectric signal processing}}}, doi = {{10.1016/j.jpdc.2018.07.004}}, volume = {{123}}, year = {{2019}}, } @inbook{11952, author = {{Senft, Björn and Rittmeier, Florian and Fischer, Holger Gerhard and Oberthür, Simon}}, booktitle = {{Design, User Experience, and Usability. Practice and Case Studies}}, isbn = {{9783030235345}}, issn = {{0302-9743}}, location = {{Orlando, FL, USA}}, title = {{{A Value-Centered Approach for Unique and Novel Software Applications}}}, doi = {{10.1007/978-3-030-23535-2_27}}, year = {{2019}}, } @inproceedings{11965, abstract = {{We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of degraded input and clean training targets. Thus, training can be carried out on real recordings of noisy speech rather than simulated ones. In contrast to previous work on unsupervised training of neural mask estimators, our approach avoids the need for a possibly pre-trained teacher model entirely. We demonstrate the effectiveness of our approach by speech recognition experiments on two different datasets: one mainly deteriorated by noise (CHiME 4) and one by reverberation (REVERB). The results show that the performance of the proposed system is on par with a supervised system using oracle target masks for training and with a system trained using a model-based teacher.}}, author = {{Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}}, booktitle = {{INTERSPEECH 2019, Graz, Austria}}, title = {{{Unsupervised training of neural mask-based beamforming}}}, year = {{2019}}, } @inproceedings{11985, author = {{Bronner, Fabian and Sommer, Christoph}}, booktitle = {{2018 IEEE Vehicular Networking Conference (VNC)}}, isbn = {{9781538694282}}, title = {{{Efficient Multi-Channel Simulation of Wireless Communications}}}, doi = {{10.1109/vnc.2018.8628350}}, year = {{2019}}, } @inbook{12043, author = {{Reinold, Peter and Meyer, Norbert and Buse, Dominik and Klingler, Florian and Sommer, Christoph and Dressler, Falko and Eisenbarth, Markus and Andert, Jakob}}, booktitle = {{Proceedings}}, isbn = {{9783658252939}}, issn = {{2198-7432}}, title = {{{Verkehrssimulation im Hardware-in-the-Loop-Steuergerätetest}}}, doi = {{10.1007/978-3-658-25294-6_15}}, year = {{2019}}, } @inbook{12072, author = {{Sommer, Christoph and Eckhoff, David and Brummer, Alexander and Buse, Dominik S. and Hagenauer, Florian and Joerer, Stefan and Segata, Michele}}, booktitle = {{Recent Advances in Network Simulation}}, isbn = {{9783030128418}}, issn = {{2522-8595}}, title = {{{Veins: The Open Source Vehicular Network Simulation Framework}}}, doi = {{10.1007/978-3-030-12842-5_6}}, year = {{2019}}, } @inproceedings{12076, author = {{Yigitbas, Enes and Heindörfer, Joshua and Engels, Gregor}}, booktitle = {{Proceedings of the Mensch und Computer 2019 (MuC ’19)}}, pages = {{885----888}}, publisher = {{ACM}}, title = {{{A Context-aware Virtual Reality First Aid Training Application}}}, year = {{2019}}, } @inproceedings{12870, author = {{Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)}}, pages = {{120 -- 137}}, publisher = {{Springer}}, title = {{{Managing Multiple Mobile Resources}}}, doi = {{10.1007/978-3-030-39479-0_9}}, year = {{2019}}, }