[{"language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2020.11.009","publication_identifier":{"issn":["0304-3975"]},"author":[{"full_name":"Li, Shouwei","last_name":"Li","first_name":"Shouwei"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Podlipyan, Pavel","last_name":"Podlipyan","first_name":"Pavel"}],"title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","year":"2021","intvolume":"       852","publication_status":"published","date_updated":"2022-01-06T06:55:35Z","date_created":"2021-06-28T09:34:45Z","department":[{"_id":"63"}],"keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"type":"journal_article","publication":"Theoretical Computer Science","abstract":[{"lang":"eng","text":"In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile robots with limited viewing range in the plane. Remarquably, this algorithm exploits the fact that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is acceptable under the assumption that each robot is represented by a single point. Otherwise, collisions should be avoided. In this paper, we consider a continuous Go-To-The-Center algorithm in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of O(n2) for gathering in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robot with respect to the Gabriel subgraph of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms: Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm, typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center algorithm for one dimension. In two-dimensional Euclidean space, we conjecture that the “collisionless property” holds for almost every initial configuration. We support our conjecture with measurements obtained from the simulation where robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n"}],"_id":"22511","page":"29-40","volume":852,"user_id":"15415","status":"public","citation":{"short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40.","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i> 852 (2021): 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>.","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” <i>Theoretical Computer Science</i>, vol. 852, pp. 29–40, 2021.","apa":"Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>, <i>852</i>, 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>","bibtex":"@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }","ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>. 2021;852:29-40. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>","mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 29–40, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>."}},{"conference":{"end_date":"2021-04-29","start_date":"2021-04-27","name":"2021 Smart Systems Integration (SSI)","location":"Grenoble, France "},"status":"public","user_id":"38240","_id":"22532","publisher":"IEEE","citation":{"mla":"Lange, Sven, et al. “Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field.” <i>2021 Smart Systems Integration (SSI)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">10.1109/ssi52265.2021.9466958</a>.","ama":"Lange S, Hedayat C, Kuhn H, Hilleringmann U. Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field. In: <i>2021 Smart Systems Integration (SSI)</i>. Grenoble, France: IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">10.1109/ssi52265.2021.9466958</a>","bibtex":"@inproceedings{Lange_Hedayat_Kuhn_Hilleringmann_2021, place={Grenoble, France}, title={Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field}, DOI={<a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">10.1109/ssi52265.2021.9466958</a>}, booktitle={2021 Smart Systems Integration (SSI)}, publisher={IEEE}, author={Lange, Sven and Hedayat, Christian and Kuhn, Harald and Hilleringmann, Ulrich}, year={2021} }","apa":"Lange, S., Hedayat, C., Kuhn, H., &#38; Hilleringmann, U. (2021). Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field. In <i>2021 Smart Systems Integration (SSI)</i>. Grenoble, France: IEEE. <a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">https://doi.org/10.1109/ssi52265.2021.9466958</a>","ieee":"S. Lange, C. Hedayat, H. Kuhn, and U. Hilleringmann, “Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field,” in <i>2021 Smart Systems Integration (SSI)</i>, Grenoble, France , 2021.","chicago":"Lange, Sven, Christian Hedayat, Harald Kuhn, and Ulrich Hilleringmann. “Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field.” In <i>2021 Smart Systems Integration (SSI)</i>. Grenoble, France: IEEE, 2021. <a href=\"https://doi.org/10.1109/ssi52265.2021.9466958\">https://doi.org/10.1109/ssi52265.2021.9466958</a>.","short":"S. Lange, C. Hedayat, H. Kuhn, U. Hilleringmann, in: 2021 Smart Systems Integration (SSI), IEEE, Grenoble, France, 2021."},"place":"Grenoble, France","date_updated":"2022-01-06T06:55:36Z","publication_status":"published","author":[{"id":"38240","last_name":"Lange","first_name":"Sven","full_name":"Lange, Sven"},{"first_name":"Christian","last_name":"Hedayat","full_name":"Hedayat, Christian"},{"last_name":"Kuhn","first_name":"Harald","full_name":"Kuhn, Harald"},{"last_name":"Hilleringmann","first_name":"Ulrich","full_name":"Hilleringmann, Ulrich"}],"publication_identifier":{"isbn":["9781665440929"]},"title":"Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field","year":"2021","doi":"10.1109/ssi52265.2021.9466958","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/9466958"}],"abstract":[{"text":"In this publication, further elements of the newly developed inductive localization in the near field are presented. The advantage of inductive localization is the usage of the magnetic fields, which have a very low influence of non-metallic materials in the environment and thus follows good applications in the area of medicine and biochemistry. This allows a precise localization of sensor platforms in inhomogeneous mixtures of materials, where classical methods have major problems with inhomogeneous dielectric conductivity or density. The calculation of the localization of the searched object differs from other methods such as ultrasound or electromagnetic waves due to the source-free propagation of the magnetic field. Therefore, new mathematical evaluation methods and systematic adaptations are necessary, which are presented in this paper in circuit analysis. For this purpose, the exact circuit influences of one coil and the influence of another coil are investigated and which resonance circuit should be selected for both coils for a inductive localization with optimized signal strength.","lang":"eng"}],"publication":"2021 Smart Systems Integration (SSI)","department":[{"_id":"59"},{"_id":"485"}],"type":"conference","keyword":["Electrotechnical Characteristics of Real Coils","Inductive Localization","Resonant Circuit","Mutual Inductance","Near-Field"],"date_created":"2021-07-05T19:31:52Z"},{"publication":"The Journal of Object Technology","citation":{"chicago":"Weidmann, Nils, Shubhangi Salunkhe, Anthony Anjorin, Enes Yigitbas, and Gregor Engels. “Automating Model Transformations for Railway Systems Engineering.” <i>The Journal of Object Technology</i>, 2021. <a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">https://doi.org/10.5381/jot.2021.20.3.a10</a>.","short":"N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, G. Engels, The Journal of Object Technology (2021).","apa":"Weidmann, N., Salunkhe, S., Anjorin, A., Yigitbas, E., &#38; Engels, G. (2021). Automating Model Transformations for Railway Systems Engineering. <i>The Journal of Object Technology</i>. <a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">https://doi.org/10.5381/jot.2021.20.3.a10</a>","ieee":"N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, and G. Engels, “Automating Model Transformations for Railway Systems Engineering.,” <i>The Journal of Object Technology</i>, 2021.","ama":"Weidmann N, Salunkhe S, Anjorin A, Yigitbas E, Engels G. Automating Model Transformations for Railway Systems Engineering. <i>The Journal of Object Technology</i>. 2021. doi:<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>","bibtex":"@article{Weidmann_Salunkhe_Anjorin_Yigitbas_Engels_2021, title={Automating Model Transformations for Railway Systems Engineering.}, DOI={<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>}, number={10:1}, journal={The Journal of Object Technology}, author={Weidmann, Nils and Salunkhe, Shubhangi and Anjorin, Anthony and Yigitbas, Enes and Engels, Gregor}, year={2021} }","mla":"Weidmann, Nils, et al. “Automating Model Transformations for Railway Systems Engineering.” <i>The Journal of Object Technology</i>, 10:1, 2021, doi:<a href=\"https://doi.org/10.5381/jot.2021.20.3.a10\">10.5381/jot.2021.20.3.a10</a>."},"date_created":"2021-07-26T13:54:55Z","type":"journal_article","department":[{"_id":"66"},{"_id":"534"}],"title":"Automating Model Transformations for Railway Systems Engineering.","year":"2021","status":"public","publication_identifier":{"issn":["1660-1769"]},"author":[{"first_name":"Nils","last_name":"Weidmann","full_name":"Weidmann, Nils","id":"53103"},{"first_name":"Shubhangi","last_name":"Salunkhe","full_name":"Salunkhe, Shubhangi"},{"full_name":"Anjorin, Anthony","first_name":"Anthony","last_name":"Anjorin"},{"full_name":"Yigitbas, Enes","first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","id":"8447"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"date_updated":"2022-01-06T06:55:42Z","publication_status":"published","article_number":"10:1","language":[{"iso":"eng"}],"_id":"22814","doi":"10.5381/jot.2021.20.3.a10","user_id":"8447"},{"publication_status":"published","date_updated":"2022-01-06T06:55:42Z","author":[{"orcid":"0000-0002-5967-833X","first_name":"Enes","last_name":"Yigitbas","full_name":"Yigitbas, Enes","id":"8447"},{"id":"70410","full_name":"Karakaya, Kadiray","orcid":"https://orcid.org/0000-0001-9266-2084","last_name":"Karakaya","first_name":"Kadiray"},{"full_name":"Jovanovikj, Ivan","last_name":"Jovanovikj","first_name":"Ivan"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"status":"public","title":"Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces","year":"2021","user_id":"8447","doi":"10.1109/seams51251.2021.00015","language":[{"iso":"eng"}],"_id":"22819","citation":{"apa":"Yigitbas, E., Karakaya, K., Jovanovikj, I., &#38; Engels, G. (2021). Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces. In <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>. <a href=\"https://doi.org/10.1109/seams51251.2021.00015\">https://doi.org/10.1109/seams51251.2021.00015</a>","ieee":"E. Yigitbas, K. Karakaya, I. Jovanovikj, and G. Engels, “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces,” in <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021.","short":"E. Yigitbas, K. Karakaya, I. Jovanovikj, G. Engels, in: 2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS), 2021.","chicago":"Yigitbas, Enes, Kadiray Karakaya, Ivan Jovanovikj, and Gregor Engels. “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces.” In <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021. <a href=\"https://doi.org/10.1109/seams51251.2021.00015\">https://doi.org/10.1109/seams51251.2021.00015</a>.","mla":"Yigitbas, Enes, et al. “Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces.” <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>, 2021, doi:<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>.","ama":"Yigitbas E, Karakaya K, Jovanovikj I, Engels G. Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces. In: <i>2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)</i>. ; 2021. doi:<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>","bibtex":"@inproceedings{Yigitbas_Karakaya_Jovanovikj_Engels_2021, title={Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces}, DOI={<a href=\"https://doi.org/10.1109/seams51251.2021.00015\">10.1109/seams51251.2021.00015</a>}, booktitle={2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)}, author={Yigitbas, Enes and Karakaya, Kadiray and Jovanovikj, Ivan and Engels, Gregor}, year={2021} }"},"publication":"2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","date_created":"2021-07-27T08:34:48Z"},{"citation":{"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.","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).","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} }","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.","chicago":"Hüllermeier, Eyke, Felix Mohr, Alexander Tornede, and Marcel Dominik Wever. “Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,” 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":[{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"full_name":"Tornede, Alexander","first_name":"Alexander","last_name":"Tornede","id":"38209"},{"last_name":"Wever","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","id":"33176"}],"conference":{"end_date":"2021-09-17","name":"ECML/PKDD Workshop on Automating Data Science","start_date":"2021-09-13","location":"Bilbao (Virtual)"},"title":"Automated Machine Learning, Bounded Rationality, and Rational Metareasoning","status":"public","year":"2021","date_updated":"2022-01-06T06:55:43Z","language":[{"iso":"eng"}],"_id":"22913","user_id":"5786"},{"type":"conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"date_created":"2021-08-02T07:48:07Z","citation":{"mla":"Mohr, Felix, and Marcel Dominik Wever. <i>Replacing the Ex-Def Baseline in AutoML by Naive AutoML</i>. 2021.","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.","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.","short":"F. Mohr, M.D. Wever, in: 2021.","chicago":"Mohr, Felix, and Marcel Dominik Wever. “Replacing the Ex-Def Baseline in AutoML by Naive AutoML,” 2021."},"user_id":"5786","_id":"22914","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:43Z","status":"public","title":"Replacing the Ex-Def Baseline in AutoML by Naive AutoML","year":"2021","conference":{"location":"Virtual","name":"8th ICML Workshop on Automated Machine Learning","start_date":"2021-07-23","end_date":"2021-07-23"},"author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever"}]},{"user_id":"477","publisher":"Schloß Dagstuhl","_id":"22927","series_title":"Leibniz International Proceedings in Informatics","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:43Z","publication_status":"accepted","status":"public","year":"2021","title":"On Strong Observational Refinement and Forward Simulation","author":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"type":"conference","department":[{"_id":"7"}],"date_created":"2021-08-03T07:38:56Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"publication":"Proceedings of the 35th International Symposium on Distributed Computing (DISC)","citation":{"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.","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.","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} }","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.","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>.","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.","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."}},{"doi":"10.1145/3449639.3459283","user_id":"53103","language":[{"iso":"eng"}],"_id":"22959","date_updated":"2022-01-06T06:55:44Z","publication_status":"published","title":"Concurrent model synchronisation with multiple objectives","status":"public","year":"2021","conference":{"end_date":"2021-07-14","location":"Lille, France","name":"GECCO '21: Genetic and Evolutionary Computation Conference","start_date":"2021-07-10"},"author":[{"id":"53103","full_name":"Weidmann, Nils","first_name":"Nils","last_name":"Weidmann"},{"id":"107","full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels"}],"type":"conference","department":[{"_id":"28"},{"_id":"66"}],"date_created":"2021-08-07T15:18:48Z","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","citation":{"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>","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.","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>.","short":"N. Weidmann, G. Engels, in: Proceedings of the Genetic and Evolutionary Computation Conference, 2021.","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>.","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>","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} }"}},{"publication_status":"published","date_updated":"2022-01-06T06:55:50Z","author":[{"first_name":"Sriteja","last_name":"Kummita","full_name":"Kummita, Sriteja"},{"full_name":"Piskachev, Goran","last_name":"Piskachev","first_name":"Goran"},{"full_name":"Spath, Johannes","first_name":"Johannes","last_name":"Spath"},{"first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric"}],"status":"public","title":"Qualitative and Quantitative Analysis of Callgraph Algorithms for Python","year":"2021","user_id":"5786","doi":"10.1109/iccq51190.2021.9392986","_id":"23374","language":[{"iso":"eng"}],"citation":{"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>.","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>","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>","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."},"publication":"2021 International Conference on Code Quality (ICCQ)","department":[{"_id":"241"},{"_id":"662"},{"_id":"76"}],"type":"conference","date_created":"2021-08-09T12:01:11Z"},{"citation":{"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.","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.","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.","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.","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} }","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."},"publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"abstract":[{"lang":"eng","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. "}],"date_created":"2021-04-23T13:38:54Z","department":[{"_id":"66"},{"_id":"534"},{"_id":"276"}],"type":"conference","keyword":["Platform Ecosystems","Platform Ecosystem Modeling Language","Platform Ecosystem Development Tool","Business Models","Design Science"],"author":[{"id":"29951","full_name":"Vorbohle, Christian","last_name":"Vorbohle","first_name":"Christian"},{"full_name":"Gottschalk, Sebastian","first_name":"Sebastian","last_name":"Gottschalk","id":"47208"}],"conference":{"location":"Virtual Conference/Workshop","name":"29th European Conference on Information Systems (ECIS)"},"title":"Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ","year":"2021","status":"public","publication_status":"accepted","date_updated":"2022-01-06T06:55:12Z","language":[{"iso":"eng"}],"_id":"21727","publisher":"AIS","user_id":"47208"},{"article_type":"original","date_updated":"2022-01-06T06:55:15Z","author":[{"last_name":"Schneider","first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"full_name":"Khalili, Ramin","last_name":"Khalili","first_name":"Ramin"},{"first_name":"Adnan","last_name":"Manzoor","full_name":"Manzoor, Adnan"},{"full_name":"Qarawlus, Haydar","first_name":"Haydar","last_name":"Qarawlus"},{"first_name":"Rafael","last_name":"Schellenberg","full_name":"Schellenberg, Rafael"},{"id":"126","last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger"},{"full_name":"Hecker, Artur","first_name":"Artur","last_name":"Hecker"}],"year":"2021","title":"Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning","doi":"10.1109/TNSM.2021.3076503","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"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":[{"file_id":"21809","content_type":"application/pdf","file_name":"ris-accepted-version.pdf","access_level":"open_access","file_size":4172270,"relation":"main_file","date_updated":"2021-04-27T08:01:26Z","date_created":"2021-04-27T08:01:26Z","description":"Author version of the accepted paper","creator":"stschn"}],"has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"35343","publisher":"IEEE","_id":"21808","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_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"},{"date_updated":"2022-01-06T06:55:16Z","publication_status":"published","publication_identifier":{"issn":["1099-4300"]},"author":[{"last_name":"Nüske","first_name":"Feliks","orcid":"0000-0003-2444-7889","full_name":"Nüske, Feliks","id":"81513"},{"first_name":"Péter","last_name":"Koltai","full_name":"Koltai, Péter"},{"last_name":"Boninsegna","first_name":"Lorenzo","full_name":"Boninsegna, Lorenzo"},{"full_name":"Clementi, Cecilia","last_name":"Clementi","first_name":"Cecilia"}],"status":"public","title":"Spectral Properties of Effective Dynamics from Conditional Expectations","year":"2021","doi":"10.3390/e23020134","user_id":"81513","language":[{"iso":"eng"}],"_id":"21820","main_file_link":[{"url":"https://www.mdpi.com/1099-4300/23/2/134","open_access":"1"}],"article_number":"134","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>"}],"citation":{"ieee":"F. Nüske, P. Koltai, L. Boninsegna, and C. Clementi, “Spectral Properties of Effective Dynamics from Conditional Expectations,” <i>Entropy</i>, 2021.","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>","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>.","short":"F. Nüske, P. Koltai, L. Boninsegna, C. Clementi, Entropy (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>.","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} }","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>"},"publication":"Entropy","oa":"1","department":[{"_id":"101"}],"type":"journal_article","date_created":"2021-04-28T18:07:56Z"},{"keyword":["tet_topic_waveguides"],"type":"journal_article","department":[{"_id":"61"},{"_id":"230"}],"file":[{"date_created":"2021-04-30T11:57:14Z","creator":"fossie","content_type":"application/pdf","file_id":"21933","date_updated":"2021-04-30T11:57:14Z","relation":"main_file","file_size":1963211,"access_level":"open_access","file_name":"oamex.pdf"},{"access_level":"local","file_name":"2021-04 Hammer - JOSA B - Resonant evanescent excitation of guides waves with high-order angular momentum.pdf","embargo_to":"open_access","date_created":"2021-04-30T11:59:16Z","file_size":7750006,"date_updated":"2021-04-30T11:59:16Z","relation":"main_file","embargo":"2022-05-01","content_type":"application/pdf","file_id":"21934","creator":"fossie"}],"date_created":"2021-04-30T11:54:03Z","abstract":[{"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.","lang":"eng"}],"publication":"Journal of the Optical Society of America B","issue":"5","doi":"10.1364/josab.422731","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:55:20Z","intvolume":"        38","title":"Resonant evanescent excitation of guided waves with high-order optical angular momentum","year":"2021","publication_identifier":{"issn":["0740-3224","1520-8540"]},"author":[{"id":"48077","first_name":"Manfred","orcid":"0000-0002-6331-9348","last_name":"Hammer","full_name":"Hammer, Manfred"},{"first_name":"Lena","last_name":"Ebers","full_name":"Ebers, Lena","id":"40428"},{"full_name":"Förstner, Jens","first_name":"Jens","orcid":"0000-0001-7059-9862","last_name":"Förstner","id":"158"}],"oa":"1","project":[{"name":"TRR 142 - Project Area C","_id":"56"},{"_id":"53","name":"TRR 142"},{"_id":"75","name":"TRR 142 - Subproject C5"}],"file_date_updated":"2021-04-30T11:59:16Z","citation":{"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>.","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} }","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>","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.","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>","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."},"user_id":"158","ddc":["530"],"volume":38,"page":"1717","_id":"21932","has_accepted_license":"1","status":"public"},{"doi":"10.5162/SMSI2021/A8.2","user_id":"32580","_id":"22013","language":[{"iso":"eng"}],"page":"91 - 92","date_updated":"2022-01-06T06:55:22Z","conference":{"name":"Sensor and Measurement Science International","location":"Nürnberg"},"author":[{"id":"32580","full_name":"Zeipert, Henning","last_name":"Zeipert","first_name":"Henning"},{"id":"11829","orcid":"0000-0002-4393-268X","last_name":"Claes","first_name":"Leander","full_name":"Claes, Leander"},{"full_name":"Johannesmann, Sarah","last_name":"Johannesmann","first_name":"Sarah","id":"29190"},{"id":"11289","first_name":"Manuel","last_name":"Webersen","orcid":"0000-0001-6411-4232","full_name":"Webersen, Manuel"},{"full_name":"Lugovtsova, Yevgeniya","first_name":"Yevgeniya","last_name":"Lugovtsova"},{"last_name":"Prager","first_name":"Jens","full_name":"Prager, Jens"},{"id":"213","last_name":"Henning","first_name":"Bernd","full_name":"Henning, Bernd"}],"title":"Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems","status":"public","year":"2021","department":[{"_id":"49"}],"type":"conference","date_created":"2021-05-07T07:33:54Z","project":[{"grant_number":"449607253","_id":"105","name":"Vermiedene Kreuzungen von Lamb-Wellenmoden in mehrlagigen Strukturen"}],"citation":{"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>.","short":"H. Zeipert, L. Claes, S. Johannesmann, M. Webersen, Y. Lugovtsova, J. Prager, B. Henning, in: 2021, pp. 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.","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} }","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>."}},{"year":"2021","title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","author":[{"full_name":"Jager, Tibor","first_name":"Tibor","last_name":"Jager"},{"last_name":"Kurek","first_name":"Rafael","full_name":"Kurek, Rafael"},{"id":"36113","full_name":"Niehues, David","first_name":"David","last_name":"Niehues"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752446","9783030752453"]},"date_updated":"2022-01-06T06:55:23Z","publication_status":"published","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-75245-3_22","publication":"Public-Key Cryptography – PKC 2021","abstract":[{"lang":"eng","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."}],"file":[{"creator":"davnie","date_created":"2021-05-10T16:02:02Z","relation":"main_file","date_updated":"2021-05-10T16:02:02Z","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","access_level":"closed","file_size":701068,"file_id":"22058","content_type":"application/pdf"}],"date_created":"2021-05-10T15:56:24Z","type":"book_chapter","department":[{"_id":"558"}],"status":"public","has_accepted_license":"1","_id":"22057","ddc":["000"],"user_id":"36113","file_date_updated":"2021-05-10T16:02:02Z","citation":{"short":"T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021, 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>.","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.","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} }","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>."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - Subproject C1"}],"place":"Cham"},{"place":"Cham","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:09:17Z","citation":{"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.","ieee":"D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in <i>Public-Key Cryptography – PKC 2021</i>, Cham, 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>","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} }","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>","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>."},"ddc":["000"],"user_id":"36113","_id":"22059","has_accepted_license":"1","status":"public","type":"book_chapter","department":[{"_id":"558"}],"file":[{"creator":"davnie","date_created":"2021-05-10T16:09:17Z","relation":"main_file","date_updated":"2021-05-10T16:09:17Z","file_name":"Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf","access_level":"closed","file_size":697361,"file_id":"22060","content_type":"application/pdf"}],"date_created":"2021-05-10T16:07:50Z","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","doi":"10.1007/978-3-030-75248-4_3","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:24Z","publication_status":"published","title":"Verifiable Random Functions with Optimal Tightness","year":"2021","author":[{"id":"36113","last_name":"Niehues","first_name":"David","full_name":"Niehues, David"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752477","9783030752484"]}},{"_id":"16867","page":"696-723","volume":188,"user_id":"47427","status":"public","oa":"1","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>","short":"B. Gebken, S. Peitz, Journal of Optimization Theory and Applications 188 (2021) 696–723.","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>."},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://link.springer.com/content/pdf/10.1007/s10957-020-01803-w.pdf"}],"doi":"10.1007/s10957-020-01803-w","author":[{"full_name":"Gebken, Bennet","last_name":"Gebken","first_name":"Bennet","id":"32643"},{"id":"47427","orcid":"0000-0002-3389-793X","first_name":"Sebastian","last_name":"Peitz","full_name":"Peitz, Sebastian"}],"title":"An efficient descent method for locally Lipschitz multiobjective optimization problems","year":"2021","intvolume":"       188","publication_status":"published","date_updated":"2022-01-06T06:52:57Z","date_created":"2020-04-27T09:11:22Z","department":[{"_id":"101"}],"type":"journal_article","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."}]},{"oa":"1","citation":{"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.","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.","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} }","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>."},"page":"3-29","_id":"16295","publisher":"Springer","user_id":"47427","volume":80,"status":"public","date_created":"2020-03-13T12:45:05Z","type":"journal_article","department":[{"_id":"101"}],"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."}],"main_file_link":[{"open_access":"1","url":"https://link.springer.com/content/pdf/10.1007/s10898-020-00983-z.pdf"}],"language":[{"iso":"eng"}],"doi":"10.1007/s10898-020-00983-z","title":"Inverse multiobjective optimization: Inferring decision criteria from data","year":"2021","author":[{"last_name":"Gebken","first_name":"Bennet","full_name":"Gebken, Bennet","id":"32643"},{"orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz","first_name":"Sebastian","full_name":"Peitz, Sebastian","id":"47427"}],"date_updated":"2022-01-06T06:52:48Z","intvolume":"        80"},{"date_created":"2021-05-20T09:51:14Z","file":[{"file_name":"Staffelstein 2021 Krauter Khatibi S.301-304.pdf","access_level":"closed","file_size":3540634,"relation":"main_file","date_updated":"2022-01-06T11:44:09Z","file_id":"29169","content_type":"application/pdf","success":1,"creator":"krauter","date_created":"2022-01-06T11:44:09Z"}],"department":[{"_id":"53"}],"type":"conference","publication":"Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304. ","language":[{"iso":"ger"}],"publication_identifier":{"isbn":["978-3-948176-14-3"]},"author":[{"last_name":"Krauter","orcid":"0000-0002-3594-260X","first_name":"Stefan","full_name":"Krauter, Stefan","id":"28836"},{"full_name":"Khatibi, Arash","first_name":"Arash","last_name":"Khatibi","id":"43538"}],"title":"Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands","year":"2021","publication_status":"published","date_updated":"2022-01-06T11:46:47Z","place":"Pforzheim","citation":{"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.","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.","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} }","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."},"file_date_updated":"2022-01-06T11:44:09Z","publisher":"Conexio","_id":"22217","page":"301-304","user_id":"28836","ddc":["620"],"conference":{"name":"36. PV-Symposium, 18.-26 Mai 2021","start_date":"2021-05-18","location":"Staffelstein / online","end_date":"2021-05-26"},"status":"public","has_accepted_license":"1"},{"language":[{"iso":"eng"}],"_id":"21953","series_title":"Reconfigurable Computing: Architectures, Tools, and Applications","publisher":"Springer Lecture Notes in Computer Science","doi":"10.1007/978-3-030-79025-7_4","user_id":"3118","editor":[{"first_name":"Frank","last_name":"Hannig","full_name":"Hannig, Frank"},{"first_name":"Steven","last_name":"Derrien","full_name":"Derrien, Steven"},{"full_name":"Diniz, Pedro","first_name":"Pedro","last_name":"Diniz"},{"full_name":"Chillet, Daniel","last_name":"Chillet","first_name":"Daniel"}],"year":"2021","title":"Timing Optimization for Virtual FPGA Configurations","status":"public","conference":{"end_date":"2021-07-01","location":"Virtual conference","start_date":"2021-06-29","name":"International Symposium on Applied Reconfigurable Computing"},"author":[{"id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias"},{"id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias","last_name":"Wiersema"},{"first_name":"Masood","last_name":"Raeisi Nafchi","full_name":"Raeisi Nafchi, Masood"},{"full_name":"Bockhorn, Arne","last_name":"Bockhorn","first_name":"Arne"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"date_updated":"2022-02-14T11:03:09Z","publication_status":"accepted","date_created":"2021-05-04T14:18:46Z","type":"conference","department":[{"_id":"78"}],"publication":"Proceedings of International Symposium on Applied Reconfigurable Computing (ARC'21)","citation":{"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} }","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>","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.","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>.","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>"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}]}]