@inproceedings{14826,
  abstract     = {{In this paper, we present Hitachi and Paderborn University’s joint effort for automatic speech recognition (ASR) in a dinner party scenario. The main challenges of ASR systems for dinner party recordings obtained by multiple microphone arrays are (1) heavy speech overlaps, (2) severe noise and reverberation, (3) very natural onversational content, and possibly (4) insufficient training data. As an example of a dinner party scenario, we have chosen the data presented during the CHiME-5 speech recognition challenge, where the baseline ASR had a 73.3% word error rate (WER), and even the best performing system at the CHiME-5 challenge had a 46.1% WER. We extensively investigated a combination of the guided source separation-based speech enhancement technique and an already proposed strong ASR backend and found that a tight combination of these techniques provided substantial accuracy improvements. Our final system achieved WERs of 39.94% and 41.64% for the development and evaluation data, respectively, both of which are the best published results for the dataset. We also investigated with additional training data on the official small data in the CHiME-5 corpus to assess the intrinsic difficulty of this ASR task.}},
  author       = {{Kanda, Naoyuki and Boeddeker, Christoph and Heitkaemper, Jens and Fujita, Yusuke and Horiguchi, Shota and Haeb-Umbach, Reinhold}},
  booktitle    = {{INTERSPEECH 2019, Graz, Austria}},
  title        = {{{Guided Source Separation Meets a Strong ASR Backend: Hitachi/Paderborn University Joint Investigation for Dinner Party ASR}}},
  year         = {{2019}},
}

@proceedings{14829,
  editor       = {{Scheideler, Christian and Berenbrink, Petra}},
  isbn         = {{978-1-4503-6184-2}},
  publisher    = {{ACM}},
  title        = {{{The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019}}},
  doi          = {{10.1145/3323165}},
  year         = {{2019}},
}

@article{15002,
  abstract     = {{Many problem settings in machine learning are concerned with the simultaneous prediction of multiple target variables of diverse type. Amongst others, such problem settings arise in multivariate regression, multi-label classification, multi-task learning, dyadic prediction, zero-shot learning, network inference, and matrix completion. These subfields of machine learning are typically studied in isolation, without highlighting or exploring important relationships. In this paper, we present a unifying view on what we call multi-target prediction (MTP) problems and methods. First, we formally discuss commonalities and differences between existing MTP problems. To this end, we introduce a general framework that covers the above subfields as special cases. As a second contribution, we provide a structured overview of MTP methods. This is accomplished by identifying a number of key properties, which distinguish such methods and determine their suitability for different types of problems. Finally, we also discuss a few challenges for future research.}},
  author       = {{Waegeman, Willem and Dembczynski, Krzysztof and Hüllermeier, Eyke}},
  issn         = {{1573-756X}},
  journal      = {{Data Mining and Knowledge Discovery}},
  number       = {{2}},
  pages        = {{293--324}},
  title        = {{{Multi-target prediction: a unifying view on problems and methods}}},
  doi          = {{10.1007/s10618-018-0595-5}},
  volume       = {{33}},
  year         = {{2019}},
}

@inproceedings{15003,
  author       = {{Mortier, Thomas and Wydmuch, Marek and Dembczynski, Krzysztof and Hüllermeier, Eyke and Waegeman, Willem}},
  booktitle    = {{Proceedings of the 31st Benelux Conference on Artificial Intelligence {(BNAIC} 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), Brussels, Belgium, November 6-8, 2019}},
  title        = {{{Set-Valued Prediction in Multi-Class Classification}}},
  year         = {{2019}},
}

