[{"issue":"4","year":"2022","intvolume":"        29","page":"317–343","citation":{"apa":"Feldmann, M., Padalkin, A., Scheideler, C., &#38; Dolev, S. (2022). Coordinating Amoebots via Reconfigurable Circuits. <i>J. Comput. Biol.</i>, <i>29</i>(4), 317–343. <a href=\"https://doi.org/10.1089/cmb.2021.0363\">https://doi.org/10.1089/cmb.2021.0363</a>","bibtex":"@article{Feldmann_Padalkin_Scheideler_Dolev_2022, title={Coordinating Amoebots via Reconfigurable Circuits}, volume={29}, DOI={<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>}, number={4}, journal={J. Comput. Biol.}, author={Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}, year={2022}, pages={317–343} }","short":"M. Feldmann, A. Padalkin, C. Scheideler, S. Dolev, J. Comput. Biol. 29 (2022) 317–343.","mla":"Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.” <i>J. Comput. Biol.</i>, vol. 29, no. 4, 2022, pp. 317–343, doi:<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>.","ieee":"M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,” <i>J. Comput. Biol.</i>, vol. 29, no. 4, pp. 317–343, 2022, doi: <a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>.","chicago":"Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.” <i>J. Comput. Biol.</i> 29, no. 4 (2022): 317–343. <a href=\"https://doi.org/10.1089/cmb.2021.0363\">https://doi.org/10.1089/cmb.2021.0363</a>.","ama":"Feldmann M, Padalkin A, Scheideler C, Dolev S. Coordinating Amoebots via Reconfigurable Circuits. <i>J Comput Biol</i>. 2022;29(4):317–343. doi:<a href=\"https://doi.org/10.1089/cmb.2021.0363\">10.1089/cmb.2021.0363</a>"},"date_updated":"2022-05-04T12:31:27Z","volume":29,"author":[{"full_name":"Feldmann, Michael","last_name":"Feldmann","first_name":"Michael"},{"id":"88238","full_name":"Padalkin, Andreas","last_name":"Padalkin","first_name":"Andreas"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"full_name":"Dolev, Shlomi","last_name":"Dolev","first_name":"Shlomi"}],"date_created":"2022-05-04T12:29:22Z","title":"Coordinating Amoebots via Reconfigurable Circuits","doi":"10.1089/cmb.2021.0363","publication":"J. Comput. Biol.","type":"journal_article","status":"public","_id":"31060","department":[{"_id":"79"}],"user_id":"15504","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"keyword":["Safety","Risk","Reliability and Quality","General Computer Science"],"user_id":"15249","department":[{"_id":"76"}],"_id":"31844","status":"public","abstract":[{"text":"<jats:p>Encrypting data before sending it to the cloud ensures data confidentiality but requires the cloud to compute on encrypted data. Trusted execution environments, such as Intel SGX enclaves, promise to provide a secure environment in which data can be decrypted and then processed. However, vulnerabilities in the executed program give attackers ample opportunities to execute arbitrary code inside the enclave. This code can modify the dataflow of the program and leak secrets via SGX side channels. Fully homomorphic encryption would be an alternative to compute on encrypted data without data leaks. However, due to its high computational complexity, its applicability to general-purpose computing remains limited. Researchers have made several proposals for transforming programs to perform encrypted computations on less powerful encryption schemes. Yet current approaches do not support programs making control-flow decisions based on encrypted data.</jats:p>\r\n          <jats:p>\r\n            We introduce the concept of\r\n            <jats:italic>dataflow authentication</jats:italic>\r\n            (DFAuth) to enable such programs. DFAuth prevents an adversary from arbitrarily deviating from the dataflow of a program. Our technique hence offers protections against the side-channel attacks described previously. We implemented two flavors of DFAuth, a Java bytecode-to-bytecode compiler, and an SGX enclave running a small and program-independent trusted code base. We applied DFAuth to a neural network performing machine learning on sensitive medical data and a smart charging scheduler for electric vehicles. Our transformation yields a neural network with encrypted weights, which can be evaluated on encrypted inputs in\r\n            <jats:inline-formula content-type=\"math/tex\">\r\n              <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\( 12.55 \\,\\mathrm{m}\\mathrm{s} \\)</jats:tex-math>\r\n            </jats:inline-formula>\r\n            . Our protected scheduler is capable of updating the encrypted charging plan in approximately 1.06 seconds.\r\n          </jats:p>","lang":"eng"}],"type":"journal_article","publication":"ACM Transactions on Privacy and Security","doi":"10.1145/3513005","title":"Computation on Encrypted Data Using Dataflow Authentication","date_created":"2022-06-09T10:28:03Z","author":[{"last_name":"Fischer","full_name":"Fischer, Andreas","first_name":"Andreas"},{"full_name":"Fuhry, Benny","last_name":"Fuhry","first_name":"Benny"},{"first_name":"Jörn","last_name":"Kußmaul","full_name":"Kußmaul, Jörn"},{"last_name":"Janneck","full_name":"Janneck, Jonas","first_name":"Jonas"},{"first_name":"Florian","full_name":"Kerschbaum, Florian","last_name":"Kerschbaum"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256","first_name":"Eric"}],"volume":25,"date_updated":"2022-06-09T10:29:19Z","publisher":"Association for Computing Machinery (ACM)","citation":{"ama":"Fischer A, Fuhry B, Kußmaul J, Janneck J, Kerschbaum F, Bodden E. Computation on Encrypted Data Using Dataflow Authentication. <i>ACM Transactions on Privacy and Security</i>. 2022;25(3):1-36. doi:<a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>","chicago":"Fischer, Andreas, Benny Fuhry, Jörn Kußmaul, Jonas Janneck, Florian Kerschbaum, and Eric Bodden. “Computation on Encrypted Data Using Dataflow Authentication.” <i>ACM Transactions on Privacy and Security</i> 25, no. 3 (2022): 1–36. <a href=\"https://doi.org/10.1145/3513005\">https://doi.org/10.1145/3513005</a>.","ieee":"A. Fischer, B. Fuhry, J. Kußmaul, J. Janneck, F. Kerschbaum, and E. Bodden, “Computation on Encrypted Data Using Dataflow Authentication,” <i>ACM Transactions on Privacy and Security</i>, vol. 25, no. 3, pp. 1–36, 2022, doi: <a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>.","apa":"Fischer, A., Fuhry, B., Kußmaul, J., Janneck, J., Kerschbaum, F., &#38; Bodden, E. (2022). Computation on Encrypted Data Using Dataflow Authentication. <i>ACM Transactions on Privacy and Security</i>, <i>25</i>(3), 1–36. <a href=\"https://doi.org/10.1145/3513005\">https://doi.org/10.1145/3513005</a>","short":"A. Fischer, B. Fuhry, J. Kußmaul, J. Janneck, F. Kerschbaum, E. Bodden, ACM Transactions on Privacy and Security 25 (2022) 1–36.","bibtex":"@article{Fischer_Fuhry_Kußmaul_Janneck_Kerschbaum_Bodden_2022, title={Computation on Encrypted Data Using Dataflow Authentication}, volume={25}, DOI={<a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>}, number={3}, journal={ACM Transactions on Privacy and Security}, publisher={Association for Computing Machinery (ACM)}, author={Fischer, Andreas and Fuhry, Benny and Kußmaul, Jörn and Janneck, Jonas and Kerschbaum, Florian and Bodden, Eric}, year={2022}, pages={1–36} }","mla":"Fischer, Andreas, et al. “Computation on Encrypted Data Using Dataflow Authentication.” <i>ACM Transactions on Privacy and Security</i>, vol. 25, no. 3, Association for Computing Machinery (ACM), 2022, pp. 1–36, doi:<a href=\"https://doi.org/10.1145/3513005\">10.1145/3513005</a>."},"page":"1-36","intvolume":"        25","year":"2022","issue":"3","publication_status":"published","publication_identifier":{"issn":["2471-2566","2471-2574"]}},{"date_updated":"2022-06-20T06:16:49Z","author":[{"first_name":"Henning","full_name":"Hillebrandt, Henning","last_name":"Hillebrandt"}],"date_created":"2022-06-20T06:16:32Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"title":"Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen","has_accepted_license":"1","year":"2022","citation":{"chicago":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>, 2022.","ieee":"H. Hillebrandt, <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","ama":"Hillebrandt H. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>.; 2022.","mla":"Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen</i>. 2022.","short":"H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.","bibtex":"@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }","apa":"Hillebrandt, H. (2022). <i>Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen</i>."},"_id":"31947","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A1: SFB 901 - Subproject A1","_id":"5"}],"department":[{"_id":"79"}],"user_id":"15504","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2022-06-20T06:16:09Z","type":"bachelorsthesis","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"BA_Hillebrandt.pdf","file_id":"31950","file_size":1585281,"creator":"florida","date_created":"2022-06-20T06:16:09Z","date_updated":"2022-06-20T06:16:09Z"}]},{"publication":"Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)","type":"conference","abstract":[{"lang":"eng","text":"Testing is one of the most frequent means of quality assurance for software. Property-based testing aims at generating test suites for checking code against user-defined properties. Test input generation is, however, most often independent of the property to be checked, and is instead based on random or user-defined data generation.In this paper, we present property-driven unit testing of functions with numerical inputs and outputs. Alike property-based testing, it allows users to define the properties to be tested for. Contrary to property-based testing, it also uses the property for a targeted generation of test inputs. Our approach is a form of learning-based testing where we first of all learn a model of a given black-box function using standard machine learning algorithms, and in a second step use model and property for test input generation. This allows us to test both predefined functions as well as machine learned regression models. Our experimental evaluation shows that our property-driven approach is more effective than standard property-based testing techniques."}],"status":"public","_id":"32311","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"department":[{"_id":"7"}],"user_id":"477","language":[{"iso":"eng"}],"year":"2022","page":"113-123","citation":{"ieee":"A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven Testing of Black-Box Functions,” in <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 2022, pp. 113–123.","chicago":"Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven Testing of Black-Box Functions.” In <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–23. IEEE, 2022.","ama":"Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of Black-Box Functions. In: <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>. IEEE; 2022:113-123.","apa":"Sharma, A., Melnikov, V., Hüllermeier, E., &#38; Wehrheim, H. (2022). Property-Driven Testing of Black-Box Functions. <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–123.","bibtex":"@inproceedings{Sharma_Melnikov_Hüllermeier_Wehrheim_2022, title={Property-Driven Testing of Black-Box Functions}, booktitle={Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)}, publisher={IEEE}, author={Sharma, Arnab and Melnikov, Vitaly and Hüllermeier, Eyke and Wehrheim, Heike}, year={2022}, pages={113–123} }","short":"A. Sharma, V. Melnikov, E. Hüllermeier, H. Wehrheim, in: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), IEEE, 2022, pp. 113–123.","mla":"Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, IEEE, 2022, pp. 113–23."},"publisher":"IEEE","date_updated":"2022-07-01T11:21:36Z","author":[{"first_name":"Arnab","id":"67200","full_name":"Sharma, Arnab","last_name":"Sharma"},{"last_name":"Melnikov","id":"58747","full_name":"Melnikov, Vitaly","first_name":"Vitaly"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2022-07-01T11:18:03Z","title":"Property-Driven Testing of Black-Box Functions"},{"date_created":"2022-02-15T07:32:10Z","publisher":"IEEE","title":"Model-driven Continuous Experimentation on Component-based Software Architectures ","year":"2022","language":[{"iso":"eng"}],"keyword":["continuous experimentation","model-driven","component-based software architectures","self-adaptation"],"ddc":["000"],"publication":"Proceedings of the 18th International Conference on Software Architecture Companion ","file":[{"file_name":"ICSA_CR.pdf","access_level":"open_access","file_id":"32322","file_size":183185,"date_created":"2022-07-04T12:33:18Z","creator":"sego","date_updated":"2022-07-04T12:34:52Z","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"To build successful software products, developers continuously have to discover what features the users really need. This discovery can be achieved with continuous experimentation, testing different software variants with distinct user groups, and deploying the superior variant for all users. However, existing approaches do not focus on explicit modeling of variants and experiments, which offers advantages such as traceability of decisions and combinability of experiments. Therefore, our vision is the provision of model-driven continuous experimentation, which provides the developer with a framework for structuring the experimentation process. For that, we introduce the overall concept, apply it to the experimentation on component-based software architectures and point out future research questions. In particular, we show the applicability by combining feature models for modeling the software variants, users, and experiments (i.e., model-driven) with MAPE-K for the adaptation (i.e., continuous experimentation) and implementing the concept based on the component-based Angular framework."}],"author":[{"last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208","first_name":"Sebastian"},{"last_name":"Yigitbas","orcid":"0000-0002-5967-833X","id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"date_updated":"2022-07-04T12:34:53Z","oa":"1","doi":"10.1109/ICSA-C54293.2022.00011","conference":{"location":"Hawaii","end_date":"2022-03-15","start_date":"2022-03-12","name":"18th International Conference on Software Architecture "},"has_accepted_license":"1","citation":{"apa":"Gottschalk, S., Yigitbas, E., &#38; Engels, G. (2022). Model-driven Continuous Experimentation on Component-based Software Architectures . <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>. 18th International Conference on Software Architecture , Hawaii. <a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">https://doi.org/10.1109/ICSA-C54293.2022.00011</a>","bibtex":"@inproceedings{Gottschalk_Yigitbas_Engels_2022, title={Model-driven Continuous Experimentation on Component-based Software Architectures }, DOI={<a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>}, booktitle={Proceedings of the 18th International Conference on Software Architecture Companion }, publisher={IEEE}, author={Gottschalk, Sebastian and Yigitbas, Enes and Engels, Gregor}, year={2022} }","mla":"Gottschalk, Sebastian, et al. “Model-Driven Continuous Experimentation on Component-Based Software Architectures .” <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>.","short":"S. Gottschalk, E. Yigitbas, G. Engels, in: Proceedings of the 18th International Conference on Software Architecture Companion , IEEE, 2022.","ama":"Gottschalk S, Yigitbas E, Engels G. Model-driven Continuous Experimentation on Component-based Software Architectures . In: <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>","chicago":"Gottschalk, Sebastian, Enes Yigitbas, and Gregor Engels. “Model-Driven Continuous Experimentation on Component-Based Software Architectures .” In <i>Proceedings of the 18th International Conference on Software Architecture Companion </i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">https://doi.org/10.1109/ICSA-C54293.2022.00011</a>.","ieee":"S. Gottschalk, E. Yigitbas, and G. Engels, “Model-driven Continuous Experimentation on Component-based Software Architectures ,” presented at the 18th International Conference on Software Architecture , Hawaii, 2022, doi: <a href=\"https://doi.org/10.1109/ICSA-C54293.2022.00011\">10.1109/ICSA-C54293.2022.00011</a>."},"department":[{"_id":"66"},{"_id":"534"}],"user_id":"47208","_id":"29842","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"file_date_updated":"2022-07-04T12:34:52Z","type":"conference","status":"public"},{"title":"A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING","doi":"10.52041/serj.v21i2.46","publisher":"International Association for Statistical Education","date_updated":"2022-07-08T12:07:46Z","date_created":"2022-07-08T12:06:48Z","author":[{"first_name":"SUSANNE","last_name":"PODWORNY","full_name":"PODWORNY, SUSANNE"},{"id":"58465","full_name":"Hüsing, Sven","last_name":"Hüsing","first_name":"Sven"},{"first_name":"CARSTEN","full_name":"SCHULTE, CARSTEN","last_name":"SCHULTE"}],"volume":21,"year":"2022","citation":{"apa":"PODWORNY, S., Hüsing, S., &#38; SCHULTE, C. (2022). A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING. <i>STATISTICS EDUCATION RESEARCH JOURNAL</i>, <i>21</i>(2), Article 6. <a href=\"https://doi.org/10.52041/serj.v21i2.46\">https://doi.org/10.52041/serj.v21i2.46</a>","short":"S. PODWORNY, S. Hüsing, C. SCHULTE, STATISTICS EDUCATION RESEARCH JOURNAL 21 (2022).","mla":"PODWORNY, SUSANNE, et al. “A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING.” <i>STATISTICS EDUCATION RESEARCH JOURNAL</i>, vol. 21, no. 2, 6, International Association for Statistical Education, 2022, doi:<a href=\"https://doi.org/10.52041/serj.v21i2.46\">10.52041/serj.v21i2.46</a>.","bibtex":"@article{PODWORNY_Hüsing_SCHULTE_2022, title={A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING}, volume={21}, DOI={<a href=\"https://doi.org/10.52041/serj.v21i2.46\">10.52041/serj.v21i2.46</a>}, number={26}, journal={STATISTICS EDUCATION RESEARCH JOURNAL}, publisher={International Association for Statistical Education}, author={PODWORNY, SUSANNE and Hüsing, Sven and SCHULTE, CARSTEN}, year={2022} }","ama":"PODWORNY S, Hüsing S, SCHULTE C. A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING. <i>STATISTICS EDUCATION RESEARCH JOURNAL</i>. 2022;21(2). doi:<a href=\"https://doi.org/10.52041/serj.v21i2.46\">10.52041/serj.v21i2.46</a>","ieee":"S. PODWORNY, S. Hüsing, and C. SCHULTE, “A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING,” <i>STATISTICS EDUCATION RESEARCH JOURNAL</i>, vol. 21, no. 2, Art. no. 6, 2022, doi: <a href=\"https://doi.org/10.52041/serj.v21i2.46\">10.52041/serj.v21i2.46</a>.","chicago":"PODWORNY, SUSANNE, Sven Hüsing, and CARSTEN SCHULTE. “A PLACE FOR A DATA SCIENCE PROJECT IN SCHOOL: BETWEEN STATISTICS AND EPISTEMIC PROGRAMMING.” <i>STATISTICS EDUCATION RESEARCH JOURNAL</i> 21, no. 2 (2022). <a href=\"https://doi.org/10.52041/serj.v21i2.46\">https://doi.org/10.52041/serj.v21i2.46</a>."},"intvolume":"        21","publication_status":"published","publication_identifier":{"issn":["1570-1824"]},"issue":"2","article_number":"6","keyword":["Education","Statistics and Probability"],"language":[{"iso":"eng"}],"_id":"32335","user_id":"58465","department":[{"_id":"67"}],"abstract":[{"text":"Aspects of data science surround us in many contexts, for example regarding climate change, air pollution, and other environmental issues. To open the “data-science-black-box” for lower secondary school students we developed a data science project focussing on the analysis of self-collected environmental data. We embed this project in computer science education, which enables us to use a new knowledge-based programming approach for the data analysis within Jupyter Notebooks and the programming language Python. In this paper, we evaluate the second cycle of this project which took place in a ninth-grade computer science class. In particular, we present how the students coped with the professional tool of Jupyter Notebooks for doing statistical investigations and which insights they gained.","lang":"eng"}],"status":"public","type":"journal_article","publication":"STATISTICS EDUCATION RESEARCH JOURNAL"},{"language":[{"iso":"eng"}],"external_id":{"arxiv":["2201.12062"]},"abstract":[{"lang":"eng","text":"Koopman operator theory has been successfully applied to problems from various research areas such as fluid dynamics, molecular dynamics, climate science, engineering, and biology. Applications include detecting metastable or coherent sets, coarse-graining, system identification, and control. There is an intricate connection between dynamical systems driven by stochastic differential equations and quantum mechanics. In this paper, we compare the ground-state transformation and Nelson's stochastic mechanics and demonstrate how data-driven methods developed for the approximation of the Koopman operator can be used to analyze quantum physics problems. Moreover, we exploit the relationship between Schrödinger operators and stochastic control problems to show that modern data-driven methods for stochastic control can be used to solve the stationary or imaginary-time Schrödinger equation. Our findings open up a new avenue towards solving Schrödinger's equation using recently developed tools from data science."}],"publication":"Journal of Physics A: Mathematical and Theoretical","title":"Koopman analysis of quantum systems","date_created":"2022-01-31T09:49:40Z","publisher":"IOP Publishing Ltd.","year":"2022","issue":"31","user_id":"47427","department":[{"_id":"655"},{"_id":"101"}],"_id":"29673","status":"public","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://iopscience.iop.org/article/10.1088/1751-8121/ac7d22/pdf"}],"doi":"10.1088/1751-8121/ac7d22","author":[{"last_name":"Klus","full_name":"Klus, Stefan","first_name":"Stefan"},{"full_name":"Nüske, Feliks","id":"81513","last_name":"Nüske","orcid":"0000-0003-2444-7889","first_name":"Feliks"},{"first_name":"Sebastian","orcid":"0000-0002-3389-793X","last_name":"Peitz","id":"47427","full_name":"Peitz, Sebastian"}],"volume":55,"oa":"1","date_updated":"2022-07-18T14:26:41Z","citation":{"ieee":"S. Klus, F. Nüske, and S. Peitz, “Koopman analysis of quantum systems,” <i>Journal of Physics A: Mathematical and Theoretical</i>, vol. 55, no. 31, p. 314002, 2022, doi: <a href=\"https://doi.org/10.1088/1751-8121/ac7d22\">10.1088/1751-8121/ac7d22</a>.","chicago":"Klus, Stefan, Feliks Nüske, and Sebastian Peitz. “Koopman Analysis of Quantum Systems.” <i>Journal of Physics A: Mathematical and Theoretical</i> 55, no. 31 (2022): 314002. <a href=\"https://doi.org/10.1088/1751-8121/ac7d22\">https://doi.org/10.1088/1751-8121/ac7d22</a>.","ama":"Klus S, Nüske F, Peitz S. Koopman analysis of quantum systems. <i>Journal of Physics A: Mathematical and Theoretical</i>. 2022;55(31):314002. doi:<a href=\"https://doi.org/10.1088/1751-8121/ac7d22\">10.1088/1751-8121/ac7d22</a>","apa":"Klus, S., Nüske, F., &#38; Peitz, S. (2022). Koopman analysis of quantum systems. <i>Journal of Physics A: Mathematical and Theoretical</i>, <i>55</i>(31), 314002. <a href=\"https://doi.org/10.1088/1751-8121/ac7d22\">https://doi.org/10.1088/1751-8121/ac7d22</a>","mla":"Klus, Stefan, et al. “Koopman Analysis of Quantum Systems.” <i>Journal of Physics A: Mathematical and Theoretical</i>, vol. 55, no. 31, IOP Publishing Ltd., 2022, p. 314002, doi:<a href=\"https://doi.org/10.1088/1751-8121/ac7d22\">10.1088/1751-8121/ac7d22</a>.","bibtex":"@article{Klus_Nüske_Peitz_2022, title={Koopman analysis of quantum systems}, volume={55}, DOI={<a href=\"https://doi.org/10.1088/1751-8121/ac7d22\">10.1088/1751-8121/ac7d22</a>}, number={31}, journal={Journal of Physics A: Mathematical and Theoretical}, publisher={IOP Publishing Ltd.}, author={Klus, Stefan and Nüske, Feliks and Peitz, Sebastian}, year={2022}, pages={314002} }","short":"S. Klus, F. Nüske, S. Peitz, Journal of Physics A: Mathematical and Theoretical 55 (2022) 314002."},"intvolume":"        55","page":"314002","publication_status":"published"},{"abstract":[{"lang":"eng","text":"Context: Cryptographic APIs are often misused in real-world applications. Therefore, many cryptographic API misuse detection tools have been introduced. However, there exists no established reference benchmark for a fair and comprehensive comparison and evaluation of these tools. While there are benchmarks, they often only address a subset of the domain or were only used to evaluate a subset of existing misuse detection tools. Objective: To fairly compare cryptographic API misuse detection tools and to drive future development in this domain, we will devise such a benchmark. Openness and transparency in the generation process are key factors to fairly generate and establish the needed benchmark. Method: We propose an approach where we derive the benchmark generation methodology from the literature which consists of general best practices in benchmarking and domain-specific benchmark generation. A part of this methodology is transparency and openness of the generation process, which is achieved by pre-registering this work. Based on our methodology we design CamBench, a fair \"Cryptographic API Misuse Detection Tool Benchmark Suite\". We will implement the first version of CamBench limiting the domain to Java, the JCA, and static analyses. Finally, we will use CamBench to compare current misuse detection tools and compare CamBench to related benchmarks of its domain."}],"status":"public","type":"misc","keyword":["cryptography","benchmark","API misuse","static analysis"],"language":[{"iso":"eng"}],"_id":"32409","department":[{"_id":"76"}],"user_id":"32312","year":"2022","citation":{"ama":"Schlichtig M, Wickert A-K, Krüger S, Bodden E, Mezini M. <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>.; 2022. doi:<a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">10.48550/ARXIV.2204.06447</a>","chicago":"Schlichtig, Michael, Anna-Katharina Wickert, Stefan Krüger, Eric Bodden, and Mira Mezini. <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>, 2022. <a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">https://doi.org/10.48550/ARXIV.2204.06447</a>.","ieee":"M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, and M. Mezini, <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>. 2022.","apa":"Schlichtig, M., Wickert, A.-K., Krüger, S., Bodden, E., &#38; Mezini, M. (2022). <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>. <a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">https://doi.org/10.48550/ARXIV.2204.06447</a>","mla":"Schlichtig, Michael, et al. <i>CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite</i>. 2022, doi:<a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">10.48550/ARXIV.2204.06447</a>.","bibtex":"@book{Schlichtig_Wickert_Krüger_Bodden_Mezini_2022, title={CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite}, DOI={<a href=\"https://doi.org/10.48550/ARXIV.2204.06447\">10.48550/ARXIV.2204.06447</a>}, author={Schlichtig, Michael and Wickert, Anna-Katharina and Krüger, Stefan and Bodden, Eric and Mezini, Mira}, year={2022} }","short":"M. Schlichtig, A.-K. Wickert, S. Krüger, E. Bodden, M. Mezini, CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite, 2022."},"related_material":{"link":[{"url":"https://arxiv.org/abs/2204.06447","relation":"confirmation"}]},"title":"CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite","doi":"10.48550/ARXIV.2204.06447","date_updated":"2022-07-25T10:23:44Z","author":[{"first_name":"Michael","orcid":"0000-0001-6600-6171","last_name":"Schlichtig","id":"32312","full_name":"Schlichtig, Michael"},{"full_name":"Wickert, Anna-Katharina","last_name":"Wickert","first_name":"Anna-Katharina"},{"first_name":"Stefan","full_name":"Krüger, Stefan","last_name":"Krüger"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"first_name":"Mira","full_name":"Mezini, Mira","last_name":"Mezini"}],"date_created":"2022-07-25T07:56:59Z"},{"doi":"10.17619/UNIPB/1-1281","title":"Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations","date_created":"2022-07-25T18:13:51Z","supervisor":[{"last_name":"Plessl","orcid":"0000-0001-5728-9982","id":"16153","full_name":"Plessl, Christian","first_name":"Christian"}],"author":[{"first_name":"Michael","full_name":"Lass, Michael","id":"24135","orcid":"0000-0002-5708-7632","last_name":"Lass"}],"date_updated":"2022-07-25T18:14:23Z","publisher":"Universität Paderborn","citation":{"chicago":"Lass, Michael. <i>Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations</i>. Paderborn: Universität Paderborn, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1281\">https://doi.org/10.17619/UNIPB/1-1281</a>.","ieee":"M. Lass, <i>Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations</i>. Paderborn: Universität Paderborn, 2022.","ama":"Lass M. <i>Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations</i>. Universität Paderborn; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1281\">10.17619/UNIPB/1-1281</a>","bibtex":"@book{Lass_2022, place={Paderborn}, title={Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1281\">10.17619/UNIPB/1-1281</a>}, publisher={Universität Paderborn}, author={Lass, Michael}, year={2022} }","short":"M. Lass, Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations, Universität Paderborn, Paderborn, 2022.","mla":"Lass, Michael. <i>Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations</i>. Universität Paderborn, 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1281\">10.17619/UNIPB/1-1281</a>.","apa":"Lass, M. (2022). <i>Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1281\">https://doi.org/10.17619/UNIPB/1-1281</a>"},"place":"Paderborn","year":"2022","language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"24135","_id":"32414","status":"public","type":"dissertation"},{"user_id":"32312","department":[{"_id":"76"}],"_id":"32410","language":[{"iso":"eng"}],"keyword":["Automated static analysis","Software usability"],"type":"conference","publication":"Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis","status":"public","abstract":[{"text":"Static analysis tools support developers in detecting potential coding issues, such as bugs or vulnerabilities. Research on static analysis emphasizes its technical challenges but also mentions severe usability shortcomings. These shortcomings hinder the adoption of static analysis tools, and in some cases, user dissatisfaction even leads to tool abandonment.\r\nTo comprehensively assess the current state of the art, this paper presents the first systematic usability evaluation in a wide range of static analysis tools. We derived a set of 36 relevant criteria from the scientific literature and gathered a collection of 46 static analysis tools complying with our inclusion and exclusion criteria - a representative set of mainly non-proprietary tools. Then, we evaluated how well these tools fulfill the aforementioned criteria.\r\nThe evaluation shows that more than half of the considered tools offer poor warning messages, while about three-quarters of the tools provide hardly any fix support. Furthermore, the integration of user knowledge is strongly neglected, which could be used for improved handling of false positives and tuning the results for the corresponding developer. Finally, issues regarding workflow integration and specialized user interfaces are proved further.\r\nThese findings should prove useful in guiding and focusing further research and development in the area of user experience for static code analyses.","lang":"eng"}],"author":[{"last_name":"Nachtigall","id":"41213","full_name":"Nachtigall, Marcus","first_name":"Marcus"},{"first_name":"Michael","full_name":"Schlichtig, Michael","id":"32312","orcid":"0000-0001-6600-6171","last_name":"Schlichtig"},{"first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"}],"date_created":"2022-07-25T08:02:36Z","date_updated":"2022-07-26T11:42:23Z","publisher":"ACM","doi":"10.1145/3533767","title":"A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools","related_material":{"link":[{"relation":"confirmation","url":"https://dl.acm.org/doi/10.1145/3533767.3534374"}]},"publication_status":"published","quality_controlled":"1","publication_identifier":{"isbn":["9781450393799"]},"citation":{"ama":"Nachtigall M, Schlichtig M, Bodden E. A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools. In: <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>. ACM; 2022:532-543. doi:<a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>","chicago":"Nachtigall, Marcus, Michael Schlichtig, and Eric Bodden. “A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools.” In <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 532–43. ACM, 2022. <a href=\"https://doi.org/10.1145/3533767\">https://doi.org/10.1145/3533767</a>.","ieee":"M. Nachtigall, M. Schlichtig, and E. Bodden, “A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools,” in <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 2022, pp. 532–543, doi: <a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>.","short":"M. Nachtigall, M. Schlichtig, E. Bodden, in: Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, 2022, pp. 532–543.","bibtex":"@inproceedings{Nachtigall_Schlichtig_Bodden_2022, title={A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools}, DOI={<a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>}, booktitle={Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis}, publisher={ACM}, author={Nachtigall, Marcus and Schlichtig, Michael and Bodden, Eric}, year={2022}, pages={532–543} }","mla":"Nachtigall, Marcus, et al. “A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools.” <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, ACM, 2022, pp. 532–43, doi:<a href=\"https://doi.org/10.1145/3533767\">10.1145/3533767</a>.","apa":"Nachtigall, M., Schlichtig, M., &#38; Bodden, E. (2022). A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools. <i>Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 532–543. <a href=\"https://doi.org/10.1145/3533767\">https://doi.org/10.1145/3533767</a>"},"page":"532 - 543","year":"2022"},{"language":[{"iso":"eng"}],"keyword":["API misuses","API usage constraints","classification framework","API misuse detection","static analysis"],"user_id":"32312","department":[{"_id":"76"}],"_id":"31133","status":"public","abstract":[{"text":"Application Programming Interfaces (APIs) are the primary mechanism that developers use to obtain access to third-party algorithms and services. Unfortunately, APIs can be misused, which can have catastrophic consequences, especially if the APIs provide security-critical functionalities like cryptography. Understanding what API misuses are, and for what reasons they are caused, is important to prevent them, e.g., with API misuse detectors. However, definitions and nominations for API misuses and related terms in literature vary and are diverse. This paper addresses the problem of scattered knowledge and definitions of API misuses by presenting a systematic literature review on the subject and introducing FUM, a novel Framework for API Usage constraint and Misuse classification. The literature review revealed that API misuses are violations of API usage constraints. To capture this, we provide unified definitions and use them to derive FUM. To assess the extent to which FUM aids in determining and guiding the improvement of an API misuses detectors' capabilities, we performed a case study on CogniCrypt, a state-of-the-art misuse detector for cryptographic APIs. The study showed that FUM can be used to properly assess CogniCrypt's capabilities, identify weaknesses and assist in deriving mitigations and improvements. And it appears that also more generally FUM can aid the development and improvement of misuse detection tools.","lang":"eng"}],"type":"conference","publication":"2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)","doi":"https://doi.org/10.1109/SANER53432.2022.00085","title":"FUM - A Framework for API Usage constraint and Misuse Classification","author":[{"orcid":"0000-0001-6600-6171","last_name":"Schlichtig","id":"32312","full_name":"Schlichtig, Michael","first_name":"Michael"},{"last_name":"Sassalla","full_name":"Sassalla, Steffen","first_name":"Steffen"},{"first_name":"Krishna","last_name":"Narasimhan","full_name":"Narasimhan, Krishna"},{"full_name":"Bodden, Eric","id":"59256","orcid":"0000-0003-3470-3647","last_name":"Bodden","first_name":"Eric"}],"date_created":"2022-05-09T13:04:10Z","date_updated":"2022-07-26T11:42:30Z","citation":{"ama":"Schlichtig M, Sassalla S, Narasimhan K, Bodden E. FUM - A Framework for API Usage constraint and Misuse Classification. In: <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>. ; 2022:673-684. doi:<a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>","ieee":"M. Schlichtig, S. Sassalla, K. Narasimhan, and E. Bodden, “FUM - A Framework for API Usage constraint and Misuse Classification,” in <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2022, pp. 673–684, doi: <a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>.","chicago":"Schlichtig, Michael, Steffen Sassalla, Krishna Narasimhan, and Eric Bodden. “FUM - A Framework for API Usage Constraint and Misuse Classification.” In <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 673–84, 2022. <a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>.","short":"M. Schlichtig, S. Sassalla, K. Narasimhan, E. Bodden, in: 2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER), 2022, pp. 673–684.","bibtex":"@inproceedings{Schlichtig_Sassalla_Narasimhan_Bodden_2022, title={FUM - A Framework for API Usage constraint and Misuse Classification}, DOI={<a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>}, booktitle={2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}, author={Schlichtig, Michael and Sassalla, Steffen and Narasimhan, Krishna and Bodden, Eric}, year={2022}, pages={673–684} }","mla":"Schlichtig, Michael, et al. “FUM - A Framework for API Usage Constraint and Misuse Classification.” <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 2022, pp. 673–84, doi:<a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>.","apa":"Schlichtig, M., Sassalla, S., Narasimhan, K., &#38; Bodden, E. (2022). FUM - A Framework for API Usage constraint and Misuse Classification. <i>2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)</i>, 673–684. <a href=\"https://doi.org/10.1109/SANER53432.2022.00085\">https://doi.org/10.1109/SANER53432.2022.00085</a>"},"page":"673 - 684","year":"2022","related_material":{"link":[{"relation":"confirmation","url":"https://ieeexplore.ieee.org/document/9825763"}]},"quality_controlled":"1"},{"year":"2022","citation":{"chicago":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>, 2022.","ieee":"E. Vahle, <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022.","ama":"Vahle E. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>.; 2022.","bibtex":"@book{Vahle_2022, title={Modelling and Proving Security for a Secure MPC Protocol for Stable Matching}, author={Vahle, Ella}, year={2022} }","mla":"Vahle, Ella. <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>. 2022.","short":"E. Vahle, Modelling and Proving Security for a Secure MPC Protocol for Stable Matching, 2022.","apa":"Vahle, E. (2022). <i>Modelling and Proving Security for a Secure MPC Protocol for Stable Matching</i>."},"date_updated":"2022-07-26T14:31:54Z","author":[{"first_name":"Ella","full_name":"Vahle, Ella","last_name":"Vahle"}],"supervisor":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2022-07-20T09:38:39Z","title":"Modelling and Proving Security for a Secure MPC Protocol for Stable Matching","type":"bachelorsthesis","status":"public","_id":"32399","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"}],"department":[{"_id":"64"}],"user_id":"25078","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["9781450391467"]},"citation":{"ieee":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “The k-Server with Preferences Problem,” in <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2022, pp. 345–356, doi: <a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","chicago":"Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “The K-Server with Preferences Problem.” In <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–56. Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>.","ama":"Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The k-Server with Preferences Problem. In: <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>. Association for Computing Machinery; 2022:345-356. doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>","apa":"Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., &#38; Meyer auf der Heide, F. (2022). The k-Server with Preferences Problem. <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, 345–356. <a href=\"https://doi.org/10.1145/3490148.3538595\">https://doi.org/10.1145/3490148.3538595</a>","mla":"Castenow, Jannik, et al. “The K-Server with Preferences Problem.” <i>Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures</i>, Association for Computing Machinery, 2022, pp. 345–56, doi:<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>.","short":"J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2022, pp. 345–356.","bibtex":"@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2022, title={The k-Server with Preferences Problem}, DOI={<a href=\"https://doi.org/10.1145/3490148.3538595\">10.1145/3490148.3538595</a>}, booktitle={Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}, publisher={Association for Computing Machinery}, author={Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2022}, pages={345–356} }"},"page":"345-356","author":[{"first_name":"Jannik","last_name":"Castenow","full_name":"Castenow, Jannik","id":"38705"},{"first_name":"Björn","id":"22704","full_name":"Feldkord, Björn","last_name":"Feldkord"},{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","id":"39241","full_name":"Knollmann, Till","first_name":"Till"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel","id":"41265"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"date_updated":"2022-08-02T08:07:30Z","doi":"10.1145/3490148.3538595","type":"conference","status":"public","user_id":"39241","department":[{"_id":"63"}],"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"}],"_id":"31847","year":"2022","date_created":"2022-06-10T09:06:42Z","publisher":"Association for Computing Machinery","title":"The k-Server with Preferences Problem","publication":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","abstract":[{"lang":"eng","text":"The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).\r\n\r\nIn our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.\r\n\r\nWe study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.\r\n    \r\nThe two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously."}],"external_id":{"arxiv":["2205.11102"]},"language":[{"iso":"eng"}],"keyword":["K-Server Problem","Heterogeneity","Online Caching"]},{"doi":"10.1007/978-3-031-20706-8_16","date_updated":"2022-11-07T10:54:30Z","volume":463,"author":[{"first_name":"Jonas","last_name":"Kirchhoff","full_name":"Kirchhoff, Jonas","id":"39928"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"place":"Cham","intvolume":"       463","page":"227--243","citation":{"ama":"Kirchhoff J, Engels G. Anti-pattern Detection in Process-Driven Decision Support Systems. In: <i>Software Business</i>. Vol 463. Lecture Notes in Business Information Processing. Springer International Publishing; 2022:227--243. doi:<a href=\"https://doi.org/10.1007/978-3-031-20706-8_16\">10.1007/978-3-031-20706-8_16</a>","chicago":"Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven Decision Support Systems.” In <i>Software Business</i>, 463:227--243. Lecture Notes in Business Information Processing. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-20706-8_16\">https://doi.org/10.1007/978-3-031-20706-8_16</a>.","ieee":"J. Kirchhoff and G. Engels, “Anti-pattern Detection in Process-Driven Decision Support Systems,” in <i>Software Business</i>, vol. 463, Cham: Springer International Publishing, 2022, pp. 227--243.","apa":"Kirchhoff, J., &#38; Engels, G. (2022). Anti-pattern Detection in Process-Driven Decision Support Systems. In <i>Software Business</i> (Vol. 463, pp. 227--243). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-20706-8_16\">https://doi.org/10.1007/978-3-031-20706-8_16</a>","bibtex":"@inbook{Kirchhoff_Engels_2022, place={Cham}, series={Lecture Notes in Business Information Processing}, title={Anti-pattern Detection in Process-Driven Decision Support Systems}, volume={463}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-20706-8_16\">10.1007/978-3-031-20706-8_16</a>}, booktitle={Software Business}, publisher={Springer International Publishing}, author={Kirchhoff, Jonas and Engels, Gregor}, year={2022}, pages={227--243}, collection={Lecture Notes in Business Information Processing} }","mla":"Kirchhoff, Jonas, and Gregor Engels. “Anti-Pattern Detection in Process-Driven Decision Support Systems.” <i>Software Business</i>, vol. 463, Springer International Publishing, 2022, pp. 227--243, doi:<a href=\"https://doi.org/10.1007/978-3-031-20706-8_16\">10.1007/978-3-031-20706-8_16</a>.","short":"J. Kirchhoff, G. Engels, in: Software Business, Springer International Publishing, Cham, 2022, pp. 227--243."},"publication_identifier":{"issn":["1865-1348","1865-1356"],"isbn":["9783031207051","9783031207068"]},"publication_status":"published","_id":"34023","department":[{"_id":"534"},{"_id":"66"}],"user_id":"39928","series_title":"Lecture Notes in Business Information Processing","status":"public","type":"book_chapter","title":"Anti-pattern Detection in Process-Driven Decision Support Systems","publisher":"Springer International Publishing","date_created":"2022-11-07T10:51:24Z","year":"2022","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Decision makers increasingly rely on decision support systems for optimal decision making. Recently, special attention has been paid to process-driven decision support systems (PD-DSS) in which a process model prescribes the invocation sequence of software-based decision support services and the data exchange between them. Thus, it is possible to quickly combine available decision support services as needed for optimally supporting the decision making process of an individual decision maker. However, process modelers may accidentally create a process model which is technically well-formed and executable, but contains functional and behavioral flaws such as redundant or missing services. These flaws may result in inefficient computations or invalid decision recommendations when the corresponding PD-DSS is utilized by a decision maker. In this paper, we therefore propose an approach to validate functionality and behavior of a process model representing a PD-DSS. Our approach is based on expressing flaws as anti-patterns for which the process model can be automatically checked via graph matching. We prototypically implemented our approach and demonstrate its applicability in the context of decision making for energy network planning."}],"publication":"Software Business"},{"editor":[{"last_name":"De Raedt","full_name":"De Raedt, Luc","first_name":"Luc"}],"abstract":[{"text":"<jats:p>Consider the practical goal of making a desired action profile played,\r\n\r\nwhen the planner can only change the payoffs, bound by \r\n\r\nstringent constraints.\r\n\r\nApplications include motivating people\r\n\r\nto choose the closest school, the closest subway station, or to coordinate\r\n\r\non a communication protocol or an investment strategy.\r\n\r\nEmploying subsidies and tolls, we adjust the game so that choosing this predefined action profile\r\n\r\nbecomes strictly dominant. \r\n\r\nInspired mainly by the work of Monderer and Tennenholtz,\r\n\r\nwhere the promised subsidies do not materialise in the not played\r\n\r\nprofiles, we provide a fair and individually rational game\r\n\r\nadjustment, such that the total outside investments sum up\r\n\r\nto zero at any profile, thereby facilitating easy and frequent\r\n\r\nusage of our adjustment without bearing costs, even if some\r\n\r\nplayers behave unexpectedly. The resultant action profile itself needs no\r\n\r\nadjustment. Importantly, we also prove that our adjustment minimises \r\n\r\nthe general transfer among all such adjustments, counting the total subsidising and taxation.</jats:p>","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","keyword":["adjustment","strictly dominant","fairness","individually rational","transfer","tax","subsidy"],"language":[{"iso":"eng"}],"_id":"34040","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"year":"2022","citation":{"apa":"Polevoy, G., &#38; Dziubiński, M. (2022). Fair, Individually Rational and Cheap Adjustment. In L. De Raedt (Ed.), <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>","short":"G. Polevoy, M. Dziubiński, in: L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2022.","mla":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt, International Joint Conferences on Artificial Intelligence Organization, 2022, doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>.","bibtex":"@inproceedings{Polevoy_Dziubiński_2022, title={Fair, Individually Rational and Cheap Adjustment}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>}, booktitle={Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Polevoy, Gleb and Dziubiński, Marcin}, editor={De Raedt, Luc}, year={2022} }","ama":"Polevoy G, Dziubiński M. Fair, Individually Rational and Cheap Adjustment. In: De Raedt L, ed. <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2022. doi:<a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>","ieee":"G. Polevoy and M. Dziubiński, “Fair, Individually Rational and Cheap Adjustment,” in <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, Vienna, 2022, doi: <a href=\"https://doi.org/10.24963/ijcai.2022/64\">10.24963/ijcai.2022/64</a>.","chicago":"Polevoy, Gleb, and Marcin Dziubiński. “Fair, Individually Rational and Cheap Adjustment.” In <i>Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence</i>, edited by Luc De Raedt. International Joint Conferences on Artificial Intelligence Organization, 2022. <a href=\"https://doi.org/10.24963/ijcai.2022/64\">https://doi.org/10.24963/ijcai.2022/64</a>."},"publication_status":"published","title":"Fair, Individually Rational and Cheap Adjustment","main_file_link":[{"url":"https://www.ijcai.org/proceedings/2022/64"}],"doi":"10.24963/ijcai.2022/64","conference":{"end_date":"2022-07-29","location":"Vienna","name":"THE 31ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE","start_date":"2022-07-23"},"date_updated":"2022-11-08T17:34:36Z","publisher":"International Joint Conferences on Artificial Intelligence Organization","date_created":"2022-11-08T16:53:31Z","author":[{"full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy","first_name":"Gleb"},{"first_name":"Marcin","full_name":"Dziubiński, Marcin","last_name":"Dziubiński"}]},{"year":"2022","page":"28:1–28:15","intvolume":"       219","citation":{"apa":"Epstein, L., Lassota, A., Levin, A., Maack, M., &#38; Rohwedder, L. (2022). Cardinality Constrained Scheduling in Online Models. In P. Berenbrink &#38; B. Monmege (Eds.), <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i> (Vol. 219, p. 28:1–28:15). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>","bibtex":"@inproceedings{Epstein_Lassota_Levin_Maack_Rohwedder_2022, series={LIPIcs}, title={Cardinality Constrained Scheduling in Online Models}, volume={219}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>}, booktitle={39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}, editor={Berenbrink, Petra and Monmege, Benjamin}, year={2022}, pages={28:1–28:15}, collection={LIPIcs} }","short":"L. Epstein, A. Lassota, A. Levin, M. Maack, L. Rohwedder, in: P. Berenbrink, B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15.","mla":"Epstein, Leah, et al. “Cardinality Constrained Scheduling in Online Models.” <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, vol. 219, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 28:1–28:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","ama":"Epstein L, Lassota A, Levin A, Maack M, Rohwedder L. Cardinality Constrained Scheduling in Online Models. In: Berenbrink P, Monmege B, eds. <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>. Vol 219. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:28:1–28:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>","ieee":"L. Epstein, A. Lassota, A. Levin, M. Maack, and L. Rohwedder, “Cardinality Constrained Scheduling in Online Models,” in <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, 2022, vol. 219, p. 28:1–28:15, doi: <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">10.4230/LIPIcs.STACS.2022.28</a>.","chicago":"Epstein, Leah, Alexandra Lassota, Asaf Levin, Marten Maack, and Lars Rohwedder. “Cardinality Constrained Scheduling in Online Models.” In <i>39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)</i>, edited by Petra Berenbrink and Benjamin Monmege, 219:28:1–28:15. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2022.28\">https://doi.org/10.4230/LIPIcs.STACS.2022.28</a>."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_updated":"2022-11-08T16:34:32Z","volume":219,"date_created":"2022-08-23T08:10:36Z","author":[{"first_name":"Leah","last_name":"Epstein","full_name":"Epstein, Leah"},{"first_name":"Alexandra","full_name":"Lassota, Alexandra","last_name":"Lassota"},{"first_name":"Asaf","last_name":"Levin","full_name":"Levin, Asaf"},{"first_name":"Marten","full_name":"Maack, Marten","id":"88252","last_name":"Maack"},{"first_name":"Lars","last_name":"Rohwedder","full_name":"Rohwedder, Lars"}],"title":"Cardinality Constrained Scheduling in Online Models","doi":"10.4230/LIPIcs.STACS.2022.28","publication":"39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)","type":"conference","editor":[{"last_name":"Berenbrink","full_name":"Berenbrink, Petra","first_name":"Petra"},{"last_name":"Monmege","full_name":"Monmege, Benjamin","first_name":"Benjamin"}],"status":"public","_id":"33085","project":[{"_id":"16","name":"SFB 901 - C4: SFB 901 - Subproject C4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"series_title":"LIPIcs","user_id":"88252","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"33004","user_id":"82920","department":[{"_id":"600"}],"status":"public","type":"conference","publication":"Proceedings of the 29th International Conference on Computational Linguistics","title":"\"Mama Always Had a Way of Explaining Things So I Could Understand\": A Dialogue Corpus for Learning How to Explain","date_updated":"2022-11-10T09:06:39Z","author":[{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"full_name":"Alshomary, Milad","id":"73059","last_name":"Alshomary","first_name":"Milad"}],"date_created":"2022-08-18T10:00:46Z","year":"2022","citation":{"ama":"Wachsmuth H, Alshomary M. “Mama Always Had a Way of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain. In: <i>Proceedings of the 29th International Conference on Computational Linguistics</i>. ; 2022:344-354.","chicago":"Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.” In <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 344–54, 2022.","ieee":"H. Wachsmuth and M. Alshomary, “‘Mama Always Had a Way of Explaining Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain,” in <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 2022, pp. 344–354.","apa":"Wachsmuth, H., &#38; Alshomary, M. (2022). “Mama Always Had a Way of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain. <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 344–354.","short":"H. Wachsmuth, M. Alshomary, in: Proceedings of the 29th International Conference on Computational Linguistics, 2022, pp. 344–354.","mla":"Wachsmuth, Henning, and Milad Alshomary. “‘Mama Always Had a Way of Explaining Things So I Could Understand’: A Dialogue Corpus for Learning How to Explain.” <i>Proceedings of the 29th International Conference on Computational Linguistics</i>, 2022, pp. 344–54.","bibtex":"@inproceedings{Wachsmuth_Alshomary_2022, title={“Mama Always Had a Way of Explaining Things So I Could Understand”: A Dialogue Corpus for Learning How to Explain}, booktitle={Proceedings of the 29th International Conference on Computational Linguistics}, author={Wachsmuth, Henning and Alshomary, Milad}, year={2022}, pages={344–354} }"},"page":"344 - 354"},{"title":"On the Role of Knowledge in  Computational Argumentation","date_created":"2022-11-10T08:39:38Z","author":[{"last_name":"Lauscher","full_name":"Lauscher, Anne","first_name":"Anne"},{"first_name":"Henning","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","id":"3900"},{"first_name":"Iryna","full_name":"Gurevych, Iryna","last_name":"Gurevych"},{"first_name":"Goran","full_name":"Glavaš, Goran","last_name":"Glavaš"}],"date_updated":"2022-11-10T08:39:48Z","citation":{"apa":"Lauscher, A., Wachsmuth, H., Gurevych, I., &#38; Glavaš, G. (2022). On the Role of Knowledge in  Computational Argumentation. <i>Transactions of the Association for Computational Linguistics</i>.","mla":"Lauscher, Anne, et al. “On the Role of Knowledge in  Computational Argumentation.” <i>Transactions of the Association for Computational Linguistics</i>, 2022.","short":"A. Lauscher, H. Wachsmuth, I. Gurevych, G. Glavaš, Transactions of the Association for Computational Linguistics (2022).","bibtex":"@article{Lauscher_Wachsmuth_Gurevych_Glavaš_2022, title={On the Role of Knowledge in  Computational Argumentation}, journal={Transactions of the Association for Computational Linguistics}, author={Lauscher, Anne and Wachsmuth, Henning and Gurevych, Iryna and Glavaš, Goran}, year={2022} }","ieee":"A. Lauscher, H. Wachsmuth, I. Gurevych, and G. Glavaš, “On the Role of Knowledge in  Computational Argumentation,” <i>Transactions of the Association for Computational Linguistics</i>, 2022.","chicago":"Lauscher, Anne, Henning Wachsmuth, Iryna Gurevych, and Goran Glavaš. “On the Role of Knowledge in  Computational Argumentation.” <i>Transactions of the Association for Computational Linguistics</i>, 2022.","ama":"Lauscher A, Wachsmuth H, Gurevych I, Glavaš G. On the Role of Knowledge in  Computational Argumentation. <i>Transactions of the Association for Computational Linguistics</i>. Published online 2022."},"year":"2022","language":[{"iso":"eng"}],"user_id":"82920","department":[{"_id":"600"}],"_id":"34049","status":"public","type":"journal_article","publication":"Transactions of the Association for Computational Linguistics"},{"title":"Identifying the Human Values behind Arguments","author":[{"first_name":"Johannes","full_name":"Kiesel, Johannes","last_name":"Kiesel"},{"id":"73059","full_name":"Alshomary, Milad","last_name":"Alshomary","first_name":"Milad"},{"first_name":"Nicolas","last_name":"Handke","full_name":"Handke, Nicolas"},{"full_name":"Cai, Xiaoni","last_name":"Cai","first_name":"Xiaoni"},{"first_name":"Henning","id":"3900","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"}],"date_created":"2021-05-11T23:15:42Z","date_updated":"2022-11-10T09:09:27Z","citation":{"mla":"Kiesel, Johannes, et al. “Identifying the Human Values behind Arguments.” <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 2022, pp. 4459–71.","short":"J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, B. Stein, in: Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics, 2022, pp. 4459–4471.","bibtex":"@inproceedings{Kiesel_Alshomary_Handke_Cai_Wachsmuth_Stein_2022, title={Identifying the Human Values behind Arguments}, booktitle={Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics}, author={Kiesel, Johannes and Alshomary, Milad and Handke, Nicolas and Cai, Xiaoni and Wachsmuth, Henning and Stein, Benno}, year={2022}, pages={4459–4471} }","apa":"Kiesel, J., Alshomary, M., Handke, N., Cai, X., Wachsmuth, H., &#38; Stein, B. (2022). Identifying the Human Values behind Arguments. <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 4459–4471.","chicago":"Kiesel, Johannes, Milad Alshomary, Nicolas Handke, Xiaoni Cai, Henning Wachsmuth, and Benno Stein. “Identifying the Human Values behind Arguments.” In <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 4459–71, 2022.","ieee":"J. Kiesel, M. Alshomary, N. Handke, X. Cai, H. Wachsmuth, and B. Stein, “Identifying the Human Values behind Arguments,” in <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>, 2022, pp. 4459–4471.","ama":"Kiesel J, Alshomary M, Handke N, Cai X, Wachsmuth H, Stein B. Identifying the Human Values behind Arguments. In: <i>Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics</i>. ; 2022:4459-4471."},"page":"4459 - 4471","year":"2022","language":[{"iso":"eng"}],"user_id":"82920","department":[{"_id":"600"}],"_id":"22157","status":"public","type":"conference","publication":"Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics"},{"_id":"34057","department":[{"_id":"241"},{"_id":"76"}],"user_id":"49576","status":"public","publication":"2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)","type":"conference","title":"Domain-specific Language for Condition Monitoring Software Development","doi":"10.1109/etfa52439.2022.9921730","date_updated":"2022-11-10T14:30:42Z","publisher":"IEEE","author":[{"full_name":"Pasic, Faruk","last_name":"Pasic","first_name":"Faruk"},{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"}],"date_created":"2022-11-10T14:30:16Z","year":"2022","citation":{"ama":"Pasic F, Becker M. Domain-specific Language for Condition Monitoring Software Development. In: <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>","chicago":"Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition Monitoring Software Development.” In <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">https://doi.org/10.1109/etfa52439.2022.9921730</a>.","ieee":"F. Pasic and M. Becker, “Domain-specific Language for Condition Monitoring Software Development,” 2022, doi: <a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>.","bibtex":"@inproceedings{Pasic_Becker_2022, title={Domain-specific Language for Condition Monitoring Software Development}, DOI={<a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>}, booktitle={2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)}, publisher={IEEE}, author={Pasic, Faruk and Becker, Matthias}, year={2022} }","mla":"Pasic, Faruk, and Matthias Becker. “Domain-Specific Language for Condition Monitoring Software Development.” <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">10.1109/etfa52439.2022.9921730</a>.","short":"F. Pasic, M. Becker, in: 2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA), IEEE, 2022.","apa":"Pasic, F., &#38; Becker, M. (2022). Domain-specific Language for Condition Monitoring Software Development. <i>2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)</i>. <a href=\"https://doi.org/10.1109/etfa52439.2022.9921730\">https://doi.org/10.1109/etfa52439.2022.9921730</a>"},"publication_status":"published"}]