[{"type":"conference","department":[{"_id":"78"}],"place":"New York, NY, United States","date_created":"2022-09-02T11:47:17Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - Subproject C2"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"publication":"GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion","citation":{"mla":"Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2022, pp. 2071–79, doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","ama":"Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. In: <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. Association for Computing Machinery (ACM); 2022:2071-2079. doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>","bibtex":"@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}, DOI={<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>}, booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079} }","apa":"Hansmeier, T., Brede, M., &#38; Platzner, M. (2022). XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–2079. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>","ieee":"T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion,” in <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Boston, MA, USA, 2022, pp. 2071–2079, doi: <a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","chicago":"Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–79. New York, NY, United States: Association for Computing Machinery (ACM), 2022. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>.","short":"T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2022, pp. 2071–2079."},"doi":"10.1145/3520304.3533977","user_id":"477","page":"2071-2079","_id":"33253","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery (ACM)","date_updated":"2022-11-18T10:13:22Z","publication_status":"published","year":"2022","title":"XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion","status":"public","conference":{"end_date":"2022-07-13","location":"Boston, MA, USA","name":"International Workshop on Learning Classifier Systems (IWLCS 2022)","start_date":"2022-07-09"},"author":[{"full_name":"Hansmeier, Tim","first_name":"Tim","last_name":"Hansmeier","orcid":"0000-0003-1377-3339","id":"49992"},{"last_name":"Brede","first_name":"Mathis","full_name":"Brede, Mathis"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}]},{"_id":"33274","language":[{"iso":"eng"}],"page":"51 - 61","user_id":"477","author":[{"id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","last_name":"Chen"},{"full_name":"Chen, Mei-Hua","last_name":"Chen","first_name":"Mei-Hua"},{"full_name":"Mudgal, Garima","last_name":"Mudgal","first_name":"Garima"},{"id":"3900","first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning"}],"title":"Analyzing Culture-Specific Argument Structures in Learner Essays","status":"public","year":"2022","date_updated":"2022-11-18T09:56:17Z","date_created":"2022-09-06T13:51:23Z","department":[{"_id":"600"}],"type":"conference","citation":{"mla":"Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner Essays.” <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","ama":"Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument Structures in Learner Essays. In: <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>. ; 2022:51-61.","bibtex":"@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }","apa":"Chen, W.-F., Chen, M.-H., Mudgal, G., &#38; Wachsmuth, H. (2022). Analyzing Culture-Specific Argument Structures in Learner Essays. <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61.","ieee":"W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific Argument Structures in Learner Essays,” in <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","chicago":"Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing Culture-Specific Argument Structures in Learner Essays.” In <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61, 2022.","short":"W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61."},"publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)","project":[{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}]},{"doi":"10.4230/LIPIcs.ESA.2022.77","language":[{"iso":"eng"}],"series_title":"LIPIcs","intvolume":"       244","date_updated":"2022-11-18T10:14:14Z","author":[{"id":"88252","last_name":"Maack","first_name":"Marten","full_name":"Maack, Marten"},{"full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop","id":"44428"},{"first_name":"Anna Rodriguez","last_name":"Rasmussen","full_name":"Rasmussen, Anna Rodriguez"}],"title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling","year":"2022","department":[{"_id":"63"}],"type":"conference","date_created":"2022-09-27T13:06:05Z","publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","volume":244,"editor":[{"full_name":"Chechik, Shiri","first_name":"Shiri","last_name":"Chechik"},{"last_name":"Navarro","first_name":"Gonzalo","full_name":"Navarro, Gonzalo"},{"full_name":"Rotenberg, Eva","first_name":"Eva","last_name":"Rotenberg"},{"first_name":"Grzegorz","last_name":"Herman","full_name":"Herman, Grzegorz"}],"user_id":"477","_id":"33491","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","page":"77:1–77:13","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"citation":{"bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>.","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>"}},{"year":"2022","title":"Hardware Trojans in Reconfigurable Computing","author":[{"id":"72764","orcid":"0000-0002-1837-2254","first_name":"Qazi Arbab","last_name":"Ahmed","full_name":"Ahmed, Qazi Arbab"}],"date_updated":"2022-11-30T13:39:01Z","publication_status":"published","main_file_link":[{"url":"\turn:nbn:de:hbz:466:2-40303","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-1271","abstract":[{"lang":"eng","text":"Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen den Trojaner ``Heimtückische LUT'' stellen wir die allererste erfolgreiche Gegenmaßnahme vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden."},{"text":"The battle of developing hardware Trojans and corresponding countermeasures has taken adversaries towards ingenious ways of compromising hardware designs by circumventing even advanced testing and verification methods. Besides conventional methods of inserting Trojans into a design by a malicious entity, the design flow for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised to assist the attacker to perform a successful malfunctioning or information leakage attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable systems, the defenders perspective which corresponds to the bitstream-level Trojan detection technique, and the attackers perspective which corresponds to a novel FPGA Trojan attack. From the defender's perspective, we introduce a first-ever successful pre-configuration countermeasure against the ``Malicious LUT''-hardware Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers perspective, we present a novel attack that leverages malicious routing of the inserted Trojan circuit to acquire a dormant state even in the generated and transmitted bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected in the bitstream, the presented attack can currently neither be prevented by conventional testing and verification methods nor by bitstream-level verification techniques.","lang":"eng"}],"date_created":"2022-02-07T14:02:36Z","type":"dissertation","keyword":["FPGA Security","Hardware Trojans","Bitstream-level Trojans","Bitstream Verification"],"department":[{"_id":"78"}],"status":"public","has_accepted_license":"1","_id":"29769","publisher":" Paderborn University, Paderborn, Germany","ddc":["004"],"user_id":"477","supervisor":[{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"citation":{"short":"Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing,  Paderborn University, Paderborn, Germany, Paderborn, 2022.","chicago":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>.","ieee":"Q. A. Ahmed, <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022.","apa":"Ahmed, Q. A. (2022). <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>","bibtex":"@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable Computing}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>}, publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab}, year={2022} }","ama":"Ahmed QA. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>","mla":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany, 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"}],"place":"Paderborn","oa":"1"},{"title":"Characterization of Usage Data with the Help of Data Classifications","status":"public","year":"2022","publication_identifier":{"issn":["1868-7865","1868-7873"]},"author":[{"first_name":"Melina","last_name":"Panzner","full_name":"Panzner, Melina"},{"first_name":"Sebastian","last_name":"von Enzberg","full_name":"von Enzberg, Sebastian"},{"last_name":"Meyer","first_name":"Maurice","full_name":"Meyer, Maurice"},{"last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman"}],"date_updated":"2022-12-05T12:51:03Z","publication_status":"published","publisher":"Springer Science and Business Media LLC","_id":"34197","language":[{"iso":"eng"}],"doi":"10.1007/s13132-022-01081-z","user_id":"15782","publication":"Journal of the Knowledge Economy","citation":{"ama":"Panzner M, von Enzberg S, Meyer M, Dumitrescu R. Characterization of Usage Data with the Help of Data Classifications. <i>Journal of the Knowledge Economy</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>","bibtex":"@article{Panzner_von Enzberg_Meyer_Dumitrescu_2022, title={Characterization of Usage Data with the Help of Data Classifications}, DOI={<a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>}, journal={Journal of the Knowledge Economy}, publisher={Springer Science and Business Media LLC}, author={Panzner, Melina and von Enzberg, Sebastian and Meyer, Maurice and Dumitrescu, Roman}, year={2022} }","mla":"Panzner, Melina, et al. “Characterization of Usage Data with the Help of Data Classifications.” <i>Journal of the Knowledge Economy</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>.","short":"M. Panzner, S. von Enzberg, M. Meyer, R. Dumitrescu, Journal of the Knowledge Economy (2022).","chicago":"Panzner, Melina, Sebastian von Enzberg, Maurice Meyer, and Roman Dumitrescu. “Characterization of Usage Data with the Help of Data Classifications.” <i>Journal of the Knowledge Economy</i>, 2022. <a href=\"https://doi.org/10.1007/s13132-022-01081-z\">https://doi.org/10.1007/s13132-022-01081-z</a>.","apa":"Panzner, M., von Enzberg, S., Meyer, M., &#38; Dumitrescu, R. (2022). Characterization of Usage Data with the Help of Data Classifications. <i>Journal of the Knowledge Economy</i>. <a href=\"https://doi.org/10.1007/s13132-022-01081-z\">https://doi.org/10.1007/s13132-022-01081-z</a>","ieee":"M. Panzner, S. von Enzberg, M. Meyer, and R. Dumitrescu, “Characterization of Usage Data with the Help of Data Classifications,” <i>Journal of the Knowledge Economy</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s13132-022-01081-z\">10.1007/s13132-022-01081-z</a>."},"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Comprehensive data understanding is a key success driver for data analytics projects. Knowing the characteristics of the data helps a lot in selecting the appropriate data analysis techniques. Especially in data-driven product planning, knowledge about the data is a necessary prerequisite because data of the use phase is very heterogeneous. However, companies often do not have the necessary know-how or time to build up solid data understanding in connection with data analysis. In this paper, we develop a methodology to organize and categorize and thus understand use phase data in a way that makes it accessible to general data analytics workflows, following a design science research approach. We first present a knowledge base that lists typical use phase data from a product planning view. Second, we develop a taxonomy based on standard literature and real data objects, which covers the diversity of the data considered. The taxonomy provides 8 dimensions that support classification of use phase data and allows to capture data characteristics from a data analytics view. Finally, we combine both views by clustering the objects of the knowledge base according to the taxonomy. Each of the resulting clusters covers a typical combination of analytics relevant characteristics occurring in practice. By abstracting from the diversity of use phase data into artifacts with manageable complexity, our approach provides guidance to choose appropriate data analysis and AI techniques.</jats:p>","lang":"eng"}],"date_created":"2022-12-05T12:49:56Z","type":"journal_article","keyword":["Economics and Econometrics"],"department":[{"_id":"563"}]},{"publication":"Vibroengineering PROCEDIA","abstract":[{"text":"<jats:p>Mounting sensors in disk stack separators is often a major challenge due to the operating conditions. However, a process cannot be optimally monitored without sensors. Virtual sensors can be a solution to calculate the sought parameters from measurable values. We measured the vibrations of disk stack separators and applied machine learning (ML) to detect whether the separator contains only water or whether particles are also present. We combined seven ML classification algorithms with three feature engineering strategies and evaluated our model successfully on vibration data of an experimental disk stack separator. Our experimental results demonstrate that random forest in combination with manual feature engineering using domain specific knowledge about suitable features outperforms all other models with an accuracy of 91.27 %.</jats:p>","lang":"eng"}],"date_created":"2022-12-05T12:47:22Z","department":[{"_id":"563"}],"type":"journal_article","keyword":["General Medicine"],"author":[{"full_name":"Merkelbach, Silke","first_name":"Silke","last_name":"Merkelbach"},{"full_name":"Afroze, Lameya","first_name":"Lameya","last_name":"Afroze"},{"full_name":"Janssen, Nils","last_name":"Janssen","first_name":"Nils"},{"full_name":"von Enzberg, Sebastian","last_name":"von Enzberg","first_name":"Sebastian"},{"full_name":"Kühn, Arno","last_name":"Kühn","first_name":"Arno"},{"first_name":"Roman","last_name":"Dumitrescu","full_name":"Dumitrescu, Roman"}],"publication_identifier":{"issn":["2345-0533","2538-8479"]},"year":"2022","title":"Using vibration data to classify conditions in disk stack separators","intvolume":"        46","date_updated":"2022-12-05T12:51:08Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.21595/vp.2022.23000","citation":{"ama":"Merkelbach S, Afroze L, Janssen N, von Enzberg S, Kühn A, Dumitrescu R. Using vibration data to classify conditions in disk stack separators. <i>Vibroengineering PROCEDIA</i>. 2022;46:21-26. doi:<a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>","bibtex":"@article{Merkelbach_Afroze_Janssen_von Enzberg_Kühn_Dumitrescu_2022, title={Using vibration data to classify conditions in disk stack separators}, volume={46}, DOI={<a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>}, journal={Vibroengineering PROCEDIA}, publisher={JVE International Ltd.}, author={Merkelbach, Silke and Afroze, Lameya and Janssen, Nils and von Enzberg, Sebastian and Kühn, Arno and Dumitrescu, Roman}, year={2022}, pages={21–26} }","mla":"Merkelbach, Silke, et al. “Using Vibration Data to Classify Conditions in Disk Stack Separators.” <i>Vibroengineering PROCEDIA</i>, vol. 46, JVE International Ltd., 2022, pp. 21–26, doi:<a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>.","chicago":"Merkelbach, Silke, Lameya Afroze, Nils Janssen, Sebastian von Enzberg, Arno Kühn, and Roman Dumitrescu. “Using Vibration Data to Classify Conditions in Disk Stack Separators.” <i>Vibroengineering PROCEDIA</i> 46 (2022): 21–26. <a href=\"https://doi.org/10.21595/vp.2022.23000\">https://doi.org/10.21595/vp.2022.23000</a>.","short":"S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, R. Dumitrescu, Vibroengineering PROCEDIA 46 (2022) 21–26.","apa":"Merkelbach, S., Afroze, L., Janssen, N., von Enzberg, S., Kühn, A., &#38; Dumitrescu, R. (2022). Using vibration data to classify conditions in disk stack separators. <i>Vibroengineering PROCEDIA</i>, <i>46</i>, 21–26. <a href=\"https://doi.org/10.21595/vp.2022.23000\">https://doi.org/10.21595/vp.2022.23000</a>","ieee":"S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, and R. Dumitrescu, “Using vibration data to classify conditions in disk stack separators,” <i>Vibroengineering PROCEDIA</i>, vol. 46, pp. 21–26, 2022, doi: <a href=\"https://doi.org/10.21595/vp.2022.23000\">10.21595/vp.2022.23000</a>."},"status":"public","_id":"34196","publisher":"JVE International Ltd.","page":"21-26","volume":46,"user_id":"15782"},{"user_id":"15782","doi":"10.1007/978-3-658-38379-4_8","_id":"34195","publisher":"Springer Fachmedien Wiesbaden","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-12-05T12:51:11Z","title":"Soziotechnische Herausforderungen bei der Einführung von RPA managen","year":"2022","status":"public","publication_identifier":{"isbn":["9783658383787","9783658383794"]},"author":[{"full_name":"Hobscheidt, Daniela","first_name":"Daniela","last_name":"Hobscheidt"},{"full_name":"Menzefricke, Jörn Steffen","first_name":"Jörn Steffen","last_name":"Menzefricke"},{"full_name":"Gabriel, Stefan","first_name":"Stefan","last_name":"Gabriel"},{"full_name":"Kühn, Arno","first_name":"Arno","last_name":"Kühn"},{"last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman"}],"type":"book_chapter","department":[{"_id":"563"}],"date_created":"2022-12-05T12:46:56Z","place":"Wiesbaden","publication":"Praxishandbuch Robotic Process Automation (RPA)","citation":{"ieee":"D. Hobscheidt, J. S. Menzefricke, S. Gabriel, A. Kühn, and R. Dumitrescu, “Soziotechnische Herausforderungen bei der Einführung von RPA managen,” in <i>Praxishandbuch Robotic Process Automation (RPA)</i>, Wiesbaden: Springer Fachmedien Wiesbaden, 2022.","apa":"Hobscheidt, D., Menzefricke, J. S., Gabriel, S., Kühn, A., &#38; Dumitrescu, R. (2022). Soziotechnische Herausforderungen bei der Einführung von RPA managen. In <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Springer Fachmedien Wiesbaden. <a href=\"https://doi.org/10.1007/978-3-658-38379-4_8\">https://doi.org/10.1007/978-3-658-38379-4_8</a>","mla":"Hobscheidt, Daniela, et al. “Soziotechnische Herausforderungen Bei Der Einführung von RPA Managen.” <i>Praxishandbuch Robotic Process Automation (RPA)</i>, Springer Fachmedien Wiesbaden, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-658-38379-4_8\">10.1007/978-3-658-38379-4_8</a>.","bibtex":"@inbook{Hobscheidt_Menzefricke_Gabriel_Kühn_Dumitrescu_2022, place={Wiesbaden}, title={Soziotechnische Herausforderungen bei der Einführung von RPA managen}, DOI={<a href=\"https://doi.org/10.1007/978-3-658-38379-4_8\">10.1007/978-3-658-38379-4_8</a>}, booktitle={Praxishandbuch Robotic Process Automation (RPA)}, publisher={Springer Fachmedien Wiesbaden}, author={Hobscheidt, Daniela and Menzefricke, Jörn Steffen and Gabriel, Stefan and Kühn, Arno and Dumitrescu, Roman}, year={2022} }","chicago":"Hobscheidt, Daniela, Jörn Steffen Menzefricke, Stefan Gabriel, Arno Kühn, and Roman Dumitrescu. “Soziotechnische Herausforderungen Bei Der Einführung von RPA Managen.” In <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Wiesbaden: Springer Fachmedien Wiesbaden, 2022. <a href=\"https://doi.org/10.1007/978-3-658-38379-4_8\">https://doi.org/10.1007/978-3-658-38379-4_8</a>.","short":"D. Hobscheidt, J.S. Menzefricke, S. Gabriel, A. Kühn, R. Dumitrescu, in: Praxishandbuch Robotic Process Automation (RPA), Springer Fachmedien Wiesbaden, Wiesbaden, 2022.","ama":"Hobscheidt D, Menzefricke JS, Gabriel S, Kühn A, Dumitrescu R. Soziotechnische Herausforderungen bei der Einführung von RPA managen. In: <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Springer Fachmedien Wiesbaden; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-658-38379-4_8\">10.1007/978-3-658-38379-4_8</a>"}},{"date_created":"2022-12-05T12:45:43Z","place":"Berlin, Heidelberg","department":[{"_id":"563"}],"type":"book_chapter","citation":{"chicago":"Bansmann, Michael, Roman Dumitrescu, and Christian Fechtelpeter. “Transfer von Arbeit 4.0-Anwendungsszenarien.” In <i>Gestaltung Digitalisierter Arbeitswelten</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. <a href=\"https://doi.org/10.1007/978-3-662-58014-1_3\">https://doi.org/10.1007/978-3-662-58014-1_3</a>.","short":"M. Bansmann, R. Dumitrescu, C. Fechtelpeter, in: Gestaltung Digitalisierter Arbeitswelten, Springer Berlin Heidelberg, Berlin, Heidelberg, 2022.","ieee":"M. Bansmann, R. Dumitrescu, and C. Fechtelpeter, “Transfer von Arbeit 4.0-Anwendungsszenarien,” in <i>Gestaltung digitalisierter Arbeitswelten</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2022.","apa":"Bansmann, M., Dumitrescu, R., &#38; Fechtelpeter, C. (2022). Transfer von Arbeit 4.0-Anwendungsszenarien. In <i>Gestaltung digitalisierter Arbeitswelten</i>. Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-58014-1_3\">https://doi.org/10.1007/978-3-662-58014-1_3</a>","bibtex":"@inbook{Bansmann_Dumitrescu_Fechtelpeter_2022, place={Berlin, Heidelberg}, title={Transfer von Arbeit 4.0-Anwendungsszenarien}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-58014-1_3\">10.1007/978-3-662-58014-1_3</a>}, booktitle={Gestaltung digitalisierter Arbeitswelten}, publisher={Springer Berlin Heidelberg}, author={Bansmann, Michael and Dumitrescu, Roman and Fechtelpeter, Christian}, year={2022} }","ama":"Bansmann M, Dumitrescu R, Fechtelpeter C. Transfer von Arbeit 4.0-Anwendungsszenarien. In: <i>Gestaltung Digitalisierter Arbeitswelten</i>. Springer Berlin Heidelberg; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-662-58014-1_3\">10.1007/978-3-662-58014-1_3</a>","mla":"Bansmann, Michael, et al. “Transfer von Arbeit 4.0-Anwendungsszenarien.” <i>Gestaltung Digitalisierter Arbeitswelten</i>, Springer Berlin Heidelberg, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-662-58014-1_3\">10.1007/978-3-662-58014-1_3</a>."},"publication":"Gestaltung digitalisierter Arbeitswelten","_id":"34193","language":[{"iso":"eng"}],"publisher":"Springer Berlin Heidelberg","user_id":"15782","doi":"10.1007/978-3-662-58014-1_3","publication_identifier":{"issn":["2523-3637","2523-3645"],"isbn":["9783662580134","9783662580141"]},"author":[{"full_name":"Bansmann, Michael","last_name":"Bansmann","first_name":"Michael"},{"full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu"},{"full_name":"Fechtelpeter, Christian","last_name":"Fechtelpeter","first_name":"Christian"}],"status":"public","year":"2022","title":"Transfer von Arbeit 4.0-Anwendungsszenarien","publication_status":"published","date_updated":"2022-12-05T12:51:19Z"},{"publication_status":"published","date_updated":"2022-12-05T12:51:14Z","publication_identifier":{"isbn":["9783658383787","9783658383794"]},"author":[{"full_name":"Brock, Jonathan","last_name":"Brock","first_name":"Jonathan"},{"first_name":"Sebastian","last_name":"von Enzberg","full_name":"von Enzberg, Sebastian"},{"first_name":"Arno","last_name":"Kühn","full_name":"Kühn, Arno"},{"full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman"}],"year":"2022","status":"public","title":"Nutzung von Process Mining in RPA-Projekten","user_id":"15782","doi":"10.1007/978-3-658-38379-4_5","publisher":"Springer Fachmedien Wiesbaden","_id":"34194","language":[{"iso":"eng"}],"citation":{"mla":"Brock, Jonathan, et al. “Nutzung von Process Mining in RPA-Projekten.” <i>Praxishandbuch Robotic Process Automation (RPA)</i>, Springer Fachmedien Wiesbaden, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-658-38379-4_5\">10.1007/978-3-658-38379-4_5</a>.","bibtex":"@inbook{Brock_von Enzberg_Kühn_Dumitrescu_2022, place={Wiesbaden}, title={Nutzung von Process Mining in RPA-Projekten}, DOI={<a href=\"https://doi.org/10.1007/978-3-658-38379-4_5\">10.1007/978-3-658-38379-4_5</a>}, booktitle={Praxishandbuch Robotic Process Automation (RPA)}, publisher={Springer Fachmedien Wiesbaden}, author={Brock, Jonathan and von Enzberg, Sebastian and Kühn, Arno and Dumitrescu, Roman}, year={2022} }","ama":"Brock J, von Enzberg S, Kühn A, Dumitrescu R. Nutzung von Process Mining in RPA-Projekten. In: <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Springer Fachmedien Wiesbaden; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-658-38379-4_5\">10.1007/978-3-658-38379-4_5</a>","ieee":"J. Brock, S. von Enzberg, A. Kühn, and R. Dumitrescu, “Nutzung von Process Mining in RPA-Projekten,” in <i>Praxishandbuch Robotic Process Automation (RPA)</i>, Wiesbaden: Springer Fachmedien Wiesbaden, 2022.","apa":"Brock, J., von Enzberg, S., Kühn, A., &#38; Dumitrescu, R. (2022). Nutzung von Process Mining in RPA-Projekten. In <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Springer Fachmedien Wiesbaden. <a href=\"https://doi.org/10.1007/978-3-658-38379-4_5\">https://doi.org/10.1007/978-3-658-38379-4_5</a>","chicago":"Brock, Jonathan, Sebastian von Enzberg, Arno Kühn, and Roman Dumitrescu. “Nutzung von Process Mining in RPA-Projekten.” In <i>Praxishandbuch Robotic Process Automation (RPA)</i>. Wiesbaden: Springer Fachmedien Wiesbaden, 2022. <a href=\"https://doi.org/10.1007/978-3-658-38379-4_5\">https://doi.org/10.1007/978-3-658-38379-4_5</a>.","short":"J. Brock, S. von Enzberg, A. Kühn, R. Dumitrescu, in: Praxishandbuch Robotic Process Automation (RPA), Springer Fachmedien Wiesbaden, Wiesbaden, 2022."},"publication":"Praxishandbuch Robotic Process Automation (RPA)","department":[{"_id":"563"}],"type":"book_chapter","date_created":"2022-12-05T12:46:26Z","place":"Wiesbaden"},{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-031-21388-5_16","author":[{"id":"11308","full_name":"Wolters, Dennis","first_name":"Dennis","last_name":"Wolters"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"publication_identifier":{"isbn":["9783031213878","9783031213885"],"issn":["0302-9743","1611-3349"]},"title":"Towards Situational Process Management for Professional Education Programmes","year":"2022","intvolume":"     13709","date_updated":"2022-12-17T19:00:40Z","publication_status":"published","date_created":"2022-12-08T19:23:46Z","department":[{"_id":"66"}],"type":"book_chapter","publication":"Product-Focused Software Process Improvement","publisher":"Springer International Publishing","_id":"34292","page":"235-242","editor":[{"first_name":"Davide","last_name":"Taibi","full_name":"Taibi, Davide"},{"full_name":"Kuhrmann, Marco","last_name":"Kuhrmann","first_name":"Marco"},{"full_name":"Mikkonen, Tommi","last_name":"Mikkonen","first_name":"Tommi"},{"first_name":"Jil","last_name":"Klünder","full_name":"Klünder, Jil"},{"full_name":"Abrahamsson, Pekka","last_name":"Abrahamsson","first_name":"Pekka"}],"volume":13709,"user_id":"11308","status":"public","place":"Cham","citation":{"mla":"Wolters, Dennis, and Gregor Engels. “Towards Situational Process Management for Professional Education Programmes.” <i>Product-Focused Software Process Improvement</i>, edited by Davide Taibi et al., vol. 13709, Springer International Publishing, 2022, pp. 235–42, doi:<a href=\"https://doi.org/10.1007/978-3-031-21388-5_16\">10.1007/978-3-031-21388-5_16</a>.","bibtex":"@inbook{Wolters_Engels_2022, place={Cham}, series={Lecture Notes in Computer Science}, title={Towards Situational Process Management for Professional Education Programmes}, volume={13709}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-21388-5_16\">10.1007/978-3-031-21388-5_16</a>}, booktitle={Product-Focused Software Process Improvement}, publisher={Springer International Publishing}, author={Wolters, Dennis and Engels, Gregor}, editor={Taibi, Davide and Kuhrmann, Marco and Mikkonen, Tommi and Klünder, Jil and Abrahamsson, Pekka}, year={2022}, pages={235–242}, collection={Lecture Notes in Computer Science} }","ama":"Wolters D, Engels G. Towards Situational Process Management for Professional Education Programmes. In: Taibi D, Kuhrmann M, Mikkonen T, Klünder J, Abrahamsson P, eds. <i>Product-Focused Software Process Improvement</i>. Vol 13709. Lecture Notes in Computer Science. Springer International Publishing; 2022:235-242. doi:<a href=\"https://doi.org/10.1007/978-3-031-21388-5_16\">10.1007/978-3-031-21388-5_16</a>","ieee":"D. Wolters and G. Engels, “Towards Situational Process Management for Professional Education Programmes,” in <i>Product-Focused Software Process Improvement</i>, vol. 13709, D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder, and P. Abrahamsson, Eds. Cham: Springer International Publishing, 2022, pp. 235–242.","apa":"Wolters, D., &#38; Engels, G. (2022). Towards Situational Process Management for Professional Education Programmes. In D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder, &#38; P. Abrahamsson (Eds.), <i>Product-Focused Software Process Improvement</i> (Vol. 13709, pp. 235–242). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-21388-5_16\">https://doi.org/10.1007/978-3-031-21388-5_16</a>","short":"D. Wolters, G. Engels, in: D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder, P. Abrahamsson (Eds.), Product-Focused Software Process Improvement, Springer International Publishing, Cham, 2022, pp. 235–242.","chicago":"Wolters, Dennis, and Gregor Engels. “Towards Situational Process Management for Professional Education Programmes.” In <i>Product-Focused Software Process Improvement</i>, edited by Davide Taibi, Marco Kuhrmann, Tommi Mikkonen, Jil Klünder, and Pekka Abrahamsson, 13709:235–42. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-21388-5_16\">https://doi.org/10.1007/978-3-031-21388-5_16</a>."}},{"file":[{"access_level":"open_access","file_size":528653,"file_name":"author_version.pdf","date_updated":"2022-01-11T08:39:57Z","relation":"main_file","content_type":"application/pdf","file_id":"29222","creator":"stschn","date_created":"2022-01-11T08:39:57Z"}],"date_created":"2022-01-11T08:43:26Z","type":"conference","keyword":["network management","service management","AI","Monte Carlo Tree Search","model-based","QoS"],"department":[{"_id":"75"}],"publication":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","abstract":[{"text":"Modern services often comprise several components, such as chained virtual network functions, microservices, or\r\nmachine learning functions. Providing such services requires to decide how often to instantiate each component, where to place these instances in the network, how to chain them and route traffic through them. \r\nTo overcome limitations of conventional, hardwired heuristics, deep reinforcement learning (DRL) approaches for self-learning network and service management have emerged recently. These model-free DRL approaches are more flexible but typically learn tabula rasa, i.e., disregard existing understanding of networks, services, and their coordination. \r\n\r\nInstead, we propose FutureCoord, a novel model-based AI approach that leverages existing understanding of networks and services for more efficient and effective coordination without time-intensive training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic model. This allows FutureCoord to estimate the impact of future incoming traffic and effectively optimize long-term effects, taking fluctuating demand and Quality of Service (QoS) requirements into account. Our extensive evaluation based on real-world network topologies, services, and traffic traces indicates that FutureCoord clearly outperforms state-of-the-art model-free and model-based approaches with up to 51% higher flow success ratios.","lang":"eng"}],"language":[{"iso":"eng"}],"title":"Use What You Know: Network and Service Coordination Beyond Certainty","year":"2022","author":[{"last_name":"Werner","first_name":"Stefan","full_name":"Werner, Stefan"},{"id":"35343","full_name":"Schneider, Stefan Balthasar","last_name":"Schneider","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011"},{"id":"126","full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"date_updated":"2022-01-11T08:44:04Z","oa":"1","file_date_updated":"2022-01-11T08:39:57Z","citation":{"chicago":"Werner, Stefan, Stefan Balthasar Schneider, and Holger Karl. “Use What You Know: Network and Service Coordination Beyond Certainty.” In <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE, 2022.","short":"S. Werner, S.B. Schneider, H. Karl, in: IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2022.","apa":"Werner, S., Schneider, S. B., &#38; Karl, H. (2022). Use What You Know: Network and Service Coordination Beyond Certainty. <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest.","ieee":"S. Werner, S. B. Schneider, and H. Karl, “Use What You Know: Network and Service Coordination Beyond Certainty,” presented at the IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest, 2022.","ama":"Werner S, Schneider SB, Karl H. Use What You Know: Network and Service Coordination Beyond Certainty. In: <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE; 2022.","bibtex":"@inproceedings{Werner_Schneider_Karl_2022, title={Use What You Know: Network and Service Coordination Beyond Certainty}, booktitle={IEEE/IFIP Network Operations and Management Symposium (NOMS)}, publisher={IEEE}, author={Werner, Stefan and Schneider, Stefan Balthasar and Karl, Holger}, year={2022} }","mla":"Werner, Stefan, et al. “Use What You Know: Network and Service Coordination Beyond Certainty.” <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>, IEEE, 2022."},"quality_controlled":"1","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"publisher":"IEEE","_id":"29220","ddc":["004"],"user_id":"35343","status":"public","conference":{"location":"Budapest","start_date":"2022-04-25","name":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","end_date":"2022-04-29"},"has_accepted_license":"1"},{"publication_identifier":{"issn":["0040-1625"]},"author":[{"orcid":"https://orcid.org/0000-0001-7992-6399","first_name":"Christian","last_name":"Koldewey","full_name":"Koldewey, Christian","id":"43136"},{"last_name":"Rasor","first_name":"Anja","full_name":"Rasor, Anja","id":"34415"},{"full_name":"Reinhold, Jannik","last_name":"Reinhold","first_name":"Jannik","id":"33669"},{"id":"163","full_name":"Gausemeier, Jürgen","last_name":"Gausemeier","first_name":"Jürgen"},{"id":"16190","last_name":"Dumitrescu","first_name":"Roman","full_name":"Dumitrescu, Roman"},{"full_name":"Chohan, Nadia","first_name":"Nadia","last_name":"Chohan"},{"last_name":"Frank","first_name":"Maximilian","full_name":"Frank, Maximilian","id":"38255"}],"status":"public","title":"Aligning strategic position, behavior, and structure for smart service businesses in manufacturing","year":"2022","date_updated":"2022-01-25T08:52:39Z","publication_status":"published","_id":"27776","publisher":"Elsevier","language":[{"iso":"eng"}],"article_number":"121329","doi":"10.1016/j.techfore.2021.121329","user_id":"15782","citation":{"mla":"Koldewey, Christian, et al. “Aligning Strategic Position, Behavior, and Structure for Smart Service Businesses in Manufacturing.” <i>Technological Forecasting and Social Change</i>, 121329, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.techfore.2021.121329\">10.1016/j.techfore.2021.121329</a>.","ama":"Koldewey C, Rasor A, Reinhold J, et al. Aligning strategic position, behavior, and structure for smart service businesses in manufacturing. <i>Technological Forecasting and Social Change</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.techfore.2021.121329\">10.1016/j.techfore.2021.121329</a>","bibtex":"@article{Koldewey_Rasor_Reinhold_Gausemeier_Dumitrescu_Chohan_Frank_2022, title={Aligning strategic position, behavior, and structure for smart service businesses in manufacturing}, DOI={<a href=\"https://doi.org/10.1016/j.techfore.2021.121329\">10.1016/j.techfore.2021.121329</a>}, number={121329}, journal={Technological Forecasting and Social Change}, publisher={Elsevier}, author={Koldewey, Christian and Rasor, Anja and Reinhold, Jannik and Gausemeier, Jürgen and Dumitrescu, Roman and Chohan, Nadia and Frank, Maximilian}, year={2022} }","apa":"Koldewey, C., Rasor, A., Reinhold, J., Gausemeier, J., Dumitrescu, R., Chohan, N., &#38; Frank, M. (2022). Aligning strategic position, behavior, and structure for smart service businesses in manufacturing. <i>Technological Forecasting and Social Change</i>, Article 121329. <a href=\"https://doi.org/10.1016/j.techfore.2021.121329\">https://doi.org/10.1016/j.techfore.2021.121329</a>","ieee":"C. Koldewey <i>et al.</i>, “Aligning strategic position, behavior, and structure for smart service businesses in manufacturing,” <i>Technological Forecasting and Social Change</i>, Art. no. 121329, 2022, doi: <a href=\"https://doi.org/10.1016/j.techfore.2021.121329\">10.1016/j.techfore.2021.121329</a>.","short":"C. Koldewey, A. Rasor, J. Reinhold, J. Gausemeier, R. Dumitrescu, N. Chohan, M. Frank, Technological Forecasting and Social Change (2022).","chicago":"Koldewey, Christian, Anja Rasor, Jannik Reinhold, Jürgen Gausemeier, Roman Dumitrescu, Nadia Chohan, and Maximilian Frank. “Aligning Strategic Position, Behavior, and Structure for Smart Service Businesses in Manufacturing.” <i>Technological Forecasting and Social Change</i>, 2022. <a href=\"https://doi.org/10.1016/j.techfore.2021.121329\">https://doi.org/10.1016/j.techfore.2021.121329</a>."},"publication":"Technological Forecasting and Social Change","date_created":"2021-11-24T09:52:18Z","department":[{"_id":"563"}],"type":"journal_article"},{"author":[{"id":"60323","first_name":"Christian","last_name":"Lienen","full_name":"Lienen, Christian"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"year":"2022","status":"public","title":"ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications","date_updated":"2022-01-28T08:30:16Z","language":[{"iso":"eng"}],"_id":"29541","main_file_link":[{"url":"https://arxiv.org/abs/2201.07454"}],"user_id":"60323","citation":{"mla":"Lienen, Christian, and Marco Platzner. <i>ReconROS Executor: Event-Driven Programming of FPGA-Accelerated ROS 2 Applications</i>. 2022.","bibtex":"@article{Lienen_Platzner_2022, title={ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications}, author={Lienen, Christian and Platzner, Marco}, year={2022} }","ama":"Lienen C, Platzner M. ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications. Published online 2022.","ieee":"C. Lienen and M. Platzner, “ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications.” 2022.","apa":"Lienen, C., &#38; Platzner, M. (2022). <i>ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications</i>.","chicago":"Lienen, Christian, and Marco Platzner. “ReconROS Executor: Event-Driven Programming of FPGA-Accelerated ROS 2 Applications,” 2022.","short":"C. Lienen, M. Platzner, (2022)."},"date_created":"2022-01-26T08:52:20Z","department":[{"_id":"78"}],"type":"preprint"},{"doi":"10.25926/rdtq-jw45","main_file_link":[{"url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"date_updated":"2022-02-07T13:32:28Z","publication_status":"published","title":"More Efficient Techniques for Adaptively-Secure Cryptography","year":"2022","author":[{"last_name":"Niehues","first_name":"David","full_name":"Niehues, David","id":"36113"}],"keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"type":"dissertation","department":[{"_id":"558"}],"file":[{"file_id":"29764","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2022-02-07T13:26:05Z","file_name":"de2107.pdf","file_size":1542089,"access_level":"closed","date_created":"2022-02-07T13:26:05Z","creator":"davnie"}],"date_created":"2022-02-07T13:29:07Z","abstract":[{"text":"Modern-day communication has become more and more digital. While this comes with many advantages such as a more efficient economy, it has also created more and more opportunities for various adversaries to manipulate communication or eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness of these threats. To protect the communication of people, companies, and states from such threats, we require cryptography with strong security guarantees.\r\nDifferent applications may require different security properties from cryptographic schemes. For most applications, however, so-called adaptive security is considered a reasonable minimal requirement of security. Cryptographic schemes with adaptive security remain secure in the presence of an adversary that can corrupt communication partners to respond to messages of the adversaries choice, while the adversary may choose the messages based on previously observed interactions.\r\nWhile cryptography is associated the most with encryption, this is only one of many primitives that are essential for the security of digital interactions. This thesis presents novel identity-based encryption (IBE) schemes and verifiable random functions (VRFs) that achieve adaptive security as outlined above. Moreover, the cryptographic schemes presented in this thesis are proven secure in the standard model. That is without making use of idealized models like the random oracle model.","lang":"eng"}],"license":"https://creativecommons.org/licenses/by-nd/4.0/","ddc":["000"],"user_id":"36113","_id":"29763","has_accepted_license":"1","status":"public","oa":"1","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"file_date_updated":"2022-02-07T13:26:05Z","supervisor":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"full_name":"Lehmann, Anja","first_name":"Anja","last_name":"Lehmann"}],"citation":{"mla":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022, doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>.","ama":"Niehues D. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>.; 2022. doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>","bibtex":"@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure Cryptography}, DOI={<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>}, author={Niehues, David}, year={2022} }","apa":"Niehues, D. (2022). <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>","ieee":"D. Niehues, <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022.","chicago":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>, 2022. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>.","short":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography, 2022."}},{"_id":"31068","language":[{"iso":"eng"}],"user_id":"82920","author":[{"full_name":"Chen, Mei-Hua","last_name":"Chen","first_name":"Mei-Hua"},{"first_name":"Garima","last_name":"Mudgal","full_name":"Mudgal, Garima"},{"id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","last_name":"Chen"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning","id":"3900"}],"status":"public","title":"Investigating the argumentation structures of EFL learners from diverse language backgrounds","year":"2022","date_updated":"2022-05-09T14:58:39Z","date_created":"2022-05-05T07:50:21Z","department":[{"_id":"600"}],"type":"conference_abstract","citation":{"apa":"Chen, M.-H., Mudgal, G., Chen, W.-F., &#38; Wachsmuth, H. (2022). Investigating the argumentation structures of EFL learners from diverse language backgrounds. <i>EUROCALL</i>.","mla":"Chen, Mei-Hua, et al. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” <i>EUROCALL</i>, 2022.","ieee":"M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation structures of EFL learners from diverse language backgrounds,” 2022.","short":"M.-H. Chen, G. Mudgal, W.-F. Chen, H. Wachsmuth, in: EUROCALL, 2022.","ama":"Chen M-H, Mudgal G, Chen W-F, Wachsmuth H. Investigating the argumentation structures of EFL learners from diverse language backgrounds. In: <i>EUROCALL</i>. ; 2022.","chicago":"Chen, Mei-Hua, Garima Mudgal, Wei-Fan Chen, and Henning Wachsmuth. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” In <i>EUROCALL</i>, 2022.","bibtex":"@inproceedings{Chen_Mudgal_Chen_Wachsmuth_2022, title={Investigating the argumentation structures of EFL learners from diverse language backgrounds}, booktitle={EUROCALL}, author={Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning}, year={2022} }"},"publication":"EUROCALL","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}]},{"publication_status":"published","date_updated":"2022-05-27T10:14:27Z","publication_identifier":{"issn":["0178-4617","1432-0541"]},"author":[{"full_name":"Baswana, Surender","last_name":"Baswana","first_name":"Surender"},{"full_name":"Gupta, Shiv","first_name":"Shiv","last_name":"Gupta"},{"full_name":"Knollmann, Till","last_name":"Knollmann","first_name":"Till","orcid":"0000-0003-2014-4696","id":"39241"}],"title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","year":"2022","status":"public","user_id":"39241","doi":"10.1007/s00453-022-00978-0","_id":"31479","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"genbank":["tillk"],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"citation":{"ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>","bibtex":"@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, DOI={<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, 2022. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>.","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>","ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” <i>Algorithmica</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>."},"publication":"Algorithmica","department":[{"_id":"63"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","date_created":"2022-05-27T10:09:24Z"},{"status":"public","title":"Detecting Data Incompatibilities in Process-Driven Decision Support Systems","year":"2022","author":[{"id":"39928","last_name":"Kirchhoff","first_name":"Jonas","full_name":"Kirchhoff, Jonas"},{"full_name":"Gottschalk, Sebastian","last_name":"Gottschalk","first_name":"Sebastian","id":"47208"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"publication_identifier":{"isbn":["9783031115097","9783031115103"],"issn":["1865-1348","1865-1356"]},"publication_status":"published","date_updated":"2022-08-10T13:21:34Z","_id":"32792","publisher":"Springer International Publishing","language":[{"iso":"eng"}],"user_id":"39928","doi":"10.1007/978-3-031-11510-3_6","publication":"Lecture Notes in Business Information Processing","citation":{"mla":"Kirchhoff, Jonas, et al. “Detecting Data Incompatibilities in Process-Driven Decision Support Systems.” <i>Lecture Notes in Business Information Processing</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-031-11510-3_6\">10.1007/978-3-031-11510-3_6</a>.","bibtex":"@inbook{Kirchhoff_Gottschalk_Engels_2022, place={Cham}, title={Detecting Data Incompatibilities in Process-Driven Decision Support Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-11510-3_6\">10.1007/978-3-031-11510-3_6</a>}, booktitle={Lecture Notes in Business Information Processing}, publisher={Springer International Publishing}, author={Kirchhoff, Jonas and Gottschalk, Sebastian and Engels, Gregor}, year={2022} }","ama":"Kirchhoff J, Gottschalk S, Engels G. Detecting Data Incompatibilities in Process-Driven Decision Support Systems. In: <i>Lecture Notes in Business Information Processing</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-031-11510-3_6\">10.1007/978-3-031-11510-3_6</a>","ieee":"J. Kirchhoff, S. Gottschalk, and G. Engels, “Detecting Data Incompatibilities in Process-Driven Decision Support Systems,” in <i>Lecture Notes in Business Information Processing</i>, Cham: Springer International Publishing, 2022.","apa":"Kirchhoff, J., Gottschalk, S., &#38; Engels, G. (2022). Detecting Data Incompatibilities in Process-Driven Decision Support Systems. In <i>Lecture Notes in Business Information Processing</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-11510-3_6\">https://doi.org/10.1007/978-3-031-11510-3_6</a>","short":"J. Kirchhoff, S. Gottschalk, G. Engels, in: Lecture Notes in Business Information Processing, Springer International Publishing, Cham, 2022.","chicago":"Kirchhoff, Jonas, Sebastian Gottschalk, and Gregor Engels. “Detecting Data Incompatibilities in Process-Driven Decision Support Systems.” In <i>Lecture Notes in Business Information Processing</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-11510-3_6\">https://doi.org/10.1007/978-3-031-11510-3_6</a>."},"abstract":[{"text":"Decision makers in complex business environments have different goals and constraints and therefore require tailored decision support systems (DSS). Following a low-code approach, a tailored DSS can be created by a decision maker as a process-based composition of existing, interoperable decision support services. Data incompatibilities may be introduced during the design or execution of such a process-driven DSS, e.g., when a service always generates or a decision maker selects data which violates a data constraint of a subsequent service. These incompatibilities cause interrupted or erroneous decision processes. In this paper, we contribute an approach which enables the detection of data incompatibilities in process-driven DSS during process design and execution. Our approach utilizes the JSON Schema specification to define service interfaces and associated type constraints which data produced by services or decision makers can be validated against. We demonstrate our approach in the context of decision support for energy network planning using a prototypical open-source implementation.","lang":"eng"}],"date_created":"2022-08-10T13:18:30Z","place":"Cham","type":"book_chapter","department":[{"_id":"534"},{"_id":"66"}]},{"has_accepted_license":"1","date_updated":"2022-08-20T07:02:04Z","author":[{"full_name":"Fehring, Lukas","first_name":"Lukas","last_name":"Fehring","id":"75695"}],"status":"public","title":"Combined Ranking and Regression Trees for Algorithm Selection","year":"2022","ddc":["006"],"user_id":"38209","_id":"33033","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"citation":{"ama":"Fehring L. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>.; 2022.","bibtex":"@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }","mla":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. 2022.","short":"L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection, Paderborn, 2022.","chicago":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. Paderborn, 2022.","apa":"Fehring, L. (2022). <i>Combined Ranking and Regression Trees for Algorithm Selection</i>.","ieee":"L. Fehring, <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. Paderborn, 2022."},"file_date_updated":"2022-08-19T09:39:57Z","oa":"1","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"type":"bachelorsthesis","place":"Paderborn","date_created":"2022-08-19T09:41:14Z","file":[{"date_created":"2022-08-19T09:39:57Z","creator":"ahetzer","content_type":"application/pdf","file_id":"33034","date_updated":"2022-08-19T09:39:57Z","relation":"main_file","file_size":24830795,"access_level":"open_access","file_name":"Final Bachelor Thesis.pdf"}]},{"status":"public","year":"2022","title":"Machine Learning for Online Algorithm Selection under Censored Feedback","author":[{"id":"38209","first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander"},{"id":"76599","full_name":"Bengs, Viktor","last_name":"Bengs","first_name":"Viktor"},{"id":"48129","full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier"}],"date_updated":"2022-08-24T12:44:27Z","_id":"30867","language":[{"iso":"eng"}],"publisher":"AAAI","user_id":"38209","publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","citation":{"ieee":"A. Tornede, V. Bengs, and E. Hüllermeier, “Machine Learning for Online Algorithm Selection under Censored Feedback,” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI, 2022.","apa":"Tornede, A., Bengs, V., &#38; Hüllermeier, E. (2022). Machine Learning for Online Algorithm Selection under Censored Feedback. In <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI.","short":"A. Tornede, V. Bengs, E. Hüllermeier, Proceedings of the 36th AAAI Conference on Artificial Intelligence (2022).","chicago":"Tornede, Alexander, Viktor Bengs, and Eyke Hüllermeier. “Machine Learning for Online Algorithm Selection under Censored Feedback.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI, 2022.","mla":"Tornede, Alexander, et al. “Machine Learning for Online Algorithm Selection under Censored Feedback.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>, AAAI, 2022.","bibtex":"@article{Tornede_Bengs_Hüllermeier_2022, title={Machine Learning for Online Algorithm Selection under Censored Feedback}, journal={Proceedings of the 36th AAAI Conference on Artificial Intelligence}, publisher={AAAI}, author={Tornede, Alexander and Bengs, Viktor and Hüllermeier, Eyke}, year={2022} }","ama":"Tornede A, Bengs V, Hüllermeier E. Machine Learning for Online Algorithm Selection under Censored Feedback. <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. Published online 2022."},"abstract":[{"text":"In online algorithm selection (OAS), instances of an algorithmic problem\r\nclass are presented to an agent one after another, and the agent has to quickly\r\nselect a presumably best algorithm from a fixed set of candidate algorithms.\r\nFor decision problems such as satisfiability (SAT), quality typically refers to\r\nthe algorithm's runtime. As the latter is known to exhibit a heavy-tail\r\ndistribution, an algorithm is normally stopped when exceeding a predefined\r\nupper time limit. As a consequence, machine learning methods used to optimize\r\nan algorithm selection strategy in a data-driven manner need to deal with\r\nright-censored samples, a problem that has received little attention in the\r\nliterature so far. In this work, we revisit multi-armed bandit algorithms for\r\nOAS and discuss their capability of dealing with the problem. Moreover, we\r\nadapt them towards runtime-oriented losses, allowing for partially censored\r\ndata while keeping a space- and time-complexity independent of the time\r\nhorizon. In an extensive experimental evaluation on an adapted version of the\r\nASlib benchmark, we demonstrate that theoretically well-founded methods based\r\non Thompson sampling perform specifically strong and improve in comparison to\r\nexisting methods.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"external_id":{"arxiv":["2109.06234"]},"date_created":"2022-04-12T11:58:56Z","type":"preprint","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}]},{"date_updated":"2022-08-24T12:45:39Z","author":[{"id":"38209","first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander"},{"full_name":"Gehring, Lukas","first_name":"Lukas","last_name":"Gehring"},{"last_name":"Tornede","first_name":"Tanja","full_name":"Tornede, Tanja","id":"40795"},{"id":"33176","last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"title":"Algorithm Selection on a Meta Level","status":"public","year":"2022","user_id":"38209","_id":"30865","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"abstract":[{"lang":"eng","text":"The problem of selecting an algorithm that appears most suitable for a\r\nspecific instance of an algorithmic problem class, such as the Boolean\r\nsatisfiability problem, is called instance-specific algorithm selection. Over\r\nthe past decade, the problem has received considerable attention, resulting in\r\na number of different methods for algorithm selection. Although most of these\r\nmethods are based on machine learning, surprisingly little work has been done\r\non meta learning, that is, on taking advantage of the complementarity of\r\nexisting algorithm selection methods in order to combine them into a single\r\nsuperior algorithm selector. In this paper, we introduce the problem of meta\r\nalgorithm selection, which essentially asks for the best way to combine a given\r\nset of algorithm selectors. We present a general methodological framework for\r\nmeta algorithm selection as well as several concrete learning methods as\r\ninstantiations of this framework, essentially combining ideas of meta learning\r\nand ensemble learning. In an extensive experimental evaluation, we demonstrate\r\nthat ensembles of algorithm selectors can significantly outperform single\r\nalgorithm selectors and have the potential to form the new state of the art in\r\nalgorithm selection."}],"citation":{"mla":"Tornede, Alexander, et al. “Algorithm Selection on a Meta Level.” <i>Machine Learning</i>, 2022.","bibtex":"@article{Tornede_Gehring_Tornede_Wever_Hüllermeier_2022, title={Algorithm Selection on a Meta Level}, journal={Machine Learning}, author={Tornede, Alexander and Gehring, Lukas and Tornede, Tanja and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2022} }","ama":"Tornede A, Gehring L, Tornede T, Wever MD, Hüllermeier E. Algorithm Selection on a Meta Level. <i>Machine Learning</i>. Published online 2022.","ieee":"A. Tornede, L. Gehring, T. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection on a Meta Level,” <i>Machine Learning</i>. 2022.","apa":"Tornede, A., Gehring, L., Tornede, T., Wever, M. D., &#38; Hüllermeier, E. (2022). Algorithm Selection on a Meta Level. In <i>Machine Learning</i>.","short":"A. Tornede, L. Gehring, T. Tornede, M.D. Wever, E. Hüllermeier, Machine Learning (2022).","chicago":"Tornede, Alexander, Lukas Gehring, Tanja Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection on a Meta Level.” <i>Machine Learning</i>, 2022."},"publication":"Machine Learning","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"type":"preprint","date_created":"2022-04-12T11:55:18Z","external_id":{"arxiv":["2107.09414"]}}]