@article{15028,
  abstract     = {{Friction-spinning is an incremental forming process, which is accompanied by complex thermal and mechanical loads in the tool and the formed part. To influence the process temperature, two main process parameters, i.e. the rotation speed and the feed rate, can be adapted. With the objective to improve the tool performance and the quality of the workpiece, this study focuses on a coating concept for friction-spinning tools made of high speed steel (HS6 5 2C, 1.3343). On the one hand, atmospheric plasma sprayed (APS) Al2O3 and ZrO2-8Y2O3 coatings serve as a thermal insulator, and, on the other hand, physically vapor deposited (PVD) TiAlSi7.9N and CrAlSi7.5N films are applied to increase the hardness and wear resistance of the tools. In addition, duplex coatings, combining the APS and PVD technique, are synthesized to influence both the heat transfer and the tribological properties of friction-spinning tools.
Subsequently, all coated tools are tested in a friction-spinning process to form flanges made of AW-6060 (AlMgSi   3.3206) tube materials. The tool temperatures are determined in-situ to investigate the impact of the tool coating on the process temperature. Compared to an uncoated tool, the alumina and zirconia coatings contribute to a reduction of the tool temperature by up to half, while the PVD films increase the hardness of the tool by 20 GPa. Furthermore, it is shown that the surface quality of thermally sprayed (TS) or PVD coated tools is directly related to the surface roughness of the resulting workpiece.
}},
  author       = {{Tillmann, Wolfgang and Fehr, Alexander and Stangier, Dominic and Dildrop, Markus and Homberg, Werner and Lossen, Benjamin and Hijazi, Dina}},
  issn         = {{0944-6524}},
  journal      = {{Production Engineering}},
  pages        = {{449--457}},
  title        = {{{Al2O3/ZrO2-8Y2O3 and (Cr,Ti)AlSiN tool coatings to influence the temperature and surface quality in friction-spinning processes}}},
  doi          = {{10.1007/s11740-019-00899-y}},
  year         = {{2019}},
}

@phdthesis{15030,
  abstract     = {{Working-media-based forming processes (WMBF) represent a great potential regarding the production of complex sheet-metal lightweight components with excellent surface quality, shape accuracy and dimensional stability. The working-media-based forming processes characterize the sheet-metal forming process, where the sheet metal blank is formed during the forming process by means of a (quasi-)static or dynamic working media pressure into a contouring forming tool. Although the WMBF offers improved utilization of the formability of the used materials compared to conventional sheet metal forming processes, there are limits in the production of complex deeper or sharp edged components with (quasi-)static and dynamic WMBF processes, which can not be overcome by using these methods alone. In order to overcome this, multi-level WMBF process sequences for components with spherical and stepped geometries are developed in this work. Here the developed strategies combine the advantages of (quasi-)static and dynamic WMBF processes. Furthermore, based on analytical, experimental and numerical investigations, innovative process management strategies were derived, which completely compensate the local wall thickness changes, make better use of existing material resources and thus enable the safe production of mentioned geometries.}},
  author       = {{Djakow, Eugen}},
  keywords     = {{High Speed Forming}},
  pages        = {{188}},
  publisher    = {{Shaker}},
  title        = {{{Ein Beitrag zur kombinierten (quasi-)statischen und dynamischen Umformung von blechförmigen Halbzeugen}}},
  doi          = {{ISBN 978-3-8440-6723-1}},
  year         = {{2019}},
}

@inproceedings{15244,
  author       = {{Hagedorn, Oliver Ernst Caspar and Pielsticker, Daniel and Hemsel, Tobias and Sextro, Walter}},
  booktitle    = {{2. VDI-Fachtagung Schwingungen 2019}},
  isbn         = {{978-3-18-092366-6}},
  publisher    = {{VDI Verlag GmbH · Düsseldorf 2019}},
  title        = {{{Messung hochfrequenter In-Plane-Schwingungen mittels Laservibrometrie in räumlich eingeschränkten Umgebungen}}},
  year         = {{2019}},
}

