[{"file":[{"file_size":895091,"access_level":"open_access","file_name":"B2-Chapter-SFB-Buch-Final.pdf","file_id":"45885","date_updated":"2023-07-07T11:20:11Z","date_created":"2023-07-07T07:50:34Z","creator":"florida","relation":"main_file","content_type":"application/pdf"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","ddc":["040"],"language":[{"iso":"eng"}],"year":"2023","title":"Configuration and Evaluation","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T07:50:53Z","editor":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","last_name":"Haake"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"status":"public","type":"book_chapter","file_date_updated":"2023-07-07T11:20:11Z","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","_id":"10"}],"_id":"45884","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","department":[{"_id":"7"}],"place":"Paderborn","citation":{"ieee":"J. M. Hanselle <i>et al.</i>, “Configuration and Evaluation,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104.","chicago":"Hanselle, Jonas Manuel, Eyke Hüllermeier, Felix Mohr, Axel-Cyrille Ngonga Ngomo, Mohamed Sherif, Alexander Tornede, and Marcel Dominik Wever. “Configuration and Evaluation.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:85–104. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068466\">https://doi.org/10.5281/zenodo.8068466</a>.","ama":"Hanselle JM, Hüllermeier E, Mohr F, et al. Configuration and Evaluation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:85-104. doi:<a href=\"https://doi.org/10.5281/zenodo.8068466\">10.5281/zenodo.8068466</a>","short":"J.M. Hanselle, E. Hüllermeier, F. Mohr, A.-C. Ngonga Ngomo, M. Sherif, A. Tornede, M.D. Wever, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 85–104.","bibtex":"@inbook{Hanselle_Hüllermeier_Mohr_Ngonga Ngomo_Sherif_Tornede_Wever_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Configuration and Evaluation}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068466\">10.5281/zenodo.8068466</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Hanselle, Jonas Manuel and Hüllermeier, Eyke and Mohr, Felix and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Tornede, Alexander and Wever, Marcel Dominik}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={85–104}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Hanselle, Jonas Manuel, et al. “Configuration and Evaluation.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104, doi:<a href=\"https://doi.org/10.5281/zenodo.8068466\">10.5281/zenodo.8068466</a>.","apa":"Hanselle, J. M., Hüllermeier, E., Mohr, F., Ngonga Ngomo, A.-C., Sherif, M., Tornede, A., &#38; Wever, M. D. (2023). Configuration and Evaluation. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 85–104). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068466\">https://doi.org/10.5281/zenodo.8068466</a>"},"intvolume":"       412","page":"85-104","has_accepted_license":"1","doi":"10.5281/zenodo.8068466","oa":"1","date_updated":"2023-07-07T11:20:12Z","author":[{"id":"43980","full_name":"Hanselle, Jonas Manuel","last_name":"Hanselle","orcid":"0000-0002-1231-4985","first_name":"Jonas Manuel"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"},{"first_name":"Mohamed","orcid":"https://orcid.org/0000-0002-9927-2203","last_name":"Sherif","full_name":"Sherif, Mohamed","id":"67234"},{"first_name":"Alexander","id":"38209","full_name":"Tornede, Alexander","last_name":"Tornede"},{"first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176","full_name":"Wever, Marcel Dominik"}],"volume":412},{"file_date_updated":"2023-07-07T11:23:07Z","user_id":"477","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","department":[{"_id":"7"},{"_id":"19"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"grant_number":"160364472","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","_id":"7"}],"_id":"45878","status":"public","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"type":"book_chapter","doi":"10.5281/zenodo.8068414","author":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"},{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"},{"first_name":"Gleb","id":"83983","full_name":"Polevoy, Gleb","last_name":"Polevoy"}],"volume":412,"date_updated":"2023-07-07T11:23:08Z","oa":"1","citation":{"apa":"Haake, C.-J., Hehenkamp, B., &#38; Polevoy, G. (2023). The Market for Services: Incentives, Algorithms, Implementation. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 21–44). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068414\">https://doi.org/10.5281/zenodo.8068414</a>","short":"C.-J. Haake, B. Hehenkamp, G. Polevoy, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 21–44.","mla":"Haake, Claus-Jochen, et al. “The Market for Services: Incentives, Algorithms, Implementation.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 21–44, doi:<a href=\"https://doi.org/10.5281/zenodo.8068414\">10.5281/zenodo.8068414</a>.","bibtex":"@inbook{Haake_Hehenkamp_Polevoy_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={The Market for Services: Incentives, Algorithms, Implementation}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068414\">10.5281/zenodo.8068414</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Hehenkamp, Burkhard and Polevoy, Gleb}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={21–44}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","chicago":"Haake, Claus-Jochen, Burkhard Hehenkamp, and Gleb Polevoy. “The Market for Services: Incentives, Algorithms, Implementation.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:21–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068414\">https://doi.org/10.5281/zenodo.8068414</a>.","ieee":"C.-J. Haake, B. Hehenkamp, and G. Polevoy, “The Market for Services: Incentives, Algorithms, Implementation,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 21–44.","ama":"Haake C-J, Hehenkamp B, Polevoy G. The Market for Services: Incentives, Algorithms, Implementation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:21-44. doi:<a href=\"https://doi.org/10.5281/zenodo.8068414\">10.5281/zenodo.8068414</a>"},"intvolume":"       412","page":"21-44","place":"Paderborn","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["004"],"file":[{"date_updated":"2023-07-07T11:23:07Z","date_created":"2023-07-07T06:59:23Z","creator":"florida","file_size":1116173,"file_name":"A3-Chapter-SFB-Buch-Final.pdf","file_id":"45879","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","title":"The Market for Services: Incentives, Algorithms, Implementation","date_created":"2023-07-07T07:02:44Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","year":"2023"},{"_id":"45886","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"department":[{"_id":"7"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","file_date_updated":"2023-07-07T11:19:40Z","type":"book_chapter","editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"status":"public","date_updated":"2023-07-07T11:19:40Z","oa":"1","volume":412,"author":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"},{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"first_name":"Matthias","full_name":"Becker, Matthias","last_name":"Becker"},{"last_name":"Richter","id":"50003","full_name":"Richter, Cedric","first_name":"Cedric"},{"id":"67200","full_name":"Sharma, Arnab","last_name":"Sharma","first_name":"Arnab"}],"doi":"10.5281/zenodo.8068510","has_accepted_license":"1","place":"Paderborn","intvolume":"       412","page":"105-123","citation":{"apa":"Wehrheim, H., Hüllermeier, E., Becker, S., Becker, M., Richter, C., &#38; Sharma, A. (2023). Composition Analysis in Unknown Contexts. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 105–123). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068510\">https://doi.org/10.5281/zenodo.8068510</a>","bibtex":"@inbook{Wehrheim_Hüllermeier_Becker_Becker_Richter_Sharma_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Composition Analysis in Unknown Contexts}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike and Hüllermeier, Eyke and Becker, Steffen and Becker, Matthias and Richter, Cedric and Sharma, Arnab}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={105–123}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, A. Sharma, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 105–123.","mla":"Wehrheim, Heike, et al. “Composition Analysis in Unknown Contexts.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–23, doi:<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>.","ama":"Wehrheim H, Hüllermeier E, Becker S, Becker M, Richter C, Sharma A. Composition Analysis in Unknown Contexts. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:105-123. doi:<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>","chicago":"Wehrheim, Heike, Eyke Hüllermeier, Steffen Becker, Matthias Becker, Cedric Richter, and Arnab Sharma. “Composition Analysis in Unknown Contexts.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:105–23. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068510\">https://doi.org/10.5281/zenodo.8068510</a>.","ieee":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, and A. Sharma, “Composition Analysis in Unknown Contexts,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–123."},"ddc":["004"],"language":[{"iso":"eng"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"file_size":370888,"file_name":"B3-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_id":"45887","date_updated":"2023-07-07T11:19:40Z","creator":"florida","date_created":"2023-07-07T07:55:57Z","relation":"main_file","content_type":"application/pdf"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T07:56:08Z","title":"Composition Analysis in Unknown Contexts","year":"2023"},{"department":[{"_id":"78"}],"user_id":"398","_id":"45917","project":[{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"grant_number":"160364472","_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","supervisor":[{"full_name":"Platzner, Marco ","last_name":"Platzner","first_name":"Marco "}],"author":[{"last_name":"Raeisi Nafchi","full_name":"Raeisi Nafchi, Masood","first_name":"Masood"}],"date_created":"2023-07-09T13:01:10Z","date_updated":"2023-07-09T13:07:25Z","publisher":"Paderborn University","title":"Reconfigurable Random Forest Implementation on FPGA","citation":{"short":"M. Raeisi Nafchi, Reconfigurable Random Forest Implementation on FPGA, Paderborn University, 2023.","mla":"Raeisi Nafchi, Masood. <i>Reconfigurable Random Forest Implementation on FPGA</i>. Paderborn University, 2023.","bibtex":"@book{Raeisi Nafchi_2023, title={Reconfigurable Random Forest Implementation on FPGA}, publisher={Paderborn University}, author={Raeisi Nafchi, Masood}, year={2023} }","apa":"Raeisi Nafchi, M. (2023). <i>Reconfigurable Random Forest Implementation on FPGA</i>. Paderborn University.","ama":"Raeisi Nafchi M. <i>Reconfigurable Random Forest Implementation on FPGA</i>. Paderborn University; 2023.","ieee":"M. Raeisi Nafchi, <i>Reconfigurable Random Forest Implementation on FPGA</i>. Paderborn University, 2023.","chicago":"Raeisi Nafchi, Masood. <i>Reconfigurable Random Forest Implementation on FPGA</i>. Paderborn University, 2023."},"year":"2023"},{"user_id":"398","department":[{"_id":"78"}],"project":[{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"}],"_id":"45916","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","date_created":"2023-07-09T12:59:28Z","author":[{"first_name":"Nihal","full_name":"Yadalam Murali Kumar, Nihal","last_name":"Yadalam Murali Kumar"}],"date_updated":"2023-07-09T13:06:37Z","publisher":"Paderborn University","title":"Data Analytics for Predictive Maintenance of Time Series Data","citation":{"ama":"Yadalam Murali Kumar N. <i>Data Analytics for Predictive Maintenance of Time Series Data</i>. Paderborn University; 2023.","chicago":"Yadalam Murali Kumar, Nihal. <i>Data Analytics for Predictive Maintenance of Time Series Data</i>. Paderborn University, 2023.","ieee":"N. Yadalam Murali Kumar, <i>Data Analytics for Predictive Maintenance of Time Series Data</i>. Paderborn University, 2023.","apa":"Yadalam Murali Kumar, N. (2023). <i>Data Analytics for Predictive Maintenance of Time Series Data</i>. Paderborn University.","mla":"Yadalam Murali Kumar, Nihal. <i>Data Analytics for Predictive Maintenance of Time Series Data</i>. Paderborn University, 2023.","short":"N. Yadalam Murali Kumar, Data Analytics for Predictive Maintenance of Time Series Data, Paderborn University, 2023.","bibtex":"@book{Yadalam Murali Kumar_2023, title={Data Analytics for Predictive Maintenance of Time Series Data}, publisher={Paderborn University}, author={Yadalam Murali Kumar, Nihal}, year={2023} }"},"year":"2023"},{"abstract":[{"text":"Variational Quantum Algorithms (VQAs), such as the Quantum Approximate\r\nOptimization Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen\r\nintense study towards near-term applications on quantum hardware. A crucial\r\nparameter for VQAs is the depth of the variational ansatz used - the smaller\r\nthe depth, the more amenable the ansatz is to near-term quantum hardware in\r\nthat it gives the circuit a chance to be fully executed before the system\r\ndecoheres. This potential for depth reduction has made VQAs a staple of Noisy\r\nIntermediate-Scale Quantum (NISQ)-era research.\r\n  In this work, we show that approximating the optimal depth for a given VQA\r\nansatz is intractable. Formally, we show that for any constant $\\epsilon>0$, it\r\nis QCMA-hard to approximate the optimal depth of a VQA ansatz within\r\nmultiplicative factor $N^{1-\\epsilon}$, for $N$ denoting the encoding size of\r\nthe VQA instance. (Here, Quantum Classical Merlin-Arthur (QCMA) is a quantum\r\ngeneralization of NP.) We then show that this hardness persists even in the\r\n\"simpler\" setting of QAOAs. To our knowledge, this yields the first natural\r\nQCMA-hard-to-approximate problems. To achieve these results, we bypass the need\r\nfor a PCP theorem for QCMA by appealing to the disperser-based NP-hardness of\r\napproximation construction of [Umans, FOCS 1999].","lang":"eng"}],"publication":"Proceedings of the 38th Computational Complexity Conference (CCC)","language":[{"iso":"eng"}],"external_id":{"arxiv":["2211.12519"]},"year":"2023","issue":"34","title":"The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate","date_created":"2022-11-24T08:07:56Z","status":"public","type":"conference","department":[{"_id":"623"},{"_id":"7"}],"user_id":"71541","series_title":"Leibniz International Proceedings in Informatics (LIPIcs)","_id":"34138","intvolume":"       264","page":"34:1-34:24","citation":{"short":"L. Bittel, S. Gharibian, M. Kliesch, in: Proceedings of the 38th Computational Complexity Conference (CCC), 2023, p. 34:1-34:24.","mla":"Bittel, Lennart, et al. “The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate.” <i>Proceedings of the 38th Computational Complexity Conference (CCC)</i>, vol. 264, no. 34, 2023, p. 34:1-34:24, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CCC.2023.34\">10.4230/LIPIcs.CCC.2023.34</a>.","bibtex":"@inproceedings{Bittel_Gharibian_Kliesch_2023, series={Leibniz International Proceedings in Informatics (LIPIcs)}, title={The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate}, volume={264}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.CCC.2023.34\">10.4230/LIPIcs.CCC.2023.34</a>}, number={34}, booktitle={Proceedings of the 38th Computational Complexity Conference (CCC)}, author={Bittel, Lennart and Gharibian, Sevag and Kliesch, Martin}, year={2023}, pages={34:1-34:24}, collection={Leibniz International Proceedings in Informatics (LIPIcs)} }","apa":"Bittel, L., Gharibian, S., &#38; Kliesch, M. (2023). The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. <i>Proceedings of the 38th Computational Complexity Conference (CCC)</i>, <i>264</i>(34), 34:1-34:24. <a href=\"https://doi.org/10.4230/LIPIcs.CCC.2023.34\">https://doi.org/10.4230/LIPIcs.CCC.2023.34</a>","ama":"Bittel L, Gharibian S, Kliesch M. The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. In: <i>Proceedings of the 38th Computational Complexity Conference (CCC)</i>. Vol 264. Leibniz International Proceedings in Informatics (LIPIcs). ; 2023:34:1-34:24. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CCC.2023.34\">10.4230/LIPIcs.CCC.2023.34</a>","ieee":"L. Bittel, S. Gharibian, and M. Kliesch, “The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate,” in <i>Proceedings of the 38th Computational Complexity Conference (CCC)</i>, 2023, vol. 264, no. 34, p. 34:1-34:24, doi: <a href=\"https://doi.org/10.4230/LIPIcs.CCC.2023.34\">10.4230/LIPIcs.CCC.2023.34</a>.","chicago":"Bittel, Lennart, Sevag Gharibian, and Martin Kliesch. “The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate.” In <i>Proceedings of the 38th Computational Complexity Conference (CCC)</i>, 264:34:1-34:24. Leibniz International Proceedings in Informatics (LIPIcs), 2023. <a href=\"https://doi.org/10.4230/LIPIcs.CCC.2023.34\">https://doi.org/10.4230/LIPIcs.CCC.2023.34</a>."},"publication_status":"published","doi":"10.4230/LIPIcs.CCC.2023.34","volume":264,"author":[{"last_name":"Bittel","full_name":"Bittel, Lennart","first_name":"Lennart"},{"id":"71541","full_name":"Gharibian, Sevag","orcid":"0000-0002-9992-3379","last_name":"Gharibian","first_name":"Sevag"},{"full_name":"Kliesch, Martin","last_name":"Kliesch","first_name":"Martin"}],"date_updated":"2023-07-10T14:33:00Z"},{"year":"2023","citation":{"apa":"Pukrop, S. (2023). <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">https://doi.org/10.17619/UNIPB/1-1768 </a>","short":"S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling, 2023.","bibtex":"@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>}, author={Pukrop, Simon}, year={2023} }","mla":"Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>.","ama":"Pukrop S. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">10.17619/UNIPB/1-1768 </a>","ieee":"S. Pukrop, <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>. 2023.","chicago":"Pukrop, Simon. <i>On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1768 \">https://doi.org/10.17619/UNIPB/1-1768 </a>."},"date_updated":"2023-07-14T09:27:44Z","author":[{"full_name":"Pukrop, Simon","id":"44428","last_name":"Pukrop","first_name":"Simon"}],"date_created":"2023-06-27T05:24:19Z","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling","doi":"10.17619/UNIPB/1-1768 ","type":"dissertation","status":"public","_id":"45781","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","grant_number":"160364472"}],"department":[{"_id":"63"}],"user_id":"15504","language":[{"iso":"eng"}]},{"title":"Utilizing Redundancy in Distributed Heterogeneous Storage","date_created":"2023-07-13T12:46:28Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"author":[{"first_name":"Fabian","last_name":"Schneider","full_name":"Schneider, Fabian"}],"date_updated":"2023-07-17T07:05:22Z","citation":{"ieee":"F. Schneider, <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","chicago":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>, 2023.","ama":"Schneider F. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.; 2023.","apa":"Schneider, F. (2023). <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>.","mla":"Schneider, Fabian. <i>Utilizing Redundancy in Distributed Heterogeneous Storage</i>. 2023.","bibtex":"@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous Storage}, author={Schneider, Fabian}, year={2023} }","short":"F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage, 2023."},"year":"2023","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2023-07-17T07:05:05Z","ddc":["004"],"department":[{"_id":"79"}],"user_id":"15504","_id":"46053","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"status":"public","file":[{"date_created":"2023-07-17T07:05:05Z","creator":"florida","date_updated":"2023-07-17T07:05:05Z","access_level":"closed","file_id":"46071","file_name":"BA-Schneider.pdf","file_size":1977565,"content_type":"application/pdf","relation":"main_file","success":1}],"type":"bachelorsthesis"},{"title":"Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption","date_created":"2023-07-19T06:09:17Z","supervisor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"author":[{"first_name":"Amruta","last_name":"Ranade","full_name":"Ranade, Amruta"}],"date_updated":"2023-07-19T06:09:36Z","citation":{"apa":"Ranade, A. (2023). <i>Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption</i>.","mla":"Ranade, Amruta. <i>Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption</i>. 2023.","short":"A. Ranade, Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption, 2023.","bibtex":"@book{Ranade_2023, title={Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption}, author={Ranade, Amruta}, year={2023} }","chicago":"Ranade, Amruta. <i>Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption</i>, 2023.","ieee":"A. Ranade, <i>Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption</i>. 2023.","ama":"Ranade A. <i>Graph Neural Network-Based Anomaly Detection in  Smart Grid Energy Consumption</i>.; 2023."},"year":"2023","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"46087","status":"public","type":"mastersthesis"},{"year":"2023","citation":{"short":"O. Ali, Highly Accurate Deep Compressed Facial Recognition, 2023.","bibtex":"@book{Ali_2023, title={Highly accurate deep compressed facial recognition}, author={Ali, Osama}, year={2023} }","mla":"Ali, Osama. <i>Highly Accurate Deep Compressed Facial Recognition</i>. 2023.","apa":"Ali, O. (2023). <i>Highly accurate deep compressed facial recognition</i>.","ieee":"O. Ali, <i>Highly accurate deep compressed facial recognition</i>. 2023.","chicago":"Ali, Osama. <i>Highly Accurate Deep Compressed Facial Recognition</i>, 2023.","ama":"Ali O. <i>Highly Accurate Deep Compressed Facial Recognition</i>.; 2023."},"title":"Highly accurate deep compressed facial recognition","date_updated":"2023-07-19T06:09:31Z","date_created":"2023-07-19T06:08:13Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"Osama","full_name":"Ali, Osama","last_name":"Ali"}],"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"46086","user_id":"15504","department":[{"_id":"79"}]},{"type":"mastersthesis","status":"public","_id":"46110","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"grant_number":"160364472","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5"}],"department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}],"year":"2023","citation":{"ieee":"N. Ashri, <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>. 2023.","chicago":"Ashri, Nivedita. <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>, 2023.","ama":"Ashri N. <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>.; 2023.","apa":"Ashri, N. (2023). <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>.","mla":"Ashri, Nivedita. <i>Virtual On-Demand Volunteer System Based on Delaunay Triangulation</i>. 2023.","short":"N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.","bibtex":"@book{Ashri_2023, title={Virtual On-Demand Volunteer System Based on Delaunay Triangulation}, author={Ashri, Nivedita}, year={2023} }"},"date_updated":"2023-07-21T08:53:13Z","supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2023-07-21T08:52:38Z","author":[{"full_name":"Ashri, Nivedita","last_name":"Ashri","first_name":"Nivedita"}],"title":"Virtual On-Demand Volunteer System Based on Delaunay Triangulation"},{"publisher":"Association for Computing Machinery (ACM)","date_updated":"2023-07-28T08:02:05Z","oa":"1","author":[{"last_name":"Meyer","full_name":"Meyer, Marius","id":"40778","first_name":"Marius"},{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"date_created":"2023-01-23T08:40:42Z","title":"Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks","main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/3576200","open_access":"1"}],"doi":"10.1145/3576200","publication_status":"published","quality_controlled":"1","publication_identifier":{"issn":["1936-7406","1936-7414"]},"year":"2023","citation":{"short":"M. Meyer, T. Kenter, C. Plessl, ACM Transactions on Reconfigurable Technology and Systems (2023).","mla":"Meyer, Marius, et al. “Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks.” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, Association for Computing Machinery (ACM), 2023, doi:<a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>.","bibtex":"@article{Meyer_Kenter_Plessl_2023, title={Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks}, DOI={<a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>}, journal={ACM Transactions on Reconfigurable Technology and Systems}, publisher={Association for Computing Machinery (ACM)}, author={Meyer, Marius and Kenter, Tobias and Plessl, Christian}, year={2023} }","apa":"Meyer, M., Kenter, T., &#38; Plessl, C. (2023). Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks. <i>ACM Transactions on Reconfigurable Technology and Systems</i>. <a href=\"https://doi.org/10.1145/3576200\">https://doi.org/10.1145/3576200</a>","ama":"Meyer M, Kenter T, Plessl C. Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks. <i>ACM Transactions on Reconfigurable Technology and Systems</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>","ieee":"M. Meyer, T. Kenter, and C. Plessl, “Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks,” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, 2023, doi: <a href=\"https://doi.org/10.1145/3576200\">10.1145/3576200</a>.","chicago":"Meyer, Marius, Tobias Kenter, and Christian Plessl. “Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks.” <i>ACM Transactions on Reconfigurable Technology and Systems</i>, 2023. <a href=\"https://doi.org/10.1145/3576200\">https://doi.org/10.1145/3576200</a>."},"project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"grant_number":"160364472","name":"SFB 901: SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - Subproject C2","grant_number":"160364472"}],"_id":"38041","user_id":"24135","department":[{"_id":"27"},{"_id":"518"}],"keyword":["General Computer Science"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"ACM Transactions on Reconfigurable Technology and Systems","abstract":[{"text":"<jats:p>While FPGA accelerator boards and their respective high-level design tools are maturing, there is still a lack of multi-FPGA applications, libraries, and not least, benchmarks and reference implementations towards sustained HPC usage of these devices. As in the early days of GPUs in HPC, for workloads that can reasonably be decoupled into loosely coupled working sets, multi-accelerator support can be achieved by using standard communication interfaces like MPI on the host side. However, for performance and productivity, some applications can profit from a tighter coupling of the accelerators. FPGAs offer unique opportunities here when extending the dataflow characteristics to their communication interfaces.</jats:p>\r\n          <jats:p>In this work, we extend the HPCC FPGA benchmark suite by multi-FPGA support and three missing benchmarks that particularly characterize or stress inter-device communication: b_eff, PTRANS, and LINPACK. With all benchmarks implemented for current boards with Intel and Xilinx FPGAs, we established a baseline for multi-FPGA performance. Additionally, for the communication-centric benchmarks, we explored the potential of direct FPGA-to-FPGA communication with a circuit-switched inter-FPGA network that is currently only available for one of the boards. The evaluation with parallel execution on up to 26 FPGA boards makes use of one of the largest academic FPGA installations.</jats:p>","lang":"eng"}],"status":"public"},{"year":"2023","citation":{"apa":"N., N. (2023). <i>Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks</i>.","mla":"N., N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks</i>. 2023.","bibtex":"@book{N._2023, title={Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks}, author={N., N.}, year={2023} }","short":"N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023.","chicago":"N., N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks</i>, 2023.","ieee":"N. N., <i>Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks</i>. 2023.","ama":"N. N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks</i>.; 2023."},"title":"Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks","date_updated":"2023-07-31T10:49:30Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"date_created":"2023-07-31T10:49:12Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"46221","user_id":"15504","department":[{"_id":"79"}]},{"user_id":"43817","department":[{"_id":"574"}],"project":[{"grant_number":"101070305","name":"ENEXA: Efficient Explainable Learning on Knowledge Graphs","_id":"407"},{"_id":"410","name":"KnowGraphs: KnowGraphs: Knowledge Graphs at Scale"},{"grant_number":"NW21-059D","_id":"285","name":"SAIL: SAIL: SustAInable Life-cycle of Intelligent Socio-Technical Systems"}],"_id":"46251","language":[{"iso":"eng"}],"file_date_updated":"2023-08-01T09:30:35Z","ddc":["000"],"type":"journal_article","publication":"International Joint Conference on Artificial Intelligence","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2023-08-01T09:30:35Z","date_created":"2023-08-01T09:30:35Z","creator":"cdemir","file_size":340865,"file_id":"46252","access_level":"open_access","file_name":"public.pdf"}],"status":"public","date_created":"2023-08-01T09:30:37Z","author":[{"first_name":"Caglar","full_name":"Demir, Caglar","id":"43817","last_name":"Demir"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"oa":"1","date_updated":"2023-08-01T09:44:30Z","conference":{"name":"International Joint Conference on Artificial Intelligence IJCAI 2023","location":"Macau"},"title":"Neuro-Symbolic Class Expression Learning","has_accepted_license":"1","citation":{"short":"C. Demir, A.-C. Ngonga Ngomo, International Joint Conference on Artificial Intelligence (2023).","mla":"Demir, Caglar, and Axel-Cyrille Ngonga Ngomo. “Neuro-Symbolic Class Expression Learning.” <i>International Joint Conference on Artificial Intelligence</i>, 2023.","bibtex":"@article{Demir_Ngonga Ngomo_2023, title={Neuro-Symbolic Class Expression Learning}, journal={International Joint Conference on Artificial Intelligence}, author={Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2023} }","apa":"Demir, C., &#38; Ngonga Ngomo, A.-C. (2023). Neuro-Symbolic Class Expression Learning. <i>International Joint Conference on Artificial Intelligence</i>. International Joint Conference on Artificial Intelligence IJCAI 2023, Macau.","chicago":"Demir, Caglar, and Axel-Cyrille Ngonga Ngomo. “Neuro-Symbolic Class Expression Learning.” <i>International Joint Conference on Artificial Intelligence</i>, 2023.","ieee":"C. Demir and A.-C. Ngonga Ngomo, “Neuro-Symbolic Class Expression Learning,” <i>International Joint Conference on Artificial Intelligence</i>, 2023.","ama":"Demir C, Ngonga Ngomo A-C. Neuro-Symbolic Class Expression Learning. <i>International Joint Conference on Artificial Intelligence</i>. Published online 2023."},"year":"2023"},{"year":"2023","citation":{"apa":"Wu, X., Kenter, T., Schade, R., Kühne, T., &#38; Plessl, C. (2023). Computing and Compressing Electron Repulsion Integrals on FPGAs. <i>2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)</i>, 162–173. <a href=\"https://doi.org/10.1109/FCCM57271.2023.00026\">https://doi.org/10.1109/FCCM57271.2023.00026</a>","ama":"Wu X, Kenter T, Schade R, Kühne T, Plessl C. Computing and Compressing Electron Repulsion Integrals on FPGAs. In: <i>2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)</i>. ; 2023:162-173. doi:<a href=\"https://doi.org/10.1109/FCCM57271.2023.00026\">10.1109/FCCM57271.2023.00026</a>","short":"X. Wu, T. Kenter, R. Schade, T. Kühne, C. Plessl, in: 2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM), 2023, pp. 162–173.","mla":"Wu, Xin, et al. “Computing and Compressing Electron Repulsion Integrals on FPGAs.” <i>2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)</i>, 2023, pp. 162–73, doi:<a href=\"https://doi.org/10.1109/FCCM57271.2023.00026\">10.1109/FCCM57271.2023.00026</a>.","bibtex":"@inproceedings{Wu_Kenter_Schade_Kühne_Plessl_2023, title={Computing and Compressing Electron Repulsion Integrals on FPGAs}, DOI={<a href=\"https://doi.org/10.1109/FCCM57271.2023.00026\">10.1109/FCCM57271.2023.00026</a>}, booktitle={2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)}, author={Wu, Xin and Kenter, Tobias and Schade, Robert and Kühne, Thomas and Plessl, Christian}, year={2023}, pages={162–173} }","chicago":"Wu, Xin, Tobias Kenter, Robert Schade, Thomas Kühne, and Christian Plessl. “Computing and Compressing Electron Repulsion Integrals on FPGAs.” In <i>2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)</i>, 162–73, 2023. <a href=\"https://doi.org/10.1109/FCCM57271.2023.00026\">https://doi.org/10.1109/FCCM57271.2023.00026</a>.","ieee":"X. Wu, T. Kenter, R. Schade, T. Kühne, and C. Plessl, “Computing and Compressing Electron Repulsion Integrals on FPGAs,” in <i>2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)</i>, 2023, pp. 162–173, doi: <a href=\"https://doi.org/10.1109/FCCM57271.2023.00026\">10.1109/FCCM57271.2023.00026</a>."},"page":"162-173","quality_controlled":"1","title":"Computing and Compressing Electron Repulsion Integrals on FPGAs","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/10171537"}],"doi":"10.1109/FCCM57271.2023.00026","date_updated":"2023-08-02T15:05:42Z","date_created":"2023-03-30T11:15:40Z","author":[{"full_name":"Wu, Xin","id":"77439","last_name":"Wu","first_name":"Xin"},{"last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145","first_name":"Tobias"},{"orcid":"0000-0002-6268-539","last_name":"Schade","id":"75963","full_name":"Schade, Robert","first_name":"Robert"},{"first_name":"Thomas","last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"}],"abstract":[{"lang":"eng","text":"The computation of electron repulsion integrals (ERIs) over Gaussian-type orbitals (GTOs) is a challenging problem in quantum-mechanics-based atomistic simulations. In practical simulations, several trillions of ERIs may have to be\r\ncomputed for every time step.\r\nIn this work, we investigate FPGAs as accelerators for the ERI computation. We use template parameters, here within the Intel oneAPI tool flow, to create customized designs for 256 different ERI quartet classes, based on their orbitals. To maximize data reuse, all intermediates are buffered in FPGA on-chip memory with customized layout. The pre-calculation of intermediates also helps to overcome data dependencies caused by multi-dimensional recurrence\r\nrelations. The involved loop structures are partially or even fully unrolled for high throughput of FPGA kernels. Furthermore, a lossy compression algorithm utilizing arbitrary bitwidth integers is integrated in the FPGA kernels. To our\r\nbest knowledge, this is the first work on ERI computation on FPGAs that supports more than just the single most basic quartet class. Also, the integration of ERI computation and compression it a novelty that is not even covered by CPU or GPU libraries so far.\r\nOur evaluation shows that using 16-bit integer for the ERI compression, the fastest FPGA kernels exceed the performance of 10 GERIS ($10 \\times 10^9$ ERIs per second) on one Intel Stratix 10 GX 2800 FPGA, with maximum absolute errors around $10^{-7}$ - $10^{-5}$ Hartree. The measured throughput can be accurately explained by a performance model. The FPGA kernels deployed on 2 FPGAs outperform similar computations using the widely used libint reference on a two-socket server with 40 Xeon Gold 6148 CPU cores of the same process technology by factors up to 6.0x and on a new two-socket server with 128 EPYC 7713 CPU cores by up to 1.9x."}],"status":"public","type":"conference","publication":"2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)","language":[{"iso":"eng"}],"project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"_id":"43228","external_id":{"arxiv":["2303.13632"]},"user_id":"75963","department":[{"_id":"27"},{"_id":"518"}]},{"abstract":[{"text":"<jats:p> The non-orthogonal local submatrix method applied to electronic structure–based molecular dynamics simulations is shown to exceed 1.1 EFLOP/s in FP16/FP32-mixed floating-point arithmetic when using 4400 NVIDIA A100 GPUs of the Perlmutter system. This is enabled by a modification of the original method that pushes the sustained fraction of the peak performance to about 80%. Example calculations are performed for SARS-CoV-2 spike proteins with up to 83 million atoms. </jats:p>","lang":"eng"}],"publication":"The International Journal of High Performance Computing Applications","keyword":["Hardware and Architecture","Theoretical Computer Science","Software"],"language":[{"iso":"eng"}],"year":"2023","quality_controlled":"1","title":"Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics","publisher":"SAGE Publications","date_created":"2023-05-30T09:19:09Z","status":"public","type":"journal_article","article_number":"109434202311776","article_type":"original","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"45361","user_id":"75963","department":[{"_id":"27"},{"_id":"518"}],"citation":{"ieee":"R. Schade, T. Kenter, H. Elgabarty, M. Lass, T. Kühne, and C. Plessl, “Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics,” <i>The International Journal of High Performance Computing Applications</i>, Art. no. 109434202311776, 2023, doi: <a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>.","chicago":"Schade, Robert, Tobias Kenter, Hossam Elgabarty, Michael Lass, Thomas Kühne, and Christian Plessl. “Breaking the Exascale Barrier for the Electronic Structure Problem in Ab-Initio Molecular Dynamics.” <i>The International Journal of High Performance Computing Applications</i>, 2023. <a href=\"https://doi.org/10.1177/10943420231177631\">https://doi.org/10.1177/10943420231177631</a>.","mla":"Schade, Robert, et al. “Breaking the Exascale Barrier for the Electronic Structure Problem in Ab-Initio Molecular Dynamics.” <i>The International Journal of High Performance Computing Applications</i>, 109434202311776, SAGE Publications, 2023, doi:<a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>.","short":"R. Schade, T. Kenter, H. Elgabarty, M. Lass, T. Kühne, C. Plessl, The International Journal of High Performance Computing Applications (2023).","bibtex":"@article{Schade_Kenter_Elgabarty_Lass_Kühne_Plessl_2023, title={Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics}, DOI={<a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>}, number={109434202311776}, journal={The International Journal of High Performance Computing Applications}, publisher={SAGE Publications}, author={Schade, Robert and Kenter, Tobias and Elgabarty, Hossam and Lass, Michael and Kühne, Thomas and Plessl, Christian}, year={2023} }","ama":"Schade R, Kenter T, Elgabarty H, Lass M, Kühne T, Plessl C. Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics. <i>The International Journal of High Performance Computing Applications</i>. Published online 2023. doi:<a href=\"https://doi.org/10.1177/10943420231177631\">10.1177/10943420231177631</a>","apa":"Schade, R., Kenter, T., Elgabarty, H., Lass, M., Kühne, T., &#38; Plessl, C. (2023). Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics. <i>The International Journal of High Performance Computing Applications</i>, Article 109434202311776. <a href=\"https://doi.org/10.1177/10943420231177631\">https://doi.org/10.1177/10943420231177631</a>"},"publication_status":"published","publication_identifier":{"issn":["1094-3420","1741-2846"]},"main_file_link":[{"url":"https://journals.sagepub.com/doi/10.1177/10943420231177631","open_access":"1"}],"doi":"10.1177/10943420231177631","date_updated":"2023-08-02T15:04:53Z","oa":"1","author":[{"first_name":"Robert","last_name":"Schade","orcid":"0000-0002-6268-539","id":"75963","full_name":"Schade, Robert"},{"last_name":"Kenter","id":"3145","full_name":"Kenter, Tobias","first_name":"Tobias"},{"first_name":"Hossam","orcid":"0000-0002-4945-1481","last_name":"Elgabarty","id":"60250","full_name":"Elgabarty, Hossam"},{"full_name":"Lass, Michael","id":"24135","orcid":"0000-0002-5708-7632","last_name":"Lass","first_name":"Michael"},{"last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas","first_name":"Thomas"},{"id":"16153","full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}]},{"type":"dissertation","status":"public","file":[{"access_level":"open_access","file_id":"46118","file_name":"dissertation_alexander_tornede_final_publishing_compressed.pdf","file_size":4300633,"title":" Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions","date_created":"2023-07-24T08:40:35Z","creator":"ahetzer","date_updated":"2023-07-24T08:42:01Z","relation":"main_file","content_type":"application/pdf"}],"department":[{"_id":"355"}],"user_id":"15504","_id":"45780","project":[{"_id":"10","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"}],"language":[{"iso":"eng"}],"file_date_updated":"2023-07-24T08:42:01Z","ddc":["006"],"has_accepted_license":"1","citation":{"chicago":"Tornede, Alexander. <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">https://doi.org/10.17619/UNIPB/1-1780 </a>.","ieee":"A. Tornede, <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>. 2023.","ama":"Tornede A. <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>.; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">10.17619/UNIPB/1-1780 </a>","apa":"Tornede, A. (2023). <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">https://doi.org/10.17619/UNIPB/1-1780 </a>","mla":"Tornede, Alexander. <i>Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions</i>. 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">10.17619/UNIPB/1-1780 </a>.","short":"A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions, 2023.","bibtex":"@book{Tornede_2023, title={Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1780 \">10.17619/UNIPB/1-1780 </a>}, author={Tornede, Alexander}, year={2023} }"},"year":"2023","supervisor":[{"full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"author":[{"first_name":"Alexander","id":"38209","full_name":"Tornede, Alexander","last_name":"Tornede"}],"date_created":"2023-06-27T05:20:14Z","date_updated":"2023-08-04T06:01:49Z","oa":"1","doi":"10.17619/UNIPB/1-1780 ","title":"Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions"},{"citation":{"ieee":"S. Peitz, H. Harder, F. Nüske, F. Philipp, M. Schaller, and K. Worthmann, “Partial observations, coarse graining and equivariance in Koopman  operator theory for large-scale dynamical systems,” <i>arXiv:2307.15325</i>. 2023.","chicago":"Peitz, Sebastian, Hans Harder, Feliks Nüske, Friedrich Philipp, Manuel Schaller, and Karl Worthmann. “Partial Observations, Coarse Graining and Equivariance in Koopman  Operator Theory for Large-Scale Dynamical Systems.” <i>ArXiv:2307.15325</i>, 2023.","ama":"Peitz S, Harder H, Nüske F, Philipp F, Schaller M, Worthmann K. Partial observations, coarse graining and equivariance in Koopman  operator theory for large-scale dynamical systems. <i>arXiv:230715325</i>. Published online 2023.","apa":"Peitz, S., Harder, H., Nüske, F., Philipp, F., Schaller, M., &#38; Worthmann, K. (2023). Partial observations, coarse graining and equivariance in Koopman  operator theory for large-scale dynamical systems. In <i>arXiv:2307.15325</i>.","mla":"Peitz, Sebastian, et al. “Partial Observations, Coarse Graining and Equivariance in Koopman  Operator Theory for Large-Scale Dynamical Systems.” <i>ArXiv:2307.15325</i>, 2023.","short":"S. Peitz, H. Harder, F. Nüske, F. Philipp, M. Schaller, K. Worthmann, ArXiv:2307.15325 (2023).","bibtex":"@article{Peitz_Harder_Nüske_Philipp_Schaller_Worthmann_2023, title={Partial observations, coarse graining and equivariance in Koopman  operator theory for large-scale dynamical systems}, journal={arXiv:2307.15325}, author={Peitz, Sebastian and Harder, Hans and Nüske, Feliks and Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl}, year={2023} }"},"year":"2023","author":[{"first_name":"Sebastian","id":"47427","full_name":"Peitz, Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz"},{"first_name":"Hans","last_name":"Harder","id":"98879","full_name":"Harder, Hans"},{"first_name":"Feliks","last_name":"Nüske","full_name":"Nüske, Feliks"},{"full_name":"Philipp, Friedrich","last_name":"Philipp","first_name":"Friedrich"},{"first_name":"Manuel","last_name":"Schaller","full_name":"Schaller, Manuel"},{"last_name":"Worthmann","full_name":"Worthmann, Karl","first_name":"Karl"}],"date_created":"2023-08-21T05:52:24Z","date_updated":"2023-08-21T05:53:35Z","oa":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/pdf/2307.15325"}],"title":"Partial observations, coarse graining and equivariance in Koopman  operator theory for large-scale dynamical systems","type":"preprint","publication":"arXiv:2307.15325","status":"public","abstract":[{"text":"The Koopman operator has become an essential tool for data-driven analysis, prediction and control of complex systems, the main reason being the enormous potential of identifying linear function space representations of nonlinear\r\ndynamics from measurements. Until now, the situation where for large-scale systems, we (i) only have access to partial observations (i.e., measurements, as is very common for experimental data) or (ii) deliberately perform coarse\r\ngraining (for efficiency reasons) has not been treated to its full extent. In this paper, we address the pitfall associated with this situation, that the classical EDMD algorithm does not automatically provide a Koopman operator approximation for the underlying system if we do not carefully select the number of observables. Moreover, we show that symmetries in the system dynamics can be carried over to the Koopman operator, which allows us to massively increase the model efficiency. We also briefly draw a connection to domain decomposition techniques for partial differential equations and present numerical evidence using the Kuramoto--Sivashinsky equation.","lang":"eng"}],"user_id":"47427","department":[{"_id":"655"}],"_id":"46579","external_id":{"arxiv":["2307.15325"]},"language":[{"iso":"eng"}]},{"_id":"23428","user_id":"47427","department":[{"_id":"101"},{"_id":"655"}],"article_number":"14","language":[{"iso":"eng"}],"type":"journal_article","publication":"Journal of Nonlinear Science","abstract":[{"text":"The Koopman operator has become an essential tool for data-driven approximation of dynamical (control) systems in recent years, e.g., via extended dynamic mode decomposition. Despite its popularity, convergence results and, in particular, error bounds are still quite scarce. In this paper, we derive probabilistic bounds for the approximation error and the prediction error depending on the number of training data points; for both ordinary and stochastic differential equations. Moreover, we extend our analysis to nonlinear control-affine systems using either ergodic trajectories or i.i.d.\r\nsamples. Here, we exploit the linearity of the Koopman generator to obtain a bilinear system and, thus, circumvent the curse of dimensionality since we do not autonomize the system by augmenting the state by the control inputs. To the\r\nbest of our knowledge, this is the first finite-data error analysis in the stochastic and/or control setting. Finally, we demonstrate the effectiveness of the proposed approach by comparing it with state-of-the-art techniques showing its superiority whenever state and control are coupled.","lang":"eng"}],"status":"public","oa":"1","date_updated":"2023-08-24T07:50:12Z","author":[{"first_name":"Feliks","last_name":"Nüske","orcid":"0000-0003-2444-7889","id":"81513","full_name":"Nüske, Feliks"},{"full_name":"Peitz, Sebastian","id":"47427","orcid":"0000-0002-3389-793X","last_name":"Peitz","first_name":"Sebastian"},{"last_name":"Philipp","full_name":"Philipp, Friedrich","first_name":"Friedrich"},{"first_name":"Manuel","full_name":"Schaller, Manuel","last_name":"Schaller"},{"last_name":"Worthmann","full_name":"Worthmann, Karl","first_name":"Karl"}],"date_created":"2021-08-17T12:25:09Z","volume":33,"title":"Finite-data error bounds for Koopman-based prediction and control","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s00332-022-09862-1.pdf","open_access":"1"}],"doi":"10.1007/s00332-022-09862-1","publication_status":"published","year":"2023","citation":{"mla":"Nüske, Feliks, et al. “Finite-Data Error Bounds for Koopman-Based Prediction and Control.” <i>Journal of Nonlinear Science</i>, vol. 33, 14, 2023, doi:<a href=\"https://doi.org/10.1007/s00332-022-09862-1\">10.1007/s00332-022-09862-1</a>.","short":"F. Nüske, S. Peitz, F. Philipp, M. Schaller, K. Worthmann, Journal of Nonlinear Science 33 (2023).","bibtex":"@article{Nüske_Peitz_Philipp_Schaller_Worthmann_2023, title={Finite-data error bounds for Koopman-based prediction and control}, volume={33}, DOI={<a href=\"https://doi.org/10.1007/s00332-022-09862-1\">10.1007/s00332-022-09862-1</a>}, number={14}, journal={Journal of Nonlinear Science}, author={Nüske, Feliks and Peitz, Sebastian and Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl}, year={2023} }","apa":"Nüske, F., Peitz, S., Philipp, F., Schaller, M., &#38; Worthmann, K. (2023). Finite-data error bounds for Koopman-based prediction and control. <i>Journal of Nonlinear Science</i>, <i>33</i>, Article 14. <a href=\"https://doi.org/10.1007/s00332-022-09862-1\">https://doi.org/10.1007/s00332-022-09862-1</a>","ieee":"F. Nüske, S. Peitz, F. Philipp, M. Schaller, and K. Worthmann, “Finite-data error bounds for Koopman-based prediction and control,” <i>Journal of Nonlinear Science</i>, vol. 33, Art. no. 14, 2023, doi: <a href=\"https://doi.org/10.1007/s00332-022-09862-1\">10.1007/s00332-022-09862-1</a>.","chicago":"Nüske, Feliks, Sebastian Peitz, Friedrich Philipp, Manuel Schaller, and Karl Worthmann. “Finite-Data Error Bounds for Koopman-Based Prediction and Control.” <i>Journal of Nonlinear Science</i> 33 (2023). <a href=\"https://doi.org/10.1007/s00332-022-09862-1\">https://doi.org/10.1007/s00332-022-09862-1</a>.","ama":"Nüske F, Peitz S, Philipp F, Schaller M, Worthmann K. Finite-data error bounds for Koopman-based prediction and control. <i>Journal of Nonlinear Science</i>. 2023;33. doi:<a href=\"https://doi.org/10.1007/s00332-022-09862-1\">10.1007/s00332-022-09862-1</a>"},"intvolume":"        33"},{"date_created":"2021-04-09T07:59:19Z","title":"Efficient time stepping for numerical integration using reinforcement  learning","issue":"2","year":"2023","external_id":{"arxiv":["arXiv:2104.03562"]},"language":[{"iso":"eng"}],"ddc":["510"],"publication":"SIAM Journal on Scientific Computing","abstract":[{"lang":"eng","text":"Many problems in science and engineering require an efficient numerical approximation of integrals or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant discretization is often inadvisable as it results in prohibitively large errors or computational effort. To this end, adaptive schemes, such as solvers based on Runge–Kutta pairs, have been developed which adapt the step size based on local error estimations at each step. While the classical schemes apply very generally and are highly efficient on regular systems, they can behave suboptimally when an inefficient step rejection mechanism is triggered by structurally complex systems such as chaotic systems. To overcome these issues, we propose a method to tailor numerical schemes to the problem class at hand. This is achieved by combining simple, classical quadrature rules or ODE solvers with data-driven time-stepping controllers. Compared with learning solution operators to ODEs directly, it generalizes better to unseen initial data as our approach employs classical numerical schemes as base methods. At the same time it can make use of identified structures of a problem class and, therefore, outperforms state-of-the-art adaptive schemes. Several examples demonstrate superior efficiency. Source code is available at https://github.com/lueckem/quadrature-ML."}],"author":[{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129","first_name":"Eyke"},{"last_name":"Lücke","full_name":"Lücke, Marvin","first_name":"Marvin"},{"last_name":"Ober-Blöbaum","full_name":"Ober-Blöbaum, Sina","id":"16494","first_name":"Sina"},{"full_name":"Offen, Christian","id":"85279","orcid":"0000-0002-5940-8057","last_name":"Offen","first_name":"Christian"},{"first_name":"Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","full_name":"Peitz, Sebastian","id":"47427"},{"first_name":"Karlson","orcid":"0000-0001-9407-7903","last_name":"Pfannschmidt","id":"13472","full_name":"Pfannschmidt, Karlson"}],"volume":45,"date_updated":"2023-08-25T09:24:50Z","main_file_link":[{"url":"https://epubs.siam.org/doi/reader/10.1137/21M1412682"}],"doi":"10.1137/21M1412682","related_material":{"link":[{"relation":"software","description":"GitHub","url":"https://github.com/lueckem/quadrature-ML"}]},"publication_status":"published","has_accepted_license":"1","citation":{"ama":"Dellnitz M, Hüllermeier E, Lücke M, et al. Efficient time stepping for numerical integration using reinforcement  learning. <i>SIAM Journal on Scientific Computing</i>. 2023;45(2):A579-A595. doi:<a href=\"https://doi.org/10.1137/21M1412682\">10.1137/21M1412682</a>","chicago":"Dellnitz, Michael, Eyke Hüllermeier, Marvin Lücke, Sina Ober-Blöbaum, Christian Offen, Sebastian Peitz, and Karlson Pfannschmidt. “Efficient Time Stepping for Numerical Integration Using Reinforcement  Learning.” <i>SIAM Journal on Scientific Computing</i> 45, no. 2 (2023): A579–95. <a href=\"https://doi.org/10.1137/21M1412682\">https://doi.org/10.1137/21M1412682</a>.","ieee":"M. Dellnitz <i>et al.</i>, “Efficient time stepping for numerical integration using reinforcement  learning,” <i>SIAM Journal on Scientific Computing</i>, vol. 45, no. 2, pp. A579–A595, 2023, doi: <a href=\"https://doi.org/10.1137/21M1412682\">10.1137/21M1412682</a>.","apa":"Dellnitz, M., Hüllermeier, E., Lücke, M., Ober-Blöbaum, S., Offen, C., Peitz, S., &#38; Pfannschmidt, K. (2023). Efficient time stepping for numerical integration using reinforcement  learning. <i>SIAM Journal on Scientific Computing</i>, <i>45</i>(2), A579–A595. <a href=\"https://doi.org/10.1137/21M1412682\">https://doi.org/10.1137/21M1412682</a>","short":"M. Dellnitz, E. Hüllermeier, M. Lücke, S. Ober-Blöbaum, C. Offen, S. Peitz, K. Pfannschmidt, SIAM Journal on Scientific Computing 45 (2023) A579–A595.","bibtex":"@article{Dellnitz_Hüllermeier_Lücke_Ober-Blöbaum_Offen_Peitz_Pfannschmidt_2023, title={Efficient time stepping for numerical integration using reinforcement  learning}, volume={45}, DOI={<a href=\"https://doi.org/10.1137/21M1412682\">10.1137/21M1412682</a>}, number={2}, journal={SIAM Journal on Scientific Computing}, author={Dellnitz, Michael and Hüllermeier, Eyke and Lücke, Marvin and Ober-Blöbaum, Sina and Offen, Christian and Peitz, Sebastian and Pfannschmidt, Karlson}, year={2023}, pages={A579–A595} }","mla":"Dellnitz, Michael, et al. “Efficient Time Stepping for Numerical Integration Using Reinforcement  Learning.” <i>SIAM Journal on Scientific Computing</i>, vol. 45, no. 2, 2023, pp. A579–95, doi:<a href=\"https://doi.org/10.1137/21M1412682\">10.1137/21M1412682</a>."},"page":"A579-A595","intvolume":"        45","user_id":"47427","department":[{"_id":"101"},{"_id":"636"},{"_id":"355"},{"_id":"655"}],"_id":"21600","type":"journal_article","status":"public"}]