@book{19054, editor = {{Eke, Norbert Otto and Elit, Stefan}}, pages = {{540}}, publisher = {{de Gruyter}}, title = {{{Grundthemen der Literaturwissenschaft: Literarische Institutionen}}}, year = {{2019}}, } @inbook{19154, author = {{Eke, Norbert Otto}}, booktitle = {{Werner Fritsch: Faust Sonnengesang II und III. Materialien}}, pages = {{25--42}}, publisher = {{filmedition suhrkamp (DVD)}}, title = {{{Die Explosion der Bilder im Kopf oder: „Les beaux livres sont écrits dans une sorte de langue étrangère.“}}}, year = {{2019}}, } @inbook{19157, author = {{Eke, Norbert Otto}}, booktitle = {{Davidfigur und Opfermotiv – Jüdisch-christliche Transformationen}}, editor = {{Eke, Norbert Otto and Strotmann, Angelika}}, pages = {{261--278}}, publisher = {{Schöningh}}, title = {{{„Es ist nur eine Probe.“ George Taboris ‚musikalisches Opfer‘ „Die Goldberg-Variationen“}}}, year = {{2019}}, } @inbook{19158, author = {{Eke, Norbert Otto and Strotmann, Angelika}}, booktitle = {{Davidfigur und Opfermotiv – Jüdisch-christliche Transformationen}}, editor = {{Eke, Norbert Otto and Strotmann, Angelika}}, pages = {{1--8}}, publisher = {{Schöningh}}, title = {{{Davidfigur und Opfermotiv – Jüdisch-christliche Transformationen biblischer Texte}}}, year = {{2019}}, } @inbook{19159, author = {{Eke, Norbert Otto and Elit, Stefan}}, booktitle = {{Grundthemen der Literaturwissenschaft: Literarische Institutionen}}, editor = {{Eke, Norbert Otto and Elit, Stefan}}, pages = {{3--17}}, publisher = {{de Gruyter}}, title = {{{Literarische Institutionen}}}, year = {{2019}}, } @inbook{19160, author = {{Eke, Norbert Otto}}, booktitle = {{Grundthemen der Literaturwissenschaft: Literarische Institutionen}}, editor = {{Eke, Norbert Otto and Elit, Stefan}}, pages = {{60--107}}, publisher = {{de Gruyter}}, title = {{{Historischer Abriss: Aufklärung bis Gegenwart}}}, year = {{2019}}, } @inbook{19162, abstract = {{Erscheinungsjahr in Klammern: 2018}}, author = {{Eke, Norbert Otto}}, booktitle = {{Zersetzung. Automatismen und Strukturauflösung}}, editor = {{Eke, Norbert Otto and Hohlweck, Patrick}}, pages = {{205--222}}, publisher = {{Fink/Brill}}, title = {{{Zersetzung(en) dramatischer Ordnung: Marlene Streeruwitz und Rainald Goetz}}}, year = {{2019}}, } @inbook{19163, abstract = {{Erscheinungsjahr in Klammern: 2018}}, author = {{Eke, Norbert Otto and Hohlweck, Patrick}}, booktitle = {{Zersetzung. Automatismen und Strukturauflösung}}, editor = {{Eke, Norbert Otto and Hohlweck, Patrick}}, pages = {{9--14}}, publisher = {{Fink/Brill}}, title = {{{Zersetzung. Automatismen und Strukturauflösung}}}, year = {{2019}}, } @article{19392, author = {{Meschut, Gerson and Teutenberg, Dominik and Wünsche, Marc}}, issn = {{2192-2624}}, journal = {{ADHESION ADHESIVES&SEALANTS}}, pages = {{22--27}}, title = {{{A test concept for bonded steel/CFRP structures}}}, doi = {{10.1007/s35784-015-0533-5}}, year = {{2019}}, } @inproceedings{22748, author = {{Tekaat, Julian and Kharatyan, Aschot and Anacker, Harald and Dumitrescu, Roman}}, booktitle = {{Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019}}, location = {{Delft, Niederlande, 2019}}, title = {{{Potentials for the Integration of Design Thinking along Automotive Systems Engineering focusing Security and Safety}}}, year = {{2019}}, } @inproceedings{7636, abstract = {{Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults. However, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on. We are especially interested in searchability, i.e., the functionality that search messages for a specific node are answered successfully if a node exists in the network. In this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on. More precisely, once a search message from node u to another node v is successfully delivered, all future search messages from u to v succeed as well. We extend the existing research by focusing on skip graphs and present a solution for two scenarios: (i) the goal topology is a super graph of the perfect skip graph and (ii) the goal topology is exactly the perfect skip graph. }}, author = {{Luo, Linghui and Scheideler, Christian and Strothmann, Thim Frederik}}, booktitle = {{Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)}}, location = {{Rio de Janeiro, Brazil}}, title = {{{MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability}}}, year = {{2019}}, } @inproceedings{8534, abstract = {{We propose two protocols for distributed priority queues (denoted by 'heap' for simplicity in this paper) called SKEAP and SEAP. SKEAP realizes a distributed heap for a constant amount of priorities and SEAP one for an arbitrary amount. Both protocols build on an overlay, which induces an aggregation tree on which heap operations are aggregated in batches, ensuring that our protocols scale even for a high rate of incoming requests. As part of SEAP we provide a novel distributed protocol for the k-selection problem that runs in time O(log n) w.h.p. SKEAP guarantees sequential consistency for its heap operations, while SEAP guarantees serializability. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations. SKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages.}}, author = {{Feldmann, Michael and Scheideler, Christian}}, booktitle = {{Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, pages = {{287----296}}, publisher = {{ACM}}, title = {{{Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}}}, doi = {{10.1145/3323165.3323193}}, year = {{2019}}, } @inproceedings{8871, author = {{Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}}, booktitle = {{Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}}, pages = {{69----79}}, publisher = {{ACM}}, title = {{{Distributed Computation in Node-Capacitated Networks}}}, doi = {{10.1145/3323165.3323195}}, year = {{2019}}, } @inproceedings{9718, author = {{Johannesmann, Sarah and Webersen, Manuel and Düchting, Julia and Claes, Leander and Henning, Bernd}}, booktitle = {{45th Annual Review of Progress in Quantitative Nondestructive Evaluation }}, location = {{Burlington}}, title = {{{Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves}}}, doi = {{10.1063/1.5099742}}, volume = {{38}}, 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}}, } @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}}, } @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}}, } @inproceedings{15627, author = {{Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}}, booktitle = {{Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}}, isbn = {{9781611975994}}, pages = {{1280--1299}}, title = {{{Shortest Paths in a Hybrid Network Model}}}, doi = {{10.1137/1.9781611975994.78}}, year = {{2019}}, } @inproceedings{15816, abstract = {{Despite the strong modeling power of neural network acoustic models, speech enhancement has been shown to deliver additional word error rate improvements if multi-channel data is available. However, there has been a longstanding debate whether enhancement should also be carried out on the ASR training data. In an extensive experimental evaluation on the acoustically very challenging CHiME-5 dinner party data we show that: (i) cleaning up the training data can lead to substantial error rate reductions, and (ii) enhancement in training is advisable as long as enhancement in test is at least as strong as in training. This approach stands in contrast and delivers larger gains than the common strategy reported in the literature to augment the training database with additional artificially degraded speech. Together with an acoustic model topology consisting of initial CNN layers followed by factorized TDNN layers we achieve with 41.6% and 43.2% WER on the DEV and EVAL test sets, respectively, a new single-system state-of-the-art result on the CHiME-5 data. This is a 8% relative improvement compared to the best word error rate published so far for a speech recognizer without system combination.}}, author = {{Zorila, Catalin and Boeddeker, Christoph and Doddipatla, Rama and Haeb-Umbach, Reinhold}}, booktitle = {{ASRU 2019, Sentosa, Singapore}}, title = {{{An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription}}}, year = {{2019}}, } @article{14821, author = {{Seipelt, Agnes Regina}}, isbn = {{978-3-96233-182-5}}, journal = {{Weberiana}}, keywords = {{Weber, Wien, Zensur}}, pages = {{107–161}}, publisher = {{Allitera}}, title = {{{Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien}}}, volume = {{29}}, year = {{2019}}, }