[{"year":"2022","citation":{"ama":"Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. In: <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. ; 2022. doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>","ieee":"K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi: <a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","chicago":"Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” In <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022. <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>.","mla":"Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>, 2022, doi:<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>.","short":"K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022.","bibtex":"@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={<a href=\"https://doi.org/10.1145/3511095.3531287\">10.1145/3511095.3531287</a>}, booktitle={Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }","apa":"Dreßler, K., Sherif, M., &#38; Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. <i>Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia</i>. HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain). <a href=\"https://doi.org/10.1145/3511095.3531287\">https://doi.org/10.1145/3511095.3531287</a>"},"title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning","doi":"10.1145/3511095.3531287","conference":{"start_date":"2022-06-28","name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media","location":"Barcelona (Spain)","end_date":"2022-07-01"},"date_updated":"2022-11-18T10:11:38Z","author":[{"id":"78256","full_name":"Dreßler, Kevin","last_name":"Dreßler","first_name":"Kevin"},{"first_name":"Mohamed","last_name":"Sherif","full_name":"Sherif, Mohamed","id":"67234"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"date_created":"2022-06-08T08:47:33Z","abstract":[{"lang":"eng","text":"The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds"}],"status":"public","type":"conference","publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","ddc":["000"],"keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"_id":"31806","user_id":"477","department":[{"_id":"34"}]},{"ddc":["006"],"language":[{"iso":"eng"}],"publication":"IFAC-PapersOnLine","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"aredder","date_created":"2022-08-31T07:06:30Z","date_updated":"2022-08-31T07:06:30Z","file_name":"NecSys2022____Practical_Conditions_for_Conv.pdf","access_level":"closed","file_id":"33236","file_size":298395}],"publisher":"Elsevier","date_created":"2022-08-16T09:12:55Z","title":"Practical Network Conditions for the Convergence of Distributed Optimization","issue":"13","year":"2022","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"}],"_id":"32854","user_id":"477","department":[{"_id":"75"}],"file_date_updated":"2022-08-31T07:06:30Z","type":"journal_article","status":"public","date_updated":"2022-11-18T10:05:14Z","author":[{"first_name":"Adrian","last_name":"Redder","orcid":"https://orcid.org/0000-0001-7391-4688","id":"52265","full_name":"Redder, Adrian"},{"full_name":"Ramaswamy, Arunselvan","id":"66937","last_name":"Ramaswamy","orcid":"https://orcid.org/ 0000-0001-7547-8111","first_name":"Arunselvan"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"volume":55,"conference":{"name":"IFAC Conference on Networked Systems"},"has_accepted_license":"1","citation":{"bibtex":"@article{Redder_Ramaswamy_Karl_2022, title={Practical Network Conditions for the Convergence of Distributed Optimization}, volume={55}, number={13}, journal={IFAC-PapersOnLine}, publisher={Elsevier}, author={Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}, year={2022}, pages={133–138} }","mla":"Redder, Adrian, et al. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, Elsevier, 2022, pp. 133–138.","short":"A. Redder, A. Ramaswamy, H. Karl, IFAC-PapersOnLine 55 (2022) 133–138.","apa":"Redder, A., Ramaswamy, A., &#38; Karl, H. (2022). Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>, <i>55</i>(13), 133–138.","ieee":"A. Redder, A. Ramaswamy, and H. Karl, “Practical Network Conditions for the Convergence of Distributed Optimization,” <i>IFAC-PapersOnLine</i>, vol. 55, no. 13, pp. 133–138, 2022.","chicago":"Redder, Adrian, Arunselvan Ramaswamy, and Holger Karl. “Practical Network Conditions for the Convergence of Distributed Optimization.” <i>IFAC-PapersOnLine</i> 55, no. 13 (2022): 133–138.","ama":"Redder A, Ramaswamy A, Karl H. Practical Network Conditions for the Convergence of Distributed Optimization. <i>IFAC-PapersOnLine</i>. 2022;55(13):133–138."},"page":"133–138","intvolume":"        55"},{"page":"2071-2079","citation":{"bibtex":"@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}, DOI={<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>}, booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery (ACM)}, author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079} }","short":"T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery (ACM), New York, NY, United States, 2022, pp. 2071–2079.","mla":"Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery (ACM), 2022, pp. 2071–79, doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","apa":"Hansmeier, T., Brede, M., &#38; Platzner, M. (2022). XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–2079. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>","ama":"Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion. In: <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. Association for Computing Machinery (ACM); 2022:2071-2079. doi:<a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>","ieee":"T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion,” in <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Boston, MA, USA, 2022, pp. 2071–2079, doi: <a href=\"https://doi.org/10.1145/3520304.3533977\">10.1145/3520304.3533977</a>.","chicago":"Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In <i>GECCO ’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2071–79. New York, NY, United States: Association for Computing Machinery (ACM), 2022. <a href=\"https://doi.org/10.1145/3520304.3533977\">https://doi.org/10.1145/3520304.3533977</a>."},"year":"2022","place":"New York, NY, United States","publication_status":"published","doi":"10.1145/3520304.3533977","conference":{"name":"International Workshop on Learning Classifier Systems (IWLCS 2022)","start_date":"2022-07-09","end_date":"2022-07-13","location":"Boston, MA, USA"},"title":"XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion","date_created":"2022-09-02T11:47:17Z","author":[{"id":"49992","full_name":"Hansmeier, Tim","orcid":"0000-0003-1377-3339","last_name":"Hansmeier","first_name":"Tim"},{"full_name":"Brede, Mathis","last_name":"Brede","first_name":"Mathis"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_updated":"2022-11-18T10:13:22Z","publisher":"Association for Computing Machinery (ACM)","status":"public","publication":"GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"477","_id":"33253","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - Subproject C2"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}]},{"title":"Analyzing Culture-Specific Argument Structures in Learner Essays","date_created":"2022-09-06T13:51:23Z","author":[{"first_name":"Wei-Fan","id":"82920","full_name":"Chen, Wei-Fan","last_name":"Chen"},{"last_name":"Chen","full_name":"Chen, Mei-Hua","first_name":"Mei-Hua"},{"last_name":"Mudgal","full_name":"Mudgal, Garima","first_name":"Garima"},{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"}],"date_updated":"2022-11-18T09:56:17Z","citation":{"apa":"Chen, W.-F., Chen, M.-H., Mudgal, G., &#38; Wachsmuth, H. (2022). Analyzing Culture-Specific Argument Structures in Learner Essays. <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61.","short":"W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","mla":"Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner Essays.” <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","bibtex":"@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }","chicago":"Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing Culture-Specific Argument Structures in Learner Essays.” In <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 51–61, 2022.","ieee":"W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific Argument Structures in Learner Essays,” in <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>, 2022, pp. 51–61.","ama":"Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument Structures in Learner Essays. In: <i>Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)</i>. ; 2022:51-61."},"page":"51 - 61","year":"2022","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"600"}],"project":[{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"_id":"33274","status":"public","type":"conference","publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)"},{"publication":"30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany","type":"conference","status":"public","editor":[{"last_name":"Chechik","full_name":"Chechik, Shiri","first_name":"Shiri"},{"first_name":"Gonzalo","full_name":"Navarro, Gonzalo","last_name":"Navarro"},{"first_name":"Eva","full_name":"Rotenberg, Eva","last_name":"Rotenberg"},{"last_name":"Herman","full_name":"Herman, Grzegorz","first_name":"Grzegorz"}],"department":[{"_id":"63"}],"user_id":"477","series_title":"LIPIcs","_id":"33491","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C4: SFB 901 - Subproject C4","_id":"16"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"eng"}],"page":"77:1–77:13","intvolume":"       244","citation":{"apa":"Maack, M., Pukrop, S., &#38; Rasmussen, A. R. (2022). (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik, G. Navarro, E. Rotenberg, &#38; G. Herman (Eds.), <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i> (Vol. 244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>","short":"M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg, G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13.","bibtex":"@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>}, booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}, editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}, year={2022}, pages={77:1–77:13}, collection={LIPIcs} }","mla":"Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 77:1–77:13, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","ieee":"M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling,” in <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, 2022, vol. 244, p. 77:1–77:13, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>.","chicago":"Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling.” In <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">https://doi.org/10.4230/LIPIcs.ESA.2022.77</a>.","ama":"Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg E, Herman G, eds. <i>30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany</i>. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:77:1–77:13. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2022.77\">10.4230/LIPIcs.ESA.2022.77</a>"},"year":"2022","volume":244,"author":[{"last_name":"Maack","full_name":"Maack, Marten","id":"88252","first_name":"Marten"},{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"},{"full_name":"Rasmussen, Anna Rodriguez","last_name":"Rasmussen","first_name":"Anna Rodriguez"}],"date_created":"2022-09-27T13:06:05Z","date_updated":"2022-11-18T10:14:14Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.ESA.2022.77","title":"(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling"},{"status":"public","abstract":[{"lang":"eng","text":"We study the consequences of modeling asymmetric bargaining power in two-person bargaining problems. Comparing application of an asymmetric version of a bargaining solution to an upfront modification of the disagreement point, the resulting distortion crucially depends on the bargaining solution concept. While for the Kalai-Smorodinsky solution weaker players benefit from modifying the disagreement point, the situation is reversed for the Nash bargaining solution. There, weaker players are better off in the asymmetric bargaining solution. When comparing application of the asymmetric versions of the Nash and the Kalai-Smorodinsky solutions, we demonstrate that there is an upper bound for the weight of a player, so that she is better off with the Nash bargaining solution. This threshold is ultimately determined by the relative utilitarian bargaining solution. From a mechanism design perspective, our results provide valuable information for a social planner, when implementing a bargaining solution for unequally powerful players."}],"type":"working_paper","language":[{"iso":"eng"}],"keyword":["Asymmetric bargaining power","Nash bargaining solution","Kalai-Smorodinsky bargaining solution"],"department":[{"_id":"205"},{"_id":"475"},{"_id":"200"}],"series_title":"CIE Working Paper Series","user_id":"20801","_id":"32106","project":[{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901: SFB 901","_id":"1"}],"intvolume":"       148","page":"17","citation":{"bibtex":"@book{Haake_Streck_2022, series={CIE Working Paper Series}, title={Distortion through modeling asymmetric bargaining power}, volume={148}, author={Haake, Claus-Jochen and Streck, Thomas}, year={2022}, collection={CIE Working Paper Series} }","mla":"Haake, Claus-Jochen, and Thomas Streck. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. 2022.","short":"C.-J. Haake, T. Streck, Distortion through Modeling Asymmetric Bargaining Power, 2022.","apa":"Haake, C.-J., &#38; Streck, T. (2022). <i>Distortion through modeling asymmetric bargaining power</i> (Vol. 148).","ama":"Haake C-J, Streck T. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. Vol 148.; 2022.","ieee":"C.-J. Haake and T. Streck, <i>Distortion through modeling asymmetric bargaining power</i>, vol. 148. 2022.","chicago":"Haake, Claus-Jochen, and Thomas Streck. <i>Distortion through Modeling Asymmetric Bargaining Power</i>. Vol. 148. CIE Working Paper Series, 2022."},"jel":["C78","D63"],"year":"2022","title":"Distortion through modeling asymmetric bargaining power","volume":148,"author":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"},{"last_name":"Streck","id":"33041","full_name":"Streck, Thomas","first_name":"Thomas"}],"date_created":"2022-06-22T12:12:58Z","date_updated":"2022-11-19T15:42:15Z"},{"year":"2022","title":"Chatbot-Enhanced Requirements Resolution for Automated Service Compositions","date_created":"2022-06-27T09:27:06Z","publisher":"Springer International Publishing","file":[{"date_created":"2022-11-28T13:21:32Z","creator":"jkers","date_updated":"2022-11-28T13:21:32Z","access_level":"closed","file_name":"Kersting et al. (2022), Kersting2022.pdf","file_id":"34150","file_size":1153017,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"text":"This work addresses the automatic resolution of software requirements. In the vision of On-The-Fly Computing, software services should be composed on demand, based solely on natural language input from human users. To enable this, we build a chatbot solution that works with human-in-the-loop support to receive, analyze, correct, and complete their software requirements. The chatbot is equipped with a natural language processing pipeline and a large knowledge base, as well as sophisticated dialogue management skills to enhance the user experience. Previous solutions have focused on analyzing software requirements to point out errors such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate with users to efficiently produce correct requirements. We developed and compared three different chatbot apps that can work with built-in knowledge. We rely on ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own knowledge base, Rasa is the best system to combine the text mining and knowledge solutions at our disposal. The evaluation shows that users accept 73% of the suggested answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot.","lang":"eng"}],"publication":"HCI International 2022 Posters","language":[{"iso":"eng"}],"ddc":["004"],"keyword":["On-The-Fly Computing","Chatbot","Knowledge Base"],"citation":{"apa":"Kersting, J., Ahmed, M., &#38; Geierhos, M. (2022). Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In C. Stephanidis, M. Antona, &#38; S. Ntoa (Eds.), <i>HCI International 2022 Posters</i> (Vol. 1580, pp. 419--426). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">https://doi.org/10.1007/978-3-031-06417-3_56</a>","mla":"Kersting, Joschka, et al. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” <i>HCI International 2022 Posters</i>, edited by Constantine Stephanidis et al., vol. 1580, Springer International Publishing, 2022, pp. 419--426, doi:<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>.","short":"J. Kersting, M. Ahmed, M. Geierhos, in: C. Stephanidis, M. Antona, S. Ntoa (Eds.), HCI International 2022 Posters, Springer International Publishing, Cham, Switzerland, 2022, pp. 419--426.","bibtex":"@inbook{Kersting_Ahmed_Geierhos_2022, place={Cham, Switzerland}, series={Communications in Computer and Information Science (CCIS)}, title={Chatbot-Enhanced Requirements Resolution for Automated Service Compositions}, volume={1580}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>}, booktitle={HCI International 2022 Posters}, publisher={Springer International Publishing}, author={Kersting, Joschka and Ahmed, Mobeen and Geierhos, Michaela}, editor={Stephanidis, Constantine and Antona, Margherita and Ntoa, Stavroula}, year={2022}, pages={419--426}, collection={Communications in Computer and Information Science (CCIS)} }","ama":"Kersting J, Ahmed M, Geierhos M. Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In: Stephanidis C, Antona M, Ntoa S, eds. <i>HCI International 2022 Posters</i>. Vol 1580. Communications in Computer and Information Science (CCIS). Springer International Publishing; 2022:419--426. doi:<a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">10.1007/978-3-031-06417-3_56</a>","chicago":"Kersting, Joschka, Mobeen Ahmed, and Michaela Geierhos. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” In <i>HCI International 2022 Posters</i>, edited by Constantine Stephanidis, Margherita Antona, and Stavroula Ntoa, 1580:419--426. Communications in Computer and Information Science (CCIS). Cham, Switzerland: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-06417-3_56\">https://doi.org/10.1007/978-3-031-06417-3_56</a>.","ieee":"J. Kersting, M. Ahmed, and M. Geierhos, “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions,” in <i>HCI International 2022 Posters</i>, vol. 1580, C. Stephanidis, M. Antona, and S. Ntoa, Eds. Cham, Switzerland: Springer International Publishing, 2022, pp. 419--426."},"intvolume":"      1580","page":"419--426","place":"Cham, Switzerland","related_material":{"link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-031-06417-3_56","relation":"confirmation"}]},"publication_status":"published","publication_identifier":{"isbn":["9783031064166","9783031064173"],"issn":["1865-0929","1865-0937"]},"has_accepted_license":"1","doi":"10.1007/978-3-031-06417-3_56","conference":{"location":"Virtual","end_date":"2022-07-01","start_date":"2022-06-26","name":"24th International Conference on Human-Computer Interaction (HCII 2022)"},"author":[{"id":"58701","full_name":"Kersting, Joschka","last_name":"Kersting","first_name":"Joschka"},{"full_name":"Ahmed, Mobeen","last_name":"Ahmed","first_name":"Mobeen"},{"first_name":"Michaela","id":"42496","full_name":"Geierhos, Michaela","last_name":"Geierhos","orcid":"0000-0002-8180-5606"}],"volume":1580,"date_updated":"2022-11-28T13:22:16Z","status":"public","editor":[{"first_name":"Constantine","full_name":"Stephanidis, Constantine","last_name":"Stephanidis"},{"first_name":"Margherita","last_name":"Antona","full_name":"Antona, Margherita"},{"first_name":"Stavroula","full_name":"Ntoa, Stavroula","last_name":"Ntoa"}],"type":"book_chapter","file_date_updated":"2022-11-28T13:21:32Z","user_id":"58701","series_title":"Communications in Computer and Information Science (CCIS)","department":[{"_id":"579"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"_id":"32179"},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - Subproject C2"}],"_id":"29769","user_id":"477","department":[{"_id":"78"}],"status":"public","type":"dissertation","main_file_link":[{"url":"\turn:nbn:de:hbz:466:2-40303","open_access":"1"}],"doi":"10.17619/UNIPB/1-1271","oa":"1","date_updated":"2022-11-30T13:39:01Z","supervisor":[{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"author":[{"last_name":"Ahmed","orcid":"0000-0002-1837-2254","id":"72764","full_name":"Ahmed, Qazi Arbab","first_name":"Qazi Arbab"}],"place":"Paderborn","citation":{"ama":"Ahmed QA. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>","ieee":"Q. A. Ahmed, <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022.","chicago":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>. Paderborn:  Paderborn University, Paderborn, Germany, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>.","mla":"Ahmed, Qazi Arbab. <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany, 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>.","short":"Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing,  Paderborn University, Paderborn, Germany, Paderborn, 2022.","bibtex":"@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable Computing}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1271\">10.17619/UNIPB/1-1271</a>}, publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab}, year={2022} }","apa":"Ahmed, Q. A. (2022). <i>Hardware Trojans in Reconfigurable Computing</i>.  Paderborn University, Paderborn, Germany. <a href=\"https://doi.org/10.17619/UNIPB/1-1271\">https://doi.org/10.17619/UNIPB/1-1271</a>"},"publication_status":"published","has_accepted_license":"1","ddc":["004"],"keyword":["FPGA Security","Hardware Trojans","Bitstream-level Trojans","Bitstream Verification"],"language":[{"iso":"eng"}],"abstract":[{"text":"Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen den Trojaner ``Heimtückische LUT'' stellen wir die allererste erfolgreiche Gegenmaßnahme vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.","lang":"eng"},{"lang":"eng","text":"The battle of developing hardware Trojans and corresponding countermeasures has taken adversaries towards ingenious ways of compromising hardware designs by circumventing even advanced testing and verification methods. Besides conventional methods of inserting Trojans into a design by a malicious entity, the design flow for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised to assist the attacker to perform a successful malfunctioning or information leakage attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable systems, the defenders perspective which corresponds to the bitstream-level Trojan detection technique, and the attackers perspective which corresponds to a novel FPGA Trojan attack. From the defender's perspective, we introduce a first-ever successful pre-configuration countermeasure against the ``Malicious LUT''-hardware Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers perspective, we present a novel attack that leverages malicious routing of the inserted Trojan circuit to acquire a dormant state even in the generated and transmitted bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected in the bitstream, the presented attack can currently neither be prevented by conventional testing and verification methods nor by bitstream-level verification techniques."}],"title":"Hardware Trojans in Reconfigurable Computing","publisher":" Paderborn University, Paderborn, Germany","date_created":"2022-02-07T14:02:36Z","year":"2022"},{"file_date_updated":"2022-12-01T13:39:48Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}],"_id":"31054","user_id":"58701","editor":[{"full_name":"Kersting, Joschka","last_name":"Kersting","first_name":"Joschka"}],"status":"public","type":"conference","conference":{"location":"Barcelona, Spain","name":"The Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022)","start_date":"2022-03"},"date_updated":"2022-12-01T13:40:11Z","author":[{"first_name":"Joschka","full_name":"Kersting, Joschka","id":"58701","last_name":"Kersting"},{"first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon","id":"38837","last_name":"Bäumer"}],"place":"Barcelona, Spain","citation":{"ieee":"J. Kersting and F. S. Bäumer, “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis,” in <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, Barcelona, Spain, 2022, pp. 5–9.","chicago":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” In <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, edited by Joschka Kersting, 5–9. Barcelona, Spain: IARIA, 2022.","ama":"Kersting J, Bäumer FS. Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In: Kersting J, ed. <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>. IARIA; 2022:5-9.","bibtex":"@inproceedings{Kersting_Bäumer_2022, place={Barcelona, Spain}, title={Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis}, booktitle={Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications}, publisher={IARIA}, author={Kersting, Joschka and Bäumer, Frederik Simon}, editor={Kersting, Joschka}, year={2022}, pages={5–9} }","short":"J. Kersting, F.S. Bäumer, in: J. Kersting (Ed.), Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications, IARIA, Barcelona, Spain, 2022, pp. 5–9.","mla":"Kersting, Joschka, and Frederik Simon Bäumer. “Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis.” <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i>, edited by Joschka Kersting, IARIA, 2022, pp. 5–9.","apa":"Kersting, J., &#38; Bäumer, F. S. (2022). Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis. In J. Kersting (Ed.), <i>Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications</i> (pp. 5–9). IARIA."},"page":"5-9","publication_status":"published","has_accepted_license":"1","ddc":["006"],"keyword":["Sentiment analysis","Natural language processing","Aspect phrase extraction"],"language":[{"iso":"eng"}],"abstract":[{"text":"This paper aims at discussing past limitations set in sentiment analysis research regarding explicit and implicit mentions of opinions. Previous studies have regularly neglected this question in favor of methodical research on standard-datasets. Furthermore, they were limited to linguistically less-diverse domains, such as commercial product reviews. We face this issue by annotating a German-language physician review dataset that contains numerous implicit, long, and complex statements that indicate aspect ratings, such as the physician’s friendliness. We discuss the nature of implicit statements and present various samples to illustrate the challenge described.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2022-12-01T13:39:48Z","date_created":"2022-12-01T13:39:48Z","creator":"jkers","file_size":155548,"file_name":"Kersting & Bäumer (2022), Kersting2022.pdf","file_id":"34172","access_level":"closed"}],"publication":"Proceedings of the Fourteenth International Conference on Pervasive Patterns and Applications (PATTERNS 2022): Special Track AI-DRSWA: Maturing Artificial Intelligence - Data Science for Real-World Applications","title":"Implicit Statements in Healthcare Reviews: A Challenge for Sentiment Analysis","publisher":"IARIA","date_created":"2022-05-04T08:12:09Z","year":"2022"},{"doi":"10.1007/s00182-022-00812-5","title":"Network Disruption and the Common-Enemy Effect","author":[{"last_name":"Hoyer","full_name":"Hoyer, Britta","id":"42447","first_name":"Britta"},{"last_name":"De Jaegher","full_name":"De Jaegher, Kris","first_name":"Kris"}],"date_created":"2022-06-14T15:33:35Z","publisher":"Springer","date_updated":"2022-12-04T14:40:38Z","citation":{"ama":"Hoyer B, De Jaegher K. Network Disruption and the Common-Enemy Effect. <i>International Journal of Game Theory</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00182-022-00812-5\">10.1007/s00182-022-00812-5</a>","ieee":"B. Hoyer and K. De Jaegher, “Network Disruption and the Common-Enemy Effect,” <i>International Journal of Game Theory</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00182-022-00812-5\">10.1007/s00182-022-00812-5</a>.","chicago":"Hoyer, Britta, and Kris De Jaegher. “Network Disruption and the Common-Enemy Effect.” <i>International Journal of Game Theory</i>, 2022. <a href=\"https://doi.org/10.1007/s00182-022-00812-5\">https://doi.org/10.1007/s00182-022-00812-5</a>.","bibtex":"@article{Hoyer_De Jaegher_2022, title={Network Disruption and the Common-Enemy Effect}, DOI={<a href=\"https://doi.org/10.1007/s00182-022-00812-5\">10.1007/s00182-022-00812-5</a>}, journal={International Journal of Game Theory}, publisher={Springer}, author={Hoyer, Britta and De Jaegher, Kris}, year={2022} }","short":"B. Hoyer, K. De Jaegher, International Journal of Game Theory (2022).","mla":"Hoyer, Britta, and Kris De Jaegher. “Network Disruption and the Common-Enemy Effect.” <i>International Journal of Game Theory</i>, Springer, 2022, doi:<a href=\"https://doi.org/10.1007/s00182-022-00812-5\">10.1007/s00182-022-00812-5</a>.","apa":"Hoyer, B., &#38; De Jaegher, K. (2022). Network Disruption and the Common-Enemy Effect. <i>International Journal of Game Theory</i>. <a href=\"https://doi.org/10.1007/s00182-022-00812-5\">https://doi.org/10.1007/s00182-022-00812-5</a>"},"year":"2022","publication_status":"epub_ahead","extern":"1","language":[{"iso":"eng"}],"user_id":"42447","department":[{"_id":"280"},{"_id":"475"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"31881","status":"public","type":"journal_article","publication":"International Journal of Game Theory"},{"file":[{"date_updated":"2022-12-21T19:08:31Z","date_created":"2022-12-21T19:08:31Z","creator":"dsz","file_size":3579895,"access_level":"closed","file_id":"34788","file_name":"Modeling Business Models_ A cross-disciplinary Analysis of Busine.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"publication":"Communications of the Association for Information Systems","language":[{"iso":"eng"}],"ddc":["000"],"year":"2022","title":"Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research","date_created":"2022-09-02T10:05:24Z","status":"public","type":"journal_article","file_date_updated":"2022-12-21T19:08:31Z","department":[{"_id":"276"}],"user_id":"36372","_id":"33250","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"}],"page":"774-841","intvolume":"        51","citation":{"ama":"Szopinski D, Massa L, John T, Kundisch D, Tucci C. Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research. <i>Communications of the Association for Information Systems</i>. 2022;51:774-841.","chicago":"Szopinski, Daniel, Lorenzo Massa, Thomas John, Dennis Kundisch, and Christopher Tucci. “Modeling Business Models: A Cross-Disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research.” <i>Communications of the Association for Information Systems</i> 51 (2022): 774–841.","ieee":"D. Szopinski, L. Massa, T. John, D. Kundisch, and C. Tucci, “Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research,” <i>Communications of the Association for Information Systems</i>, vol. 51, pp. 774–841, 2022.","apa":"Szopinski, D., Massa, L., John, T., Kundisch, D., &#38; Tucci, C. (2022). Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research. <i>Communications of the Association for Information Systems</i>, <i>51</i>, 774–841.","mla":"Szopinski, Daniel, et al. “Modeling Business Models: A Cross-Disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research.” <i>Communications of the Association for Information Systems</i>, vol. 51, 2022, pp. 774–841.","short":"D. Szopinski, L. Massa, T. John, D. Kundisch, C. Tucci, Communications of the Association for Information Systems 51 (2022) 774–841.","bibtex":"@article{Szopinski_Massa_John_Kundisch_Tucci_2022, title={Modeling Business Models: A cross-disciplinary Analysis of Business Model Modeling Languages and Directions for Future Research}, volume={51}, journal={Communications of the Association for Information Systems}, author={Szopinski, Daniel and Massa, Lorenzo and John, Thomas and Kundisch, Dennis and Tucci, Christopher}, year={2022}, pages={774–841} }"},"has_accepted_license":"1","publication_status":"published","volume":51,"author":[{"last_name":"Szopinski","id":"36372","full_name":"Szopinski, Daniel","first_name":"Daniel"},{"last_name":"Massa","full_name":"Massa, Lorenzo","first_name":"Lorenzo"},{"first_name":"Thomas","full_name":"John, Thomas","last_name":"John"},{"first_name":"Dennis","last_name":"Kundisch","id":"21117","full_name":"Kundisch, Dennis"},{"first_name":"Christopher","full_name":"Tucci, Christopher","last_name":"Tucci"}],"date_updated":"2022-12-21T19:08:47Z"},{"keyword":["network management","service management","AI","Monte Carlo Tree Search","model-based","QoS"],"ddc":["004"],"language":[{"iso":"eng"}],"publication":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","abstract":[{"lang":"eng","text":"Modern services often comprise several components, such as chained virtual network functions, microservices, or\r\nmachine learning functions. Providing such services requires to decide how often to instantiate each component, where to place these instances in the network, how to chain them and route traffic through them. \r\nTo overcome limitations of conventional, hardwired heuristics, deep reinforcement learning (DRL) approaches for self-learning network and service management have emerged recently. These model-free DRL approaches are more flexible but typically learn tabula rasa, i.e., disregard existing understanding of networks, services, and their coordination. \r\n\r\nInstead, we propose FutureCoord, a novel model-based AI approach that leverages existing understanding of networks and services for more efficient and effective coordination without time-intensive training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic model. This allows FutureCoord to estimate the impact of future incoming traffic and effectively optimize long-term effects, taking fluctuating demand and Quality of Service (QoS) requirements into account. Our extensive evaluation based on real-world network topologies, services, and traffic traces indicates that FutureCoord clearly outperforms state-of-the-art model-free and model-based approaches with up to 51% higher flow success ratios."}],"file":[{"date_updated":"2022-01-11T08:39:57Z","date_created":"2022-01-11T08:39:57Z","creator":"stschn","file_size":528653,"file_id":"29222","access_level":"open_access","file_name":"author_version.pdf","content_type":"application/pdf","relation":"main_file"}],"publisher":"IEEE","date_created":"2022-01-11T08:43:26Z","title":"Use What You Know: Network and Service Coordination Beyond Certainty","quality_controlled":"1","year":"2022","_id":"29220","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"35343","file_date_updated":"2022-01-11T08:39:57Z","type":"conference","status":"public","date_updated":"2022-01-11T08:44:04Z","oa":"1","author":[{"first_name":"Stefan","last_name":"Werner","full_name":"Werner, Stefan"},{"first_name":"Stefan Balthasar","id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider"},{"id":"126","full_name":"Karl, Holger","last_name":"Karl","first_name":"Holger"}],"conference":{"name":"IEEE/IFIP Network Operations and Management Symposium (NOMS)","start_date":"2022-04-25","end_date":"2022-04-29","location":"Budapest"},"has_accepted_license":"1","citation":{"ama":"Werner S, Schneider SB, Karl H. Use What You Know: Network and Service Coordination Beyond Certainty. In: <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE; 2022.","ieee":"S. Werner, S. B. Schneider, and H. Karl, “Use What You Know: Network and Service Coordination Beyond Certainty,” presented at the IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest, 2022.","chicago":"Werner, Stefan, Stefan Balthasar Schneider, and Holger Karl. “Use What You Know: Network and Service Coordination Beyond Certainty.” In <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE, 2022.","apa":"Werner, S., Schneider, S. B., &#38; Karl, H. (2022). Use What You Know: Network and Service Coordination Beyond Certainty. <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>. IEEE/IFIP Network Operations and Management Symposium (NOMS), Budapest.","short":"S. Werner, S.B. Schneider, H. Karl, in: IEEE/IFIP Network Operations and Management Symposium (NOMS), IEEE, 2022.","bibtex":"@inproceedings{Werner_Schneider_Karl_2022, title={Use What You Know: Network and Service Coordination Beyond Certainty}, booktitle={IEEE/IFIP Network Operations and Management Symposium (NOMS)}, publisher={IEEE}, author={Werner, Stefan and Schneider, Stefan Balthasar and Karl, Holger}, year={2022} }","mla":"Werner, Stefan, et al. “Use What You Know: Network and Service Coordination Beyond Certainty.” <i>IEEE/IFIP Network Operations and Management Symposium (NOMS)</i>, IEEE, 2022."}},{"_id":"29763","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"}],"department":[{"_id":"558"}],"user_id":"36113","file_date_updated":"2022-02-07T13:26:05Z","type":"dissertation","status":"public","date_updated":"2022-02-07T13:32:28Z","oa":"1","supervisor":[{"last_name":"Jager","id":"64669","full_name":"Jager, Tibor","first_name":"Tibor"},{"full_name":"Lehmann, Anja","last_name":"Lehmann","first_name":"Anja"}],"author":[{"first_name":"David","last_name":"Niehues","id":"36113","full_name":"Niehues, David"}],"doi":"10.25926/rdtq-jw45","main_file_link":[{"open_access":"1","url":"https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf"}],"has_accepted_license":"1","publication_status":"published","citation":{"ama":"Niehues D. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>.; 2022. doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>","ieee":"D. Niehues, <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022.","chicago":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>, 2022. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>.","apa":"Niehues, D. (2022). <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. <a href=\"https://doi.org/10.25926/rdtq-jw45\">https://doi.org/10.25926/rdtq-jw45</a>","bibtex":"@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure Cryptography}, DOI={<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>}, author={Niehues, David}, year={2022} }","short":"D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography, 2022.","mla":"Niehues, David. <i>More Efficient Techniques for Adaptively-Secure Cryptography</i>. 2022, doi:<a href=\"https://doi.org/10.25926/rdtq-jw45\">10.25926/rdtq-jw45</a>."},"keyword":["public-key cryptography","lattices","pairings","verifiable random functions","identity-based encryption"],"ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Modern-day communication has become more and more digital. While this comes with many advantages such as a more efficient economy, it has also created more and more opportunities for various adversaries to manipulate communication or eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness of these threats. To protect the communication of people, companies, and states from such threats, we require cryptography with strong security guarantees.\r\nDifferent applications may require different security properties from cryptographic schemes. For most applications, however, so-called adaptive security is considered a reasonable minimal requirement of security. Cryptographic schemes with adaptive security remain secure in the presence of an adversary that can corrupt communication partners to respond to messages of the adversaries choice, while the adversary may choose the messages based on previously observed interactions.\r\nWhile cryptography is associated the most with encryption, this is only one of many primitives that are essential for the security of digital interactions. This thesis presents novel identity-based encryption (IBE) schemes and verifiable random functions (VRFs) that achieve adaptive security as outlined above. Moreover, the cryptographic schemes presented in this thesis are proven secure in the standard model. That is without making use of idealized models like the random oracle model."}],"file":[{"date_created":"2022-02-07T13:26:05Z","creator":"davnie","date_updated":"2022-02-07T13:26:05Z","access_level":"closed","file_id":"29764","file_name":"de2107.pdf","file_size":1542089,"content_type":"application/pdf","relation":"main_file","success":1}],"date_created":"2022-02-07T13:29:07Z","title":"More Efficient Techniques for Adaptively-Secure Cryptography","year":"2022"},{"citation":{"bibtex":"@inproceedings{Chen_Mudgal_Chen_Wachsmuth_2022, title={Investigating the argumentation structures of EFL learners from diverse language backgrounds}, booktitle={EUROCALL}, author={Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning}, year={2022} }","mla":"Chen, Mei-Hua, et al. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” <i>EUROCALL</i>, 2022.","short":"M.-H. Chen, G. Mudgal, W.-F. Chen, H. Wachsmuth, in: EUROCALL, 2022.","apa":"Chen, M.-H., Mudgal, G., Chen, W.-F., &#38; Wachsmuth, H. (2022). Investigating the argumentation structures of EFL learners from diverse language backgrounds. <i>EUROCALL</i>.","ieee":"M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation structures of EFL learners from diverse language backgrounds,” 2022.","chicago":"Chen, Mei-Hua, Garima Mudgal, Wei-Fan Chen, and Henning Wachsmuth. “Investigating the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.” In <i>EUROCALL</i>, 2022.","ama":"Chen M-H, Mudgal G, Chen W-F, Wachsmuth H. Investigating the argumentation structures of EFL learners from diverse language backgrounds. In: <i>EUROCALL</i>. ; 2022."},"year":"2022","author":[{"last_name":"Chen","full_name":"Chen, Mei-Hua","first_name":"Mei-Hua"},{"first_name":"Garima","full_name":"Mudgal, Garima","last_name":"Mudgal"},{"last_name":"Chen","id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"}],"date_created":"2022-05-05T07:50:21Z","date_updated":"2022-05-09T14:58:39Z","title":"Investigating the argumentation structures of EFL learners from diverse language backgrounds","type":"conference_abstract","publication":"EUROCALL","status":"public","user_id":"82920","department":[{"_id":"600"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"}],"_id":"31068","language":[{"iso":"eng"}]},{"citation":{"ama":"Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>","chicago":"Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, 2022. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>.","ieee":"S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures for the Insertion of an Edge,” <i>Algorithmica</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","apa":"Baswana, S., Gupta, S., &#38; Knollmann, T. (2022). Mincut Sensitivity Data Structures for the Insertion of an Edge. <i>Algorithmica</i>. <a href=\"https://doi.org/10.1007/s00453-022-00978-0\">https://doi.org/10.1007/s00453-022-00978-0</a>","mla":"Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion of an Edge.” <i>Algorithmica</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>.","short":"S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).","bibtex":"@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures for the Insertion of an Edge}, DOI={<a href=\"https://doi.org/10.1007/s00453-022-00978-0\">10.1007/s00453-022-00978-0</a>}, journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana, Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }"},"year":"2022","publication_identifier":{"issn":["0178-4617","1432-0541"]},"publication_status":"published","doi":"10.1007/s00453-022-00978-0","title":"Mincut Sensitivity Data Structures for the Insertion of an Edge","date_created":"2022-05-27T10:09:24Z","author":[{"last_name":"Baswana","full_name":"Baswana, Surender","first_name":"Surender"},{"first_name":"Shiv","full_name":"Gupta, Shiv","last_name":"Gupta"},{"first_name":"Till","full_name":"Knollmann, Till","id":"39241","orcid":"0000-0003-2014-4696","last_name":"Knollmann"}],"publisher":"Springer Science and Business Media LLC","date_updated":"2022-05-27T10:14:27Z","genbank":["tillk"],"status":"public","publication":"Algorithmica","type":"journal_article","language":[{"iso":"eng"}],"keyword":["Applied Mathematics","Computer Science Applications","General Computer Science"],"department":[{"_id":"63"}],"user_id":"39241","_id":"31479","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}]},{"language":[{"iso":"eng"}],"file_date_updated":"2022-08-19T09:39:57Z","ddc":["006"],"user_id":"38209","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"_id":"33033","file":[{"file_size":24830795,"file_name":"Final Bachelor Thesis.pdf","access_level":"open_access","file_id":"33034","date_updated":"2022-08-19T09:39:57Z","date_created":"2022-08-19T09:39:57Z","creator":"ahetzer","relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"bachelorsthesis","title":"Combined Ranking and Regression Trees for Algorithm Selection","author":[{"last_name":"Fehring","id":"75695","full_name":"Fehring, Lukas","first_name":"Lukas"}],"date_created":"2022-08-19T09:41:14Z","oa":"1","date_updated":"2022-08-20T07:02:04Z","citation":{"ama":"Fehring L. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>.; 2022.","chicago":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. Paderborn, 2022.","ieee":"L. Fehring, <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. Paderborn, 2022.","apa":"Fehring, L. (2022). <i>Combined Ranking and Regression Trees for Algorithm Selection</i>.","short":"L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection, Paderborn, 2022.","mla":"Fehring, Lukas. <i>Combined Ranking and Regression Trees for Algorithm Selection</i>. 2022.","bibtex":"@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }"},"year":"2022","place":"Paderborn","has_accepted_license":"1"},{"author":[{"first_name":"Alexander","id":"38209","full_name":"Tornede, Alexander","last_name":"Tornede"},{"last_name":"Bengs","full_name":"Bengs, Viktor","id":"76599","first_name":"Viktor"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"}],"date_created":"2022-04-12T11:58:56Z","date_updated":"2022-08-24T12:44:27Z","publisher":"AAAI","title":"Machine Learning for Online Algorithm Selection under Censored Feedback","citation":{"apa":"Tornede, A., Bengs, V., &#38; Hüllermeier, E. (2022). Machine Learning for Online Algorithm Selection under Censored Feedback. In <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI.","bibtex":"@article{Tornede_Bengs_Hüllermeier_2022, title={Machine Learning for Online Algorithm Selection under Censored Feedback}, journal={Proceedings of the 36th AAAI Conference on Artificial Intelligence}, publisher={AAAI}, author={Tornede, Alexander and Bengs, Viktor and Hüllermeier, Eyke}, year={2022} }","short":"A. Tornede, V. Bengs, E. Hüllermeier, Proceedings of the 36th AAAI Conference on Artificial Intelligence (2022).","mla":"Tornede, Alexander, et al. “Machine Learning for Online Algorithm Selection under Censored Feedback.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>, AAAI, 2022.","chicago":"Tornede, Alexander, Viktor Bengs, and Eyke Hüllermeier. “Machine Learning for Online Algorithm Selection under Censored Feedback.” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI, 2022.","ieee":"A. Tornede, V. Bengs, and E. Hüllermeier, “Machine Learning for Online Algorithm Selection under Censored Feedback,” <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. AAAI, 2022.","ama":"Tornede A, Bengs V, Hüllermeier E. Machine Learning for Online Algorithm Selection under Censored Feedback. <i>Proceedings of the 36th AAAI Conference on Artificial Intelligence</i>. Published online 2022."},"year":"2022","department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"user_id":"38209","external_id":{"arxiv":["2109.06234"]},"_id":"30867","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 36th AAAI Conference on Artificial Intelligence","type":"preprint","status":"public","abstract":[{"text":"In online algorithm selection (OAS), instances of an algorithmic problem\r\nclass are presented to an agent one after another, and the agent has to quickly\r\nselect a presumably best algorithm from a fixed set of candidate algorithms.\r\nFor decision problems such as satisfiability (SAT), quality typically refers to\r\nthe algorithm's runtime. As the latter is known to exhibit a heavy-tail\r\ndistribution, an algorithm is normally stopped when exceeding a predefined\r\nupper time limit. As a consequence, machine learning methods used to optimize\r\nan algorithm selection strategy in a data-driven manner need to deal with\r\nright-censored samples, a problem that has received little attention in the\r\nliterature so far. In this work, we revisit multi-armed bandit algorithms for\r\nOAS and discuss their capability of dealing with the problem. Moreover, we\r\nadapt them towards runtime-oriented losses, allowing for partially censored\r\ndata while keeping a space- and time-complexity independent of the time\r\nhorizon. In an extensive experimental evaluation on an adapted version of the\r\nASlib benchmark, we demonstrate that theoretically well-founded methods based\r\non Thompson sampling perform specifically strong and improve in comparison to\r\nexisting methods.","lang":"eng"}]},{"abstract":[{"lang":"eng","text":"The problem of selecting an algorithm that appears most suitable for a\r\nspecific instance of an algorithmic problem class, such as the Boolean\r\nsatisfiability problem, is called instance-specific algorithm selection. Over\r\nthe past decade, the problem has received considerable attention, resulting in\r\na number of different methods for algorithm selection. Although most of these\r\nmethods are based on machine learning, surprisingly little work has been done\r\non meta learning, that is, on taking advantage of the complementarity of\r\nexisting algorithm selection methods in order to combine them into a single\r\nsuperior algorithm selector. In this paper, we introduce the problem of meta\r\nalgorithm selection, which essentially asks for the best way to combine a given\r\nset of algorithm selectors. We present a general methodological framework for\r\nmeta algorithm selection as well as several concrete learning methods as\r\ninstantiations of this framework, essentially combining ideas of meta learning\r\nand ensemble learning. In an extensive experimental evaluation, we demonstrate\r\nthat ensembles of algorithm selectors can significantly outperform single\r\nalgorithm selectors and have the potential to form the new state of the art in\r\nalgorithm selection."}],"status":"public","publication":"Machine Learning","type":"preprint","language":[{"iso":"eng"}],"external_id":{"arxiv":["2107.09414"]},"_id":"30865","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"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"user_id":"38209","year":"2022","citation":{"chicago":"Tornede, Alexander, Lukas Gehring, Tanja Tornede, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection on a Meta Level.” <i>Machine Learning</i>, 2022.","ieee":"A. Tornede, L. Gehring, T. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection on a Meta Level,” <i>Machine Learning</i>. 2022.","ama":"Tornede A, Gehring L, Tornede T, Wever MD, Hüllermeier E. Algorithm Selection on a Meta Level. <i>Machine Learning</i>. Published online 2022.","apa":"Tornede, A., Gehring, L., Tornede, T., Wever, M. D., &#38; Hüllermeier, E. (2022). Algorithm Selection on a Meta Level. In <i>Machine Learning</i>.","short":"A. Tornede, L. Gehring, T. Tornede, M.D. Wever, E. Hüllermeier, Machine Learning (2022).","mla":"Tornede, Alexander, et al. “Algorithm Selection on a Meta Level.” <i>Machine Learning</i>, 2022.","bibtex":"@article{Tornede_Gehring_Tornede_Wever_Hüllermeier_2022, title={Algorithm Selection on a Meta Level}, journal={Machine Learning}, author={Tornede, Alexander and Gehring, Lukas and Tornede, Tanja and Wever, Marcel Dominik and Hüllermeier, Eyke}, year={2022} }"},"title":"Algorithm Selection on a Meta Level","date_updated":"2022-08-24T12:45:39Z","date_created":"2022-04-12T11:55:18Z","author":[{"first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander","id":"38209"},{"first_name":"Lukas","last_name":"Gehring","full_name":"Gehring, Lukas"},{"last_name":"Tornede","id":"40795","full_name":"Tornede, Tanja","first_name":"Tanja"},{"id":"33176","full_name":"Wever, Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik"},{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"}]},{"status":"public","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>Heated tool butt welding is a method often used for joining thermoplastics, especially when the components are made out of different materials. The quality of the connection between the components crucially depends on a suitable choice of the parameters of the welding process, such as heating time, temperature, and the precise way how the parts are then welded. Moreover, when different materials are to be joined, the parameter values need to be tailored to the specifics of the respective material. To this end, in this paper, three approaches to tailor the parameter values to optimize the quality of the connection are compared: a heuristic by Potente, statistical experimental design, and Bayesian optimization. With the suitability for practice in mind, a series of experiments are carried out with these approaches, and their capabilities of proposing well-performing parameter values are investigated. As a result, Bayesian optimization is found to yield peak performance, but the costs for optimization are substantial. In contrast, the Potente heuristic does not require any experimentation and recommends parameter values with competitive quality.</jats:p>"}],"type":"journal_article","publication":"Welding in the World","language":[{"iso":"eng"}],"keyword":["Metals and Alloys","Mechanical Engineering","Mechanics of Materials"],"user_id":"38209","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"_id":"33090","citation":{"short":"K. Gevers, A. Tornede, M.D. Wever, V. Schöppner, E. Hüllermeier, Welding in the World (2022).","mla":"Gevers, Karina, et al. “A Comparison of Heuristic, Statistical, and Machine Learning Methods for Heated Tool Butt Welding of Two Different Materials.” <i>Welding in the World</i>, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>.","bibtex":"@article{Gevers_Tornede_Wever_Schöppner_Hüllermeier_2022, title={A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials}, DOI={<a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>}, journal={Welding in the World}, publisher={Springer Science and Business Media LLC}, author={Gevers, Karina and Tornede, Alexander and Wever, Marcel Dominik and Schöppner, Volker and Hüllermeier, Eyke}, year={2022} }","apa":"Gevers, K., Tornede, A., Wever, M. D., Schöppner, V., &#38; Hüllermeier, E. (2022). A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials. <i>Welding in the World</i>. <a href=\"https://doi.org/10.1007/s40194-022-01339-9\">https://doi.org/10.1007/s40194-022-01339-9</a>","chicago":"Gevers, Karina, Alexander Tornede, Marcel Dominik Wever, Volker Schöppner, and Eyke Hüllermeier. “A Comparison of Heuristic, Statistical, and Machine Learning Methods for Heated Tool Butt Welding of Two Different Materials.” <i>Welding in the World</i>, 2022. <a href=\"https://doi.org/10.1007/s40194-022-01339-9\">https://doi.org/10.1007/s40194-022-01339-9</a>.","ieee":"K. Gevers, A. Tornede, M. D. Wever, V. Schöppner, and E. Hüllermeier, “A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials,” <i>Welding in the World</i>, 2022, doi: <a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>.","ama":"Gevers K, Tornede A, Wever MD, Schöppner V, Hüllermeier E. A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials. <i>Welding in the World</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1007/s40194-022-01339-9\">10.1007/s40194-022-01339-9</a>"},"year":"2022","publication_status":"published","publication_identifier":{"issn":["0043-2288","1878-6669"]},"doi":"10.1007/s40194-022-01339-9","title":"A comparison of heuristic, statistical, and machine learning methods for heated tool butt welding of two different materials","author":[{"first_name":"Karina","last_name":"Gevers","full_name":"Gevers, Karina","id":"83151"},{"first_name":"Alexander","last_name":"Tornede","full_name":"Tornede, Alexander","id":"38209"},{"orcid":" https://orcid.org/0000-0001-9782-6818","last_name":"Wever","id":"33176","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik"},{"first_name":"Volker","full_name":"Schöppner, Volker","id":"20530","last_name":"Schöppner"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"date_created":"2022-08-24T12:51:07Z","publisher":"Springer Science and Business Media LLC","date_updated":"2022-08-24T12:52:06Z"},{"author":[{"first_name":"Joshua J.","full_name":"Daymude, Joshua J.","last_name":"Daymude"},{"full_name":"Richa, Andréa W.","last_name":"Richa","first_name":"Andréa W."},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2022-08-30T06:31:21Z","volume":221,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-08-30T06:33:44Z","doi":"10.4230/LIPIcs.SAND.2022.12","title":"Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems","citation":{"ama":"Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:12:1–12:19. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>","chicago":"Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>.","ieee":"J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, 2022, vol. 221, p. 12:1–12:19, doi: <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","short":"J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19.","mla":"Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i>, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>.","bibtex":"@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}, volume={221}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">10.4230/LIPIcs.SAND.2022.12</a>}, booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19}, collection={LIPIcs} }","apa":"Daymude, J. J., Richa, A. W., &#38; Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &#38; O. Michail (Eds.), <i>1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference</i> (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SAND.2022.12\">https://doi.org/10.4230/LIPIcs.SAND.2022.12</a>"},"page":"12:1–12:19","intvolume":"       221","year":"2022","user_id":"15504","series_title":"LIPIcs","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":"33230","language":[{"iso":"eng"}],"type":"conference","publication":"1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference","status":"public","editor":[{"first_name":"James","last_name":"Aspnes","full_name":"Aspnes, James"},{"first_name":"Othon","full_name":"Michail, Othon","last_name":"Michail"}]}]