[{"publication_status":"published","keyword":["Atomic and Molecular Physics","and Optics"],"user_id":"22501","citation":{"ieee":"J. Zhao <i>et al.</i>, “Shallow-etched thin-film lithium niobate waveguides for highly-efficient second-harmonic generation,” <i>Optics Express</i>, vol. 28, no. 13, Art. no. 19669, 2020, doi: <a href=\"https://doi.org/10.1364/oe.395545\">10.1364/oe.395545</a>.","chicago":"Zhao, Jie, Michael Rüsing, Usman A. Javid, Jingwei Ling, Mingxiao Li, Qiang Lin, and Shayan Mookherjea. “Shallow-Etched Thin-Film Lithium Niobate Waveguides for Highly-Efficient Second-Harmonic Generation.” <i>Optics Express</i> 28, no. 13 (2020). <a href=\"https://doi.org/10.1364/oe.395545\">https://doi.org/10.1364/oe.395545</a>.","apa":"Zhao, J., Rüsing, M., Javid, U. A., Ling, J., Li, M., Lin, Q., &#38; Mookherjea, S. (2020). Shallow-etched thin-film lithium niobate waveguides for highly-efficient second-harmonic generation. <i>Optics Express</i>, <i>28</i>(13), Article 19669. <a href=\"https://doi.org/10.1364/oe.395545\">https://doi.org/10.1364/oe.395545</a>","ama":"Zhao J, Rüsing M, Javid UA, et al. Shallow-etched thin-film lithium niobate waveguides for highly-efficient second-harmonic generation. <i>Optics Express</i>. 2020;28(13). doi:<a href=\"https://doi.org/10.1364/oe.395545\">10.1364/oe.395545</a>","short":"J. Zhao, M. Rüsing, U.A. Javid, J. Ling, M. Li, Q. Lin, S. Mookherjea, Optics Express 28 (2020).","bibtex":"@article{Zhao_Rüsing_Javid_Ling_Li_Lin_Mookherjea_2020, title={Shallow-etched thin-film lithium niobate waveguides for highly-efficient second-harmonic generation}, volume={28}, DOI={<a href=\"https://doi.org/10.1364/oe.395545\">10.1364/oe.395545</a>}, number={1319669}, journal={Optics Express}, publisher={Optica Publishing Group}, author={Zhao, Jie and Rüsing, Michael and Javid, Usman A. and Ling, Jingwei and Li, Mingxiao and Lin, Qiang and Mookherjea, Shayan}, year={2020} }","mla":"Zhao, Jie, et al. “Shallow-Etched Thin-Film Lithium Niobate Waveguides for Highly-Efficient Second-Harmonic Generation.” <i>Optics Express</i>, vol. 28, no. 13, 19669, Optica Publishing Group, 2020, doi:<a href=\"https://doi.org/10.1364/oe.395545\">10.1364/oe.395545</a>."},"intvolume":"        28","doi":"10.1364/oe.395545","abstract":[{"text":"High-fidelity periodic poling over long lengths is required for robust, quasi-phase-matched second-harmonic generation using the fundamental, quasi-TE polarized waveguide modes in a thin-film lithium niobate (TFLN) waveguide. Here, a shallow-etched ridge waveguide is fabricated in x-cut magnesium oxide doped TFLN and is poled accurately over 5 mm. The high fidelity of the poling is demonstrated over long lengths using a non-destructive technique of confocal scanning second-harmonic microscopy. We report a second-harmonic conversion efficiency of up to 939 %/W (length-normalized conversion efficiency 3757 %/Wcm²), measured at telecommunications wavelengths. The device demonstrates a narrow spectral linewidth (1 nm) and can be tuned precisely with a tuning characteristic of 0.1 nm/°C, over at least 40 °C without measurable loss of efficiency.","lang":"eng"}],"extern":"1","author":[{"last_name":"Zhao","full_name":"Zhao, Jie","first_name":"Jie"},{"last_name":"Rüsing","id":"22501","first_name":"Michael","full_name":"Rüsing, Michael","orcid":"0000-0003-4682-4577"},{"first_name":"Usman A.","full_name":"Javid, Usman A.","last_name":"Javid"},{"first_name":"Jingwei","full_name":"Ling, Jingwei","last_name":"Ling"},{"first_name":"Mingxiao","full_name":"Li, Mingxiao","last_name":"Li"},{"first_name":"Qiang","full_name":"Lin, Qiang","last_name":"Lin"},{"last_name":"Mookherjea","full_name":"Mookherjea, Shayan","first_name":"Shayan"}],"title":"Shallow-etched thin-film lithium niobate waveguides for highly-efficient second-harmonic generation","article_type":"original","issue":"13","date_updated":"2023-10-11T08:11:08Z","article_number":"19669","volume":28,"_id":"47958","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1094-4087"]},"type":"journal_article","year":"2020","publisher":"Optica Publishing Group","date_created":"2023-10-11T08:09:52Z","publication":"Optics Express"},{"publisher":"tredition GmbH, Halenreie 40-44, 22359 Hamburg","date_created":"2023-10-18T15:07:51Z","status":"public","year":"2020","publication_identifier":{"isbn":["978-3-347-16354-6"]},"language":[{"iso":"ger"}],"file_date_updated":"2023-10-18T15:00:33Z","_id":"48272","date_updated":"2023-10-19T11:52:45Z","author":[{"full_name":"Wille, Manuel","first_name":"Manuel","last_name":"Wille","id":"9310"}],"intvolume":"        15","place":"Giessen University Library Publications 2020","publication_status":"published","series_title":"Linguistische Untersuchungen","citation":{"ama":"Wille M. <i>Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium</i>. Vol 15. tredition GmbH, Halenreie 40-44, 22359 Hamburg; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1079\">10.17619/UNIPB/1-1079</a>","apa":"Wille, M. (2020). <i>Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium</i> (Vol. 15). tredition GmbH, Halenreie 40-44, 22359 Hamburg. <a href=\"https://doi.org/10.17619/UNIPB/1-1079\">https://doi.org/10.17619/UNIPB/1-1079</a>","ieee":"M. Wille, <i>Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium</i>, vol. 15. Giessen University Library Publications 2020: tredition GmbH, Halenreie 40-44, 22359 Hamburg, 2020.","chicago":"Wille, Manuel. <i>Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium</i>. Vol. 15. Linguistische Untersuchungen. Giessen University Library Publications 2020: tredition GmbH, Halenreie 40-44, 22359 Hamburg, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-1079\">https://doi.org/10.17619/UNIPB/1-1079</a>.","bibtex":"@book{Wille_2020, place={Giessen University Library Publications 2020}, series={Linguistische Untersuchungen}, title={Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium}, volume={15}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1079\">10.17619/UNIPB/1-1079</a>}, publisher={tredition GmbH, Halenreie 40-44, 22359 Hamburg}, author={Wille, Manuel}, year={2020}, collection={Linguistische Untersuchungen} }","mla":"Wille, Manuel. <i>Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium</i>. tredition GmbH, Halenreie 40-44, 22359 Hamburg, 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1079\">10.17619/UNIPB/1-1079</a>.","short":"M. Wille, Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium, tredition GmbH, Halenreie 40-44, 22359 Hamburg, Giessen University Library Publications 2020, 2020."},"department":[{"_id":"745"}],"ddc":["410","430","943"],"type":"dissertation","volume":15,"page":"450","file":[{"relation":"main_file","date_updated":"2023-10-18T15:00:33Z","success":1,"file_name":"LU_15_Wille.pdf","file_size":7176513,"creator":"mwille","date_created":"2023-10-18T15:00:33Z","access_level":"closed","content_type":"application/pdf","file_id":"48273"}],"title":"Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium","has_accepted_license":"1","doi":"10.17619/UNIPB/1-1079","abstract":[{"text":"In der Forschungsarbeit wird die Zeitungskommunikation des 18. Jahrhunderts aus sprachwissenschaftlicher Perspektive untersucht. Es wird gezeigt, wie sich das Textsortenrepertoire der Zeitung weiterentwickelte, welche sprachlichen Wandelprozesse stattfanden und wie die Zeitung übergreifend allmählich zu einem Massenmedium avancierte. Der textlinguistische Zugang auf die Zeitungssprache wird an den relevanten Stellen ergänzt durch einschlägige Erkenntnisse aus der historischen Presseforschung und der linguistischen Kulturanalyse. So wird etwa nachgezeichnet, wie sich die Zeitungsschreiber im Laufe des Jahrhunderts immer stärker von den Einflüssen der Kanzleisprachen lösten und Formulierungsstrategien etablierten, die auf die Anforderungen des journalistischen Berichtens abgestimmt waren. Mit diesen und weiteren Ergebnissen wird der Versuch angestellt, eine Forschungslücke der Sprachgeschichtsforschung zu schließen, in der die Zeitungen des 18. Jahrhunderts bisher lediglich randständig untersucht wurden.","lang":"eng"}],"user_id":"9310","keyword":["text linguistics","newspaper","Hamburgischer Correspondent","Textlinguistik","Sprachgeschichte","Textsortenwandel","Korpuslinguistik"]},{"citation":{"bibtex":"@article{Jacke_2020, title={So Far...From Now On # 6. }, journal={Die Aufhebung}, author={Jacke, Christoph}, year={2020} }","mla":"Jacke, Christoph. “So Far...From Now On # 6. .” <i>Die Aufhebung</i>, 2020.","short":"C. Jacke, Die Aufhebung (2020).","apa":"Jacke, C. (2020). So Far...From Now On # 6. . <i>Die Aufhebung</i>.","ama":"Jacke C. So Far...From Now On # 6. . <i>Die Aufhebung</i>. Published online 2020.","ieee":"C. Jacke, “So Far...From Now On # 6. ,” <i>Die Aufhebung</i>, 2020.","chicago":"Jacke, Christoph. “So Far...From Now On # 6. .” <i>Die Aufhebung</i>, 2020."},"user_id":"90934","main_file_link":[{"url":"http://www.dieaufhebung.de/so-far-from-now-on-6/"}],"department":[{"_id":"607"}],"title":"So Far...From Now On # 6. ","author":[{"full_name":"Jacke, Christoph","first_name":"Christoph","last_name":"Jacke","id":"20747"}],"alternative_title":["Kolumne."],"_id":"48466","date_updated":"2023-10-25T11:05:44Z","publication":"Die Aufhebung","date_created":"2023-10-25T11:05:37Z","type":"journal_article","year":"2020","language":[{"iso":"ger"}],"status":"public"},{"citation":{"short":"O. Hartung, Paderborner Universitätszeitschrift 2 (2020) 88.","bibtex":"@article{Hartung_2020, title={Workshops zur geschichtsdidaktischen Lehre in Zeiten von Corona}, volume={2}, journal={Paderborner Universitätszeitschrift}, publisher={Uni8versität paderborn}, author={Hartung, Olaf}, year={2020}, pages={88} }","mla":"Hartung, Olaf. “Workshops zur geschichtsdidaktischen Lehre in Zeiten von Corona.” <i>Paderborner Universitätszeitschrift</i>, vol. 2, Uni8versität paderborn, 2020, p. 88.","ieee":"O. Hartung, “Workshops zur geschichtsdidaktischen Lehre in Zeiten von Corona,” <i>Paderborner Universitätszeitschrift</i>, vol. 2, p. 88, 2020.","chicago":"Hartung, Olaf. “Workshops zur geschichtsdidaktischen Lehre in Zeiten von Corona.” <i>Paderborner Universitätszeitschrift</i> 2 (2020): 88.","apa":"Hartung, O. (2020). Workshops zur geschichtsdidaktischen Lehre in Zeiten von Corona. <i>Paderborner Universitätszeitschrift</i>, <i>2</i>, 88.","ama":"Hartung O. Workshops zur geschichtsdidaktischen Lehre in Zeiten von Corona. <i>Paderborner Universitätszeitschrift</i>. 2020;2:88."},"publication_status":"published","user_id":"79451","department":[{"_id":"6"},{"_id":"444"}],"title":"Workshops zur geschichtsdidaktischen Lehre in Zeiten von Corona","author":[{"full_name":"Hartung, Olaf","first_name":"Olaf","id":"79451","last_name":"Hartung"}],"intvolume":"         2","_id":"48615","page":"88","volume":2,"date_updated":"2023-11-16T18:23:58Z","date_created":"2023-11-06T09:09:09Z","publication":"Paderborner Universitätszeitschrift","publisher":"Uni8versität paderborn","language":[{"iso":"ger"}],"publication_identifier":{"issn":["1434-9736"]},"year":"2020","type":"journal_article","status":"public"},{"user_id":"23188","title":"Mental body rotation with egocentric and object-based transformations in different postures: sitting vs. standing","doi":"10.20338/bjmb.v14i2.165","abstract":[{"text":"BACKGROUND: A detail of previous studies on mental rotation, which has not received any attention so far, relates to the testing situation of the participants. In nearly every study, participants were tested in a sitting posture (and not standing). However, when considering embodied cognition approaches on mental processes, participants may not be able to fully exploit these processes when performing mental rotation tasks in a sitting posture.&#x0D;\r\nAIM: Therefore, the aim of the present study is to examine the potential influence of two different postures (sitting vs. standing), when solving mental body rotation tasks.&#x0D;\r\nMETHOD: Sixteen participants (6 females) were tested in two mental body-rotation tasks (MBRT), requiring either an object-based spatial transformation (based on a same-different judgment) or an egocentric transformation (based on a left-right judgment) in a sitting and in a standing posture. Reaction times and response errors were analysed in two three-way ANOVAs, with the factors orientation, task, and posture.&#x0D;\r\nRESULTS: Results revealed an effect of orientation and task, indicating that participants performed better for egocentric than for object-based transformations. However, there was no effect of posture.&#x0D;\r\nCONCLUSION: The different dynamics of postural control during sitting and standing do not induce different embodiment effects on mental rotation.","lang":"eng"}],"volume":14,"page":"73-84","issue":"2","publication":"Brazilian Journal of Motor Behavior","type":"journal_article","publication_status":"published","citation":{"apa":"Budde, K., Barela, J. A., Figueiredo, G. A., &#38; Weigelt, M. (2020). Mental body rotation with egocentric and object-based transformations in different postures: sitting vs. standing. <i>Brazilian Journal of Motor Behavior</i>, <i>14</i>(2), 73–84. <a href=\"https://doi.org/10.20338/bjmb.v14i2.165\">https://doi.org/10.20338/bjmb.v14i2.165</a>","ama":"Budde K, Barela JA, Figueiredo GA, Weigelt M. Mental body rotation with egocentric and object-based transformations in different postures: sitting vs. standing. <i>Brazilian Journal of Motor Behavior</i>. 2020;14(2):73-84. doi:<a href=\"https://doi.org/10.20338/bjmb.v14i2.165\">10.20338/bjmb.v14i2.165</a>","chicago":"Budde, Kirsten, José Angelo Barela, Gabriella Andreeta Figueiredo, and Matthias Weigelt. “Mental Body Rotation with Egocentric and Object-Based Transformations in Different Postures: Sitting vs. Standing.” <i>Brazilian Journal of Motor Behavior</i> 14, no. 2 (2020): 73–84. <a href=\"https://doi.org/10.20338/bjmb.v14i2.165\">https://doi.org/10.20338/bjmb.v14i2.165</a>.","ieee":"K. Budde, J. A. Barela, G. A. Figueiredo, and M. Weigelt, “Mental body rotation with egocentric and object-based transformations in different postures: sitting vs. standing,” <i>Brazilian Journal of Motor Behavior</i>, vol. 14, no. 2, pp. 73–84, 2020, doi: <a href=\"https://doi.org/10.20338/bjmb.v14i2.165\">10.20338/bjmb.v14i2.165</a>.","mla":"Budde, Kirsten, et al. “Mental Body Rotation with Egocentric and Object-Based Transformations in Different Postures: Sitting vs. Standing.” <i>Brazilian Journal of Motor Behavior</i>, vol. 14, no. 2, Brazilian Journal for Motor Behavior, 2020, pp. 73–84, doi:<a href=\"https://doi.org/10.20338/bjmb.v14i2.165\">10.20338/bjmb.v14i2.165</a>.","bibtex":"@article{Budde_Barela_Figueiredo_Weigelt_2020, title={Mental body rotation with egocentric and object-based transformations in different postures: sitting vs. standing}, volume={14}, DOI={<a href=\"https://doi.org/10.20338/bjmb.v14i2.165\">10.20338/bjmb.v14i2.165</a>}, number={2}, journal={Brazilian Journal of Motor Behavior}, publisher={Brazilian Journal for Motor Behavior}, author={Budde, Kirsten and Barela, José Angelo and Figueiredo, Gabriella Andreeta and Weigelt, Matthias}, year={2020}, pages={73–84} }","short":"K. Budde, J.A. Barela, G.A. Figueiredo, M. Weigelt, Brazilian Journal of Motor Behavior 14 (2020) 73–84."},"department":[{"_id":"266"},{"_id":"17"}],"author":[{"last_name":"Budde","id":"23188","full_name":"Budde, Kirsten","first_name":"Kirsten"},{"last_name":"Barela","first_name":"José Angelo","full_name":"Barela, José Angelo"},{"last_name":"Figueiredo","first_name":"Gabriella Andreeta","full_name":"Figueiredo, Gabriella Andreeta"},{"full_name":"Weigelt, Matthias","first_name":"Matthias","id":"36388","last_name":"Weigelt"}],"intvolume":"        14","_id":"48036","date_updated":"2023-10-12T10:08:09Z","publisher":"Brazilian Journal for Motor Behavior","date_created":"2023-10-12T10:05:33Z","status":"public","language":[{"iso":"eng"}],"year":"2020","publication_identifier":{"issn":["2446-4902","1980-5586"]}},{"user_id":"17386","keyword":["Textsortengeschichte"],"citation":{"short":"B.-M. Schuster, in: M.I. Matthews-Schlinzig, J. Schuster, G. Steinbrink , J. Strobel  (Eds.), Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres), de Gruyter, Berlin/Boston , 2020, pp. 19–39.","mla":"Schuster, Britt-Marie. “Linguistik des Briefs.” <i>Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)</i>, edited by Marie Isabel  Matthews-Schlinzig et al., vol. 1, de Gruyter, 2020, pp. 19–39.","bibtex":"@inbook{Schuster_2020, place={Berlin/Boston }, title={Linguistik des Briefs}, volume={1}, booktitle={Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)}, publisher={de Gruyter}, author={Schuster, Britt-Marie}, editor={Matthews-Schlinzig, Marie Isabel  and Schuster, Jörg  and Steinbrink , Gesa  and Strobel , Jochen }, year={2020}, pages={19–39} }","chicago":"Schuster, Britt-Marie. “Linguistik des Briefs.” In <i>Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)</i>, edited by Marie Isabel  Matthews-Schlinzig, Jörg  Schuster, Gesa  Steinbrink , and Jochen  Strobel , 1:19–39. Berlin/Boston : de Gruyter, 2020.","ieee":"B.-M. Schuster, “Linguistik des Briefs,” in <i>Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)</i>, vol. 1, M. I. Matthews-Schlinzig, J. Schuster, G. Steinbrink , and J. Strobel , Eds. Berlin/Boston : de Gruyter, 2020, pp. 19–39.","ama":"Schuster B-M. Linguistik des Briefs. In: Matthews-Schlinzig MI, Schuster J, Steinbrink  G, Strobel  J, eds. <i>Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)</i>. Vol 1. de Gruyter; 2020:19–39.","apa":"Schuster, B.-M. (2020). Linguistik des Briefs. In M. I. Matthews-Schlinzig, J. Schuster, G. Steinbrink , &#38; J. Strobel  (Eds.), <i>Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)</i> (Vol. 1, pp. 19–39). de Gruyter."},"department":[{"_id":"745"}],"author":[{"last_name":"Schuster","id":"17386","full_name":"Schuster, Britt-Marie","first_name":"Britt-Marie"}],"editor":[{"last_name":"Matthews-Schlinzig","full_name":"Matthews-Schlinzig, Marie Isabel ","first_name":"Marie Isabel "},{"full_name":"Schuster, Jörg ","first_name":"Jörg ","last_name":"Schuster"},{"last_name":"Steinbrink ","first_name":"Gesa ","full_name":"Steinbrink , Gesa "},{"last_name":"Strobel ","full_name":"Strobel , Jochen ","first_name":"Jochen "}],"title":"Linguistik des Briefs","intvolume":"         1","place":"Berlin/Boston ","volume":1,"page":"19–39","_id":"30954","date_updated":"2023-10-12T13:18:53Z","publisher":"de Gruyter","publication":"Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)","date_created":"2022-04-27T07:36:11Z","status":"public","year":"2020","type":"book_chapter","language":[{"iso":"ger"}]},{"publisher":"de Gruyter","date_created":"2022-05-09T12:47:01Z","publication":"Science Communication (Handbooks of Communication Science)","status":"public","language":[{"iso":"eng"}],"type":"book_chapter","year":"2020","volume":17,"_id":"31120","page":"167-186","date_updated":"2023-10-12T13:19:44Z","editor":[{"last_name":"Leßmöllmann","full_name":"Leßmöllmann, Annette ","first_name":"Annette "},{"last_name":"Dascal ","first_name":"Marcelo ","full_name":"Dascal , Marcelo "},{"first_name":"Thomas ","full_name":"Gloning , Thomas ","last_name":"Gloning "}],"author":[{"id":"17386","last_name":"Schuster","full_name":"Schuster, Britt-Marie","first_name":"Britt-Marie"}],"title":"The contribution of terminology research to the understanding of science communication","intvolume":"        17","place":"Berlin/Boston ","keyword":["Fachkommunikation"],"user_id":"17386","citation":{"ieee":"B.-M. Schuster, “The contribution of terminology research to the understanding of science communication,” in <i>Science Communication (Handbooks of Communication Science)</i>, vol. 17, A. Leßmöllmann, M. Dascal , and T. Gloning , Eds. Berlin/Boston : de Gruyter, 2020, pp. 167–186.","short":"B.-M. Schuster, in: A. Leßmöllmann, M. Dascal , T. Gloning  (Eds.), Science Communication (Handbooks of Communication Science), de Gruyter, Berlin/Boston , 2020, pp. 167–186.","chicago":"Schuster, Britt-Marie. “The Contribution of Terminology Research to the Understanding of Science Communication.” In <i>Science Communication (Handbooks of Communication Science)</i>, edited by Annette  Leßmöllmann, Marcelo  Dascal , and Thomas  Gloning , 17:167–86. Berlin/Boston : de Gruyter, 2020.","apa":"Schuster, B.-M. (2020). The contribution of terminology research to the understanding of science communication. In A. Leßmöllmann, M. Dascal , &#38; T. Gloning  (Eds.), <i>Science Communication (Handbooks of Communication Science)</i> (Vol. 17, pp. 167–186). de Gruyter.","ama":"Schuster B-M. The contribution of terminology research to the understanding of science communication. In: Leßmöllmann A, Dascal  M, Gloning  T, eds. <i>Science Communication (Handbooks of Communication Science)</i>. Vol 17. de Gruyter; 2020:167-186.","bibtex":"@inbook{Schuster_2020, place={Berlin/Boston }, title={The contribution of terminology research to the understanding of science communication}, volume={17}, booktitle={Science Communication (Handbooks of Communication Science)}, publisher={de Gruyter}, author={Schuster, Britt-Marie}, editor={Leßmöllmann, Annette  and Dascal , Marcelo  and Gloning , Thomas }, year={2020}, pages={167–186} }","mla":"Schuster, Britt-Marie. “The Contribution of Terminology Research to the Understanding of Science Communication.” <i>Science Communication (Handbooks of Communication Science)</i>, edited by Annette  Leßmöllmann et al., vol. 17, de Gruyter, 2020, pp. 167–86."},"department":[{"_id":"745"}]},{"date_updated":"2023-10-12T13:20:24Z","_id":"31129","page":"9–32","type":"book_chapter","year":"2020","language":[{"iso":"ger"}],"status":"public","publication":"Diskurs – ethisch.","date_created":"2022-05-09T12:57:24Z","department":[{"_id":"745"}],"citation":{"bibtex":"@inbook{Schuster_Markewitz_Wilk_2020, place={Bremen}, title={Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns}, booktitle={Diskurs – ethisch.}, author={Schuster, Britt-Marie and Markewitz, Friedrich and Wilk, Nicole M. }, editor={Kämper,  Heidrun and Warnke,  Ingo H}, year={2020}, pages={9–32} }","mla":"Schuster, Britt-Marie, et al. “Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns.” <i>Diskurs – ethisch.</i>, edited by  Heidrun Kämper and  Ingo H Warnke, 2020, pp. 9–32.","short":"B.-M. Schuster, F. Markewitz, N.M. Wilk, in:  Heidrun Kämper,  Ingo H Warnke (Eds.), Diskurs – ethisch., Bremen, 2020, pp. 9–32.","apa":"Schuster, B.-M., Markewitz, F., &#38; Wilk, N. M. (2020). Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns. In  Heidrun Kämper &#38;  Ingo H Warnke (Eds.), <i>Diskurs – ethisch.</i> (pp. 9–32).","ama":"Schuster B-M, Markewitz F, Wilk NM. Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns. In: Kämper  Heidrun, Warnke  Ingo H, eds. <i>Diskurs – ethisch.</i> ; 2020:9–32.","ieee":"B.-M. Schuster, F. Markewitz, and N. M. Wilk, “Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns,” in <i>Diskurs – ethisch.</i>,  Heidrun Kämper and  Ingo H Warnke, Eds. Bremen, 2020, pp. 9–32.","chicago":"Schuster, Britt-Marie, Friedrich Markewitz, and Nicole M.  Wilk. “Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns.” In <i>Diskurs – ethisch.</i>, edited by  Heidrun Kämper and  Ingo H Warnke, 9–32. Bremen, 2020."},"user_id":"17386","keyword":["Textsemantik"],"place":"Bremen","title":"Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns","author":[{"first_name":"Britt-Marie","full_name":"Schuster, Britt-Marie","last_name":"Schuster","id":"17386"},{"last_name":"Markewitz","id":"67227","full_name":"Markewitz, Friedrich","first_name":"Friedrich"},{"full_name":"Wilk, Nicole M. ","first_name":"Nicole M. ","last_name":"Wilk"}],"editor":[{"full_name":"Kämper,  Heidrun","first_name":" Heidrun","last_name":"Kämper"},{"last_name":"Warnke","full_name":"Warnke,  Ingo H","first_name":" Ingo H"}]},{"date_created":"2020-12-16T14:15:24Z","status":"public","language":[{"iso":"eng"}],"year":"2020","file_date_updated":"2020-12-16T14:16:32Z","_id":"20766","date_updated":"2023-11-15T12:14:25Z","author":[{"last_name":"Kinoshita","first_name":"Keisuke","full_name":"Kinoshita, Keisuke"},{"orcid":"https://orcid.org/0000-0002-7717-8670","id":"49870","last_name":"von Neumann","full_name":"von Neumann, Thilo","first_name":"Thilo"},{"last_name":"Delcroix","full_name":"Delcroix, Marc","first_name":"Marc"},{"first_name":"Tomohiro","full_name":"Nakatani, Tomohiro","last_name":"Nakatani"},{"first_name":"Reinhold","full_name":"Haeb-Umbach, Reinhold","id":"242","last_name":"Haeb-Umbach"}],"citation":{"apa":"Kinoshita, K., von Neumann, T., Delcroix, M., Nakatani, T., &#38; Haeb-Umbach, R. (2020). Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation. <i>Proc. Interspeech 2020</i>, 2652–2656. <a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">https://doi.org/10.21437/Interspeech.2020-2388</a>","ama":"Kinoshita K, von Neumann T, Delcroix M, Nakatani T, Haeb-Umbach R. Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation. In: <i>Proc. Interspeech 2020</i>. ; 2020:2652-2656. doi:<a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>","chicago":"Kinoshita, Keisuke, Thilo von Neumann, Marc Delcroix, Tomohiro Nakatani, and Reinhold Haeb-Umbach. “Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and Its Application to Speaker Stream Separation.” In <i>Proc. Interspeech 2020</i>, 2652–56, 2020. <a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">https://doi.org/10.21437/Interspeech.2020-2388</a>.","ieee":"K. Kinoshita, T. von Neumann, M. Delcroix, T. Nakatani, and R. Haeb-Umbach, “Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation,” in <i>Proc. Interspeech 2020</i>, 2020, pp. 2652–2656, doi: <a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>.","mla":"Kinoshita, Keisuke, et al. “Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and Its Application to Speaker Stream Separation.” <i>Proc. Interspeech 2020</i>, 2020, pp. 2652–56, doi:<a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>.","bibtex":"@inproceedings{Kinoshita_von Neumann_Delcroix_Nakatani_Haeb-Umbach_2020, title={Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation}, DOI={<a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>}, booktitle={Proc. Interspeech 2020}, author={Kinoshita, Keisuke and von Neumann, Thilo and Delcroix, Marc and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}, year={2020}, pages={2652–2656} }","short":"K. Kinoshita, T. von Neumann, M. Delcroix, T. Nakatani, R. Haeb-Umbach, in: Proc. Interspeech 2020, 2020, pp. 2652–2656."},"department":[{"_id":"54"}],"quality_controlled":"1","publication":"Proc. Interspeech 2020","ddc":["000"],"type":"conference","page":"2652-2656","file":[{"date_updated":"2020-12-16T14:16:32Z","relation":"main_file","date_created":"2020-12-16T14:16:32Z","content_type":"application/pdf","access_level":"open_access","file_id":"20767","file_size":1725219,"file_name":"INTERSPEECH_2020_vonNeumann1_Paper.pdf","creator":"huesera"}],"title":"Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation","doi":"10.21437/Interspeech.2020-2388","abstract":[{"lang":"eng","text":"Recently, the source separation performance was greatly improved by time-domain audio source separation based on dual-path recurrent neural network (DPRNN). DPRNN is a simple but effective model for a long sequential data. While DPRNN is quite efficient in modeling a sequential data of the length of an utterance, i.e., about 5 to 10 second data, it is harder to apply it to longer sequences such as whole conversations consisting of multiple utterances. It is simply because, in such a case, the number of time steps consumed by its internal module called inter-chunk RNN becomes extremely large. To mitigate this problem, this paper proposes a multi-path RNN (MPRNN), a generalized version of DPRNN, that models the input data in a hierarchical manner. In the MPRNN framework, the input data is represented at several (>_ 3) time-resolutions, each of which is modeled by a specific RNN sub-module. For example, the RNN sub-module that deals with the finest resolution may model temporal relationship only within a phoneme, while the RNN sub-module handling the most coarse resolution may capture only the relationship between utterances such as speaker information. We perform experiments using simulated dialogue-like mixtures and show that MPRNN has greater model capacity, and it outperforms the current state-of-the-art DPRNN framework especially in online processing scenarios."}],"has_accepted_license":"1","user_id":"49870","oa":"1"},{"title":"Innovation management and strategic planning of innovative self-preparednes and self-Protection services","author":[{"orcid":"0000-0001-5765-971X","first_name":"Iris","full_name":"Gräßler, Iris","id":"47565","last_name":"Gräßler"},{"orcid":"http://orcid.org/0000-0001-8778-2989","first_name":"Jens","full_name":"Pottebaum, Jens","last_name":"Pottebaum","id":"405"},{"first_name":"Philipp","full_name":"Scholle, Philipp","last_name":"Scholle"},{"full_name":"Thiele, Henrik","first_name":"Henrik","id":"33419","last_name":"Thiele"}],"citation":{"mla":"Gräßler, Iris, et al. “Innovation Management and Strategic Planning of Innovative Self-Preparednes and Self-Protection Services.” <i>ISPIM Conference Proceedings; 7. - 10. Jun. 2020</i>, International Society for Professional Innovation Management (ISPIM), 2020, pp. 1–9.","bibtex":"@inproceedings{Gräßler_Pottebaum_Scholle_Thiele_2020, title={Innovation management and strategic planning of innovative self-preparednes and self-Protection services}, booktitle={ISPIM Conference Proceedings; 7. - 10. Jun. 2020}, publisher={International Society for Professional Innovation Management (ISPIM)}, author={Gräßler, Iris and Pottebaum, Jens and Scholle, Philipp and Thiele, Henrik}, year={2020}, pages={1–9} }","short":"I. Gräßler, J. Pottebaum, P. Scholle, H. Thiele, in: ISPIM Conference Proceedings; 7. - 10. Jun. 2020, International Society for Professional Innovation Management (ISPIM), 2020, pp. 1–9.","ama":"Gräßler I, Pottebaum J, Scholle P, Thiele H. Innovation management and strategic planning of innovative self-preparednes and self-Protection services. In: <i>ISPIM Conference Proceedings; 7. - 10. Jun. 2020</i>. International Society for Professional Innovation Management (ISPIM); 2020:1-9.","apa":"Gräßler, I., Pottebaum, J., Scholle, P., &#38; Thiele, H. (2020). Innovation management and strategic planning of innovative self-preparednes and self-Protection services. <i>ISPIM Conference Proceedings; 7. - 10. Jun. 2020</i>, 1–9.","chicago":"Gräßler, Iris, Jens Pottebaum, Philipp Scholle, and Henrik Thiele. “Innovation Management and Strategic Planning of Innovative Self-Preparednes and Self-Protection Services.” In <i>ISPIM Conference Proceedings; 7. - 10. Jun. 2020</i>, 1–9. International Society for Professional Innovation Management (ISPIM), 2020.","ieee":"I. Gräßler, J. Pottebaum, P. Scholle, and H. Thiele, “Innovation management and strategic planning of innovative self-preparednes and self-Protection services,” in <i>ISPIM Conference Proceedings; 7. - 10. Jun. 2020</i>, 2020, pp. 1–9."},"user_id":"405","main_file_link":[{"url":"https://engrxiv.org/d25w4/"}],"department":[{"_id":"152"}],"quality_controlled":"1","publication":"ISPIM Conference Proceedings; 7. - 10. Jun. 2020","date_created":"2021-08-24T09:48:06Z","publisher":"International Society for Professional Innovation Management (ISPIM)","publication_identifier":{"unknown":["ISBN 978-952-335-466-1"]},"type":"conference","year":"2020","language":[{"iso":"eng"}],"status":"public","_id":"23513","page":"1-9","date_updated":"2023-11-16T09:21:58Z"},{"author":[{"first_name":"Olaf","full_name":"Hartung, Olaf","id":"79451","last_name":"Hartung"}],"title":"Museen und Geschichtsunterricht","place":"Stuttgart","user_id":"79451","publication_status":"published","citation":{"apa":"Hartung, O. (2020). <i>Museen und Geschichtsunterricht</i> (1st ed.). W. Kohlhammer.","ama":"Hartung O. <i>Museen und Geschichtsunterricht</i>. 1st ed. W. Kohlhammer; 2020.","ieee":"O. Hartung, <i>Museen und Geschichtsunterricht</i>, 1st ed. Stuttgart: W. Kohlhammer, 2020.","chicago":"Hartung, Olaf. <i>Museen und Geschichtsunterricht</i>. 1st ed. Stuttgart: W. Kohlhammer, 2020.","bibtex":"@book{Hartung_2020, place={Stuttgart}, edition={1}, title={Museen und Geschichtsunterricht}, publisher={W. Kohlhammer}, author={Hartung, Olaf}, year={2020} }","mla":"Hartung, Olaf. <i>Museen und Geschichtsunterricht</i>. 1st ed., W. Kohlhammer, 2020.","short":"O. Hartung, Museen und Geschichtsunterricht, 1st ed., W. Kohlhammer, Stuttgart, 2020."},"department":[{"_id":"6"},{"_id":"444"}],"publisher":"W. Kohlhammer","date_created":"2022-02-13T17:14:24Z","status":"public","year":"2020","publication_identifier":{"isbn":["978-3-17-022637-1"]},"type":"book","language":[{"iso":"ger"}],"page":"178","_id":"29817","edition":"1","date_updated":"2023-11-16T18:31:41Z"},{"language":[{"iso":"eng"}],"year":"2020","publication_identifier":{"isbn":["9783030512637","9783030512644"],"issn":["2198-4182","2198-4190"]},"status":"public","date_created":"2020-08-14T15:02:22Z","publisher":"Springer International Publishing","date_updated":"2023-11-17T13:13:25Z","_id":"17994","place":"Cham","intvolume":"       304","author":[{"full_name":"Gerlach, Raphael","first_name":"Raphael","id":"32655","last_name":"Gerlach"},{"last_name":"Ziessler","first_name":"Adrian","full_name":"Ziessler, Adrian"}],"editor":[{"last_name":"Junge","full_name":"Junge, Oliver","first_name":"Oliver"},{"full_name":"Schütze, Oliver","first_name":"Oliver","last_name":"Schütze"},{"first_name":"Sina","full_name":"Ober-Blöbaum, Sina","last_name":"Ober-Blöbaum"},{"last_name":"Padberg-Gehle","full_name":"Padberg-Gehle, Kathrin","first_name":"Kathrin"}],"department":[{"_id":"101"}],"citation":{"mla":"Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems.” <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge et al., vol. 304, Springer International Publishing, 2020, pp. 66–85, doi:<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>.","apa":"Gerlach, R., &#38; Ziessler, A. (2020). The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems. In O. Junge, O. Schütze, S. Ober-Blöbaum, &#38; K. Padberg-Gehle (Eds.), <i>Advances in Dynamics, Optimization and Computation</i> (Vol. 304, pp. 66–85). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">https://doi.org/10.1007/978-3-030-51264-4_3</a>","bibtex":"@inbook{Gerlach_Ziessler_2020, place={Cham}, series={Studies in Systems, Decision and Control}, title={The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems}, volume={304}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>}, booktitle={Advances in Dynamics, Optimization and Computation}, publisher={Springer International Publishing}, author={Gerlach, Raphael and Ziessler, Adrian}, editor={Junge, Oliver and Schütze, Oliver and Ober-Blöbaum, Sina and Padberg-Gehle, Kathrin}, year={2020}, pages={66–85}, collection={Studies in Systems, Decision and Control} }","ama":"Gerlach R, Ziessler A. The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems. In: Junge O, Schütze O, Ober-Blöbaum S, Padberg-Gehle K, eds. <i>Advances in Dynamics, Optimization and Computation</i>. Vol 304. Studies in Systems, Decision and Control. Springer International Publishing; 2020:66-85. doi:<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>","short":"R. Gerlach, A. Ziessler, in: O. Junge, O. Schütze, S. Ober-Blöbaum, K. Padberg-Gehle (Eds.), Advances in Dynamics, Optimization and Computation, Springer International Publishing, Cham, 2020, pp. 66–85.","chicago":"Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems.” In <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge, Oliver Schütze, Sina Ober-Blöbaum, and Kathrin Padberg-Gehle, 304:66–85. Studies in Systems, Decision and Control. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">https://doi.org/10.1007/978-3-030-51264-4_3</a>.","ieee":"R. Gerlach and A. Ziessler, “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems,” in <i>Advances in Dynamics, Optimization and Computation</i>, vol. 304, O. Junge, O. Schütze, S. Ober-Blöbaum, and K. Padberg-Gehle, Eds. Cham: Springer International Publishing, 2020, pp. 66–85."},"series_title":"Studies in Systems, Decision and Control","publication_status":"published","type":"book_chapter","publication":"Advances in Dynamics, Optimization and Computation","page":"66-85","volume":304,"doi":"10.1007/978-3-030-51264-4_3","abstract":[{"lang":"eng","text":"In this work we review the novel framework for the computation of finite dimensional invariant sets of infinite dimensional dynamical systems developed in [6] and [36]. By utilizing results on embedding techniques for infinite dimensional systems we extend a classical subdivision scheme [8] as well as a continuation algorithm [7] for the computation of attractors and invariant manifolds of finite dimensional systems to the infinite dimensional case. We show how to implement this approach for the analysis of delay differential equations and partial differential equations and illustrate the feasibility of our implementation by computing the attractor of the Mackey-Glass equation and the unstable manifold of the one-dimensional Kuramoto-Sivashinsky equation."}],"title":"The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-030-51264-4_3"}],"user_id":"32655"},{"abstract":[{"lang":"eng","text":"Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite graphs more efficiently by using dynamic optimization. In our approach the graph instance is given incrementally such that the EA can reoptimize its coloring when a new edge introduces a conflict. We show that, when edges are inserted in a way that preserves graph connectivity, Randomized Local Search (RLS) efficiently finds a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS and other EAs need exponential expected time in a static optimization scenario. We investigate different ways of building up the graph by popular graph traversals such as breadth-first-search and depth-first-search and analyse the resulting runtime behavior. We further show that offspring populations (e. g. a (1 + {$\\lambda$}) RLS) lead to an exponential speedup in {$\\lambda$}. Finally, an island model using 3 islands succeeds in an optimal time of {$\\Theta$}(m) on every m-edge bipartite graph, outperforming offspring populations. This is the first example where an island model guarantees a speedup that is not bounded in the number of islands."}],"doi":"10.1145/3377930.3390174","extern":"1","title":"More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"user_id":"102979","type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","page":"1277–1285","place":"New York, NY, USA","author":[{"last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"},{"first_name":"Pan","full_name":"Peng, Pan","last_name":"Peng"},{"full_name":"Sudholt, Dirk","first_name":"Dirk","last_name":"Sudholt"}],"department":[{"_id":"819"}],"publication_status":"published","citation":{"ama":"Bossek J, Neumann F, Peng P, Sudholt D. More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:1277–1285. doi:<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>","apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2020). More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1277–1285. <a href=\"https://doi.org/10.1145/3377930.3390174\">https://doi.org/10.1145/3377930.3390174</a>","ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 1277–1285, doi: <a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>.","chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390174\">https://doi.org/10.1145/3377930.3390174</a>.","bibtex":"@inproceedings{Bossek_Neumann_Peng_Sudholt_2020, place={New York, NY, USA}, series={GECCO ’20}, title={More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2020}, pages={1277–1285}, collection={GECCO ’20} }","mla":"Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 1277–1285, doi:<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1277–1285."},"series_title":"GECCO ’20","status":"public","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"year":"2020","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:53Z","date_updated":"2023-12-13T10:43:41Z","_id":"48847"},{"publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:53Z","status":"public","year":"2020","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"language":[{"iso":"eng"}],"_id":"48851","date_updated":"2023-12-13T10:43:33Z","author":[{"orcid":"0000-0002-4121-4668","id":"102979","last_name":"Bossek","full_name":"Bossek, Jakob","first_name":"Jakob"},{"first_name":"Katrin","full_name":"Casel, Katrin","last_name":"Casel"},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"}],"place":"New York, NY, USA","publication_status":"published","series_title":"GECCO ’20","citation":{"bibtex":"@inproceedings{Bossek_Casel_Kerschke_Neumann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Casel, Katrin and Kerschke, Pascal and Neumann, Frank}, year={2020}, pages={1286–1294}, collection={GECCO ’20} }","mla":"Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 1286–1294, doi:<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>.","short":"J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1286–1294.","apa":"Bossek, J., Casel, K., Kerschke, P., &#38; Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1286–1294. <a href=\"https://doi.org/10.1145/3377930.3390243\">https://doi.org/10.1145/3377930.3390243</a>","ama":"Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>","ieee":"J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 1286–1294, doi: <a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>.","chicago":"Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1286–1294. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390243\">https://doi.org/10.1145/3377930.3390243</a>."},"department":[{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","page":"1286–1294","extern":"1","title":"The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics","abstract":[{"lang":"eng","text":"Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows to study precisely the increase in difficulty caused by weight dependence. We provide a 3.59-approximation for this weight dependent version of TSP with metric distances and bounded positive weights. Furthermore, we conduct experimental investigations for simple randomized local search with classical mutation operators and two variants of the state-of-the-art evolutionary algorithm EAX adapted to the weighted TSP. Our results show the impact of the node weights on the position of the nodes in the resulting tour."}],"doi":"10.1145/3377930.3390243","user_id":"102979","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"]},{"author":[{"first_name":"Jakob","full_name":"Bossek, Jakob","last_name":"Bossek","id":"102979","orcid":"0000-0002-4121-4668"},{"full_name":"Grimme, Christian","first_name":"Christian","last_name":"Grimme"},{"last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"place":"New York, NY, USA","series_title":"GECCO ’20","citation":{"mla":"Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 166–174, doi:<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>.","bibtex":"@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Trautmann, Heike}, year={2020}, pages={166–174}, collection={GECCO ’20} }","short":"J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 166–174.","apa":"Bossek, J., Grimme, C., &#38; Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>","ama":"Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>","chicago":"Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective Routing of Multiple Vehicles.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>.","ieee":"J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 166–174, doi: <a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>."},"publication_status":"published","department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:52Z","publisher":"Association for Computing Machinery","year":"2020","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"language":[{"iso":"eng"}],"status":"public","_id":"48845","date_updated":"2023-12-13T10:43:24Z","title":"Dynamic Bi-Objective Routing of Multiple Vehicles","extern":"1","doi":"10.1145/3377930.3390146","abstract":[{"lang":"eng","text":"In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier."}],"user_id":"102979","keyword":["decision making","dynamic optimization","evolutionary algorithms","multi-objective optimization","vehicle routing"],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","page":"166–174"},{"place":"New York, NY, USA","author":[{"orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","id":"102979"},{"last_name":"Doerr","full_name":"Doerr, Carola","first_name":"Carola"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"}],"department":[{"_id":"819"}],"series_title":"GECCO ’20","citation":{"mla":"Bossek, Jakob, et al. “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 778–786, doi:<a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>.","apa":"Bossek, J., Doerr, C., &#38; Kerschke, P. (2020). Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 778–786. <a href=\"https://doi.org/10.1145/3377930.3390155\">https://doi.org/10.1145/3377930.3390155</a>","bibtex":"@inproceedings{Bossek_Doerr_Kerschke_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal}, year={2020}, pages={778–786}, collection={GECCO ’20} }","ama":"Bossek J, Doerr C, Kerschke P. Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:778–786. doi:<a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>","short":"J. Bossek, C. Doerr, P. Kerschke, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 778–786.","chicago":"Bossek, Jakob, Carola Doerr, and Pascal Kerschke. “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 778–786. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390155\">https://doi.org/10.1145/3377930.3390155</a>.","ieee":"J. Bossek, C. Doerr, and P. Kerschke, “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 778–786, doi: <a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>."},"publication_status":"published","year":"2020","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"language":[{"iso":"eng"}],"status":"public","date_created":"2023-11-14T15:58:53Z","publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:44:01Z","_id":"48850","abstract":[{"lang":"eng","text":"Sequential model-based optimization (SMBO) approaches are algorithms for solving problems that require computationally or otherwise expensive function evaluations. The key design principle of SMBO is a substitution of the true objective function by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO algorithms are intrinsically modular, leaving the user with many important design choices. Significant research efforts go into understanding which settings perform best for which type of problems. Most works, however, focus on the choice of the model, the acquisition function, and the strategy used to optimize the latter. The choice of the initial sampling strategy, however, receives much less attention. Not surprisingly, quite diverging recommendations can be found in the literature. We analyze in this work how the size and the distribution of the initial sample influences the overall quality of the efficient global optimization (EGO) algorithm, a well-known SMBO approach. While, overall, small initial budgets using Halton sampling seem preferable, we also observe that the performance landscape is rather unstructured. We furthermore identify several situations in which EGO performs unfavorably against random sampling. Both observations indicate that an adaptive SMBO design could be beneficial, making SMBO an interesting test-bed for automated algorithm design."}],"doi":"10.1145/3377930.3390155","title":"Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB","extern":"1","user_id":"102979","keyword":["continuous black-box optimization","design of experiments","initial design","sequential model-based optimization"],"type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","page":"778–786"},{"page":"681–689","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","user_id":"102979","keyword":["diversity maximisation","evolutionary algorithms","travelling salesperson problem"],"extern":"1","title":"Evolving Diverse Sets of Tours for the Travelling Salesperson Problem","abstract":[{"lang":"eng","text":"Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this area of research by examining evolutionary diversity optimisation approaches for the classical Traveling Salesperson Problem (TSP). We study the impact of using different diversity measures for a given set of tours and the ability of evolutionary algorithms to obtain a diverse set of high quality solutions when adopting these measures. Our studies show that a large variety of diverse high quality tours can be achieved by using our approaches. Furthermore, we compare our approaches in terms of theoretical properties and the final set of tours obtained by the evolutionary diversity optimisation algorithm."}],"doi":"10.1145/3377930.3389844","_id":"48879","date_updated":"2023-12-13T10:48:50Z","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:58Z","status":"public","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"year":"2020","language":[{"iso":"eng"}],"series_title":"GECCO’20","citation":{"short":"A.V. Do, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 681–689.","mla":"Do, Anh Viet, et al. “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 681–689, doi:<a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>.","bibtex":"@inproceedings{Do_Bossek_Neumann_Neumann_2020, place={New York, NY, USA}, series={GECCO’20}, title={Evolving Diverse Sets of Tours for the Travelling Salesperson Problem}, DOI={<a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Do, Anh Viet and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={681–689}, collection={GECCO’20} }","chicago":"Do, Anh Viet, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 681–689. GECCO’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3389844\">https://doi.org/10.1145/3377930.3389844</a>.","ieee":"A. V. Do, J. Bossek, A. Neumann, and F. Neumann, “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 681–689, doi: <a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>.","ama":"Do AV, Bossek J, Neumann A, Neumann F. Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO’20. Association for Computing Machinery; 2020:681–689. doi:<a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>","apa":"Do, A. V., Bossek, J., Neumann, A., &#38; Neumann, F. (2020). Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 681–689. <a href=\"https://doi.org/10.1145/3377930.3389844\">https://doi.org/10.1145/3377930.3389844</a>"},"department":[{"_id":"819"}],"author":[{"first_name":"Anh Viet","full_name":"Do, Anh Viet","last_name":"Do"},{"full_name":"Bossek, Jakob","first_name":"Jakob","id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"last_name":"Neumann","first_name":"Aneta","full_name":"Neumann, Aneta"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"}],"place":"New York, NY, USA"},{"status":"public","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"year":"2020","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:59:00Z","date_updated":"2023-12-13T10:49:38Z","_id":"48895","place":"New York, NY, USA","author":[{"full_name":"Roostapour, Vahid","first_name":"Vahid","last_name":"Roostapour"},{"id":"102979","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"}],"department":[{"_id":"819"}],"citation":{"ama":"Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In: <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>. {GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>","apa":"Roostapour, V., Bossek, J., &#38; Neumann, F. (2020). Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 551–559. <a href=\"https://doi.org/10.1145/3377930.3390168\">https://doi.org/10.1145/3377930.3390168</a>","ieee":"V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem,” in <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 2020, pp. 551–559, doi: <a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>.","chicago":"Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” In <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 551–559. {GECCO} ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390168\">https://doi.org/10.1145/3377930.3390168</a>.","bibtex":"@inproceedings{Roostapour_Bossek_Neumann_2020, place={New York, NY, USA}, series={{GECCO} ’20}, title={Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>}, booktitle={Proceedings of the 2020 Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Roostapour, Vahid and Bossek, Jakob and Neumann, Frank}, year={2020}, pages={551–559}, collection={{GECCO} ’20} }","mla":"Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 551–559, doi:<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>.","short":"V. Roostapour, J. Bossek, F. Neumann, in: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 551–559."},"series_title":"{GECCO} ’20","type":"conference","publication":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","page":"551–559","doi":"10.1145/3377930.3390168","abstract":[{"text":"Evolutionary algorithms (EAs) are general-purpose problem solvers that usually perform an unbiased search. This is reasonable and desirable in a black-box scenario. For combinatorial optimization problems, often more knowledge about the structure of optimal solutions is given, which can be leveraged by means of biased search operators. We consider the Minimum Spanning Tree (MST) problem in a single- and multi-objective version, and introduce a biased mutation, which puts more emphasis on the selection of edges of low rank in terms of low domination number. We present example graphs where the biased mutation can significantly speed up the expected runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate that bias can lead to exponential runtime if \"heavy\" edges are necessarily part of an optimal solution. However, on general graphs in the single-objective setting, we show that a combined mutation operator which decides for unbiased or biased edge selection in each step with equal probability exhibits a polynomial upper bound - as unbiased mutation - in the worst case and benefits from bias if the circumstances are favorable.","lang":"eng"}],"extern":"1","title":"Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem","keyword":["biased mutation","evolutionary algorithms","minimum spanning tree problem","runtime analysis"],"user_id":"102979"},{"status":"public","type":"misc","year":"2020","language":[{"iso":"ger"}],"publisher":"Zwischentöne.info ","date_created":"2023-12-13T13:19:41Z","date_updated":"2023-12-13T20:31:09Z","_id":"49599","place":"Zwischentöne.info ","author":[{"full_name":"Fastlabend-Vargas, Daniel","first_name":"Daniel","last_name":"Fastlabend-Vargas","id":"23102"}],"title":"Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info ","department":[{"_id":"6"},{"_id":"444"}],"user_id":"23102","oa":"1","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.zwischentoene.info/unterrichtseinheit/praesentation?tx_uemat_uemat%5Bunterrichtseinheit%5D=65&cHash=ea39aadf818de9c990c1f542ba84741b"}],"citation":{"ama":"Fastlabend-Vargas D. <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info ; 2020.","apa":"Fastlabend-Vargas, D. (2020). <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info .","chicago":"Fastlabend-Vargas, Daniel. <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info : Zwischentöne.info , 2020.","ieee":"D. Fastlabend-Vargas, <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info : Zwischentöne.info , 2020.","mla":"Fastlabend-Vargas, Daniel. <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info , 2020.","bibtex":"@book{Fastlabend-Vargas_2020, place={Zwischentöne.info }, title={Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info }, publisher={Zwischentöne.info }, author={Fastlabend-Vargas, Daniel}, year={2020} }","short":"D. Fastlabend-Vargas, Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info , Zwischentöne.info , Zwischentöne.info , 2020."}},{"date_created":"2023-12-18T10:02:47Z","publisher":"BelgienNet","year":"2020","type":"misc","language":[{"iso":"ger"},{"iso":"fre"}],"status":"public","_id":"49767","date_updated":"2023-12-18T10:08:13Z","title":"\"Die Bombardierung von Brüssel - teil 1\" (PODCAST)","author":[{"orcid":"0009-0009-2166-9794","first_name":"Yves","full_name":"Huybrechts, Yves","last_name":"Huybrechts","id":"78579"}],"citation":{"bibtex":"@book{Huybrechts_2020, title={“Die Bombardierung von Brüssel - teil 1” (PODCAST)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2020} }","mla":"Huybrechts, Yves. <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet, 2020.","short":"Y. Huybrechts, “Die Bombardierung von Brüssel - teil 1” (PODCAST), BelgienNet, 2020.","ama":"Huybrechts Y. <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet; 2020.","apa":"Huybrechts, Y. (2020). <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet.","ieee":"Y. Huybrechts, <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet, 2020.","chicago":"Huybrechts, Yves. <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet, 2020."},"user_id":"78579","oa":"1","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://belgien.net/die-bombardierung-von-bruessel-teil-1/"}],"department":[{"_id":"448"}]}]