[{"date_created":"2023-07-03T11:36:55Z","publisher":"Oxford University Press (OUP)","title":"A parameterized view on the complexity of dependence and independence logic","issue":"8","year":"2022","language":[{"iso":"eng"}],"keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"publication":"Journal of Logic and Computation","abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>In this paper, we investigate the parameterized complexity of model checking for Dependence and Independence logic, which are well studied logics in the area of Team Semantics. We start with a list of nine immediate parameterizations for this problem, namely the number of disjunctions (i.e. splits)/(free) variables/universal quantifiers, formula-size, the tree-width of the Gaifman graph of the input structure, the size of the universe/team and the arity of dependence atoms. We present a comprehensive picture of the parameterized complexity of model checking and obtain a division of the problem into tractable and various intractable degrees. Furthermore, we also consider the complexity of the most important variants (data and expression complexity) of the model checking problem by fixing parts of the input.</jats:p>","lang":"eng"}],"author":[{"last_name":"Kontinen","full_name":"Kontinen, Juha","first_name":"Juha"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"first_name":"Yasir","last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir"}],"volume":32,"date_updated":"2024-06-04T16:06:37Z","doi":"10.1093/logcom/exac070","publication_status":"published","publication_identifier":{"issn":["0955-792X","1465-363X"]},"citation":{"bibtex":"@article{Kontinen_Meier_Mahmood_2022, title={A parameterized view on the complexity of dependence and independence logic}, volume={32}, DOI={<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>}, number={8}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022}, pages={1624–1644} }","short":"J. Kontinen, A. Meier, Y. Mahmood, Journal of Logic and Computation 32 (2022) 1624–1644.","mla":"Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, Oxford University Press (OUP), 2022, pp. 1624–44, doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>.","apa":"Kontinen, J., Meier, A., &#38; Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>, <i>32</i>(8), 1624–1644. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>","ama":"Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence and independence logic. <i>Journal of Logic and Computation</i>. 2022;32(8):1624-1644. doi:<a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>","ieee":"J. Kontinen, A. Meier, and Y. Mahmood, “A parameterized view on the complexity of dependence and independence logic,” <i>Journal of Logic and Computation</i>, vol. 32, no. 8, pp. 1624–1644, 2022, doi: <a href=\"https://doi.org/10.1093/logcom/exac070\">10.1093/logcom/exac070</a>.","chicago":"Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence and Independence Logic.” <i>Journal of Logic and Computation</i> 32, no. 8 (2022): 1624–44. <a href=\"https://doi.org/10.1093/logcom/exac070\">https://doi.org/10.1093/logcom/exac070</a>."},"intvolume":"        32","page":"1624-1644","user_id":"99353","_id":"45847","extern":"1","type":"journal_article","status":"public"},{"language":[{"iso":"eng"}],"extern":"1","_id":"45846","user_id":"99353","status":"public","type":"conference","publication":"Logical Foundations of Computer Science","title":"A Parameterized View on the Complexity of Dependence Logic","doi":"10.1007/978-3-030-93100-1_9","date_updated":"2024-06-04T16:06:49Z","publisher":"Springer International Publishing","author":[{"first_name":"Juha","last_name":"Kontinen","full_name":"Kontinen, Juha"},{"last_name":"Meier","full_name":"Meier, Arne","first_name":"Arne"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"}],"date_created":"2023-07-03T11:36:33Z","year":"2022","place":"Cham","citation":{"short":"J. Kontinen, A. Meier, Y. Mahmood, in: Logical Foundations of Computer Science, Springer International Publishing, Cham, 2022.","bibtex":"@inproceedings{Kontinen_Meier_Mahmood_2022, place={Cham}, title={A Parameterized View on the Complexity of Dependence Logic}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>}, booktitle={Logical Foundations of Computer Science}, publisher={Springer International Publishing}, author={Kontinen, Juha and Meier, Arne and Mahmood, Yasir}, year={2022} }","mla":"Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence Logic.” <i>Logical Foundations of Computer Science</i>, Springer International Publishing, 2022, doi:<a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>.","apa":"Kontinen, J., Meier, A., &#38; Mahmood, Y. (2022). A Parameterized View on the Complexity of Dependence Logic. <i>Logical Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">https://doi.org/10.1007/978-3-030-93100-1_9</a>","ama":"Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of Dependence Logic. In: <i>Logical Foundations of Computer Science</i>. Springer International Publishing; 2022. doi:<a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>","ieee":"J. Kontinen, A. Meier, and Y. Mahmood, “A Parameterized View on the Complexity of Dependence Logic,” 2022, doi: <a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">10.1007/978-3-030-93100-1_9</a>.","chicago":"Kontinen, Juha, Arne Meier, and Yasir Mahmood. “A Parameterized View on the Complexity of Dependence Logic.” In <i>Logical Foundations of Computer Science</i>. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-030-93100-1_9\">https://doi.org/10.1007/978-3-030-93100-1_9</a>."},"publication_status":"published","publication_identifier":{"isbn":["9783030930998","9783030931001"],"issn":["0302-9743","1611-3349"]}},{"publication":"Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022","type":"conference","status":"public","editor":[{"last_name":"Chiasson","full_name":"Chiasson, Sonia","first_name":"Sonia"},{"last_name":"Kapadia","full_name":"Kapadia, Apu","first_name":"Apu"}],"department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","_id":"47289","language":[{"iso":"eng"}],"extern":"1","page":"313–330","citation":{"chicago":"Huaman, Nicolas, Alexander Krause, Dominik Wermke, Jan H. Klemmer, Christian Stransky, Yasemin Acar, and Sascha Fahl. “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers.” In <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>, edited by Sonia Chiasson and Apu Kapadia, 313–330. USENIX Association, 2022.","ieee":"N. Huaman <i>et al.</i>, “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers,” in <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>, 2022, pp. 313–330.","short":"N. Huaman, A. Krause, D. Wermke, J.H. Klemmer, C. Stransky, Y. Acar, S. Fahl, in: S. Chiasson, A. Kapadia (Eds.), Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022, USENIX Association, 2022, pp. 313–330.","bibtex":"@inproceedings{Huaman_Krause_Wermke_Klemmer_Stransky_Acar_Fahl_2022, title={If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers}, booktitle={Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022}, publisher={USENIX Association}, author={Huaman, Nicolas and Krause, Alexander and Wermke, Dominik and Klemmer, Jan H. and Stransky, Christian and Acar, Yasemin and Fahl, Sascha}, editor={Chiasson, Sonia and Kapadia, Apu}, year={2022}, pages={313–330} }","mla":"Huaman, Nicolas, et al. “If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers.” <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>, edited by Sonia Chiasson and Apu Kapadia, USENIX Association, 2022, pp. 313–330.","ama":"Huaman N, Krause A, Wermke D, et al. If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers. In: Chiasson S, Kapadia A, eds. <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i>. USENIX Association; 2022:313–330.","apa":"Huaman, N., Krause, A., Wermke, D., Klemmer, J. H., Stransky, C., Acar, Y., &#38; Fahl, S. (2022). If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers. In S. Chiasson &#38; A. Kapadia (Eds.), <i>Eighteenth Symposium on Usable Privacy and Security, SOUPS 2022, Boston, MA, USA, August 7-9, 2022</i> (pp. 313–330). USENIX Association."},"year":"2022","date_created":"2023-09-22T13:21:22Z","author":[{"full_name":"Huaman, Nicolas","last_name":"Huaman","first_name":"Nicolas"},{"first_name":"Alexander","full_name":"Krause, Alexander","last_name":"Krause"},{"first_name":"Dominik","full_name":"Wermke, Dominik","last_name":"Wermke"},{"last_name":"Klemmer","full_name":"Klemmer, Jan H.","first_name":"Jan H."},{"full_name":"Stransky, Christian","last_name":"Stransky","first_name":"Christian"},{"first_name":"Yasemin","full_name":"Acar, Yasemin","id":"94636","last_name":"Acar"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"publisher":"USENIX Association","date_updated":"2024-06-05T12:52:28Z","title":"If You Can’t Get Them to the Lab: Evaluating a Virtual Study Environment with Security Information Workers"},{"publication":"2022 IEEE Symposium on Security and Privacy (SP)","type":"conference","status":"public","_id":"47844","department":[{"_id":"858"}],"user_id":"14931","language":[{"iso":"eng"}],"extern":"1","publication_status":"published","year":"2022","citation":{"short":"J. Jancar, M. Fourné, D.D.A. Braga, M. Sabt, P. Schwabe, G. Barthe, P.-A. Fouque, Y. Acar, in: 2022 IEEE Symposium on Security and Privacy (SP), IEEE, 2022.","bibtex":"@inproceedings{Jancar_Fourné_Braga_Sabt_Schwabe_Barthe_Fouque_Acar_2022, title={“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks}, DOI={<a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>}, booktitle={2022 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Jancar, Jan and Fourné, Marcel and Braga, Daniel De Almeida and Sabt, Mohamed and Schwabe, Peter and Barthe, Gilles and Fouque, Pierre-Alain and Acar, Yasemin}, year={2022} }","mla":"Jancar, Jan, et al. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” <i>2022 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>.","apa":"Jancar, J., Fourné, M., Braga, D. D. A., Sabt, M., Schwabe, P., Barthe, G., Fouque, P.-A., &#38; Acar, Y. (2022). “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">https://doi.org/10.1109/sp46214.2022.9833713</a>","ieee":"J. Jancar <i>et al.</i>, “‘They’re not that hard to mitigate’: What Cryptographic Library Developers Think About Timing Attacks,” 2022, doi: <a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>.","chicago":"Jancar, Jan, Marcel Fourné, Daniel De Almeida Braga, Mohamed Sabt, Peter Schwabe, Gilles Barthe, Pierre-Alain Fouque, and Yasemin Acar. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” In <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">https://doi.org/10.1109/sp46214.2022.9833713</a>.","ama":"Jancar J, Fourné M, Braga DDA, et al. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. In: <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833713\">10.1109/sp46214.2022.9833713</a>"},"publisher":"IEEE","date_updated":"2024-06-05T12:55:00Z","author":[{"last_name":"Jancar","full_name":"Jancar, Jan","first_name":"Jan"},{"last_name":"Fourné","full_name":"Fourné, Marcel","id":"99291","first_name":"Marcel"},{"first_name":"Daniel De Almeida","last_name":"Braga","full_name":"Braga, Daniel De Almeida"},{"first_name":"Mohamed","last_name":"Sabt","full_name":"Sabt, Mohamed"},{"last_name":"Schwabe","full_name":"Schwabe, Peter","first_name":"Peter"},{"last_name":"Barthe","full_name":"Barthe, Gilles","first_name":"Gilles"},{"first_name":"Pierre-Alain","last_name":"Fouque","full_name":"Fouque, Pierre-Alain"},{"last_name":"Acar","id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin"}],"date_created":"2023-10-06T16:12:30Z","title":"“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks","doi":"10.1109/sp46214.2022.9833713"},{"publisher":"IEEE","date_updated":"2024-06-05T12:53:00Z","date_created":"2023-09-22T13:18:54Z","author":[{"full_name":"Gutfleisch, Marco","last_name":"Gutfleisch","first_name":"Marco"},{"first_name":"Jan H.","last_name":"Klemmer","full_name":"Klemmer, Jan H."},{"first_name":"Niklas","full_name":"Busch, Niklas","last_name":"Busch"},{"first_name":"Yasemin","id":"94636","full_name":"Acar, Yasemin","last_name":"Acar"},{"last_name":"Sasse","full_name":"Sasse, M. Angela","first_name":"M. Angela"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"}],"title":"How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study","doi":"10.1109/SP46214.2022.9833756","year":"2022","citation":{"short":"M. Gutfleisch, J.H. Klemmer, N. Busch, Y. Acar, M.A. Sasse, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 893–910.","mla":"Gutfleisch, Marco, et al. “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 893–910, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>.","bibtex":"@inproceedings{Gutfleisch_Klemmer_Busch_Acar_Sasse_Fahl_2022, title={How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Gutfleisch, Marco and Klemmer, Jan H. and Busch, Niklas and Acar, Yasemin and Sasse, M. Angela and Fahl, Sascha}, year={2022}, pages={893–910} }","apa":"Gutfleisch, M., Klemmer, J. H., Busch, N., Acar, Y., Sasse, M. A., &#38; Fahl, S. (2022). How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 893–910. <a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">https://doi.org/10.1109/SP46214.2022.9833756</a>","ama":"Gutfleisch M, Klemmer JH, Busch N, Acar Y, Sasse MA, Fahl S. How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:893–910. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>","chicago":"Gutfleisch, Marco, Jan H. Klemmer, Niklas Busch, Yasemin Acar, M. Angela Sasse, and Sascha Fahl. “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 893–910. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">https://doi.org/10.1109/SP46214.2022.9833756</a>.","ieee":"M. Gutfleisch, J. H. Klemmer, N. Busch, Y. Acar, M. A. Sasse, and S. Fahl, “How Does Usable Security (Not) End Up in Software Products? Results From a Qualitative Interview Study,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 893–910, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833756\">10.1109/SP46214.2022.9833756</a>."},"page":"893–910","_id":"47286","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"extern":"1","language":[{"iso":"eng"}],"type":"conference","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","status":"public"},{"_id":"47287","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"extern":"1","language":[{"iso":"eng"}],"type":"conference","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","status":"public","date_updated":"2024-06-05T12:53:20Z","publisher":"IEEE","author":[{"last_name":"Stransky","full_name":"Stransky, Christian","first_name":"Christian"},{"first_name":"Oliver","last_name":"Wiese","full_name":"Wiese, Oliver"},{"full_name":"Roth, Volker","last_name":"Roth","first_name":"Volker"},{"full_name":"Acar, Yasemin","id":"94636","last_name":"Acar","first_name":"Yasemin"},{"first_name":"Sascha","last_name":"Fahl","full_name":"Fahl, Sascha"}],"date_created":"2023-09-22T13:19:56Z","title":"27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University","doi":"10.1109/SP46214.2022.9833755","year":"2022","citation":{"ama":"Stransky C, Wiese O, Roth V, Acar Y, Fahl S. 27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:860–875. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>","chicago":"Stransky, Christian, Oliver Wiese, Volker Roth, Yasemin Acar, and Sascha Fahl. “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 860–875. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">https://doi.org/10.1109/SP46214.2022.9833755</a>.","ieee":"C. Stransky, O. Wiese, V. Roth, Y. Acar, and S. Fahl, “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 860–875, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>.","apa":"Stransky, C., Wiese, O., Roth, V., Acar, Y., &#38; Fahl, S. (2022). 27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 860–875. <a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">https://doi.org/10.1109/SP46214.2022.9833755</a>","bibtex":"@inproceedings{Stransky_Wiese_Roth_Acar_Fahl_2022, title={27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Stransky, Christian and Wiese, Oliver and Roth, Volker and Acar, Yasemin and Fahl, Sascha}, year={2022}, pages={860–875} }","short":"C. Stransky, O. Wiese, V. Roth, Y. Acar, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 860–875.","mla":"Stransky, Christian, et al. “27 Years and 81 Million Opportunities Later: Investigating the Use of Email Encryption for an Entire University.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 860–875, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833755\">10.1109/SP46214.2022.9833755</a>."},"page":"860–875"},{"editor":[{"first_name":"Kevin R. B.","full_name":"Butler, Kevin R. B.","last_name":"Butler"},{"last_name":"Thomas","full_name":"Thomas, Kurt","first_name":"Kurt"}],"status":"public","publication":"31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022","type":"conference","language":[{"iso":"eng"}],"extern":"1","_id":"47283","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","year":"2022","page":"4041–4058","citation":{"chicago":"Kaur, Harjot, Sabrina Amft, Daniel Votipka, Yasemin Acar, and Sascha Fahl. “Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples.” In <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>, edited by Kevin R. B. Butler and Kurt Thomas, 4041–4058. USENIX Association, 2022.","ieee":"H. Kaur, S. Amft, D. Votipka, Y. Acar, and S. Fahl, “Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples,” in <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>, 2022, pp. 4041–4058.","apa":"Kaur, H., Amft, S., Votipka, D., Acar, Y., &#38; Fahl, S. (2022). Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples. In K. R. B. Butler &#38; K. Thomas (Eds.), <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i> (pp. 4041–4058). USENIX Association.","ama":"Kaur H, Amft S, Votipka D, Acar Y, Fahl S. Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples. In: Butler KRB, Thomas K, eds. <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>. USENIX Association; 2022:4041–4058.","short":"H. Kaur, S. Amft, D. Votipka, Y. Acar, S. Fahl, in: K.R.B. Butler, K. Thomas (Eds.), 31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022, USENIX Association, 2022, pp. 4041–4058.","bibtex":"@inproceedings{Kaur_Amft_Votipka_Acar_Fahl_2022, title={Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples}, booktitle={31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022}, publisher={USENIX Association}, author={Kaur, Harjot and Amft, Sabrina and Votipka, Daniel and Acar, Yasemin and Fahl, Sascha}, editor={Butler, Kevin R. B. and Thomas, Kurt}, year={2022}, pages={4041–4058} }","mla":"Kaur, Harjot, et al. “Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples.” <i>31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022</i>, edited by Kevin R. B. Butler and Kurt Thomas, USENIX Association, 2022, pp. 4041–4058."},"title":"Where to Recruit for Security Development Studies: Comparing Six Software Developer Samples","publisher":"USENIX Association","date_updated":"2024-06-05T12:53:43Z","date_created":"2023-09-22T13:17:23Z","author":[{"first_name":"Harjot","full_name":"Kaur, Harjot","last_name":"Kaur"},{"last_name":"Amft","full_name":"Amft, Sabrina","first_name":"Sabrina"},{"last_name":"Votipka","full_name":"Votipka, Daniel","first_name":"Daniel"},{"first_name":"Yasemin","last_name":"Acar","full_name":"Acar, Yasemin","id":"94636"},{"first_name":"Sascha","full_name":"Fahl, Sascha","last_name":"Fahl"}]},{"title":"They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web","doi":"10.1109/MSEC.2021.3123795","date_updated":"2024-06-05T12:54:05Z","author":[{"full_name":"Huaman, Nicolas","last_name":"Huaman","first_name":"Nicolas"},{"first_name":"Sabrina","last_name":"Amft","full_name":"Amft, Sabrina"},{"last_name":"Oltrogge","full_name":"Oltrogge, Marten","first_name":"Marten"},{"last_name":"Acar","id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"}],"date_created":"2023-09-22T13:22:05Z","volume":20,"year":"2022","citation":{"apa":"Huaman, N., Amft, S., Oltrogge, M., Acar, Y., &#38; Fahl, S. (2022). They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web. <i>IEEE Secur. Priv.</i>, <i>20</i>(2), 49–60. <a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">https://doi.org/10.1109/MSEC.2021.3123795</a>","short":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, S. Fahl, IEEE Secur. Priv. 20 (2022) 49–60.","bibtex":"@article{Huaman_Amft_Oltrogge_Acar_Fahl_2022, title={They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web}, volume={20}, DOI={<a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>}, number={2}, journal={IEEE Secur. Priv.}, author={Huaman, Nicolas and Amft, Sabrina and Oltrogge, Marten and Acar, Yasemin and Fahl, Sascha}, year={2022}, pages={49–60} }","mla":"Huaman, Nicolas, et al. “They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web.” <i>IEEE Secur. Priv.</i>, vol. 20, no. 2, 2022, pp. 49–60, doi:<a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>.","chicago":"Huaman, Nicolas, Sabrina Amft, Marten Oltrogge, Yasemin Acar, and Sascha Fahl. “They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web.” <i>IEEE Secur. Priv.</i> 20, no. 2 (2022): 49–60. <a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">https://doi.org/10.1109/MSEC.2021.3123795</a>.","ieee":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, and S. Fahl, “They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web,” <i>IEEE Secur. Priv.</i>, vol. 20, no. 2, pp. 49–60, 2022, doi: <a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>.","ama":"Huaman N, Amft S, Oltrogge M, Acar Y, Fahl S. They Would Do Better If They Worked Together: Interaction Problems Between Password Managers and the Web. <i>IEEE Secur Priv</i>. 2022;20(2):49–60. doi:<a href=\"https://doi.org/10.1109/MSEC.2021.3123795\">10.1109/MSEC.2021.3123795</a>"},"intvolume":"        20","page":"49–60","issue":"2","extern":"1","language":[{"iso":"eng"}],"_id":"47290","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"status":"public","type":"journal_article","publication":"IEEE Secur. Priv."},{"doi":"10.1109/sp46214.2022.9833686","title":"Committed to Trust: A Qualitative Study on Security &amp; Trust in Open Source Software Projects","date_created":"2023-10-06T16:12:18Z","author":[{"first_name":"Dominik","last_name":"Wermke","full_name":"Wermke, Dominik"},{"first_name":"Noah","last_name":"Wohler","full_name":"Wohler, Noah"},{"first_name":"Jan H.","full_name":"Klemmer, Jan H.","last_name":"Klemmer"},{"first_name":"Marcel","full_name":"Fourné, Marcel","id":"99291","last_name":"Fourné"},{"first_name":"Yasemin","full_name":"Acar, Yasemin","id":"94636","last_name":"Acar"},{"first_name":"Sascha","full_name":"Fahl, Sascha","last_name":"Fahl"}],"publisher":"IEEE","date_updated":"2024-06-05T12:55:32Z","citation":{"apa":"Wermke, D., Wohler, N., Klemmer, J. H., Fourné, M., Acar, Y., &#38; Fahl, S. (2022). Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects. <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">https://doi.org/10.1109/sp46214.2022.9833686</a>","ama":"Wermke D, Wohler N, Klemmer JH, Fourné M, Acar Y, Fahl S. Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects. In: <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2022. doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>","bibtex":"@inproceedings{Wermke_Wohler_Klemmer_Fourné_Acar_Fahl_2022, title={Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects}, DOI={<a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>}, booktitle={2022 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Wermke, Dominik and Wohler, Noah and Klemmer, Jan H. and Fourné, Marcel and Acar, Yasemin and Fahl, Sascha}, year={2022} }","short":"D. Wermke, N. Wohler, J.H. Klemmer, M. Fourné, Y. Acar, S. Fahl, in: 2022 IEEE Symposium on Security and Privacy (SP), IEEE, 2022.","mla":"Wermke, Dominik, et al. “Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects.” <i>2022 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2022, doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>.","chicago":"Wermke, Dominik, Noah Wohler, Jan H. Klemmer, Marcel Fourné, Yasemin Acar, and Sascha Fahl. “Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects.” In <i>2022 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">https://doi.org/10.1109/sp46214.2022.9833686</a>.","ieee":"D. Wermke, N. Wohler, J. H. Klemmer, M. Fourné, Y. Acar, and S. Fahl, “Committed to Trust: A Qualitative Study on Security &#38;amp; Trust in Open Source Software Projects,” 2022, doi: <a href=\"https://doi.org/10.1109/sp46214.2022.9833686\">10.1109/sp46214.2022.9833686</a>."},"year":"2022","publication_status":"published","language":[{"iso":"eng"}],"extern":"1","department":[{"_id":"858"}],"user_id":"14931","_id":"47843","status":"public","publication":"2022 IEEE Symposium on Security and Privacy (SP)","type":"conference"},{"status":"public","type":"conference","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","language":[{"iso":"eng"}],"extern":"1","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47288","citation":{"chicago":"Jancar, Jan, Marcel Fourné, Daniel De Almeida Braga, Mohamed Sabt, Peter Schwabe, Gilles Barthe, Pierre-Alain Fouque, and Yasemin Acar. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 632–649. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">https://doi.org/10.1109/SP46214.2022.9833713</a>.","ieee":"J. Jancar <i>et al.</i>, “‘They’re not that hard to mitigate’: What Cryptographic Library Developers Think About Timing Attacks,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 632–649, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>.","ama":"Jancar J, Fourné M, Braga DDA, et al. “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:632–649. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>","bibtex":"@inproceedings{Jancar_Fourné_Braga_Sabt_Schwabe_Barthe_Fouque_Acar_2022, title={“They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Jancar, Jan and Fourné, Marcel and Braga, Daniel De Almeida and Sabt, Mohamed and Schwabe, Peter and Barthe, Gilles and Fouque, Pierre-Alain and Acar, Yasemin}, year={2022}, pages={632–649} }","mla":"Jancar, Jan, et al. “‘They’re Not That Hard to Mitigate’: What Cryptographic Library Developers Think About Timing Attacks.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 632–649, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">10.1109/SP46214.2022.9833713</a>.","short":"J. Jancar, M. Fourné, D.D.A. Braga, M. Sabt, P. Schwabe, G. Barthe, P.-A. Fouque, Y. Acar, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 632–649.","apa":"Jancar, J., Fourné, M., Braga, D. D. A., Sabt, M., Schwabe, P., Barthe, G., Fouque, P.-A., &#38; Acar, Y. (2022). “They’re not that hard to mitigate”: What Cryptographic Library Developers Think About Timing Attacks. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 632–649. <a href=\"https://doi.org/10.1109/SP46214.2022.9833713\">https://doi.org/10.1109/SP46214.2022.9833713</a>"},"page":"632–649","year":"2022","doi":"10.1109/SP46214.2022.9833713","title":"\"They’re not that hard to mitigate\": What Cryptographic Library Developers Think About Timing Attacks","author":[{"full_name":"Jancar, Jan","last_name":"Jancar","first_name":"Jan"},{"first_name":"Marcel","last_name":"Fourné","full_name":"Fourné, Marcel"},{"first_name":"Daniel De Almeida","full_name":"Braga, Daniel De Almeida","last_name":"Braga"},{"last_name":"Sabt","full_name":"Sabt, Mohamed","first_name":"Mohamed"},{"last_name":"Schwabe","full_name":"Schwabe, Peter","first_name":"Peter"},{"first_name":"Gilles","full_name":"Barthe, Gilles","last_name":"Barthe"},{"first_name":"Pierre-Alain","full_name":"Fouque, Pierre-Alain","last_name":"Fouque"},{"first_name":"Yasemin","last_name":"Acar","id":"94636","full_name":"Acar, Yasemin"}],"date_created":"2023-09-22T13:20:28Z","date_updated":"2024-06-05T13:20:54Z","publisher":"IEEE"},{"doi":"10.1109/SP46214.2022.9833686","title":"Committed to Trust: A Qualitative Study on Security & Trust in Open Source Software Projects","author":[{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"first_name":"Noah","full_name":"Wöhler, Noah","last_name":"Wöhler"},{"first_name":"Jan H.","last_name":"Klemmer","full_name":"Klemmer, Jan H."},{"full_name":"Fourné, Marcel","last_name":"Fourné","first_name":"Marcel"},{"last_name":"Acar","full_name":"Acar, Yasemin","id":"94636","first_name":"Yasemin"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"date_created":"2023-09-22T13:18:27Z","date_updated":"2024-06-05T13:34:37Z","publisher":"IEEE","page":"1880–1896","citation":{"apa":"Wermke, D., Wöhler, N., Klemmer, J. H., Fourné, M., Acar, Y., &#38; Fahl, S. (2022). Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 1880–1896. <a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">https://doi.org/10.1109/SP46214.2022.9833686</a>","short":"D. Wermke, N. Wöhler, J.H. Klemmer, M. Fourné, Y. Acar, S. Fahl, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 1880–1896.","mla":"Wermke, Dominik, et al. “Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 1880–1896, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>.","bibtex":"@inproceedings{Wermke_Wöhler_Klemmer_Fourné_Acar_Fahl_2022, title={Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Wermke, Dominik and Wöhler, Noah and Klemmer, Jan H. and Fourné, Marcel and Acar, Yasemin and Fahl, Sascha}, year={2022}, pages={1880–1896} }","chicago":"Wermke, Dominik, Noah Wöhler, Jan H. Klemmer, Marcel Fourné, Yasemin Acar, and Sascha Fahl. “Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 1880–1896. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">https://doi.org/10.1109/SP46214.2022.9833686</a>.","ieee":"D. Wermke, N. Wöhler, J. H. Klemmer, M. Fourné, Y. Acar, and S. Fahl, “Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 1880–1896, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>.","ama":"Wermke D, Wöhler N, Klemmer JH, Fourné M, Acar Y, Fahl S. Committed to Trust: A Qualitative Study on Security &#38; Trust in Open Source Software Projects. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:1880–1896. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833686\">10.1109/SP46214.2022.9833686</a>"},"year":"2022","extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","_id":"47285","status":"public","publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","type":"conference"},{"author":[{"last_name":"Munyendo","full_name":"Munyendo, Collins W.","first_name":"Collins W."},{"first_name":"Yasemin","id":"94636","full_name":"Acar, Yasemin","last_name":"Acar"},{"last_name":"Aviv","full_name":"Aviv, Adam J.","first_name":"Adam J."}],"date_created":"2023-09-22T13:18:01Z","publisher":"IEEE","date_updated":"2024-06-05T13:34:58Z","doi":"10.1109/SP46214.2022.9833779","title":"\"Desperate Times Call for Desperate Measures\": User Concerns with Mobile Loan Apps in Kenya","page":"2304–2319","citation":{"apa":"Munyendo, C. W., Acar, Y., &#38; Aviv, A. J. (2022). “Desperate Times Call for Desperate Measures”: User Concerns with Mobile Loan Apps in Kenya. <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2304–2319. <a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">https://doi.org/10.1109/SP46214.2022.9833779</a>","short":"C.W. Munyendo, Y. Acar, A.J. Aviv, in: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, IEEE, 2022, pp. 2304–2319.","mla":"Munyendo, Collins W., et al. “‘Desperate Times Call for Desperate Measures’: User Concerns with Mobile Loan Apps in Kenya.” <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, IEEE, 2022, pp. 2304–2319, doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>.","bibtex":"@inproceedings{Munyendo_Acar_Aviv_2022, title={“Desperate Times Call for Desperate Measures”: User Concerns with Mobile Loan Apps in Kenya}, DOI={<a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>}, booktitle={43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022}, publisher={IEEE}, author={Munyendo, Collins W. and Acar, Yasemin and Aviv, Adam J.}, year={2022}, pages={2304–2319} }","ama":"Munyendo CW, Acar Y, Aviv AJ. “Desperate Times Call for Desperate Measures”: User Concerns with Mobile Loan Apps in Kenya. In: <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>. IEEE; 2022:2304–2319. doi:<a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>","ieee":"C. W. Munyendo, Y. Acar, and A. J. Aviv, “‘Desperate Times Call for Desperate Measures’: User Concerns with Mobile Loan Apps in Kenya,” in <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2022, pp. 2304–2319, doi: <a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">10.1109/SP46214.2022.9833779</a>.","chicago":"Munyendo, Collins W., Yasemin Acar, and Adam J. Aviv. “‘Desperate Times Call for Desperate Measures’: User Concerns with Mobile Loan Apps in Kenya.” In <i>43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022</i>, 2304–2319. IEEE, 2022. <a href=\"https://doi.org/10.1109/SP46214.2022.9833779\">https://doi.org/10.1109/SP46214.2022.9833779</a>."},"year":"2022","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","_id":"47284","extern":"1","language":[{"iso":"eng"}],"publication":"43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022","type":"conference","status":"public"},{"doi":"10.48550/arXiv.2211.06213","title":"Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories","author":[{"first_name":"Alexander","last_name":"Krause","full_name":"Krause, Alexander"},{"first_name":"Jan H.","last_name":"Klemmer","full_name":"Klemmer, Jan H."},{"first_name":"Nicolas","last_name":"Huaman","full_name":"Huaman, Nicolas"},{"first_name":"Dominik","full_name":"Wermke, Dominik","last_name":"Wermke"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"first_name":"Sascha","full_name":"Fahl, Sascha","last_name":"Fahl"}],"date_created":"2023-09-22T13:16:33Z","volume":"abs/2211.06213","date_updated":"2024-06-05T13:36:09Z","citation":{"ama":"Krause A, Klemmer JH, Huaman N, Wermke D, Acar Y, Fahl S. Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories. <i>CoRR</i>. 2022;abs/2211.06213. doi:<a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>","chicago":"Krause, Alexander, Jan H. Klemmer, Nicolas Huaman, Dominik Wermke, Yasemin Acar, and Sascha Fahl. “Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories.” <i>CoRR</i> abs/2211.06213 (2022). <a href=\"https://doi.org/10.48550/arXiv.2211.06213\">https://doi.org/10.48550/arXiv.2211.06213</a>.","ieee":"A. Krause, J. H. Klemmer, N. Huaman, D. Wermke, Y. Acar, and S. Fahl, “Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories,” <i>CoRR</i>, vol. abs/2211.06213, 2022, doi: <a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>.","apa":"Krause, A., Klemmer, J. H., Huaman, N., Wermke, D., Acar, Y., &#38; Fahl, S. (2022). Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories. <i>CoRR</i>, <i>abs/2211.06213</i>. <a href=\"https://doi.org/10.48550/arXiv.2211.06213\">https://doi.org/10.48550/arXiv.2211.06213</a>","mla":"Krause, Alexander, et al. “Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories.” <i>CoRR</i>, vol. abs/2211.06213, 2022, doi:<a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>.","short":"A. Krause, J.H. Klemmer, N. Huaman, D. Wermke, Y. Acar, S. Fahl, CoRR abs/2211.06213 (2022).","bibtex":"@article{Krause_Klemmer_Huaman_Wermke_Acar_Fahl_2022, title={Committed by Accident: Studying Prevention and Remediation Strategies Against Secret Leakage in Source Code Repositories}, volume={abs/2211.06213}, DOI={<a href=\"https://doi.org/10.48550/arXiv.2211.06213\">10.48550/arXiv.2211.06213</a>}, journal={CoRR}, author={Krause, Alexander and Klemmer, Jan H. and Huaman, Nicolas and Wermke, Dominik and Acar, Yasemin and Fahl, Sascha}, year={2022} }"},"year":"2022","extern":"1","language":[{"iso":"eng"}],"user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47281","status":"public","type":"journal_article","publication":"CoRR"},{"type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","status":"public","abstract":[{"lang":"eng","text":"Exploratory Landscape Analysis is a powerful technique for numerically characterizing landscapes of single-objective continuous optimization problems. Landscape insights are crucial both for problem understanding as well as for assessing benchmark set diversity and composition. Despite the irrefutable usefulness of these features, they suffer from their own ailments and downsides. Hence, in this work we provide a collection of different approaches to characterize optimization landscapes. Similar to conventional landscape features, we require a small initial sample. However, instead of computing features based on that sample, we develop alternative representations of the original sample. These range from point clouds to 2D images and, therefore, are entirely feature-free. We demonstrate and validate our devised methods on the BBOB testbed and predict, with the help of Deep Learning, the high-level, expert-based landscape properties such as the degree of multimodality and the existence of funnel structures. The quality of our approaches is on par with methods relying on the traditional landscape features. Thereby, we provide an exciting new perspective on every research area which utilizes problem information such as problem understanding and algorithm design as well as automated algorithm configuration and selection."}],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46307","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781450392372"]},"citation":{"ieee":"M. Seiler, R. P. Prager, P. Kerschke, and H. Trautmann, “A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2022, pp. 657–665, doi: <a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>.","chicago":"Seiler, Moritz, Raphael Patrick Prager, Pascal Kerschke, and Heike Trautmann. “A Collection of Deep Learning-Based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 657–665. New York, NY, USA: Association for Computing Machinery, 2022. <a href=\"https://doi.org/10.1145/3512290.3528834\">https://doi.org/10.1145/3512290.3528834</a>.","ama":"Seiler M, Prager RP, Kerschke P, Trautmann H. A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. Association for Computing Machinery; 2022:657–665. doi:<a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>","apa":"Seiler, M., Prager, R. P., Kerschke, P., &#38; Trautmann, H. (2022). A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 657–665. <a href=\"https://doi.org/10.1145/3512290.3528834\">https://doi.org/10.1145/3512290.3528834</a>","bibtex":"@inproceedings{Seiler_Prager_Kerschke_Trautmann_2022, place={New York, NY, USA}, title={A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes}, DOI={<a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Seiler, Moritz and Prager, Raphael Patrick and Kerschke, Pascal and Trautmann, Heike}, year={2022}, pages={657–665} }","short":"M. Seiler, R.P. Prager, P. Kerschke, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2022, pp. 657–665.","mla":"Seiler, Moritz, et al. “A Collection of Deep Learning-Based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2022, pp. 657–665, doi:<a href=\"https://doi.org/10.1145/3512290.3528834\">10.1145/3512290.3528834</a>."},"page":"657–665","year":"2022","place":"New York, NY, USA","author":[{"first_name":"Moritz","full_name":"Seiler, Moritz","id":"105520","last_name":"Seiler"},{"full_name":"Prager, Raphael Patrick","last_name":"Prager","first_name":"Raphael Patrick"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740","full_name":"Trautmann, Heike","first_name":"Heike"}],"date_created":"2023-08-04T07:15:59Z","date_updated":"2024-06-07T07:13:23Z","publisher":"Association for Computing Machinery","doi":"10.1145/3512290.3528834","title":"A Collection of Deep Learning-based Feature-Free Approaches for Characterizing Single-Objective Continuous Fitness Landscapes"},{"publication_identifier":{"isbn":["978-3-031-14714-2"]},"year":"2022","place":"Cham","citation":{"bibtex":"@inproceedings{Prager_Seiler_Trautmann_Kerschke_2022, place={Cham}, title={Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>}, booktitle={Parallel Problem Solving from Nature — PPSN XVII}, publisher={Springer International Publishing}, author={Prager, Raphael Patrick and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, editor={Rudolph, Günter and Kononova, Anna V. and Aguirre, Hernán and Kerschke, Pascal and Ochoa, Gabriela and Tušar, Tea}, year={2022}, pages={3–17} }","short":"R.P. Prager, M. Seiler, H. Trautmann, P. Kerschke, in: G. Rudolph, A.V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, T. Tušar (Eds.), Parallel Problem Solving from Nature — PPSN XVII, Springer International Publishing, Cham, 2022, pp. 3–17.","mla":"Prager, Raphael Patrick, et al. “Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods.” <i>Parallel Problem Solving from Nature — PPSN XVII</i>, edited by Günter Rudolph et al., Springer International Publishing, 2022, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>.","apa":"Prager, R. P., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2022). Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods. In G. Rudolph, A. V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, &#38; T. Tušar (Eds.), <i>Parallel Problem Solving from Nature — PPSN XVII</i> (pp. 3–17). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">https://doi.org/10.1007/978-3-031-14714-2_1</a>","chicago":"Prager, Raphael Patrick, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods.” In <i>Parallel Problem Solving from Nature — PPSN XVII</i>, edited by Günter Rudolph, Anna V. Kononova, Hernán Aguirre, Pascal Kerschke, Gabriela Ochoa, and Tea Tušar, 3–17. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">https://doi.org/10.1007/978-3-031-14714-2_1</a>.","ieee":"R. P. Prager, M. Seiler, H. Trautmann, and P. Kerschke, “Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods,” in <i>Parallel Problem Solving from Nature — PPSN XVII</i>, 2022, pp. 3–17, doi: <a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>.","ama":"Prager RP, Seiler M, Trautmann H, Kerschke P. Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods. In: Rudolph G, Kononova AV, Aguirre H, Kerschke P, Ochoa G, Tušar T, eds. <i>Parallel Problem Solving from Nature — PPSN XVII</i>. Springer International Publishing; 2022:3–17. doi:<a href=\"https://doi.org/10.1007/978-3-031-14714-2_1\">10.1007/978-3-031-14714-2_1</a>"},"page":"3–17","publisher":"Springer International Publishing","date_updated":"2024-06-07T07:13:47Z","author":[{"first_name":"Raphael Patrick","last_name":"Prager","full_name":"Prager, Raphael Patrick"},{"full_name":"Seiler, Moritz","id":"105520","last_name":"Seiler","first_name":"Moritz"},{"full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"}],"date_created":"2023-08-04T07:12:33Z","title":"Automated Algorithm Selection in Single-Objective Continuous Optimization: A Comparative Study of Deep Learning and Landscape Analysis Methods","doi":"10.1007/978-3-031-14714-2_1","type":"conference","publication":"Parallel Problem Solving from Nature — PPSN XVII","editor":[{"last_name":"Rudolph","full_name":"Rudolph, Günter","first_name":"Günter"},{"first_name":"Anna V.","full_name":"Kononova, Anna V.","last_name":"Kononova"},{"first_name":"Hernán","last_name":"Aguirre","full_name":"Aguirre, Hernán"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"first_name":"Gabriela","last_name":"Ochoa","full_name":"Ochoa, Gabriela"},{"full_name":"Tušar, Tea","last_name":"Tušar","first_name":"Tea"}],"abstract":[{"text":"In recent years, feature-based automated algorithm selection using exploratory landscape analysis has demonstrated its great potential in single-objective continuous black-box optimization. However, feature computation is problem-specific and can be costly in terms of computational resources. This paper investigates feature-free approaches that rely on state-of-the-art deep learning techniques operating on either images or point clouds. We show that point-cloud-based strategies, in particular, are highly competitive and also substantially reduce the size of the required solver portfolio. Moreover, we highlight the effect and importance of cost-sensitive learning in automated algorithm selection models.","lang":"eng"}],"status":"public","_id":"46304","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}]},{"_id":"46303","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}],"publication":"Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)","type":"conference","editor":[{"last_name":"the Advancement of Artificial Intelligence (AAAI) Association","full_name":"the Advancement of Artificial Intelligence (AAAI) Association, for","first_name":"for"}],"abstract":[{"text":"Social media platforms are essential for information sharing and, thus, prone to coordinated dis- and misinformation campaigns. Nevertheless, research in this area is hampered by strict data sharing regulations imposed by the platforms, resulting in a lack of benchmark data. Previous work focused on circumventing these rules by either pseudonymizing the data or sharing fragments. In this work, we will address the benchmarking crisis by presenting a methodology that can be used to create artificial campaigns out of original campaign building blocks. We conduct a proof-of-concept study using the freely available generative language model GPT-Neo in this context and demonstrate that the campaign patterns can flexibly be adapted to an underlying social media stream and evade state-of-the-art campaign detection approaches based on stream clustering. Thus, we not only provide a framework for artificial benchmark generation but also demonstrate the possible adversarial nature of such benchmarks for challenging and advancing current campaign detection methods.","lang":"eng"}],"status":"public","publisher":"AAAI Press","date_updated":"2024-06-07T07:13:35Z","author":[{"first_name":"Janina Susanne","full_name":"Pohl, Janina Susanne","last_name":"Pohl"},{"first_name":"Dennis","full_name":"Assenmacher, Dennis","last_name":"Assenmacher"},{"id":"105520","full_name":"Seiler, Moritz","last_name":"Seiler","first_name":"Moritz"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740"},{"first_name":"Christian","full_name":"Grimme, Christian","last_name":"Grimme"}],"date_created":"2023-08-04T07:11:34Z","title":"Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches","doi":"10.36190/2022.91","place":"Palo Alto, CA, USA","year":"2022","page":"1–10","citation":{"short":"J.S. Pohl, D. Assenmacher, M. Seiler, H. Trautmann, C. Grimme, in:  for the Advancement of Artificial Intelligence (AAAI) Association (Ed.), Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM), AAAI Press, Palo Alto, CA, USA, 2022, pp. 1–10.","bibtex":"@inproceedings{Pohl_Assenmacher_Seiler_Trautmann_Grimme_2022, place={Palo Alto, CA, USA}, title={Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches}, DOI={<a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>}, booktitle={Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)}, publisher={AAAI Press}, author={Pohl, Janina Susanne and Assenmacher, Dennis and Seiler, Moritz and Trautmann, Heike and Grimme, Christian}, editor={the Advancement of Artificial Intelligence (AAAI) Association, for}, year={2022}, pages={1–10} }","mla":"Pohl, Janina Susanne, et al. “Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches.” <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>, edited by for the Advancement of Artificial Intelligence (AAAI) Association, AAAI Press, 2022, pp. 1–10, doi:<a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>.","apa":"Pohl, J. S., Assenmacher, D., Seiler, M., Trautmann, H., &#38; Grimme, C. (2022). Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches. In  for the Advancement of Artificial Intelligence (AAAI) Association (Ed.), <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i> (pp. 1–10). AAAI Press. <a href=\"https://doi.org/10.36190/2022.91\">https://doi.org/10.36190/2022.91</a>","chicago":"Pohl, Janina Susanne, Dennis Assenmacher, Moritz Seiler, Heike Trautmann, and Christian Grimme. “Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches.” In <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>, edited by for the Advancement of Artificial Intelligence (AAAI) Association, 1–10. Palo Alto, CA, USA: AAAI Press, 2022. <a href=\"https://doi.org/10.36190/2022.91\">https://doi.org/10.36190/2022.91</a>.","ieee":"J. S. Pohl, D. Assenmacher, M. Seiler, H. Trautmann, and C. Grimme, “Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches,” in <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>, 2022, pp. 1–10, doi: <a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>.","ama":"Pohl JS, Assenmacher D, Seiler M, Trautmann H, Grimme C. Artificial Social Media Campaign Creation for Benchmarking and Challenging Detection Approaches. In: the Advancement of Artificial Intelligence (AAAI) Association  for, ed. <i>Workshop Proceedings of the 16$^th$ International Conference on Web and Social Media (ICWSM)</i>. AAAI Press; 2022:1–10. doi:<a href=\"https://doi.org/10.36190/2022.91\">10.36190/2022.91</a>"}},{"issue":"8","citation":{"bibtex":"@article{Clever_Pohl_Bossek_Kerschke_Trautmann_2022, title={Process-Oriented Stream Classification Pipeline: A Literature Review}, volume={12}, DOI={<a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>}, number={8}, journal={Applied Sciences}, author={Clever, Lena and Pohl, Janina Susanne and Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2022}, pages={1–44} }","mla":"Clever, Lena, et al. “Process-Oriented Stream Classification Pipeline: A Literature Review.” <i>Applied Sciences</i>, vol. 12, no. 8, 2022, pp. 1–44, doi:<a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>.","short":"L. Clever, J.S. Pohl, J. Bossek, P. Kerschke, H. Trautmann, Applied Sciences 12 (2022) 1–44.","apa":"Clever, L., Pohl, J. S., Bossek, J., Kerschke, P., &#38; Trautmann, H. (2022). Process-Oriented Stream Classification Pipeline: A Literature Review. <i>Applied Sciences</i>, <i>12</i>(8), 1–44. <a href=\"https://doi.org/10.3390/app12189094\">https://doi.org/10.3390/app12189094</a>","ama":"Clever L, Pohl JS, Bossek J, Kerschke P, Trautmann H. Process-Oriented Stream Classification Pipeline: A Literature Review. <i>Applied Sciences</i>. 2022;12(8):1–44. doi:<a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>","ieee":"L. Clever, J. S. Pohl, J. Bossek, P. Kerschke, and H. Trautmann, “Process-Oriented Stream Classification Pipeline: A Literature Review,” <i>Applied Sciences</i>, vol. 12, no. 8, pp. 1–44, 2022, doi: <a href=\"https://doi.org/10.3390/app12189094\">10.3390/app12189094</a>.","chicago":"Clever, Lena, Janina Susanne Pohl, Jakob Bossek, Pascal Kerschke, and Heike Trautmann. “Process-Oriented Stream Classification Pipeline: A Literature Review.” <i>Applied Sciences</i> 12, no. 8 (2022): 1–44. <a href=\"https://doi.org/10.3390/app12189094\">https://doi.org/10.3390/app12189094</a>."},"intvolume":"        12","page":"1–44","year":"2022","date_created":"2023-08-04T07:17:23Z","author":[{"full_name":"Clever, Lena","last_name":"Clever","first_name":"Lena"},{"full_name":"Pohl, Janina Susanne","last_name":"Pohl","first_name":"Janina Susanne"},{"orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike"}],"volume":12,"date_updated":"2024-06-10T12:02:17Z","doi":"10.3390/app12189094","title":"Process-Oriented Stream Classification Pipeline: A Literature Review","type":"journal_article","publication":"Applied Sciences","status":"public","abstract":[{"text":"Due to the rise of continuous data-generating applications, analyzing data streams has gained increasing attention over the past decades. A core research area in stream data is stream classification, which categorizes or detects data points within an evolving stream of observations. Areas of stream classification are diverse—ranging, e.g., from monitoring sensor data to analyzing a wide range of (social) media applications. Research in stream classification is related to developing methods that adapt to the changing and potentially volatile data stream. It focuses on individual aspects of the stream classification pipeline, e.g., designing suitable algorithm architectures, an efficient train and test procedure, or detecting so-called concept drifts. As a result of the many different research questions and strands, the field is challenging to grasp, especially for beginners. This survey explores, summarizes, and categorizes work within the domain of stream classification and identifies core research threads over the past few years. It is structured based on the stream classification process to facilitate coordination within this complex topic, including common application scenarios and benchmarking data sets. Thus, both newcomers to the field and experts who want to widen their scope can gain (additional) insight into this research area and find starting points and pointers to more in-depth literature on specific issues and research directions in the field.","lang":"eng"}],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46309","language":[{"iso":"eng"}]},{"_id":"46302","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Parallel Problem Solving from Nature — PPSN XVII","editor":[{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"first_name":"AV","full_name":"Kononova, AV","last_name":"Kononova"},{"last_name":"Aguirre","full_name":"Aguirre, H","first_name":"H"},{"first_name":"P","last_name":"Kerschke","full_name":"Kerschke, P"},{"first_name":"G","last_name":"Ochoa","full_name":"Ochoa, G"},{"first_name":"T","last_name":"Tušar","full_name":"Tušar, T"}],"status":"public","date_updated":"2024-06-10T12:02:35Z","publisher":"Springer International Publishing","date_created":"2023-08-04T07:10:52Z","author":[{"first_name":"J","full_name":"Heins, J","last_name":"Heins"},{"first_name":"J","full_name":"Rook, J","last_name":"Rook"},{"first_name":"L","last_name":"Schäpermeier","full_name":"Schäpermeier, L"},{"full_name":"Kerschke, P","last_name":"Kerschke","first_name":"P"},{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740"}],"title":"BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems","publication_identifier":{"isbn":["978-3-031-14714-2"]},"year":"2022","place":"Cham","citation":{"chicago":"Heins, J, J Rook, L Schäpermeier, P Kerschke, Jakob Bossek, and Heike Trautmann. “BBE: Basin-Based Evaluation of Multimodal Multi-Objective Optimization Problems.” In <i>Parallel Problem Solving from Nature — PPSN XVII</i>, edited by G Rudolph, AV Kononova, H Aguirre, P Kerschke, G Ochoa, and T Tušar, 192–206. Cham: Springer International Publishing, 2022.","ieee":"J. Heins, J. Rook, L. Schäpermeier, P. Kerschke, J. Bossek, and H. Trautmann, “BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems,” in <i>Parallel Problem Solving from Nature — PPSN XVII</i>, 2022, pp. 192–206.","mla":"Heins, J., et al. “BBE: Basin-Based Evaluation of Multimodal Multi-Objective Optimization Problems.” <i>Parallel Problem Solving from Nature — PPSN XVII</i>, edited by G Rudolph et al., Springer International Publishing, 2022, pp. 192–206.","short":"J. Heins, J. Rook, L. Schäpermeier, P. Kerschke, J. Bossek, H. Trautmann, in: G. Rudolph, A. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, T. Tušar (Eds.), Parallel Problem Solving from Nature — PPSN XVII, Springer International Publishing, Cham, 2022, pp. 192–206.","bibtex":"@inproceedings{Heins_Rook_Schäpermeier_Kerschke_Bossek_Trautmann_2022, place={Cham}, title={BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems}, booktitle={Parallel Problem Solving from Nature — PPSN XVII}, publisher={Springer International Publishing}, author={Heins, J and Rook, J and Schäpermeier, L and Kerschke, P and Bossek, Jakob and Trautmann, Heike}, editor={Rudolph, G and Kononova, AV and Aguirre, H and Kerschke, P and Ochoa, G and Tušar, T}, year={2022}, pages={192–206} }","ama":"Heins J, Rook J, Schäpermeier L, Kerschke P, Bossek J, Trautmann H. BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems. In: Rudolph G, Kononova A, Aguirre H, Kerschke P, Ochoa G, Tušar T, eds. <i>Parallel Problem Solving from Nature — PPSN XVII</i>. Springer International Publishing; 2022:192–206.","apa":"Heins, J., Rook, J., Schäpermeier, L., Kerschke, P., Bossek, J., &#38; Trautmann, H. (2022). BBE: Basin-Based Evaluation of Multimodal Multi-objective Optimization Problems. In G. Rudolph, A. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, &#38; T. Tušar (Eds.), <i>Parallel Problem Solving from Nature — PPSN XVII</i> (pp. 192–206). Springer International Publishing."},"page":"192–206"},{"status":"public","editor":[{"first_name":"Wolfgang","last_name":"von Gahlen-Hoops","full_name":"von Gahlen-Hoops, Wolfgang"}],"type":"book_chapter","publication":"Soziale Ordnungen des Sterbens","language":[{"iso":"ger"}],"user_id":"21863","department":[{"_id":"136"}],"project":[{"_id":"1084","name":"PÖM: Politische Ökonomie der Medien und der Kommunikation"}],"_id":"41792","citation":{"ieee":"C. Fuchs, “Der Tod und die Liebe: Die Metaphysik der Kommunikation,” in <i>Soziale Ordnungen des Sterbens</i>, W. von Gahlen-Hoops, Ed. Bielefeld: transcript Verlag, 2022.","chicago":"Fuchs, Christian. “Der Tod und die Liebe: Die Metaphysik der Kommunikation.” In <i>Soziale Ordnungen des Sterbens</i>, edited by Wolfgang von Gahlen-Hoops. Bielefeld: transcript Verlag, 2022.","ama":"Fuchs C. Der Tod und die Liebe: Die Metaphysik der Kommunikation. In: von Gahlen-Hoops W, ed. <i>Soziale Ordnungen des Sterbens</i>. transcript Verlag; 2022.","apa":"Fuchs, C. (2022). Der Tod und die Liebe: Die Metaphysik der Kommunikation. In W. von Gahlen-Hoops (Ed.), <i>Soziale Ordnungen des Sterbens</i>. transcript Verlag.","bibtex":"@inbook{Fuchs_2022, place={Bielefeld}, title={Der Tod und die Liebe: Die Metaphysik der Kommunikation}, booktitle={Soziale Ordnungen des Sterbens}, publisher={transcript Verlag}, author={Fuchs, Christian}, editor={von Gahlen-Hoops, Wolfgang}, year={2022} }","short":"C. Fuchs, in: W. von Gahlen-Hoops (Ed.), Soziale Ordnungen des Sterbens, transcript Verlag, Bielefeld, 2022.","mla":"Fuchs, Christian. “Der Tod und die Liebe: Die Metaphysik der Kommunikation.” <i>Soziale Ordnungen des Sterbens</i>, edited by Wolfgang von Gahlen-Hoops, transcript Verlag, 2022."},"place":"Bielefeld","year":"2022","title":"Der Tod und die Liebe: Die Metaphysik der Kommunikation","date_created":"2023-02-05T22:04:28Z","author":[{"last_name":"Fuchs","orcid":"0000-0003-0589-4579","id":"21863","full_name":"Fuchs, Christian","first_name":"Christian"}],"date_updated":"2024-06-10T13:39:27Z","publisher":"transcript Verlag"},{"department":[{"_id":"136"}],"user_id":"21863","_id":"33256","project":[{"_id":"1086","name":"PÖDIM: Politische Ökonomie der digitalen Medien und der digitalen Kommunikation"}],"language":[{"iso":"eng"}],"publication":"Public Value Texte","type":"journal_article","status":"public","volume":25,"author":[{"first_name":"Christian","full_name":"Fuchs, Christian","id":"21863","last_name":"Fuchs","orcid":"0000-0003-0589-4579"},{"first_name":"Klaus","last_name":"Unterberger","full_name":"Unterberger, Klaus"}],"date_created":"2022-09-06T06:19:02Z","date_updated":"2024-06-10T13:38:59Z","title":"Transform the Internet: Why we Need a Public Service Internet","publication_status":"published","intvolume":"        25","page":"54-63","citation":{"chicago":"Fuchs, Christian, and Klaus Unterberger. “Transform the Internet: Why We Need a Public Service Internet.” <i>Public Value Texte</i> 25 (2022): 54–63.","ieee":"C. Fuchs and K. Unterberger, “Transform the Internet: Why we Need a Public Service Internet,” <i>Public Value Texte</i>, vol. 25, pp. 54–63, 2022.","mla":"Fuchs, Christian, and Klaus Unterberger. “Transform the Internet: Why We Need a Public Service Internet.” <i>Public Value Texte</i>, vol. 25, 2022, pp. 54–63.","short":"C. Fuchs, K. Unterberger, Public Value Texte 25 (2022) 54–63.","bibtex":"@article{Fuchs_Unterberger_2022, title={Transform the Internet: Why we Need a Public Service Internet}, volume={25}, journal={Public Value Texte}, author={Fuchs, Christian and Unterberger, Klaus}, year={2022}, pages={54–63} }","apa":"Fuchs, C., &#38; Unterberger, K. (2022). Transform the Internet: Why we Need a Public Service Internet. <i>Public Value Texte</i>, <i>25</i>, 54–63.","ama":"Fuchs C, Unterberger K. Transform the Internet: Why we Need a Public Service Internet. <i>Public Value Texte</i>. 2022;25:54-63."},"year":"2022"}]