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.
"}],"citation":{"short":"S. Ramakrishnan, L. Schärfen, K. Hunold, S. Fricke, G. Grundmeier, M. Schlierf, A. Keller, G. Krainer, Nanoscale 11 (2019) 16270–16276.","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.","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.","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"},"user_id":"48864","publication_status":"published","department":[{"_id":"302"}]},{"department":[{"_id":"563"}],"citation":{"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.","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} }","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.","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.","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."},"user_id":"21240","title":"Potentials for the Integration of Design Thinking along Automotive Systems Engineering focusing Security and Safety","conference":{"end_date":"2019-08-08","location":"Delft, Niederlande, 2019","start_date":"2019-08-05","name":"Proceedings of the International Conference on Engineering Design (ICED 19) "},"author":[{"first_name":"Julian","full_name":"Tekaat, Julian","last_name":"Tekaat"},{"first_name":"Aschot","full_name":"Kharatyan, Aschot","last_name":"Kharatyan"},{"last_name":"Anacker","first_name":"Harald","full_name":"Anacker, Harald"},{"full_name":"Dumitrescu, Roman","first_name":"Roman","id":"16190","last_name":"Dumitrescu"}],"date_updated":"2022-01-06T06:55:39Z","_id":"22748","language":[{"iso":"eng"}],"year":"2019","type":"conference","status":"public","date_created":"2021-07-15T10:55:48Z","publication":"Proceedings of the International Conference on Engineering Design (ICED 19), 5.-8. August 2019, Delft, Niederlande, 2019"},{"_id":"9275","file_date_updated":"2019-12-06T13:47:58Z","date_updated":"2022-01-06T07:04:12Z","publisher":"Springer International Publishing","date_created":"2019-04-23T11:47:23Z","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"unknown":["978-3-030-24853-6"]},"year":"2019","publication_status":"published","citation":{"short":"S. Gottschalk, F. Rittmeier, G. Engels, in: B. Shishkov (Ed.), Business Modeling and Software Design, Springer International Publishing, 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.","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.","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","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"},"series_title":"Lecture Notes in Business Information Processing","department":[{"_id":"66"}],"author":[{"full_name":"Gottschalk, Sebastian","first_name":"Sebastian","last_name":"Gottschalk","id":"47208"},{"id":"5281","last_name":"Rittmeier","first_name":"Florian","full_name":"Rittmeier, Florian"},{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"}],"editor":[{"full_name":"Shishkov, Boris","first_name":"Boris","last_name":"Shishkov"}],"conference":{"location":"Lisbon","start_date":"2019-07-01","name":"International Symposium on Business Modeling and Software Design","end_date":"2019-07-03"},"page":"153-169","publication":"Business Modeling and Software Design","ddc":["000"],"type":"conference","keyword":["Software Ecosystems","Business Models","Variabilities"],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-030-24854-3_10"}],"user_id":"47208","oa":"1","file":[{"content_type":"application/pdf","access_level":"open_access","file_id":"14988","date_created":"2019-11-14T14:47:32Z","creator":"sego","file_name":"BMSD.pdf","file_size":546764,"date_updated":"2019-12-06T13:47:58Z","relation":"main_file"}],"title":"Business Models of Store-Oriented Software Ecosystems: A Variability Modeling Approach","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."}],"doi":"10.1007/978-3-030-24854-3_10","has_accepted_license":"1","project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"},{"_id":"17","name":"SFB 901 - Subproject C5"}]},{"department":[{"_id":"66"}],"user_id":"477","citation":{"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} }","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.","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.","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.","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.","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."},"has_accepted_license":"1","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"}],"project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"1","name":"SFB 901"}],"author":[{"first_name":"Linghui","full_name":"Luo, Linghui","last_name":"Luo"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","id":"11319","last_name":"Strothmann"}],"file":[{"file_size":372026,"file_name":"IPDPS_main.pdf","creator":"thim","date_created":"2019-02-12T13:37:35Z","access_level":"closed","content_type":"application/pdf","file_id":"7637","relation":"main_file","date_updated":"2019-02-12T13:37:35Z"}],"title":"MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability","conference":{"start_date":"2019-05-20","location":"Rio de Janeiro, Brazil","name":"2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","end_date":"2019-05-25"},"date_updated":"2022-01-06T07:03:42Z","file_date_updated":"2019-02-12T13:37:35Z","_id":"7636","status":"public","language":[{"iso":"eng"}],"type":"conference","year":"2019","date_created":"2019-02-12T13:39:20Z","publication":"Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS '19)","ddc":["006"]},{"main_file_link":[{"open_access":"1","url":"https://zenodo.org/record/2596095/files/2019_DHd_BookOfAbstracts_web.pdf?download=1"}],"user_id":"13929","oa":"1","doi":"10.5281/ZENODO.2596094","project":[{"_id":"39","name":"InterGramm"}],"title":"UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte","page":"352-353","type":"conference_abstract","publication":"DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"publication_status":"published","citation":{"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.","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} }","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.","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","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."},"place":"Frankfurt am Main, Germany","editor":[{"full_name":"Sahle, Patrick","first_name":"Patrick","last_name":"Sahle"}],"author":[{"full_name":"Seemann, Nina","first_name":"Nina","id":"65408","last_name":"Seemann"},{"full_name":"Merten, Marie-Luis","first_name":"Marie-Luis","last_name":"Merten"}],"conference":{"name":"DHd 2019 Digital Humanities: multimedial & multimodal.","start_date":"2019-03-25","location":"Mainz and Frankfurt am Main, Germany","end_date":"2019-03-29"},"date_updated":"2022-01-06T07:03:56Z","_id":"8529","status":"public","language":[{"iso":"ger"}],"publication_identifier":{"isbn":["978-3-00-062166-6"]},"year":"2019","publisher":"Zenodo","date_created":"2019-03-21T08:39:17Z"},{"status":"public","language":[{"iso":"ger"}],"publication_identifier":{"isbn":["978-3-00-062166-6"]},"year":"2019","publisher":"Zenodo","date_created":"2019-03-21T09:02:37Z","date_updated":"2022-01-06T07:03:56Z","_id":"8532","place":"Frankfurt am Main, Germany","author":[{"id":"38837","last_name":"Bäumer","full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon"},{"first_name":"Bianca","full_name":"Buff, Bianca","last_name":"Buff"},{"orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela","first_name":"Michaela","id":"42496","last_name":"Geierhos"}],"editor":[{"last_name":"Sahle","first_name":"Patrick","full_name":"Sahle, Patrick"}],"conference":{"end_date":"2019-03-29","name":"DHd 2019 Digital Humanities: multimedial & multimodal.","start_date":"2019-03-25","location":"Mainz and Frankfurt am Main, Germany"},"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"publication_status":"published","citation":{"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","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","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.","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} }","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."},"type":"conference_abstract","publication":"DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts","page":"192-193","doi":"10.5281/zenodo.2596095","title":"Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen","main_file_link":[{"open_access":"1","url":"https://zenodo.org/record/2596095/files/2019_DHd_BookOfAbstracts_web.pdf?download=1"}],"oa":"1","user_id":"13929"},{"type":"conference","publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","ddc":["004"],"page":"287--296","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"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."}],"doi":"10.1145/3323165.3323193","has_accepted_license":"1","title":"Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities","file":[{"relation":"main_file","date_updated":"2019-08-26T09:14:32Z","success":1,"creator":"ups","file_name":"p287-feldmann.pdf","file_size":1295095,"content_type":"application/pdf","file_id":"12954","access_level":"closed","date_created":"2019-08-26T09:14:32Z"}],"external_id":{"arxiv":["1805.03472"]},"user_id":"477","language":[{"iso":"eng"}],"year":"2019","status":"public","date_created":"2019-03-21T14:37:26Z","publisher":"ACM","date_updated":"2022-01-06T07:03:56Z","file_date_updated":"2019-08-26T09:14:32Z","_id":"8534","author":[{"last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael","first_name":"Michael"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"department":[{"_id":"79"}],"citation":{"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} }","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.","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","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","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.","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."}},{"citation":{"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","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","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.","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.","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} }","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."},"department":[{"_id":"79"}],"author":[{"first_name":"John","full_name":"Augustine, John","last_name":"Augustine"},{"full_name":"Ghaffari, Mohsen","first_name":"Mohsen","last_name":"Ghaffari"},{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"full_name":"Hinnenthal, Kristian","first_name":"Kristian","id":"32229","last_name":"Hinnenthal"},{"full_name":"Kuhn, Fabian","first_name":"Fabian","last_name":"Kuhn"},{"last_name":"Li","full_name":"Li, Jason","first_name":"Jason"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"_id":"8871","file_date_updated":"2019-08-26T11:17:58Z","date_updated":"2022-01-06T07:04:04Z","date_created":"2019-04-10T08:20:34Z","publisher":"ACM","year":"2019","language":[{"iso":"eng"}],"status":"public","user_id":"477","title":"Distributed Computation in Node-Capacitated Networks","file":[{"success":1,"date_updated":"2019-08-26T11:17:58Z","relation":"main_file","access_level":"closed","content_type":"application/pdf","file_id":"12964","date_created":"2019-08-26T11:17:58Z","creator":"ups","file_size":1275192,"file_name":"p69-augustine.pdf"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"has_accepted_license":"1","doi":"10.1145/3323165.3323195","page":"69--79","ddc":["004"],"publication":"Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures","type":"conference"},{"citation":{"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.","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.","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","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","short":"S. Johannesmann, M. Webersen, J. Düchting, L. Claes, B. Henning, in: 45th Annual Review of Progress in Quantitative Nondestructive Evaluation , 2019.","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} }","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."},"user_id":"11829","publication_status":"published","department":[{"_id":"49"}],"conference":{"end_date":"2018-07-19","location":"Burlington","start_date":"2018-07-16","name":"45th Annual Review of Progress in Quantitative Nondestructive Evaluation "},"title":"Characterization of the linear-acoustic material behavior of fiber-reinforced composites using lamb waves","author":[{"full_name":"Johannesmann, Sarah","first_name":"Sarah","last_name":"Johannesmann","id":"29190"},{"first_name":"Manuel","full_name":"Webersen, Manuel","id":"11289","last_name":"Webersen","orcid":"0000-0001-6411-4232"},{"last_name":"Düchting","first_name":"Julia","full_name":"Düchting, Julia"},{"last_name":"Claes","id":"11829","first_name":"Leander","full_name":"Claes, Leander","orcid":"0000-0002-4393-268X"},{"first_name":"Bernd","full_name":"Henning, Bernd","id":"213","last_name":"Henning"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"},{"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","_id":"88"}],"intvolume":" 38","doi":"10.1063/1.5099742","_id":"9718","volume":38,"date_updated":"2022-01-06T07:04:18Z","publication":"45th Annual Review of Progress in Quantitative Nondestructive Evaluation ","date_created":"2019-05-11T09:49:57Z","year":"2019","type":"conference","publication_identifier":{"unknown":["978-0-7354-1832-5"]},"language":[{"iso":"eng"}],"status":"public"},{"has_accepted_license":"1","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."}],"file":[{"file_id":"6513","content_type":"application/pdf","access_level":"open_access","date_created":"2019-01-08T14:03:53Z","creator":"hsiemes","file_size":4153528,"file_name":"cor-parallel-bp-for-upmsp.pdf","date_updated":"2019-01-08T14:03:53Z","relation":"main_file"}],"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","keyword":["parallel machine scheduling with setup times","parallel branch-and-price algorithm","high performance computing","master/worker parallelization"],"user_id":"61579","oa":"1","type":"journal_article","ddc":["000"],"publication":"Computers & Operations Research","issue":"104","page":"338-357","author":[{"full_name":"Rauchecker, Gerhard","first_name":"Gerhard","last_name":"Rauchecker"},{"full_name":"Schryen, Guido","first_name":"Guido","last_name":"Schryen","id":"72850"}],"department":[{"_id":"277"}],"citation":{"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.","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} }","short":"G. Rauchecker, G. Schryen, Computers & Operations Research (2019) 338–357.","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.","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."},"status":"public","language":[{"iso":"eng"}],"year":"2019","publisher":"Elsevier","date_created":"2019-01-08T13:50:44Z","date_updated":"2022-01-06T07:03:08Z","_id":"6512","file_date_updated":"2019-01-08T14:03:53Z"},{"citation":{"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.","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","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","short":"T. Sahai, A. Ziessler, S. Klus, M. Dellnitz, 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.","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} }"},"user_id":"47427","publication_status":"published","department":[{"_id":"101"}],"title":"Continuous relaxations for the traveling salesman problem","author":[{"first_name":"Tuhin","full_name":"Sahai, Tuhin","last_name":"Sahai"},{"last_name":"Ziessler","full_name":"Ziessler, Adrian","first_name":"Adrian"},{"last_name":"Klus","full_name":"Klus, Stefan","first_name":"Stefan"},{"last_name":"Dellnitz","full_name":"Dellnitz, Michael","first_name":"Michael"}],"doi":"10.1007/s11071-019-05092-5","_id":"16709","date_updated":"2022-01-06T06:52:55Z","publication":"Nonlinear Dynamics","date_created":"2020-04-16T14:05:04Z","type":"journal_article","publication_identifier":{"issn":["0924-090X","1573-269X"]},"year":"2019","language":[{"iso":"eng"}],"status":"public"},{"type":"conference","ddc":["004"],"publication":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming","volume":132,"page":"150:1--150:14","doi":"10.4230/LIPICS.ICALP.2019.150","has_accepted_license":"1","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."}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"access_level":"closed","file_id":"12955","content_type":"application/pdf","date_created":"2019-08-26T09:21:27Z","creator":"ups","file_name":"LIPIcs-ICALP-2019-150.pdf","file_size":537649,"success":1,"date_updated":"2019-08-26T09:21:27Z","relation":"main_file"}],"title":"On the Complexity of Local Graph Transformations","user_id":"477","keyword":["Graphs transformations","NP-hardness","approximation algorithms"],"status":"public","year":"2019","language":[{"iso":"eng"}],"publisher":"Dagstuhl Publishing","date_created":"2019-07-08T17:19:01Z","date_updated":"2022-01-06T06:50:45Z","_id":"10586","file_date_updated":"2019-08-26T09:21:27Z","intvolume":" 132","author":[{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"},{"first_name":"Alexander","full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer"}],"conference":{"name":"ICALP 2019","location":"Patras, Greece","start_date":"2019-07-09","end_date":"2019-07-12"},"department":[{"_id":"79"}],"publication_status":"published","series_title":"LIPIcs","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","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.","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} }","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."}},{"date_created":"2019-07-10T08:13:31Z","publication_identifier":{"issn":["0925-5001","1573-2916"]},"year":"2019","language":[{"iso":"eng"}],"status":"public","_id":"10595","date_updated":"2022-01-06T06:50:46Z","article_type":"original","author":[{"first_name":"Bennet","full_name":"Gebken, Bennet","last_name":"Gebken","id":"32643"},{"orcid":"https://orcid.org/0000-0002-3389-793X","full_name":"Peitz, Sebastian","first_name":"Sebastian","id":"47427","last_name":"Peitz"},{"last_name":"Dellnitz","first_name":"Michael","full_name":"Dellnitz, Michael"}],"intvolume":" 73","citation":{"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} }","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.","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","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.","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."},"publication_status":"published","department":[{"_id":"101"}],"publication":"Journal of Global Optimization","type":"journal_article","page":"891-913","volume":73,"issue":"4","title":"On the hierarchical structure of Pareto critical sets","doi":"10.1007/s10898-019-00737-6","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."}],"user_id":"47427"},{"_id":"12870","page":"120 - 137","date_updated":"2022-01-06T06:51:20Z","publication":"Proceedings of the 17th Workshop on Approximation and Online Algorithms (WAOA)","date_created":"2019-07-22T09:00:05Z","publisher":"Springer","type":"conference","year":"2019","language":[{"iso":"eng"}],"status":"public","citation":{"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.","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} }","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.","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.","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.","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"},"user_id":"22704","publication_status":"published","external_id":{"arxiv":["1907.09834"]},"department":[{"_id":"63"}],"title":"Managing Multiple Mobile Resources","author":[{"id":"22704","last_name":"Feldkord","full_name":"Feldkord, Björn","first_name":"Björn"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"last_name":"Malatyali","first_name":"Manuel","full_name":"Malatyali, Manuel"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"doi":"10.1007/978-3-030-39479-0_9"},{"date_created":"2019-08-14T06:59:23Z","funded_apc":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2047-7538"]},"year":"2019","status":"public","file_date_updated":"2019-08-14T07:11:36Z","_id":"12919","date_updated":"2022-01-06T06:51:26Z","author":[{"last_name":"Georgi","full_name":"Georgi, Philip","first_name":"Philip"},{"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","last_name":"Luo","id":"36389","orcid":"0000-0003-1008-4976"},{"last_name":"Sain","full_name":"Sain, Basudeb","first_name":"Basudeb"},{"last_name":"Montaut","first_name":"Nicola","full_name":"Montaut, Nicola"},{"last_name":"Herrmann","id":"216","first_name":"Harald","full_name":"Herrmann, Harald"},{"last_name":"Weiss","first_name":"Thomas","full_name":"Weiss, Thomas"},{"last_name":"Li","full_name":"Li, Guixin","first_name":"Guixin"},{"first_name":"Christine","full_name":"Silberhorn, Christine","last_name":"Silberhorn","id":"26263"},{"orcid":"0000-0002-8662-1101","last_name":"Zentgraf","id":"30525","full_name":"Zentgraf, Thomas","first_name":"Thomas"}],"intvolume":" 8","citation":{"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} }","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.","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","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.","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."},"publication_status":"published","department":[{"_id":"15"},{"_id":"230"},{"_id":"289"}],"publication":"Light: Science & Applications","ddc":["530"],"type":"journal_article","page":"70","volume":8,"title":"Metasurface interferometry toward quantum sensors","file":[{"date_updated":"2019-08-14T07:11:36Z","relation":"main_file","success":1,"creator":"zentgraf","file_name":"LSA_Georgi_2019_Quantum metasurface.pdf","file_size":748999,"content_type":"application/pdf","access_level":"closed","file_id":"12921","date_created":"2019-08-14T07:11:36Z"}],"project":[{"name":"TRR 142","_id":"53"},{"_id":"56","name":"TRR 142 - Project Area C"},{"name":"TRR 142 - Subproject C2","_id":"72"},{"name":"TRR 142 - Subproject C5","_id":"75"}],"has_accepted_license":"1","doi":"10.1038/s41377-019-0182-6","user_id":"30525"},{"title":"Shortest Paths in a Hybrid Network Model","author":[{"last_name":"Augustine","first_name":"John","full_name":"Augustine, John"},{"first_name":"Kristian","full_name":"Hinnenthal, Kristian","id":"32229","last_name":"Hinnenthal"},{"last_name":"Kuhn","full_name":"Kuhn, Fabian","first_name":"Fabian"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"last_name":"Schneider","full_name":"Schneider, Philipp","first_name":"Philipp"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"place":"Philadelphia, PA","doi":"10.1137/1.9781611975994.78","citation":{"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.","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} }","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.","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","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."},"user_id":"32229","publication_status":"published","publication":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","date_created":"2020-01-22T09:07:36Z","type":"conference","year":"2019","publication_identifier":{"isbn":["9781611975994"]},"language":[{"iso":"eng"}],"status":"public","page":"1280-1299","_id":"15627","date_updated":"2022-01-06T06:52:30Z"},{"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"doi":"10.1038/s42004-019-0220-6","intvolume":" 2","title":"Time-dependent vibrational sum-frequency generation spectroscopy of the air-water interface","author":[{"last_name":"Ojha","first_name":"Deepak","full_name":"Ojha, Deepak"},{"last_name":"Kaliannan","full_name":"Kaliannan, Naveen Kumar","first_name":"Naveen Kumar"},{"last_name":"Kühne","first_name":"Thomas D.","full_name":"Kühne, Thomas D."}],"citation":{"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.","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} }","short":"D. Ojha, N.K. Kaliannan, T.D. Kühne, Communications Chemistry 2 (2019) 116.","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","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."},"user_id":"71692","publication_status":"published","year":"2019","publication_identifier":{"issn":["2399-3669"]},"type":"journal_article","language":[{"iso":"eng"}],"status":"public","publication":"Communications Chemistry","date_created":"2020-01-30T13:06:44Z","date_updated":"2022-01-06T06:52:32Z","issue":"1","page":"116","_id":"15724","volume":2},{"title":"An Investigation Into the Effectiveness of Enhancement in ASR Training and Test for Chime-5 Dinner Party Transcription","author":[{"last_name":"Zorila","full_name":"Zorila, Catalin","first_name":"Catalin"},{"last_name":"Boeddeker","id":"40767","first_name":"Christoph","full_name":"Boeddeker, Christoph"},{"first_name":"Rama","full_name":"Doddipatla, Rama","last_name":"Doddipatla"},{"full_name":"Haeb-Umbach, Reinhold","first_name":"Reinhold","id":"242","last_name":"Haeb-Umbach"}],"file":[{"content_type":"application/pdf","access_level":"open_access","file_id":"15817","date_created":"2020-02-06T07:42:42Z","creator":"huesera","file_name":"ASRU_2019_Boeddeker_Paper.pdf","file_size":200256,"relation":"main_file","date_updated":"2020-02-06T07:42:42Z"},{"relation":"main_file","date_updated":"2020-02-06T07:42:55Z","date_created":"2020-02-06T07:42:55Z","file_id":"15818","access_level":"open_access","content_type":"application/pdf","file_size":123963,"file_name":"ASRU_2019_Boeddeker_Poster.pdf","creator":"huesera"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"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."}],"has_accepted_license":"1","citation":{"short":"C. Zorila, C. Boeddeker, R. Doddipatla, R. Haeb-Umbach, 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.","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.","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.","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."},"user_id":"59789","oa":"1","department":[{"_id":"54"}],"publication":"ASRU 2019, Sentosa, Singapore","ddc":["000"],"date_created":"2020-02-06T07:35:08Z","year":"2019","type":"conference","language":[{"iso":"eng"}],"status":"public","_id":"15816","file_date_updated":"2020-02-06T07:42:55Z","date_updated":"2022-01-06T06:52:37Z"},{"author":[{"last_name":"Seipelt","id":"24239","first_name":"Agnes Regina","full_name":"Seipelt, Agnes Regina"}],"title":"Aufführungs- und zensurbedingte Veränderungen im Wiener Manuskript der Freischütz-Erstaufführung 1821 in Wien","article_type":"original","intvolume":" 29","keyword":["Weber","Wien","Zensur"],"publication_status":"published","user_id":"24239","citation":{"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.","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} }","short":"A.R. Seipelt, Weberiana 29 (2019) 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.","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.","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."},"publisher":"Allitera","date_created":"2019-11-06T08:34:40Z","publication":"Weberiana","status":"public","language":[{"iso":"ger"}],"publication_identifier":{"isbn":["978-3-96233-182-5"]},"type":"journal_article","year":"2019","volume":29,"page":"107–161","_id":"14821","date_updated":"2022-01-06T06:52:06Z"}]