@article{16217,
  author       = {{Fränzle, Martin and Kapur, Deepak and Wehrheim, Heike and Zhan, Naijun}},
  journal      = {{Formal Asp. Comput.}},
  number       = {{1}},
  pages        = {{1}},
  title        = {{{Editorial}}},
  doi          = {{10.1007/s00165-018-00477-6}},
  volume       = {{31}},
  year         = {{2019}},
}

@article{13873,
  author       = {{Feldkord, Björn and Meyer auf der Heide, Friedhelm}},
  journal      = {{ACM Transactions on Parallel Computing (TOPC)}},
  number       = {{3}},
  title        = {{{The Mobile Server Problem}}},
  doi          = {{10.1145/3364204}},
  volume       = {{6}},
  year         = {{2019}},
}

@inproceedings{13942,
  author       = {{Markarian, Christine and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 8th International Conference on Operations Research and Enterprise Systems}},
  pages        = {{315--321}},
  publisher    = {{SciTePress}},
  title        = {{{Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location}}},
  doi          = {{10.5220/0007369503150321}},
  year         = {{2019}},
}

@article{13946,
  author       = {{Abu-Khzam, Faisal N. and Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}},
  journal      = {{Theoretical Computer Science}},
  pages        = {{2--12}},
  title        = {{{Efficient parallel algorithms for parameterized problems}}},
  doi          = {{10.1016/j.tcs.2018.11.006}},
  volume       = {{786}},
  year         = {{2019}},
}

@inbook{13974,
  author       = {{Krimphove, Dieter}},
  booktitle    = {{Kommentar: MaComp - Mindestanforderungen an die Compliance-Funktion und die weiteren Verhaltens-, Organisations- und Transparenzpflichten nach §§ 63 ff. WpHG für Wertpapierdienstleistungsunternehmen}},
  editor       = {{Krimphove, Dieter and Kruse, Oliver}},
  pages        = {{64--68}},
  publisher    = {{C. H. Beck}},
  title        = {{{AT 5 der MaComp: Zusammenarbeit mehrere Wertpapierdienstleistungsunternehmen}}},
  year         = {{2019}},
}

@inbook{13976,
  author       = {{Krimphove, Dieter}},
  booktitle    = {{Kommentar: MaComp - Mindestanforderungen an die Compliance-Funktion und die weiteren Verhaltens-, Organisations- und Transparenzpflichten nach §§ 63 ff. WpHG für Wertpapierdienstleistungsunternehmen}},
  editor       = {{Krimphove, Dieter and Kruse, Oliver}},
  pages        = {{447--458}},
  publisher    = {{C. H. Beck}},
  title        = {{{BT 6 Zur Verfügungstellen der Geeignetheitserklärung: nach § 64 Abs. 4 WpHG}}},
  year         = {{2019}},
}

@inproceedings{14539,
  author       = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}},
  location     = {{L'Aquila, Italy}},
  pages        = {{345--348}},
  title        = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}},
  doi          = {{10.1007/978-3-030-24922-9\_26}},
  year         = {{2019}},
}

