[{"citation":{"mla":"Hüllermeier, Eyke, et al. <i>Automated Machine Learning, Bounded Rationality, and Rational Metareasoning</i>. 2021.","apa":"Hüllermeier, E., Mohr, F., Tornede, A., &#38; Wever, M. D. (2021). <i>Automated Machine Learning, Bounded Rationality, and Rational Metareasoning</i>. ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual).","ieee":"E. Hüllermeier, F. Mohr, A. Tornede, and M. D. Wever, “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” presented at the ECML/PKDD Workshop on Automating Data Science, Bilbao (Virtual), 2021.","chicago":"Hüllermeier, Eyke, Felix Mohr, Alexander Tornede, and Marcel Dominik Wever. “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” 2021.","ama":"Hüllermeier E, Mohr F, Tornede A, Wever MD. Automated Machine Learning, Bounded Rationality, and Rational Metareasoning. In: ; 2021.","short":"E. Hüllermeier, F. Mohr, A. Tornede, M.D. Wever, in: 2021.","bibtex":"@inproceedings{Hüllermeier_Mohr_Tornede_Wever_2021, title={Automated Machine Learning, Bounded Rationality, and Rational Metareasoning}, author={Hüllermeier, Eyke and Mohr, Felix and Tornede, Alexander and Wever, Marcel Dominik}, year={2021} }"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"}],"quality_controlled":"1","date_created":"2021-08-02T07:46:29Z","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"type":"conference","author":[{"last_name":"Hüllermeier","first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129"},{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander","id":"38209"},{"full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176"}],"conference":{"end_date":"2021-09-17","location":"Bilbao (Virtual)","name":"ECML/PKDD Workshop on Automating Data Science","start_date":"2021-09-13"},"title":"Automated Machine Learning, Bounded Rationality, and Rational Metareasoning","year":"2021","status":"public","date_updated":"2022-01-06T06:55:43Z","_id":"22913","language":[{"iso":"eng"}],"user_id":"5786"},{"conference":{"name":"8th ICML Workshop on Automated Machine Learning","start_date":"2021-07-23","location":"Virtual","end_date":"2021-07-23"},"author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","id":"33176"}],"year":"2021","status":"public","title":"Replacing the Ex-Def Baseline in AutoML by Naive AutoML","date_updated":"2022-01-06T06:55:43Z","_id":"22914","language":[{"iso":"eng"}],"user_id":"5786","citation":{"chicago":"Mohr, Felix, and Marcel Dominik Wever. “Replacing the Ex-Def Baseline in AutoML by Naive AutoML,” 2021.","short":"F. Mohr, M.D. Wever, in: 2021.","ieee":"F. Mohr and M. D. Wever, “Replacing the Ex-Def Baseline in AutoML by Naive AutoML,” presented at the 8th ICML Workshop on Automated Machine Learning, Virtual, 2021.","apa":"Mohr, F., &#38; Wever, M. D. (2021). <i>Replacing the Ex-Def Baseline in AutoML by Naive AutoML</i>. 8th ICML Workshop on Automated Machine Learning, Virtual.","bibtex":"@inproceedings{Mohr_Wever_2021, title={Replacing the Ex-Def Baseline in AutoML by Naive AutoML}, author={Mohr, Felix and Wever, Marcel Dominik}, year={2021} }","ama":"Mohr F, Wever MD. Replacing the Ex-Def Baseline in AutoML by Naive AutoML. In: ; 2021.","mla":"Mohr, Felix, and Marcel Dominik Wever. <i>Replacing the Ex-Def Baseline in AutoML by Naive AutoML</i>. 2021."},"date_created":"2021-08-02T07:48:07Z","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"type":"conference"},{"citation":{"bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim, series={Leibniz International Proceedings in Informatics}, title={On Strong Observational Refinement and Forward Simulation}, booktitle={Proceedings of the 35th International Symposium on Distributed Computing (DISC)}, publisher={Schloß Dagstuhl}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, collection={Leibniz International Proceedings in Informatics} }","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. On Strong Observational Refinement and Forward Simulation. In: <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl.","mla":"Derrick, John, et al. “On Strong Observational Refinement and Forward Simulation.” <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>, Schloß Dagstuhl.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “On Strong Observational Refinement and Forward Simulation.” In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl, n.d.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Proceedings of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl, n.d.","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “On Strong Observational Refinement and Forward Simulation,” in <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (n.d.). On Strong Observational Refinement and Forward Simulation. In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Schloß Dagstuhl."},"publication":"Proceedings of the 35th International Symposium on Distributed Computing (DISC)","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"date_created":"2021-08-03T07:38:56Z","department":[{"_id":"7"}],"type":"conference","author":[{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"year":"2021","status":"public","title":"On Strong Observational Refinement and Forward Simulation","publication_status":"accepted","date_updated":"2022-01-06T06:55:43Z","series_title":"Leibniz International Proceedings in Informatics","_id":"22927","language":[{"iso":"eng"}],"publisher":"Schloß Dagstuhl","user_id":"477"},{"date_updated":"2022-01-06T06:55:44Z","publication_status":"published","title":"Concurrent model synchronisation with multiple objectives","year":"2021","status":"public","conference":{"location":"Lille, France","start_date":"2021-07-10","name":"GECCO '21: Genetic and Evolutionary Computation Conference","end_date":"2021-07-14"},"author":[{"full_name":"Weidmann, Nils","last_name":"Weidmann","first_name":"Nils","id":"53103"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"}],"doi":"10.1145/3449639.3459283","user_id":"53103","_id":"22959","language":[{"iso":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","citation":{"mla":"Weidmann, Nils, and Gregor Engels. “Concurrent Model Synchronisation with Multiple Objectives.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021, doi:<a href=\"https://doi.org/10.1145/3449639.3459283\">10.1145/3449639.3459283</a>.","bibtex":"@inproceedings{Weidmann_Engels_2021, title={Concurrent model synchronisation with multiple objectives}, DOI={<a href=\"https://doi.org/10.1145/3449639.3459283\">10.1145/3449639.3459283</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, author={Weidmann, Nils and Engels, Gregor}, year={2021} }","ama":"Weidmann N, Engels G. Concurrent model synchronisation with multiple objectives. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. ; 2021. doi:<a href=\"https://doi.org/10.1145/3449639.3459283\">10.1145/3449639.3459283</a>","ieee":"N. Weidmann and G. Engels, “Concurrent model synchronisation with multiple objectives,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Lille, France, 2021.","apa":"Weidmann, N., &#38; Engels, G. (2021). Concurrent model synchronisation with multiple objectives. In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. Lille, France. <a href=\"https://doi.org/10.1145/3449639.3459283\">https://doi.org/10.1145/3449639.3459283</a>","short":"N. Weidmann, G. Engels, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2021.","chicago":"Weidmann, Nils, and Gregor Engels. “Concurrent Model Synchronisation with Multiple Objectives.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021. <a href=\"https://doi.org/10.1145/3449639.3459283\">https://doi.org/10.1145/3449639.3459283</a>."},"type":"conference","department":[{"_id":"28"},{"_id":"66"}],"date_created":"2021-08-07T15:18:48Z"},{"type":"conference","department":[{"_id":"241"},{"_id":"662"},{"_id":"76"}],"date_created":"2021-08-09T12:01:11Z","publication":"2021 International Conference on Code Quality (ICCQ)","citation":{"chicago":"Kummita, Sriteja, Goran Piskachev, Johannes Spath, and Eric Bodden. “Qualitative and Quantitative Analysis of Callgraph Algorithms for Python.” In <i>2021 International Conference on Code Quality (ICCQ)</i>, 2021. <a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">https://doi.org/10.1109/iccq51190.2021.9392986</a>.","short":"S. Kummita, G. Piskachev, J. Spath, E. Bodden, in: 2021 International Conference on Code Quality (ICCQ), 2021.","ieee":"S. Kummita, G. Piskachev, J. Spath, and E. Bodden, “Qualitative and Quantitative Analysis of Callgraph Algorithms for Python,” 2021, doi: <a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>.","apa":"Kummita, S., Piskachev, G., Spath, J., &#38; Bodden, E. (2021). Qualitative and Quantitative Analysis of Callgraph Algorithms for Python. <i>2021 International Conference on Code Quality (ICCQ)</i>. <a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">https://doi.org/10.1109/iccq51190.2021.9392986</a>","bibtex":"@inproceedings{Kummita_Piskachev_Spath_Bodden_2021, title={Qualitative and Quantitative Analysis of Callgraph Algorithms for Python}, DOI={<a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>}, booktitle={2021 International Conference on Code Quality (ICCQ)}, author={Kummita, Sriteja and Piskachev, Goran and Spath, Johannes and Bodden, Eric}, year={2021} }","ama":"Kummita S, Piskachev G, Spath J, Bodden E. Qualitative and Quantitative Analysis of Callgraph Algorithms for Python. In: <i>2021 International Conference on Code Quality (ICCQ)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>","mla":"Kummita, Sriteja, et al. “Qualitative and Quantitative Analysis of Callgraph Algorithms for Python.” <i>2021 International Conference on Code Quality (ICCQ)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/iccq51190.2021.9392986\">10.1109/iccq51190.2021.9392986</a>."},"user_id":"5786","doi":"10.1109/iccq51190.2021.9392986","_id":"23374","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:55:50Z","status":"public","title":"Qualitative and Quantitative Analysis of Callgraph Algorithms for Python","year":"2021","author":[{"last_name":"Kummita","first_name":"Sriteja","full_name":"Kummita, Sriteja"},{"last_name":"Piskachev","first_name":"Goran","full_name":"Piskachev, Goran"},{"first_name":"Johannes","last_name":"Spath","full_name":"Spath, Johannes"},{"full_name":"Bodden, Eric","first_name":"Eric","last_name":"Bodden"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"abstract":[{"text":"Platform-based business models underlie the success of many of today’s largest, fastest-growing, and most disruptive companies. Despite the success of prominent examples, such as Uber and Airbnb, creating a profitable platform ecosystem presents a key challenge for many companies across all industries. Although research provides knowledge about platforms’ different value drivers (e.g., network effects), companies that seek to transform their current business model into a platform-based one lack an artifact to reduce knowledge boundaries, collaborate effectively, and cope with the complexities and dynamics of platform ecosystems. We address this challenge by developing two artifacts and combining research from variability modeling, business model dependencies, and system dynamics. This paper presents a design science research approach to develop the platform ecosystem modeling language and the platform ecosystem development tool that support researcher and practitioner by visualizing and simulating platform ecosystems. ","lang":"eng"}],"citation":{"ama":"Vorbohle C, Gottschalk S. Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems . In: <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. AIS.","bibtex":"@inproceedings{Vorbohle_Gottschalk, title={Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems }, booktitle={Proceedings of the 29th European Conference on Information Systems (ECIS)}, publisher={AIS}, author={Vorbohle, Christian and Gottschalk, Sebastian} }","mla":"Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems .” <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, AIS.","chicago":"Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems .” In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. AIS, n.d.","short":"C. Vorbohle, S. Gottschalk, in: Proceedings of the 29th European Conference on Information Systems (ECIS), AIS, n.d.","apa":"Vorbohle, C., &#38; Gottschalk, S. (n.d.). Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems . In <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>. Virtual Conference/Workshop: AIS.","ieee":"C. Vorbohle and S. Gottschalk, “Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ,” in <i>Proceedings of the 29th European Conference on Information Systems (ECIS)</i>, Virtual Conference/Workshop."},"publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","department":[{"_id":"66"},{"_id":"534"},{"_id":"276"}],"type":"conference","keyword":["Platform Ecosystems","Platform Ecosystem Modeling Language","Platform Ecosystem Development Tool","Business Models","Design Science"],"date_created":"2021-04-23T13:38:54Z","publication_status":"accepted","date_updated":"2022-01-06T06:55:12Z","author":[{"last_name":"Vorbohle","first_name":"Christian","full_name":"Vorbohle, Christian","id":"29951"},{"id":"47208","last_name":"Gottschalk","first_name":"Sebastian","full_name":"Gottschalk, Sebastian"}],"conference":{"location":"Virtual Conference/Workshop","name":"29th European Conference on Information Systems (ECIS)"},"status":"public","title":"Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ","year":"2021","user_id":"47208","_id":"21727","publisher":"AIS","language":[{"iso":"eng"}]},{"has_accepted_license":"1","status":"public","user_id":"35343","ddc":["000"],"publisher":"IEEE","_id":"21808","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"citation":{"bibtex":"@article{Schneider_Khalili_Manzoor_Qarawlus_Schellenberg_Karl_Hecker_2021, title={Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning}, DOI={<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>}, journal={Transactions on Network and Service Management}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Hecker, Artur}, year={2021} }","ama":"Schneider SB, Khalili R, Manzoor A, et al. Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning. <i>Transactions on Network and Service Management</i>. 2021. doi:<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>","mla":"Schneider, Stefan Balthasar, et al. “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning.” <i>Transactions on Network and Service Management</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">10.1109/TNSM.2021.3076503</a>.","short":"S.B. Schneider, R. Khalili, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, A. Hecker, Transactions on Network and Service Management (2021).","chicago":"Schneider, Stefan Balthasar, Ramin Khalili, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg, Holger Karl, and Artur Hecker. “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning.” <i>Transactions on Network and Service Management</i>, 2021. <a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">https://doi.org/10.1109/TNSM.2021.3076503</a>.","ieee":"S. B. Schneider <i>et al.</i>, “Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning,” <i>Transactions on Network and Service Management</i>, 2021.","apa":"Schneider, S. B., Khalili, R., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., &#38; Hecker, A. (2021). Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning. <i>Transactions on Network and Service Management</i>. <a href=\"https://doi.org/10.1109/TNSM.2021.3076503\">https://doi.org/10.1109/TNSM.2021.3076503</a>"},"file_date_updated":"2021-04-27T08:01:26Z","oa":"1","article_type":"original","date_updated":"2022-01-06T06:55:15Z","author":[{"id":"35343","last_name":"Schneider","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar"},{"first_name":"Ramin","last_name":"Khalili","full_name":"Khalili, Ramin"},{"first_name":"Adnan","last_name":"Manzoor","full_name":"Manzoor, Adnan"},{"full_name":"Qarawlus, Haydar","first_name":"Haydar","last_name":"Qarawlus"},{"full_name":"Schellenberg, Rafael","last_name":"Schellenberg","first_name":"Rafael"},{"full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger","id":"126"},{"last_name":"Hecker","first_name":"Artur","full_name":"Hecker, Artur"}],"title":"Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning","year":"2021","doi":"10.1109/TNSM.2021.3076503","language":[{"iso":"eng"}],"abstract":[{"text":"Modern services consist of interconnected components,e.g., microservices in a service mesh or machine learning functions in a pipeline. These services can scale and run across multiple network nodes on demand. To process incoming traffic, service components have to be instantiated and traffic assigned to these instances, taking capacities, changing demands, and Quality of Service (QoS) requirements into account. This challenge is usually solved with custom approaches designed by experts. While this typically works well for the considered scenario, the models often rely on unrealistic assumptions or on knowledge that is not available in practice (e.g., a priori knowledge).\r\n\r\nWe propose DeepCoord, a novel deep reinforcement learning approach that learns how to best coordinate services and is geared towards realistic assumptions. It interacts with the network and relies on available, possibly delayed monitoring information. Rather than defining a complex model or an algorithm on how to achieve an objective, our model-free approach adapts to various objectives and traffic patterns. An agent is trained offline without expert knowledge and then applied online with minimal overhead. Compared to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput (up to 76%) and overall network utility (more than 2x) on realworld network topologies and traffic traces. It also supports optimizing multiple, possibly competing objectives, learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic traffic, and scales to large real-world networks. For reproducibility and reuse, our code is publicly available.","lang":"eng"}],"publication":"Transactions on Network and Service Management","department":[{"_id":"75"}],"type":"journal_article","keyword":["network management","service management","coordination","reinforcement learning","self-learning","self-adaptation","multi-objective"],"date_created":"2021-04-27T08:04:16Z","file":[{"description":"Author version of the accepted paper","date_created":"2021-04-27T08:01:26Z","creator":"stschn","content_type":"application/pdf","file_id":"21809","date_updated":"2021-04-27T08:01:26Z","relation":"main_file","access_level":"open_access","file_size":4172270,"file_name":"ris-accepted-version.pdf"}]},{"date_created":"2021-04-28T18:07:56Z","type":"journal_article","department":[{"_id":"101"}],"oa":"1","publication":"Entropy","citation":{"ama":"Nüske F, Koltai P, Boninsegna L, Clementi C. Spectral Properties of Effective Dynamics from Conditional Expectations. <i>Entropy</i>. 2021. doi:<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>","bibtex":"@article{Nüske_Koltai_Boninsegna_Clementi_2021, title={Spectral Properties of Effective Dynamics from Conditional Expectations}, DOI={<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>}, number={134}, journal={Entropy}, author={Nüske, Feliks and Koltai, Péter and Boninsegna, Lorenzo and Clementi, Cecilia}, year={2021} }","mla":"Nüske, Feliks, et al. “Spectral Properties of Effective Dynamics from Conditional Expectations.” <i>Entropy</i>, 134, 2021, doi:<a href=\"https://doi.org/10.3390/e23020134\">10.3390/e23020134</a>.","short":"F. Nüske, P. Koltai, L. Boninsegna, C. Clementi, Entropy (2021).","chicago":"Nüske, Feliks, Péter Koltai, Lorenzo Boninsegna, and Cecilia Clementi. “Spectral Properties of Effective Dynamics from Conditional Expectations.” <i>Entropy</i>, 2021. <a href=\"https://doi.org/10.3390/e23020134\">https://doi.org/10.3390/e23020134</a>.","apa":"Nüske, F., Koltai, P., Boninsegna, L., &#38; Clementi, C. (2021). Spectral Properties of Effective Dynamics from Conditional Expectations. <i>Entropy</i>. <a href=\"https://doi.org/10.3390/e23020134\">https://doi.org/10.3390/e23020134</a>","ieee":"F. Nüske, P. Koltai, L. Boninsegna, and C. Clementi, “Spectral Properties of Effective Dynamics from Conditional Expectations,” <i>Entropy</i>, 2021."},"abstract":[{"lang":"eng","text":"<jats:p>The reduction of high-dimensional systems to effective models on a smaller set of variables is an essential task in many areas of science. For stochastic dynamics governed by diffusion processes, a general procedure to find effective equations is the conditioning approach. In this paper, we are interested in the spectrum of the generator of the resulting effective dynamics, and how it compares to the spectrum of the full generator. We prove a new relative error bound in terms of the eigenfunction approximation error for reversible systems. We also present numerical examples indicating that, if Kramers–Moyal (KM) type approximations are used to compute the spectrum of the reduced generator, it seems largely insensitive to the time window used for the KM estimators. We analyze the implications of these observations for systems driven by underdamped Langevin dynamics, and show how meaningful effective dynamics can be defined in this setting.</jats:p>"}],"article_number":"134","main_file_link":[{"open_access":"1","url":"https://www.mdpi.com/1099-4300/23/2/134"}],"language":[{"iso":"eng"}],"_id":"21820","user_id":"81513","doi":"10.3390/e23020134","title":"Spectral Properties of Effective Dynamics from Conditional Expectations","year":"2021","status":"public","publication_identifier":{"issn":["1099-4300"]},"author":[{"id":"81513","full_name":"Nüske, Feliks","first_name":"Feliks","last_name":"Nüske","orcid":"0000-0003-2444-7889"},{"first_name":"Péter","last_name":"Koltai","full_name":"Koltai, Péter"},{"full_name":"Boninsegna, Lorenzo","last_name":"Boninsegna","first_name":"Lorenzo"},{"full_name":"Clementi, Cecilia","first_name":"Cecilia","last_name":"Clementi"}],"publication_status":"published","date_updated":"2022-01-06T06:55:16Z"},{"language":[{"iso":"eng"}],"doi":"10.1364/josab.422731","author":[{"id":"48077","last_name":"Hammer","orcid":"0000-0002-6331-9348","first_name":"Manfred","full_name":"Hammer, Manfred"},{"first_name":"Lena","last_name":"Ebers","full_name":"Ebers, Lena","id":"40428"},{"id":"158","full_name":"Förstner, Jens","last_name":"Förstner","first_name":"Jens","orcid":"0000-0001-7059-9862"}],"publication_identifier":{"issn":["0740-3224","1520-8540"]},"title":"Resonant evanescent excitation of guided waves with high-order optical angular momentum","year":"2021","intvolume":"        38","publication_status":"published","date_updated":"2022-01-06T06:55:20Z","date_created":"2021-04-30T11:54:03Z","file":[{"creator":"fossie","date_created":"2021-04-30T11:57:14Z","date_updated":"2021-04-30T11:57:14Z","relation":"main_file","access_level":"open_access","file_size":1963211,"file_name":"oamex.pdf","content_type":"application/pdf","file_id":"21933"},{"creator":"fossie","file_id":"21934","content_type":"application/pdf","embargo":"2022-05-01","relation":"main_file","date_updated":"2021-04-30T11:59:16Z","file_size":7750006,"date_created":"2021-04-30T11:59:16Z","embargo_to":"open_access","file_name":"2021-04 Hammer - JOSA B - Resonant evanescent excitation of guides waves with high-order angular momentum.pdf","access_level":"local"}],"department":[{"_id":"61"},{"_id":"230"}],"keyword":["tet_topic_waveguides"],"type":"journal_article","issue":"5","publication":"Journal of the Optical Society of America B","abstract":[{"lang":"eng","text":"Gaussian-beam-like bundles of semi-guided waves propagating in a dielectric slab can excite modes with high-order optical angular momentum supported by a circular fiber. We consider a multimode step-index fiber with a high-index coating, where the waves in the slab are evanescently coupled to the modes of the fiber. Conditions for effective resonant interaction are identified. Based on a hybrid analytical–numerical coupled mode model, our simulations predict that substantial fractions of the input power can be focused into waves with specific orbital angular momentum, of excellent purity, with a clear distinction between degenerate modes with opposite vorticity."}],"_id":"21932","page":"1717","volume":38,"user_id":"158","ddc":["530"],"status":"public","has_accepted_license":"1","oa":"1","citation":{"apa":"Hammer, M., Ebers, L., &#38; Förstner, J. (2021). Resonant evanescent excitation of guided waves with high-order optical angular momentum. <i>Journal of the Optical Society of America B</i>, <i>38</i>(5), 1717. <a href=\"https://doi.org/10.1364/josab.422731\">https://doi.org/10.1364/josab.422731</a>","ieee":"M. Hammer, L. Ebers, and J. Förstner, “Resonant evanescent excitation of guided waves with high-order optical angular momentum,” <i>Journal of the Optical Society of America B</i>, vol. 38, no. 5, p. 1717, 2021.","chicago":"Hammer, Manfred, Lena Ebers, and Jens Förstner. “Resonant Evanescent Excitation of Guided Waves with High-Order Optical Angular Momentum.” <i>Journal of the Optical Society of America B</i> 38, no. 5 (2021): 1717. <a href=\"https://doi.org/10.1364/josab.422731\">https://doi.org/10.1364/josab.422731</a>.","short":"M. Hammer, L. Ebers, J. Förstner, Journal of the Optical Society of America B 38 (2021) 1717.","mla":"Hammer, Manfred, et al. “Resonant Evanescent Excitation of Guided Waves with High-Order Optical Angular Momentum.” <i>Journal of the Optical Society of America B</i>, vol. 38, no. 5, 2021, p. 1717, doi:<a href=\"https://doi.org/10.1364/josab.422731\">10.1364/josab.422731</a>.","ama":"Hammer M, Ebers L, Förstner J. Resonant evanescent excitation of guided waves with high-order optical angular momentum. <i>Journal of the Optical Society of America B</i>. 2021;38(5):1717. doi:<a href=\"https://doi.org/10.1364/josab.422731\">10.1364/josab.422731</a>","bibtex":"@article{Hammer_Ebers_Förstner_2021, title={Resonant evanescent excitation of guided waves with high-order optical angular momentum}, volume={38}, DOI={<a href=\"https://doi.org/10.1364/josab.422731\">10.1364/josab.422731</a>}, number={5}, journal={Journal of the Optical Society of America B}, author={Hammer, Manfred and Ebers, Lena and Förstner, Jens}, year={2021}, pages={1717} }"},"file_date_updated":"2021-04-30T11:59:16Z","project":[{"_id":"56","name":"TRR 142 - Project Area C"},{"_id":"53","name":"TRR 142"},{"name":"TRR 142 - Subproject C5","_id":"75"}]},{"date_created":"2021-05-07T07:33:54Z","type":"conference","department":[{"_id":"49"}],"citation":{"mla":"Zeipert, Henning, et al. <i>Measurement and Simulation of Lamb Waves in Adhesive-Bonded Multilayer Systems</i>. 2021, pp. 91–92, doi:<a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">10.5162/SMSI2021/A8.2</a>.","ama":"Zeipert H, Claes L, Johannesmann S, et al. Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems. In: ; 2021:91-92. doi:<a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">10.5162/SMSI2021/A8.2</a>","bibtex":"@inproceedings{Zeipert_Claes_Johannesmann_Webersen_Lugovtsova_Prager_Henning_2021, title={Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems}, DOI={<a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">10.5162/SMSI2021/A8.2</a>}, author={Zeipert, Henning and Claes, Leander and Johannesmann, Sarah and Webersen, Manuel and Lugovtsova, Yevgeniya and Prager, Jens and Henning, Bernd}, year={2021}, pages={91–92} }","apa":"Zeipert, H., Claes, L., Johannesmann, S., Webersen, M., Lugovtsova, Y., Prager, J., &#38; Henning, B. (2021). Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems (pp. 91–92). Presented at the Sensor and Measurement Science International, Nürnberg. <a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">https://doi.org/10.5162/SMSI2021/A8.2</a>","ieee":"H. Zeipert <i>et al.</i>, “Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems,” presented at the Sensor and Measurement Science International, Nürnberg, 2021, pp. 91–92.","short":"H. Zeipert, L. Claes, S. Johannesmann, M. Webersen, Y. Lugovtsova, J. Prager, B. Henning, in: 2021, pp. 91–92.","chicago":"Zeipert, Henning, Leander Claes, Sarah Johannesmann, Manuel Webersen, Yevgeniya Lugovtsova, Jens Prager, and Bernd Henning. “Measurement and Simulation of Lamb Waves in Adhesive-Bonded Multilayer Systems,” 91–92, 2021. <a href=\"https://doi.org/10.5162/SMSI2021/A8.2\">https://doi.org/10.5162/SMSI2021/A8.2</a>."},"project":[{"grant_number":"449607253","_id":"105","name":"Vermiedene Kreuzungen von Lamb-Wellenmoden in mehrlagigen Strukturen"}],"page":"91 - 92","language":[{"iso":"eng"}],"_id":"22013","doi":"10.5162/SMSI2021/A8.2","user_id":"32580","year":"2021","status":"public","title":"Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems","conference":{"location":"Nürnberg","name":"Sensor and Measurement Science International"},"author":[{"last_name":"Zeipert","first_name":"Henning","full_name":"Zeipert, Henning","id":"32580"},{"full_name":"Claes, Leander","last_name":"Claes","orcid":"0000-0002-4393-268X","first_name":"Leander","id":"11829"},{"full_name":"Johannesmann, Sarah","first_name":"Sarah","last_name":"Johannesmann","id":"29190"},{"full_name":"Webersen, Manuel","last_name":"Webersen","orcid":"0000-0001-6411-4232","first_name":"Manuel","id":"11289"},{"last_name":"Lugovtsova","first_name":"Yevgeniya","full_name":"Lugovtsova, Yevgeniya"},{"full_name":"Prager, Jens","last_name":"Prager","first_name":"Jens"},{"full_name":"Henning, Bernd","last_name":"Henning","first_name":"Bernd","id":"213"}],"date_updated":"2022-01-06T06:55:22Z"},{"has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"36113","_id":"22057","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"file_date_updated":"2021-05-10T16:02:02Z","citation":{"apa":"Jager, T., Kurek, R., &#38; Niehues, D. (2021). Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>","ieee":"T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","chicago":"Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">https://doi.org/10.1007/978-3-030-75245-3_22</a>.","short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.","mla":"Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>.","ama":"Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>","bibtex":"@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75245-3_22\">10.1007/978-3-030-75245-3_22</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek, Rafael and Niehues, David}, year={2021} }"},"place":"Cham","date_updated":"2022-01-06T06:55:23Z","publication_status":"published","year":"2021","title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752446","9783030752453"]},"author":[{"last_name":"Jager","first_name":"Tibor","full_name":"Jager, Tibor"},{"last_name":"Kurek","first_name":"Rafael","full_name":"Kurek, Rafael"},{"id":"36113","full_name":"Niehues, David","last_name":"Niehues","first_name":"David"}],"doi":"10.1007/978-3-030-75245-3_22","language":[{"iso":"eng"}],"abstract":[{"text":"We construct more efficient cryptosystems with provable\r\nsecurity against adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient, selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal, Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n– Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption, has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves full adaptive security with\r\npublic parameters of size only O(log λ). The other is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext is\r\nonly a single group element and the security reduction is quadrat-\r\nically tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n– A very efficient adaptively-secure verifiable random function where\r\nproofs, public keys, and secret keys have size O(log λ).\r\nAs a technical contribution we introduce blockwise partitioning, which\r\nleverages the assumption that a cryptographic hash function is weak\r\nnear-collision resistant to prove full adaptive security of cryptosystems.","lang":"eng"}],"publication":"Public-Key Cryptography – PKC 2021","type":"book_chapter","department":[{"_id":"558"}],"file":[{"creator":"davnie","date_created":"2021-05-10T16:02:02Z","date_updated":"2021-05-10T16:02:02Z","relation":"main_file","file_size":701068,"access_level":"closed","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","content_type":"application/pdf","file_id":"22058"}],"date_created":"2021-05-10T15:56:24Z"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"file_date_updated":"2021-05-10T16:09:17Z","citation":{"mla":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” <i>Public-Key Cryptography – PKC 2021</i>, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>.","ama":"Niehues D. Verifiable Random Functions with Optimal Tightness. In: <i>Public-Key Cryptography – PKC 2021</i>. Cham; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>","bibtex":"@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions with Optimal Tightness}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">10.1007/978-3-030-75248-4_3</a>}, booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021} }","apa":"Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In <i>Public-Key Cryptography – PKC 2021</i>. Cham. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>","ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 2021.","chicago":"Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In <i>Public-Key Cryptography – PKC 2021</i>. Cham, 2021. <a href=\"https://doi.org/10.1007/978-3-030-75248-4_3\">https://doi.org/10.1007/978-3-030-75248-4_3</a>.","short":"D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021."},"place":"Cham","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"36113","_id":"22059","abstract":[{"text":"Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan (FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public verification key and proofs accompanying the\r\noutput enable all parties to verify the correctness of the output. How-\r\never, all known standard model VRFs have a reduction loss that is much\r\nworse than what one would expect from known optimal constructions of\r\nclosely related primitives like unique signatures. We show that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries. To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16) to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We answer this ques-\r\ntion in the affirmative by presenting the first VRF with a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability of tight verifiable\r\nrandom functions: We show that a security loss of Q is unavoidable and\r\npresent the first construction that achieves this bound.","lang":"eng"}],"publication":"Public-Key Cryptography – PKC 2021","type":"book_chapter","department":[{"_id":"558"}],"file":[{"content_type":"application/pdf","file_id":"22060","date_updated":"2021-05-10T16:09:17Z","relation":"main_file","access_level":"closed","file_size":697361,"file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","date_created":"2021-05-10T16:09:17Z","creator":"davnie"}],"date_created":"2021-05-10T16:07:50Z","date_updated":"2022-01-06T06:55:24Z","publication_status":"published","year":"2021","title":"Verifiable Random Functions with Optimal Tightness","author":[{"last_name":"Niehues","first_name":"David","full_name":"Niehues, David","id":"36113"}],"publication_identifier":{"isbn":["9783030752477","9783030752484"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-030-75248-4_3","language":[{"iso":"eng"}]},{"year":"2021","title":"An efficient descent method for locally Lipschitz multiobjective optimization problems","author":[{"last_name":"Gebken","first_name":"Bennet","full_name":"Gebken, Bennet","id":"32643"},{"last_name":"Peitz","first_name":"Sebastian","orcid":"0000-0002-3389-793X","full_name":"Peitz, Sebastian","id":"47427"}],"date_updated":"2022-01-06T06:52:57Z","publication_status":"published","intvolume":"       188","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10957-020-01803-w.pdf","open_access":"1"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10957-020-01803-w","publication":"Journal of Optimization Theory and Applications","abstract":[{"lang":"eng","text":"In this article, we present an efficient descent method for locally Lipschitz\r\ncontinuous multiobjective optimization problems (MOPs). The method is realized\r\nby combining a theoretical result regarding the computation of descent\r\ndirections for nonsmooth MOPs with a practical method to approximate the\r\nsubdifferentials of the objective functions. We show convergence to points\r\nwhich satisfy a necessary condition for Pareto optimality. Using a set of test\r\nproblems, we compare our method to the multiobjective proximal bundle method by\r\nM\\\"akel\\\"a. The results indicate that our method is competitive while being\r\neasier to implement. While the number of objective function evaluations is\r\nlarger, the overall number of subgradient evaluations is lower. Finally, we\r\nshow that our method can be combined with a subdivision algorithm to compute\r\nentire Pareto sets of nonsmooth MOPs."}],"date_created":"2020-04-27T09:11:22Z","type":"journal_article","department":[{"_id":"101"}],"status":"public","page":"696-723","_id":"16867","user_id":"47427","volume":188,"citation":{"mla":"Gebken, Bennet, and Sebastian Peitz. “An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems.” <i>Journal of Optimization Theory and Applications</i>, vol. 188, 2021, pp. 696–723, doi:<a href=\"https://doi.org/10.1007/s10957-020-01803-w\">10.1007/s10957-020-01803-w</a>.","bibtex":"@article{Gebken_Peitz_2021, title={An efficient descent method for locally Lipschitz multiobjective optimization problems}, volume={188}, DOI={<a href=\"https://doi.org/10.1007/s10957-020-01803-w\">10.1007/s10957-020-01803-w</a>}, journal={Journal of Optimization Theory and Applications}, author={Gebken, Bennet and Peitz, Sebastian}, year={2021}, pages={696–723} }","ama":"Gebken B, Peitz S. An efficient descent method for locally Lipschitz multiobjective optimization problems. <i>Journal of Optimization Theory and Applications</i>. 2021;188:696-723. doi:<a href=\"https://doi.org/10.1007/s10957-020-01803-w\">10.1007/s10957-020-01803-w</a>","ieee":"B. Gebken and S. Peitz, “An efficient descent method for locally Lipschitz multiobjective optimization problems,” <i>Journal of Optimization Theory and Applications</i>, vol. 188, pp. 696–723, 2021.","apa":"Gebken, B., &#38; Peitz, S. (2021). An efficient descent method for locally Lipschitz multiobjective optimization problems. <i>Journal of Optimization Theory and Applications</i>, <i>188</i>, 696–723. <a href=\"https://doi.org/10.1007/s10957-020-01803-w\">https://doi.org/10.1007/s10957-020-01803-w</a>","chicago":"Gebken, Bennet, and Sebastian Peitz. “An Efficient Descent Method for Locally Lipschitz Multiobjective Optimization Problems.” <i>Journal of Optimization Theory and Applications</i> 188 (2021): 696–723. <a href=\"https://doi.org/10.1007/s10957-020-01803-w\">https://doi.org/10.1007/s10957-020-01803-w</a>.","short":"B. Gebken, S. Peitz, Journal of Optimization Theory and Applications 188 (2021) 696–723."},"oa":"1"},{"date_created":"2020-03-13T12:45:05Z","department":[{"_id":"101"}],"type":"journal_article","publication":"Journal of Global Optimization","abstract":[{"lang":"eng","text":"It is a challenging task to identify the objectives on which a certain decision was based, in particular if several, potentially conflicting criteria are equally important and a continuous set of optimal compromise decisions exists. This task can be understood as the inverse problem of multiobjective optimization, where the goal is to find the objective function vector of a given Pareto set. To this end, we present a method to construct the objective function vector of an unconstrained multiobjective optimization problem (MOP) such that the Pareto critical set contains a given set of data points with prescribed KKT multipliers. If such an MOP can not be found, then the method instead produces an MOP whose Pareto critical set is at least close to the data points. The key idea is to consider the objective function vector in the multiobjective KKT conditions as variable and then search for the objectives that minimize the Euclidean norm of the resulting system of equations. By expressing the objectives in a finite-dimensional basis, we transform this problem into a homogeneous, linear system of equations that can be solved efficiently. Potential applications of this approach include the identification of objectives (both from clean and noisy data) and the construction of surrogate models for expensive MOPs."}],"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10898-020-00983-z.pdf","open_access":"1"}],"doi":"10.1007/s10898-020-00983-z","author":[{"id":"32643","full_name":"Gebken, Bennet","first_name":"Bennet","last_name":"Gebken"},{"id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz"}],"year":"2021","title":"Inverse multiobjective optimization: Inferring decision criteria from data","intvolume":"        80","date_updated":"2022-01-06T06:52:48Z","oa":"1","citation":{"mla":"Gebken, Bennet, and Sebastian Peitz. “Inverse Multiobjective Optimization: Inferring Decision Criteria from Data.” <i>Journal of Global Optimization</i>, vol. 80, Springer, 2021, pp. 3–29, doi:<a href=\"https://doi.org/10.1007/s10898-020-00983-z\">10.1007/s10898-020-00983-z</a>.","ama":"Gebken B, Peitz S. Inverse multiobjective optimization: Inferring decision criteria from data. <i>Journal of Global Optimization</i>. 2021;80:3-29. doi:<a href=\"https://doi.org/10.1007/s10898-020-00983-z\">10.1007/s10898-020-00983-z</a>","bibtex":"@article{Gebken_Peitz_2021, title={Inverse multiobjective optimization: Inferring decision criteria from data}, volume={80}, DOI={<a href=\"https://doi.org/10.1007/s10898-020-00983-z\">10.1007/s10898-020-00983-z</a>}, journal={Journal of Global Optimization}, publisher={Springer}, author={Gebken, Bennet and Peitz, Sebastian}, year={2021}, pages={3–29} }","apa":"Gebken, B., &#38; Peitz, S. (2021). Inverse multiobjective optimization: Inferring decision criteria from data. <i>Journal of Global Optimization</i>, <i>80</i>, 3–29. <a href=\"https://doi.org/10.1007/s10898-020-00983-z\">https://doi.org/10.1007/s10898-020-00983-z</a>","ieee":"B. Gebken and S. Peitz, “Inverse multiobjective optimization: Inferring decision criteria from data,” <i>Journal of Global Optimization</i>, vol. 80, pp. 3–29, 2021.","chicago":"Gebken, Bennet, and Sebastian Peitz. “Inverse Multiobjective Optimization: Inferring Decision Criteria from Data.” <i>Journal of Global Optimization</i> 80 (2021): 3–29. <a href=\"https://doi.org/10.1007/s10898-020-00983-z\">https://doi.org/10.1007/s10898-020-00983-z</a>.","short":"B. Gebken, S. Peitz, Journal of Global Optimization 80 (2021) 3–29."},"_id":"16295","publisher":"Springer","page":"3-29","volume":80,"user_id":"47427","status":"public"},{"place":"Pforzheim","citation":{"apa":"Krauter, S., &#38; Khatibi, A. (2021). Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands. <i>Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. </i>, 301–304.","ieee":"S. Krauter and A. Khatibi, “Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands,” in <i>Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. </i>, Staffelstein / online, 2021, pp. 301–304.","chicago":"Krauter, Stefan, and Arash Khatibi. “Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands.” In <i>Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. </i>, 301–4. Pforzheim: Conexio, 2021.","short":"S. Krauter, A. Khatibi, in: Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. , Conexio, Pforzheim, 2021, pp. 301–304.","mla":"Krauter, Stefan, and Arash Khatibi. “Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands.” <i>Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. </i>, Conexio, 2021, pp. 301–04.","ama":"Krauter S, Khatibi A. Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands. In: <i>Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. </i>. Conexio; 2021:301-304.","bibtex":"@inproceedings{Krauter_Khatibi_2021, place={Pforzheim}, title={Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands}, booktitle={Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. }, publisher={Conexio}, author={Krauter, Stefan and Khatibi, Arash}, year={2021}, pages={301–304} }"},"file_date_updated":"2022-01-06T11:44:09Z","user_id":"28836","ddc":["620"],"_id":"22217","publisher":"Conexio","page":"301-304","has_accepted_license":"1","conference":{"location":"Staffelstein / online","start_date":"2021-05-18","name":"36. PV-Symposium, 18.-26 Mai 2021","end_date":"2021-05-26"},"status":"public","department":[{"_id":"53"}],"type":"conference","date_created":"2021-05-20T09:51:14Z","file":[{"content_type":"application/pdf","success":1,"file_id":"29169","file_size":3540634,"access_level":"closed","file_name":"Staffelstein 2021 Krauter Khatibi S.301-304.pdf","date_updated":"2022-01-06T11:44:09Z","relation":"main_file","date_created":"2022-01-06T11:44:09Z","creator":"krauter"}],"publication":"Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. ","language":[{"iso":"ger"}],"publication_status":"published","date_updated":"2022-01-06T11:46:47Z","author":[{"id":"28836","full_name":"Krauter, Stefan","orcid":"0000-0002-3594-260X","first_name":"Stefan","last_name":"Krauter"},{"last_name":"Khatibi","first_name":"Arash","full_name":"Khatibi, Arash","id":"43538"}],"publication_identifier":{"isbn":["978-3-948176-14-3"]},"title":"Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands","year":"2021"},{"date_created":"2021-05-04T14:18:46Z","department":[{"_id":"78"}],"type":"conference","citation":{"ama":"Witschen LM, Wiersema T, Raeisi Nafchi M, Bockhorn A, Platzner M. Timing Optimization for Virtual FPGA Configurations. In: Hannig F, Derrien S, Diniz P, Chillet D, eds. <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>. Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science. doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>","bibtex":"@inproceedings{Witschen_Wiersema_Raeisi Nafchi_Bockhorn_Platzner, series={Reconfigurable Computing: Architectures, Tools, and Applications}, title={Timing Optimization for Virtual FPGA Configurations}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>}, booktitle={Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)}, publisher={Springer Lecture Notes in Computer Science}, author={Witschen, Linus Matthias and Wiersema, Tobias and Raeisi Nafchi, Masood and Bockhorn, Arne and Platzner, Marco}, editor={Hannig, Frank and Derrien, Steven and Diniz, Pedro and Chillet, Daniel}, collection={Reconfigurable Computing: Architectures, Tools, and Applications} }","mla":"Witschen, Linus Matthias, et al. “Timing Optimization for Virtual FPGA Configurations.” <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, edited by Frank Hannig et al., Springer Lecture Notes in Computer Science, doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Masood Raeisi Nafchi, Arne Bockhorn, and Marco Platzner. “Timing Optimization for Virtual FPGA Configurations.” In <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, edited by Frank Hannig, Steven Derrien, Pedro Diniz, and Daniel Chillet. Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science, n.d. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">https://doi.org/10.1007/978-3-030-79025-7_4</a>.","short":"L.M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, M. Platzner, in: F. Hannig, S. Derrien, P. Diniz, D. Chillet (Eds.), Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21), Springer Lecture Notes in Computer Science, n.d.","apa":"Witschen, L. M., Wiersema, T., Raeisi Nafchi, M., Bockhorn, A., &#38; Platzner, M. (n.d.). Timing Optimization for Virtual FPGA Configurations. In F. Hannig, S. Derrien, P. Diniz, &#38; D. Chillet (Eds.), <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>. Springer Lecture Notes in Computer Science. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">https://doi.org/10.1007/978-3-030-79025-7_4</a>","ieee":"L. M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, and M. Platzner, “Timing Optimization for Virtual FPGA Configurations,” in <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, Virtual conference, doi: <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>."},"publication":"Proceedings of International Symposium on Applied Reconfigurable Computing (ARC'21)","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"21953","language":[{"iso":"eng"}],"publisher":"Springer Lecture Notes in Computer Science","series_title":"Reconfigurable Computing: Architectures, Tools, and Applications","editor":[{"full_name":"Hannig, Frank","first_name":"Frank","last_name":"Hannig"},{"last_name":"Derrien","first_name":"Steven","full_name":"Derrien, Steven"},{"full_name":"Diniz, Pedro","first_name":"Pedro","last_name":"Diniz"},{"full_name":"Chillet, Daniel","last_name":"Chillet","first_name":"Daniel"}],"user_id":"3118","doi":"10.1007/978-3-030-79025-7_4","author":[{"id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias","last_name":"Witschen"},{"id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias","last_name":"Wiersema"},{"full_name":"Raeisi Nafchi, Masood","last_name":"Raeisi Nafchi","first_name":"Masood"},{"first_name":"Arne","last_name":"Bockhorn","full_name":"Bockhorn, Arne"},{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"}],"conference":{"end_date":"2021-07-01","location":"Virtual conference","name":"International Symposium on Applied Reconfigurable Computing","start_date":"2021-06-29"},"title":"Timing Optimization for Virtual FPGA Configurations","year":"2021","status":"public","publication_status":"accepted","date_updated":"2022-02-14T11:03:09Z"},{"_id":"29235","publisher":"Springer","page":"205–220","editor":[{"last_name":"Wang","first_name":"Xiaofeng","full_name":"Wang, Xiaofeng"},{"full_name":"Martini, Antonio","last_name":"Martini","first_name":"Antonio"},{"full_name":"Nguyen-Duc, Anh","first_name":"Anh","last_name":"Nguyen-Duc"},{"full_name":"Stray, Viktoria","last_name":"Stray","first_name":"Viktoria"}],"volume":434,"user_id":"47208","status":"public","citation":{"mla":"Gottschalk, Sebastian, et al. “Design Principles for a Crowd-Based Prototype Validation Platform.” <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>, edited by Xiaofeng Wang et al., vol. 434, Springer, 2021, pp. 205–220, doi:<a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>.","ama":"Gottschalk S, Aziz MS, Yigitbas E, Engels G. Design Principles for a Crowd-Based Prototype Validation Platform. In: Wang X, Martini A, Nguyen-Duc A, Stray V, eds. <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>. Vol 434. Lecture Notes in Business Information Processing. Springer; 2021:205–220. doi:<a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>","bibtex":"@inproceedings{Gottschalk_Aziz_Yigitbas_Engels_2021, series={Lecture Notes in Business Information Processing}, title={Design Principles for a Crowd-Based Prototype Validation Platform}, volume={434}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>}, booktitle={Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings}, publisher={Springer}, author={Gottschalk, Sebastian and Aziz, Muhammad Suffyan and Yigitbas, Enes and Engels, Gregor}, editor={Wang, Xiaofeng and Martini, Antonio and Nguyen-Duc, Anh and Stray, Viktoria}, year={2021}, pages={205–220}, collection={Lecture Notes in Business Information Processing} }","apa":"Gottschalk, S., Aziz, M. S., Yigitbas, E., &#38; Engels, G. (2021). Design Principles for a Crowd-Based Prototype Validation Platform. In X. Wang, A. Martini, A. Nguyen-Duc, &#38; V. Stray (Eds.), <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i> (Vol. 434, pp. 205–220). Springer. <a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">https://doi.org/10.1007/978-3-030-91983-2_16</a>","ieee":"S. Gottschalk, M. S. Aziz, E. Yigitbas, and G. Engels, “Design Principles for a Crowd-Based Prototype Validation Platform,” in <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>, 2021, vol. 434, pp. 205–220, doi: <a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">10.1007/978-3-030-91983-2_16</a>.","short":"S. Gottschalk, M.S. Aziz, E. Yigitbas, G. Engels, in: X. Wang, A. Martini, A. Nguyen-Duc, V. Stray (Eds.), Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings, Springer, 2021, pp. 205–220.","chicago":"Gottschalk, Sebastian, Muhammad Suffyan Aziz, Enes Yigitbas, and Gregor Engels. “Design Principles for a Crowd-Based Prototype Validation Platform.” In <i>Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings</i>, edited by Xiaofeng Wang, Antonio Martini, Anh Nguyen-Duc, and Viktoria Stray, 434:205–220. Lecture Notes in Business Information Processing. Springer, 2021. <a href=\"https://doi.org/10.1007/978-3-030-91983-2_16\">https://doi.org/10.1007/978-3-030-91983-2_16</a>."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Business Information Processing","doi":"10.1007/978-3-030-91983-2_16","author":[{"id":"47208","first_name":"Sebastian","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian"},{"first_name":"Muhammad Suffyan","last_name":"Aziz","full_name":"Aziz, Muhammad Suffyan"},{"full_name":"Yigitbas, Enes","last_name":"Yigitbas","first_name":"Enes","orcid":"0000-0002-5967-833X","id":"8447"},{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"}],"title":"Design Principles for a Crowd-Based Prototype Validation Platform","year":"2021","intvolume":"       434","date_updated":"2022-02-15T07:32:52Z","date_created":"2022-01-11T12:43:22Z","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","publication":"Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings"},{"user_id":"47208","_id":"25528","language":[{"iso":"eng"}],"publisher":"Springer","date_updated":"2022-02-15T08:36:09Z","author":[{"last_name":"Gottschalk","first_name":"Sebastian","full_name":"Gottschalk, Sebastian","id":"47208"},{"id":"8447","full_name":"Yigitbas, Enes","last_name":"Yigitbas","first_name":"Enes","orcid":"0000-0002-5967-833X"},{"full_name":"Nowosad, Alexander","last_name":"Nowosad","first_name":"Alexander"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"conference":{"end_date":"2021-11-26","location":"Turin","start_date":"2021-11-25","name":"22nd International Conference on Product-Focused Software Process Improvement"},"title":"Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods","year":"2021","status":"public","department":[{"_id":"66"}],"keyword":["Business Model Development","Situational Method Engineering","Lean Development","Kanban Boards","Canvas Models"],"type":"book_chapter","date_created":"2021-10-05T20:11:09Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"abstract":[{"lang":"eng","text":"Developing effective business models is a complex process for a company where several tasks (e.g., conduct customer interviews) need to be accomplished, and decisions (e.g., advertisement as a revenue stream) must be made. Here, domain experts can guide the choices of tasks and decisions with their knowledge. Nevertheless, this knowledge needs to match the situation of the company (e.g., financial resources) and the application domain of the product/service (e.g., mobile app) to reduce the risk of developing ineffective business models with low market penetration. This is not covered by one-size-fits-all development methods without tailoring before the enaction.\r\nTherefore, we conduct a design science study to create a situation-specific development approach for business models. Based on situational method engineering and our previous work in storing knowledge of methods and models in distinct repositories, this paper shows the situation-specific composition and enaction of business model development methods. First, the method engineer composes the development method out of both repositories based on the situational context. Second, the business developer enacts the method and develops the business model.  We implement the approach in a tool and evaluate it with a industrial case study on mobile apps."}],"citation":{"chicago":"Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels. “Situation- and  Domain-Specific Composition and Enactment of Business Model Development Methods.” In <i>Product-Focused Software Process Improvement</i>. Springer, 2021.","short":"S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Product-Focused Software Process Improvement, Springer, 2021.","apa":"Gottschalk, S., Yigitbas, E., Nowosad, A., &#38; Engels, G. (2021). Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods. In <i>Product-focused Software Process Improvement</i>. 22nd International Conference on Product-Focused Software Process Improvement, Turin. Springer.","ieee":"S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods,” in <i>Product-focused Software Process Improvement</i>, Springer, 2021.","ama":"Gottschalk S, Yigitbas E, Nowosad A, Engels G. Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods. In: <i>Product-Focused Software Process Improvement</i>. Springer; 2021.","bibtex":"@inbook{Gottschalk_Yigitbas_Nowosad_Engels_2021, title={Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods}, booktitle={Product-focused Software Process Improvement}, publisher={Springer}, author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2021} }","mla":"Gottschalk, Sebastian, et al. “Situation- and  Domain-Specific Composition and Enactment of Business Model Development Methods.” <i>Product-Focused Software Process Improvement</i>, Springer, 2021."},"publication":"Product-focused Software Process Improvement"},{"date_created":"2022-02-18T14:23:49Z","department":[{"_id":"52"}],"type":"book","citation":{"short":"D. Schröder, J. Böcker, Elektrische Antriebe – Regelung von Antriebssystemen, 5th ed., Springer Nature, 2021.","chicago":"Schröder, Dierk, and Joachim Böcker. <i>Elektrische Antriebe – Regelung von Antriebssystemen</i>. 5th ed. Springer Nature, 2021. <a href=\"https://doi.org/10.1007/978-3-662-62700-6\">https://doi.org/10.1007/978-3-662-62700-6</a>.","ieee":"D. Schröder and J. Böcker, <i>Elektrische Antriebe – Regelung von Antriebssystemen</i>, 5th ed. Springer Nature, 2021.","apa":"Schröder, D., &#38; Böcker, J. (2021). <i>Elektrische Antriebe – Regelung von Antriebssystemen</i> (5th ed.). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-62700-6\">https://doi.org/10.1007/978-3-662-62700-6</a>","bibtex":"@book{Schröder_Böcker_2021, edition={5}, title={Elektrische Antriebe – Regelung von Antriebssystemen}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-62700-6\">10.1007/978-3-662-62700-6</a>}, publisher={Springer Nature}, author={Schröder, Dierk and Böcker, Joachim}, year={2021} }","ama":"Schröder D, Böcker J. <i>Elektrische Antriebe – Regelung von Antriebssystemen</i>. 5th ed. Springer Nature; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-662-62700-6\">10.1007/978-3-662-62700-6</a>","mla":"Schröder, Dierk, and Joachim Böcker. <i>Elektrische Antriebe – Regelung von Antriebssystemen</i>. 5th ed., Springer Nature, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-662-62700-6\">10.1007/978-3-662-62700-6</a>."},"_id":"29876","language":[{"iso":"ger"}],"edition":"5","publisher":"Springer Nature","main_file_link":[{"url":"https://link.springer.com/book/10.1007/978-3-662-62700-6"}],"page":"1625","ddc":["620"],"doi":"10.1007/978-3-662-62700-6","user_id":"66","author":[{"full_name":"Schröder, Dierk","last_name":"Schröder","first_name":"Dierk"},{"last_name":"Böcker","orcid":"0000-0002-8480-7295","first_name":"Joachim","full_name":"Böcker, Joachim","id":"66"}],"publication_identifier":{"isbn":["978-3-662-62699-3"],"eisbn":["978-3-662-62700-6"]},"status":"public","title":"Elektrische Antriebe – Regelung von Antriebssystemen","year":"2021","date_updated":"2022-02-19T09:40:55Z","publication_status":"published"},{"author":[{"id":"22556","full_name":"Strothmann, Benjamin","last_name":"Strothmann","first_name":"Benjamin"},{"id":"71291","first_name":"Frank","last_name":"Schafmeister","full_name":"Schafmeister, Frank"},{"last_name":"Böcker","first_name":"Joachim","orcid":"0000-0002-8480-7295","full_name":"Böcker, Joachim","id":"66"}],"status":"public","title":"Common-Mode-Free Bidirectional Three-Phase PFC-Rectifier for Non-Isolated EV Charger","year":"2021","date_updated":"2022-02-21T19:25:17Z","publication_status":"published","publisher":"IEEE","_id":"29849","language":[{"iso":"eng"}],"doi":"10.1109/apec42165.2021.9487462","user_id":"66","citation":{"ama":"Strothmann B, Schafmeister F, Böcker J. Common-Mode-Free Bidirectional Three-Phase PFC-Rectifier for Non-Isolated EV Charger. In: <i>2021 IEEE Applied Power Electronics Conference and Exposition (APEC)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/apec42165.2021.9487462\">10.1109/apec42165.2021.9487462</a>","bibtex":"@inproceedings{Strothmann_Schafmeister_Böcker_2021, title={Common-Mode-Free Bidirectional Three-Phase PFC-Rectifier for Non-Isolated EV Charger}, DOI={<a href=\"https://doi.org/10.1109/apec42165.2021.9487462\">10.1109/apec42165.2021.9487462</a>}, booktitle={2021 IEEE Applied Power Electronics Conference and Exposition (APEC)}, publisher={IEEE}, author={Strothmann, Benjamin and Schafmeister, Frank and Böcker, Joachim}, year={2021} }","mla":"Strothmann, Benjamin, et al. “Common-Mode-Free Bidirectional Three-Phase PFC-Rectifier for Non-Isolated EV Charger.” <i>2021 IEEE Applied Power Electronics Conference and Exposition (APEC)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/apec42165.2021.9487462\">10.1109/apec42165.2021.9487462</a>.","short":"B. Strothmann, F. Schafmeister, J. Böcker, in: 2021 IEEE Applied Power Electronics Conference and Exposition (APEC), IEEE, 2021.","chicago":"Strothmann, Benjamin, Frank Schafmeister, and Joachim Böcker. “Common-Mode-Free Bidirectional Three-Phase PFC-Rectifier for Non-Isolated EV Charger.” In <i>2021 IEEE Applied Power Electronics Conference and Exposition (APEC)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/apec42165.2021.9487462\">https://doi.org/10.1109/apec42165.2021.9487462</a>.","apa":"Strothmann, B., Schafmeister, F., &#38; Böcker, J. (2021). Common-Mode-Free Bidirectional Three-Phase PFC-Rectifier for Non-Isolated EV Charger. <i>2021 IEEE Applied Power Electronics Conference and Exposition (APEC)</i>. <a href=\"https://doi.org/10.1109/apec42165.2021.9487462\">https://doi.org/10.1109/apec42165.2021.9487462</a>","ieee":"B. Strothmann, F. Schafmeister, and J. Böcker, “Common-Mode-Free Bidirectional Three-Phase PFC-Rectifier for Non-Isolated EV Charger,” 2021, doi: <a href=\"https://doi.org/10.1109/apec42165.2021.9487462\">10.1109/apec42165.2021.9487462</a>."},"publication":"2021 IEEE Applied Power Electronics Conference and Exposition (APEC)","abstract":[{"lang":"eng","text":"DC-DC converters for on-board chargers (OBC) of electrical vehicles are usually galvanically isolated allowing modular single-phase PFC front-end solutions, but require transformers which are more bulky, costly and lossy than inductors of non-isolated DC-DCs. Furthermore, for vehicle-to-grid applications, bidirectional converters with transformers are generally more complex and have a higher count on semiconductor switches than transformerless solutions. However, when using non-isolated DC-DC converters within an OBC, the large common-mode (CM) capacitance comprising capacitive parasitics of the traction battery as well as explicit Y-capacitors connecting the high-voltage DC-system (HV-system) within specific HV-loads to ground has to be considered. For the PFC front-end stage, when supplied from the three-phase mains this means that generation of high-frequency and high-amplitude CM voltages, as it is common e.g. with the conventional six-switch full-bridge converter, has to be strictly avoided. For this reason, a modified topology is suggested leading to a different mode of operation and to a very low common-mode noise behaviour: The three-phase four-wire full-bridge PFC with split DC-link, whose midpoint is connected to the mains neutral provides very stable potentials at the DC-link rails and therefore it can be classified as Zero-CM-topology.For dedicated single-phase operation, as required for most OBC, an additional balancing leg may be added to the topology to reduce the required DC-link capacitance and allow non-electrolytic capacitors.The function of the bidirectional Zero-CM three-phase four-wire full-bridge PFC was verified by simulation and on an 11 kW-laboratory sample. The power factor is above 0.999 and an efficiency of 98 % is measured."}],"date_created":"2022-02-15T09:14:56Z","department":[{"_id":"52"}],"type":"conference","keyword":["Three-phase four-wire","OBC","Y2G","PFC","CM","EY charger","balancing circuit"]}]