[{"department":[{"_id":"75"}],"type":"conference","keyword":["network management","service management","AI","Monte Carlo Tree Search","model-based","QoS"],"date_created":"2022-01-11T08:43:26Z","file":[{"creator":"stschn","date_created":"2022-01-11T08:39:57Z","file_size":528653,"access_level":"open_access","file_name":"author_version.pdf","date_updated":"2022-01-11T08:39:57Z","relation":"main_file","content_type":"application/pdf","file_id":"29222"}],"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"}],"publication":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","language":[{"iso":"eng"}],"date_updated":"2022-01-11T08:44:04Z","author":[{"full_name":"Werner, Stefan","first_name":"Stefan","last_name":"Werner"},{"full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","id":"35343"},{"id":"126","full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"title":"Use What You Know: Network and Service Coordination Beyond Certainty","year":"2022","oa":"1","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"quality_controlled":"1","citation":{"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.","short":"S. Werner, S.B. Schneider, H. Karl, in: IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2022.","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.","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.","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} }"},"file_date_updated":"2022-01-11T08:39:57Z","ddc":["004"],"user_id":"35343","publisher":"IEEE","_id":"29220","has_accepted_license":"1","conference":{"end_date":"2022-04-29","location":"Budapest","name":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","start_date":"2022-04-25"},"status":"public"},{"abstract":[{"text":"This paper introduces the project Scale4Edge. The project is focused on enabling an effective RISC-V ecosystem for optimization of edge applications. We describe the basic components of this ecosystem and introduce the envisioned\r\ndemonstrators, which will be used in their evaluation.","lang":"eng"}],"publication":"In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)","citation":{"ieee":"W. Ecker <i>et al.</i>, “The Scale4Edge RISC-V Ecosystem,” 2022.","apa":"Ecker, W., Adelt, P., Müller, W., Heckmann, R., Krstic, M., Herdt, V., Drechsler, R., Angst, G., Wimmer, R., Mauderer, A., Stahl, R., Emrich, K., Mueller-Gritschneder, D., Becker, B., Scholl, P., Jentzsch, E., Schlamelcher, J., Grüttner, K., Bernardo, P. P., … Kunz, W. (2022). The Scale4Edge RISC-V Ecosystem. <i>In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)</i>.","short":"W. Ecker, P. Adelt, W. Müller, R. Heckmann, M. Krstic, V. Herdt, R. Drechsler, G. Angst, R. Wimmer, A. Mauderer, R. Stahl, K. Emrich, D. Mueller-Gritschneder, B. Becker, P. Scholl, E. Jentzsch, J. Schlamelcher, K. Grüttner, P.P. Bernardo, O. Brinkmann, M. Damian, J. Oppermann, A. Koch, J. Bormann, J. Partzsch, C. Mayr, W. Kunz, in: In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022), 2022.","chicago":"Ecker, Wolfgang, Peer Adelt, Wolfgang Müller, Reinhold Heckmann, Milos Krstic, Vladimir Herdt, Rolf Drechsler, et al. “The Scale4Edge RISC-V Ecosystem.” In <i>In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)</i>, 2022.","mla":"Ecker, Wolfgang, et al. “The Scale4Edge RISC-V Ecosystem.” <i>In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)</i>, 2022.","bibtex":"@inproceedings{Ecker_Adelt_Müller_Heckmann_Krstic_Herdt_Drechsler_Angst_Wimmer_Mauderer_et al._2022, title={The Scale4Edge RISC-V Ecosystem}, booktitle={In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)}, author={Ecker, Wolfgang and Adelt, Peer and Müller, Wolfgang and Heckmann, Reinhold and Krstic, Milos and Herdt, Vladimir and Drechsler, Rolf and Angst, Gerhard and Wimmer, Ralf and Mauderer, Andreas and et al.}, year={2022} }","ama":"Ecker W, Adelt P, Müller W, et al. The Scale4Edge RISC-V Ecosystem. In: <i>In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)</i>. ; 2022."},"type":"conference","department":[{"_id":"58"}],"date_created":"2022-01-13T07:27:46Z","date_updated":"2022-01-13T07:30:38Z","year":"2022","status":"public","title":"The Scale4Edge RISC-V Ecosystem","conference":{"end_date":"15.03.2022","start_date":"14.03.2022"},"author":[{"full_name":"Ecker, Wolfgang","first_name":"Wolfgang","last_name":"Ecker"},{"full_name":"Adelt, Peer","last_name":"Adelt","first_name":"Peer","id":"5603"},{"full_name":"Müller, Wolfgang","first_name":"Wolfgang","last_name":"Müller","id":"16243"},{"full_name":"Heckmann, Reinhold","first_name":"Reinhold","last_name":"Heckmann"},{"full_name":"Krstic, Milos","first_name":"Milos","last_name":"Krstic"},{"full_name":"Herdt, Vladimir","first_name":"Vladimir","last_name":"Herdt"},{"full_name":"Drechsler, Rolf","last_name":"Drechsler","first_name":"Rolf"},{"first_name":"Gerhard","last_name":"Angst","full_name":"Angst, Gerhard"},{"full_name":"Wimmer, Ralf","first_name":"Ralf","last_name":"Wimmer"},{"first_name":"Andreas","last_name":"Mauderer","full_name":"Mauderer, Andreas"},{"full_name":"Stahl, Rafael","last_name":"Stahl","first_name":"Rafael"},{"first_name":"Karsten","last_name":"Emrich","full_name":"Emrich, Karsten"},{"last_name":"Mueller-Gritschneder","first_name":"Daniel","full_name":"Mueller-Gritschneder, Daniel"},{"first_name":"Bernd","last_name":"Becker","full_name":"Becker, Bernd"},{"first_name":"Philipp","last_name":"Scholl","full_name":"Scholl, Philipp"},{"full_name":"Jentzsch, Eyck","last_name":"Jentzsch","first_name":"Eyck"},{"full_name":"Schlamelcher, Jan","last_name":"Schlamelcher","first_name":"Jan"},{"last_name":"Grüttner","first_name":"Kim","full_name":"Grüttner, Kim"},{"first_name":"Paul Palomero","last_name":"Bernardo","full_name":"Bernardo, Paul Palomero"},{"full_name":"Brinkmann, Oliver","first_name":"Oliver","last_name":"Brinkmann"},{"last_name":"Damian","first_name":"Mihaela","full_name":"Damian, Mihaela"},{"full_name":"Oppermann, Julian","first_name":"Julian","last_name":"Oppermann"},{"full_name":"Koch, Andreas","first_name":"Andreas","last_name":"Koch"},{"full_name":"Bormann, Jörg","last_name":"Bormann","first_name":"Jörg"},{"full_name":"Partzsch, Johannes","last_name":"Partzsch","first_name":"Johannes"},{"full_name":"Mayr, Christian","first_name":"Christian","last_name":"Mayr"},{"full_name":"Kunz, Wolfgang","first_name":"Wolfgang","last_name":"Kunz"}],"user_id":"15931","language":[{"iso":"eng"}],"_id":"29302"},{"department":[{"_id":"563"}],"type":"journal_article","date_created":"2021-11-24T09:52:18Z","citation":{"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} }","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>.","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>.","short":"C. Koldewey, A. Rasor, J. Reinhold, J. Gausemeier, R. Dumitrescu, N. Chohan, M. Frank, Technological Forecasting and Social Change (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>."},"publication":"Technological Forecasting and Social Change","user_id":"15782","doi":"10.1016/j.techfore.2021.121329","language":[{"iso":"eng"}],"_id":"27776","publisher":"Elsevier","article_number":"121329","publication_status":"published","date_updated":"2022-01-25T08:52:39Z","publication_identifier":{"issn":["0040-1625"]},"author":[{"id":"43136","full_name":"Koldewey, Christian","first_name":"Christian","orcid":"https://orcid.org/0000-0001-7992-6399","last_name":"Koldewey"},{"id":"34415","last_name":"Rasor","first_name":"Anja","full_name":"Rasor, Anja"},{"id":"33669","full_name":"Reinhold, Jannik","last_name":"Reinhold","first_name":"Jannik"},{"last_name":"Gausemeier","first_name":"Jürgen","full_name":"Gausemeier, Jürgen","id":"163"},{"full_name":"Dumitrescu, Roman","last_name":"Dumitrescu","first_name":"Roman","id":"16190"},{"full_name":"Chohan, Nadia","last_name":"Chohan","first_name":"Nadia"},{"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_created":"2022-01-26T08:52:20Z","department":[{"_id":"78"}],"type":"preprint","citation":{"ama":"Lienen C, Platzner M. ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications. Published online 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} }","mla":"Lienen, Christian, and Marco Platzner. <i>ReconROS Executor: Event-Driven Programming of FPGA-Accelerated ROS 2 Applications</i>. 2022.","short":"C. Lienen, M. Platzner, (2022).","chicago":"Lienen, Christian, and Marco 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>.","ieee":"C. Lienen and M. Platzner, “ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications.” 2022."},"_id":"29541","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2201.07454"}],"user_id":"60323","author":[{"id":"60323","full_name":"Lienen, Christian","first_name":"Christian","last_name":"Lienen"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"title":"ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications","status":"public","year":"2022","date_updated":"2022-01-28T08:30:16Z"},{"date_updated":"2022-02-07T13:32:28Z","publication_status":"published","author":[{"full_name":"Niehues, David","last_name":"Niehues","first_name":"David","id":"36113"}],"title":"More Efficient Techniques for Adaptively-Secure Cryptography","year":"2022","doi":"10.25926/rdtq-jw45","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf","open_access":"1"}],"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"}],"department":[{"_id":"558"}],"type":"dissertation","keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"date_created":"2022-02-07T13:29:07Z","file":[{"relation":"main_file","date_updated":"2022-02-07T13:26:05Z","file_name":"de2107.pdf","file_size":1542089,"access_level":"closed","file_id":"29764","content_type":"application/pdf","success":1,"creator":"davnie","date_created":"2022-02-07T13:26:05Z"}],"has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"36113","_id":"29763","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"supervisor":[{"id":"64669","first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"full_name":"Lehmann, Anja","first_name":"Anja","last_name":"Lehmann"}],"citation":{"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} }","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>","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>.","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.","ieee":"D. Niehues, <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 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>"},"file_date_updated":"2022-02-07T13:26:05Z","oa":"1"},{"department":[{"_id":"600"}],"type":"conference_abstract","date_created":"2022-05-05T07:50:21Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"citation":{"ieee":"M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation structures of EFL learners from diverse language backgrounds,” 2022.","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.","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} }","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."},"publication":"EUROCALL","user_id":"82920","_id":"31068","language":[{"iso":"eng"}],"date_updated":"2022-05-09T14:58:39Z","author":[{"full_name":"Chen, Mei-Hua","last_name":"Chen","first_name":"Mei-Hua"},{"last_name":"Mudgal","first_name":"Garima","full_name":"Mudgal, Garima"},{"id":"82920","first_name":"Wei-Fan","last_name":"Chen","full_name":"Chen, Wei-Fan"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"}],"status":"public","year":"2022","title":"Investigating the argumentation structures of EFL learners from diverse language backgrounds"},{"publisher":"Springer Science and Business Media LLC","_id":"29351","language":[{"iso":"eng"}],"doi":"10.1007/s10836-021-05979-5","user_id":"209","author":[{"id":"78614","last_name":"Sadeghi-Kohan","first_name":"Somayeh","full_name":"Sadeghi-Kohan, Somayeh"},{"id":"209","first_name":"Sybille","last_name":"Hellebrand","orcid":"0000-0002-3717-3939","full_name":"Hellebrand, Sybille"},{"last_name":"Wunderlich","first_name":"Hans-Joachim","full_name":"Wunderlich, Hans-Joachim"}],"publication_identifier":{"issn":["0923-8174","1573-0727"]},"title":"Stress-Aware Periodic Test of Interconnects","year":"2022","status":"public","article_type":"original","date_updated":"2022-05-11T16:10:01Z","publication_status":"published","date_created":"2022-01-14T11:16:34Z","department":[{"_id":"48"}],"type":"journal_article","keyword":["Electrical and Electronic Engineering"],"citation":{"short":"S. Sadeghi-Kohan, S. Hellebrand, H.-J. Wunderlich, Journal of Electronic Testing (2022).","chicago":"Sadeghi-Kohan, Somayeh, Sybille Hellebrand, and Hans-Joachim Wunderlich. “Stress-Aware Periodic Test of Interconnects.” <i>Journal of Electronic Testing</i>, 2022. <a href=\"https://doi.org/10.1007/s10836-021-05979-5\">https://doi.org/10.1007/s10836-021-05979-5</a>.","apa":"Sadeghi-Kohan, S., Hellebrand, S., &#38; Wunderlich, H.-J. (2022). Stress-Aware Periodic Test of Interconnects. <i>Journal of Electronic Testing</i>. <a href=\"https://doi.org/10.1007/s10836-021-05979-5\">https://doi.org/10.1007/s10836-021-05979-5</a>","ieee":"S. Sadeghi-Kohan, S. Hellebrand, and H.-J. Wunderlich, “Stress-Aware Periodic Test of Interconnects,” <i>Journal of Electronic Testing</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s10836-021-05979-5\">10.1007/s10836-021-05979-5</a>.","ama":"Sadeghi-Kohan S, Hellebrand S, Wunderlich H-J. Stress-Aware Periodic Test of Interconnects. <i>Journal of Electronic Testing</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s10836-021-05979-5\">10.1007/s10836-021-05979-5</a>","bibtex":"@article{Sadeghi-Kohan_Hellebrand_Wunderlich_2022, title={Stress-Aware Periodic Test of Interconnects}, DOI={<a href=\"https://doi.org/10.1007/s10836-021-05979-5\">10.1007/s10836-021-05979-5</a>}, journal={Journal of Electronic Testing}, publisher={Springer Science and Business Media LLC}, author={Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}, year={2022} }","mla":"Sadeghi-Kohan, Somayeh, et al. “Stress-Aware Periodic Test of Interconnects.” <i>Journal of Electronic Testing</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s10836-021-05979-5\">10.1007/s10836-021-05979-5</a>."},"publication":"Journal of Electronic Testing","abstract":[{"text":"Safety-critical systems have to follow extremely high dependability requirements as specified in the standards for automotive, air, and space applications. The required high fault coverage at runtime is usually obtained by a combination of concurrent error detection or correction and periodic tests within rather short time intervals. The concurrent scheme ensures the integrity of computed results while the periodic test has to identify potential aging problems and to prevent any fault accumulation which may invalidate the concurrent error detection mechanism. Such periodic built-in self-test (BIST) schemes are already commercialized for memories and for random logic. The paper at hand extends this approach to interconnect structures. A BIST scheme is presented which targets interconnect defects before they will actually affect the system functionality at nominal speed. A BIST schedule is developed which significantly reduces aging caused by electromigration during the lifetime application of the periodic test.","lang":"eng"}]},{"department":[{"_id":"48"}],"keyword":["WORKSHOP"],"type":"misc","place":"Online","date_created":"2022-02-19T14:21:24Z","citation":{"chicago":"Sadeghi-Kohan, Somayeh, Sybille Hellebrand, and Hans-Joachim Wunderlich. <i>EM-Aware Interconnect BIST</i>. Online: European Workshop on Silicon Lifecycle Management, March 18, 2022, 2022.","short":"S. Sadeghi-Kohan, S. Hellebrand, H.-J. Wunderlich, EM-Aware Interconnect BIST, European Workshop on Silicon Lifecycle Management, March 18, 2022, Online, 2022.","apa":"Sadeghi-Kohan, S., Hellebrand, S., &#38; Wunderlich, H.-J. (2022). <i>EM-Aware Interconnect BIST</i>. European Workshop on Silicon Lifecycle Management, March 18, 2022.","ieee":"S. Sadeghi-Kohan, S. Hellebrand, and H.-J. Wunderlich, <i>EM-Aware Interconnect BIST</i>. Online: European Workshop on Silicon Lifecycle Management, March 18, 2022, 2022.","ama":"Sadeghi-Kohan S, Hellebrand S, Wunderlich H-J. <i>EM-Aware Interconnect BIST</i>. European Workshop on Silicon Lifecycle Management, March 18, 2022; 2022.","bibtex":"@book{Sadeghi-Kohan_Hellebrand_Wunderlich_2022, place={Online}, title={EM-Aware Interconnect BIST}, publisher={European Workshop on Silicon Lifecycle Management, March 18, 2022}, author={Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}, year={2022} }","mla":"Sadeghi-Kohan, Somayeh, et al. <i>EM-Aware Interconnect BIST</i>. European Workshop on Silicon Lifecycle Management, March 18, 2022, 2022."},"user_id":"209","language":[{"iso":"eng"}],"_id":"29890","publisher":"European Workshop on Silicon Lifecycle Management, March 18, 2022","page":"2","date_updated":"2022-05-11T17:07:24Z","publication_status":"published","author":[{"id":"78614","first_name":"Somayeh","last_name":"Sadeghi-Kohan","full_name":"Sadeghi-Kohan, Somayeh"},{"id":"209","full_name":"Hellebrand, Sybille","last_name":"Hellebrand","orcid":"0000-0002-3717-3939","first_name":"Sybille"},{"last_name":"Wunderlich","first_name":"Hans-Joachim","full_name":"Wunderlich, Hans-Joachim"}],"status":"public","year":"2022","title":"EM-Aware Interconnect BIST"},{"department":[{"_id":"63"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"type":"journal_article","date_created":"2022-05-27T10:09:24Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"citation":{"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} }","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>","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>.","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>.","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>"},"publication":"Algorithmica","user_id":"39241","doi":"10.1007/s00453-022-00978-0","language":[{"iso":"eng"}],"_id":"31479","publisher":"Springer Science and Business Media LLC","genbank":["tillk"],"publication_status":"published","date_updated":"2022-05-27T10:14:27Z","author":[{"full_name":"Baswana, Surender","first_name":"Surender","last_name":"Baswana"},{"full_name":"Gupta, Shiv","first_name":"Shiv","last_name":"Gupta"},{"first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","id":"39241"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"year":"2022","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","status":"public"},{"date_updated":"2022-06-01T07:13:09Z","status":"public","year":"2022","title":"Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization","author":[{"id":"32643","full_name":"Gebken, Bennet","last_name":"Gebken","first_name":"Bennet"}],"doi":"10.17619/UNIPB/1-1327","user_id":"32643","main_file_link":[{"url":"https://digital.ub.uni-paderborn.de/hs/download/pdf/6531779","open_access":"1"}],"_id":"31556","language":[{"iso":"eng"}],"abstract":[{"text":"Mehrzieloptimierung behandelt Probleme, bei denen mehrere skalare Zielfunktionen simultan optimiert werden sollen. Ein Punkt ist in diesem Fall optimal, wenn es keinen anderen Punkt gibt, der mindestens genauso gut ist in allen Zielfunktionen und besser in mindestens einer Zielfunktion. Ein notwendiges Optimalitätskriterium lässt sich über Ableitungsinformationen erster Ordnung der Zielfunktionen herleiten. Die Menge der Punkte, die dieses notwendige Kriterium erfüllen, wird als Pareto-kritische Menge bezeichnet. Diese Arbeit enthält neue Resultate über Pareto-kritische Mengen für glatte und nicht-glatte Mehrzieloptimierungsprobleme, sowohl was deren Berechnung betrifft als auch deren Struktur. Im glatten Fall erfolgt die Berechnung über ein Fortsetzungsverfahren, im nichtglatten Fall über ein Abstiegsverfahren. Anschließend wird die Struktur des Randes der Pareto-kritischen Menge analysiert, welcher aus Pareto-kritischen Mengen kleinerer Subprobleme besteht. Schlussendlich werden inverse Probleme betrachtet, bei denen zu einer gegebenen Datenmenge ein Zielfunktionsvektor gefunden werden soll, für den die Datenpunkte kritisch sind.","lang":"ger"},{"text":"Multiobjective optimization is concerned with the simultaneous optimization of multiple scalar-valued functions. In this case, a point is optimal if there is no other point that is at least as good in all objectives and better in at least one objective. A necessary condition for optimality can be derived based on first-order information of the objectives. The set of points that satisfy this necessary condition is called the Pareto critical set. This thesis presents new results about Pareto critical sets for smooth and nonsmooth multiobjective optimization problems, both in terms of their efficient computation and structural properties. In the smooth case they are computed via a continuation method and in the nonsmooth case via a descent method. Afterwards, the structure of the boundary of the Pareto critical set is analyzed, which consists of Pareto critical sets of smaller subproblems. Finally, inverse problems are considered, where a data set is given and an objective vector is sought for which the data points are critical.","lang":"eng"}],"supervisor":[{"full_name":"Dellnitz, Michael","last_name":"Dellnitz","first_name":"Michael"}],"citation":{"apa":"Gebken, B. (2022). <i>Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1327\">https://doi.org/10.17619/UNIPB/1-1327</a>","ieee":"B. Gebken, <i>Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization</i>. 2022.","short":"B. Gebken, Computation and Analysis of Pareto Critical Sets in Smooth and Nonsmooth Multiobjective Optimization, 2022.","chicago":"Gebken, Bennet. <i>Computation and Analysis of Pareto Critical Sets in Smooth and Nonsmooth Multiobjective Optimization</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1327\">https://doi.org/10.17619/UNIPB/1-1327</a>.","mla":"Gebken, Bennet. <i>Computation and Analysis of Pareto Critical Sets in Smooth and Nonsmooth Multiobjective Optimization</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1327\">10.17619/UNIPB/1-1327</a>.","ama":"Gebken B. <i>Computation and Analysis of Pareto Critical Sets in Smooth and Nonsmooth Multiobjective Optimization</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1327\">10.17619/UNIPB/1-1327</a>","bibtex":"@book{Gebken_2022, title={Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1327\">10.17619/UNIPB/1-1327</a>}, author={Gebken, Bennet}, year={2022} }"},"type":"dissertation","oa":"1","department":[{"_id":"101"}],"date_created":"2022-06-01T06:48:08Z"},{"user_id":"158","ddc":["530"],"volume":384,"page":"115099","publisher":"Elsevier BV","_id":"31574","has_accepted_license":"1","status":"public","oa":"1","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"file_date_updated":"2022-06-01T18:56:44Z","citation":{"mla":"Grynko, Yevgen, et al. “Negative Polarization of Light at Backscattering from a Numerical Analog of Planetary Regoliths.” <i>Icarus</i>, vol. 384, Elsevier BV, 2022, p. 115099, doi:<a href=\"https://doi.org/10.1016/j.icarus.2022.115099\">10.1016/j.icarus.2022.115099</a>.","ama":"Grynko Y, Shkuratov Y, Alhaddad S, Förstner J. Negative polarization of light at backscattering from a numerical analog of planetary regoliths. <i>Icarus</i>. 2022;384:115099. doi:<a href=\"https://doi.org/10.1016/j.icarus.2022.115099\">10.1016/j.icarus.2022.115099</a>","bibtex":"@article{Grynko_Shkuratov_Alhaddad_Förstner_2022, title={Negative polarization of light at backscattering from a numerical analog of planetary regoliths}, volume={384}, DOI={<a href=\"https://doi.org/10.1016/j.icarus.2022.115099\">10.1016/j.icarus.2022.115099</a>}, journal={Icarus}, publisher={Elsevier BV}, author={Grynko, Yevgen and Shkuratov, Yuriy and Alhaddad, Samer and Förstner, Jens}, year={2022}, pages={115099} }","apa":"Grynko, Y., Shkuratov, Y., Alhaddad, S., &#38; Förstner, J. (2022). Negative polarization of light at backscattering from a numerical analog of planetary regoliths. <i>Icarus</i>, <i>384</i>, 115099. <a href=\"https://doi.org/10.1016/j.icarus.2022.115099\">https://doi.org/10.1016/j.icarus.2022.115099</a>","ieee":"Y. Grynko, Y. Shkuratov, S. Alhaddad, and J. Förstner, “Negative polarization of light at backscattering from a numerical analog of planetary regoliths,” <i>Icarus</i>, vol. 384, p. 115099, 2022, doi: <a href=\"https://doi.org/10.1016/j.icarus.2022.115099\">10.1016/j.icarus.2022.115099</a>.","chicago":"Grynko, Yevgen, Yuriy Shkuratov, Samer Alhaddad, and Jens Förstner. “Negative Polarization of Light at Backscattering from a Numerical Analog of Planetary Regoliths.” <i>Icarus</i> 384 (2022): 115099. <a href=\"https://doi.org/10.1016/j.icarus.2022.115099\">https://doi.org/10.1016/j.icarus.2022.115099</a>.","short":"Y. Grynko, Y. Shkuratov, S. Alhaddad, J. Förstner, Icarus 384 (2022) 115099."},"doi":"10.1016/j.icarus.2022.115099","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-06-01T18:57:51Z","intvolume":"       384","year":"2022","title":"Negative polarization of light at backscattering from a numerical analog of planetary regoliths","publication_identifier":{"issn":["0019-1035"]},"author":[{"id":"26059","last_name":"Grynko","first_name":"Yevgen","full_name":"Grynko, Yevgen"},{"full_name":"Shkuratov, Yuriy","last_name":"Shkuratov","first_name":"Yuriy"},{"id":"42456","first_name":"Samer","last_name":"Alhaddad","full_name":"Alhaddad, Samer"},{"id":"158","first_name":"Jens","last_name":"Förstner","orcid":"0000-0001-7059-9862","full_name":"Förstner, Jens"}],"keyword":["tet_topic_scattering"],"type":"journal_article","department":[{"_id":"61"}],"file":[{"content_type":"application/pdf","file_id":"31575","file_size":1419286,"access_level":"open_access","file_name":"2022-06 Grynko - Icarus - Negative polarization of light at backscattering from a numerical analog of planetary regoliths.pdf","date_updated":"2022-06-01T18:56:44Z","relation":"main_file","date_created":"2022-06-01T18:56:44Z","creator":"fossie"}],"date_created":"2022-06-01T18:53:35Z","abstract":[{"lang":"eng","text":"We model negative polarization, which is observed for planetary regoliths at backscattering, solving a full wave problem of light scattering with a numerically exact Discontinuous Galerkin Time Domain (DGTD) method. Pieces of layers with the bulk packing density of particles close to 0.5 are used. The model particles are highly absorbing and have irregular shapes and sizes larger than the wavelength of light. This represents a realistic analog of low-albedo planetary regoliths. Our simulations confirm coherent backscattering mechanism of the origin of negative polarization. We show that angular profiles of polarization are stabilized if the number of particles in a layer piece becomes larger than ten. This allows application of our approach to the negative polarization modeling for planetary regoliths."}],"publication":"Icarus"},{"_id":"32792","publisher":"Springer International Publishing","language":[{"iso":"eng"}],"doi":"10.1007/978-3-031-11510-3_6","user_id":"39928","author":[{"id":"39928","full_name":"Kirchhoff, Jonas","first_name":"Jonas","last_name":"Kirchhoff"},{"id":"47208","first_name":"Sebastian","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"publication_identifier":{"isbn":["9783031115097","9783031115103"],"issn":["1865-1348","1865-1356"]},"title":"Detecting Data Incompatibilities in Process-Driven Decision Support Systems","status":"public","year":"2022","date_updated":"2022-08-10T13:21:34Z","publication_status":"published","place":"Cham","date_created":"2022-08-10T13:18:30Z","department":[{"_id":"534"},{"_id":"66"}],"type":"book_chapter","citation":{"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>","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} }","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>.","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>.","short":"J. Kirchhoff, S. Gottschalk, G. Engels, in: Lecture Notes in Business Information Processing, Springer International Publishing, Cham, 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>","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."},"publication":"Lecture Notes in Business Information Processing","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"}]},{"type":"conference","department":[{"_id":"52"}],"date_created":"2022-08-11T08:46:36Z","publication":"2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)","citation":{"mla":"Böcker, Joachim. “Concept Study of an LLC Converter with Magnetically Resonant Inductor.” <i>2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/speedam53979.2022.9842047\">10.1109/speedam53979.2022.9842047</a>.","apa":"Böcker, J. (2022). Concept Study of an LLC Converter with Magnetically Resonant Inductor. <i>2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)</i>. SPEEDAM, Sorrento, Italy. <a href=\"https://doi.org/10.1109/speedam53979.2022.9842047\">https://doi.org/10.1109/speedam53979.2022.9842047</a>","ieee":"J. Böcker, “Concept Study of an LLC Converter with Magnetically Resonant Inductor,” presented at the SPEEDAM, Sorrento, Italy, 2022, doi: <a href=\"https://doi.org/10.1109/speedam53979.2022.9842047\">10.1109/speedam53979.2022.9842047</a>.","ama":"Böcker J. Concept Study of an LLC Converter with Magnetically Resonant Inductor. In: <i>2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/speedam53979.2022.9842047\">10.1109/speedam53979.2022.9842047</a>","short":"J. Böcker, in: 2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM), IEEE, 2022.","chicago":"Böcker, Joachim. “Concept Study of an LLC Converter with Magnetically Resonant Inductor.” In <i>2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/speedam53979.2022.9842047\">https://doi.org/10.1109/speedam53979.2022.9842047</a>.","bibtex":"@inproceedings{Böcker_2022, title={Concept Study of an LLC Converter with Magnetically Resonant Inductor}, DOI={<a href=\"https://doi.org/10.1109/speedam53979.2022.9842047\">10.1109/speedam53979.2022.9842047</a>}, booktitle={2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)}, publisher={IEEE}, author={Böcker, Joachim}, year={2022} }"},"doi":"10.1109/speedam53979.2022.9842047","user_id":"66","_id":"32796","publisher":"IEEE","language":[{"iso":"eng"}],"date_updated":"2022-08-19T06:27:55Z","publication_status":"published","year":"2022","status":"public","title":"Concept Study of an LLC Converter with Magnetically Resonant Inductor","conference":{"name":"SPEEDAM","start_date":"2022-06","location":"Sorrento, Italy"},"author":[{"full_name":"Böcker, Joachim","first_name":"Joachim","last_name":"Böcker","orcid":"0000-0002-8480-7295","id":"66"}]},{"year":"2022","status":"public","title":"Combined Ranking and Regression Trees for Algorithm Selection","author":[{"id":"75695","last_name":"Fehring","first_name":"Lukas","full_name":"Fehring, Lukas"}],"date_updated":"2022-08-20T07:02:04Z","has_accepted_license":"1","_id":"33033","language":[{"iso":"eng"}],"user_id":"38209","ddc":["006"],"file_date_updated":"2022-08-19T09:39:57Z","citation":{"bibtex":"@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }","ama":"Fehring L. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>.; 2022.","mla":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. 2022.","chicago":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. Paderborn, 2022.","short":"L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection, Paderborn, 2022.","ieee":"L. Fehring, <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>."},"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"}],"file":[{"content_type":"application/pdf","file_id":"33034","date_updated":"2022-08-19T09:39:57Z","relation":"main_file","access_level":"open_access","file_size":24830795,"file_name":"Final Bachelor Thesis.pdf","date_created":"2022-08-19T09:39:57Z","creator":"ahetzer"}],"date_created":"2022-08-19T09:41:14Z","place":"Paderborn","type":"bachelorsthesis","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"oa":"1"},{"language":[{"iso":"eng"}],"_id":"30867","publisher":"AAAI","user_id":"38209","status":"public","title":"Machine Learning for Online Algorithm Selection under Censored Feedback","year":"2022","author":[{"id":"38209","first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander"},{"full_name":"Bengs, Viktor","last_name":"Bengs","first_name":"Viktor","id":"76599"},{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"}],"date_updated":"2022-08-24T12:44:27Z","external_id":{"arxiv":["2109.06234"]},"date_created":"2022-04-12T11:58:56Z","type":"preprint","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","citation":{"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.","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."},"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":[{"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"}]},{"citation":{"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.","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>.","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.","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.","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} }","mla":"Tornede, Alexander, et al. “Algorithm Selection on a Meta Level.” <i>Machine Learning</i>, 2022."},"publication":"Machine Learning","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"}],"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."}],"date_created":"2022-04-12T11:55:18Z","external_id":{"arxiv":["2107.09414"]},"department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"type":"preprint","author":[{"id":"38209","first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander"},{"last_name":"Gehring","first_name":"Lukas","full_name":"Gehring, Lukas"},{"full_name":"Tornede, Tanja","last_name":"Tornede","first_name":"Tanja","id":"40795"},{"last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","id":"33176"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"title":"Algorithm Selection on a Meta Level","year":"2022","status":"public","date_updated":"2022-08-24T12:45:39Z","language":[{"iso":"eng"}],"_id":"30865","user_id":"38209"},{"title":"Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients","status":"public","year":"2022","author":[{"id":"51701","full_name":"Berkemeier, Manuel Bastian","first_name":"Manuel Bastian","last_name":"Berkemeier"},{"id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian","last_name":"Peitz","orcid":"0000-0002-3389-793X"}],"date_updated":"2022-08-26T06:12:10Z","main_file_link":[{"url":"https://arxiv.org/pdf/2208.12094","open_access":"1"}],"_id":"33150","language":[{"iso":"eng"}],"user_id":"47427","publication":"arXiv:2208.12094","citation":{"apa":"Berkemeier, M. B., &#38; Peitz, S. (2022). Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients. In <i>arXiv:2208.12094</i>.","ieee":"M. B. Berkemeier and S. Peitz, “Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients,” <i>arXiv:2208.12094</i>. 2022.","chicago":"Berkemeier, Manuel Bastian, and Sebastian Peitz. “Multi-Objective Trust-Region Filter Method for Nonlinear Constraints Using Inexact Gradients.” <i>ArXiv:2208.12094</i>, 2022.","short":"M.B. Berkemeier, S. Peitz, ArXiv:2208.12094 (2022).","mla":"Berkemeier, Manuel Bastian, and Sebastian Peitz. “Multi-Objective Trust-Region Filter Method for Nonlinear Constraints Using Inexact Gradients.” <i>ArXiv:2208.12094</i>, 2022.","ama":"Berkemeier MB, Peitz S. Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients. <i>arXiv:220812094</i>. Published online 2022.","bibtex":"@article{Berkemeier_Peitz_2022, title={Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients}, journal={arXiv:2208.12094}, author={Berkemeier, Manuel Bastian and Peitz, Sebastian}, year={2022} }"},"abstract":[{"text":"In this article, we build on previous work to present an optimization algorithm for nonlinearly constrained multi-objective optimization problems. The algorithm combines a surrogate-assisted derivative-free trust-region approach with the filter method known from single-objective optimization. Instead of the true objective and constraint functions, so-called fully linear models are employed and we show how to deal with the gradient inexactness in the composite step setting, adapted from single-objective optimization as well. Under standard assumptions, we prove convergence of a subset of iterates to a quasi-stationary point and if constraint qualifications hold, then the limit point is also a KKT-point of the multi-objective problem.","lang":"eng"}],"external_id":{"arxiv":["2208.12094"]},"date_created":"2022-08-26T06:08:06Z","type":"preprint","oa":"1","department":[{"_id":"101"},{"_id":"655"}]},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"citation":{"ieee":"J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, 2022, vol. 221, p. 12:1–12:19, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","apa":"Daymude, J. J., Richa, A. W., &#38; Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i> (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>","chicago":"Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>.","short":"J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.","mla":"Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","bibtex":"@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}, volume={221}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19}, collection={LIPIcs} }","ama":"Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>"},"status":"public","editor":[{"full_name":"Aspnes, James","last_name":"Aspnes","first_name":"James"},{"last_name":"Michail","first_name":"Othon","full_name":"Michail, Othon"}],"volume":221,"user_id":"15504","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"33230","page":"12:1–12:19","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference","department":[{"_id":"79"}],"type":"conference","date_created":"2022-08-30T06:31:21Z","intvolume":"       221","date_updated":"2022-08-30T06:33:44Z","author":[{"full_name":"Daymude, Joshua J.","last_name":"Daymude","first_name":"Joshua J."},{"last_name":"Richa","first_name":"Andréa W.","full_name":"Richa, Andréa W."},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"year":"2022","title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","doi":"10.4230/LIPIcs.SAND.2022.12","language":[{"iso":"eng"}],"series_title":"LIPIcs"},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"publication":"SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022","citation":{"ama":"Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In: Agrawal K, Lee I-TA, eds. <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>. ACM; 2022:99–101. doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>","bibtex":"@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>}, booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina}, year={2022}, pages={99–101} }","mla":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:<a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>.","short":"T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.","chicago":"Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.” In <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>.","apa":"Götte, T., &#38; Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal &#38; I.-T. A. Lee (Eds.), <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i> (pp. 99–101). ACM. <a href=\"https://doi.org/10.1145/3490148.3538556\">https://doi.org/10.1145/3490148.3538556</a>","ieee":"T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,” in <i>SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022</i>, 2022, pp. 99–101, doi: <a href=\"https://doi.org/10.1145/3490148.3538556\">10.1145/3490148.3538556</a>."},"type":"conference","department":[{"_id":"79"}],"date_created":"2022-09-01T07:55:00Z","date_updated":"2022-09-01T07:57:53Z","title":"Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion","year":"2022","status":"public","author":[{"id":"34727","full_name":"Götte, Thorsten","last_name":"Götte","first_name":"Thorsten"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"user_id":"15504","doi":"10.1145/3490148.3538556","editor":[{"first_name":"Kunal","last_name":"Agrawal","full_name":"Agrawal, Kunal"},{"full_name":"Lee, I-Ting Angelina","last_name":"Lee","first_name":"I-Ting Angelina"}],"page":"99–101","publisher":"ACM","_id":"33240","language":[{"iso":"eng"}]},{"date_updated":"2022-09-07T08:56:38Z","intvolume":"       447","year":"2022","title":"Decision Support Ecosystems: Definition and Platform Architecture","author":[{"id":"39928","first_name":"Jonas","last_name":"Kirchhoff","full_name":"Kirchhoff, Jonas"},{"full_name":"Weskamp, Christoph","last_name":"Weskamp","first_name":"Christoph"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"}],"doi":"10.1007/978-3-031-06530-9_8","series_title":"Lecture Notes in Business Information Processing ","language":[{"iso":"eng"}],"abstract":[{"text":"Decision support systems are crucial in helping decision makers to quickly identify optimal business decisions in increasingly volatile and complex business environments. However, the ideal DSS for one decision maker may not optimally address the requirements for decision support of another decision maker. This is due to differences between\r\ndecision makers in business goals, regulatory restrictions or availability of resources such as data. By using a suboptimal DSS, decision makers risk implementing suboptimal decision recommendations which endanger the success of their business. This presents DSS developers with the challenge to implement a customizable DSS which can be tailored to the individual requirements for decision support of a single decision maker. In order to address this challenge, we suggest a decision support ecosystem in which DSS developers, decision makers and other domain experts collaborate using a shared platform to provide and combine reusable decision support services into a tailored DSS. The contribution of our paper is twofold: First, we define the concept of a decision support ecosystem with respect to existing digital business ecosystems and discuss expected benefits and challenges. Second, we present a reference architecture for a shared platform supporting the realization of a decision support ecosystem. We demonstrate our contributions in the example application domain of regional energy distribution network planning.","lang":"eng"}],"publication":"Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs","type":"book_chapter","department":[{"_id":"534"},{"_id":"66"}],"file":[{"date_created":"2022-04-25T11:34:18Z","creator":"jonaskir","file_id":"30942","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2022-04-25T11:34:18Z","file_name":"ICDSST22_5504_Paper.pdf","file_size":425852,"access_level":"closed"}],"date_created":"2022-04-25T11:33:09Z","has_accepted_license":"1","status":"public","conference":{"name":"8th International Conference on Decision Support System Technology (ICDSST'22)"},"ddc":["000"],"user_id":"39928","volume":447,"_id":"30941","publisher":"Springer","file_date_updated":"2022-04-25T11:34:18Z","citation":{"short":"J. Kirchhoff, C. Weskamp, G. Engels, in: Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs, Springer, 2022.","chicago":"Kirchhoff, Jonas, Christoph Weskamp, and Gregor Engels. “Decision Support Ecosystems: Definition and Platform Architecture.” In <i>Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs</i>, Vol. 447. Lecture Notes in Business Information Processing . Springer, 2022. <a href=\"https://doi.org/10.1007/978-3-031-06530-9_8\">https://doi.org/10.1007/978-3-031-06530-9_8</a>.","ieee":"J. Kirchhoff, C. Weskamp, and G. Engels, “Decision Support Ecosystems: Definition and Platform Architecture,” in <i>Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs</i>, vol. 447, Springer, 2022.","apa":"Kirchhoff, J., Weskamp, C., &#38; Engels, G. (2022). Decision Support Ecosystems: Definition and Platform Architecture. In <i>Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs</i> (Vol. 447). Springer. <a href=\"https://doi.org/10.1007/978-3-031-06530-9_8\">https://doi.org/10.1007/978-3-031-06530-9_8</a>","bibtex":"@inbook{Kirchhoff_Weskamp_Engels_2022, series={Lecture Notes in Business Information Processing }, title={Decision Support Ecosystems: Definition and Platform Architecture}, volume={447}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-06530-9_8\">10.1007/978-3-031-06530-9_8</a>}, booktitle={Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs}, publisher={Springer}, author={Kirchhoff, Jonas and Weskamp, Christoph and Engels, Gregor}, year={2022}, collection={Lecture Notes in Business Information Processing } }","ama":"Kirchhoff J, Weskamp C, Engels G. Decision Support Ecosystems: Definition and Platform Architecture. In: <i>Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs</i>. Vol 447. Lecture Notes in Business Information Processing . Springer; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-031-06530-9_8\">10.1007/978-3-031-06530-9_8</a>","mla":"Kirchhoff, Jonas, et al. “Decision Support Ecosystems: Definition and Platform Architecture.” <i>Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs</i>, vol. 447, Springer, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-031-06530-9_8\">10.1007/978-3-031-06530-9_8</a>."}}]