[{"department":[{"_id":"78"}],"type":"bachelorsthesis","place":"Paderborn","date_created":"2021-06-21T09:35:03Z","project":[{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901","_id":"1"}],"abstract":[{"lang":"eng","text":"This bachelor thesis presents a C/C++ implementation of the XCS algorithm for an embedded system and profiling results concerning the execution time of the functions. These are then analyzed in relation to the input characteristics of the examined learning environments and compared with related work. Three main conclusions can be drawn from the measured results. First, the maximum size of the population of the classifiers influences the runtime of the genetic algorithm; second, the size of the input space has a direct effect on the execution time of the matching function; and last, a larger action space results in a longer runtime generating the prediction for the possible actions. The dependencies identified here can serve to optimize the computational efficiency and make XCS more suitable for embedded systems."}],"extern":"1","supervisor":[{"id":"398","first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco"},{"id":"49992","last_name":"Hansmeier","first_name":"Tim","orcid":"0000-0003-1377-3339","full_name":"Hansmeier, Tim"}],"citation":{"bibtex":"@book{Brede_2021, place={Paderborn}, title={Implementation and Profiling of XCS in the Context of Embedded Systems}, publisher={Paderborn University}, author={Brede, Mathis}, year={2021} }","ama":"Brede M. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University; 2021.","mla":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn University, 2021.","short":"M. Brede, Implementation and Profiling of XCS in the Context of Embedded Systems, Paderborn University, Paderborn, 2021.","chicago":"Brede, Mathis. <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","ieee":"M. Brede, <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University, 2021.","apa":"Brede, M. (2021). <i>Implementation and Profiling of XCS in the Context of Embedded Systems</i>. Paderborn: Paderborn University."},"user_id":"477","_id":"22483","publisher":"Paderborn University","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:33Z","author":[{"last_name":"Brede","first_name":"Mathis","full_name":"Brede, Mathis"}],"year":"2021","status":"public","title":"Implementation and Profiling of XCS in the Context of Embedded Systems"},{"citation":{"chicago":"Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i> 852 (2021): 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.","ieee":"S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” <i>Theoretical Computer Science</i>, vol. 852, pp. 41–60, 2021.","apa":"Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>, <i>852</i>, 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>","bibtex":"@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous strategy for collisionless gathering}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60} }","ama":"Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>. 2021;852:41-60. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>","mla":"Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 41–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>."},"status":"public","_id":"22510","page":"41-60","volume":852,"user_id":"15415","publication":"Theoretical Computer Science","abstract":[{"text":"Over the past decades, the Gathering problem, which asks to gather a group of robots in finite time given some restrictions, has been intensively studied. In this paper, we are given a group of n autonomous, dimensionless, deterministic, and anonymous robots, with bounded viewing range. Assuming a continuous time model, the goal is to gather these robots into one point in finite time. We introduce a simple convergence criterion that defines a new class of algorithms which perform gathering in O(nd) time, where d is the diameter of the initial robot configuration. We show that some gathering algorithms in the literature belong to this class and propose two new algorithms that belong to this class and have quadratic running time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center algorithm (S-GTRC). We prove that the latter can perform gathering without collision by using a slightly more complex robot model: non oblivious, chiral, and luminous (i.e. robots have observable external memory, as in [8]). We also consider a variant of the Gathering problem, the Near-Gathering problem, in which robots must get close to each other without colliding. We show that S-GTRC solves the Near-Gathering problem in quadratic time and assumes a weaker robot model than the one assumed in the current state-of-the-art.","lang":"eng"}],"date_created":"2021-06-28T09:24:15Z","department":[{"_id":"63"}],"keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"type":"journal_article","author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"first_name":"Christine","last_name":"Markarian","full_name":"Markarian, Christine"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","last_name":"Podlipyan","full_name":"Podlipyan, Pavel"}],"publication_identifier":{"issn":["0304-3975"]},"year":"2021","title":"A continuous strategy for collisionless gathering","intvolume":"       852","publication_status":"published","date_updated":"2022-01-06T06:55:35Z","language":[{"iso":"eng"}],"doi":"10.1016/j.tcs.2020.10.037"},{"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>.","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>","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.","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>","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} }","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>."},"status":"public","volume":852,"user_id":"15415","_id":"22511","page":"29-40","abstract":[{"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","lang":"eng"}],"publication":"Theoretical Computer Science","department":[{"_id":"63"}],"keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"type":"journal_article","date_created":"2021-06-28T09:34:45Z","intvolume":"       852","date_updated":"2022-01-06T06:55:35Z","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Podlipyan, Pavel","first_name":"Pavel","last_name":"Podlipyan"}],"year":"2021","title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","doi":"10.1016/j.tcs.2020.11.009","language":[{"iso":"eng"}]},{"publication":"The Journal of Object Technology","citation":{"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.","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).","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>.","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} }"},"date_created":"2021-07-26T13:54:55Z","type":"journal_article","department":[{"_id":"66"},{"_id":"534"}],"year":"2021","title":"Automating Model Transformations for Railway Systems Engineering.","status":"public","publication_identifier":{"issn":["1660-1769"]},"author":[{"first_name":"Nils","last_name":"Weidmann","full_name":"Weidmann, Nils","id":"53103"},{"full_name":"Salunkhe, Shubhangi","last_name":"Salunkhe","first_name":"Shubhangi"},{"first_name":"Anthony","last_name":"Anjorin","full_name":"Anjorin, Anthony"},{"full_name":"Yigitbas, Enes","first_name":"Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","id":"8447"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"}],"date_updated":"2022-01-06T06:55:42Z","publication_status":"published","article_number":"10:1","_id":"22814","language":[{"iso":"eng"}],"doi":"10.5381/jot.2021.20.3.a10","user_id":"8447"},{"date_created":"2021-07-27T08:34:48Z","type":"conference","department":[{"_id":"66"},{"_id":"534"}],"publication":"2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS)","citation":{"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>.","short":"E. Yigitbas, K. Karakaya, I. Jovanovikj, G. Engels, in: 2021 International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS), 2021.","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.","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>","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} }","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>","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>."},"_id":"22819","language":[{"iso":"eng"}],"user_id":"8447","doi":"10.1109/seams51251.2021.00015","status":"public","year":"2021","title":"Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces","author":[{"id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"id":"70410","full_name":"Karakaya, Kadiray","last_name":"Karakaya","orcid":"https://orcid.org/0000-0001-9266-2084","first_name":"Kadiray"},{"last_name":"Jovanovikj","first_name":"Ivan","full_name":"Jovanovikj, Ivan"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"publication_status":"published","date_updated":"2022-01-06T06:55:42Z"},{"date_updated":"2022-01-06T06:55:43Z","year":"2021","title":"Automated Machine Learning, Bounded Rationality, and Rational Metareasoning","status":"public","author":[{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"id":"38209","full_name":"Tornede, Alexander","first_name":"Alexander","last_name":"Tornede"},{"id":"33176","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"}],"conference":{"end_date":"2021-09-17","location":"Bilbao (Virtual)","name":"ECML/PKDD Workshop on Automating Data Science","start_date":"2021-09-13"},"user_id":"5786","_id":"22913","language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"citation":{"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} }","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.","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)."},"type":"conference","department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"date_created":"2021-08-02T07:46:29Z"},{"citation":{"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.","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.","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."},"department":[{"_id":"34"},{"_id":"355"},{"_id":"26"}],"type":"conference","date_created":"2021-08-02T07:48:07Z","date_updated":"2022-01-06T06:55:43Z","author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","full_name":"Wever, Marcel Dominik","id":"33176"}],"conference":{"location":"Virtual","start_date":"2021-07-23","name":"8th ICML Workshop on Automated Machine Learning","end_date":"2021-07-23"},"year":"2021","status":"public","title":"Replacing the Ex-Def Baseline in AutoML by Naive AutoML","user_id":"5786","language":[{"iso":"eng"}],"_id":"22914"},{"author":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"year":"2021","title":"On Strong Observational Refinement and Forward Simulation","status":"public","date_updated":"2022-01-06T06:55:43Z","publication_status":"accepted","_id":"22927","language":[{"iso":"eng"}],"series_title":"Leibniz International Proceedings in Informatics","publisher":"Schloß Dagstuhl","user_id":"477","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"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"date_created":"2021-08-03T07:38:56Z","department":[{"_id":"7"}],"type":"conference"},{"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>.","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} }","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."},"date_created":"2021-08-07T15:18:48Z","type":"conference","department":[{"_id":"28"},{"_id":"66"}],"title":"Concurrent model synchronisation with multiple objectives","status":"public","year":"2021","author":[{"full_name":"Weidmann, Nils","first_name":"Nils","last_name":"Weidmann","id":"53103"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"conference":{"name":"GECCO '21: Genetic and Evolutionary Computation Conference","start_date":"2021-07-10","location":"Lille, France","end_date":"2021-07-14"},"publication_status":"published","date_updated":"2022-01-06T06:55:44Z","language":[{"iso":"eng"}],"_id":"22959","user_id":"53103","doi":"10.1145/3449639.3459283"},{"date_created":"2021-08-09T12:01:11Z","type":"conference","department":[{"_id":"241"},{"_id":"662"},{"_id":"76"}],"publication":"2021 International Conference on Code Quality (ICCQ)","citation":{"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.","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>"},"language":[{"iso":"eng"}],"_id":"23374","user_id":"5786","doi":"10.1109/iccq51190.2021.9392986","title":"Qualitative and Quantitative Analysis of Callgraph Algorithms for Python","status":"public","year":"2021","author":[{"first_name":"Sriteja","last_name":"Kummita","full_name":"Kummita, Sriteja"},{"full_name":"Piskachev, Goran","last_name":"Piskachev","first_name":"Goran"},{"first_name":"Johannes","last_name":"Spath","full_name":"Spath, Johannes"},{"full_name":"Bodden, Eric","first_name":"Eric","last_name":"Bodden"}],"publication_status":"published","date_updated":"2022-01-06T06:55:50Z"},{"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"],"citation":{"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.","short":"C. Vorbohle, S. Gottschalk, in: Proceedings of the 29th European Conference on Information Systems (ECIS), AIS, n.d.","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.","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.","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} }"},"publication":"Proceedings of the 29th European Conference on Information Systems (ECIS)","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"}],"publisher":"AIS","_id":"21727","language":[{"iso":"eng"}],"user_id":"47208","author":[{"first_name":"Christian","last_name":"Vorbohle","full_name":"Vorbohle, Christian","id":"29951"},{"id":"47208","first_name":"Sebastian","last_name":"Gottschalk","full_name":"Gottschalk, Sebastian"}],"conference":{"location":"Virtual Conference/Workshop","name":"29th European Conference on Information Systems (ECIS)"},"year":"2021","title":"Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems ","status":"public","publication_status":"accepted","date_updated":"2022-01-06T06:55:12Z"},{"oa":"1","file_date_updated":"2021-04-27T08:01:26Z","citation":{"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>.","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>","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>","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>.","short":"S.B. Schneider, R. Khalili, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, A. Hecker, Transactions on Network and Service Management (2021)."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"publisher":"IEEE","_id":"21808","ddc":["000"],"user_id":"35343","status":"public","has_accepted_license":"1","file":[{"access_level":"open_access","file_size":4172270,"file_name":"ris-accepted-version.pdf","date_updated":"2021-04-27T08:01:26Z","relation":"main_file","content_type":"application/pdf","file_id":"21809","creator":"stschn","date_created":"2021-04-27T08:01:26Z","description":"Author version of the accepted paper"}],"date_created":"2021-04-27T08:04:16Z","keyword":["network management","service management","coordination","reinforcement learning","self-learning","self-adaptation","multi-objective"],"type":"journal_article","department":[{"_id":"75"}],"publication":"Transactions on Network and Service Management","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"}],"language":[{"iso":"eng"}],"doi":"10.1109/TNSM.2021.3076503","year":"2021","title":"Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning","author":[{"orcid":"0000-0001-8210-4011","first_name":"Stefan Balthasar","last_name":"Schneider","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"full_name":"Khalili, Ramin","first_name":"Ramin","last_name":"Khalili"},{"full_name":"Manzoor, Adnan","first_name":"Adnan","last_name":"Manzoor"},{"first_name":"Haydar","last_name":"Qarawlus","full_name":"Qarawlus, Haydar"},{"full_name":"Schellenberg, Rafael","first_name":"Rafael","last_name":"Schellenberg"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"},{"first_name":"Artur","last_name":"Hecker","full_name":"Hecker, Artur"}],"date_updated":"2022-01-06T06:55:15Z","article_type":"original"},{"title":"Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance","year":"2021","publication_identifier":{"isbn":["9783030752446","9783030752453"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"full_name":"Kurek, Rafael","first_name":"Rafael","last_name":"Kurek"},{"id":"36113","last_name":"Niehues","first_name":"David","full_name":"Niehues, David"}],"publication_status":"published","date_updated":"2022-01-06T06:55:23Z","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-75245-3_22","publication":"Public-Key Cryptography – PKC 2021","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"}],"file":[{"content_type":"application/pdf","file_id":"22058","file_size":701068,"access_level":"closed","file_name":"Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via N.pdf","date_updated":"2021-05-10T16:02:02Z","relation":"main_file","date_created":"2021-05-10T16:02:02Z","creator":"davnie"}],"date_created":"2021-05-10T15:56:24Z","type":"book_chapter","department":[{"_id":"558"}],"status":"public","has_accepted_license":"1","_id":"22057","user_id":"36113","ddc":["000"],"file_date_updated":"2021-05-10T16:02:02Z","citation":{"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>.","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} }","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>","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.","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>","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."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"place":"Cham"},{"ddc":["000"],"user_id":"36113","_id":"22059","has_accepted_license":"1","status":"public","place":"Cham","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"citation":{"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.","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} }"},"file_date_updated":"2021-05-10T16:09:17Z","doi":"10.1007/978-3-030-75248-4_3","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:24Z","publication_status":"published","author":[{"full_name":"Niehues, David","last_name":"Niehues","first_name":"David","id":"36113"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030752477","9783030752484"]},"title":"Verifiable Random Functions with Optimal Tightness","year":"2021","department":[{"_id":"558"}],"type":"book_chapter","date_created":"2021-05-10T16:07:50Z","file":[{"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","content_type":"application/pdf","file_id":"22060","creator":"davnie","date_created":"2021-05-10T16:09:17Z"}],"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"},{"date_updated":"2022-02-14T11:03:09Z","publication_status":"accepted","status":"public","year":"2021","title":"Timing Optimization for Virtual FPGA Configurations","conference":{"end_date":"2021-07-01","location":"Virtual conference","name":"International Symposium on Applied Reconfigurable Computing","start_date":"2021-06-29"},"author":[{"id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias"},{"id":"3118","first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias"},{"last_name":"Raeisi Nafchi","first_name":"Masood","full_name":"Raeisi Nafchi, Masood"},{"last_name":"Bockhorn","first_name":"Arne","full_name":"Bockhorn, Arne"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"}],"doi":"10.1007/978-3-030-79025-7_4","user_id":"3118","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","last_name":"Diniz","first_name":"Pedro"},{"full_name":"Chillet, Daniel","last_name":"Chillet","first_name":"Daniel"}],"_id":"21953","language":[{"iso":"eng"}],"series_title":"Reconfigurable Computing: Architectures, Tools, and Applications","publisher":"Springer Lecture Notes in Computer Science","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"publication":"Proceedings of International Symposium on Applied Reconfigurable Computing (ARC'21)","citation":{"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>.","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.","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>.","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} }"},"type":"conference","department":[{"_id":"78"}],"date_created":"2021-05-04T14:18:46Z"},{"status":"public","_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"},{"last_name":"Nguyen-Duc","first_name":"Anh","full_name":"Nguyen-Duc, Anh"},{"last_name":"Stray","first_name":"Viktoria","full_name":"Stray, Viktoria"}],"volume":434,"user_id":"47208","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>.","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} }","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>","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>.","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>","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"}],"author":[{"id":"47208","full_name":"Gottschalk, Sebastian","last_name":"Gottschalk","first_name":"Sebastian"},{"full_name":"Aziz, Muhammad Suffyan","last_name":"Aziz","first_name":"Muhammad Suffyan"},{"id":"8447","first_name":"Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","full_name":"Yigitbas, Enes"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"}],"title":"Design Principles for a Crowd-Based Prototype Validation Platform","year":"2021","intvolume":"       434","date_updated":"2022-02-15T07:32:52Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Business Information Processing","doi":"10.1007/978-3-030-91983-2_16","publication":"Software Business - 12th International Conference, ICSOB 2021, Drammen, Norway, December 2-3, 2021, Proceedings","date_created":"2022-01-11T12:43:22Z","department":[{"_id":"66"},{"_id":"534"}],"type":"conference"},{"keyword":["Business Model Development","Situational Method Engineering","Lean Development","Kanban Boards","Canvas Models"],"type":"book_chapter","department":[{"_id":"66"}],"date_created":"2021-10-05T20:11:09Z","abstract":[{"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.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"publication":"Product-focused Software Process Improvement","citation":{"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.","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} }","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.","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."},"user_id":"47208","_id":"25528","language":[{"iso":"eng"}],"publisher":"Springer","date_updated":"2022-02-15T08:36:09Z","title":"Situation- and  Domain-specific Composition and Enactment of Business Model Development Methods","year":"2021","status":"public","author":[{"id":"47208","last_name":"Gottschalk","first_name":"Sebastian","full_name":"Gottschalk, Sebastian"},{"full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","first_name":"Enes","last_name":"Yigitbas","id":"8447"},{"last_name":"Nowosad","first_name":"Alexander","full_name":"Nowosad, Alexander"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"conference":{"location":"Turin","name":"22nd International Conference on Product-Focused Software Process Improvement","start_date":"2021-11-25","end_date":"2021-11-26"}},{"date_created":"2022-02-24T15:44:42Z","type":"conference","department":[{"_id":"76"}],"publication":"2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)","citation":{"ama":"Karakaya K, Bodden E. SootFX: A Static Code Feature Extraction Tool for Java and Android. In: <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/scam52516.2021.00030\">10.1109/scam52516.2021.00030</a>","bibtex":"@inproceedings{Karakaya_Bodden_2021, title={SootFX: A Static Code Feature Extraction Tool for Java and Android}, DOI={<a href=\"https://doi.org/10.1109/scam52516.2021.00030\">10.1109/scam52516.2021.00030</a>}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, publisher={IEEE}, author={Karakaya, Kadiray and Bodden, Eric}, year={2021} }","mla":"Karakaya, Kadiray, and Eric Bodden. “SootFX: A Static Code Feature Extraction Tool for Java and Android.” <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/scam52516.2021.00030\">10.1109/scam52516.2021.00030</a>.","chicago":"Karakaya, Kadiray, and Eric Bodden. “SootFX: A Static Code Feature Extraction Tool for Java and Android.” In <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/scam52516.2021.00030\">https://doi.org/10.1109/scam52516.2021.00030</a>.","short":"K. Karakaya, E. Bodden, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), IEEE, 2021.","apa":"Karakaya, K., &#38; Bodden, E. (2021). SootFX: A Static Code Feature Extraction Tool for Java and Android. <i>2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. <a href=\"https://doi.org/10.1109/scam52516.2021.00030\">https://doi.org/10.1109/scam52516.2021.00030</a>","ieee":"K. Karakaya and E. Bodden, “SootFX: A Static Code Feature Extraction Tool for Java and Android,” 2021, doi: <a href=\"https://doi.org/10.1109/scam52516.2021.00030\">10.1109/scam52516.2021.00030</a>."},"_id":"30084","publisher":"IEEE","doi":"10.1109/scam52516.2021.00030","user_id":"70410","status":"public","title":"SootFX: A Static Code Feature Extraction Tool for Java and Android","year":"2021","author":[{"last_name":"Karakaya","first_name":"Kadiray","full_name":"Karakaya, Kadiray"},{"full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric"}],"date_updated":"2022-02-24T15:45:43Z","publication_status":"published"},{"status":"public","title":"Key Point Analysis via Contrastive Learning and Extractive Argument Summarization","year":"2021","author":[{"last_name":"Alshomary","first_name":"Milad","full_name":"Alshomary, Milad","id":"73059"},{"full_name":"Gurcke, Timon","last_name":"Gurcke","first_name":"Timon","id":"52174"},{"first_name":"Shahbaz","last_name":"Syed","full_name":"Syed, Shahbaz"},{"full_name":"Heinisch, Philipp","last_name":"Heinisch","first_name":"Philipp"},{"id":"84035","last_name":"Spliethöver","first_name":"Maximilian","orcid":"0000-0003-4364-1409","full_name":"Spliethöver, Maximilian"},{"full_name":"Cimiano, Philipp","first_name":"Philipp","last_name":"Cimiano"},{"first_name":"Martin","last_name":"Potthast","full_name":"Potthast, Martin"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth","id":"3900"}],"date_updated":"2022-03-08T12:47:33Z","page":"184 - 189","main_file_link":[{"url":"https://aclanthology.org/2021.argmining-1.19.pdf"}],"language":[{"iso":"eng"}],"_id":"25297","user_id":"82920","publication":"Proceedings of the 8th Workshop on Argument Mining","citation":{"bibtex":"@inproceedings{Alshomary_Gurcke_Syed_Heinisch_Spliethöver_Cimiano_Potthast_Wachsmuth_2021, title={Key Point Analysis via Contrastive Learning and Extractive Argument Summarization}, booktitle={Proceedings of the 8th Workshop on Argument Mining}, author={Alshomary, Milad and Gurcke, Timon and Syed, Shahbaz and Heinisch, Philipp and Spliethöver, Maximilian and Cimiano, Philipp and Potthast, Martin and Wachsmuth, Henning}, year={2021}, pages={184–189} }","ama":"Alshomary M, Gurcke T, Syed S, et al. Key Point Analysis via Contrastive Learning and Extractive Argument Summarization. In: <i>Proceedings of the 8th Workshop on Argument Mining</i>. ; 2021:184-189.","mla":"Alshomary, Milad, et al. “Key Point Analysis via Contrastive Learning and Extractive Argument Summarization.” <i>Proceedings of the 8th Workshop on Argument Mining</i>, 2021, pp. 184–89.","chicago":"Alshomary, Milad, Timon Gurcke, Shahbaz Syed, Philipp Heinisch, Maximilian Spliethöver, Philipp Cimiano, Martin Potthast, and Henning Wachsmuth. “Key Point Analysis via Contrastive Learning and Extractive Argument Summarization.” In <i>Proceedings of the 8th Workshop on Argument Mining</i>, 184–89, 2021.","short":"M. Alshomary, T. Gurcke, S. Syed, P. Heinisch, M. Spliethöver, P. Cimiano, M. Potthast, H. Wachsmuth, in: Proceedings of the 8th Workshop on Argument Mining, 2021, pp. 184–189.","ieee":"M. Alshomary <i>et al.</i>, “Key Point Analysis via Contrastive Learning and Extractive Argument Summarization,” in <i>Proceedings of the 8th Workshop on Argument Mining</i>, 2021, pp. 184–189.","apa":"Alshomary, M., Gurcke, T., Syed, S., Heinisch, P., Spliethöver, M., Cimiano, P., Potthast, M., &#38; Wachsmuth, H. (2021). Key Point Analysis via Contrastive Learning and Extractive Argument Summarization. <i>Proceedings of the 8th Workshop on Argument Mining</i>, 184–189."},"date_created":"2021-10-04T12:40:02Z","type":"conference","department":[{"_id":"600"}]},{"publication":"Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2021","citation":{"ieee":"Z. Nouri, N. Prakash, U. Gadiraju, and H. Wachsmuth, “iClarify - A Tool to Help Requesters Iteratively Improve Task Descriptions in Crowdsourcing,” 2021.","apa":"Nouri, Z., Prakash, N., Gadiraju, U., &#38; Wachsmuth, H. (2021). iClarify - A Tool to Help Requesters Iteratively Improve Task Descriptions in Crowdsourcing. <i>Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2021</i>.","chicago":"Nouri, Zahra, Nikhil Prakash, Ujwal Gadiraju, and Henning Wachsmuth. “IClarify - A Tool to Help Requesters Iteratively Improve Task Descriptions in Crowdsourcing.” In <i>Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2021</i>, 2021.","short":"Z. Nouri, N. Prakash, U. Gadiraju, H. Wachsmuth, in: Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2021, 2021.","mla":"Nouri, Zahra, et al. “IClarify - A Tool to Help Requesters Iteratively Improve Task Descriptions in Crowdsourcing.” <i>Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2021</i>, 2021.","bibtex":"@inproceedings{Nouri_Prakash_Gadiraju_Wachsmuth_2021, title={iClarify - A Tool to Help Requesters Iteratively Improve Task Descriptions in Crowdsourcing}, booktitle={Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2021}, author={Nouri, Zahra and Prakash, Nikhil and Gadiraju, Ujwal and Wachsmuth, Henning}, year={2021} }","ama":"Nouri Z, Prakash N, Gadiraju U, Wachsmuth H. iClarify - A Tool to Help Requesters Iteratively Improve Task Descriptions in Crowdsourcing. In: <i>Proceedings of the Ninth AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2021</i>. ; 2021."},"type":"conference","department":[{"_id":"600"}],"date_created":"2021-10-04T12:35:50Z","date_updated":"2022-03-08T12:46:44Z","status":"public","title":"iClarify - A Tool to Help Requesters Iteratively Improve Task Descriptions in Crowdsourcing","year":"2021","author":[{"id":"35802","full_name":"Nouri, Zahra","last_name":"Nouri","first_name":"Zahra"},{"full_name":"Prakash, Nikhil","first_name":"Nikhil","last_name":"Prakash"},{"full_name":"Gadiraju, Ujwal","first_name":"Ujwal","last_name":"Gadiraju"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"user_id":"82920","main_file_link":[{"url":"https://www.humancomputation.com/assets/wips_demos/HCOMP_2021_paper_111.pdf"}],"_id":"25294","language":[{"iso":"eng"}]}]