[{"department":[{"_id":"66"},{"_id":"534"}],"user_id":"47208","_id":"29839","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"language":[{"iso":"eng"}],"keyword":["Business Model Development","Situational Method Engineering","Tool Support"],"publication":"Proceedings of the 17th International Conference on Wirtschaftsinformatik","type":"conference","status":"public","abstract":[{"lang":"eng","text":"The development of business models is a challenging task that can be supported with software tools. Here, existing approaches and tools do not focus on the company’s situation in which the development takes place (e.g., financial resources, product type). To tackle this challenge, we used design science research to develop a situation-specific business model development approach that contains three stages: First, existing knowledge in terms of tasks to do (e.g., analyze competitive advantage), and decisions to be made (e.g., social media marketing) are stored in repositories. Second, the knowledge is used to compose a development method based on the company’s situation. Third, the development method is enacted to develop a business model. This demonstration paper presents a tool-support called Situational Business Model Developer that supports all stages of our approach. We release the tool under open-source and evaluate it with a case study on developing business models for mobile apps."}],"author":[{"last_name":"Gottschalk","id":"47208","full_name":"Gottschalk, Sebastian","first_name":"Sebastian"},{"first_name":"Enes","id":"8447","full_name":"Yigitbas, Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"},{"first_name":"Alexander","last_name":"Nowosad","full_name":"Nowosad, Alexander"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"date_created":"2022-02-15T07:20:21Z","date_updated":"2022-02-15T07:26:26Z","oa":"1","publisher":"AIS","conference":{"location":"Nuremberg","end_date":"2022-02-23","start_date":"2022-02-21","name":"17th International Conference on Wirtschaftsinformatik"},"main_file_link":[{"url":"https://aisel.aisnet.org/wi2022/prototype_track/prototype_track/34/","open_access":"1"}],"title":"Situational Business Model Developer: A Tool-support for Situation-specific Business Model Development","citation":{"apa":"Gottschalk, S., Yigitbas, E., Nowosad, A., &#38; Engels, G. (2022). Situational Business Model Developer: A Tool-support for Situation-specific Business Model Development. <i>Proceedings of the 17th International Conference on Wirtschaftsinformatik</i>. 17th International Conference on Wirtschaftsinformatik, Nuremberg.","bibtex":"@inproceedings{Gottschalk_Yigitbas_Nowosad_Engels_2022, title={Situational Business Model Developer: A Tool-support for Situation-specific Business Model Development}, booktitle={Proceedings of the 17th International Conference on Wirtschaftsinformatik}, publisher={AIS}, author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2022} }","mla":"Gottschalk, Sebastian, et al. “Situational Business Model Developer: A Tool-Support for Situation-Specific Business Model Development.” <i>Proceedings of the 17th International Conference on Wirtschaftsinformatik</i>, AIS, 2022.","short":"S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Proceedings of the 17th International Conference on Wirtschaftsinformatik, AIS, 2022.","ama":"Gottschalk S, Yigitbas E, Nowosad A, Engels G. Situational Business Model Developer: A Tool-support for Situation-specific Business Model Development. In: <i>Proceedings of the 17th International Conference on Wirtschaftsinformatik</i>. AIS; 2022.","ieee":"S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Situational Business Model Developer: A Tool-support for Situation-specific Business Model Development,” presented at the 17th International Conference on Wirtschaftsinformatik, Nuremberg, 2022.","chicago":"Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels. “Situational Business Model Developer: A Tool-Support for Situation-Specific Business Model Development.” In <i>Proceedings of the 17th International Conference on Wirtschaftsinformatik</i>. AIS, 2022."},"year":"2022"},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"_id":"29672","status":"public","type":"dissertation","doi":"10.17619/UNIPB/1-1276 ","title":"Network and Service Coordination: Conventional and Machine Learning Approaches\"","date_created":"2022-01-31T07:08:47Z","supervisor":[{"first_name":"Karl","last_name":"Holger","full_name":"Holger, Karl"}],"author":[{"last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343","first_name":"Stefan Balthasar"}],"date_updated":"2022-02-18T08:17:36Z","citation":{"apa":"Schneider, S. B. (2022). <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">https://doi.org/10.17619/UNIPB/1-1276 </a>","bibtex":"@book{Schneider_2022, title={Network and Service Coordination: Conventional and Machine Learning Approaches\"}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">10.17619/UNIPB/1-1276 </a>}, author={Schneider, Stefan Balthasar}, year={2022} }","mla":"Schneider, Stefan Balthasar. <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">10.17619/UNIPB/1-1276 </a>.","short":"S.B. Schneider, Network and Service Coordination: Conventional and Machine Learning Approaches\", 2022.","ama":"Schneider SB. <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">10.17619/UNIPB/1-1276 </a>","chicago":"Schneider, Stefan Balthasar. <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1276 \">https://doi.org/10.17619/UNIPB/1-1276 </a>.","ieee":"S. B. Schneider, <i>Network and Service Coordination: Conventional and Machine Learning Approaches\"</i>. 2022."},"year":"2022"},{"year":"2022","citation":{"short":"L.M. Witschen, T. Wiersema, L.D. Reuter, M. Platzner, in: 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d.","mla":"Witschen, Linus Matthias, et al. “Search Space Characterization for Approximate Logic Synthesis .” <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>.","bibtex":"@inproceedings{Witschen_Wiersema_Reuter_Platzner, title={Search Space Characterization for Approximate Logic Synthesis }, booktitle={2022 59th ACM/IEEE Design Automation Conference (DAC)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Reuter, Lucas David and Platzner, Marco} }","apa":"Witschen, L. M., Wiersema, T., Reuter, L. D., &#38; Platzner, M. (n.d.). Search Space Characterization for Approximate Logic Synthesis . <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>. 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","ama":"Witschen LM, Wiersema T, Reuter LD, Platzner M. Search Space Characterization for Approximate Logic Synthesis . In: <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Lucas David Reuter, and Marco Platzner. “Search Space Characterization for Approximate Logic Synthesis .” In <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>, n.d.","ieee":"L. M. Witschen, T. Wiersema, L. D. Reuter, and M. Platzner, “Search Space Characterization for Approximate Logic Synthesis ,” presented at the 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA."},"publication_status":"accepted","title":"Search Space Characterization for Approximate Logic Synthesis ","conference":{"start_date":"2022-07-10","name":"2022 59th ACM/IEEE Design Automation Conference (DAC)","location":"San Francisco, USA","end_date":"2022-07-14"},"date_updated":"2022-02-22T07:51:42Z","date_created":"2022-02-22T07:51:38Z","author":[{"full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen","first_name":"Linus Matthias"},{"first_name":"Tobias","last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias"},{"last_name":"Reuter","full_name":"Reuter, Lucas David","first_name":"Lucas David"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"status":"public","publication":"2022 59th ACM/IEEE Design Automation Conference (DAC)","type":"conference","language":[{"iso":"eng"}],"_id":"29945","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"department":[{"_id":"78"}],"user_id":"49051"},{"type":"conference","publication":"Design, Automation and Test in Europe (DATE)","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"29865","user_id":"49051","department":[{"_id":"78"}],"language":[{"iso":"eng"}],"publication_status":"accepted","year":"2022","citation":{"apa":"Witschen, L. M., Wiersema, T., Artmann, M., &#38; Platzner, M. (n.d.). MUSCAT: MUS-based Circuit Approximation Technique. <i>Design, Automation and Test in Europe (DATE)</i>. Design, Automation and Test in Europe (DATE), Online.","short":"L.M. Witschen, T. Wiersema, M. Artmann, M. Platzner, in: Design, Automation and Test in Europe (DATE), n.d.","bibtex":"@inproceedings{Witschen_Wiersema_Artmann_Platzner, title={MUSCAT: MUS-based Circuit Approximation Technique}, booktitle={Design, Automation and Test in Europe (DATE)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Artmann, Matthias and Platzner, Marco} }","mla":"Witschen, Linus Matthias, et al. “MUSCAT: MUS-Based Circuit Approximation Technique.” <i>Design, Automation and Test in Europe (DATE)</i>.","ama":"Witschen LM, Wiersema T, Artmann M, Platzner M. MUSCAT: MUS-based Circuit Approximation Technique. In: <i>Design, Automation and Test in Europe (DATE)</i>.","ieee":"L. M. Witschen, T. Wiersema, M. Artmann, and M. Platzner, “MUSCAT: MUS-based Circuit Approximation Technique,” presented at the Design, Automation and Test in Europe (DATE), Online.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Matthias Artmann, and Marco Platzner. “MUSCAT: MUS-Based Circuit Approximation Technique.” In <i>Design, Automation and Test in Europe (DATE)</i>, n.d."},"date_updated":"2022-02-22T07:52:01Z","date_created":"2022-02-16T16:22:23Z","author":[{"first_name":"Linus Matthias","last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias"},{"last_name":"Wiersema","id":"3118","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"last_name":"Artmann","full_name":"Artmann, Matthias","first_name":"Matthias"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"title":"MUSCAT: MUS-based Circuit Approximation Technique","conference":{"name":"Design, Automation and Test in Europe (DATE)","location":"Online"}},{"title":"Evaluation of Algorithms for the Node Capacitated Clique","date_updated":"2022-02-28T07:46:53Z","author":[{"last_name":"Roopa","full_name":"Roopa, Rajanna","first_name":"Rajanna"}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2022-02-28T07:46:23Z","year":"2022","citation":{"bibtex":"@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated Clique}, author={Roopa, Rajanna}, year={2022} }","mla":"Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>. 2022.","short":"R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.","apa":"Roopa, R. (2022). <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.","ama":"Roopa R. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.; 2022.","chicago":"Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>, 2022.","ieee":"R. Roopa, <i>Evaluation of Algorithms for the Node Capacitated Clique</i>. 2022."},"language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"_id":"30152","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"mastersthesis"},{"citation":{"apa":"Korzeczek, S. (2022). <i>Aufarbeitung und lmplementierung von DAG-Rider</i>.","mla":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>. 2022.","bibtex":"@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider}, author={Korzeczek, Sebastian}, year={2022} }","short":"S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.","ama":"Korzeczek S. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>.; 2022.","ieee":"S. Korzeczek, <i>Aufarbeitung und lmplementierung von DAG-Rider</i>. 2022.","chicago":"Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>, 2022."},"year":"2022","title":"Aufarbeitung und lmplementierung von DAG-Rider","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"author":[{"first_name":"Sebastian","last_name":"Korzeczek","full_name":"Korzeczek, Sebastian"}],"date_created":"2022-03-03T07:47:00Z","date_updated":"2022-03-03T07:51:02Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"15504","_id":"30198","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}]},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"30199","status":"public","type":"mastersthesis","title":"Hybrid Routing in Three Dimensions","author":[{"full_name":"Nachtigall, Marcel","last_name":"Nachtigall","first_name":"Marcel"}],"supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2022-03-03T07:50:45Z","date_updated":"2022-03-03T07:50:59Z","citation":{"chicago":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>, 2022.","ieee":"M. Nachtigall, <i>Hybrid Routing in Three Dimensions</i>. 2022.","ama":"Nachtigall M. <i>Hybrid Routing in Three Dimensions</i>.; 2022.","short":"M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.","bibtex":"@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall, Marcel}, year={2022} }","mla":"Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>. 2022.","apa":"Nachtigall, M. (2022). <i>Hybrid Routing in Three Dimensions</i>."},"year":"2022"},{"title":"mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks","publisher":"IEEE","date_created":"2022-03-10T18:28:14Z","year":"2022","quality_controlled":"1","ddc":["004"],"keyword":["wireless mobile networks","network management","continuous control","cognitive networks","autonomous coordination","reinforcement learning","gym environment","simulation","open source"],"language":[{"iso":"eng"}],"abstract":[{"text":"Recent reinforcement learning approaches for continuous control in wireless mobile networks have shown impressive\r\nresults. But due to the lack of open and compatible simulators, authors typically create their own simulation environments for training and evaluation. This is cumbersome and time-consuming for authors and limits reproducibility and comparability, ultimately impeding progress in the field.\r\n\r\nTo this end, we propose mobile-env, a simple and open platform for training, evaluating, and comparing reinforcement learning and conventional approaches for continuous control in mobile wireless networks. mobile-env is lightweight and implements the common OpenAI Gym interface and additional wrappers, which allows connecting virtually any single-agent or multi-agent reinforcement learning framework to the environment. While mobile-env provides sensible default values and can be used out of the box, it also has many configuration options and is easy to extend. We therefore believe mobile-env to be a valuable platform for driving meaningful progress in autonomous coordination of\r\nwireless mobile networks.","lang":"eng"}],"file":[{"date_updated":"2022-03-10T18:25:41Z","date_created":"2022-03-10T18:25:41Z","creator":"stschn","file_size":223412,"access_level":"open_access","file_id":"30237","file_name":"author_version.pdf","content_type":"application/pdf","relation":"main_file"}],"publication":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","conference":{"location":"Budapest","end_date":"2022-04-29","start_date":"2022-04-25","name":"IEEE/IFIP Network Operations and Management Symposium (NOMS)"},"date_updated":"2022-03-10T18:28:19Z","oa":"1","author":[{"first_name":"Stefan Balthasar","last_name":"Schneider","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","id":"35343"},{"full_name":"Werner, Stefan","last_name":"Werner","first_name":"Stefan"},{"first_name":"Ramin","last_name":"Khalili","full_name":"Khalili, Ramin"},{"first_name":"Artur","full_name":"Hecker, Artur","last_name":"Hecker"},{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"citation":{"ama":"Schneider SB, Werner S, Khalili R, Hecker A, Karl H. mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks. In: <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE; 2022.","ieee":"S. B. Schneider, S. Werner, R. Khalili, A. Hecker, and H. Karl, “mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks,” presented at the IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest, 2022.","chicago":"Schneider, Stefan Balthasar, Stefan Werner, Ramin Khalili, Artur Hecker, and Holger Karl. “Mobile-Env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks.” In <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE, 2022.","short":"S.B. Schneider, S. Werner, R. Khalili, A. Hecker, H. Karl, in: IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2022.","mla":"Schneider, Stefan Balthasar, et al. “Mobile-Env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks.” <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>, IEEE, 2022.","bibtex":"@inproceedings{Schneider_Werner_Khalili_Hecker_Karl_2022, title={mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks}, booktitle={IEEE/IFIP Network Operations and Management Symposium (NOMS)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Werner, Stefan and Khalili, Ramin and Hecker, Artur and Karl, Holger}, year={2022} }","apa":"Schneider, S. B., Werner, S., Khalili, R., Hecker, A., &#38; Karl, H. (2022). mobile-env: An Open Platform for Reinforcement Learning in Wireless Mobile Networks. <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest."},"has_accepted_license":"1","file_date_updated":"2022-03-10T18:25:41Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"}],"_id":"30236","user_id":"35343","department":[{"_id":"75"}],"status":"public","type":"conference"},{"citation":{"short":"P. Fanasch, Governance and Reputation in the Market for Experience Goods, 2022.","bibtex":"@book{Fanasch_2022, title={Governance and Reputation in the Market for Experience Goods}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1292 \">10.17619/UNIPB/1-1292 </a>}, author={Fanasch, Patrizia}, year={2022} }","mla":"Fanasch, Patrizia. <i>Governance and Reputation in the Market for Experience Goods</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1292 \">10.17619/UNIPB/1-1292 </a>.","apa":"Fanasch, P. (2022). <i>Governance and Reputation in the Market for Experience Goods</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1292 \">https://doi.org/10.17619/UNIPB/1-1292 </a>","ieee":"P. Fanasch, <i>Governance and Reputation in the Market for Experience Goods</i>. 2022.","chicago":"Fanasch, Patrizia. <i>Governance and Reputation in the Market for Experience Goods</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1292 \">https://doi.org/10.17619/UNIPB/1-1292 </a>.","ama":"Fanasch P. <i>Governance and Reputation in the Market for Experience Goods</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1292 \">10.17619/UNIPB/1-1292 </a>"},"year":"2022","doi":"10.17619/UNIPB/1-1292 ","title":"Governance and Reputation in the Market for Experience Goods","supervisor":[{"last_name":"Frick","full_name":"Frick, Bernd","id":"16019","first_name":"Bernd"}],"author":[{"full_name":"Fanasch, Patrizia","last_name":"Fanasch","first_name":"Patrizia"}],"date_created":"2022-03-03T10:20:06Z","date_updated":"2022-03-11T06:08:40Z","status":"public","type":"dissertation","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"183"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Subproject A4"}],"_id":"30201"},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Subproject A4"}],"_id":"30341","user_id":"42447","department":[{"_id":"280"},{"_id":"475"},{"_id":"179"}],"type":"journal_article","status":"public","date_updated":"2022-03-21T06:07:39Z","author":[{"id":"42447","full_name":"Hoyer, Britta","last_name":"Hoyer","first_name":"Britta"},{"id":"10311","full_name":"van Straaten, Dirk","last_name":"van Straaten","first_name":"Dirk"}],"volume":98,"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/abs/pii/S2214804322000441"}],"doi":"10.1016/j.socec.2022.101869","publication_status":"published","publication_identifier":{"issn":["2214-8043"]},"citation":{"ama":"Hoyer B, van Straaten D. Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis. <i>Journal of Behavioral and Experimental Economics</i>. 2022;98:101869. doi:<a href=\"https://doi.org/10.1016/j.socec.2022.101869\">10.1016/j.socec.2022.101869</a>","chicago":"Hoyer, Britta, and Dirk van Straaten. “Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis.” <i>Journal of Behavioral and Experimental Economics</i> 98 (2022): 101869. <a href=\"https://doi.org/10.1016/j.socec.2022.101869\">https://doi.org/10.1016/j.socec.2022.101869</a>.","ieee":"B. Hoyer and D. van Straaten, “Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis,” <i>Journal of Behavioral and Experimental Economics</i>, vol. 98, p. 101869, 2022, doi: <a href=\"https://doi.org/10.1016/j.socec.2022.101869\">10.1016/j.socec.2022.101869</a>.","apa":"Hoyer, B., &#38; van Straaten, D. (2022). Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis. <i>Journal of Behavioral and Experimental Economics</i>, <i>98</i>, 101869. <a href=\"https://doi.org/10.1016/j.socec.2022.101869\">https://doi.org/10.1016/j.socec.2022.101869</a>","short":"B. Hoyer, D. van Straaten, Journal of Behavioral and Experimental Economics 98 (2022) 101869.","mla":"Hoyer, Britta, and Dirk van Straaten. “Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis.” <i>Journal of Behavioral and Experimental Economics</i>, vol. 98, Elsevier BV, 2022, p. 101869, doi:<a href=\"https://doi.org/10.1016/j.socec.2022.101869\">10.1016/j.socec.2022.101869</a>.","bibtex":"@article{Hoyer_van Straaten_2022, title={Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis}, volume={98}, DOI={<a href=\"https://doi.org/10.1016/j.socec.2022.101869\">10.1016/j.socec.2022.101869</a>}, journal={Journal of Behavioral and Experimental Economics}, publisher={Elsevier BV}, author={Hoyer, Britta and van Straaten, Dirk}, year={2022}, pages={101869} }"},"page":"101869","intvolume":"        98","keyword":["General Social Sciences","Economics and Econometrics","Applied Psychology"],"language":[{"iso":"eng"}],"publication":"Journal of Behavioral and Experimental Economics","publisher":"Elsevier BV","date_created":"2022-03-16T06:24:37Z","title":"Anonymity and Self-Expression in Online Rating Systems - An Experimental Analysis","year":"2022"},{"department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"user_id":"38209","_id":"30868","external_id":{"arxiv":["2202.01651"]},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"language":[{"iso":"eng"}],"publication":"arXiv:2202.01651","type":"preprint","status":"public","abstract":[{"text":"Algorithm configuration (AC) is concerned with the automated search of the\r\nmost suitable parameter configuration of a parametrized algorithm. There is\r\ncurrently a wide variety of AC problem variants and methods proposed in the\r\nliterature. Existing reviews do not take into account all derivatives of the AC\r\nproblem, nor do they offer a complete classification scheme. To this end, we\r\nintroduce taxonomies to describe the AC problem and features of configuration\r\nmethods, respectively. We review existing AC literature within the lens of our\r\ntaxonomies, outline relevant design choices of configuration approaches,\r\ncontrast methods and problem variants against each other, and describe the\r\nstate of AC in industry. Finally, our review provides researchers and\r\npractitioners with a look at future research directions in the field of AC.","lang":"eng"}],"author":[{"first_name":"Elias","last_name":"Schede","full_name":"Schede, Elias"},{"first_name":"Jasmin","full_name":"Brandt, Jasmin","last_name":"Brandt"},{"first_name":"Alexander","full_name":"Tornede, Alexander","id":"38209","last_name":"Tornede"},{"first_name":"Marcel Dominik","full_name":"Wever, Marcel Dominik","id":"33176","orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever"},{"first_name":"Viktor","last_name":"Bengs","full_name":"Bengs, Viktor","id":"76599"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"},{"full_name":"Tierney, Kevin","last_name":"Tierney","first_name":"Kevin"}],"date_created":"2022-04-12T12:00:08Z","date_updated":"2022-04-12T12:01:15Z","title":"A Survey of Methods for Automated Algorithm Configuration","citation":{"bibtex":"@article{Schede_Brandt_Tornede_Wever_Bengs_Hüllermeier_Tierney_2022, title={A Survey of Methods for Automated Algorithm Configuration}, journal={arXiv:2202.01651}, author={Schede, Elias and Brandt, Jasmin and Tornede, Alexander and Wever, Marcel Dominik and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2022} }","mla":"Schede, Elias, et al. “A Survey of Methods for Automated Algorithm Configuration.” <i>ArXiv:2202.01651</i>, 2022.","short":"E. Schede, J. Brandt, A. Tornede, M.D. Wever, V. Bengs, E. Hüllermeier, K. Tierney, ArXiv:2202.01651 (2022).","apa":"Schede, E., Brandt, J., Tornede, A., Wever, M. D., Bengs, V., Hüllermeier, E., &#38; Tierney, K. (2022). A Survey of Methods for Automated Algorithm Configuration. In <i>arXiv:2202.01651</i>.","ama":"Schede E, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm Configuration. <i>arXiv:220201651</i>. Published online 2022.","chicago":"Schede, Elias, Jasmin Brandt, Alexander Tornede, Marcel Dominik Wever, Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “A Survey of Methods for Automated Algorithm Configuration.” <i>ArXiv:2202.01651</i>, 2022.","ieee":"E. Schede <i>et al.</i>, “A Survey of Methods for Automated Algorithm Configuration,” <i>arXiv:2202.01651</i>. 2022."},"year":"2022"},{"department":[{"_id":"78"}],"series_title":"Lecture Notes in Computer Science","user_id":"49992","_id":"30971","project":[{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"},{"_id":"1","name":"SFB 901: SFB 901"}],"status":"public","type":"conference","conference":{"name":"25th International Conference on Applications of Evolutionary Computation, EvoApplications 2022","start_date":"2022-04-20","end_date":"2022-04-22","location":"Madrid"},"doi":"10.1007/978-3-031-02462-7_25","volume":13224,"author":[{"id":"49992","full_name":"Hansmeier, Tim","orcid":"0000-0003-1377-3339","last_name":"Hansmeier","first_name":"Tim"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"date_updated":"2022-04-28T10:24:18Z","page":"386-401","intvolume":"     13224","citation":{"apa":"Hansmeier, T., &#38; Platzner, M. (2022). Integrating Safety Guarantees into the Learning Classifier System XCS. <i>Applications of Evolutionary Computation, EvoApplications 2022, Proceedings</i>, <i>13224</i>, 386–401. <a href=\"https://doi.org/10.1007/978-3-031-02462-7_25\">https://doi.org/10.1007/978-3-031-02462-7_25</a>","short":"T. Hansmeier, M. Platzner, in: Applications of Evolutionary Computation, EvoApplications 2022, Proceedings, Springer International Publishing, 2022, pp. 386–401.","mla":"Hansmeier, Tim, and Marco Platzner. “Integrating Safety Guarantees into the Learning Classifier System XCS.” <i>Applications of Evolutionary Computation, EvoApplications 2022, Proceedings</i>, vol. 13224, Springer International Publishing, 2022, pp. 386–401, doi:<a href=\"https://doi.org/10.1007/978-3-031-02462-7_25\">10.1007/978-3-031-02462-7_25</a>.","bibtex":"@inproceedings{Hansmeier_Platzner_2022, series={Lecture Notes in Computer Science}, title={Integrating Safety Guarantees into the Learning Classifier System XCS}, volume={13224}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-02462-7_25\">10.1007/978-3-031-02462-7_25</a>}, booktitle={Applications of Evolutionary Computation, EvoApplications 2022, Proceedings}, publisher={Springer International Publishing}, author={Hansmeier, Tim and Platzner, Marco}, year={2022}, pages={386–401}, collection={Lecture Notes in Computer Science} }","ama":"Hansmeier T, Platzner M. Integrating Safety Guarantees into the Learning Classifier System XCS. In: <i>Applications of Evolutionary Computation, EvoApplications 2022, Proceedings</i>. Vol 13224. Lecture Notes in Computer Science. Springer International Publishing; 2022:386-401. doi:<a href=\"https://doi.org/10.1007/978-3-031-02462-7_25\">10.1007/978-3-031-02462-7_25</a>","chicago":"Hansmeier, Tim, and Marco Platzner. “Integrating Safety Guarantees into the Learning Classifier System XCS.” In <i>Applications of Evolutionary Computation, EvoApplications 2022, Proceedings</i>, 13224:386–401. Lecture Notes in Computer Science. Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-02462-7_25\">https://doi.org/10.1007/978-3-031-02462-7_25</a>.","ieee":"T. Hansmeier and M. Platzner, “Integrating Safety Guarantees into the Learning Classifier System XCS,” in <i>Applications of Evolutionary Computation, EvoApplications 2022, Proceedings</i>, Madrid, 2022, vol. 13224, pp. 386–401, doi: <a href=\"https://doi.org/10.1007/978-3-031-02462-7_25\">10.1007/978-3-031-02462-7_25</a>."},"publication_identifier":{"isbn":["9783031024610","9783031024627"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"publication":"Applications of Evolutionary Computation, EvoApplications 2022, Proceedings","title":"Integrating Safety Guarantees into the Learning Classifier System XCS","date_created":"2022-04-28T09:42:33Z","publisher":"Springer International Publishing","year":"2022"},{"language":[{"iso":"eng"}],"file_date_updated":"2022-06-20T06:16:09Z","ddc":["000"],"department":[{"_id":"79"}],"user_id":"15504","_id":"31947","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":1585281,"access_level":"closed","file_name":"BA_Hillebrandt.pdf","file_id":"31950","date_updated":"2022-06-20T06:16:09Z","date_created":"2022-06-20T06:16:09Z","creator":"florida"}],"type":"bachelorsthesis","title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","author":[{"first_name":"Henning","last_name":"Hillebrandt","full_name":"Hillebrandt, Henning"}],"supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2022-06-20T06:16:32Z","date_updated":"2022-06-20T06:16:49Z","citation":{"ama":"Hillebrandt H. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>.; 2022.","chicago":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>, 2022.","ieee":"H. Hillebrandt, <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","apa":"Hillebrandt, H. (2022). <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>.","mla":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","short":"H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","bibtex":"@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }"},"year":"2022","has_accepted_license":"1"},{"title":"Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided Platforms","date_updated":"2022-06-30T13:14:30Z","date_created":"2020-08-12T14:11:25Z","author":[{"first_name":"Martin","last_name":"Poniatowski","id":"32441","full_name":"Poniatowski, Martin"},{"full_name":"Lüttenberg, Hedda","id":"60612","last_name":"Lüttenberg","first_name":"Hedda"},{"last_name":"Beverungen","full_name":"Beverungen, Daniel","id":"59677","first_name":"Daniel"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"volume":2,"year":"2022","citation":{"ama":"Poniatowski M, Lüttenberg H, Beverungen D, Kundisch D. Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided Platforms. <i>Information Systems and e-Business Management, Special Issue on Platform Business Models and Platform Strategies</i>. 2022;2:257-283.","ieee":"M. Poniatowski, H. Lüttenberg, D. Beverungen, and D. Kundisch, “Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided Platforms,” <i>Information Systems and e-Business Management, Special Issue on Platform Business Models and Platform Strategies</i>, vol. 2, pp. 257–283, 2022.","chicago":"Poniatowski, Martin, Hedda Lüttenberg, Daniel Beverungen, and Dennis Kundisch. “Three Layers of Abstraction—A Conceptual Framework for Theorizing Digital Multi-Sided Platforms.” <i>Information Systems and E-Business Management, Special Issue on Platform Business Models and Platform Strategies</i> 2 (2022): 257–83.","apa":"Poniatowski, M., Lüttenberg, H., Beverungen, D., &#38; Kundisch, D. (2022). Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided Platforms. <i>Information Systems and E-Business Management, Special Issue on Platform Business Models and Platform Strategies</i>, <i>2</i>, 257–283.","bibtex":"@article{Poniatowski_Lüttenberg_Beverungen_Kundisch_2022, title={Three Layers of Abstraction—A Conceptual Framework for Theorizing digital Multi-Sided Platforms}, volume={2}, journal={Information Systems and e-Business Management, Special Issue on Platform Business Models and Platform Strategies}, author={Poniatowski, Martin and Lüttenberg, Hedda and Beverungen, Daniel and Kundisch, Dennis}, year={2022}, pages={257–283} }","short":"M. Poniatowski, H. Lüttenberg, D. Beverungen, D. Kundisch, Information Systems and E-Business Management, Special Issue on Platform Business Models and Platform Strategies 2 (2022) 257–283.","mla":"Poniatowski, Martin, et al. “Three Layers of Abstraction—A Conceptual Framework for Theorizing Digital Multi-Sided Platforms.” <i>Information Systems and E-Business Management, Special Issue on Platform Business Models and Platform Strategies</i>, vol. 2, 2022, pp. 257–83."},"intvolume":"         2","page":"257 - 283","publication_status":"published","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"17869","user_id":"16205","department":[{"_id":"276"}],"status":"public","type":"journal_article","publication":"Information Systems and e-Business Management, Special Issue on Platform Business Models and Platform Strategies"},{"citation":{"chicago":"Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven Testing of Black-Box Functions.” In <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–23. IEEE, 2022.","ieee":"A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven Testing of Black-Box Functions,” in <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 2022, pp. 113–123.","bibtex":"@inproceedings{Sharma_Melnikov_Hüllermeier_Wehrheim_2022, title={Property-Driven Testing of Black-Box Functions}, booktitle={Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)}, publisher={IEEE}, author={Sharma, Arnab and Melnikov, Vitaly and Hüllermeier, Eyke and Wehrheim, Heike}, year={2022}, pages={113–123} }","short":"A. Sharma, V. Melnikov, E. Hüllermeier, H. Wehrheim, in: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), IEEE, 2022, pp. 113–123.","mla":"Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, IEEE, 2022, pp. 113–23.","apa":"Sharma, A., Melnikov, V., Hüllermeier, E., &#38; Wehrheim, H. (2022). Property-Driven Testing of Black-Box Functions. <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–123.","ama":"Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of Black-Box Functions. In: <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>. IEEE; 2022:113-123."},"page":"113-123","year":"2022","title":"Property-Driven Testing of Black-Box Functions","date_created":"2022-07-01T11:18:03Z","author":[{"id":"67200","full_name":"Sharma, Arnab","last_name":"Sharma","first_name":"Arnab"},{"id":"58747","full_name":"Melnikov, Vitaly","last_name":"Melnikov","first_name":"Vitaly"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_updated":"2022-07-01T11:21:36Z","publisher":"IEEE","status":"public","abstract":[{"text":"Testing is one of the most frequent means of quality assurance for software. Property-based testing aims at generating test suites for checking code against user-defined properties. Test input generation is, however, most often independent of the property to be checked, and is instead based on random or user-defined data generation.In this paper, we present property-driven unit testing of functions with numerical inputs and outputs. Alike property-based testing, it allows users to define the properties to be tested for. Contrary to property-based testing, it also uses the property for a targeted generation of test inputs. Our approach is a form of learning-based testing where we first of all learn a model of a given black-box function using standard machine learning algorithms, and in a second step use model and property for test input generation. This allows us to test both predefined functions as well as machine learned regression models. Our experimental evaluation shows that our property-driven approach is more effective than standard property-based testing techniques.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"7"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"_id":"32311"},{"doi":"10.1109/ICSA-C54293.2022.00011","conference":{"location":"Hawaii","end_date":"2022-03-15","start_date":"2022-03-12","name":"18th International Conference on Software Architecture "},"oa":"1","date_updated":"2022-07-04T12:34:53Z","author":[{"id":"47208","full_name":"Gottschalk, Sebastian","last_name":"Gottschalk","first_name":"Sebastian"},{"id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas","first_name":"Enes"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"citation":{"apa":"Gottschalk, S., Yigitbas, E., &#38; Engels, G. (2022). Model-driven Continuous Experimentation on Component-based Software Architectures . <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>. 18th International Conference on Software Architecture , Hawaii. <a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">https://doi.org/10.1109/ICSA-C54293.2022.00011</a>","mla":"Gottschalk, Sebastian, et al. “Model-Driven Continuous Experimentation on Component-Based Software Architectures .” <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>.","bibtex":"@inproceedings{Gottschalk_Yigitbas_Engels_2022, title={Model-driven Continuous Experimentation on Component-based Software Architectures }, DOI={<a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>}, booktitle={Proceedings of the 18th International Conference on Software Architecture Companion }, publisher={IEEE}, author={Gottschalk, Sebastian and Yigitbas, Enes and Engels, Gregor}, year={2022} }","short":"S. Gottschalk, E. Yigitbas, G. Engels, in: Proceedings of the 18th International Conference on Software Architecture Companion , IEEE, 2022.","ama":"Gottschalk S, Yigitbas E, Engels G. Model-driven Continuous Experimentation on Component-based Software Architectures . In: <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>","chicago":"Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Driven Continuous Experimentation on Component-Based Software Architectures .” In <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">https://doi.org/10.1109/ICSA-C54293.2022.00011</a>.","ieee":"S. Gottschalk, E. Yigitbas, and G. Engels, “Model-driven Continuous Experimentation on Component-based Software Architectures ,” presented at the 18th International Conference on Software Architecture , Hawaii, 2022, doi: <a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>."},"has_accepted_license":"1","file_date_updated":"2022-07-04T12:34:52Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"_id":"29842","user_id":"47208","department":[{"_id":"66"},{"_id":"534"}],"status":"public","type":"conference","title":"Model-driven Continuous Experimentation on Component-based Software Architectures ","publisher":"IEEE","date_created":"2022-02-15T07:32:10Z","year":"2022","ddc":["000"],"keyword":["continuous experimentation","model-driven","component-based software architectures","self-adaptation"],"language":[{"iso":"eng"}],"abstract":[{"text":"To build successful software products, developers continuously have to discover what features the users really need. This discovery can be achieved with continuous experimentation, testing different software variants with distinct user groups, and deploying the superior variant for all users. However, existing approaches do not focus on explicit modeling of variants and experiments, which offers advantages such as traceability of decisions and combinability of experiments. Therefore, our vision is the provision of model-driven continuous experimentation, which provides the developer with a framework for structuring the experimentation process. For that, we introduce the overall concept, apply it to the experimentation on component-based software architectures and point out future research questions. In particular, we show the applicability by combining feature models for modeling the software variants, users, and experiments (i.e., model-driven) with MAPE-K for the adaptation (i.e., continuous experimentation) and implementing the concept based on the component-based Angular framework.","lang":"eng"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_id":"32322","access_level":"open_access","file_name":"ICSA_CR.pdf","file_size":183185,"creator":"sego","date_created":"2022-07-04T12:33:18Z","date_updated":"2022-07-04T12:34:52Z"}],"publication":"Proceedings of the 18th International Conference on Software Architecture Companion "},{"citation":{"short":"E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable Matching, 2022.","mla":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022.","bibtex":"@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }","apa":"Vahle, E. (2022). <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>.","ama":"Vahle E. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>.; 2022.","chicago":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>, 2022.","ieee":"E. Vahle, <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022."},"year":"2022","title":"Modelling and Proving Security for a Secure MPC Protocol for Stable Matching","supervisor":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2022-07-20T09:38:39Z","author":[{"full_name":"Vahle, Ella","last_name":"Vahle","first_name":"Ella"}],"date_updated":"2022-07-26T14:31:54Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"25078","department":[{"_id":"64"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"_id":"32399"},{"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"31847","user_id":"39241","department":[{"_id":"63"}],"type":"conference","status":"public","date_updated":"2022-08-02T08:07:30Z","author":[{"id":"38705","full_name":"Castenow, Jannik","last_name":"Castenow","first_name":"Jannik"},{"first_name":"Björn","full_name":"Feldkord, Björn","id":"22704","last_name":"Feldkord"},{"id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann","first_name":"Till"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","id":"41265","first_name":"Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"doi":"10.1145/3490148.3538595","publication_identifier":{"isbn":["9781450391467"]},"citation":{"ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2022:345-356. doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>.","ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,” in <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2022, pp. 345–356, doi: <a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","mla":"Castenow, Jannik, et al. “The K-Server with Preferences Problem.” <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2022, pp. 345–56, doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022, title={The k-Server with Preferences Problem}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>}, booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={Association for Computing Machinery}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2022}, pages={345–356} }","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–356. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>"},"page":"345-356","external_id":{"arxiv":["2205.11102"]},"keyword":["K-Server Problem","Heterogeneity","Online Caching"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","abstract":[{"text":"The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).\r\n\r\nIn our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n    \r\nThe two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously.","lang":"eng"}],"publisher":"Association for Computing Machinery","date_created":"2022-06-10T09:06:42Z","title":"The k-Server with Preferences Problem","year":"2022"},{"language":[{"iso":"eng"}],"_id":"33085","project":[{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"user_id":"88252","series_title":"LIPIcs","editor":[{"full_name":"Berenbrink, Petra","last_name":"Berenbrink","first_name":"Petra"},{"first_name":"Benjamin","last_name":"Monmege","full_name":"Monmege, Benjamin"}],"status":"public","publication":"39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)","type":"conference","title":"Cardinality Constrained Scheduling in Online Models","doi":"10.4230/LIPIcs.STACS.2022.28","date_updated":"2022-11-08T16:34:32Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":219,"date_created":"2022-08-23T08:10:36Z","author":[{"last_name":"Epstein","full_name":"Epstein, Leah","first_name":"Leah"},{"full_name":"Lassota, Alexandra","last_name":"Lassota","first_name":"Alexandra"},{"first_name":"Asaf","last_name":"Levin","full_name":"Levin, Asaf"},{"first_name":"Marten","last_name":"Maack","full_name":"Maack, Marten","id":"88252"},{"first_name":"Lars","full_name":"Rohwedder, Lars","last_name":"Rohwedder"}],"year":"2022","page":"28:1–28:15","intvolume":"       219","citation":{"apa":"Epstein, L., Lassota, A., Levin, A., Maack, M., &#38; Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink &#38; B. Monmege (Eds.), <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i> (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>","bibtex":"@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs}, title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>}, booktitle={39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink, Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs} }","mla":"Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.” <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","short":"L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink, B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.","ama":"Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>. Vol 219. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>","ieee":"L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality Constrained Scheduling in Online Models,” in <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, 2022, vol. 219, p. 28:1–28:15, doi: <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","chicago":"Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.” In <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>."}},{"language":[{"iso":"eng"}],"user_id":"38209","_id":"34103","external_id":{"arxiv":["2210.17341"]},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"status":"public","abstract":[{"text":"It is well known that different algorithms perform differently well on an\r\ninstance of an algorithmic problem, motivating algorithm selection (AS): Given\r\nan instance of an algorithmic problem, which is the most suitable algorithm to\r\nsolve it? As such, the AS problem has received considerable attention resulting\r\nin various approaches - many of which either solve a regression or ranking\r\nproblem under the hood. Although both of these formulations yield very natural\r\nways to tackle AS, they have considerable weaknesses. On the one hand,\r\ncorrectly predicting the performance of an algorithm on an instance is a\r\nsufficient, but not a necessary condition to produce a correct ranking over\r\nalgorithms and in particular ranking the best algorithm first. On the other\r\nhand, classical ranking approaches often do not account for concrete\r\nperformance values available in the training data, but only leverage rankings\r\ncomposed from such data. We propose HARRIS- Hybrid rAnking and RegRessIon\r\nforeSts - a new algorithm selector leveraging special forests, combining the\r\nstrengths of both approaches while alleviating their weaknesses. HARRIS'\r\ndecisions are based on a forest model, whose trees are created based on splits\r\noptimized on a hybrid ranking and regression loss function. As our preliminary\r\nexperimental study on ASLib shows, HARRIS improves over standard algorithm\r\nselection approaches on some scenarios showing that combining ranking and\r\nregression in trees is indeed promising for AS.","lang":"eng"}],"publication":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022","type":"conference","conference":{"location":"Baltimore","name":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022"},"title":"HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection","author":[{"full_name":"Fehring, Lukass","last_name":"Fehring","first_name":"Lukass"},{"id":"43980","full_name":"Hanselle, Jonas Manuel","last_name":"Hanselle","orcid":"0000-0002-1231-4985","first_name":"Jonas Manuel"},{"first_name":"Alexander","last_name":"Tornede","id":"38209","full_name":"Tornede, Alexander"}],"date_created":"2022-11-17T12:57:40Z","date_updated":"2022-11-17T13:00:53Z","citation":{"ama":"Fehring L, Hanselle JM, Tornede A. HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. In: <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>. ; 2022.","chicago":"Fehring, Lukass, Jonas Manuel Hanselle, and Alexander Tornede. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” In <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>, 2022.","ieee":"L. Fehring, J. M. Hanselle, and A. Tornede, “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection,” presented at the Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore, 2022.","mla":"Fehring, Lukass, et al. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>, 2022.","bibtex":"@inproceedings{Fehring_Hanselle_Tornede_2022, title={HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection}, booktitle={Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022}, author={Fehring, Lukass and Hanselle, Jonas Manuel and Tornede, Alexander}, year={2022} }","short":"L. Fehring, J.M. Hanselle, A. Tornede, in: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.","apa":"Fehring, L., Hanselle, J. M., &#38; Tornede, A. (2022). HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. <i>Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022</i>. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore."},"year":"2022"}]