[{"year":"2020","place":"Ghent, Belgium","citation":{"short":"M. Müller, D. Behnke, P.-B. Bök, S.B. Schneider, M. Peuster, H. Karl, in: IEEE Conference on Network Softwarization (NetSoft) Demo Track, IEEE, Ghent, Belgium, 2020.","mla":"Müller, Marcel, et al. “Cloud-Native Threat Detection and Containment for Smart Manufacturing.” <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>, IEEE, 2020.","bibtex":"@inproceedings{Müller_Behnke_Bök_Schneider_Peuster_Karl_2020, place={Ghent, Belgium}, title={Cloud-Native Threat Detection and Containment for Smart Manufacturing}, booktitle={IEEE Conference on Network Softwarization (NetSoft) Demo Track}, publisher={IEEE}, author={Müller, Marcel and Behnke, Daniel and Bök, Patrick-Benjamin and Schneider, Stefan Balthasar and Peuster, Manuel and Karl, Holger}, year={2020} }","apa":"Müller, M., Behnke, D., Bök, P.-B., Schneider, S. B., Peuster, M., &#38; Karl, H. (2020). Cloud-Native Threat Detection and Containment for Smart Manufacturing. In <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>. Ghent, Belgium: IEEE.","chicago":"Müller, Marcel, Daniel Behnke, Patrick-Benjamin Bök, Stefan Balthasar Schneider, Manuel Peuster, and Holger Karl. “Cloud-Native Threat Detection and Containment for Smart Manufacturing.” In <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>. Ghent, Belgium: IEEE, 2020.","ieee":"M. Müller, D. Behnke, P.-B. Bök, S. B. Schneider, M. Peuster, and H. Karl, “Cloud-Native Threat Detection and Containment for Smart Manufacturing,” in <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>, Ghent, Belgium, 2020.","ama":"Müller M, Behnke D, Bök P-B, Schneider SB, Peuster M, Karl H. Cloud-Native Threat Detection and Containment for Smart Manufacturing. In: <i>IEEE Conference on Network Softwarization (NetSoft) Demo Track</i>. Ghent, Belgium: IEEE; 2020."},"title":"Cloud-Native Threat Detection and Containment for Smart Manufacturing","conference":{"name":"IEEE Conference on Network Softwarization (NetSoft) Demo Track","location":"Ghent, Belgium"},"publisher":"IEEE","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-03T11:53:00Z","author":[{"first_name":"Marcel","full_name":"Müller, Marcel","last_name":"Müller"},{"last_name":"Behnke","full_name":"Behnke, Daniel","first_name":"Daniel"},{"last_name":"Bök","full_name":"Bök, Patrick-Benjamin","first_name":"Patrick-Benjamin"},{"first_name":"Stefan Balthasar","id":"35343","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider"},{"last_name":"Peuster","id":"13271","full_name":"Peuster, Manuel","first_name":"Manuel"},{"first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger","id":"126"}],"abstract":[{"lang":"eng","text":"Softwarization facilitates the introduction of smart\r\nmanufacturing applications in the industry. Manifold devices\r\nsuch as machine computers, Industrial IoT devices, tablets,\r\nsmartphones and smart glasses are integrated into factory networks\r\nto enable shop floor digitalization and big data analysis. To\r\nhandle the increasing number of devices and the resulting traffic,\r\na flexible and scalable factory network is necessary which can be\r\nrealized using softwarization technologies like Network Function\r\nVirtualization (NFV). However, the security risks increase with\r\nthe increasing number of new devices, so that cyber security must\r\nalso be considered in NFV-based networks.\r\n\r\nTherefore, extending our previous work, we showcase threat\r\ndetection using a cloud-native NFV-driven intrusion detection\r\nsystem (IDS) that is integrated in our industrial-specific network\r\nservices. As a result of the threat detection, the affected network\r\nservice is put into quarantine via automatic network reconfiguration.\r\nWe use the 5GTANGO service platform to deploy our\r\ndeveloped network services on Kubernetes and to initiate the\r\nnetwork reconfiguration."}],"status":"public","publication":"IEEE Conference on Network Softwarization (NetSoft) Demo Track","type":"conference","language":[{"iso":"eng"}],"_id":"16400","project":[{"grant_number":"761493","_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"35343"},{"year":"2020","citation":{"bibtex":"@inproceedings{Pukrop_Mäcker_Meyer auf der Heide_2020, title={Approximating Weighted Completion Time for Order Scheduling with Setup Times}, booktitle={Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)}, author={Pukrop, Simon and Mäcker, Alexander and Meyer auf der Heide, Friedhelm}, year={2020} }","mla":"Pukrop, Simon, et al. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.","short":"S. Pukrop, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), 2020.","apa":"Pukrop, S., Mäcker, A., &#38; Meyer auf der Heide, F. (2020). Approximating Weighted Completion Time for Order Scheduling with Setup Times. In <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>.","ama":"Pukrop S, Mäcker A, Meyer auf der Heide F. Approximating Weighted Completion Time for Order Scheduling with Setup Times. In: <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>. ; 2020.","ieee":"S. Pukrop, A. Mäcker, and F. Meyer auf der Heide, “Approximating Weighted Completion Time for Order Scheduling with Setup Times,” in <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020.","chicago":"Pukrop, Simon, Alexander Mäcker, and Friedhelm Meyer auf der Heide. “Approximating Weighted Completion Time for Order Scheduling with Setup Times.” In <i>Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)</i>, 2020."},"title":"Approximating Weighted Completion Time for Order Scheduling with Setup Times","date_updated":"2022-01-06T06:51:45Z","date_created":"2019-10-15T12:19:49Z","author":[{"first_name":"Simon","last_name":"Pukrop","full_name":"Pukrop, Simon","id":"44428"},{"first_name":"Alexander","last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","type":"conference","publication":"Proceedings of the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)","language":[{"iso":"eng"}],"project":[{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject C4","_id":"16"}],"_id":"13868","user_id":"44428","department":[{"_id":"63"}]},{"type":"journal_article","publication":"IEEE Transactions of Visualization & Computer Graphics","status":"public","user_id":"82920","department":[{"_id":"600"}],"_id":"10330","language":[{"iso":"eng"}],"issue":"2","publication_status":"accepted","citation":{"apa":"Kiesel, D., Riehmann, P., Wachsmuth, H., Stein, B., &#38; Fröhlich, B. (n.d.). Visual Analysis of Argumentation in Essays. <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>, <i>27</i>(2), 1139–1148.","short":"D. Kiesel, P. Riehmann, H. Wachsmuth, B. Stein, B. Fröhlich, IEEE Transactions of Visualization &#38; Computer Graphics 27 (n.d.) 1139–1148.","bibtex":"@article{Kiesel_Riehmann_Wachsmuth_Stein_Fröhlich, title={Visual Analysis of Argumentation in Essays}, volume={27}, number={2}, journal={IEEE Transactions of Visualization &#38; Computer Graphics}, author={Kiesel, Dora and Riehmann, Patrick and Wachsmuth, Henning and Stein, Benno and Fröhlich, Bernd}, pages={1139–1148} }","mla":"Kiesel, Dora, et al. “Visual Analysis of Argumentation in Essays.” <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>, vol. 27, no. 2, pp. 1139–48.","ieee":"D. Kiesel, P. Riehmann, H. Wachsmuth, B. Stein, and B. Fröhlich, “Visual Analysis of Argumentation in Essays,” <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>, vol. 27, no. 2, pp. 1139–1148.","chicago":"Kiesel, Dora, Patrick Riehmann, Henning Wachsmuth, Benno Stein, and Bernd Fröhlich. “Visual Analysis of Argumentation in Essays.” <i>IEEE Transactions of Visualization &#38; Computer Graphics</i> 27, no. 2 (n.d.): 1139–48.","ama":"Kiesel D, Riehmann P, Wachsmuth H, Stein B, Fröhlich B. Visual Analysis of Argumentation in Essays. <i>IEEE Transactions of Visualization &#38; Computer Graphics</i>. 27(2):1139-1148."},"page":"1139-1148","intvolume":"        27","year":"2020","author":[{"full_name":"Kiesel, Dora","last_name":"Kiesel","first_name":"Dora"},{"first_name":"Patrick","full_name":"Riehmann, Patrick","last_name":"Riehmann"},{"first_name":"Henning","last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"},{"first_name":"Bernd","last_name":"Fröhlich","full_name":"Fröhlich, Bernd"}],"date_created":"2019-06-27T12:58:13Z","volume":27,"date_updated":"2022-01-06T06:50:37Z","main_file_link":[{"url":"https://www.uni-weimar.de/fileadmin/user/fak/medien/professuren/Virtual_Reality/documents/publications/Visual_Analysis_of_Argumentation_in_Essays.pdf"}],"title":"Visual Analysis of Argumentation in Essays"},{"publication":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","type":"conference","abstract":[{"text":"OpenPGP and S/MIME are two major standards for securing email communication introduced in the early 1990s. Three recent classes of attacks exploit weak cipher modes (EFAIL Malleability Gadgets, or EFAIL-MG), the flexibility of the MIME email structure (EFAIL Direct Exfiltration, or EFAIL-DE), and the Reply action of the email client (REPLY attacks). Although all three break message confidentiality by using standardized email features, only EFAIL-MG has been mitigated in IETF standards with the introduction of AEAD algorithms. So far, no uniform and reliable countermeasures have been adopted by email clients to prevent EFAIL-DE and REPLY attacks. Instead, email clients implement a variety of different ad-hoc countermeasures which are only partially effective, cause interoperability problems, and fragment the secure email ecosystem.We present the first generic countermeasure against both REPLY and EFAIL-DE attacks by checking the decryption context including SMTP headers and MIME structure during decryption. The decryption context is encoded into a string DC and used as Associated Data (AD) in the AEAD encryption. Thus the proposed solution seamlessly extends the EFAIL-MG countermeasures. The decryption context changes whenever an attacker alters the email source code in a critical way, for example, if the attacker changes the MIME structure or adds a new Reply-To header. The proposed solution does not cause any interoperability problems and legacy emails can still be decrypted. We evaluate our approach by implementing the decryption contexts in Thunderbird/Enigmail and by verifying their correct functionality after the email has been transported over all major email providers, including Gmail and iCloud Mail.","lang":"eng"}],"status":"public","_id":"25336","department":[{"_id":"632"}],"user_id":"83504","series_title":"CCS '20","keyword":["decryption contexts","EFAIL","OpenPGP","S/MIME","AEAD"],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450370899"]},"publication_status":"published","year":"2020","place":"New York, NY, USA","page":"1647–1664","citation":{"bibtex":"@inproceedings{Schwenk_Brinkmann_Poddebniak_Müller_Somorovsky_Schinzel_2020, place={New York, NY, USA}, series={CCS ’20}, title={Mitigation of Attacks on Email End-to-End Encryption}, DOI={<a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>}, booktitle={Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security}, publisher={Association for Computing Machinery}, author={Schwenk, Jörg and Brinkmann, Marcus and Poddebniak, Damian and Müller, Jens and Somorovsky, Juraj and Schinzel, Sebastian}, year={2020}, pages={1647–1664}, collection={CCS ’20} }","short":"J. Schwenk, M. Brinkmann, D. Poddebniak, J. Müller, J. Somorovsky, S. Schinzel, in: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1647–1664.","mla":"Schwenk, Jörg, et al. “Mitigation of Attacks on Email End-to-End Encryption.” <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, Association for Computing Machinery, 2020, pp. 1647–1664, doi:<a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>.","apa":"Schwenk, J., Brinkmann, M., Poddebniak, D., Müller, J., Somorovsky, J., &#38; Schinzel, S. (2020). Mitigation of Attacks on Email End-to-End Encryption. <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, 1647–1664. <a href=\"https://doi.org/10.1145/3372297.3417878\">https://doi.org/10.1145/3372297.3417878</a>","ama":"Schwenk J, Brinkmann M, Poddebniak D, Müller J, Somorovsky J, Schinzel S. Mitigation of Attacks on Email End-to-End Encryption. In: <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>. CCS ’20. Association for Computing Machinery; 2020:1647–1664. doi:<a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>","chicago":"Schwenk, Jörg, Marcus Brinkmann, Damian Poddebniak, Jens Müller, Juraj Somorovsky, and Sebastian Schinzel. “Mitigation of Attacks on Email End-to-End Encryption.” In <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, 1647–1664. CCS ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3372297.3417878\">https://doi.org/10.1145/3372297.3417878</a>.","ieee":"J. Schwenk, M. Brinkmann, D. Poddebniak, J. Müller, J. Somorovsky, and S. Schinzel, “Mitigation of Attacks on Email End-to-End Encryption,” in <i>Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security</i>, 2020, pp. 1647–1664, doi: <a href=\"https://doi.org/10.1145/3372297.3417878\">10.1145/3372297.3417878</a>."},"date_updated":"2022-08-03T09:57:27Z","publisher":"Association for Computing Machinery","date_created":"2021-10-04T18:58:37Z","author":[{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"},{"first_name":"Marcus","last_name":"Brinkmann","full_name":"Brinkmann, Marcus"},{"last_name":"Poddebniak","full_name":"Poddebniak, Damian","first_name":"Damian"},{"first_name":"Jens","last_name":"Müller","full_name":"Müller, Jens"},{"id":"83504","full_name":"Somorovsky, Juraj","last_name":"Somorovsky","orcid":"0000-0002-3593-7720","first_name":"Juraj"},{"last_name":"Schinzel","full_name":"Schinzel, Sebastian","first_name":"Sebastian"}],"title":"Mitigation of Attacks on Email End-to-End Encryption","doi":"10.1145/3372297.3417878"},{"type":"dissertation","status":"public","_id":"16935","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"department":[{"_id":"574"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2020","citation":{"ama":"Moussalem DC. <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>.; 2020. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-980\">10.17619/UNIPB/1-980</a>","ieee":"D. C. Moussalem, <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>. 2020.","chicago":"Moussalem, Diego Campos. <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>, 2020. <a href=\"https://doi.org/10.17619/UNIPB/1-980\">https://doi.org/10.17619/UNIPB/1-980</a>.","mla":"Moussalem, Diego Campos. <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>. 2020, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-980\">10.17619/UNIPB/1-980</a>.","bibtex":"@book{Moussalem_2020, title={Knowledge Graphs for Multilingual Language Translation and Generation}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-980\">10.17619/UNIPB/1-980</a>}, author={Moussalem, Diego Campos}, year={2020} }","short":"D.C. Moussalem, Knowledge Graphs for Multilingual Language Translation and Generation, 2020.","apa":"Moussalem, D. C. (2020). <i>Knowledge Graphs for Multilingual Language Translation and Generation</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-980\">https://doi.org/10.17619/UNIPB/1-980</a>"},"date_updated":"2022-11-30T13:43:53Z","supervisor":[{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"date_created":"2020-05-05T06:16:29Z","author":[{"full_name":"Moussalem, Diego Campos","last_name":"Moussalem","first_name":"Diego Campos"}],"title":"Knowledge Graphs for Multilingual Language Translation and Generation","doi":"10.17619/UNIPB/1-980"},{"publisher":"Springer","date_created":"2019-10-10T13:41:06Z","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","issue":"6","year":"2020","ddc":["004"],"language":[{"iso":"eng"}],"publication":"Business & Information Systems Engineering","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2019-12-12T10:24:47Z","date_updated":"2019-12-12T10:24:47Z","access_level":"closed","file_id":"15311","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","file_size":454532}],"date_updated":"2022-12-02T09:27:17Z","author":[{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"volume":62,"doi":"10.1007/s12599-019-00627-x","publication_status":"published","has_accepted_license":"1","citation":{"apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>, <i>62</i>(6), 467–481. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38; Information Systems Engineering 62 (2020) 467–481.","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>}, number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }","chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>.","ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>. 2020;62(6):467-481. doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>"},"page":"467-481","intvolume":"        62","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - Project Area T"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"15","name":"SFB 901 - Subproject C3"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 -Subproject T1"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"name":"SFB 901 -Subproject T3","_id":"107"},{"_id":"158","name":"SFB 901 - T4: SFB 901 -Subproject T4"}],"_id":"13770","user_id":"477","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"file_date_updated":"2019-12-12T10:24:47Z","type":"journal_article","status":"public"},{"citation":{"chicago":"Opel, Simone Anna, and Michael Schlichtig. “Data Science und Big Data in der beruflichen Bildung – Konzeption und Erprobung eines Projektkurses für die Sekundarstufe II.” In <i>Sammelband der 27. Fachtagung der BAG Berufliche Bildung</i>, edited by Thomas Vollmer, Torben Karges, Tim Richter, Britta Schlömer, and Sören Schütt-Sayed, 55:176–94. Berufsbildung, Arbeit und Innovation. Bielefeld: wbv Media GmbH &#38; Co. KG, 2020. <a href=\"https://doi.org/10.3278/6004722w\">https://doi.org/10.3278/6004722w</a>.","ieee":"S. A. Opel and M. Schlichtig, “Data Science und Big Data in der beruflichen Bildung – Konzeption und Erprobung eines Projektkurses für die Sekundarstufe II,” in <i>Sammelband der 27. Fachtagung der BAG Berufliche Bildung</i>, Siegen, 2020, vol. 55, pp. 176–194, doi: <a href=\"https://doi.org/10.3278/6004722w\">https://doi.org/10.3278/6004722w</a>.","ama":"Opel SA, Schlichtig M. Data Science und Big Data in der beruflichen Bildung – Konzeption und Erprobung eines Projektkurses für die Sekundarstufe II. In: Vollmer T, Karges T, Richter T, Schlömer B, Schütt-Sayed S, eds. <i>Sammelband der 27. Fachtagung der BAG Berufliche Bildung</i>. Vol 55. Berufsbildung, Arbeit und Innovation. wbv Media GmbH &#38; Co. KG; 2020:176-194. doi:<a href=\"https://doi.org/10.3278/6004722w\">https://doi.org/10.3278/6004722w</a>","bibtex":"@inproceedings{Opel_Schlichtig_2020, place={Bielefeld}, series={Berufsbildung, Arbeit und Innovation}, title={Data Science und Big Data in der beruflichen Bildung – Konzeption und Erprobung eines Projektkurses für die Sekundarstufe II}, volume={55}, DOI={<a href=\"https://doi.org/10.3278/6004722w\">https://doi.org/10.3278/6004722w</a>}, booktitle={Sammelband der 27. Fachtagung der BAG Berufliche Bildung}, publisher={wbv Media GmbH &#38; Co. KG}, author={Opel, Simone Anna and Schlichtig, Michael}, editor={Vollmer, Thomas and Karges, Torben and Richter, Tim and Schlömer, Britta and Schütt-Sayed, Sören}, year={2020}, pages={176–194}, collection={Berufsbildung, Arbeit und Innovation} }","short":"S.A. Opel, M. Schlichtig, in: T. Vollmer, T. Karges, T. Richter, B. Schlömer, S. Schütt-Sayed (Eds.), Sammelband der 27. Fachtagung der BAG Berufliche Bildung, wbv Media GmbH &#38; Co. KG, Bielefeld, 2020, pp. 176–194.","mla":"Opel, Simone Anna, and Michael Schlichtig. “Data Science und Big Data in der beruflichen Bildung – Konzeption und Erprobung eines Projektkurses für die Sekundarstufe II.” <i>Sammelband der 27. Fachtagung der BAG Berufliche Bildung</i>, edited by Thomas Vollmer et al., vol. 55, wbv Media GmbH &#38; Co. KG, 2020, pp. 176–94, doi:<a href=\"https://doi.org/10.3278/6004722w\">https://doi.org/10.3278/6004722w</a>.","apa":"Opel, S. A., &#38; Schlichtig, M. (2020). Data Science und Big Data in der beruflichen Bildung – Konzeption und Erprobung eines Projektkurses für die Sekundarstufe II. In T. Vollmer, T. Karges, T. Richter, B. Schlömer, &#38; S. Schütt-Sayed (Eds.), <i>Sammelband der 27. Fachtagung der BAG Berufliche Bildung</i> (Vol. 55, pp. 176–194). wbv Media GmbH &#38; Co. KG. <a href=\"https://doi.org/10.3278/6004722w\">https://doi.org/10.3278/6004722w</a>"},"intvolume":"        55","page":"176-194","place":"Bielefeld","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://library.oapen.org/handle/20.500.12657/43933"}],"conference":{"location":"Siegen","end_date":"2019-03-13","start_date":"2019-03-11","name":"20. Hochschultage Berufliche Bildung (HTBB) \"Digitale Welt - Bildung und Arbeit in Transformationsgesellschaften\"."},"doi":"https://doi.org/10.3278/6004722w","author":[{"last_name":"Opel","id":"72932","full_name":"Opel, Simone Anna","first_name":"Simone Anna"},{"first_name":"Michael","full_name":"Schlichtig, Michael","id":"32312","last_name":"Schlichtig"}],"volume":55,"oa":"1","date_updated":"2022-01-12T17:04:10Z","status":"public","editor":[{"first_name":"Thomas","last_name":"Vollmer","full_name":"Vollmer, Thomas"},{"first_name":"Torben","full_name":"Karges, Torben","last_name":"Karges"},{"first_name":"Tim","full_name":"Richter, Tim","last_name":"Richter"},{"full_name":"Schlömer, Britta","last_name":"Schlömer","first_name":"Britta"},{"first_name":"Sören","last_name":"Schütt-Sayed","full_name":"Schütt-Sayed, Sören"}],"type":"conference","user_id":"32312","series_title":"Berufsbildung, Arbeit und Innovation","department":[{"_id":"67"}],"_id":"29298","year":"2020","title":"Data Science und Big Data in der beruflichen Bildung – Konzeption und Erprobung eines Projektkurses für die Sekundarstufe II","date_created":"2022-01-12T16:43:38Z","publisher":"wbv Media GmbH & Co. KG","abstract":[{"lang":"ger","text":"Die Themen „Big Data“, „Künstliche Intelligenz und „Data Science“ werden seit einiger Zeit nicht nur in der breiten Öffentlichkeit kontrovers diskutiert, sondern stellen für die Ausbildung in den IT- und IT-nahen Berufen schon heute neue Herausforderungen dar, die in Zukunft durch die gesellschaftliche und technologische Weiterentwicklung hin zu einer Datengesellschaft noch größer werden.\r\nAn dieser Stelle stellt sich die Frage, welche Aspekte dieses großen Themenkomplexes für Schule und Ausbildung von Wichtigkeit sind und wie diese Themen sinnstiftend und gewinnbringend in die informatische Ausbildung in verschiedenen Bildungsgängen integriert werden können. Im Rahmen des von uns im Jahr 2017 organisierten Symposiums zum Thema „Data Science“ wurden für die Bildung relevante Aspekte erörtert, wodurch als Kernelemente für den Unterricht Algorithmen der Künstlichen Intelligenz und ihre Anwendung in Industrie und Gesellschaft, Explorationen von Big Data sowie der Umgang mit eigenen Daten in sozialen Netzwerken herausgearbeitet wurden. Ziel ist, aus diesen Themenbereichen sowohl ein umfassendes Curriculum als auch Module für verschiedene Unterrichtsszenarien zu entwickeln und zu erproben. Durch diese Materialien soll es Lehrkräften aus der Informatik, Mathematik oder Technik ermöglicht werden, diese Themen auf Basis des Curriculums und der erprobten Unterrichtskonzepte selbst zu unterrichten.\r\nHierfür wurde im Rahmen des Projekts ProDaBi (Projekt Data Science und Big Data in der Schule, https://www.prodabi.de), initiiert von der Telekom Stiftung, ein experimenteller Projektkurs entwickelt, den wir mit Schüler:innen der Sekundarstufe II an der Universität Paderborn im Schuljahr 2018/19 durchführten. Dieser Kurs enthält neben einem Modul zur Exploration von Big Data und einem weiteren Modul zum Maschinellen Lernen als Teil der Künstlichen Intelligenz auch eine Projektphase, die es in Zusammenarbeit mit lokalen Unternehmen den Schüler:innen\r\nermöglicht, das Erlernte in ein reales Data Science-Projekt einzubringen. Aus den Erfahrungen dieses Projektkurses sowie den parallel durchgeführten Erprobungen einzelner Bausteine auch mit beruflichen Schulen werden ab dem Schuljahr 2019/20 die hierfür verwendeten Materialien weiterentwickelt und weiteren Kooperationspartnern zur Erprobung zur Verfügung gestellt. Damit wurden zum Ende des Projekts nicht nur vollständige Unterrichtsmaterialien, sondern auch ein umfassendes Curriculum entwickelt."},{"text":"The topics ”Big Data”, “Artificial Intelligence” and “Data Science” are controversially discussed among the general public, but they present new challenges for training in IT and IT-related professions. These challenges will become more important in the future as a result of further social and technological development towards a data society.\r\nAt this point, the question arises as to which aspects of this large complex of topics are important for school and education, and how these topics can be integrated in a meaningful and profitable way into informatics education in vocational education. In 2017, we organized a symposium towards the topic “Data Science” and discussed relevant aspects for general and vocational education. Algorithms of artificial intelligence and their application in industry and society, explorations of Big Data as well as the handling of one's own data in social networks were worked out as core elements for teaching. For this reason, our aim is to develop a comprehensive curriculum on this topic from these subject areas and to develop and test modules for various teaching scenarios in order to enable teachers from computer science, mathematics or technology to teach these topics themselves.\r\nFor this purpose, an experimental project course was developed within the framework of the ProDaBi project (Project Data Science and Big Data at School, https://www.prodabi.de), which we conducted with students from upper secondary classes at the University of Paderborn in the school year 2018/19. In this course we try to address all these aspects. This course consists of several modules: One module has been designed to teach the exploration of Big Data. Another module encompasses aspects of machine learning as part of artificial intelligence. The course concludes in a project phase which, in cooperation with local companies, will enable the students to apply what they have learned into a real Data Science project. Based on the experiences of this project course and the parallel testing of individual modules with vocational schools, we will further develop the material and make it available to other cooperation partners for testing, so that not only complete teaching materials but also a comprehensive curriculum will have been developed until the end of the project.","lang":"eng"}],"publication":"Sammelband der 27. Fachtagung der BAG Berufliche Bildung","language":[{"iso":"ger"}],"keyword":["Berufsbildung","vocational education","Ausbildung","training","berufliche Weiterbildung","advanced vocational education","Digitalisierung","digitalization","Unterricht","teaching","Lehrmethode","teaching method","Interdisziplinarität","interdisciplinarity","Fachdidaktik","subject didactics","Curriculum","curriculum","gewerblich-technischer Beruf","vocational/technical occupation","Fachkraft","specialist","Qualifikationsanforderungen","qualification requirements","Kompetenz","competence","Lehrerbildung","teacher training","Bundesrepublik Deutschland","Federal Republic of Germany"]},{"main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.nlpcss-1.16.pdf"}],"title":"Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity","author":[{"first_name":"Wei-Fan","last_name":"Chen","id":"82920","full_name":"Chen, Wei-Fan"},{"full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib","first_name":"Khalid"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"date_created":"2018-08-02T11:40:56Z","date_updated":"2022-05-09T15:03:31Z","citation":{"ama":"Chen W-F, Al-Khatib K, Wachsmuth H, Stein B. Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity. In: <i>Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science</i>. ; 2020:149-154.","chicago":"Chen, Wei-Fan, Khalid Al-Khatib, Henning Wachsmuth, and Benno Stein. “Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity.” In <i>Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science</i>, 149–54, 2020.","ieee":"W.-F. Chen, K. Al-Khatib, H. Wachsmuth, and B. Stein, “Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity,” in <i>Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science</i>, 2020, pp. 149–154.","bibtex":"@inproceedings{Chen_Al-Khatib_Wachsmuth_Stein_2020, title={Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity}, booktitle={Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science}, author={Chen, Wei-Fan and Al-Khatib, Khalid and Wachsmuth, Henning and Stein, Benno}, year={2020}, pages={149–154} }","short":"W.-F. Chen, K. Al-Khatib, H. Wachsmuth, B. Stein, in: Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science, 2020, pp. 149–154.","mla":"Chen, Wei-Fan, et al. “Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity.” <i>Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science</i>, 2020, pp. 149–54.","apa":"Chen, W.-F., Al-Khatib, K., Wachsmuth, H., &#38; Stein, B. (2020). Analyzing Political Bias and Unfairness in News Articles at Different Levels of Granularity. <i>Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science</i>, 149–154."},"page":"149-154","year":"2020","language":[{"iso":"eng"}],"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"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"_id":"3776","status":"public","type":"conference","publication":"Proceedings of the Fourth Workshop on Natural Language Processing and Computational Social Science"},{"year":"2020","page":"237-241","citation":{"ama":"Syed S, Chen W-F, Hagen M, Stein B, Wachsmuth H, Potthast M. Task Proposal: Abstractive Snippet Generation for Web Pages. In: <i>Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)</i>. ; 2020:237-241.","ieee":"S. Syed, W.-F. Chen, M. Hagen, B. Stein, H. Wachsmuth, and M. Potthast, “Task Proposal: Abstractive Snippet Generation for Web Pages,” in <i>Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)</i>, 2020, pp. 237–241.","chicago":"Syed, Shahbaz, Wei-Fan Chen, Matthias Hagen, Benno Stein, Henning Wachsmuth, and Martin Potthast. “Task Proposal: Abstractive Snippet Generation for Web Pages.” In <i>Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)</i>, 237–41, 2020.","mla":"Syed, Shahbaz, et al. “Task Proposal: Abstractive Snippet Generation for Web Pages.” <i>Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)</i>, 2020, pp. 237–41.","bibtex":"@inproceedings{Syed_Chen_Hagen_Stein_Wachsmuth_Potthast_2020, title={Task Proposal: Abstractive Snippet Generation for Web Pages}, booktitle={Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)}, author={Syed, Shahbaz and Chen, Wei-Fan and Hagen, Matthias and Stein, Benno and Wachsmuth, Henning and Potthast, Martin}, year={2020}, pages={237–241} }","short":"S. Syed, W.-F. Chen, M. Hagen, B. Stein, H. Wachsmuth, M. Potthast, in: Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020), 2020, pp. 237–241.","apa":"Syed, S., Chen, W.-F., Hagen, M., Stein, B., Wachsmuth, H., &#38; Potthast, M. (2020). Task Proposal: Abstractive Snippet Generation for Web Pages. <i>Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)</i>, 237–241."},"title":"Task Proposal: Abstractive Snippet Generation for Web Pages","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.inlg-1.30.pdf"}],"date_updated":"2022-05-09T15:03:11Z","author":[{"first_name":"Shahbaz","full_name":"Syed, Shahbaz","last_name":"Syed"},{"first_name":"Wei-Fan","full_name":"Chen, Wei-Fan","id":"82920","last_name":"Chen"},{"first_name":"Matthias","last_name":"Hagen","full_name":"Hagen, Matthias"},{"last_name":"Stein","full_name":"Stein, Benno","first_name":"Benno"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900","first_name":"Henning"},{"first_name":"Martin","last_name":"Potthast","full_name":"Potthast, Martin"}],"date_created":"2020-10-20T13:00:06Z","status":"public","publication":"Proceedings of the 13th International Conference on Natural Language Generation (INLG 2020)","type":"conference","language":[{"iso":"eng"}],"_id":"20137","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"}],"department":[{"_id":"600"}],"user_id":"82920"},{"citation":{"apa":"Chen, W.-F., Al-Khatib, K., Stein, B., &#38; Wachsmuth, H. (2020). Detecting Media Bias in News Articles using Gaussian Bias Distributions. <i>Findings of the Association for Computational Linguistics: EMNLP 2020</i>, 4290–4300.","mla":"Chen, Wei-Fan, et al. “Detecting Media Bias in News Articles Using Gaussian Bias Distributions.” <i>Findings of the Association for Computational Linguistics: EMNLP 2020</i>, 2020, pp. 4290–300.","bibtex":"@inproceedings{Chen_Al-Khatib_Stein_Wachsmuth_2020, title={Detecting Media Bias in News Articles using Gaussian Bias Distributions}, booktitle={Findings of the Association for Computational Linguistics: EMNLP 2020}, author={Chen, Wei-Fan and Al-Khatib, Khalid and Stein, Benno and Wachsmuth, Henning}, year={2020}, pages={4290–4300} }","short":"W.-F. Chen, K. Al-Khatib, B. Stein, H. Wachsmuth, in: Findings of the Association for Computational Linguistics: EMNLP 2020, 2020, pp. 4290–4300.","ama":"Chen W-F, Al-Khatib K, Stein B, Wachsmuth H. Detecting Media Bias in News Articles using Gaussian Bias Distributions. In: <i>Findings of the Association for Computational Linguistics: EMNLP 2020</i>. ; 2020:4290-4300.","chicago":"Chen, Wei-Fan, Khalid Al-Khatib, Benno Stein, and Henning Wachsmuth. “Detecting Media Bias in News Articles Using Gaussian Bias Distributions.” In <i>Findings of the Association for Computational Linguistics: EMNLP 2020</i>, 4290–4300, 2020.","ieee":"W.-F. Chen, K. Al-Khatib, B. Stein, and H. Wachsmuth, “Detecting Media Bias in News Articles using Gaussian Bias Distributions,” in <i>Findings of the Association for Computational Linguistics: EMNLP 2020</i>, 2020, pp. 4290–4300."},"page":"4290-4300","year":"2020","main_file_link":[{"url":"https://www.aclweb.org/anthology/2020.findings-emnlp.383.pdf"}],"title":"Detecting Media Bias in News Articles using Gaussian Bias Distributions","date_created":"2018-08-02T13:38:46Z","author":[{"first_name":"Wei-Fan","full_name":"Chen, Wei-Fan","id":"82920","last_name":"Chen"},{"full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib","first_name":"Khalid"},{"last_name":"Stein","full_name":"Stein, Benno","first_name":"Benno"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"}],"date_updated":"2022-05-09T15:00:46Z","status":"public","type":"conference","publication":"Findings of the Association for Computational Linguistics: EMNLP 2020","language":[{"iso":"eng"}],"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"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"_id":"3818"},{"department":[{"_id":"600"},{"_id":"568"}],"user_id":"82920","_id":"15826","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"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the Web Conference 2020","type":"conference","status":"public","date_created":"2020-02-06T10:51:33Z","author":[{"id":"82920","full_name":"Chen, Wei-Fan","last_name":"Chen","first_name":"Wei-Fan"},{"last_name":"Syed","full_name":"Syed, Shahbaz","first_name":"Shahbaz"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"},{"first_name":"Matthias","full_name":"Hagen, Matthias","last_name":"Hagen"},{"last_name":"Potthast","full_name":"Potthast, Martin","first_name":"Martin"}],"date_updated":"2022-05-09T15:03:53Z","main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3366423.3380206"}],"title":"Abstractive Snippet Generation","page":"1309-1319","citation":{"ama":"Chen W-F, Syed S, Stein B, Hagen M, Potthast M. Abstractive Snippet Generation. In: <i>Proceedings of the Web Conference 2020</i>. ; 2020:1309-1319.","chicago":"Chen, Wei-Fan, Shahbaz Syed, Benno Stein, Matthias Hagen, and Martin Potthast. “Abstractive Snippet Generation.” In <i>Proceedings of the Web Conference 2020</i>, 1309–19, 2020.","ieee":"W.-F. Chen, S. Syed, B. Stein, M. Hagen, and M. Potthast, “Abstractive Snippet Generation,” in <i>Proceedings of the Web Conference 2020</i>, 2020, pp. 1309–1319.","apa":"Chen, W.-F., Syed, S., Stein, B., Hagen, M., &#38; Potthast, M. (2020). Abstractive Snippet Generation. <i>Proceedings of the Web Conference 2020</i>, 1309–1319.","bibtex":"@inproceedings{Chen_Syed_Stein_Hagen_Potthast_2020, title={Abstractive Snippet Generation}, booktitle={Proceedings of the Web Conference 2020}, author={Chen, Wei-Fan and Syed, Shahbaz and Stein, Benno and Hagen, Matthias and Potthast, Martin}, year={2020}, pages={1309–1319} }","mla":"Chen, Wei-Fan, et al. “Abstractive Snippet Generation.” <i>Proceedings of the Web Conference 2020</i>, 2020, pp. 1309–19.","short":"W.-F. Chen, S. Syed, B. Stein, M. Hagen, M. Potthast, in: Proceedings of the Web Conference 2020, 2020, pp. 1309–1319."},"year":"2020"},{"date_created":"2020-04-27T10:11:00Z","publisher":"Association for Computational Linguistics","title":"Target Inference in Argument Conclusion Generation","year":"2020","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"acl20-conclusion-generation-frame.pdf","file_id":"17054","access_level":"closed","file_size":1572275,"date_created":"2020-05-22T06:41:25Z","creator":"sile2804","date_updated":"2020-05-22T06:41:25Z"}],"author":[{"id":"73059","full_name":"Alshomary, Milad","last_name":"Alshomary","first_name":"Milad"},{"first_name":"Shahbaz","last_name":"Syed","full_name":"Syed, Shahbaz"},{"last_name":"Potthast","full_name":"Potthast, Martin","first_name":"Martin"},{"full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth","first_name":"Henning"}],"date_updated":"2022-05-09T15:06:52Z","conference":{"name":"58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)","start_date":"2020.07.05","end_date":"2020.07.10","location":"Seattle, USA"},"has_accepted_license":"1","page":"4334-4345","citation":{"apa":"Alshomary, M., Syed, S., Potthast, M., &#38; Wachsmuth, H. (2020). Target Inference in Argument Conclusion Generation. <i>Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)</i>, 4334–4345.","mla":"Alshomary, Milad, et al. “Target Inference in Argument Conclusion Generation.” <i>Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)</i>, Association for Computational Linguistics, 2020, pp. 4334–45.","short":"M. Alshomary, S. Syed, M. Potthast, H. Wachsmuth, in: Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020), Association for Computational Linguistics, 2020, pp. 4334–4345.","bibtex":"@inproceedings{Alshomary_Syed_Potthast_Wachsmuth_2020, series={Proceedings of 58th Annual Meeting of the Association for Computational Linguistics}, title={Target Inference in Argument Conclusion Generation}, booktitle={Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)}, publisher={Association for Computational Linguistics}, author={Alshomary, Milad and Syed, Shahbaz and Potthast, Martin and Wachsmuth, Henning}, year={2020}, pages={4334–4345}, collection={Proceedings of 58th Annual Meeting of the Association for Computational Linguistics} }","chicago":"Alshomary, Milad, Shahbaz Syed, Martin Potthast, and Henning Wachsmuth. “Target Inference in Argument Conclusion Generation.” In <i>Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)</i>, 4334–45. Proceedings of 58th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 2020.","ieee":"M. Alshomary, S. Syed, M. Potthast, and H. Wachsmuth, “Target Inference in Argument Conclusion Generation,” in <i>Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)</i>, Seattle, USA, 2020, pp. 4334–4345.","ama":"Alshomary M, Syed S, Potthast M, Wachsmuth H. Target Inference in Argument Conclusion Generation. In: <i>Proceedings of 58th Annual Meeting of the Association for Computational Linguistics (ACL 2020)</i>. Proceedings of 58th Annual Meeting of the Association for Computational Linguistics. Association for Computational Linguistics; 2020:4334-4345."},"department":[{"_id":"600"},{"_id":"568"}],"series_title":"Proceedings of 58th Annual Meeting of the Association for Computational Linguistics","user_id":"82920","_id":"16868","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"}],"file_date_updated":"2020-05-22T06:41:25Z","type":"conference","status":"public"},{"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"_id":"20141","user_id":"11871","department":[{"_id":"574"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020)","status":"public","oa":"1","date_updated":"2022-10-15T19:57:01Z","author":[{"orcid":"0000-0002-4525-6865","last_name":"Heindorf","id":"11871","full_name":"Heindorf, Stefan","first_name":"Stefan"},{"first_name":"Yan","full_name":"Scholten, Yan","last_name":"Scholten"},{"id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"},{"first_name":"Martin","full_name":"Potthast, Martin","last_name":"Potthast"}],"date_created":"2020-10-20T13:11:14Z","title":"CauseNet: Towards a Causality Graph Extracted from the Web","main_file_link":[{"open_access":"1","url":"https://papers.dice-research.org/2020/CIKM-20/heindorf_2020a_public.pdf"}],"doi":"10.1145/3340531.3412763","year":"2020","citation":{"chicago":"Heindorf, Stefan, Yan Scholten, Henning Wachsmuth, Axel-Cyrille Ngonga Ngomo, and Martin Potthast. “CauseNet: Towards a Causality Graph Extracted from the Web.” In <i>Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020)</i>, 3023–30, 2020. <a href=\"https://doi.org/10.1145/3340531.3412763\">https://doi.org/10.1145/3340531.3412763</a>.","ieee":"S. Heindorf, Y. Scholten, H. Wachsmuth, A.-C. Ngonga Ngomo, and M. Potthast, “CauseNet: Towards a Causality Graph Extracted from the Web,” in <i>Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020)</i>, 2020, pp. 3023–3030, doi: <a href=\"https://doi.org/10.1145/3340531.3412763\">10.1145/3340531.3412763</a>.","ama":"Heindorf S, Scholten Y, Wachsmuth H, Ngonga Ngomo A-C, Potthast M. CauseNet: Towards a Causality Graph Extracted from the Web. In: <i>Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020)</i>. ; 2020:3023-3030. doi:<a href=\"https://doi.org/10.1145/3340531.3412763\">10.1145/3340531.3412763</a>","bibtex":"@inproceedings{Heindorf_Scholten_Wachsmuth_Ngonga Ngomo_Potthast_2020, title={CauseNet: Towards a Causality Graph Extracted from the Web}, DOI={<a href=\"https://doi.org/10.1145/3340531.3412763\">10.1145/3340531.3412763</a>}, booktitle={Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020)}, author={Heindorf, Stefan and Scholten, Yan and Wachsmuth, Henning and Ngonga Ngomo, Axel-Cyrille and Potthast, Martin}, year={2020}, pages={3023–3030} }","mla":"Heindorf, Stefan, et al. “CauseNet: Towards a Causality Graph Extracted from the Web.” <i>Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020)</i>, 2020, pp. 3023–30, doi:<a href=\"https://doi.org/10.1145/3340531.3412763\">10.1145/3340531.3412763</a>.","short":"S. Heindorf, Y. Scholten, H. Wachsmuth, A.-C. Ngonga Ngomo, M. Potthast, in: Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020), 2020, pp. 3023–3030.","apa":"Heindorf, S., Scholten, Y., Wachsmuth, H., Ngonga Ngomo, A.-C., &#38; Potthast, M. (2020). CauseNet: Towards a Causality Graph Extracted from the Web. <i>Proceedings of the 28th ACM International Conference on Information and Knowledge Management (CIKM 2020)</i>, 3023–3030. <a href=\"https://doi.org/10.1145/3340531.3412763\">https://doi.org/10.1145/3340531.3412763</a>"},"page":"3023-3030"},{"publisher":"Universität Paderborn","date_updated":"2022-10-17T10:56:59Z","supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2020-08-29T13:27:11Z","author":[{"first_name":"Paul","id":"64594","full_name":"Kramer, Paul","last_name":"Kramer"}],"title":"Comparison of Zero-Knowledge Range Proofs","year":"2020","citation":{"apa":"Kramer, P. (2020). <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn.","short":"P. Kramer, Comparison of Zero-Knowledge Range Proofs, Universität Paderborn, 2020.","bibtex":"@book{Kramer_2020, title={Comparison of Zero-Knowledge Range Proofs}, publisher={Universität Paderborn}, author={Kramer, Paul}, year={2020} }","mla":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","ieee":"P. Kramer, <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","chicago":"Kramer, Paul. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn, 2020.","ama":"Kramer P. <i>Comparison of Zero-Knowledge Range Proofs</i>. Universität Paderborn; 2020."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"18638","user_id":"25078","department":[{"_id":"7"},{"_id":"64"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"department":[{"_id":"78"}],"user_id":"398","_id":"20838","language":[{"iso":"eng"}],"publication":"2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","type":"conference","status":"public","date_created":"2020-12-23T09:07:11Z","author":[{"full_name":"Lösch, Achim","last_name":"Lösch","first_name":"Achim"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_updated":"2023-01-03T22:07:12Z","doi":"10.1109/ipdpsw50202.2020.00012","title":"MigHEFT: DAG-based Scheduling of Migratable Tasks on Heterogeneous Compute Nodes","publication_identifier":{"isbn":["9781728174457"]},"publication_status":"published","citation":{"ieee":"A. Lösch and M. Platzner, “MigHEFT: DAG-based Scheduling of Migratable Tasks on Heterogeneous Compute Nodes,” 2020, doi: <a href=\"https://doi.org/10.1109/ipdpsw50202.2020.00012\">10.1109/ipdpsw50202.2020.00012</a>.","chicago":"Lösch, Achim, and Marco Platzner. “MigHEFT: DAG-Based Scheduling of Migratable Tasks on Heterogeneous Compute Nodes.” In <i>2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 2020. <a href=\"https://doi.org/10.1109/ipdpsw50202.2020.00012\">https://doi.org/10.1109/ipdpsw50202.2020.00012</a>.","ama":"Lösch A, Platzner M. MigHEFT: DAG-based Scheduling of Migratable Tasks on Heterogeneous Compute Nodes. In: <i>2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1109/ipdpsw50202.2020.00012\">10.1109/ipdpsw50202.2020.00012</a>","mla":"Lösch, Achim, and Marco Platzner. “MigHEFT: DAG-Based Scheduling of Migratable Tasks on Heterogeneous Compute Nodes.” <i>2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>, 2020, doi:<a href=\"https://doi.org/10.1109/ipdpsw50202.2020.00012\">10.1109/ipdpsw50202.2020.00012</a>.","short":"A. Lösch, M. Platzner, in: 2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), 2020.","bibtex":"@inproceedings{Lösch_Platzner_2020, title={MigHEFT: DAG-based Scheduling of Migratable Tasks on Heterogeneous Compute Nodes}, DOI={<a href=\"https://doi.org/10.1109/ipdpsw50202.2020.00012\">10.1109/ipdpsw50202.2020.00012</a>}, booktitle={2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}, author={Lösch, Achim and Platzner, Marco}, year={2020} }","apa":"Lösch, A., &#38; Platzner, M. (2020). MigHEFT: DAG-based Scheduling of Migratable Tasks on Heterogeneous Compute Nodes. <i>2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)</i>. <a href=\"https://doi.org/10.1109/ipdpsw50202.2020.00012\">https://doi.org/10.1109/ipdpsw50202.2020.00012</a>"},"year":"2020"},{"title":"Oracle complexity classes and local measurements on physical  Hamiltonians","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1909.05981"}],"date_updated":"2023-10-09T04:17:41Z","oa":"1","author":[{"last_name":"Gharibian","orcid":"0000-0002-9992-3379","full_name":"Gharibian, Sevag","id":"71541","first_name":"Sevag"},{"first_name":"Stephen","last_name":"Piddock","full_name":"Piddock, Stephen"},{"last_name":"Yirka","full_name":"Yirka, Justin","first_name":"Justin"}],"date_created":"2019-09-16T07:41:31Z","year":"2020","citation":{"apa":"Gharibian, S., Piddock, S., &#38; Yirka, J. (2020). Oracle complexity classes and local measurements on physical  Hamiltonians. <i>Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)</i>, 38.","bibtex":"@inproceedings{Gharibian_Piddock_Yirka_2020, title={Oracle complexity classes and local measurements on physical  Hamiltonians}, booktitle={Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)}, author={Gharibian, Sevag and Piddock, Stephen and Yirka, Justin}, year={2020}, pages={38} }","short":"S. Gharibian, S. Piddock, J. Yirka, in: Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020, p. 38.","mla":"Gharibian, Sevag, et al. “Oracle Complexity Classes and Local Measurements on Physical  Hamiltonians.” <i>Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)</i>, 2020, p. 38.","ama":"Gharibian S, Piddock S, Yirka J. Oracle complexity classes and local measurements on physical  Hamiltonians. In: <i>Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)</i>. ; 2020:38.","chicago":"Gharibian, Sevag, Stephen Piddock, and Justin Yirka. “Oracle Complexity Classes and Local Measurements on Physical  Hamiltonians.” In <i>Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)</i>, 38, 2020.","ieee":"S. Gharibian, S. Piddock, and J. Yirka, “Oracle complexity classes and local measurements on physical  Hamiltonians,” in <i>Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)</i>, 2020, p. 38."},"page":"38","publication_status":"published","language":[{"iso":"eng"}],"external_id":{"arxiv":["1909.05981"]},"_id":"13226","user_id":"71541","department":[{"_id":"623"},{"_id":"7"}],"abstract":[{"lang":"eng","text":"The canonical problem for the class Quantum Merlin-Arthur (QMA) is that of\r\nestimating ground state energies of local Hamiltonians. Perhaps surprisingly,\r\n[Ambainis, CCC 2014] showed that the related, but arguably more natural,\r\nproblem of simulating local measurements on ground states of local Hamiltonians\r\n(APX-SIM) is likely harder than QMA. Indeed, [Ambainis, CCC 2014] showed that\r\nAPX-SIM is P^QMA[log]-complete, for P^QMA[log] the class of languages decidable\r\nby a P machine making a logarithmic number of adaptive queries to a QMA oracle.\r\nIn this work, we show that APX-SIM is P^QMA[log]-complete even when restricted\r\nto more physical Hamiltonians, obtaining as intermediate steps a variety of\r\nrelated complexity-theoretic results.\r\n  We first give a sequence of results which together yield P^QMA[log]-hardness\r\nfor APX-SIM on well-motivated Hamiltonians: (1) We show that for NP, StoqMA,\r\nand QMA oracles, a logarithmic number of adaptive queries is equivalent to\r\npolynomially many parallel queries. These equalities simplify the proofs of our\r\nsubsequent results. (2) Next, we show that the hardness of APX-SIM is preserved\r\nunder Hamiltonian simulations (a la [Cubitt, Montanaro, Piddock, 2017]). As a\r\nbyproduct, we obtain a full complexity classification of APX-SIM, showing it is\r\ncomplete for P, P^||NP, P^||StoqMA, or P^||QMA depending on the Hamiltonians\r\nemployed. (3) Leveraging the above, we show that APX-SIM is P^QMA[log]-complete\r\nfor any family of Hamiltonians which can efficiently simulate spatially sparse\r\nHamiltonians, including physically motivated models such as the 2D Heisenberg\r\nmodel.\r\n  Our second focus considers 1D systems: We show that APX-SIM remains\r\nP^QMA[log]-complete even for local Hamiltonians on a 1D line of 8-dimensional\r\nqudits. This uses a number of ideas from above, along with replacing the \"query\r\nHamiltonian\" of [Ambainis, CCC 2014] with a new \"sifter\" construction."}],"status":"public","type":"conference","publication":"Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020)"},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46319","status":"public","abstract":[{"text":"The detection of orchestrated and potentially manipulative campaigns in social media is far more meaningful than an- alyzing single account behaviour but also more challenging in terms of pattern recognition, data processing, and com- putational complexity. While supervised learning methods need an enormous amount of reliable ground truth data to find rather inflexible patterns, classical unsupervised learn- ing techniques need a lot of computational power to handle large amount of data. This makes them infeasible for real- time analysis. In this work, we demonstrate the applicability of text stream clustering for the real-time detection of coordi- nated campaigns.","lang":"eng"}],"type":"conference","publication":"Proceedings of the Florida Artificial Intelligence Research Society Conference","title":"Towards Real-Time and Unsupervised Campaign Detection in Social Media","author":[{"last_name":"Assenmacher","full_name":"Assenmacher, D","first_name":"D"},{"first_name":"L","last_name":"Adam","full_name":"Adam, L"},{"first_name":"Heike","full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann"},{"full_name":"Grimme, C","last_name":"Grimme","first_name":"C"}],"date_created":"2023-08-04T07:29:36Z","date_updated":"2023-10-16T12:59:10Z","citation":{"apa":"Assenmacher, D., Adam, L., Trautmann, H., &#38; Grimme, C. (2020). Towards Real-Time and Unsupervised Campaign Detection in Social Media. <i>Proceedings of the Florida Artificial Intelligence Research Society Conference</i>.","bibtex":"@inproceedings{Assenmacher_Adam_Trautmann_Grimme_2020, place={Florida, USA}, title={Towards Real-Time and Unsupervised Campaign Detection in Social Media}, booktitle={Proceedings of the Florida Artificial Intelligence Research Society Conference}, author={Assenmacher, D and Adam, L and Trautmann, Heike and Grimme, C}, year={2020} }","mla":"Assenmacher, D., et al. “Towards Real-Time and Unsupervised Campaign Detection in Social Media.” <i>Proceedings of the Florida Artificial Intelligence Research Society Conference</i>, 2020.","short":"D. Assenmacher, L. Adam, H. Trautmann, C. Grimme, in: Proceedings of the Florida Artificial Intelligence Research Society Conference, Florida, USA, 2020.","ieee":"D. Assenmacher, L. Adam, H. Trautmann, and C. Grimme, “Towards Real-Time and Unsupervised Campaign Detection in Social Media,” 2020.","chicago":"Assenmacher, D, L Adam, Heike Trautmann, and C Grimme. “Towards Real-Time and Unsupervised Campaign Detection in Social Media.” In <i>Proceedings of the Florida Artificial Intelligence Research Society Conference</i>. Florida, USA, 2020.","ama":"Assenmacher D, Adam L, Trautmann H, Grimme C. Towards Real-Time and Unsupervised Campaign Detection in Social Media. In: <i>Proceedings of the Florida Artificial Intelligence Research Society Conference</i>. ; 2020."},"place":"Florida, USA","year":"2020"},{"type":"conference","publication":"Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)","abstract":[{"text":"In this paper, we rely on previous work proposing a modularized version of CMA-ES, which captures several alterations to the conventional CMA-ES developed in recent years. Each alteration provides significant advantages under certain problem properties, e.g., multi-modality, high conditioning. These distinct advancements are implemented as modules which result in 4608 unique versions of CMA-ES. Previous findings illustrate the competitive advantage of enabling and disabling the aforementioned modules for different optimization problems. Yet, this modular CMA-ES is lacking a method to automatically determine when the activation of specific modules is auspicious and when it is not. We propose a well-performing instance-specific algorithm configuration model which selects an (almost) optimal configuration of modules for a given problem instance. In addition, the structure of this configuration model is able to capture inter-dependencies between modules, e.g., two (or more) modules might only be advantageous in unison for some problem types, making the orchestration of modules a crucial task. This is accomplished by chaining multiple random forest classifiers together into a so-called Classifier Chain based on a set of numerical features extracted by means of Exploratory Landscape Analysis (ELA) to describe the given problem instances.","lang":"eng"}],"status":"public","_id":"46328","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}],"year":"2020","place":"Canberra, Australia","citation":{"apa":"Prager, R. P., Trautmann, H., Wang, H., Bäck, T. H. W., &#38; Kerschke, P. (2020). Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis. <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 996–1003. <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">https://doi.org/10.1109/SSCI47803.2020.9308510</a>","mla":"Prager, Raphael Patrick, et al. “Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis.” <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2020, pp. 996–1003, doi:<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>.","short":"R.P. Prager, H. Trautmann, H. Wang, T.H.W. Bäck, P. Kerschke, in: Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI), Canberra, Australia, 2020, pp. 996–1003.","bibtex":"@inproceedings{Prager_Trautmann_Wang_Bäck_Kerschke_2020, place={Canberra, Australia}, title={Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis}, DOI={<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>}, booktitle={Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Prager, Raphael Patrick and Trautmann, Heike and Wang, Hao and Bäck, Thomas H. W. and Kerschke, Pascal}, year={2020}, pages={996–1003} }","ama":"Prager RP, Trautmann H, Wang H, Bäck THW, Kerschke P. Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis. In: <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>. ; 2020:996–1003. doi:<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>","ieee":"R. P. Prager, H. Trautmann, H. Wang, T. H. W. Bäck, and P. Kerschke, “Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis,” in <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2020, pp. 996–1003, doi: <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>.","chicago":"Prager, Raphael Patrick, Heike Trautmann, Hao Wang, Thomas H. W. Bäck, and Pascal Kerschke. “Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis.” In <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 996–1003. Canberra, Australia, 2020. <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">https://doi.org/10.1109/SSCI47803.2020.9308510</a>."},"page":"996–1003","date_updated":"2023-10-16T13:04:15Z","author":[{"first_name":"Raphael Patrick","full_name":"Prager, Raphael Patrick","last_name":"Prager"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740","first_name":"Heike"},{"first_name":"Hao","full_name":"Wang, Hao","last_name":"Wang"},{"first_name":"Thomas H. W.","full_name":"Bäck, Thomas H. W.","last_name":"Bäck"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"}],"date_created":"2023-08-04T07:37:30Z","title":"Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis","doi":"10.1109/SSCI47803.2020.9308510"},{"doi":"10.1007/978-3-030-49570-1_14","title":"A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media","date_created":"2023-08-04T07:30:29Z","author":[{"last_name":"Assenmacher","full_name":"Assenmacher, D","first_name":"D"},{"full_name":"Clever, L","last_name":"Clever","first_name":"L"},{"full_name":"Pohl, JS","last_name":"Pohl","first_name":"JS"},{"first_name":"Heike","full_name":"Trautmann, Heike","id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282"},{"first_name":"C","last_name":"Grimme","full_name":"Grimme, C"}],"publisher":"Springer International Publishing","date_updated":"2023-10-16T12:59:28Z","page":"201–214","citation":{"apa":"Assenmacher, D., Clever, L., Pohl, J., Trautmann, H., &#38; Grimme, C. (2020). A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media. In G. Meiselwitz (Ed.), <i>Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis</i> (pp. 201–214). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-49570-1_14\">https://doi.org/10.1007/978-3-030-49570-1_14</a>","mla":"Assenmacher, D., et al. “A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media.” <i>Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis</i>, edited by G Meiselwitz, Springer International Publishing, 2020, pp. 201–214, doi:<a href=\"https://doi.org/10.1007/978-3-030-49570-1_14\">10.1007/978-3-030-49570-1_14</a>.","bibtex":"@inproceedings{Assenmacher_Clever_Pohl_Trautmann_Grimme_2020, place={Cham}, title={A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-49570-1_14\">10.1007/978-3-030-49570-1_14</a>}, booktitle={Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis}, publisher={Springer International Publishing}, author={Assenmacher, D and Clever, L and Pohl, JS and Trautmann, Heike and Grimme, C}, editor={Meiselwitz, G}, year={2020}, pages={201–214} }","short":"D. Assenmacher, L. Clever, J. Pohl, H. Trautmann, C. Grimme, in: G. Meiselwitz (Ed.), Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis, Springer International Publishing, Cham, 2020, pp. 201–214.","ieee":"D. Assenmacher, L. Clever, J. Pohl, H. Trautmann, and C. Grimme, “A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media,” in <i>Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis</i>, 2020, pp. 201–214, doi: <a href=\"https://doi.org/10.1007/978-3-030-49570-1_14\">10.1007/978-3-030-49570-1_14</a>.","chicago":"Assenmacher, D, L Clever, JS Pohl, Heike Trautmann, and C Grimme. “A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media.” In <i>Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis</i>, edited by G Meiselwitz, 201–214. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-49570-1_14\">https://doi.org/10.1007/978-3-030-49570-1_14</a>.","ama":"Assenmacher D, Clever L, Pohl J, Trautmann H, Grimme C. A Two-Phase Framework for Detecting Manipulation Campaigns in Social Media. In: Meiselwitz G, ed. <i>Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis</i>. Springer International Publishing; 2020:201–214. doi:<a href=\"https://doi.org/10.1007/978-3-030-49570-1_14\">10.1007/978-3-030-49570-1_14</a>"},"year":"2020","place":"Cham","publication_identifier":{"isbn":["978-3-030-49570-1"]},"language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","_id":"46320","status":"public","editor":[{"first_name":"G","last_name":"Meiselwitz","full_name":"Meiselwitz, G"}],"abstract":[{"text":"The identification of coordinated campaigns within Social Media is a complex task that is often hindered by missing labels and large amounts of data that have to be processed. We propose a new two-phase framework that uses unsupervised stream clustering for detecting suspicious trends over time in a first step. Afterwards, traditional offline analyses are applied to distinguish between normal trend evolution and malicious manipulation attempts. We demonstrate the applicability of our framework in the context of the final days of the Brexit in 2019/2020.","lang":"eng"}],"publication":"Proceedings of the International Conference on Human-Computer Interaction (HCII 2020): Social Computing and Social Media. Design, Ethics, User Behavior, and Social Network Analysis","type":"conference"},{"status":"public","abstract":[{"lang":"eng","text":"Clustering is an important technique in data analysis which can reveal hidden patterns and unknown relationships in the data. A common problem in clustering is the proper choice of parameter settings. To tackle this, automated algorithm configuration is available which can automatically find the best parameter settings. In practice, however, many of our today’s data sources are data streams due to the widespread deployment of sensors, the internet-of-things or (social) media. Stream clustering aims to tackle this challenge by identifying, tracking and updating clusters over time. Unfortunately, none of the existing approaches for automated algorithm configuration are directly applicable to the streaming scenario. In this paper, we explore the possibility of automated algorithm configuration for stream clustering algorithms using an ensemble of different configurations. In first experiments, we demonstrate that our approach is able to automatically find superior configurations and refine them over time."}],"publication":"Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","_id":"46325","page":"137–143","citation":{"apa":"Carnein, M., Trautmann, H., Bifet, A., &#38; Pfahringer, B. (2020). Towards Automated Configuration of Stream Clustering Algorithms. <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)</i>, 137–143. <a href=\"https://doi.org/10.1007/978-3-030-43823-4_12\">https://doi.org/10.1007/978-3-030-43823-4_12</a>","short":"M. Carnein, H. Trautmann, A. Bifet, B. Pfahringer, in: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19), Würzburg, Germany, 2020, pp. 137–143.","mla":"Carnein, Matthias, et al. “Towards Automated Configuration of Stream Clustering Algorithms.” <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)</i>, 2020, pp. 137–143, doi:<a href=\"https://doi.org/10.1007/978-3-030-43823-4_12\">10.1007/978-3-030-43823-4_12</a>.","bibtex":"@inproceedings{Carnein_Trautmann_Bifet_Pfahringer_2020, place={Würzburg, Germany}, title={Towards Automated Configuration of Stream Clustering Algorithms}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-43823-4_12\">10.1007/978-3-030-43823-4_12</a>}, booktitle={Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)}, author={Carnein, Matthias and Trautmann, Heike and Bifet, Albert and Pfahringer, Bernhard}, year={2020}, pages={137–143} }","chicago":"Carnein, Matthias, Heike Trautmann, Albert Bifet, and Bernhard Pfahringer. “Towards Automated Configuration of Stream Clustering Algorithms.” In <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)</i>, 137–143. Würzburg, Germany, 2020. <a href=\"https://doi.org/10.1007/978-3-030-43823-4_12\">https://doi.org/10.1007/978-3-030-43823-4_12</a>.","ieee":"M. Carnein, H. Trautmann, A. Bifet, and B. Pfahringer, “Towards Automated Configuration of Stream Clustering Algorithms,” in <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)</i>, 2020, pp. 137–143, doi: <a href=\"https://doi.org/10.1007/978-3-030-43823-4_12\">10.1007/978-3-030-43823-4_12</a>.","ama":"Carnein M, Trautmann H, Bifet A, Pfahringer B. Towards Automated Configuration of Stream Clustering Algorithms. In: <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD ’19)</i>. ; 2020:137–143. doi:<a href=\"https://doi.org/10.1007/978-3-030-43823-4_12\">10.1007/978-3-030-43823-4_12</a>"},"year":"2020","place":"Würzburg, Germany","publication_identifier":{"isbn":["978-3-030-43823-4"]},"doi":"10.1007/978-3-030-43823-4_12","title":"Towards Automated Configuration of Stream Clustering Algorithms","author":[{"full_name":"Carnein, Matthias","last_name":"Carnein","first_name":"Matthias"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike"},{"full_name":"Bifet, Albert","last_name":"Bifet","first_name":"Albert"},{"first_name":"Bernhard","full_name":"Pfahringer, Bernhard","last_name":"Pfahringer"}],"date_created":"2023-08-04T07:35:24Z","date_updated":"2023-10-16T13:03:15Z"}]