@article{20, abstract = {{Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we demonstrate its suitability to a problem from scientific computing. Utilizing the self-correcting behavior of iterative algorithms, we show that approximate computing can be applied to the calculation of inverse matrix p-th roots which are required in many applications in scientific computing. Results show great opportunities to reduce the computational effort and bandwidth required for the execution of the discussed algorithm, especially when targeting special accelerator hardware.}}, author = {{Lass, Michael and Kühne, Thomas and Plessl, Christian}}, issn = {{1943-0671}}, journal = {{Embedded Systems Letters}}, number = {{2}}, pages = {{ 33--36}}, publisher = {{IEEE}}, title = {{{Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots}}}, doi = {{10.1109/LES.2017.2760923}}, volume = {{10}}, year = {{2018}}, } @inproceedings{20188, author = {{Habernal, Ivan and Wachsmuth, Henning and Gurevych, Iryna and Stein, Benno}}, booktitle = {{Proceedings of the 16th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies}}, pages = {{1930–1940}}, title = {{{The Argument Reasoning Comprehension Task: Identification and Reconstruction of Implicit Warrants}}}, year = {{2018}}, } @inproceedings{2831, abstract = {{We consider a market where final products or services are compositions of a number of basic services. Users are asked to evaluate the quality of the composed product after purchase. The quality of the basic service influences the performance of the composed services but cannot be observed directly. The question we pose is whether it is possible to use user evaluations on composed services to assess the quality of basic services. We discuss how to combine aggregation of evaluations across users and disaggregation of information on composed services to derive valuations for the single components. As a solution we propose to use the (weighted) average as aggregation device in connection with the Shapley value as disaggregation method, since this combination fulfills natural requirements in our context. In addition, we address some occurring computational issues: We give an approximate solution concept using only a limited number of evaluations which guarantees nearly optimal results with reduced running time. Lastly, we show that a slightly modified Shapley value and the weighted average are still applicable if the evaluation profiles are incomplete.}}, author = {{Feldotto, Matthias and Haake, Claus-Jochen and Skopalik, Alexander and Stroh-Maraun, Nadja}}, booktitle = {{Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018)}}, isbn = {{978-1-4503-5916-0}}, location = {{Irvine, California, USA}}, pages = {{5:1--5:6}}, title = {{{Disaggregating User Evaluations Using the Shapley Value}}}, doi = {{10.1145/3230654.3230659}}, year = {{2018}}, } @article{2848, author = {{Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm}}, journal = {{Algorithmica}}, number = {{5}}, pages = {{1556–1574}}, publisher = {{Springer}}, title = {{{Towards Flexible Demands in Online Leasing Problems. }}}, doi = {{10.1007/s00453-018-0420-y}}, volume = {{80}}, year = {{2018}}, } @article{2849, author = {{Abu-Khzam, Faisal N. and Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}}, journal = {{Theory of Computing Systems}}, publisher = {{Springer}}, title = {{{Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks}}}, doi = {{10.1007/s00224-017-9836-z}}, year = {{2018}}, } @inproceedings{2850, author = {{Hamann, Heiko and Markarian, Christine and Meyer auf der Heide, Friedhelm and Wahby, Mostafa}}, booktitle = {{Ninth International Conference on Fun with Algorithms (FUN)}}, title = {{{Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets}}}, doi = {{10.4230/LIPIcs.FUN.2018.22}}, year = {{2018}}, } @inproceedings{2857, author = {{Mohr, Felix and Lettmann, Theodor and Hüllermeier, Eyke and Wever, Marcel Dominik}}, booktitle = {{Proceedings of the 1st ICAPS Workshop on Hierarchical Planning}}, location = {{Delft, Netherlands}}, pages = {{31--39}}, publisher = {{AAAI}}, title = {{{Programmatic Task Network Planning}}}, year = {{2018}}, } @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}}, } @article{24150, author = {{Ramaswamy, Arunselvan and Bhatnagar, Shalabh}}, journal = {{IEEE Transactions on Automatic Control}}, number = {{6}}, pages = {{2614--2620}}, publisher = {{IEEE}}, title = {{{Stability of stochastic approximations with “controlled markov” noise and temporal difference learning}}}, volume = {{64}}, year = {{2018}}, } @article{24151, author = {{Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel E and Karl, Holger}}, journal = {{IEEE Control Systems Letters}}, number = {{4}}, pages = {{737--742}}, publisher = {{IEEE}}, title = {{{Deepcas: A deep reinforcement learning algorithm for control-aware scheduling}}}, volume = {{2}}, 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{2471, author = {{Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke}}, booktitle = {{SCC}}, location = {{San Francisco, CA, USA}}, publisher = {{IEEE Computer Society}}, title = {{{On-The-Fly Service Construction with Prototypes}}}, doi = {{10.1109/SCC.2018.00036}}, year = {{2018}}, } @inproceedings{2472, author = {{Auroux, Sébastien and Karl, Holger}}, publisher = {{Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}}, title = {{{Distributed Placement of Virtualized Control Applications in Mobile Backhaul Networks}}}, doi = {{ 10.1109/WCNC.2018.8377335}}, year = {{2018}}, } @inproceedings{26421, author = {{Winkelnkemper, Felix and Keil, Reinhard}}, booktitle = {{Proceedings of EdMedia: World Conference on Educational Media and Technology.}}, editor = {{Bastiaens, T and Van Braak, J and Brown, M}}, pages = {{2397--2406}}, title = {{{MediaThing – A Learning Scenario Targeting on Research Skills}}}, year = {{2018}}, } @inproceedings{26422, author = {{Seng, E.-M and Keil, Reinhard and Oevel, Gudrun}}, editor = {{Seng, E.-M and Keil, Reinhard and Oevel, G}}, pages = {{1--5}}, publisher = {{De Gruyter}}, title = {{{studiolo communis}}}, year = {{2018}}, } @inproceedings{26423, author = {{Keil, Reinhard}}, editor = {{Seng, E.-M and Keil, Reinhard and Oevel, G}}, publisher = {{De Gruyter}}, title = {{{Unterst{\"u}tzung kontingenter Wissensarbeit. Ein Rahmenwerk f{\"u}r die Entwicklung digitaler Arbeitsumgebungen zur Unterst{\"u}tzung des Forschungsdiskurses in den Kulturwissenschaften}}}, year = {{2018}}, } @book{26424, author = {{Seng, E.-M and Keil, Reinhard and Oevel, Gudrun}}, publisher = {{De Gruyter}}, title = {{{STUDIOLO. Kooperative Forschungsumgebungen in den eHumanities}}}, year = {{2018}}, } @inproceedings{26425, author = {{Selke, Harald}}, editor = {{Biehler, R and Budde, L and Frischemeier, D and Heinemann, B and Podworny, S and Schulte, Carsten and Wassong, T}}, pages = {{107--109}}, publisher = {{Universit{\"a}tsbibliothek Paderborn}}, title = {{{Data science in schools from the perspective of contextual informatics}}}, year = {{2018}}, } @article{2685, author = {{Blömer, Johannes and Kohn, Kathlén}}, issn = {{2470-6566}}, journal = {{SIAM Journal on Applied Algebra and Geometry.}}, number = {{2}}, pages = {{314--338}}, title = {{{Voronoi Cells of Lattices with Respect to Arbitrary Norms}}}, doi = {{10.1137/17M1132045}}, volume = {{2}}, year = {{2018}}, } @inproceedings{3217, author = {{Demirel, Burak and Ramaswamy, Arunselvan and Quevedo, Daniel and Karl, Holger}}, title = {{{DeepCAS: A Deep Reinforcement Learning Algorithm for Control-Aware Scheduling}}}, doi = {{10.1109/LCSYS.2018.2847721}}, year = {{2018}}, }