[{"year":"2019","date_created":"2019-02-26T18:07:33Z","publisher":"Elsevier BV","title":"Joint testing and profiling of microservice-based network services using TTCN-3","publication":"ICT Express","file":[{"file_id":"8114","access_level":"open_access","file_name":"main_for_ris.pdf","file_size":232599,"date_created":"2019-02-26T18:09:43Z","creator":"peuster","date_updated":"2019-02-26T18:09:43Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"The ongoing softwarization of networks creates a big need for automated testing solutions to ensure service quality. This becomes even more important if agile environments with short time to market and high demands, in terms of service performance and availability, are considered.\r\nIn this paper, we introduce a novel testing solution for virtualized, microservice-based network functions and services, which we base on TTCN-3, a well known testing language defined by the European standards institute (ETSI). We use TTCN-3 not only for functional testing but also answer the question whether TTCN-3 can be used for  performance profiling tasks as well. Finally, we demonstrate the proposed concepts and solutions in a case study using our open-source prototype to test and profile a chained network service."}],"language":[{"iso":"eng"}],"ddc":["000"],"publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2405-9595"]},"citation":{"ama":"Peuster M, Dröge C, Boos C, Karl H. Joint testing and profiling of microservice-based network services using TTCN-3. <i>ICT Express</i>. 2019. doi:<a href=\"https://doi.org/10.1016/j.icte.2019.02.001\">10.1016/j.icte.2019.02.001</a>","chicago":"Peuster, Manuel, Christian Dröge, Clemens Boos, and Holger Karl. “Joint Testing and Profiling of Microservice-Based Network Services Using TTCN-3.” <i>ICT Express</i>, 2019. <a href=\"https://doi.org/10.1016/j.icte.2019.02.001\">https://doi.org/10.1016/j.icte.2019.02.001</a>.","ieee":"M. Peuster, C. Dröge, C. Boos, and H. Karl, “Joint testing and profiling of microservice-based network services using TTCN-3,” <i>ICT Express</i>, 2019.","short":"M. Peuster, C. Dröge, C. Boos, H. Karl, ICT Express (2019).","bibtex":"@article{Peuster_Dröge_Boos_Karl_2019, title={Joint testing and profiling of microservice-based network services using TTCN-3}, DOI={<a href=\"https://doi.org/10.1016/j.icte.2019.02.001\">10.1016/j.icte.2019.02.001</a>}, journal={ICT Express}, publisher={Elsevier BV}, author={Peuster, Manuel and Dröge, Christian and Boos, Clemens and Karl, Holger}, year={2019} }","mla":"Peuster, Manuel, et al. “Joint Testing and Profiling of Microservice-Based Network Services Using TTCN-3.” <i>ICT Express</i>, Elsevier BV, 2019, doi:<a href=\"https://doi.org/10.1016/j.icte.2019.02.001\">10.1016/j.icte.2019.02.001</a>.","apa":"Peuster, M., Dröge, C., Boos, C., &#38; Karl, H. (2019). Joint testing and profiling of microservice-based network services using TTCN-3. <i>ICT Express</i>. <a href=\"https://doi.org/10.1016/j.icte.2019.02.001\">https://doi.org/10.1016/j.icte.2019.02.001</a>"},"author":[{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"full_name":"Dröge, Christian","last_name":"Dröge","first_name":"Christian"},{"first_name":"Clemens","full_name":"Boos, Clemens","last_name":"Boos"},{"last_name":"Karl","id":"126","full_name":"Karl, Holger","first_name":"Holger"}],"date_updated":"2022-01-06T07:03:51Z","oa":"1","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/S2405959519300402","open_access":"1"}],"doi":"10.1016/j.icte.2019.02.001","type":"journal_article","status":"public","user_id":"477","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"}],"_id":"8113","file_date_updated":"2019-02-26T18:09:43Z"},{"quality_controlled":"1","publication_status":"published","year":"2019","place":"Basel, Switzerland","citation":{"mla":"Bäumer, Frederik Simon, and Michaela Geierhos. “Requirements Engineering in OTF-Computing.” <i>Encyclopedia.Pub</i>, MDPI, 2019.","short":"F.S. Bäumer, M. Geierhos, in: Encyclopedia.Pub, MDPI, Basel, Switzerland, 2019.","bibtex":"@inbook{Bäumer_Geierhos_2019, place={Basel, Switzerland}, title={Requirements Engineering in OTF-Computing}, booktitle={encyclopedia.pub}, publisher={MDPI}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, year={2019} }","apa":"Bäumer, F. S., &#38; Geierhos, M. (2019). Requirements Engineering in OTF-Computing. In <i>encyclopedia.pub</i>. Basel, Switzerland: MDPI.","ieee":"F. S. Bäumer and M. Geierhos, “Requirements Engineering in OTF-Computing,” in <i>encyclopedia.pub</i>, Basel, Switzerland: MDPI, 2019.","chicago":"Bäumer, Frederik Simon, and Michaela Geierhos. “Requirements Engineering in OTF-Computing.” In <i>Encyclopedia.Pub</i>. Basel, Switzerland: MDPI, 2019.","ama":"Bäumer FS, Geierhos M. Requirements Engineering in OTF-Computing. In: <i>Encyclopedia.Pub</i>. Basel, Switzerland: MDPI; 2019."},"oa":"1","publisher":"MDPI","date_updated":"2022-01-06T07:03:53Z","date_created":"2019-03-05T08:54:37Z","author":[{"first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon","id":"38837","last_name":"Bäumer"},{"first_name":"Michaela","full_name":"Geierhos, Michaela","id":"42496","last_name":"Geierhos","orcid":"0000-0002-8180-5606"}],"title":"Requirements Engineering in OTF-Computing","main_file_link":[{"url":"https://encyclopedia.pub/131","open_access":"1"}],"publication":"encyclopedia.pub","type":"encyclopedia_article","status":"public","_id":"8312","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"user_id":"42496","keyword":["OTF Computing","Natural Language Processing","Requirements Engineering"],"language":[{"iso":"eng"}]},{"type":"journal_article","status":"public","user_id":"61579","department":[{"_id":"277"}],"_id":"5674","file_date_updated":"2018-12-13T15:16:37Z","has_accepted_license":"1","citation":{"mla":"Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response.” <i>European Journal of Operational Research</i>, vol. 272, no. 1, Elsevier, 2019, pp. 352–63.","short":"G. Rauchecker, G. Schryen, European Journal of Operational Research 272 (2019) 352–363.","bibtex":"@article{Rauchecker_Schryen_2019, title={An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response}, volume={272}, number={1}, journal={European Journal of Operational Research}, publisher={Elsevier}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2019}, pages={352–363} }","apa":"Rauchecker, G., &#38; Schryen, G. (2019). An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response. <i>European Journal of Operational Research</i>, <i>272</i>(1), 352–363.","ama":"Rauchecker G, Schryen G. An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response. <i>European Journal of Operational Research</i>. 2019;272(1):352-363.","chicago":"Rauchecker, Gerhard, and Guido Schryen. “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response.” <i>European Journal of Operational Research</i> 272, no. 1 (2019): 352–63.","ieee":"G. Rauchecker and G. Schryen, “An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response,” <i>European Journal of Operational Research</i>, vol. 272, no. 1, pp. 352–363, 2019."},"page":"352 - 363","intvolume":"       272","author":[{"first_name":"Gerhard","last_name":"Rauchecker","full_name":"Rauchecker, Gerhard"},{"first_name":"Guido","last_name":"Schryen","id":"72850","full_name":"Schryen, Guido"}],"volume":272,"date_updated":"2022-01-06T07:02:28Z","oa":"1","publication":"European Journal of Operational Research","file":[{"relation":"main_file","content_type":"application/pdf","file_size":1470310,"access_level":"open_access","file_id":"6019","file_name":"JOURNAL VERSION.pdf","date_updated":"2018-12-13T15:16:37Z","creator":"hsiemes","date_created":"2018-12-07T11:13:12Z"}],"abstract":[{"text":"In disaster operations management, a challenging task for rescue organizations occurs when they have to assign and schedule their rescue units to emerging incidents under time pressure in order to reduce the overall resulting harm. Of particular importance in practical scenarios is the need to consider collaboration of rescue units. This task has hardly been addressed in the literature. We contribute to both modeling and solving this problem by (1) conceptualizing the situation as a type of scheduling problem, (2) modeling it as a binary linear minimization problem, (3) suggesting a branch-and-price algorithm, which can serve as both an exact and heuristic solution procedure, and (4) conducting computational experiments - including a sensitivity analysis of the effects of exogenous model parameters on execution times and objective value improvements over a heuristic suggested in the literature - for different practical disaster scenarios. The results of our computational experiments show that most problem instances of practically feasible size can be solved to optimality within ten minutes. Furthermore, even when our algorithm is terminated once the first feasible solution has been found, this solution is in almost all cases competitive to the optimal solution and substantially better than the solution obtained by the best known algorithm from the literature. This performance of our branch-and-price algorithm enables rescue organizations to apply our procedure in practice, even when the time for decision making is limited to a few minutes. By addressing a very general type of scheduling problem, our approach applies to various scheduling situations.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"keyword":["OR in disaster relief","disaster operations management","scheduling","branch-and-price"],"issue":"1","year":"2019","date_created":"2018-11-14T15:35:27Z","publisher":"Elsevier","title":"An Exact Branch-and-Price Algorithm for Scheduling Rescue Units during Disaster Response"},{"year":"2019","date_created":"2019-02-04T10:49:03Z","publisher":"Springer International Publishing","title":"Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes","publication":"Business Process Management Workshops","file":[{"title":"Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes","file_size":1208839,"file_name":"PWPfD-REBPM-UPB.pdf","file_id":"10327","access_level":"open_access","date_updated":"2019-06-27T10:59:43Z","creator":"floriar","date_created":"2019-06-27T10:55:28Z","relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"ddc":["000"],"publication_status":"published","publication_identifier":{"isbn":["9783030116408","9783030116415"],"issn":["1865-1348","1865-1356"]},"has_accepted_license":"1","citation":{"short":"F. Rittmeier, G. Engels, A. Teetz, in: F. Daniel,  Quan Z. Sheng, H. Motahari (Eds.), Business Process Management Workshops, Springer International Publishing, Cham, 2019, pp. 531–542.","bibtex":"@inbook{Rittmeier_Engels_Teetz_2019, place={Cham}, series={Lecture Notes in Business Information Processing}, title={Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes}, volume={342}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-11641-5_42\">10.1007/978-3-030-11641-5_42</a>}, booktitle={Business Process Management Workshops}, publisher={Springer International Publishing}, author={Rittmeier, Florian and Engels, Gregor and Teetz, Alexander}, editor={Daniel, Florian and Sheng,  Quan Z. and Motahari, HamidEditors}, year={2019}, pages={531–542}, collection={Lecture Notes in Business Information Processing} }","mla":"Rittmeier, Florian, et al. “Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes.” <i>Business Process Management Workshops</i>, edited by Florian Daniel et al., vol. 342, Springer International Publishing, 2019, pp. 531–42, doi:<a href=\"https://doi.org/10.1007/978-3-030-11641-5_42\">10.1007/978-3-030-11641-5_42</a>.","apa":"Rittmeier, F., Engels, G., &#38; Teetz, A. (2019). Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes. In F. Daniel,  Quan Z. Sheng, &#38; H. Motahari (Eds.), <i>Business Process Management Workshops</i> (Vol. 342, pp. 531–542). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-11641-5_42\">https://doi.org/10.1007/978-3-030-11641-5_42</a>","ama":"Rittmeier F, Engels G, Teetz A. Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes. In: Daniel F, Sheng  Quan Z., Motahari H, eds. <i>Business Process Management Workshops</i>. Vol 342. Lecture Notes in Business Information Processing. Cham: Springer International Publishing; 2019:531-542. doi:<a href=\"https://doi.org/10.1007/978-3-030-11641-5_42\">10.1007/978-3-030-11641-5_42</a>","chicago":"Rittmeier, Florian, Gregor Engels, and Alexander Teetz. “Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes.” In <i>Business Process Management Workshops</i>, edited by Florian Daniel,  Quan Z. Sheng, and Hamid Motahari, 342:531–42. Lecture Notes in Business Information Processing. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-11641-5_42\">https://doi.org/10.1007/978-3-030-11641-5_42</a>.","ieee":"F. Rittmeier, G. Engels, and A. Teetz, “Process Weakness Patterns for the Identification of Digitalization Potentials in Business Processes,” in <i>Business Process Management Workshops</i>, vol. 342, F. Daniel,  Quan Z. Sheng, and H. Motahari, Eds. Cham: Springer International Publishing, 2019, pp. 531–542."},"page":"531-542","intvolume":"       342","place":"Cham","author":[{"full_name":"Rittmeier, Florian","id":"5281","last_name":"Rittmeier","first_name":"Florian"},{"full_name":"Engels, Gregor","id":"107","last_name":"Engels","first_name":"Gregor"},{"full_name":"Teetz, Alexander","id":"5319","last_name":"Teetz","first_name":"Alexander"}],"volume":342,"oa":"1","date_updated":"2022-01-06T07:03:38Z","doi":"10.1007/978-3-030-11641-5_42","type":"book_chapter","status":"public","editor":[{"last_name":"Daniel","full_name":"Daniel, Florian","first_name":"Florian"},{"full_name":"Sheng,  Quan Z.","last_name":"Sheng","first_name":" Quan Z."},{"last_name":"Motahari","full_name":"Motahari, Hamid","first_name":"Hamid"}],"user_id":"5281","series_title":"Lecture Notes in Business Information Processing","department":[{"_id":"66"},{"_id":"534"}],"_id":"7430","file_date_updated":"2019-06-27T10:59:43Z"},{"status":"public","type":"conference","file_date_updated":"2019-04-27T06:09:45Z","department":[{"_id":"66"}],"user_id":"11871","_id":"7668","project":[{"name":"SFB 901 - Subproject C5","_id":"17"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"}],"page":"670-680","citation":{"chicago":"Heindorf, Stefan, Yan Scholten, Gregor Engels, and Martin Potthast. “Debiasing Vandalism Detection Models at Wikidata.” In <i>WWW</i>, 670–80. ACM, 2019. <a href=\"https://doi.org/10.1145/3308558.3313507\">https://doi.org/10.1145/3308558.3313507</a>.","ieee":"S. Heindorf, Y. Scholten, G. Engels, and M. Potthast, “Debiasing Vandalism Detection Models at Wikidata,” in <i>WWW</i>, San Francisco, USA, 2019, pp. 670–680.","ama":"Heindorf S, Scholten Y, Engels G, Potthast M. Debiasing Vandalism Detection Models at Wikidata. In: <i>WWW</i>. ACM; 2019:670-680. doi:<a href=\"https://doi.org/10.1145/3308558.3313507\">10.1145/3308558.3313507</a>","apa":"Heindorf, S., Scholten, Y., Engels, G., &#38; Potthast, M. (2019). Debiasing Vandalism Detection Models at Wikidata. In <i>WWW</i> (pp. 670–680). San Francisco, USA: ACM. <a href=\"https://doi.org/10.1145/3308558.3313507\">https://doi.org/10.1145/3308558.3313507</a>","mla":"Heindorf, Stefan, et al. “Debiasing Vandalism Detection Models at Wikidata.” <i>WWW</i>, ACM, 2019, pp. 670–80, doi:<a href=\"https://doi.org/10.1145/3308558.3313507\">10.1145/3308558.3313507</a>.","short":"S. Heindorf, Y. Scholten, G. Engels, M. Potthast, in: WWW, ACM, 2019, pp. 670–680.","bibtex":"@inproceedings{Heindorf_Scholten_Engels_Potthast_2019, title={Debiasing Vandalism Detection Models at Wikidata}, DOI={<a href=\"https://doi.org/10.1145/3308558.3313507\">10.1145/3308558.3313507</a>}, booktitle={WWW}, publisher={ACM}, author={Heindorf, Stefan and Scholten, Yan and Engels, Gregor and Potthast, Martin}, year={2019}, pages={670–680} }"},"has_accepted_license":"1","publication_identifier":{"unknown":["978-1-4503-6674-8/19/05"]},"conference":{"start_date":"2019-05-13","name":"2019 World Wide Web Conference (WWW '19)","location":"San Francisco, USA","end_date":"2015-05-17"},"doi":"10.1145/3308558.3313507","main_file_link":[{"url":"https://groups.uni-paderborn.de/fg-engels/publications_pdfs/Konferenzbeitraege/heindorf2019_WWW.pdf","open_access":"1"}],"author":[{"id":"11871","full_name":"Heindorf, Stefan","orcid":"0000-0002-4525-6865","last_name":"Heindorf","first_name":"Stefan"},{"last_name":"Scholten","full_name":"Scholten, Yan","first_name":"Yan"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"first_name":"Martin","last_name":"Potthast","full_name":"Potthast, Martin"}],"oa":"1","date_updated":"2022-01-06T07:03:43Z","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-04-27T06:09:45Z","date_created":"2019-04-27T06:09:45Z","creator":"heindorf","file_size":1302648,"file_id":"9518","file_name":"heindorf2019_WWW.pdf","access_level":"closed"}],"publication":"WWW","language":[{"iso":"eng"}],"ddc":["000"],"year":"2019","title":"Debiasing Vandalism Detection Models at Wikidata","date_created":"2019-02-13T14:10:36Z","publisher":"ACM"},{"citation":{"ama":"Bäumer FS, Kersting J, Geierhos M. Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches. <i>Computers</i>. 2019;8(1). doi:<a href=\"https://doi.org/10.3390/computers8010022\">10.3390/computers8010022</a>","ieee":"F. S. Bäumer, J. Kersting, and M. Geierhos, “Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches,” <i>Computers</i>, vol. 8, no. 1, 2019.","chicago":"Bäumer, Frederik Simon, Joschka Kersting, and Michaela Geierhos. “Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches.” <i>Computers</i> 8, no. 1 (2019). <a href=\"https://doi.org/10.3390/computers8010022\">https://doi.org/10.3390/computers8010022</a>.","short":"F.S. Bäumer, J. Kersting, M. Geierhos, Computers 8 (2019).","bibtex":"@article{Bäumer_Kersting_Geierhos_2019, title={Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches}, volume={8}, DOI={<a href=\"https://doi.org/10.3390/computers8010022\">10.3390/computers8010022</a>}, number={122}, journal={Computers}, publisher={MDPI AG, Basel, Switzerland}, author={Bäumer, Frederik Simon and Kersting, Joschka and Geierhos, Michaela}, year={2019} }","mla":"Bäumer, Frederik Simon, et al. “Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches.” <i>Computers</i>, vol. 8, no. 1, 22, MDPI AG, Basel, Switzerland, 2019, doi:<a href=\"https://doi.org/10.3390/computers8010022\">10.3390/computers8010022</a>.","apa":"Bäumer, F. S., Kersting, J., &#38; Geierhos, M. (2019). Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches. <i>Computers</i>, <i>8</i>(1). <a href=\"https://doi.org/10.3390/computers8010022\">https://doi.org/10.3390/computers8010022</a>"},"intvolume":"         8","publication_status":"published","publication_identifier":{"issn":["2073-431X"]},"has_accepted_license":"1","main_file_link":[{"url":"https://www.mdpi.com/2073-431X/8/1/22/pdf","open_access":"1"}],"conference":{"end_date":"2018-10-06","location":"Vilnius, Lithuania","name":"24th International Conference on Information and Software Technologies (ICIST 2018)","start_date":"2018-10-04"},"doi":"10.3390/computers8010022","author":[{"id":"38837","full_name":"Bäumer, Frederik Simon","last_name":"Bäumer","first_name":"Frederik Simon"},{"first_name":"Joschka","full_name":"Kersting, Joschka","id":"58701","last_name":"Kersting"},{"first_name":"Michaela","id":"42496","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos"}],"volume":8,"oa":"1","date_updated":"2022-01-06T07:03:55Z","status":"public","type":"journal_article","file_date_updated":"2020-09-18T09:23:34Z","article_type":"original","article_number":"22","user_id":"58701","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"_id":"8424","year":"2019","issue":"1","quality_controlled":"1","title":"Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches","date_created":"2019-03-06T14:27:28Z","publisher":"MDPI AG, Basel, Switzerland","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":3164523,"file_name":"Bäumer et al. (2019), Baeumer2019.pdf","access_level":"closed","file_id":"19572","date_updated":"2020-09-18T09:23:34Z","creator":"jkers","date_created":"2020-09-18T09:23:34Z"}],"abstract":[{"lang":"eng","text":"The vision of On-the-Fly (OTF) Computing is to compose and provide software services ad hoc, based on requirement descriptions in natural language. Since non-technical users write their software requirements themselves and in unrestricted natural language, deficits occur such as inaccuracy and incompleteness. These deficits are usually met by natural language processing methods, which have to face special challenges in OTF Computing because maximum automation is the goal. In this paper, we present current automatic approaches for solving inaccuracies and incompletenesses in natural language requirement descriptions and elaborate open challenges. In particular, we will discuss the necessity of domain-specific resources and show why, despite far-reaching automation, an intelligent and guided integration of end users into the compensation process is required. In this context, we present our idea of a chat bot that integrates users into the compensation process depending on the given circumstances. "}],"publication":"Computers","language":[{"iso":"eng"}],"ddc":["000"],"keyword":["Inaccuracy Detection","Natural Language Software Requirements","Chat Bot"]},{"place":"Frankfurt am Main, Germany","citation":{"short":"N. Seemann, M.-L. Merten, in: P. Sahle (Ed.), DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts, Zenodo, Frankfurt am Main, Germany, 2019, pp. 352–353.","bibtex":"@inproceedings{Seemann_Merten_2019, place={Frankfurt am Main, Germany}, title={UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte}, DOI={<a href=\"https://doi.org/10.5281/ZENODO.2596094\">10.5281/ZENODO.2596094</a>}, booktitle={DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts}, publisher={Zenodo}, author={Seemann, Nina and Merten, Marie-Luis}, editor={Sahle, PatrickEditor}, year={2019}, pages={352–353} }","mla":"Seemann, Nina, and Marie-Luis Merten. “UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte.” <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>, edited by Patrick Sahle, Zenodo, 2019, pp. 352–53, doi:<a href=\"https://doi.org/10.5281/ZENODO.2596094\">10.5281/ZENODO.2596094</a>.","apa":"Seemann, N., &#38; Merten, M.-L. (2019). UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte. In P. Sahle (Ed.), <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i> (pp. 352–353). Frankfurt am Main, Germany: Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.2596094\">https://doi.org/10.5281/ZENODO.2596094</a>","ama":"Seemann N, Merten M-L. UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte. In: Sahle P, ed. <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>. Frankfurt am Main, Germany: Zenodo; 2019:352-353. doi:<a href=\"https://doi.org/10.5281/ZENODO.2596094\">10.5281/ZENODO.2596094</a>","ieee":"N. Seemann and M.-L. Merten, “UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte,” in <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>, Mainz and Frankfurt am Main, Germany, 2019, pp. 352–353.","chicago":"Seemann, Nina, and Marie-Luis Merten. “UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte.” In <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>, edited by Patrick Sahle, 352–53. Frankfurt am Main, Germany: Zenodo, 2019. <a href=\"https://doi.org/10.5281/ZENODO.2596094\">https://doi.org/10.5281/ZENODO.2596094</a>."},"page":"352-353","publication_status":"published","publication_identifier":{"isbn":["978-3-00-062166-6"]},"main_file_link":[{"open_access":"1","url":"https://zenodo.org/record/2596095/files/2019_DHd_BookOfAbstracts_web.pdf?download=1"}],"doi":"10.5281/ZENODO.2596094","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_updated":"2022-01-06T07:03:56Z","oa":"1","author":[{"first_name":"Nina","last_name":"Seemann","id":"65408","full_name":"Seemann, Nina"},{"last_name":"Merten","full_name":"Merten, Marie-Luis","first_name":"Marie-Luis"}],"editor":[{"full_name":"Sahle, Patrick","last_name":"Sahle","first_name":"Patrick"}],"status":"public","type":"conference_abstract","project":[{"_id":"39","name":"InterGramm"}],"_id":"8529","user_id":"13929","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"year":"2019","title":"UPB-Annotate: Ein maßgeschneidertes Toolkit für historische Texte","publisher":"Zenodo","date_created":"2019-03-21T08:39:17Z","publication":"DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts","language":[{"iso":"ger"}]},{"language":[{"iso":"ger"}],"publication":"DHd 2019 Digital Humanities: multimedial & multimodal. Konferenzabstracts","publisher":"Zenodo","date_created":"2019-03-21T09:02:37Z","title":"Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen","year":"2019","_id":"8532","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"user_id":"13929","type":"conference_abstract","editor":[{"full_name":"Sahle, Patrick","last_name":"Sahle","first_name":"Patrick"}],"status":"public","date_updated":"2022-01-06T07:03:56Z","oa":"1","author":[{"first_name":"Frederik Simon","id":"38837","full_name":"Bäumer, Frederik Simon","last_name":"Bäumer"},{"full_name":"Buff, Bianca","last_name":"Buff","first_name":"Bianca"},{"orcid":"0000-0002-8180-5606","last_name":"Geierhos","full_name":"Geierhos, Michaela","id":"42496","first_name":"Michaela"}],"conference":{"name":"DHd 2019 Digital Humanities: multimedial & multimodal.","start_date":"2019-03-25","end_date":"2019-03-29","location":"Mainz and Frankfurt am Main, Germany"},"doi":"10.5281/zenodo.2596095","main_file_link":[{"url":"https://zenodo.org/record/2596095/files/2019_DHd_BookOfAbstracts_web.pdf?download=1","open_access":"1"}],"publication_identifier":{"isbn":["978-3-00-062166-6"]},"publication_status":"published","place":"Frankfurt am Main, Germany","page":"192-193","citation":{"mla":"Bäumer, Frederik Simon, et al. “Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen.” <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>, edited by Patrick Sahle, Zenodo, 2019, pp. 192–93, doi:<a href=\"https://doi.org/10.5281/zenodo.2596095\">10.5281/zenodo.2596095</a>.","bibtex":"@inproceedings{Bäumer_Buff_Geierhos_2019, place={Frankfurt am Main, Germany}, title={Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen}, DOI={<a href=\"https://doi.org/10.5281/zenodo.2596095\">10.5281/zenodo.2596095</a>}, booktitle={DHd 2019 Digital Humanities: multimedial &#38; 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 &#38; multimodal. Konferenzabstracts, Zenodo, Frankfurt am Main, Germany, 2019, pp. 192–193.","apa":"Bäumer, F. S., Buff, B., &#38; Geierhos, M. (2019). Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen. In P. Sahle (Ed.), <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i> (pp. 192–193). Frankfurt am Main, Germany: Zenodo. <a href=\"https://doi.org/10.5281/zenodo.2596095\">https://doi.org/10.5281/zenodo.2596095</a>","ama":"Bäumer FS, Buff B, Geierhos M. Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen. In: Sahle P, ed. <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>. Frankfurt am Main, Germany: Zenodo; 2019:192-193. doi:<a href=\"https://doi.org/10.5281/zenodo.2596095\">10.5281/zenodo.2596095</a>","chicago":"Bäumer, Frederik Simon, Bianca Buff, and Michaela Geierhos. “Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen.” In <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>, edited by Patrick Sahle, 192–93. Frankfurt am Main, Germany: Zenodo, 2019. <a href=\"https://doi.org/10.5281/zenodo.2596095\">https://doi.org/10.5281/zenodo.2596095</a>.","ieee":"F. S. Bäumer, B. Buff, and M. Geierhos, “Potentielle Privatsphäreverletzungen aufdecken und automatisiert sichtbar machen,” in <i>DHd 2019 Digital Humanities: multimedial &#38; multimodal. Konferenzabstracts</i>, Mainz and Frankfurt am Main, Germany, 2019, pp. 192–193."}},{"publication":"5th IEEE International Conference on Network Softwarization (NetSoft 2019)","abstract":[{"lang":"eng","text":"5G together with software defined networking (SDN) and network function virtualisation (NFV) will enable a wide variety of vertical use cases. One of them is the smart man- ufacturing case which utilises 5G networks to interconnect production machines, machine parks, and factory sites to enable new possibilities in terms of flexibility, automation, and novel applications (industry 4.0). However, the availability of realistic and practical proof-of-concepts for those smart manufacturing scenarios is still limited.\r\nThis demo fills this gap by not only showing a real-world smart manufacturing application entirely implemented using NFV concepts, but also a lightweight prototyping framework that simplifies the realisation of vertical NFV proof-of-concepts. Dur- ing the demo, we show how an NFV-based smart manufacturing scenario can be specified, on-boarded, and instantiated before we demonstrate how the presented NFV services simplify machine data collection, aggregation, and analysis."}],"file":[{"date_updated":"2019-04-01T13:46:18Z","creator":"peuster","date_created":"2019-04-01T13:46:18Z","file_size":1693793,"file_id":"8794","access_level":"open_access","file_name":"main_for_ris.pdf","content_type":"application/pdf","relation":"main_file"}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2019","date_created":"2019-04-01T13:37:05Z","title":"Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case","type":"conference","status":"public","_id":"8792","project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"13271","file_date_updated":"2019-04-01T13:46:18Z","has_accepted_license":"1","place":"Paris","citation":{"ieee":"M. Peuster, S. B. Schneider, D. Behnke, M. Müller, P.-B. Bök, and H. Karl, “Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case,” in <i>5th IEEE International Conference on Network Softwarization (NetSoft 2019)</i>, Paris, 2019.","chicago":"Peuster, Manuel, Stefan Balthasar Schneider, Daniel Behnke, Marcel Müller, Patrick-Benjamin Bök, and Holger Karl. “Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case.” In <i>5th IEEE International Conference on Network Softwarization (NetSoft 2019)</i>. Paris, 2019. <a href=\"https://doi.org/10.1109/NETSOFT.2019.8806685\">https://doi.org/10.1109/NETSOFT.2019.8806685</a>.","ama":"Peuster M, Schneider SB, Behnke D, Müller M, Bök P-B, Karl H. Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case. In: <i>5th IEEE International Conference on Network Softwarization (NetSoft 2019)</i>. Paris; 2019. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2019.8806685\">10.1109/NETSOFT.2019.8806685</a>","short":"M. Peuster, S.B. Schneider, D. Behnke, M. Müller, P.-B. Bök, H. Karl, in: 5th IEEE International Conference on Network Softwarization (NetSoft 2019), Paris, 2019.","mla":"Peuster, Manuel, et al. “Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case.” <i>5th IEEE International Conference on Network Softwarization (NetSoft 2019)</i>, 2019, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2019.8806685\">10.1109/NETSOFT.2019.8806685</a>.","bibtex":"@inproceedings{Peuster_Schneider_Behnke_Müller_Bök_Karl_2019, place={Paris}, title={Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2019.8806685\">10.1109/NETSOFT.2019.8806685</a>}, booktitle={5th IEEE International Conference on Network Softwarization (NetSoft 2019)}, author={Peuster, Manuel and Schneider, Stefan Balthasar and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}, year={2019} }","apa":"Peuster, M., Schneider, S. B., Behnke, D., Müller, M., Bök, P.-B., &#38; Karl, H. (2019). Prototyping and Demonstrating 5G Verticals: The Smart Manufacturing Case. In <i>5th IEEE International Conference on Network Softwarization (NetSoft 2019)</i>. Paris. <a href=\"https://doi.org/10.1109/NETSOFT.2019.8806685\">https://doi.org/10.1109/NETSOFT.2019.8806685</a>"},"date_updated":"2022-01-06T07:04:01Z","oa":"1","author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","id":"35343","full_name":"Schneider, Stefan Balthasar"},{"last_name":"Behnke","full_name":"Behnke, Daniel","first_name":"Daniel"},{"last_name":"Müller","full_name":"Müller, Marcel","first_name":"Marcel"},{"full_name":"Bök, Patrick-Benjamin","last_name":"Bök","first_name":"Patrick-Benjamin"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"doi":"10.1109/NETSOFT.2019.8806685","conference":{"name":"5th IEEE International Conference on Network Softwarization (NetSoft 2019)","start_date":"2019-06-24","end_date":"2019-06-28","location":"Paris"},"main_file_link":[{"url":"https://doi.org/10.1109/NETSOFT.2019.8806685"}]},{"title":"A flow handover protocol to support state migration in softwarized networks","date_created":"2019-04-01T17:47:36Z","year":"2019","ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"text":"Softwarized networks are the key enabler for elastic, on-demand service deployments of virtualized network functions. They allow to dynamically steer traffic\r\nthrough the network when new network functions are instantiated, or old ones\r\nare terminated. These scenarios become in particular challenging when stateful functions are involved, necessitating state management solutions to migrate\r\nstate between the functions. The problem with existing solutions is that they typically embrace state migration and flow rerouting jointly, imposing a huge set\r\nof requirements on the on-boarded virtualized network functions (VNFs), eg,\r\nsolution-specific state management interfaces.\r\nTo change this, we introduce the seamless handover protocol (SHarP). An\r\neasy-to-use, loss-less, and order-preserving flow rerouting mechanism that is\r\nnot fixed to a single state management approach. Using SHarP, VNF vendors\r\nare empowered to implement or use the state management solution of their\r\nchoice. SHarP supports these solutions with additional information when flows\r\nare migrated. In this paper, we present SHarP's design, its open source prototype\r\nimplementation, and show how SHarP significantly reduces the buffer usage at\r\na central (SDN) controller, which is a typical bottleneck in state-of-the-art solutions. Our experiments show that SHarP uses a constant amount of controller\r\nbuffer, irrespective of the time taken to migrate the VNF state.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_id":"8796","access_level":"open_access","file_name":"main_for_ris.pdf","file_size":2571927,"creator":"peuster","date_created":"2019-04-01T18:04:14Z","date_updated":"2019-04-01T18:04:14Z"}],"publication":"International Journal of Network Management","main_file_link":[{"url":"https://onlinelibrary.wiley.com/doi/abs/10.1002/nem.2067"}],"doi":"10.1002/nem.2067","oa":"1","date_updated":"2022-01-06T07:04:01Z","author":[{"first_name":"Manuel","last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel"},{"first_name":"Hannes","last_name":"Küttner","full_name":"Küttner, Hannes"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"citation":{"ieee":"M. Peuster, H. Küttner, and H. Karl, “A flow handover protocol to support state migration in softwarized networks,” <i>International Journal of Network Management</i>, 2019.","chicago":"Peuster, Manuel, Hannes Küttner, and Holger Karl. “A Flow Handover Protocol to Support State Migration in Softwarized Networks.” <i>International Journal of Network Management</i>, 2019. <a href=\"https://doi.org/10.1002/nem.2067\">https://doi.org/10.1002/nem.2067</a>.","ama":"Peuster M, Küttner H, Karl H. A flow handover protocol to support state migration in softwarized networks. <i>International Journal of Network Management</i>. 2019. doi:<a href=\"https://doi.org/10.1002/nem.2067\">10.1002/nem.2067</a>","bibtex":"@article{Peuster_Küttner_Karl_2019, title={A flow handover protocol to support state migration in softwarized networks}, DOI={<a href=\"https://doi.org/10.1002/nem.2067\">10.1002/nem.2067</a>}, number={e2067}, journal={International Journal of Network Management}, author={Peuster, Manuel and Küttner, Hannes and Karl, Holger}, year={2019} }","short":"M. Peuster, H. Küttner, H. Karl, International Journal of Network Management (2019).","mla":"Peuster, Manuel, et al. “A Flow Handover Protocol to Support State Migration in Softwarized Networks.” <i>International Journal of Network Management</i>, e2067, 2019, doi:<a href=\"https://doi.org/10.1002/nem.2067\">10.1002/nem.2067</a>.","apa":"Peuster, M., Küttner, H., &#38; Karl, H. (2019). A flow handover protocol to support state migration in softwarized networks. <i>International Journal of Network Management</i>. <a href=\"https://doi.org/10.1002/nem.2067\">https://doi.org/10.1002/nem.2067</a>"},"publication_status":"published","publication_identifier":{"issn":["1055-7148","1099-1190"]},"has_accepted_license":"1","article_number":"e2067","file_date_updated":"2019-04-01T18:04:14Z","project":[{"grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"8795","user_id":"13271","department":[{"_id":"75"}],"status":"public","type":"journal_article"},{"type":"journal_article","status":"public","user_id":"30525","department":[{"_id":"15"},{"_id":"230"},{"_id":"429"},{"_id":"289"}],"project":[{"_id":"53","name":"TRR 142"},{"name":"TRR 142 - Subproject C5","_id":"75"},{"name":"TRR 142 - Project Area C","_id":"56"}],"_id":"8797","file_date_updated":"2019-12-14T14:24:36Z","article_type":"review","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["2577-5421"]},"citation":{"short":"B. Sain, C. Meier, T. Zentgraf, Advanced Photonics 1 (2019) 024002.","mla":"Sain, Basudeb, et al. “Nonlinear Optics in All-Dielectric Nanoantennas and Metasurfaces: A Review.” <i>Advanced Photonics</i>, vol. 1, no. 2, 2019, p. 024002, doi:<a href=\"https://doi.org/10.1117/1.ap.1.2.024002\">10.1117/1.ap.1.2.024002</a>.","bibtex":"@article{Sain_Meier_Zentgraf_2019, title={Nonlinear optics in all-dielectric nanoantennas and metasurfaces: a review}, volume={1}, DOI={<a href=\"https://doi.org/10.1117/1.ap.1.2.024002\">10.1117/1.ap.1.2.024002</a>}, number={2}, journal={Advanced Photonics}, author={Sain, Basudeb and Meier, Cedrik and Zentgraf, Thomas}, year={2019}, pages={024002} }","apa":"Sain, B., Meier, C., &#38; Zentgraf, T. (2019). Nonlinear optics in all-dielectric nanoantennas and metasurfaces: a review. <i>Advanced Photonics</i>, <i>1</i>(2), 024002. <a href=\"https://doi.org/10.1117/1.ap.1.2.024002\">https://doi.org/10.1117/1.ap.1.2.024002</a>","chicago":"Sain, Basudeb, Cedrik Meier, and Thomas Zentgraf. “Nonlinear Optics in All-Dielectric Nanoantennas and Metasurfaces: A Review.” <i>Advanced Photonics</i> 1, no. 2 (2019): 024002. <a href=\"https://doi.org/10.1117/1.ap.1.2.024002\">https://doi.org/10.1117/1.ap.1.2.024002</a>.","ieee":"B. Sain, C. Meier, and T. Zentgraf, “Nonlinear optics in all-dielectric nanoantennas and metasurfaces: a review,” <i>Advanced Photonics</i>, vol. 1, no. 2, p. 024002, 2019.","ama":"Sain B, Meier C, Zentgraf T. Nonlinear optics in all-dielectric nanoantennas and metasurfaces: a review. <i>Advanced Photonics</i>. 2019;1(2):024002. doi:<a href=\"https://doi.org/10.1117/1.ap.1.2.024002\">10.1117/1.ap.1.2.024002</a>"},"page":"024002","intvolume":"         1","author":[{"first_name":"Basudeb","full_name":"Sain, Basudeb","last_name":"Sain"},{"first_name":"Cedrik","full_name":"Meier, Cedrik","id":"20798","orcid":"https://orcid.org/0000-0002-3787-3572","last_name":"Meier"},{"id":"30525","full_name":"Zentgraf, Thomas","orcid":"0000-0002-8662-1101","last_name":"Zentgraf","first_name":"Thomas"}],"volume":1,"date_updated":"2022-01-06T07:04:02Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://www.spiedigitallibrary.org/journals/Advanced-Photonics/volume-1/issue-02/024002/Nonlinear-optics-in-all-dielectric-nanoantennas-and-metasurfaces--a/10.1117/1.AP.1.2.024002.full"}],"doi":"10.1117/1.ap.1.2.024002","publication":"Advanced Photonics","file":[{"date_updated":"2019-12-14T14:24:36Z","creator":"zentgraf","date_created":"2019-12-14T14:24:36Z","file_size":5275552,"access_level":"closed","file_name":"AdvPhoton_2019.pdf","file_id":"15330","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"Free from phase-matching constraints, plasmonic metasurfaces have contributed significantly to the control of optical nonlinearity and enhancement of nonlinear generation efficiency by engineering subwavelength meta-atoms. However, high dissipative losses and inevitable thermal heating limit their applicability in nonlinear nanophotonics. All-dielectric metasurfaces, supporting both electric and magnetic Mie-type resonances in their nanostructures, have appeared as a promising alternative to nonlinear plasmonics. High-index dielectric nanostructures, allowing additional magnetic resonances, can induce magnetic nonlinear effects, which, along with electric nonlinearities, increase the nonlinear conversion efficiency. In addition, low dissipative losses and high damage thresholds provide an extra degree of freedom for operating at high pump intensities, resulting in a considerable enhancement of the nonlinear processes. We discuss the current state of the art in the intensely developing area of all-dielectric nonlinear nanostructures and metasurfaces, including the role of Mie modes, Fano resonances, and anapole moments for harmonic generation, wave mixing, and ultrafast optical switching. Furthermore, we review the recent progress in the nonlinear phase and wavefront control using all-dielectric metasurfaces. We discuss techniques to realize all-dielectric metasurfaces for multifunctional applications and generation of second-order nonlinear processes from complementary metal–oxide–semiconductor-compatible materials."}],"language":[{"iso":"eng"}],"ddc":["530"],"issue":"2","quality_controlled":"1","year":"2019","date_created":"2019-04-04T06:20:14Z","title":"Nonlinear optics in all-dielectric nanoantennas and metasurfaces: a review"},{"publication":"IEEE Communications Magazine","file":[{"relation":"main_file","description":"Preprint of original article: M. Peuster et al., \"Introducing Automated Verification and Validation for Virtualized Network Functions and Services,\" in IEEE Communications Magazine, vol. 57, no. 5, pp. 96-102, May 2019.\ndoi: 10.1109/MCOM.2019.1800873\n\n","title":"Introducing Automated Verification and Validation for Virtualized Network Functions and Services","file_id":"9825","access_level":"open_access","date_updated":"2019-05-16T09:13:40Z","date_created":"2019-05-16T09:13:40Z","content_type":"application/pdf","file_size":1735036,"file_name":"main_for_ris.pdf","creator":"peuster"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2019","date_created":"2019-05-16T09:09:16Z","title":"Introducing Automated Verification and Validation for Virtualized Network Functions and Services","type":"journal_article","status":"public","department":[{"_id":"75"}],"user_id":"13271","_id":"9824","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"file_date_updated":"2019-05-16T09:13:40Z","has_accepted_license":"1","publication_identifier":{"issn":["0163-6804","1558-1896"]},"publication_status":"published","page":"96-102","citation":{"apa":"Peuster, M., Schneider, S. B., Zhao, M., Xilouris, G., Trakadas, P., Vicens, F., … Karl, H. (2019). Introducing Automated Verification and Validation for Virtualized Network Functions and Services. <i>IEEE Communications Magazine</i>, 96–102. <a href=\"https://doi.org/10.1109/mcom.2019.1800873\">https://doi.org/10.1109/mcom.2019.1800873</a>","mla":"Peuster, Manuel, et al. “Introducing Automated Verification and Validation for Virtualized Network Functions and Services.” <i>IEEE Communications Magazine</i>, 2019, pp. 96–102, doi:<a href=\"https://doi.org/10.1109/mcom.2019.1800873\">10.1109/mcom.2019.1800873</a>.","bibtex":"@article{Peuster_Schneider_Zhao_Xilouris_Trakadas_Vicens_Tavernier_Soenen_Vilalta_Andreou_et al._2019, title={Introducing Automated Verification and Validation for Virtualized Network Functions and Services}, DOI={<a href=\"https://doi.org/10.1109/mcom.2019.1800873\">10.1109/mcom.2019.1800873</a>}, journal={IEEE Communications Magazine}, author={Peuster, Manuel and Schneider, Stefan Balthasar and Zhao, Mengxuan and Xilouris, George and Trakadas, Panagiotis and Vicens, Felipe and Tavernier, Wouter and Soenen, Thomas and Vilalta, Ricard and Andreou, George and et al.}, year={2019}, pages={96–102} }","short":"M. Peuster, S.B. Schneider, M. Zhao, G. Xilouris, P. Trakadas, F. Vicens, W. Tavernier, T. Soenen, R. Vilalta, G. Andreou, D. Kyriazis, H. Karl, IEEE Communications Magazine (2019) 96–102.","chicago":"Peuster, Manuel, Stefan Balthasar Schneider, Mengxuan Zhao, George Xilouris, Panagiotis Trakadas, Felipe Vicens, Wouter Tavernier, et al. “Introducing Automated Verification and Validation for Virtualized Network Functions and Services.” <i>IEEE Communications Magazine</i>, 2019, 96–102. <a href=\"https://doi.org/10.1109/mcom.2019.1800873\">https://doi.org/10.1109/mcom.2019.1800873</a>.","ieee":"M. Peuster <i>et al.</i>, “Introducing Automated Verification and Validation for Virtualized Network Functions and Services,” <i>IEEE Communications Magazine</i>, pp. 96–102, 2019.","ama":"Peuster M, Schneider SB, Zhao M, et al. Introducing Automated Verification and Validation for Virtualized Network Functions and Services. <i>IEEE Communications Magazine</i>. 2019:96-102. doi:<a href=\"https://doi.org/10.1109/mcom.2019.1800873\">10.1109/mcom.2019.1800873</a>"},"author":[{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","id":"35343","full_name":"Schneider, Stefan Balthasar"},{"full_name":"Zhao, Mengxuan","last_name":"Zhao","first_name":"Mengxuan"},{"first_name":"George","last_name":"Xilouris","full_name":"Xilouris, George"},{"first_name":"Panagiotis","last_name":"Trakadas","full_name":"Trakadas, Panagiotis"},{"full_name":"Vicens, Felipe","last_name":"Vicens","first_name":"Felipe"},{"full_name":"Tavernier, Wouter","last_name":"Tavernier","first_name":"Wouter"},{"full_name":"Soenen, Thomas","last_name":"Soenen","first_name":"Thomas"},{"first_name":"Ricard","full_name":"Vilalta, Ricard","last_name":"Vilalta"},{"last_name":"Andreou","full_name":"Andreou, George","first_name":"George"},{"first_name":"Dimosthenis","last_name":"Kyriazis","full_name":"Kyriazis, Dimosthenis"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"date_updated":"2022-01-06T07:04:23Z","oa":"1","doi":"10.1109/mcom.2019.1800873","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/8713807"}]},{"file_date_updated":"2019-01-08T14:03:53Z","language":[{"iso":"eng"}],"keyword":["parallel machine scheduling with setup times","parallel branch-and-price algorithm","high performance computing","master/worker parallelization"],"ddc":["000"],"department":[{"_id":"277"}],"user_id":"61579","_id":"6512","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","file_size":4153528,"access_level":"open_access","file_name":"cor-parallel-bp-for-upmsp.pdf","file_id":"6513","date_updated":"2019-01-08T14:03:53Z","date_created":"2019-01-08T14:03:53Z","creator":"hsiemes"}],"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."}],"publication":"Computers & Operations Research","type":"journal_article","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","date_created":"2019-01-08T13:50:44Z","author":[{"first_name":"Gerhard","last_name":"Rauchecker","full_name":"Rauchecker, Gerhard"},{"first_name":"Guido","full_name":"Schryen, Guido","id":"72850","last_name":"Schryen"}],"oa":"1","date_updated":"2022-01-06T07:03:08Z","publisher":"Elsevier","page":"338-357","citation":{"apa":"Rauchecker, G., &#38; 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. <i>Computers &#38; Operations Research</i>, (104), 338–357.","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.” <i>Computers &#38; Operations Research</i>, no. 104, Elsevier, 2019, pp. 338–57.","short":"G. Rauchecker, G. Schryen, Computers &#38; Operations Research (2019) 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 &#38; Operations Research}, publisher={Elsevier}, author={Rauchecker, Gerhard and Schryen, Guido}, year={2019}, pages={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. <i>Computers &#38; Operations Research</i>. 2019;(104):338-357.","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,” <i>Computers &#38; Operations Research</i>, no. 104, pp. 338–357, 2019.","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.” <i>Computers &#38; Operations Research</i>, no. 104 (2019): 338–57."},"year":"2019","issue":"104","has_accepted_license":"1"},{"_id":"6514","department":[{"_id":"277"}],"user_id":"61579","keyword":["Recommender Agents","Preference Elicitation Method","Trade-off Exposure","Customer Satisfaction"],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2021-08-13T13:26:11Z","publication":"Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik","type":"conference","abstract":[{"text":"Recommender Agents (RAs) facilitate consumers’ online purchase decisions for complex, multi-attribute products. As not all combinations of attribute levels can be obtained, users are forced into trade-offs. The exposure of trade-offs in a RA has been found to affect consumers’ perceptions. However, little is known about how different preference elicitation methods in RAs affect consumers by varying degrees of trade-off exposure. We propose a research model that investigates how different levels of trade-off exposure cognitively and affectively influence consumers’ satisfaction with RAs. We operationalize these levels in three different RA types and test our hypotheses in a laboratory experiment with 116 participants. Our results indicate that with increasing tradeoff exposure, perceived enjoyment and perceived control follow an inverted Ushaped relationship. Hence, RAs using preference elicitation methods with medium trade-off exposure yield highest consumer satisfaction. This contributes to the understanding of trade-offs in RAs and provides valuable implications to e-commerce practitioners.","lang":"eng"}],"status":"public","file":[{"file_name":"WALKING THE MIDDLE PATH.pdf","access_level":"closed","file_id":"6515","file_size":371490,"creator":"hsiemes","date_created":"2019-01-08T14:07:17Z","date_updated":"2021-08-13T13:26:11Z","relation":"main_file","content_type":"application/pdf"},{"content_type":"application/pdf","relation":"main_file","date_updated":"2021-08-13T13:25:53Z","date_created":"2021-08-13T13:25:53Z","creator":"hsiemes","file_size":331001,"file_id":"23393","access_level":"open_access","file_name":"Walking the Middle Path_ How Medium Trade-Off Exposure Leads to H.pdf"}],"date_updated":"2022-01-06T07:03:09Z","oa":"1","author":[{"first_name":"Veronika","full_name":"Schuhbeck, Veronika","last_name":"Schuhbeck"},{"first_name":"Nils","last_name":"Siegfried","full_name":"Siegfried, Nils"},{"first_name":"Verena","full_name":"Dorner, Verena","last_name":"Dorner"},{"full_name":"Benlian, Alexander","last_name":"Benlian","first_name":"Alexander"},{"first_name":"Michael","last_name":"Scholz","full_name":"Scholz, Michael"},{"full_name":"Schryen, Guido","id":"72850","last_name":"Schryen","first_name":"Guido"}],"date_created":"2019-01-08T14:06:32Z","title":"Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents","conference":{"name":"14th International Conference on Wirtschaftsinformatik","start_date":"2019-02-24","end_date":"2019-02-27","location":"Siegen, Germany"},"has_accepted_license":"1","year":"2019","place":"Siegen, Germany","page":"55-64","citation":{"apa":"Schuhbeck, V., Siegfried, N., Dorner, V., Benlian, A., Scholz, M., &#38; Schryen, G. (2019). Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents. In <i>Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik</i> (pp. 55–64). Siegen, Germany.","bibtex":"@inproceedings{Schuhbeck_Siegfried_Dorner_Benlian_Scholz_Schryen_2019, place={Siegen, Germany}, title={Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents}, booktitle={Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik}, author={Schuhbeck, Veronika and Siegfried, Nils and Dorner, Verena and Benlian, Alexander and Scholz, Michael and Schryen, Guido}, year={2019}, pages={55–64} }","short":"V. Schuhbeck, N. Siegfried, V. Dorner, A. Benlian, M. Scholz, G. Schryen, in: Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik, Siegen, Germany, 2019, pp. 55–64.","mla":"Schuhbeck, Veronika, et al. “Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents.” <i>Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik</i>, 2019, pp. 55–64.","ama":"Schuhbeck V, Siegfried N, Dorner V, Benlian A, Scholz M, Schryen G. Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents. In: <i>Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik</i>. Siegen, Germany; 2019:55-64.","chicago":"Schuhbeck, Veronika, Nils Siegfried, Verena Dorner, Alexander Benlian, Michael Scholz, and Guido Schryen. “Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents.” In <i>Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik</i>, 55–64. Siegen, Germany, 2019.","ieee":"V. Schuhbeck, N. Siegfried, V. Dorner, A. Benlian, M. Scholz, and G. Schryen, “Walking the Middle Path: How Medium Trade-off Exposure Leads to Higher Consumer Satisfaction in Recommender Agents,” in <i>Proceedings of the 14. Internationale Tagung Wirtschaftsinformatik</i>, Siegen, Germany, 2019, pp. 55–64."}},{"title":"Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding","oa":"1","publisher":"IEEE","date_updated":"2022-01-06T07:03:22Z","date_created":"2019-01-17T15:51:34Z","author":[{"full_name":"Afifi, Haitham","id":"65718","last_name":"Afifi","first_name":"Haitham"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"}],"year":"2019","place":"Las Vegas","citation":{"ama":"Afifi H, Karl H. Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding. In: <i>2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019)</i>. Las Vegas: IEEE.","chicago":"Afifi, Haitham, and Holger Karl. “Power Allocation with a Wireless Multi-Cast Aware Routing for Virtual Network Embedding.” In <i>2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019)</i>. Las Vegas: IEEE, n.d.","ieee":"H. Afifi and H. Karl, “Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding,” in <i>2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019)</i>.","bibtex":"@inproceedings{Afifi_Karl, place={Las Vegas}, title={Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding}, booktitle={2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019)}, publisher={IEEE}, author={Afifi, Haitham and Karl, Holger} }","mla":"Afifi, Haitham, and Holger Karl. “Power Allocation with a Wireless Multi-Cast Aware Routing for Virtual Network Embedding.” <i>2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019)</i>, IEEE.","short":"H. Afifi, H. Karl, in: 2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019), IEEE, Las Vegas, n.d.","apa":"Afifi, H., &#38; Karl, H. (n.d.). Power Allocation with a Wireless Multi-cast Aware Routing for Virtual Network Embedding. In <i>2019 16th IEEE Annual Consumer Communications &#38; Networking Conference (CCNC2019)</i>. Las Vegas: IEEE."},"publication_status":"accepted","has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2019-01-17T15:49:37Z","project":[{"_id":"27","name":"Akustische Sensornetzwerke - Teilprojekt "},{"name":"Akustische Sensornetzwerke - Teilprojekt \"Verteilte akustische Signalverarbeitung über funkbasierte Sensornetzwerke","_id":"27"}],"_id":"6860","user_id":"65718","department":[{"_id":"75"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_name":"globecom.pdf","access_level":"open_access","file_id":"6861","file_size":320283,"creator":"hafifi","date_created":"2019-01-17T15:49:37Z","date_updated":"2019-01-17T15:49:37Z"}],"status":"public","type":"conference","publication":"2019 16th IEEE Annual Consumer Communications & Networking Conference (CCNC2019)"},{"title":"CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction","main_file_link":[{"url":"http://ceur-ws.org/Vol-2380/paper_118.pdf","open_access":"1"}],"oa":"1","date_updated":"2022-01-06T06:52:57Z","author":[{"first_name":"Gabriella","full_name":"Skitalinskaya, Gabriella","last_name":"Skitalinskaya"},{"last_name":"Klaff","full_name":"Klaff, Jonas","first_name":"Jonas"},{"id":"84035","full_name":"Spliethöver, Maximilian","last_name":"Spliethöver","orcid":"0000-0003-4364-1409","first_name":"Maximilian"}],"date_created":"2020-04-23T15:18:40Z","volume":2380,"year":"2019","place":"Lugano, Switzerland","citation":{"chicago":"Skitalinskaya, Gabriella, Jonas Klaff, and Maximilian Spliethöver. <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>. Vol. 2380. CEUR Workshop Proceedings. Lugano, Switzerland, 2019.","ieee":"G. Skitalinskaya, J. Klaff, and M. Spliethöver, <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>, vol. 2380. Lugano, Switzerland, 2019.","ama":"Skitalinskaya G, Klaff J, Spliethöver M. <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>. Vol 2380. Lugano, Switzerland; 2019.","apa":"Skitalinskaya, G., Klaff, J., &#38; Spliethöver, M. (2019). <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i> (Vol. 2380). Lugano, Switzerland.","bibtex":"@book{Skitalinskaya_Klaff_Spliethöver_2019, place={Lugano, Switzerland}, series={CEUR Workshop Proceedings}, title={CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction}, volume={2380}, author={Skitalinskaya, Gabriella and Klaff, Jonas and Spliethöver, Maximilian}, year={2019}, collection={CEUR Workshop Proceedings} }","short":"G. Skitalinskaya, J. Klaff, M. Spliethöver, CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction, Lugano, Switzerland, 2019.","mla":"Skitalinskaya, Gabriella, et al. <i>CLEF ProtestNews Lab 2019: Contextualized Word Embeddings for Event Sentence Detection and Event Extraction</i>. Vol. 2380, 2019."},"page":"7","intvolume":"      2380","language":[{"iso":"eng"}],"extern":"1","_id":"16847","user_id":"84035","series_title":"CEUR Workshop Proceedings","abstract":[{"lang":"eng","text":"In this work we describe our results achieved in the ProtestNews Lab at CLEF 2019. To tackle the problems of event sentence detection and event extraction we decided to use contextualized string embeddings. The models were trained on a data corpus collected from Indian news sources, but evaluated on data obtained from news sources from other countries as well, such as China. Our models have obtained competitive results and have scored 3rd in the event sentence detection task and 1st in the event extraction task based on average F1-scores for different test datasets."}],"status":"public","report_number":"118","type":"report"},{"language":[{"iso":"eng"}],"file_date_updated":"2019-08-13T06:41:35Z","ddc":["000"],"user_id":"59789","department":[{"_id":"54"}],"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"11965","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2019-08-13T06:41:35Z","date_created":"2019-08-13T06:36:44Z","creator":"huesera","file_size":223413,"access_level":"open_access","file_name":"INTERSPEECH_2019_Drude_Paper.pdf","file_id":"12914"}],"status":"public","abstract":[{"text":"We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of degraded input and clean training targets. Thus, training can be carried out on real recordings of noisy speech rather than simulated ones. In contrast to previous work on unsupervised training of neural mask estimators, our approach avoids the need for a possibly pre-trained teacher model entirely. We demonstrate the effectiveness of our approach by speech recognition experiments on two different datasets: one mainly deteriorated by noise (CHiME 4) and one by reverberation (REVERB). The results show that the performance of the proposed system is on par with a supervised system using oracle target masks for training and with a system trained using a model-based teacher.","lang":"eng"}],"type":"conference","publication":"INTERSPEECH 2019, Graz, Austria","title":"Unsupervised training of neural mask-based beamforming","author":[{"last_name":"Drude","full_name":"Drude, Lukas","id":"11213","first_name":"Lukas"},{"id":"9168","full_name":"Heymann, Jahn","last_name":"Heymann","first_name":"Jahn"},{"last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242","first_name":"Reinhold"}],"date_created":"2019-07-18T09:11:39Z","date_updated":"2022-01-06T06:51:14Z","oa":"1","citation":{"ama":"Drude L, Heymann J, Haeb-Umbach R. Unsupervised training of neural mask-based beamforming. In: <i>INTERSPEECH 2019, Graz, Austria</i>. ; 2019.","ieee":"L. Drude, J. Heymann, and R. Haeb-Umbach, “Unsupervised training of neural mask-based beamforming,” in <i>INTERSPEECH 2019, Graz, Austria</i>, 2019.","chicago":"Drude, Lukas, Jahn Heymann, and Reinhold Haeb-Umbach. “Unsupervised Training of Neural Mask-Based Beamforming.” In <i>INTERSPEECH 2019, Graz, Austria</i>, 2019.","short":"L. Drude, J. Heymann, R. Haeb-Umbach, in: INTERSPEECH 2019, Graz, Austria, 2019.","bibtex":"@inproceedings{Drude_Heymann_Haeb-Umbach_2019, title={Unsupervised training of neural mask-based beamforming}, booktitle={INTERSPEECH 2019, Graz, Austria}, author={Drude, Lukas and Heymann, Jahn and Haeb-Umbach, Reinhold}, year={2019} }","mla":"Drude, Lukas, et al. “Unsupervised Training of Neural Mask-Based Beamforming.” <i>INTERSPEECH 2019, Graz, Austria</i>, 2019.","apa":"Drude, L., Heymann, J., &#38; Haeb-Umbach, R. (2019). Unsupervised training of neural mask-based beamforming. In <i>INTERSPEECH 2019, Graz, Austria</i>."},"year":"2019","has_accepted_license":"1"},{"_id":"12874","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"54"}],"user_id":"59789","ddc":["000"],"file_date_updated":"2019-08-14T07:19:13Z","language":[{"iso":"eng"}],"publication":"ICASSP 2019, Brighton, UK","type":"conference","abstract":[{"lang":"eng","text":"We propose a training scheme to train neural network-based source separation algorithms from scratch when parallel clean data is unavailable. In particular, we demonstrate that an unsupervised spatial clustering algorithm is sufficient to guide the training of a deep clustering system. We argue that previous work on deep clustering requires strong supervision and elaborate on why this is a limitation. We demonstrate that (a) the single-channel deep clustering system trained according to the proposed scheme alone is able to achieve a similar performance as the multi-channel teacher in terms of word error rates and (b) initializing the spatial clustering approach with the deep clustering result yields a relative word error rate reduction of 26% over the unsupervised teacher."}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2019-08-14T07:19:13Z","creator":"huesera","date_updated":"2019-08-14T07:19:13Z","access_level":"open_access","file_name":"ICASSP_2019_Drude_Paper.pdf","file_id":"12925","file_size":368225}],"oa":"1","date_updated":"2022-01-06T06:51:21Z","author":[{"last_name":"Drude","id":"11213","full_name":"Drude, Lukas","first_name":"Lukas"},{"first_name":"Daniel","full_name":"Hasenklever, Daniel","last_name":"Hasenklever"},{"first_name":"Reinhold","last_name":"Haeb-Umbach","full_name":"Haeb-Umbach, Reinhold","id":"242"}],"date_created":"2019-07-23T07:37:54Z","title":"Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation","has_accepted_license":"1","year":"2019","citation":{"mla":"Drude, Lukas, et al. “Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation.” <i>ICASSP 2019, Brighton, UK</i>, 2019.","short":"L. Drude, D. Hasenklever, R. Haeb-Umbach, in: ICASSP 2019, Brighton, UK, 2019.","bibtex":"@inproceedings{Drude_Hasenklever_Haeb-Umbach_2019, title={Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation}, booktitle={ICASSP 2019, Brighton, UK}, author={Drude, Lukas and Hasenklever, Daniel and Haeb-Umbach, Reinhold}, year={2019} }","apa":"Drude, L., Hasenklever, D., &#38; Haeb-Umbach, R. (2019). Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation. In <i>ICASSP 2019, Brighton, UK</i>.","ieee":"L. Drude, D. Hasenklever, and R. Haeb-Umbach, “Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation,” in <i>ICASSP 2019, Brighton, UK</i>, 2019.","chicago":"Drude, Lukas, Daniel Hasenklever, and Reinhold Haeb-Umbach. “Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation.” In <i>ICASSP 2019, Brighton, UK</i>, 2019.","ama":"Drude L, Hasenklever D, Haeb-Umbach R. Unsupervised Training of a Deep Clustering Model for Multichannel Blind Source Separation. In: <i>ICASSP 2019, Brighton, UK</i>. ; 2019."}},{"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2019-12-17T07:28:06Z","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"12875","user_id":"59789","department":[{"_id":"54"}],"abstract":[{"text":"Signal dereverberation using the Weighted Prediction Error (WPE) method has been proven to be an effective means to raise the accuracy of far-field speech recognition. First proposed as an iterative algorithm, follow-up works have reformulated it as a recursive least squares algorithm and therefore enabled its use in online applications. For this algorithm, the estimation of the power spectral density (PSD) of the anechoic signal plays an important role and strongly influences its performance. Recently, we showed that using a neural network PSD estimator leads to improved performance for online automatic speech recognition. This, however, comes at a price. To train the network, we require parallel data, i.e., utterances simultaneously available in clean and reverberated form. Here we propose to overcome this limitation by training the network jointly with the acoustic model of the speech recognizer. To be specific, the gradients computed from the cross-entropy loss between the target senone sequence and the acoustic model network output is backpropagated through the complex-valued dereverberation filter estimation to the neural network for PSD estimation. Evaluation on two databases demonstrates improved performance for on-line processing scenarios while imposing fewer requirements on the available training data and thus widening the range of applications.","lang":"eng"}],"file":[{"date_updated":"2019-12-17T07:28:06Z","creator":"huesera","date_created":"2019-12-17T07:28:06Z","file_size":199109,"file_id":"15334","access_level":"open_access","file_name":"ICASSP_2019_Heymann_Paper.pdf","content_type":"application/pdf","relation":"main_file"}],"status":"public","type":"conference","publication":"ICASSP 2019, Brighton, UK","title":"Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR","oa":"1","date_updated":"2022-01-06T06:51:22Z","date_created":"2019-07-23T07:42:26Z","author":[{"first_name":"Jahn","last_name":"Heymann","id":"9168","full_name":"Heymann, Jahn"},{"first_name":"Lukas","last_name":"Drude","full_name":"Drude, Lukas","id":"11213"},{"first_name":"Reinhold","full_name":"Haeb-Umbach, Reinhold","id":"242","last_name":"Haeb-Umbach"},{"full_name":"Kinoshita, Keisuke","last_name":"Kinoshita","first_name":"Keisuke"},{"full_name":"Nakatani, Tomohiro","last_name":"Nakatani","first_name":"Tomohiro"}],"year":"2019","citation":{"bibtex":"@inproceedings{Heymann_Drude_Haeb-Umbach_Kinoshita_Nakatani_2019, title={Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR}, booktitle={ICASSP 2019, Brighton, UK}, author={Heymann, Jahn and Drude, Lukas and Haeb-Umbach, Reinhold and Kinoshita, Keisuke and Nakatani, Tomohiro}, year={2019} }","mla":"Heymann, Jahn, et al. “Joint Optimization of Neural Network-Based WPE Dereverberation and Acoustic Model for Robust Online ASR.” <i>ICASSP 2019, Brighton, UK</i>, 2019.","short":"J. Heymann, L. Drude, R. Haeb-Umbach, K. Kinoshita, T. Nakatani, in: ICASSP 2019, Brighton, UK, 2019.","apa":"Heymann, J., Drude, L., Haeb-Umbach, R., Kinoshita, K., &#38; Nakatani, T. (2019). Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR. In <i>ICASSP 2019, Brighton, UK</i>.","ama":"Heymann J, Drude L, Haeb-Umbach R, Kinoshita K, Nakatani T. Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR. In: <i>ICASSP 2019, Brighton, UK</i>. ; 2019.","ieee":"J. Heymann, L. Drude, R. Haeb-Umbach, K. Kinoshita, and T. Nakatani, “Joint Optimization of Neural Network-based WPE Dereverberation and Acoustic Model for Robust Online ASR,” in <i>ICASSP 2019, Brighton, UK</i>, 2019.","chicago":"Heymann, Jahn, Lukas Drude, Reinhold Haeb-Umbach, Keisuke Kinoshita, and Tomohiro Nakatani. “Joint Optimization of Neural Network-Based WPE Dereverberation and Acoustic Model for Robust Online ASR.” In <i>ICASSP 2019, Brighton, UK</i>, 2019."},"has_accepted_license":"1"},{"date_created":"2019-07-23T07:44:59Z","author":[{"first_name":"Gerhard","last_name":"Kurz","full_name":"Kurz, Gerhard"},{"last_name":"Gilitschenski","full_name":"Gilitschenski, Igor","first_name":"Igor"},{"last_name":"Pfaff","full_name":"Pfaff, Florian","first_name":"Florian"},{"first_name":"Lukas","id":"11213","full_name":"Drude, Lukas","last_name":"Drude"},{"first_name":"Uwe D.","last_name":"Hanebeck","full_name":"Hanebeck, Uwe D."},{"full_name":"Haeb-Umbach, Reinhold","id":"242","last_name":"Haeb-Umbach","first_name":"Reinhold"},{"last_name":"Siegwart","full_name":"Siegwart, Roland Y.","first_name":"Roland Y."}],"date_updated":"2022-01-06T06:51:22Z","oa":"1","title":"Directional Statistics and Filtering Using libDirectional","has_accepted_license":"1","citation":{"ama":"Kurz G, Gilitschenski I, Pfaff F, et al. Directional Statistics and Filtering Using libDirectional. In: <i>Journal of Statistical Software 89(4)</i>. ; 2019.","chicago":"Kurz, Gerhard, Igor Gilitschenski, Florian Pfaff, Lukas Drude, Uwe D. Hanebeck, Reinhold Haeb-Umbach, and Roland Y. Siegwart. “Directional Statistics and Filtering Using LibDirectional.” In <i>Journal of Statistical Software 89(4)</i>, 2019.","ieee":"G. Kurz <i>et al.</i>, “Directional Statistics and Filtering Using libDirectional,” in <i>Journal of Statistical Software 89(4)</i>, 2019.","mla":"Kurz, Gerhard, et al. “Directional Statistics and Filtering Using LibDirectional.” <i>Journal of Statistical Software 89(4)</i>, 2019.","bibtex":"@inproceedings{Kurz_Gilitschenski_Pfaff_Drude_Hanebeck_Haeb-Umbach_Siegwart_2019, title={Directional Statistics and Filtering Using libDirectional}, booktitle={Journal of Statistical Software 89(4)}, author={Kurz, Gerhard and Gilitschenski, Igor and Pfaff, Florian and Drude, Lukas and Hanebeck, Uwe D. and Haeb-Umbach, Reinhold and Siegwart, Roland Y.}, year={2019} }","short":"G. Kurz, I. Gilitschenski, F. Pfaff, L. Drude, U.D. Hanebeck, R. Haeb-Umbach, R.Y. Siegwart, in: Journal of Statistical Software 89(4), 2019.","apa":"Kurz, G., Gilitschenski, I., Pfaff, F., Drude, L., Hanebeck, U. D., Haeb-Umbach, R., &#38; Siegwart, R. Y. (2019). Directional Statistics and Filtering Using libDirectional. In <i>Journal of Statistical Software 89(4)</i>."},"year":"2019","department":[{"_id":"54"}],"user_id":"59789","_id":"12876","language":[{"iso":"eng"}],"file_date_updated":"2019-08-14T07:16:05Z","ddc":["000"],"publication":"Journal of Statistical Software 89(4)","type":"conference","status":"public","file":[{"access_level":"open_access","file_name":"JournalofStatisticalSoftware_2019_Drude_Paper.pdf","file_id":"12923","file_size":1522964,"creator":"huesera","date_created":"2019-08-14T07:16:05Z","date_updated":"2019-08-14T07:16:05Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"In this paper, we present libDirectional, a MATLAB library for directional statistics and directional estimation. It supports a variety of commonly used distributions on the unit circle, such as the von Mises, wrapped normal, and wrapped Cauchy distributions. Furthermore, various distributions on higher-dimensional manifolds such as the unit hypersphere and the hypertorus are available. Based on these distributions, several recursive filtering algorithms in libDirectional allow estimation on these manifolds. The functionality is implemented in a clear, well-documented, and object-oriented structure that is both easy to use and easy to extend.","lang":"eng"}]}]