@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}}, } @article{22653, abstract = {{

Merging of bridging staples with adjacent oligonucleotide sequences leads to a moderate increase of DNA origami stability, while enzymatic ligation after assembly yields a reinforced nanostructure with superior stability at up to 37 °C and in the presence of 6 M urea.

}}, author = {{Ramakrishnan, Saminathan and Schärfen, Leonard and Hunold, Kristin and Fricke, Sebastian and Grundmeier, Guido and Schlierf, Michael and Keller, Adrian and Krainer, Georg}}, issn = {{2040-3364}}, journal = {{Nanoscale}}, pages = {{16270--16276}}, title = {{{Enhancing the stability of DNA origami nanostructures: staple strand redesign versus enzymatic ligation}}}, doi = {{10.1039/c9nr04460d}}, volume = {{11}}, 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{9275, abstract = {{In the last years, store-oriented software ecosystems are gaining more and more attention from a business perspective. In these ecosystems, third-party developers upload extensions to a store which can be downloaded by end users. While the functional scope of such ecosystems is relatively similar, the underlying business models differ greatly in and between their different product domains (e.g. Mobile Phone, Smart TV). This variability, in turn, makes it challenging for store providers to find a business model that fits their own needs. To handle this variability, we introduce the Business Variability Model (BVM) for modeling business model decisions. The basis of these decisions is the analysis of 60 store-oriented software ecosystems in eight different product domains. We map their business model decisions to the Business Model Canvas, condense them to a variability model and discuss particular variants and their dependencies. Our work provides store providers a new approach for modeling business model decisions together with insights of existing business models. This, in turn, supports them in creating new and improving existing business models.}}, author = {{Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}}, booktitle = {{Business Modeling and Software Design}}, editor = {{Shishkov, Boris}}, keywords = {{Software Ecosystems, Business Models, Variabilities}}, location = {{Lisbon}}, pages = {{153--169}}, publisher = {{Springer International Publishing}}, title = {{{Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach}}}, doi = {{10.1007/978-3-030-24854-3_10}}, 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{8529, author = {{Seemann, Nina and Merten, Marie-Luis}}, booktitle = {{DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}}, editor = {{Sahle, Patrick}}, isbn = {{978-3-00-062166-6}}, location = {{Mainz and Frankfurt am Main, Germany}}, pages = {{352--353}}, publisher = {{Zenodo}}, title = {{{UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte}}}, doi = {{10.5281/ZENODO.2596094}}, year = {{2019}}, } @inproceedings{8532, author = {{Bäumer, Frederik Simon and Buff, Bianca and Geierhos, Michaela}}, booktitle = {{DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}}, editor = {{Sahle, Patrick}}, isbn = {{978-3-00-062166-6}}, location = {{Mainz and Frankfurt am Main, Germany}}, pages = {{192--193}}, publisher = {{Zenodo}}, title = {{{Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen}}}, doi = {{10.5281/zenodo.2596095}}, 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{6512, abstract = {{Scheduling problems are essential for decision making in many academic disciplines, including operations management, computer science, and information systems. Since many scheduling problems are NP-hard in the strong sense, there is only limited research on exact algorithms and how their efficiency scales when implemented on parallel computing architectures. We address this gap by (1) adapting an exact branch-and-price algorithm to a parallel machine scheduling problem on unrelated machines with sequence- and machine-dependent setup times, (2) parallelizing the adapted algorithm by implementing a distributed-memory parallelization with a master/worker approach, and (3) conducting extensive computational experiments using up to 960 MPI processes on a modern high performance computing cluster. With our experiments, we show that the efficiency of our parallelization approach can lead to superlinear speedup but can vary substantially between instances. We further show that the wall time of serial execution can be substantially reduced through our parallelization, in some cases from 94 hours to less than six minutes when our algorithm is executed on 960 processes.}}, author = {{Rauchecker, Gerhard and Schryen, Guido}}, journal = {{Computers & Operations Research}}, keywords = {{parallel machine scheduling with setup times, parallel branch-and-price algorithm, high performance computing, master/worker parallelization}}, number = {{104}}, pages = {{338--357}}, publisher = {{Elsevier}}, title = {{{Using High Performance Computing for Unrelated Parallel Machine Scheduling with Sequence-Dependent Setup Times: Development and Computational Evaluation of a Parallel Branch-and-Price Algorithm}}}, 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}}, } @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{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}}, } @article{12919, author = {{Georgi, Philip and Massaro, Marcello and Luo, Kai Hong and Sain, Basudeb and Montaut, Nicola and Herrmann, Harald and Weiss, Thomas and Li, Guixin and Silberhorn, Christine and Zentgraf, Thomas}}, issn = {{2047-7538}}, journal = {{Light: Science & Applications}}, pages = {{70}}, title = {{{Metasurface interferometry toward quantum sensors}}}, doi = {{10.1038/s41377-019-0182-6}}, volume = {{8}}, 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}}, } @article{15724, author = {{Ojha, Deepak and Kaliannan, Naveen Kumar and Kühne, Thomas D.}}, issn = {{2399-3669}}, journal = {{Communications Chemistry}}, number = {{1}}, pages = {{116}}, title = {{{Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface}}}, doi = {{10.1038/s42004-019-0220-6}}, volume = {{2}}, 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}}, }