--- _id: '19392' author: - first_name: Gerson full_name: Meschut, Gerson id: '32056' last_name: Meschut orcid: 0000-0002-2763-1246 - first_name: Dominik full_name: Teutenberg, Dominik id: '537' last_name: Teutenberg - first_name: Marc full_name: Wünsche, Marc last_name: Wünsche citation: ama: Meschut G, Teutenberg D, Wünsche M. A test concept for bonded steel/CFRP structures. ADHESION ADHESIVES&SEALANTS. 2019:22-27. doi:10.1007/s35784-015-0533-5 apa: Meschut, G., Teutenberg, D., & Wünsche, M. (2019). A test concept for bonded steel/CFRP structures. ADHESION ADHESIVES&SEALANTS, 22–27. https://doi.org/10.1007/s35784-015-0533-5 bibtex: '@article{Meschut_Teutenberg_Wünsche_2019, title={A test concept for bonded steel/CFRP structures}, DOI={10.1007/s35784-015-0533-5}, journal={ADHESION ADHESIVES&SEALANTS}, author={Meschut, Gerson and Teutenberg, Dominik and Wünsche, Marc}, year={2019}, pages={22–27} }' chicago: Meschut, Gerson, Dominik Teutenberg, and Marc Wünsche. “A Test Concept for Bonded Steel/CFRP Structures.” ADHESION ADHESIVES&SEALANTS, 2019, 22–27. https://doi.org/10.1007/s35784-015-0533-5. ieee: G. Meschut, D. Teutenberg, and M. Wünsche, “A test concept for bonded steel/CFRP structures,” ADHESION ADHESIVES&SEALANTS, pp. 22–27, 2019. mla: Meschut, Gerson, et al. “A Test Concept for Bonded Steel/CFRP Structures.” ADHESION ADHESIVES&SEALANTS, 2019, pp. 22–27, doi:10.1007/s35784-015-0533-5. short: G. Meschut, D. Teutenberg, M. Wünsche, ADHESION ADHESIVES&SEALANTS (2019) 22–27. date_created: 2020-09-14T12:41:34Z date_updated: 2022-01-06T06:54:03Z doi: 10.1007/s35784-015-0533-5 language: - iso: eng page: 22-27 publication: ADHESION ADHESIVES&SEALANTS publication_identifier: issn: - 2192-2624 - 2195-6545 publication_status: published status: public title: A test concept for bonded steel/CFRP structures type: journal_article user_id: '537' year: '2019' ... --- _id: '22653' abstract: - lang: eng text:

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: - first_name: Saminathan full_name: Ramakrishnan, Saminathan last_name: Ramakrishnan - first_name: Leonard full_name: Schärfen, Leonard last_name: Schärfen - first_name: Kristin full_name: Hunold, Kristin last_name: Hunold - first_name: Sebastian full_name: Fricke, Sebastian last_name: Fricke - first_name: Guido full_name: Grundmeier, Guido id: '194' last_name: Grundmeier - first_name: Michael full_name: Schlierf, Michael last_name: Schlierf - first_name: Adrian full_name: Keller, Adrian id: '48864' last_name: Keller orcid: 0000-0001-7139-3110 - first_name: Georg full_name: Krainer, Georg last_name: Krainer citation: ama: 'Ramakrishnan S, Schärfen L, Hunold K, et al. Enhancing the stability of DNA origami nanostructures: staple strand redesign versus enzymatic ligation. Nanoscale. 2019;11:16270-16276. doi:10.1039/c9nr04460d' apa: 'Ramakrishnan, S., Schärfen, L., Hunold, K., Fricke, S., Grundmeier, G., Schlierf, M., … Krainer, G. (2019). Enhancing the stability of DNA origami nanostructures: staple strand redesign versus enzymatic ligation. Nanoscale, 11, 16270–16276. https://doi.org/10.1039/c9nr04460d' bibtex: '@article{Ramakrishnan_Schärfen_Hunold_Fricke_Grundmeier_Schlierf_Keller_Krainer_2019, title={Enhancing the stability of DNA origami nanostructures: staple strand redesign versus enzymatic ligation}, volume={11}, DOI={10.1039/c9nr04460d}, journal={Nanoscale}, 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}, year={2019}, pages={16270–16276} }' chicago: 'Ramakrishnan, Saminathan, Leonard Schärfen, Kristin Hunold, Sebastian Fricke, Guido Grundmeier, Michael Schlierf, Adrian Keller, and Georg Krainer. “Enhancing the Stability of DNA Origami Nanostructures: Staple Strand Redesign versus Enzymatic Ligation.” Nanoscale 11 (2019): 16270–76. https://doi.org/10.1039/c9nr04460d.' ieee: 'S. Ramakrishnan et al., “Enhancing the stability of DNA origami nanostructures: staple strand redesign versus enzymatic ligation,” Nanoscale, vol. 11, pp. 16270–16276, 2019.' mla: 'Ramakrishnan, Saminathan, et al. “Enhancing the Stability of DNA Origami Nanostructures: Staple Strand Redesign versus Enzymatic Ligation.” Nanoscale, vol. 11, 2019, pp. 16270–76, doi:10.1039/c9nr04460d.' short: S. Ramakrishnan, L. Schärfen, K. Hunold, S. Fricke, G. Grundmeier, M. Schlierf, A. Keller, G. Krainer, Nanoscale 11 (2019) 16270–16276. date_created: 2021-07-08T12:10:44Z date_updated: 2022-01-06T06:55:38Z department: - _id: '302' doi: 10.1039/c9nr04460d intvolume: ' 11' language: - iso: eng page: 16270-16276 publication: Nanoscale publication_identifier: issn: - 2040-3364 - 2040-3372 publication_status: published status: public title: 'Enhancing the stability of DNA origami nanostructures: staple strand redesign versus enzymatic ligation' type: journal_article user_id: '48864' volume: 11 year: '2019' ... --- _id: '22748' author: - first_name: Julian full_name: Tekaat, Julian last_name: Tekaat - first_name: Aschot full_name: Kharatyan, Aschot last_name: Kharatyan - first_name: Harald full_name: Anacker, Harald last_name: Anacker - first_name: Roman full_name: Dumitrescu, Roman id: '16190' last_name: Dumitrescu citation: ama: 'Tekaat J, Kharatyan A, Anacker H, Dumitrescu R. Potentials for the Integration of Design Thinking along Automotive Systems Engineering focusing Security and Safety. In: Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019. ; 2019.' apa: Tekaat, J., Kharatyan, A., Anacker, H., & Dumitrescu, R. (2019). Potentials for the Integration of Design Thinking along Automotive Systems Engineering focusing Security and Safety. In Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019. Delft, Niederlande, 2019. bibtex: '@inproceedings{Tekaat_Kharatyan_Anacker_Dumitrescu_2019, title={Potentials for the Integration of Design Thinking along Automotive Systems Engineering focusing Security and Safety}, booktitle={Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019}, author={Tekaat, Julian and Kharatyan, Aschot and Anacker, Harald and Dumitrescu, Roman}, year={2019} }' chicago: Tekaat, Julian, Aschot Kharatyan, Harald Anacker, and Roman Dumitrescu. “Potentials for the Integration of Design Thinking along Automotive Systems Engineering Focusing Security and Safety.” In Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019, 2019. ieee: J. Tekaat, A. Kharatyan, H. Anacker, and R. Dumitrescu, “Potentials for the Integration of Design Thinking along Automotive Systems Engineering focusing Security and Safety,” in Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019, Delft, Niederlande, 2019, 2019. mla: Tekaat, Julian, et al. “Potentials for the Integration of Design Thinking along Automotive Systems Engineering Focusing Security and Safety.” Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019, 2019. short: 'J. Tekaat, A. Kharatyan, H. Anacker, R. Dumitrescu, in: Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019, 2019.' conference: end_date: 2019-08-08 location: Delft, Niederlande, 2019 name: 'Proceedings of the International Conference on Engineering Design (ICED 19) ' start_date: 2019-08-05 date_created: 2021-07-15T10:55:48Z date_updated: 2022-01-06T06:55:39Z department: - _id: '563' language: - iso: eng publication: Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019 status: public title: Potentials for the Integration of Design Thinking along Automotive Systems Engineering focusing Security and Safety type: conference user_id: '21240' year: '2019' ... --- _id: '9275' abstract: - lang: eng text: "In the last years, store-oriented software ecosystems are gaining\r\nmore and more attention from a business perspective. In these ecosystems,\r\nthird-party developers upload extensions to a store which can be\r\ndownloaded by end users. While the functional scope of such ecosystems\r\nis relatively similar, the underlying business models differ greatly in and\r\nbetween their different product domains (e.g. Mobile Phone, Smart TV).\r\nThis variability, in turn, makes it challenging for store providers to \r\nfind a business model that fits their own needs.\r\nTo handle this variability, we introduce the Business Variability Model\r\n(BVM) for modeling business model decisions. The basis of these decisions\r\nis the analysis of 60 store-oriented software ecosystems in eight\r\ndifferent product domains. We map their business model decisions to the\r\nBusiness Model Canvas, condense them to a variability model and discuss\r\nparticular variants and their dependencies. Our work provides store\r\nproviders a new approach for modeling business model decisions together\r\nwith insights of existing business models. This, in turn, supports them\r\nin creating new and improving existing business models." author: - first_name: Sebastian full_name: Gottschalk, Sebastian id: '47208' last_name: Gottschalk - first_name: Florian full_name: Rittmeier, Florian id: '5281' last_name: Rittmeier - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Gottschalk S, Rittmeier F, Engels G. Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach. In: Shishkov B, ed. Business Modeling and Software Design. Lecture Notes in Business Information Processing. Springer International Publishing; 2019:153-169. doi:10.1007/978-3-030-24854-3_10' apa: 'Gottschalk, S., Rittmeier, F., & Engels, G. (2019). Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach. In B. Shishkov (Ed.), Business Modeling and Software Design (pp. 153–169). Lisbon: Springer International Publishing. https://doi.org/10.1007/978-3-030-24854-3_10' bibtex: '@inproceedings{Gottschalk_Rittmeier_Engels_2019, series={Lecture Notes in Business Information Processing}, title={Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach}, DOI={10.1007/978-3-030-24854-3_10}, booktitle={Business Modeling and Software Design}, publisher={Springer International Publishing}, author={Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}, editor={Shishkov, BorisEditor}, year={2019}, pages={153–169}, collection={Lecture Notes in Business Information Processing} }' chicago: 'Gottschalk, Sebastian, Florian Rittmeier, and Gregor Engels. “Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach.” In Business Modeling and Software Design, edited by Boris Shishkov, 153–69. Lecture Notes in Business Information Processing. Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-24854-3_10.' ieee: 'S. Gottschalk, F. Rittmeier, and G. Engels, “Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach,” in Business Modeling and Software Design, Lisbon, 2019, pp. 153–169.' mla: 'Gottschalk, Sebastian, et al. “Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach.” Business Modeling and Software Design, edited by Boris Shishkov, Springer International Publishing, 2019, pp. 153–69, doi:10.1007/978-3-030-24854-3_10.' short: 'S. Gottschalk, F. Rittmeier, G. Engels, in: B. Shishkov (Ed.), Business Modeling and Software Design, Springer International Publishing, 2019, pp. 153–169.' conference: end_date: 2019-07-03 location: Lisbon name: International Symposium on Business Modeling and Software Design start_date: 2019-07-01 date_created: 2019-04-23T11:47:23Z date_updated: 2022-01-06T07:04:12Z ddc: - '000' department: - _id: '66' doi: 10.1007/978-3-030-24854-3_10 editor: - first_name: Boris full_name: Shishkov, Boris last_name: Shishkov file: - access_level: open_access content_type: application/pdf creator: sego date_created: 2019-11-14T14:47:32Z date_updated: 2019-12-06T13:47:58Z file_id: '14988' file_name: BMSD.pdf file_size: 546764 relation: main_file file_date_updated: 2019-12-06T13:47:58Z has_accepted_license: '1' keyword: - Software Ecosystems - Business Models - Variabilities language: - iso: eng main_file_link: - url: https://link.springer.com/chapter/10.1007/978-3-030-24854-3_10 oa: '1' page: 153-169 project: - _id: '4' name: SFB 901 - Project Area C - _id: '1' name: SFB 901 - _id: '17' name: SFB 901 - Subproject C5 publication: Business Modeling and Software Design publication_identifier: unknown: - 978-3-030-24853-6 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Business Information Processing status: public title: 'Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach' type: conference user_id: '47208' year: '2019' ... --- _id: '7636' abstract: - lang: eng text: "Self-stabilizing overlay networks have the advantage of being able to recover from illegal states and faults. \r\nHowever, the majority of these networks cannot give any guarantees on their functionality while the recovery process is going on. \r\nWe 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. \r\nIn this paper we investigate overlay networks that ensure the maintenance of monotonic searchability while the self-stabilization is going on. \r\nMore 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.\r\nWe 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.\r\n" author: - first_name: Linghui full_name: Luo, Linghui last_name: Luo - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Thim Frederik full_name: Strothmann, Thim Frederik id: '11319' last_name: Strothmann citation: ama: 'Luo L, Scheideler C, Strothmann TF. MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). ; 2019.' apa: 'Luo, L., Scheideler, C., & Strothmann, T. F. (2019). MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil.' bibtex: '@inproceedings{Luo_Scheideler_Strothmann_2019, title={MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability}, booktitle={Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19)}, author={Luo, Linghui and Scheideler, Christian and Strothmann, Thim Frederik}, year={2019} }' chicago: 'Luo, Linghui, Christian Scheideler, and Thim Frederik Strothmann. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.' ieee: 'L. Luo, C. Scheideler, and T. F. Strothmann, “MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability,” in Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), Rio de Janeiro, Brazil, 2019.' mla: 'Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.' short: 'L. Luo, C. Scheideler, T.F. Strothmann, in: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.' conference: end_date: 2019-05-25 location: Rio de Janeiro, Brazil name: 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) start_date: 2019-05-20 date_created: 2019-02-12T13:39:20Z date_updated: 2022-01-06T07:03:42Z ddc: - '006' department: - _id: '66' file: - access_level: closed content_type: application/pdf creator: thim date_created: 2019-02-12T13:37:35Z date_updated: 2019-02-12T13:37:35Z file_id: '7637' file_name: IPDPS_main.pdf file_size: 372026 relation: main_file file_date_updated: 2019-02-12T13:37:35Z has_accepted_license: '1' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '1' name: SFB 901 publication: Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19) status: public title: 'MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability' type: conference user_id: '477' year: '2019' ... --- _id: '8529' author: - first_name: Nina full_name: Seemann, Nina id: '65408' last_name: Seemann - first_name: Marie-Luis full_name: Merten, Marie-Luis last_name: Merten citation: ama: 'Seemann N, Merten M-L. UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte. In: Sahle P, ed. DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts. Frankfurt am Main, Germany: Zenodo; 2019:352-353. doi:10.5281/ZENODO.2596094' apa: 'Seemann, N., & Merten, M.-L. (2019). UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte. In P. Sahle (Ed.), DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts (pp. 352–353). Frankfurt am Main, Germany: Zenodo. https://doi.org/10.5281/ZENODO.2596094' bibtex: '@inproceedings{Seemann_Merten_2019, place={Frankfurt am Main, Germany}, title={UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte}, DOI={10.5281/ZENODO.2596094}, booktitle={DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}, publisher={Zenodo}, author={Seemann, Nina and Merten, Marie-Luis}, editor={Sahle, PatrickEditor}, year={2019}, pages={352–353} }' chicago: 'Seemann, Nina, and Marie-Luis Merten. “UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte.” In DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, edited by Patrick Sahle, 352–53. Frankfurt am Main, Germany: Zenodo, 2019. https://doi.org/10.5281/ZENODO.2596094.' ieee: 'N. Seemann and M.-L. Merten, “UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte,” in DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, Mainz and Frankfurt am Main, Germany, 2019, pp. 352–353.' mla: 'Seemann, Nina, and Marie-Luis Merten. “UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte.” DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, edited by Patrick Sahle, Zenodo, 2019, pp. 352–53, doi:10.5281/ZENODO.2596094.' short: 'N. Seemann, M.-L. Merten, in: P. Sahle (Ed.), DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, Zenodo, Frankfurt am Main, Germany, 2019, pp. 352–353.' conference: end_date: 2019-03-29 location: Mainz and Frankfurt am Main, Germany name: 'DHd 2019 Digital Humanities: multimedial & multimodal.' start_date: 2019-03-25 date_created: 2019-03-21T08:39:17Z date_updated: 2022-01-06T07:03:56Z department: - _id: '36' - _id: '1' - _id: '579' doi: 10.5281/ZENODO.2596094 editor: - first_name: Patrick full_name: Sahle, Patrick last_name: Sahle language: - iso: ger main_file_link: - open_access: '1' url: https://zenodo.org/record/2596095/files/2019_DHd_BookOfAbstracts_web.pdf?download=1 oa: '1' page: 352-353 place: Frankfurt am Main, Germany project: - _id: '39' name: InterGramm publication: 'DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts' publication_identifier: isbn: - 978-3-00-062166-6 publication_status: published publisher: Zenodo status: public title: 'UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte' type: conference_abstract user_id: '13929' year: '2019' ... --- _id: '8532' author: - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer - first_name: Bianca full_name: Buff, Bianca last_name: Buff - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Bäumer FS, Buff B, Geierhos M. Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen. In: Sahle P, ed. DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts. Frankfurt am Main, Germany: Zenodo; 2019:192-193. doi:10.5281/zenodo.2596095' apa: 'Bäumer, F. S., Buff, B., & Geierhos, M. (2019). Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen. In P. Sahle (Ed.), DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts (pp. 192–193). Frankfurt am Main, Germany: Zenodo. https://doi.org/10.5281/zenodo.2596095' bibtex: '@inproceedings{Bäumer_Buff_Geierhos_2019, place={Frankfurt am Main, Germany}, title={Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen}, DOI={10.5281/zenodo.2596095}, booktitle={DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts}, publisher={Zenodo}, author={Bäumer, Frederik Simon and Buff, Bianca and Geierhos, Michaela}, editor={Sahle, PatrickEditor}, year={2019}, pages={192–193} }' chicago: 'Bäumer, Frederik Simon, Bianca Buff, and Michaela Geierhos. “Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen.” In DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, edited by Patrick Sahle, 192–93. Frankfurt am Main, Germany: Zenodo, 2019. https://doi.org/10.5281/zenodo.2596095.' ieee: 'F. S. Bäumer, B. Buff, and M. Geierhos, “Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen,” in DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, Mainz and Frankfurt am Main, Germany, 2019, pp. 192–193.' mla: 'Bäumer, Frederik Simon, et al. “Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen.” DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, edited by Patrick Sahle, Zenodo, 2019, pp. 192–93, doi:10.5281/zenodo.2596095.' short: 'F.S. Bäumer, B. Buff, M. Geierhos, in: P. Sahle (Ed.), DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts, Zenodo, Frankfurt am Main, Germany, 2019, pp. 192–193.' conference: end_date: 2019-03-29 location: Mainz and Frankfurt am Main, Germany name: 'DHd 2019 Digital Humanities: multimedial & multimodal.' start_date: 2019-03-25 date_created: 2019-03-21T09:02:37Z date_updated: 2022-01-06T07:03:56Z department: - _id: '36' - _id: '1' - _id: '579' doi: 10.5281/zenodo.2596095 editor: - first_name: Patrick full_name: Sahle, Patrick last_name: Sahle language: - iso: ger main_file_link: - open_access: '1' url: https://zenodo.org/record/2596095/files/2019_DHd_BookOfAbstracts_web.pdf?download=1 oa: '1' page: 192-193 place: Frankfurt am Main, Germany publication: 'DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts' publication_identifier: isbn: - 978-3-00-062166-6 publication_status: published publisher: Zenodo status: public title: Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen type: conference_abstract user_id: '13929' year: '2019' ... --- _id: '8534' abstract: - lang: eng text: "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. \r\nSKEAP and SEAP provide logarithmic runtimes w.h.p. on all their operations with SEAP having to use only O(log n) bit messages." author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Scheideler C. Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2019:287--296. doi:10.1145/3323165.3323193' apa: 'Feldmann, M., & Scheideler, C. (2019). Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 287--296). ACM. https://doi.org/10.1145/3323165.3323193' bibtex: '@inproceedings{Feldmann_Scheideler_2019, title={Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities}, DOI={10.1145/3323165.3323193}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Feldmann, Michael and Scheideler, Christian}, year={2019}, pages={287--296} }' chicago: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 287--296. ACM, 2019. https://doi.org/10.1145/3323165.3323193.' ieee: 'M. Feldmann and C. Scheideler, “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2019, pp. 287--296.' mla: 'Feldmann, Michael, and Christian Scheideler. “Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296, doi:10.1145/3323165.3323193.' short: 'M. Feldmann, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2019, pp. 287--296.' date_created: 2019-03-21T14:37:26Z date_updated: 2022-01-06T07:03:56Z ddc: - '004' department: - _id: '79' doi: 10.1145/3323165.3323193 external_id: arxiv: - '1805.03472' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T09:14:32Z date_updated: 2019-08-26T09:14:32Z file_id: '12954' file_name: p287-feldmann.pdf file_size: 1295095 relation: main_file success: 1 file_date_updated: 2019-08-26T09:14:32Z has_accepted_license: '1' language: - iso: eng page: 287--296 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publisher: ACM status: public title: 'Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities' type: conference user_id: '477' year: '2019' ... --- _id: '8871' author: - first_name: John full_name: Augustine, John last_name: Augustine - first_name: Mohsen full_name: Ghaffari, Mohsen last_name: Ghaffari - first_name: Robert full_name: Gmyr, Robert last_name: Gmyr - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Jason full_name: Li, Jason last_name: Li - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Augustine J, Ghaffari M, Gmyr R, et al. Distributed Computation in Node-Capacitated Networks. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures. ACM; 2019:69--79. doi:10.1145/3323165.3323195' apa: Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., & Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 69--79). ACM. https://doi.org/10.1145/3323165.3323195 bibtex: '@inproceedings{Augustine_Ghaffari_Gmyr_Hinnenthal_Kuhn_Li_Scheideler_2019, title={Distributed Computation in Node-Capacitated Networks}, DOI={10.1145/3323165.3323195}, booktitle={Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={ACM}, author={Augustine, John and Ghaffari, Mohsen and Gmyr, Robert and Hinnenthal, Kristian and Kuhn, Fabian and Li, Jason and Scheideler, Christian}, year={2019}, pages={69--79} }' chicago: Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.” In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 69--79. ACM, 2019. https://doi.org/10.1145/3323165.3323195. ieee: J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, pp. 69--79. mla: Augustine, John, et al. “Distributed Computation in Node-Capacitated Networks.” Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79, doi:10.1145/3323165.3323195. short: 'J. Augustine, M. Ghaffari, R. Gmyr, K. Hinnenthal, F. Kuhn, J. Li, C. Scheideler, in: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, ACM, 2019, pp. 69--79.' date_created: 2019-04-10T08:20:34Z date_updated: 2022-01-06T07:04:04Z ddc: - '004' department: - _id: '79' doi: 10.1145/3323165.3323195 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T11:17:58Z date_updated: 2019-08-26T11:17:58Z file_id: '12964' file_name: p69-augustine.pdf file_size: 1275192 relation: main_file success: 1 file_date_updated: 2019-08-26T11:17:58Z has_accepted_license: '1' language: - iso: eng page: 69--79 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures publisher: ACM status: public title: Distributed Computation in Node-Capacitated Networks type: conference user_id: '477' year: '2019' ... --- _id: '9718' author: - first_name: Sarah full_name: Johannesmann, Sarah id: '29190' last_name: Johannesmann - first_name: Manuel full_name: Webersen, Manuel id: '11289' last_name: Webersen orcid: 0000-0001-6411-4232 - first_name: Julia full_name: Düchting, Julia last_name: Düchting - first_name: Leander full_name: Claes, Leander id: '11829' last_name: Claes orcid: 0000-0002-4393-268X - first_name: Bernd full_name: Henning, Bernd id: '213' last_name: Henning citation: ama: 'Johannesmann S, Webersen M, Düchting J, Claes L, Henning B. Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves. In: 45th Annual Review of Progress in Quantitative Nondestructive Evaluation . Vol 38. ; 2019. doi:10.1063/1.5099742' apa: Johannesmann, S., Webersen, M., Düchting, J., Claes, L., & Henning, B. (2019). Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves. In 45th Annual Review of Progress in Quantitative Nondestructive Evaluation (Vol. 38). Burlington. https://doi.org/10.1063/1.5099742 bibtex: '@inproceedings{Johannesmann_Webersen_Düchting_Claes_Henning_2019, title={Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves}, volume={38}, DOI={10.1063/1.5099742}, booktitle={45th Annual Review of Progress in Quantitative Nondestructive Evaluation }, author={Johannesmann, Sarah and Webersen, Manuel and Düchting, Julia and Claes, Leander and Henning, Bernd}, year={2019} }' chicago: Johannesmann, Sarah, Manuel Webersen, Julia Düchting, Leander Claes, and Bernd Henning. “Characterization of the Linear-Acoustic Material Behavior of Fiber-Reinforced Composites Using Lamb Waves.” In 45th Annual Review of Progress in Quantitative Nondestructive Evaluation , Vol. 38, 2019. https://doi.org/10.1063/1.5099742. ieee: S. Johannesmann, M. Webersen, J. Düchting, L. Claes, and B. Henning, “Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves,” in 45th Annual Review of Progress in Quantitative Nondestructive Evaluation , Burlington, 2019, vol. 38. mla: Johannesmann, Sarah, et al. “Characterization of the Linear-Acoustic Material Behavior of Fiber-Reinforced Composites Using Lamb Waves.” 45th Annual Review of Progress in Quantitative Nondestructive Evaluation , vol. 38, 2019, doi:10.1063/1.5099742. short: 'S. Johannesmann, M. Webersen, J. Düchting, L. Claes, B. Henning, in: 45th Annual Review of Progress in Quantitative Nondestructive Evaluation , 2019.' conference: end_date: 2018-07-19 location: Burlington name: '45th Annual Review of Progress in Quantitative Nondestructive Evaluation ' start_date: 2018-07-16 date_created: 2019-05-11T09:49:57Z date_updated: 2022-01-06T07:04:18Z department: - _id: '49' doi: 10.1063/1.5099742 intvolume: ' 38' language: - iso: eng project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing - _id: '88' grant_number: '260306237' name: Ermittlung des hydrothermischen Alterungsverhaltens endlosfaserverstärkter Thermoplaste und Entwicklung eines ultraschallbasierten Messsystems zur zerstörungsfreien Charakterisierung des Alterungszustands für die Komponentenüberwachung und Restlebenszeitprädiktion publication: '45th Annual Review of Progress in Quantitative Nondestructive Evaluation ' publication_identifier: unknown: - 978-0-7354-1832-5 publication_status: published status: public title: Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves type: conference user_id: '11829' volume: 38 year: '2019' ... --- _id: '6512' abstract: - lang: eng text: 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: - first_name: Gerhard full_name: Rauchecker, Gerhard last_name: Rauchecker - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen citation: ama: 'Rauchecker G, Schryen G. 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. Computers & Operations Research. 2019;(104):338-357.' apa: 'Rauchecker, G., & Schryen, G. (2019). 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. Computers & Operations Research, (104), 338–357.' bibtex: '@article{Rauchecker_Schryen_2019, 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}, number={104}, journal={Computers & Operations Research}, publisher={Elsevier}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2019}, pages={338–357} }' chicago: 'Rauchecker, Gerhard, and Guido Schryen. “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.” Computers & Operations Research, no. 104 (2019): 338–57.' ieee: 'G. Rauchecker and G. Schryen, “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,” Computers & Operations Research, no. 104, pp. 338–357, 2019.' mla: 'Rauchecker, Gerhard, and Guido Schryen. “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.” Computers & Operations Research, no. 104, Elsevier, 2019, pp. 338–57.' short: G. Rauchecker, G. Schryen, Computers & Operations Research (2019) 338–357. date_created: 2019-01-08T13:50:44Z date_updated: 2022-01-06T07:03:08Z ddc: - '000' department: - _id: '277' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2019-01-08T14:03:53Z date_updated: 2019-01-08T14:03:53Z file_id: '6513' file_name: cor-parallel-bp-for-upmsp.pdf file_size: 4153528 relation: main_file file_date_updated: 2019-01-08T14:03:53Z has_accepted_license: '1' issue: '104' keyword: - parallel machine scheduling with setup times - parallel branch-and-price algorithm - high performance computing - master/worker parallelization language: - iso: eng oa: '1' page: 338-357 publication: Computers & Operations Research publisher: Elsevier status: public 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' type: journal_article user_id: '61579' year: '2019' ... --- _id: '16709' author: - first_name: Tuhin full_name: Sahai, Tuhin last_name: Sahai - first_name: Adrian full_name: Ziessler, Adrian last_name: Ziessler - first_name: Stefan full_name: Klus, Stefan last_name: Klus - first_name: Michael full_name: Dellnitz, Michael last_name: Dellnitz citation: ama: Sahai T, Ziessler A, Klus S, Dellnitz M. Continuous relaxations for the traveling salesman problem. Nonlinear Dynamics. 2019. doi:10.1007/s11071-019-05092-5 apa: Sahai, T., Ziessler, A., Klus, S., & Dellnitz, M. (2019). Continuous relaxations for the traveling salesman problem. Nonlinear Dynamics. https://doi.org/10.1007/s11071-019-05092-5 bibtex: '@article{Sahai_Ziessler_Klus_Dellnitz_2019, title={Continuous relaxations for the traveling salesman problem}, DOI={10.1007/s11071-019-05092-5}, journal={Nonlinear Dynamics}, author={Sahai, Tuhin and Ziessler, Adrian and Klus, Stefan and Dellnitz, Michael}, year={2019} }' chicago: Sahai, Tuhin, Adrian Ziessler, Stefan Klus, and Michael Dellnitz. “Continuous Relaxations for the Traveling Salesman Problem.” Nonlinear Dynamics, 2019. https://doi.org/10.1007/s11071-019-05092-5. ieee: T. Sahai, A. Ziessler, S. Klus, and M. Dellnitz, “Continuous relaxations for the traveling salesman problem,” Nonlinear Dynamics, 2019. mla: Sahai, Tuhin, et al. “Continuous Relaxations for the Traveling Salesman Problem.” Nonlinear Dynamics, 2019, doi:10.1007/s11071-019-05092-5. short: T. Sahai, A. Ziessler, S. Klus, M. Dellnitz, Nonlinear Dynamics (2019). date_created: 2020-04-16T14:05:04Z date_updated: 2022-01-06T06:52:55Z department: - _id: '101' doi: 10.1007/s11071-019-05092-5 language: - iso: eng publication: Nonlinear Dynamics publication_identifier: issn: - 0924-090X - 1573-269X publication_status: published status: public title: Continuous relaxations for the traveling salesman problem type: journal_article user_id: '47427' year: '2019' ... --- _id: '10586' abstract: - lang: eng text: 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: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations. In: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14. doi:10.4230/LIPICS.ICALP.2019.150' apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150' bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150}, booktitle={Proceedings of the 46th International Colloquium on Automata, Languages, and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs} }' chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150. ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14. mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.” Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150. short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.' conference: end_date: 2019-07-12 location: Patras, Greece name: ICALP 2019 start_date: 2019-07-09 date_created: 2019-07-08T17:19:01Z date_updated: 2022-01-06T06:50:45Z ddc: - '004' department: - _id: '79' doi: 10.4230/LIPICS.ICALP.2019.150 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-08-26T09:21:27Z date_updated: 2019-08-26T09:21:27Z file_id: '12955' file_name: LIPIcs-ICALP-2019-150.pdf file_size: 537649 relation: main_file success: 1 file_date_updated: 2019-08-26T09:21:27Z has_accepted_license: '1' intvolume: ' 132' keyword: - Graphs transformations - NP-hardness - approximation algorithms language: - iso: eng page: 150:1--150:14 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 46th International Colloquium on Automata, Languages, and Programming publication_status: published publisher: Dagstuhl Publishing series_title: LIPIcs status: public title: On the Complexity of Local Graph Transformations type: conference user_id: '477' volume: 132 year: '2019' ... --- _id: '10595' abstract: - lang: eng text: 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. article_type: original author: - first_name: Bennet full_name: Gebken, Bennet id: '32643' last_name: Gebken - first_name: Sebastian full_name: Peitz, Sebastian id: '47427' last_name: Peitz orcid: https://orcid.org/0000-0002-3389-793X - first_name: Michael full_name: Dellnitz, Michael last_name: Dellnitz citation: ama: Gebken B, Peitz S, Dellnitz M. On the hierarchical structure of Pareto critical sets. Journal of Global Optimization. 2019;73(4):891-913. doi:10.1007/s10898-019-00737-6 apa: Gebken, B., Peitz, S., & Dellnitz, M. (2019). On the hierarchical structure of Pareto critical sets. Journal of Global Optimization, 73(4), 891–913. https://doi.org/10.1007/s10898-019-00737-6 bibtex: '@article{Gebken_Peitz_Dellnitz_2019, title={On the hierarchical structure of Pareto critical sets}, volume={73}, DOI={10.1007/s10898-019-00737-6}, number={4}, journal={Journal of Global Optimization}, author={Gebken, Bennet and Peitz, Sebastian and Dellnitz, Michael}, year={2019}, pages={891–913} }' chicago: 'Gebken, Bennet, Sebastian Peitz, and Michael Dellnitz. “On the Hierarchical Structure of Pareto Critical Sets.” Journal of Global Optimization 73, no. 4 (2019): 891–913. https://doi.org/10.1007/s10898-019-00737-6.' ieee: B. Gebken, S. Peitz, and M. Dellnitz, “On the hierarchical structure of Pareto critical sets,” Journal of Global Optimization, vol. 73, no. 4, pp. 891–913, 2019. mla: Gebken, Bennet, et al. “On the Hierarchical Structure of Pareto Critical Sets.” Journal of Global Optimization, vol. 73, no. 4, 2019, pp. 891–913, doi:10.1007/s10898-019-00737-6. short: B. Gebken, S. Peitz, M. Dellnitz, Journal of Global Optimization 73 (2019) 891–913. date_created: 2019-07-10T08:13:31Z date_updated: 2022-01-06T06:50:46Z department: - _id: '101' doi: 10.1007/s10898-019-00737-6 intvolume: ' 73' issue: '4' language: - iso: eng page: 891-913 publication: Journal of Global Optimization publication_identifier: issn: - 0925-5001 - 1573-2916 publication_status: published status: public title: On the hierarchical structure of Pareto critical sets type: journal_article user_id: '47427' volume: 73 year: '2019' ... --- _id: '12870' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. In: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA). Springer; 2019:120-137. doi:10.1007/978-3-030-39479-0_9' apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2019). Managing Multiple Mobile Resources. In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) (pp. 120–137). Springer. https://doi.org/10.1007/978-3-030-39479-0_9 bibtex: '@inproceedings{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2019, title={Managing Multiple Mobile Resources}, DOI={10.1007/978-3-030-39479-0_9}, booktitle={Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2019}, pages={120–137} }' chicago: Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” In Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 120–37. Springer, 2019. https://doi.org/10.1007/978-3-030-39479-0_9. ieee: B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” in Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), 2019, pp. 120–137. mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–37, doi:10.1007/978-3-030-39479-0_9. short: 'B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA), Springer, 2019, pp. 120–137.' date_created: 2019-07-22T09:00:05Z date_updated: 2022-01-06T06:51:20Z department: - _id: '63' doi: 10.1007/978-3-030-39479-0_9 external_id: arxiv: - '1907.09834' language: - iso: eng page: 120 - 137 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA) publication_status: published publisher: Springer status: public title: Managing Multiple Mobile Resources type: conference user_id: '22704' year: '2019' ... --- _id: '12919' author: - first_name: Philip full_name: Georgi, Philip last_name: Georgi - first_name: Marcello full_name: Massaro, Marcello id: '59545' last_name: Massaro orcid: 0000-0002-2539-7652 - first_name: Kai Hong full_name: Luo, Kai Hong id: '36389' last_name: Luo orcid: 0000-0003-1008-4976 - first_name: Basudeb full_name: Sain, Basudeb last_name: Sain - first_name: Nicola full_name: Montaut, Nicola last_name: Montaut - first_name: Harald full_name: Herrmann, Harald id: '216' last_name: Herrmann - first_name: Thomas full_name: Weiss, Thomas last_name: Weiss - first_name: Guixin full_name: Li, Guixin last_name: Li - first_name: Christine full_name: Silberhorn, Christine id: '26263' last_name: Silberhorn - first_name: Thomas full_name: Zentgraf, Thomas id: '30525' last_name: Zentgraf orcid: 0000-0002-8662-1101 citation: ama: 'Georgi P, Massaro M, Luo KH, et al. Metasurface interferometry toward quantum sensors. Light: Science & Applications. 2019;8:70. doi:10.1038/s41377-019-0182-6' apa: 'Georgi, P., Massaro, M., Luo, K. H., Sain, B., Montaut, N., Herrmann, H., Weiss, T., Li, G., Silberhorn, C., & Zentgraf, T. (2019). Metasurface interferometry toward quantum sensors. Light: Science & Applications, 8, 70. https://doi.org/10.1038/s41377-019-0182-6' bibtex: '@article{Georgi_Massaro_Luo_Sain_Montaut_Herrmann_Weiss_Li_Silberhorn_Zentgraf_2019, title={Metasurface interferometry toward quantum sensors}, volume={8}, DOI={10.1038/s41377-019-0182-6}, journal={Light: Science & Applications}, 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}, year={2019}, pages={70} }' chicago: 'Georgi, Philip, Marcello Massaro, Kai Hong Luo, Basudeb Sain, Nicola Montaut, Harald Herrmann, Thomas Weiss, Guixin Li, Christine Silberhorn, and Thomas Zentgraf. “Metasurface Interferometry toward Quantum Sensors.” Light: Science & Applications 8 (2019): 70. https://doi.org/10.1038/s41377-019-0182-6.' ieee: 'P. Georgi et al., “Metasurface interferometry toward quantum sensors,” Light: Science & Applications, vol. 8, p. 70, 2019, doi: 10.1038/s41377-019-0182-6.' mla: 'Georgi, Philip, et al. “Metasurface Interferometry toward Quantum Sensors.” Light: Science & Applications, vol. 8, 2019, p. 70, doi:10.1038/s41377-019-0182-6.' short: 'P. Georgi, M. Massaro, K.H. Luo, B. Sain, N. Montaut, H. Herrmann, T. Weiss, G. Li, C. Silberhorn, T. Zentgraf, Light: Science & Applications 8 (2019) 70.' date_created: 2019-08-14T06:59:23Z date_updated: 2022-01-06T06:51:26Z ddc: - '530' department: - _id: '15' - _id: '230' - _id: '289' doi: 10.1038/s41377-019-0182-6 file: - access_level: closed content_type: application/pdf creator: zentgraf date_created: 2019-08-14T07:11:36Z date_updated: 2019-08-14T07:11:36Z file_id: '12921' file_name: LSA_Georgi_2019_Quantum metasurface.pdf file_size: 748999 relation: main_file success: 1 file_date_updated: 2019-08-14T07:11:36Z funded_apc: '1' has_accepted_license: '1' intvolume: ' 8' language: - iso: eng page: '70' project: - _id: '53' name: TRR 142 - _id: '56' name: TRR 142 - Project Area C - _id: '72' name: TRR 142 - Subproject C2 - _id: '75' name: TRR 142 - Subproject C5 publication: 'Light: Science & Applications' publication_identifier: issn: - 2047-7538 publication_status: published status: public title: Metasurface interferometry toward quantum sensors type: journal_article user_id: '30525' volume: 8 year: '2019' ... --- _id: '15627' author: - first_name: John full_name: Augustine, John last_name: Augustine - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Fabian full_name: Kuhn, Fabian last_name: Kuhn - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Philipp full_name: Schneider, Philipp last_name: Schneider citation: ama: 'Augustine J, Hinnenthal K, Kuhn F, Scheideler C, Schneider P. Shortest Paths in a Hybrid Network Model. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA; 2019:1280-1299. doi:10.1137/1.9781611975994.78' apa: Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., & Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1280–1299). Philadelphia, PA. https://doi.org/10.1137/1.9781611975994.78 bibtex: '@inproceedings{Augustine_Hinnenthal_Kuhn_Scheideler_Schneider_2019, place={Philadelphia, PA}, title={Shortest Paths in a Hybrid Network Model}, DOI={10.1137/1.9781611975994.78}, booktitle={Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms}, author={Augustine, John and Hinnenthal, Kristian and Kuhn, Fabian and Scheideler, Christian and Schneider, Philipp}, year={2019}, pages={1280–1299} }' chicago: Augustine, John, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. “Shortest Paths in a Hybrid Network Model.” In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1280–99. Philadelphia, PA, 2019. https://doi.org/10.1137/1.9781611975994.78. ieee: J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–1299. mla: Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.” Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–99, doi:10.1137/1.9781611975994.78. short: 'J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, 2019, pp. 1280–1299.' date_created: 2020-01-22T09:07:36Z date_updated: 2022-01-06T06:52:30Z doi: 10.1137/1.9781611975994.78 language: - iso: eng page: 1280-1299 place: Philadelphia, PA project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms publication_identifier: isbn: - '9781611975994' publication_status: published status: public title: Shortest Paths in a Hybrid Network Model type: conference user_id: '32229' year: '2019' ... --- _id: '15724' author: - first_name: Deepak full_name: Ojha, Deepak last_name: Ojha - first_name: Naveen Kumar full_name: Kaliannan, Naveen Kumar last_name: Kaliannan - first_name: Thomas D. full_name: Kühne, Thomas D. last_name: Kühne citation: ama: Ojha D, Kaliannan NK, Kühne TD. Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface. Communications Chemistry. 2019;2(1):116. doi:10.1038/s42004-019-0220-6 apa: Ojha, D., Kaliannan, N. K., & Kühne, T. D. (2019). Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface. Communications Chemistry, 2(1), 116. https://doi.org/10.1038/s42004-019-0220-6 bibtex: '@article{Ojha_Kaliannan_Kühne_2019, title={Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface}, volume={2}, DOI={10.1038/s42004-019-0220-6}, number={1}, journal={Communications Chemistry}, author={Ojha, Deepak and Kaliannan, Naveen Kumar and Kühne, Thomas D.}, year={2019}, pages={116} }' chicago: 'Ojha, Deepak, Naveen Kumar Kaliannan, and Thomas D. Kühne. “Time-Dependent Vibrational Sum-Frequency Generation Spectroscopy of the Air-Water Interface.” Communications Chemistry 2, no. 1 (2019): 116. https://doi.org/10.1038/s42004-019-0220-6.' ieee: D. Ojha, N. K. Kaliannan, and T. D. Kühne, “Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface,” Communications Chemistry, vol. 2, no. 1, p. 116, 2019. mla: Ojha, Deepak, et al. “Time-Dependent Vibrational Sum-Frequency Generation Spectroscopy of the Air-Water Interface.” Communications Chemistry, vol. 2, no. 1, 2019, p. 116, doi:10.1038/s42004-019-0220-6. short: D. Ojha, N.K. Kaliannan, T.D. Kühne, Communications Chemistry 2 (2019) 116. date_created: 2020-01-30T13:06:44Z date_updated: 2022-01-06T06:52:32Z doi: 10.1038/s42004-019-0220-6 intvolume: ' 2' issue: '1' language: - iso: eng page: '116' project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: Communications Chemistry publication_identifier: issn: - 2399-3669 publication_status: published status: public title: Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface type: journal_article user_id: '71692' volume: 2 year: '2019' ... --- _id: '15816' abstract: - lang: eng text: '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: - first_name: Catalin full_name: Zorila, Catalin last_name: Zorila - first_name: Christoph full_name: Boeddeker, Christoph id: '40767' last_name: Boeddeker - first_name: Rama full_name: Doddipatla, Rama last_name: Doddipatla - first_name: Reinhold full_name: Haeb-Umbach, Reinhold id: '242' last_name: Haeb-Umbach citation: ama: 'Zorila C, Boeddeker C, Doddipatla R, Haeb-Umbach R. An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription. In: ASRU 2019, Sentosa, Singapore. ; 2019.' apa: Zorila, C., Boeddeker, C., Doddipatla, R., & Haeb-Umbach, R. (2019). An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription. In ASRU 2019, Sentosa, Singapore. bibtex: '@inproceedings{Zorila_Boeddeker_Doddipatla_Haeb-Umbach_2019, title={An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription}, booktitle={ASRU 2019, Sentosa, Singapore}, author={Zorila, Catalin and Boeddeker, Christoph and Doddipatla, Rama and Haeb-Umbach, Reinhold}, year={2019} }' chicago: Zorila, Catalin, Christoph Boeddeker, Rama Doddipatla, and Reinhold Haeb-Umbach. “An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription.” In ASRU 2019, Sentosa, Singapore, 2019. ieee: C. Zorila, C. Boeddeker, R. Doddipatla, and R. Haeb-Umbach, “An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription,” in ASRU 2019, Sentosa, Singapore, 2019. mla: Zorila, Catalin, et al. “An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription.” ASRU 2019, Sentosa, Singapore, 2019. short: 'C. Zorila, C. Boeddeker, R. Doddipatla, R. Haeb-Umbach, in: ASRU 2019, Sentosa, Singapore, 2019.' date_created: 2020-02-06T07:35:08Z date_updated: 2022-01-06T06:52:37Z ddc: - '000' department: - _id: '54' file: - access_level: open_access content_type: application/pdf creator: huesera date_created: 2020-02-06T07:42:42Z date_updated: 2020-02-06T07:42:42Z file_id: '15817' file_name: ASRU_2019_Boeddeker_Paper.pdf file_size: 200256 relation: main_file - access_level: open_access content_type: application/pdf creator: huesera date_created: 2020-02-06T07:42:55Z date_updated: 2020-02-06T07:42:55Z file_id: '15818' file_name: ASRU_2019_Boeddeker_Poster.pdf file_size: 123963 relation: main_file file_date_updated: 2020-02-06T07:42:55Z has_accepted_license: '1' language: - iso: eng oa: '1' project: - _id: '52' name: Computing Resources Provided by the Paderborn Center for Parallel Computing publication: ASRU 2019, Sentosa, Singapore status: public title: An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription type: conference user_id: '59789' year: '2019' ... --- _id: '14821' article_type: original author: - first_name: Agnes Regina full_name: Seipelt, Agnes Regina id: '24239' last_name: Seipelt citation: ama: Seipelt AR. Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien. Weberiana. 2019;29:107–161. apa: Seipelt, A. R. (2019). Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien. Weberiana, 29, 107–161. bibtex: '@article{Seipelt_2019, title={Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien}, volume={29}, journal={Weberiana}, publisher={Allitera}, author={Seipelt, Agnes Regina}, year={2019}, pages={107–161} }' chicago: 'Seipelt, Agnes Regina. “Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien.” Weberiana 29 (2019): 107–161.' ieee: A. R. Seipelt, “Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien,” Weberiana, vol. 29, pp. 107–161, 2019. mla: Seipelt, Agnes Regina. “Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien.” Weberiana, vol. 29, Allitera, 2019, pp. 107–161. short: A.R. Seipelt, Weberiana 29 (2019) 107–161. date_created: 2019-11-06T08:34:40Z date_updated: 2022-01-06T06:52:06Z intvolume: ' 29' keyword: - Weber - Wien - Zensur language: - iso: ger page: 107–161 publication: Weberiana publication_identifier: isbn: - 978-3-96233-182-5 publication_status: published publisher: Allitera status: public title: Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien type: journal_article user_id: '24239' volume: 29 year: '2019' ...