@inproceedings{13107,
  abstract     = {{In this paper, we first outline a Hypothetical Learning Trajectory (HLT), which aims at a formal understanding of the rules for manipulating integers. The HLT is based on task formats, which promote algebraic thinking in terms of generalizing rules from the analysis of patterns and should be familiar to students from their mathematics education experiences in elementary school. Second, we analyze two students' actual learning process based on Peircean semiotics. The analysis shows that the actual learning process diverges from the hypothesized learning process in that the students do not relate the different levels of the diagrams in a way that allows them to extrapolate the rule for the subtraction of negative numbers. Based on this finding, we point out consequences for the design of the tasks.}},
  author       = {{Schumacher, Jan and Rezat, Sebastian}},
  booktitle    = {{Proceedings of the Eleventh Congress of the European Society for Research in Mathematics Education (CERME11, February 6 – 10, 2019)}},
  editor       = {{Jankvist, Uffe Thomas and Van den Heuvel-Panhuizen, Marja and Veldhuis, Michiel}},
  keywords     = {{diagrammatic reasoning, hypothetical learning trajectory, induction extrapolatory method, integers, negative numbers, permanence principle, semiotics}},
  location     = {{Utrecht}},
  publisher    = {{Freudenthal Group & Freudenthal Institute, Utrecht University and ERME}},
  title        = {{{A Hypothetical Learning Trajectory for the Learning of the Rules for Manipulating Integers}}},
  year         = {{2019}},
}

@inproceedings{13182,
  abstract     = {{We consider congestion control in peer-to-peer distributed systems. 
The problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \emph{clients} in this paper) that want to send messages to a fixed common peer (called \emph{server} in this paper).
We assume that each client $v \in V$ sends a message with probability $p(v) \in [0,1)$ and the server has a capacity of $\sigma \in \mathbb{N}$, i.e., it can recieve at most $\sigma$ messages per round and excess messages are dropped.
The server can modify these probabilities when clients send messages.
Ideally, we wish to converge to a state with $\sum p(v) = \sigma$ and $p(v) = p(w)$ for all $v,w \in V$.	

We propose a \emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.   
Our protocol lets the system converge from \emph{any} initial state to a state where $\sum p(v) \in \left[\sigma \pm \epsilon\right]$ and $|p(v)-p(w)| \in O(\frac{1}{n})$. 
This property is then maintained for $\Omega(n^{\mathfrak{c}})$ rounds in expectation.
In particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.

Our protocol uses only $O(W + \log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.
Finally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).
}},
  author       = {{Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
  pages        = {{149--164}},
  publisher    = {{Springer, Cham}},
  title        = {{{A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}}},
  doi          = {{https://doi.org/10.1007/978-3-030-34992-9_13}},
  year         = {{2019}},
}

@article{13237,
  author       = {{Elgabarty, Hossam and Kaliannan, Naveen Kumar and Kühne, Thomas D.}},
  journal      = {{Scientific Reports}},
  pages        = {{10002}},
  title        = {{{Enhancement of the asymmetry in the hydrogen bond network of liquid water by an ultrafast electric field pulse}}},
  doi          = {{10.1038/s41598-019-46449-5}},
  volume       = {{ 9}},
  year         = {{2019}},
}

@inproceedings{13250,
  author       = {{Ansótegui, Carlos and Heymann, Britta and Pon, Josep and Sellmann, Meinolf and Tierney, Kevin}},
  booktitle    = {{Learning and Intelligent Optimization}},
  isbn         = {{978-3-030-05347-5}},
  pages        = {{309--325}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Hyper-Reactive Tabu Search for MaxSAT}}},
  doi          = {{10.1007/978-3-030-05348-2_27}},
  year         = {{2019}},
}

@inproceedings{13261,
  author       = {{Wolters, Dennis and Kirchhoff, Jonas and Engels, Gregor}},
  booktitle    = {{Service-Oriented Computing – ICSOC 2019 Workshops}},
  editor       = {{Yangui, Sami and Bouguettaya, Athman and Xue, Xiao and Faci, Noura and Gaaloul, Walid and Yu, Qi and Zhou, Zhangbing and Hernandez, Nathalie and Nakagawa, Elisa Y.}},
  pages        = {{30--41}},
  publisher    = {{Springer}},
  title        = {{{Specifying Web Interfaces for Command-line Applications Based on OpenAPI}}},
  doi          = {{10.1007/978-3-030-45989-5\_3}},
  volume       = {{12019}},
  year         = {{2019}},
}

@article{10011,
  author       = {{Fränzle, Martin and Kapur, Deepak and Wehrheim, Heike and Zhan, Naijun}},
  journal      = {{Formal Asp. Comput.}},
  number       = {{1}},
  pages        = {{1}},
  title        = {{{Editorial}}},
  doi          = {{10.1007/s00165-018-00477-6}},
  volume       = {{31}},
  year         = {{2019}},
}