[{"type":"journal_article","publication":"Algorithmica","status":"public","abstract":[{"text":"We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. The (1+1) Evolutionary Algorithm and RLS operate in a setting where the number of colors is bounded and we are minimizing the number of conflicts. Iterated local search algorithms use an unbounded color palette and aim to use the smallest colors and, consequently, the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i.e., starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. We further show that tailoring mutation operators to parts of the graph where changes have occurred can significantly reduce the expected reoptimization time. In most settings the expected reoptimization time for such tailored algorithms is linear in the number of added edges. However, tailored algorithms cannot prevent exponential times in settings where the original algorithm is inefficient.","lang":"eng"}],"user_id":"102979","department":[{"_id":"819"}],"_id":"48854","language":[{"iso":"eng"}],"keyword":["Dynamic optimization","Evolutionary algorithms","Running time analysis"],"issue":"10","publication_identifier":{"issn":["0178-4617"]},"citation":{"ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” <i>Algorithmica</i>, vol. 83, no. 10, pp. 3148–3179, 2021, doi: <a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>.","chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” <i>Algorithmica</i> 83, no. 10 (2021): 3148–3179. <a href=\"https://doi.org/10.1007/s00453-021-00838-3\">https://doi.org/10.1007/s00453-021-00838-3</a>.","ama":"Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. <i>Algorithmica</i>. 2021;83(10):3148–3179. doi:<a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>","apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2021). Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. <i>Algorithmica</i>, <i>83</i>(10), 3148–3179. <a href=\"https://doi.org/10.1007/s00453-021-00838-3\">https://doi.org/10.1007/s00453-021-00838-3</a>","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.","mla":"Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” <i>Algorithmica</i>, vol. 83, no. 10, 2021, pp. 3148–3179, doi:<a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>.","bibtex":"@article{Bossek_Neumann_Peng_Sudholt_2021, title={Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}, volume={83}, DOI={<a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>}, number={10}, journal={Algorithmica}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2021}, pages={3148–3179} }"},"page":"3148–3179","intvolume":"        83","year":"2021","date_created":"2023-11-14T15:58:54Z","author":[{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"},{"first_name":"Pan","last_name":"Peng","full_name":"Peng, Pan"},{"first_name":"Dirk","last_name":"Sudholt","full_name":"Sudholt, Dirk"}],"volume":83,"date_updated":"2023-12-13T10:51:34Z","doi":"10.1007/s00453-021-00838-3","title":"Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem"},{"title":"High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection","doi":"10.1109/ipdps49936.2021.00116","publisher":"IEEE","date_updated":"2024-01-22T09:59:13Z","date_created":"2022-02-21T14:26:37Z","author":[{"first_name":"Martin","last_name":"Karp","full_name":"Karp, Martin"},{"first_name":"Artur","last_name":"Podobas","full_name":"Podobas, Artur"},{"first_name":"Niclas","last_name":"Jansson","full_name":"Jansson, Niclas"},{"first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias","id":"3145"},{"first_name":"Christian","id":"16153","full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982"},{"full_name":"Schlatter, Philipp","last_name":"Schlatter","first_name":"Philipp"},{"last_name":"Markidis","full_name":"Markidis, Stefano","first_name":"Stefano"}],"year":"2021","citation":{"ama":"Karp M, Podobas A, Jansson N, et al. High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection. In: <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>","chicago":"Karp, Martin, Artur Podobas, Niclas Jansson, Tobias Kenter, Christian Plessl, Philipp Schlatter, and Stefano Markidis. “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection.” In <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">https://doi.org/10.1109/ipdps49936.2021.00116</a>.","ieee":"M. Karp <i>et al.</i>, “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection,” 2021, doi: <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>.","mla":"Karp, Martin, et al. “High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection.” <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>.","bibtex":"@inproceedings{Karp_Podobas_Jansson_Kenter_Plessl_Schlatter_Markidis_2021, title={High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection}, DOI={<a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">10.1109/ipdps49936.2021.00116</a>}, booktitle={2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Karp, Martin and Podobas, Artur and Jansson, Niclas and Kenter, Tobias and Plessl, Christian and Schlatter, Philipp and Markidis, Stefano}, year={2021} }","short":"M. Karp, A. Podobas, N. Jansson, T. Kenter, C. Plessl, P. Schlatter, S. Markidis, in: 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2021.","apa":"Karp, M., Podobas, A., Jansson, N., Kenter, T., Plessl, C., Schlatter, P., &#38; Markidis, S. (2021). High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection. <i>2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps49936.2021.00116\">https://doi.org/10.1109/ipdps49936.2021.00116</a>"},"quality_controlled":"1","publication_status":"published","language":[{"iso":"eng"}],"_id":"29937","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"3145","status":"public","publication":"2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference"},{"language":[{"iso":"eng"}],"user_id":"9503","department":[{"_id":"888"}],"_id":"52927","status":"public","type":"conference","publication":"Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021","doi":"10.1609/AAAI.V35I7.16787","title":"Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics","date_created":"2024-03-26T10:55:06Z","author":[{"last_name":"Gil","full_name":"Gil, Oliver Fernández","first_name":"Oliver Fernández"},{"full_name":"Turhan, Anni-Yasmin","id":"104470","last_name":"Turhan","first_name":"Anni-Yasmin"}],"publisher":"AAAI Press","date_updated":"2024-03-26T10:56:06Z","citation":{"ama":"Gil OF, Turhan A-Y. Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics. In: <i>Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021</i>. AAAI Press; 2021:6340–6348. doi:<a href=\"https://doi.org/10.1609/AAAI.V35I7.16787\">10.1609/AAAI.V35I7.16787</a>","chicago":"Gil, Oliver Fernández, and Anni-Yasmin Turhan. “Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics.” In <i>Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021</i>, 6340–6348. AAAI Press, 2021. <a href=\"https://doi.org/10.1609/AAAI.V35I7.16787\">https://doi.org/10.1609/AAAI.V35I7.16787</a>.","ieee":"O. F. Gil and A.-Y. Turhan, “Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics,” in <i>Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021</i>, 2021, pp. 6340–6348, doi: <a href=\"https://doi.org/10.1609/AAAI.V35I7.16787\">10.1609/AAAI.V35I7.16787</a>.","mla":"Gil, Oliver Fernández, and Anni-Yasmin Turhan. “Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics.” <i>Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021</i>, AAAI Press, 2021, pp. 6340–6348, doi:<a href=\"https://doi.org/10.1609/AAAI.V35I7.16787\">10.1609/AAAI.V35I7.16787</a>.","bibtex":"@inproceedings{Gil_Turhan_2021, title={Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics}, DOI={<a href=\"https://doi.org/10.1609/AAAI.V35I7.16787\">10.1609/AAAI.V35I7.16787</a>}, booktitle={Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021}, publisher={AAAI Press}, author={Gil, Oliver Fernández and Turhan, Anni-Yasmin}, year={2021}, pages={6340–6348} }","short":"O.F. Gil, A.-Y. Turhan, in: Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021, AAAI Press, 2021, pp. 6340–6348.","apa":"Gil, O. F., &#38; Turhan, A.-Y. (2021). Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics. <i>Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021</i>, 6340–6348. <a href=\"https://doi.org/10.1609/AAAI.V35I7.16787\">https://doi.org/10.1609/AAAI.V35I7.16787</a>"},"page":"6340–6348","year":"2021"},{"author":[{"full_name":"Dubslaff, Clemens","last_name":"Dubslaff","first_name":"Clemens"},{"first_name":"Patrick","last_name":"Koopmann","full_name":"Koopmann, Patrick"},{"id":"104470","full_name":"Turhan, Anni-Yasmin","last_name":"Turhan","first_name":"Anni-Yasmin"}],"date_created":"2024-03-26T10:54:48Z","volume":33,"date_updated":"2024-03-26T10:56:09Z","doi":"10.1007/S00165-021-00549-0","title":"Enhancing Probabilistic Model Checking with Ontologies","issue":"6","citation":{"apa":"Dubslaff, C., Koopmann, P., &#38; Turhan, A.-Y. (2021). Enhancing Probabilistic Model Checking with Ontologies. <i>Formal Aspects Comput.</i>, <i>33</i>(6), 885–921. <a href=\"https://doi.org/10.1007/S00165-021-00549-0\">https://doi.org/10.1007/S00165-021-00549-0</a>","bibtex":"@article{Dubslaff_Koopmann_Turhan_2021, title={Enhancing Probabilistic Model Checking with Ontologies}, volume={33}, DOI={<a href=\"https://doi.org/10.1007/S00165-021-00549-0\">10.1007/S00165-021-00549-0</a>}, number={6}, journal={Formal Aspects Comput.}, author={Dubslaff, Clemens and Koopmann, Patrick and Turhan, Anni-Yasmin}, year={2021}, pages={885–921} }","mla":"Dubslaff, Clemens, et al. “Enhancing Probabilistic Model Checking with Ontologies.” <i>Formal Aspects Comput.</i>, vol. 33, no. 6, 2021, pp. 885–921, doi:<a href=\"https://doi.org/10.1007/S00165-021-00549-0\">10.1007/S00165-021-00549-0</a>.","short":"C. Dubslaff, P. Koopmann, A.-Y. Turhan, Formal Aspects Comput. 33 (2021) 885–921.","ama":"Dubslaff C, Koopmann P, Turhan A-Y. Enhancing Probabilistic Model Checking with Ontologies. <i>Formal Aspects Comput</i>. 2021;33(6):885–921. doi:<a href=\"https://doi.org/10.1007/S00165-021-00549-0\">10.1007/S00165-021-00549-0</a>","chicago":"Dubslaff, Clemens, Patrick Koopmann, and Anni-Yasmin Turhan. “Enhancing Probabilistic Model Checking with Ontologies.” <i>Formal Aspects Comput.</i> 33, no. 6 (2021): 885–921. <a href=\"https://doi.org/10.1007/S00165-021-00549-0\">https://doi.org/10.1007/S00165-021-00549-0</a>.","ieee":"C. Dubslaff, P. Koopmann, and A.-Y. Turhan, “Enhancing Probabilistic Model Checking with Ontologies,” <i>Formal Aspects Comput.</i>, vol. 33, no. 6, pp. 885–921, 2021, doi: <a href=\"https://doi.org/10.1007/S00165-021-00549-0\">10.1007/S00165-021-00549-0</a>."},"intvolume":"        33","page":"885–921","year":"2021","user_id":"9503","department":[{"_id":"888"}],"_id":"52926","language":[{"iso":"eng"}],"type":"journal_article","publication":"Formal Aspects Comput.","status":"public"},{"type":"conference","publication":"Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use ","status":"public","user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"_id":"22285","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Biermeier_Yigitbas_Weidmann_Engels_2021, title={Ensuring User Interface Adaptation Consistency through Triple Graph Grammers}, booktitle={Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use }, author={Biermeier, Kai and Yigitbas, Enes and Weidmann, Nils and Engels, Gregor}, year={2021} }","short":"K. Biermeier, E. Yigitbas, N. Weidmann, G. Engels, in: Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use , 2021.","mla":"Biermeier, Kai, et al. “Ensuring User Interface Adaptation Consistency through Triple Graph Grammers.” <i>Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use </i>, 2021.","apa":"Biermeier, K., Yigitbas, E., Weidmann, N., &#38; Engels, G. (2021). Ensuring User Interface Adaptation Consistency through Triple Graph Grammers. <i>Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use </i>.","chicago":"Biermeier, Kai, Enes Yigitbas, Nils Weidmann, and Gregor Engels. “Ensuring User Interface Adaptation Consistency through Triple Graph Grammers.” In <i>Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use </i>, 2021.","ieee":"K. Biermeier, E. Yigitbas, N. Weidmann, and G. Engels, “Ensuring User Interface Adaptation Consistency through Triple Graph Grammers,” 2021.","ama":"Biermeier K, Yigitbas E, Weidmann N, Engels G. Ensuring User Interface Adaptation Consistency through Triple Graph Grammers. In: <i>Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use </i>. ; 2021."},"year":"2021","author":[{"orcid":"0000-0002-2879-2359","last_name":"Biermeier","full_name":"Biermeier, Kai","id":"55908","first_name":"Kai"},{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"first_name":"Nils","last_name":"Weidmann","full_name":"Weidmann, Nils","id":"53103"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"date_created":"2021-06-07T07:32:40Z","date_updated":"2024-04-02T09:39:05Z","title":"Ensuring User Interface Adaptation Consistency through Triple Graph Grammers"},{"department":[{"_id":"27"},{"_id":"518"}],"user_id":"3145","_id":"46194","project":[{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)","type":"conference","status":"public","author":[{"full_name":"Kenter, Tobias","id":"3145","last_name":"Kenter","first_name":"Tobias"},{"last_name":"Shambhu","full_name":"Shambhu, Adesh","first_name":"Adesh"},{"first_name":"Sara","full_name":"Faghih-Naini, Sara","last_name":"Faghih-Naini"},{"first_name":"Vadym","last_name":"Aizinger","full_name":"Aizinger, Vadym"}],"date_created":"2023-07-28T11:58:14Z","publisher":"ACM","date_updated":"2024-04-17T08:12:21Z","doi":"10.1145/3468267.3470617","main_file_link":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3468267.3470617"}],"title":"Algorithm-hardware co-design of a discontinuous Galerkin shallow-water model for a dataflow architecture on FPGA","related_material":{"link":[{"relation":"other","description":"Open Access available via this link.","url":" https://www.sighpc.org/for-our-community/acm-open-tocs/pasc21-open-toc "}]},"quality_controlled":"1","publication_status":"published","citation":{"apa":"Kenter, T., Shambhu, A., Faghih-Naini, S., &#38; Aizinger, V. (2021). Algorithm-hardware co-design of a discontinuous Galerkin shallow-water model for a dataflow architecture on FPGA. <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. <a href=\"https://doi.org/10.1145/3468267.3470617\">https://doi.org/10.1145/3468267.3470617</a>","short":"T. Kenter, A. Shambhu, S. Faghih-Naini, V. Aizinger, in: Proceedings of the Platform for Advanced Scientific Computing Conference (PASC), ACM, 2021.","bibtex":"@inproceedings{Kenter_Shambhu_Faghih-Naini_Aizinger_2021, title={Algorithm-hardware co-design of a discontinuous Galerkin shallow-water model for a dataflow architecture on FPGA}, DOI={<a href=\"https://doi.org/10.1145/3468267.3470617\">10.1145/3468267.3470617</a>}, booktitle={Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)}, publisher={ACM}, author={Kenter, Tobias and Shambhu, Adesh and Faghih-Naini, Sara and Aizinger, Vadym}, year={2021} }","mla":"Kenter, Tobias, et al. “Algorithm-Hardware Co-Design of a Discontinuous Galerkin Shallow-Water Model for a Dataflow Architecture on FPGA.” <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>, ACM, 2021, doi:<a href=\"https://doi.org/10.1145/3468267.3470617\">10.1145/3468267.3470617</a>.","ieee":"T. Kenter, A. Shambhu, S. Faghih-Naini, and V. Aizinger, “Algorithm-hardware co-design of a discontinuous Galerkin shallow-water model for a dataflow architecture on FPGA,” 2021, doi: <a href=\"https://doi.org/10.1145/3468267.3470617\">10.1145/3468267.3470617</a>.","chicago":"Kenter, Tobias, Adesh Shambhu, Sara Faghih-Naini, and Vadym Aizinger. “Algorithm-Hardware Co-Design of a Discontinuous Galerkin Shallow-Water Model for a Dataflow Architecture on FPGA.” In <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. ACM, 2021. <a href=\"https://doi.org/10.1145/3468267.3470617\">https://doi.org/10.1145/3468267.3470617</a>.","ama":"Kenter T, Shambhu A, Faghih-Naini S, Aizinger V. Algorithm-hardware co-design of a discontinuous Galerkin shallow-water model for a dataflow architecture on FPGA. In: <i>Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)</i>. ACM; 2021. doi:<a href=\"https://doi.org/10.1145/3468267.3470617\">10.1145/3468267.3470617</a>"},"year":"2021"},{"language":[{"iso":"eng"}],"file_date_updated":"2024-05-30T18:02:28Z","ddc":["000"],"department":[{"_id":"574"}],"user_id":"11871","_id":"29291","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"heindorf","date_created":"2024-05-30T18:02:28Z","date_updated":"2024-05-30T18:02:28Z","file_id":"54523","access_level":"closed","file_name":"ASSET_public.pdf","file_size":537882}],"publication":"Proceedings of the 11th on Knowledge Capture Conference","type":"conference","doi":"10.1145/3460210.3493563","main_file_link":[{"url":"https://papers.dice-research.org/2021/KCAP2021_ASSET/public.pdf","open_access":"1"}],"title":"ASSET: A Semi-supervised Approach for Entity Typing in Knowledge Graphs","author":[{"orcid":"0000-0003-0215-1278","last_name":"Zahera","id":"72768","full_name":"Zahera, Hamada Mohamed Abdelsamee","first_name":"Hamada Mohamed Abdelsamee"},{"orcid":"0000-0002-4525-6865","last_name":"Heindorf","id":"11871","full_name":"Heindorf, Stefan","first_name":"Stefan"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"date_created":"2022-01-12T10:27:02Z","oa":"1","date_updated":"2024-05-30T18:02:43Z","publisher":"ACM","citation":{"ama":"Zahera HMA, Heindorf S, Ngonga Ngomo A-C. ASSET: A Semi-supervised Approach for Entity Typing in Knowledge Graphs. In: <i>Proceedings of the 11th on Knowledge Capture Conference</i>. ACM; 2021. doi:<a href=\"https://doi.org/10.1145/3460210.3493563\">10.1145/3460210.3493563</a>","ieee":"H. M. A. Zahera, S. Heindorf, and A.-C. Ngonga Ngomo, “ASSET: A Semi-supervised Approach for Entity Typing in Knowledge Graphs,” 2021, doi: <a href=\"https://doi.org/10.1145/3460210.3493563\">10.1145/3460210.3493563</a>.","chicago":"Zahera, Hamada Mohamed Abdelsamee, Stefan Heindorf, and Axel-Cyrille Ngonga Ngomo. “ASSET: A Semi-Supervised Approach for Entity Typing in Knowledge Graphs.” In <i>Proceedings of the 11th on Knowledge Capture Conference</i>. ACM, 2021. <a href=\"https://doi.org/10.1145/3460210.3493563\">https://doi.org/10.1145/3460210.3493563</a>.","apa":"Zahera, H. M. A., Heindorf, S., &#38; Ngonga Ngomo, A.-C. (2021). ASSET: A Semi-supervised Approach for Entity Typing in Knowledge Graphs. <i>Proceedings of the 11th on Knowledge Capture Conference</i>. <a href=\"https://doi.org/10.1145/3460210.3493563\">https://doi.org/10.1145/3460210.3493563</a>","short":"H.M.A. Zahera, S. Heindorf, A.-C. Ngonga Ngomo, in: Proceedings of the 11th on Knowledge Capture Conference, ACM, 2021.","mla":"Zahera, Hamada Mohamed Abdelsamee, et al. “ASSET: A Semi-Supervised Approach for Entity Typing in Knowledge Graphs.” <i>Proceedings of the 11th on Knowledge Capture Conference</i>, ACM, 2021, doi:<a href=\"https://doi.org/10.1145/3460210.3493563\">10.1145/3460210.3493563</a>.","bibtex":"@inproceedings{Zahera_Heindorf_Ngonga Ngomo_2021, title={ASSET: A Semi-supervised Approach for Entity Typing in Knowledge Graphs}, DOI={<a href=\"https://doi.org/10.1145/3460210.3493563\">10.1145/3460210.3493563</a>}, booktitle={Proceedings of the 11th on Knowledge Capture Conference}, publisher={ACM}, author={Zahera, Hamada Mohamed Abdelsamee and Heindorf, Stefan and Ngonga Ngomo, Axel-Cyrille}, year={2021} }"},"year":"2021","has_accepted_license":"1","publication_status":"published"},{"citation":{"apa":"Manzoor, A., Saleem, M., &#38; Ngonga Ngomo, A.-C. (2021). Unsupervised Relation Extraction Using Sentence Encoding. In <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">https://doi.org/10.1007/978-3-030-80418-3_25</a>","short":"A. Manzoor, M. Saleem, A.-C. Ngonga Ngomo, in: The Semantic Web: ESWC 2021 Satellite Events, Springer International Publishing, Cham, 2021.","bibtex":"@inbook{Manzoor_Saleem_Ngonga Ngomo_2021, place={Cham}, title={Unsupervised Relation Extraction Using Sentence Encoding}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>}, booktitle={The Semantic Web: ESWC 2021 Satellite Events}, publisher={Springer International Publishing}, author={Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}, year={2021} }","mla":"Manzoor, Ali, et al. “Unsupervised Relation Extraction Using Sentence Encoding.” <i>The Semantic Web: ESWC 2021 Satellite Events</i>, Springer International Publishing, 2021, doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>.","ama":"Manzoor A, Saleem M, Ngonga Ngomo A-C. Unsupervised Relation Extraction Using Sentence Encoding. In: <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Springer International Publishing; 2021. doi:<a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">10.1007/978-3-030-80418-3_25</a>","ieee":"A. Manzoor, M. Saleem, and A.-C. Ngonga Ngomo, “Unsupervised Relation Extraction Using Sentence Encoding,” in <i>The Semantic Web: ESWC 2021 Satellite Events</i>, Cham: Springer International Publishing, 2021.","chicago":"Manzoor, Ali, Muhammad Saleem, and Axel-Cyrille Ngonga Ngomo. “Unsupervised Relation Extraction Using Sentence Encoding.” In <i>The Semantic Web: ESWC 2021 Satellite Events</i>. Cham: Springer International Publishing, 2021. <a href=\"https://doi.org/10.1007/978-3-030-80418-3_25\">https://doi.org/10.1007/978-3-030-80418-3_25</a>."},"year":"2021","place":"Cham","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030804176","9783030804183"]},"publication_status":"published","doi":"10.1007/978-3-030-80418-3_25","title":"Unsupervised Relation Extraction Using Sentence Encoding","author":[{"first_name":"Ali","id":"77309","full_name":"Manzoor, Ali","last_name":"Manzoor"},{"first_name":"Muhammad","full_name":"Saleem, Muhammad","last_name":"Saleem"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716"}],"date_created":"2024-06-04T12:23:21Z","date_updated":"2024-06-04T12:24:52Z","publisher":"Springer International Publishing","status":"public","publication":"The Semantic Web: ESWC 2021 Satellite Events","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"574"}],"user_id":"77309","_id":"54586"},{"keyword":["Logic","Hardware and Architecture","Arts and Humanities (miscellaneous)","Software","Theoretical Computer Science"],"language":[{"iso":"eng"}],"publication":"Journal of Logic and Computation","abstract":[{"text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering the positive version, asking for sets of variables as explanations, we study, besides the problem of wether there exists a set of explanations, two explanation size limited variants of this reasoning problem (less than or equal to, and equal to a given size bound). In this paper, we present a thorough two-dimensional classification of these problems: the first dimension is regarding the parameterized complexity under a wealth of different parameterizations, and the second dimension spans through all possible Boolean fragments of these problems in Schaefer’s constraint satisfaction framework with co-clones (T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1–3, 1978, San Diego, California, USA, R.J. Lipton, W.A. Burkhard, W.J. Savitch, E.P. Friedman, A.V. Aho eds, pp. 216–226. ACM, 1978). Thereby, we almost complete the parameterized complexity classification program initiated by Fellows et al. (The parameterized complexity of abduction. In Proceedings of the Twenty-Sixth AAAI Conference on Articial Intelligence, July 22–26, 2012, Toronto, Ontario, Canada, J. Homann, B. Selman eds. AAAI Press, 2012), partially building on the results by Nordh and Zanuttini (What makes propositional abduction tractable. Artificial Intelligence, 172, 1245–1284, 2008). In this process, we outline a fine-grained analysis of the inherent parameterized intractability of these problems and pinpoint their FPT parts. As the standard algebraic approach is not applicable to our problems, we develop an alternative method that makes the algebraic tools partially available again.</jats:p>","lang":"eng"}],"publisher":"Oxford University Press (OUP)","date_created":"2023-07-03T11:35:23Z","title":"Parameterized complexity of abduction in Schaefer’s framework","issue":"1","year":"2021","_id":"45844","user_id":"99353","department":[{"_id":"574"}],"extern":"1","type":"journal_article","status":"public","date_updated":"2024-06-04T16:03:14Z","author":[{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir"},{"last_name":"Meier","full_name":"Meier, Arne","first_name":"Arne"},{"first_name":"Johannes","full_name":"Schmidt, Johannes","last_name":"Schmidt"}],"volume":31,"doi":"10.1093/logcom/exaa079","publication_status":"published","publication_identifier":{"issn":["0955-792X","1465-363X"]},"citation":{"mla":"Mahmood, Yasir, et al. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, Oxford University Press (OUP), 2021, pp. 266–96, doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>.","bibtex":"@article{Mahmood_Meier_Schmidt_2021, title={Parameterized complexity of abduction in Schaefer’s framework}, volume={31}, DOI={<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>}, number={1}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2021}, pages={266–296} }","short":"Y. Mahmood, A. Meier, J. Schmidt, Journal of Logic and Computation 31 (2021) 266–296.","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2021). Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>, <i>31</i>(1), 266–296. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>","ama":"Mahmood Y, Meier A, Schmidt J. Parameterized complexity of abduction in Schaefer’s framework. <i>Journal of Logic and Computation</i>. 2021;31(1):266-296. doi:<a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Abduction in Schaefer’s Framework.” <i>Journal of Logic and Computation</i> 31, no. 1 (2021): 266–96. <a href=\"https://doi.org/10.1093/logcom/exaa079\">https://doi.org/10.1093/logcom/exaa079</a>.","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized complexity of abduction in Schaefer’s framework,” <i>Journal of Logic and Computation</i>, vol. 31, no. 1, pp. 266–296, 2021, doi: <a href=\"https://doi.org/10.1093/logcom/exaa079\">10.1093/logcom/exaa079</a>."},"page":"266-296","intvolume":"        31"},{"year":"2021","citation":{"ieee":"N. Huaman <i>et al.</i>, “A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises,” in <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, 2021, pp. 1235–1252.","chicago":"Huaman, Nicolas, Bennet von Skarczinski, Christian Stransky, Dominik Wermke, Yasemin Acar, Arne Dreißigacker, and Sascha Fahl. “A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-Sized Enterprises.” In <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, 1235–1252. USENIX Association, 2021.","ama":"Huaman N, von Skarczinski B, Stransky C, et al. A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises. In: Bailey M, Greenstadt R, eds. <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>. USENIX Association; 2021:1235–1252.","apa":"Huaman, N., von Skarczinski, B., Stransky, C., Wermke, D., Acar, Y., Dreißigacker, A., &#38; Fahl, S. (2021). A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises. In M. Bailey &#38; R. Greenstadt (Eds.), <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i> (pp. 1235–1252). USENIX Association.","bibtex":"@inproceedings{Huaman_von Skarczinski_Stransky_Wermke_Acar_Dreißigacker_Fahl_2021, title={A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises}, booktitle={30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}, publisher={USENIX Association}, author={Huaman, Nicolas and von Skarczinski, Bennet and Stransky, Christian and Wermke, Dominik and Acar, Yasemin and Dreißigacker, Arne and Fahl, Sascha}, editor={Bailey, Michael and Greenstadt, Rachel}, year={2021}, pages={1235–1252} }","short":"N. Huaman, B. von Skarczinski, C. Stransky, D. Wermke, Y. Acar, A. Dreißigacker, S. Fahl, in: M. Bailey, R. Greenstadt (Eds.), 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, USENIX Association, 2021, pp. 1235–1252.","mla":"Huaman, Nicolas, et al. “A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-Sized Enterprises.” <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, USENIX Association, 2021, pp. 1235–1252."},"page":"1235–1252","publisher":"USENIX Association","date_updated":"2024-06-05T12:57:43Z","date_created":"2023-09-22T13:02:54Z","author":[{"first_name":"Nicolas","full_name":"Huaman, Nicolas","last_name":"Huaman"},{"first_name":"Bennet","full_name":"von Skarczinski, Bennet","last_name":"von Skarczinski"},{"first_name":"Christian","last_name":"Stransky","full_name":"Stransky, Christian"},{"last_name":"Wermke","full_name":"Wermke, Dominik","first_name":"Dominik"},{"last_name":"Acar","id":"94636","full_name":"Acar, Yasemin","first_name":"Yasemin"},{"first_name":"Arne","last_name":"Dreißigacker","full_name":"Dreißigacker, Arne"},{"first_name":"Sascha","full_name":"Fahl, Sascha","last_name":"Fahl"}],"title":"A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises","type":"conference","publication":"30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021","editor":[{"last_name":"Bailey","full_name":"Bailey, Michael","first_name":"Michael"},{"full_name":"Greenstadt, Rachel","last_name":"Greenstadt","first_name":"Rachel"}],"status":"public","_id":"47265","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"language":[{"iso":"eng"}],"extern":"1"},{"title":"On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security","publisher":"USENIX Association","date_updated":"2024-06-05T13:02:20Z","date_created":"2023-09-22T13:04:56Z","author":[{"last_name":"Stransky","full_name":"Stransky, Christian","first_name":"Christian"},{"full_name":"Wermke, Dominik","last_name":"Wermke","first_name":"Dominik"},{"last_name":"Schrader","full_name":"Schrader, Johanna","first_name":"Johanna"},{"first_name":"Nicolas","last_name":"Huaman","full_name":"Huaman, Nicolas"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"last_name":"Fehlhaber","full_name":"Fehlhaber, Anna Lena","first_name":"Anna Lena"},{"first_name":"Miranda","full_name":"Wei, Miranda","last_name":"Wei"},{"first_name":"Blase","last_name":"Ur","full_name":"Ur, Blase"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"year":"2021","page":"437–454","citation":{"ama":"Stransky C, Wermke D, Schrader J, et al. On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security. In: Chiasson S, ed. <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>. USENIX Association; 2021:437–454.","chicago":"Stransky, Christian, Dominik Wermke, Johanna Schrader, Nicolas Huaman, Yasemin Acar, Anna Lena Fehlhaber, Miranda Wei, Blase Ur, and Sascha Fahl. “On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security.” In <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, 437–454. USENIX Association, 2021.","ieee":"C. Stransky <i>et al.</i>, “On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security,” in <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, 2021, pp. 437–454.","apa":"Stransky, C., Wermke, D., Schrader, J., Huaman, N., Acar, Y., Fehlhaber, A. L., Wei, M., Ur, B., &#38; Fahl, S. (2021). On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security. In S. Chiasson (Ed.), <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i> (pp. 437–454). USENIX Association.","bibtex":"@inproceedings{Stransky_Wermke_Schrader_Huaman_Acar_Fehlhaber_Wei_Ur_Fahl_2021, title={On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security}, booktitle={Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021}, publisher={USENIX Association}, author={Stransky, Christian and Wermke, Dominik and Schrader, Johanna and Huaman, Nicolas and Acar, Yasemin and Fehlhaber, Anna Lena and Wei, Miranda and Ur, Blase and Fahl, Sascha}, editor={Chiasson, Sonia}, year={2021}, pages={437–454} }","mla":"Stransky, Christian, et al. “On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security.” <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, USENIX Association, 2021, pp. 437–454.","short":"C. Stransky, D. Wermke, J. Schrader, N. Huaman, Y. Acar, A.L. Fehlhaber, M. Wei, B. Ur, S. Fahl, in: S. Chiasson (Ed.), Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021, USENIX Association, 2021, pp. 437–454."},"language":[{"iso":"eng"}],"extern":"1","_id":"47268","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","editor":[{"last_name":"Chiasson","full_name":"Chiasson, Sonia","first_name":"Sonia"}],"status":"public","publication":"Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021","type":"conference"},{"_id":"47267","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","language":[{"iso":"eng"}],"extern":"1","publication":"2021 IEEE Symposium on Security and Privacy (SP)","type":"conference","status":"public","publisher":"IEEE","date_updated":"2024-06-05T13:02:40Z","author":[{"full_name":"Huaman, Nicolas","last_name":"Huaman","first_name":"Nicolas"},{"first_name":"Sabrina","last_name":"Amft","full_name":"Amft, Sabrina"},{"first_name":"Marten","last_name":"Oltrogge","full_name":"Oltrogge, Marten"},{"full_name":"Acar, Yasemin","id":"94636","last_name":"Acar","first_name":"Yasemin"},{"full_name":"Fahl, Sascha","last_name":"Fahl","first_name":"Sascha"}],"date_created":"2023-09-22T13:04:10Z","title":"They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites","doi":"10.1109/sp40001.2021.00094","publication_status":"published","year":"2021","citation":{"bibtex":"@inproceedings{Huaman_Amft_Oltrogge_Acar_Fahl_2021, title={They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites}, DOI={<a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>}, booktitle={2021 IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Huaman, Nicolas and Amft, Sabrina and Oltrogge, Marten and Acar, Yasemin and Fahl, Sascha}, year={2021} }","mla":"Huaman, Nicolas, et al. “They Would Do Better If They Worked Together: The Case of Interaction Problems Between Password Managers and Websites.” <i>2021 IEEE Symposium on Security and Privacy (SP)</i>, IEEE, 2021, doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>.","short":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, S. Fahl, in: 2021 IEEE Symposium on Security and Privacy (SP), IEEE, 2021.","apa":"Huaman, N., Amft, S., Oltrogge, M., Acar, Y., &#38; Fahl, S. (2021). They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites. <i>2021 IEEE Symposium on Security and Privacy (SP)</i>. <a href=\"https://doi.org/10.1109/sp40001.2021.00094\">https://doi.org/10.1109/sp40001.2021.00094</a>","ieee":"N. Huaman, S. Amft, M. Oltrogge, Y. Acar, and S. Fahl, “They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites,” 2021, doi: <a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>.","chicago":"Huaman, Nicolas, Sabrina Amft, Marten Oltrogge, Yasemin Acar, and Sascha Fahl. “They Would Do Better If They Worked Together: The Case of Interaction Problems Between Password Managers and Websites.” In <i>2021 IEEE Symposium on Security and Privacy (SP)</i>. IEEE, 2021. <a href=\"https://doi.org/10.1109/sp40001.2021.00094\">https://doi.org/10.1109/sp40001.2021.00094</a>.","ama":"Huaman N, Amft S, Oltrogge M, Acar Y, Fahl S. They Would do Better if They Worked Together: The Case of Interaction Problems Between Password Managers and Websites. In: <i>2021 IEEE Symposium on Security and Privacy (SP)</i>. IEEE; 2021. doi:<a href=\"https://doi.org/10.1109/sp40001.2021.00094\">10.1109/sp40001.2021.00094</a>"}},{"year":"2021","page":"411–428","citation":{"ama":"Haney JM, Acar Y, Furman S. “It’s the Company, the Government, You and I”: User Perceptions of Responsibility for Smart Home Privacy and Security. In: Bailey M, Greenstadt R, eds. <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>. USENIX Association; 2021:411–428.","ieee":"J. M. Haney, Y. Acar, and S. Furman, “‘It’s the Company, the Government, You and I’: User Perceptions of Responsibility for Smart Home Privacy and Security,” in <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, 2021, pp. 411–428.","chicago":"Haney, Julie M., Yasemin Acar, and Susanne Furman. “‘It’s the Company, the Government, You and I’: User Perceptions of Responsibility for Smart Home Privacy and Security.” In <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, 411–428. USENIX Association, 2021.","bibtex":"@inproceedings{Haney_Acar_Furman_2021, title={“It’s the Company, the Government, You and I”: User Perceptions of Responsibility for Smart Home Privacy and Security}, booktitle={30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}, publisher={USENIX Association}, author={Haney, Julie M. and Acar, Yasemin and Furman, Susanne}, editor={Bailey, Michael and Greenstadt, Rachel}, year={2021}, pages={411–428} }","mla":"Haney, Julie M., et al. “‘It’s the Company, the Government, You and I’: User Perceptions of Responsibility for Smart Home Privacy and Security.” <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, USENIX Association, 2021, pp. 411–428.","short":"J.M. Haney, Y. Acar, S. Furman, in: M. Bailey, R. Greenstadt (Eds.), 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, USENIX Association, 2021, pp. 411–428.","apa":"Haney, J. M., Acar, Y., &#38; Furman, S. (2021). “It’s the Company, the Government, You and I”: User Perceptions of Responsibility for Smart Home Privacy and Security. In M. Bailey &#38; R. Greenstadt (Eds.), <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i> (pp. 411–428). USENIX Association."},"date_updated":"2024-06-05T13:03:16Z","publisher":"USENIX Association","date_created":"2023-09-22T13:03:50Z","author":[{"full_name":"Haney, Julie M.","last_name":"Haney","first_name":"Julie M."},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"first_name":"Susanne","last_name":"Furman","full_name":"Furman, Susanne"}],"title":"\"It’s the Company, the Government, You and I\": User Perceptions of Responsibility for Smart Home Privacy and Security","publication":"30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021","type":"conference","editor":[{"first_name":"Michael","full_name":"Bailey, Michael","last_name":"Bailey"},{"first_name":"Rachel","last_name":"Greenstadt","full_name":"Greenstadt, Rachel"}],"status":"public","_id":"47266","department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","language":[{"iso":"eng"}],"extern":"1"},{"status":"public","editor":[{"first_name":"Michael","last_name":"Bailey","full_name":"Bailey, Michael"},{"full_name":"Greenstadt, Rachel","last_name":"Greenstadt","first_name":"Rachel"}],"publication":"30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021","type":"conference","extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"858"}],"user_id":"14931","_id":"47264","page":"4347–4364","citation":{"ieee":"M. Oltrogge, N. Huaman, S. Amft, Y. Acar, M. Backes, and S. Fahl, “Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications,” in <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, 2021, pp. 4347–4364.","chicago":"Oltrogge, Marten, Nicolas Huaman, Sabrina Amft, Yasemin Acar, Michael Backes, and Sascha Fahl. “Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications.” In <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, 4347–4364. USENIX Association, 2021.","ama":"Oltrogge M, Huaman N, Amft S, Acar Y, Backes M, Fahl S. Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications. In: Bailey M, Greenstadt R, eds. <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>. USENIX Association; 2021:4347–4364.","apa":"Oltrogge, M., Huaman, N., Amft, S., Acar, Y., Backes, M., &#38; Fahl, S. (2021). Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications. In M. Bailey &#38; R. Greenstadt (Eds.), <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i> (pp. 4347–4364). USENIX Association.","mla":"Oltrogge, Marten, et al. “Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications.” <i>30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021</i>, edited by Michael Bailey and Rachel Greenstadt, USENIX Association, 2021, pp. 4347–4364.","bibtex":"@inproceedings{Oltrogge_Huaman_Amft_Acar_Backes_Fahl_2021, title={Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications}, booktitle={30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}, publisher={USENIX Association}, author={Oltrogge, Marten and Huaman, Nicolas and Amft, Sabrina and Acar, Yasemin and Backes, Michael and Fahl, Sascha}, editor={Bailey, Michael and Greenstadt, Rachel}, year={2021}, pages={4347–4364} }","short":"M. Oltrogge, N. Huaman, S. Amft, Y. Acar, M. Backes, S. Fahl, in: M. Bailey, R. Greenstadt (Eds.), 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, USENIX Association, 2021, pp. 4347–4364."},"year":"2021","title":"Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications","author":[{"first_name":"Marten","full_name":"Oltrogge, Marten","last_name":"Oltrogge"},{"last_name":"Huaman","full_name":"Huaman, Nicolas","first_name":"Nicolas"},{"first_name":"Sabrina","full_name":"Amft, Sabrina","last_name":"Amft"},{"last_name":"Acar","full_name":"Acar, Yasemin","id":"94636","first_name":"Yasemin"},{"first_name":"Michael","full_name":"Backes, Michael","last_name":"Backes"},{"last_name":"Fahl","full_name":"Fahl, Sascha","first_name":"Sascha"}],"date_created":"2023-09-22T13:02:22Z","publisher":"USENIX Association","date_updated":"2024-06-05T13:01:22Z"},{"status":"public","editor":[{"first_name":"Sonia","full_name":"Chiasson, Sonia","last_name":"Chiasson"}],"type":"conference","publication":"Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021","language":[{"iso":"eng"}],"extern":"1","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"_id":"47269","citation":{"chicago":"Neil, Lorenzo, Elijah Bouma-Sims, Evan Lafontaine, Yasemin Acar, and Bradley Reaves. “Investigating Web Service Account Remediation Advice.” In <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, 359–376. USENIX Association, 2021.","ieee":"L. Neil, E. Bouma-Sims, E. Lafontaine, Y. Acar, and B. Reaves, “Investigating Web Service Account Remediation Advice,” in <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, 2021, pp. 359–376.","ama":"Neil L, Bouma-Sims E, Lafontaine E, Acar Y, Reaves B. Investigating Web Service Account Remediation Advice. In: Chiasson S, ed. <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>. USENIX Association; 2021:359–376.","bibtex":"@inproceedings{Neil_Bouma-Sims_Lafontaine_Acar_Reaves_2021, title={Investigating Web Service Account Remediation Advice}, booktitle={Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021}, publisher={USENIX Association}, author={Neil, Lorenzo and Bouma-Sims, Elijah and Lafontaine, Evan and Acar, Yasemin and Reaves, Bradley}, editor={Chiasson, Sonia}, year={2021}, pages={359–376} }","mla":"Neil, Lorenzo, et al. “Investigating Web Service Account Remediation Advice.” <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i>, edited by Sonia Chiasson, USENIX Association, 2021, pp. 359–376.","short":"L. Neil, E. Bouma-Sims, E. Lafontaine, Y. Acar, B. Reaves, in: S. Chiasson (Ed.), Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021, USENIX Association, 2021, pp. 359–376.","apa":"Neil, L., Bouma-Sims, E., Lafontaine, E., Acar, Y., &#38; Reaves, B. (2021). Investigating Web Service Account Remediation Advice. In S. Chiasson (Ed.), <i>Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021</i> (pp. 359–376). USENIX Association."},"page":"359–376","year":"2021","title":"Investigating Web Service Account Remediation Advice","date_created":"2023-09-22T13:05:16Z","author":[{"last_name":"Neil","full_name":"Neil, Lorenzo","first_name":"Lorenzo"},{"first_name":"Elijah","last_name":"Bouma-Sims","full_name":"Bouma-Sims, Elijah"},{"full_name":"Lafontaine, Evan","last_name":"Lafontaine","first_name":"Evan"},{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"},{"full_name":"Reaves, Bradley","last_name":"Reaves","first_name":"Bradley"}],"publisher":"USENIX Association","date_updated":"2024-06-05T13:03:38Z"},{"title":"Human Factors in Secure Software Development","date_updated":"2024-06-05T12:56:39Z","publisher":"University of Marburg, Germany","date_created":"2023-09-22T13:06:40Z","author":[{"id":"94636","full_name":"Acar, Yasemin","last_name":"Acar","first_name":"Yasemin"}],"year":"2021","citation":{"mla":"Acar, Yasemin. <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany, 2021.","bibtex":"@book{Acar_2021, title={Human Factors in Secure Software Development}, publisher={University of Marburg, Germany}, author={Acar, Yasemin}, year={2021} }","short":"Y. Acar, Human Factors in Secure Software Development, University of Marburg, Germany, 2021.","apa":"Acar, Y. (2021). <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany.","ama":"Acar Y. <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany; 2021.","chicago":"Acar, Yasemin. <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany, 2021.","ieee":"Y. Acar, <i>Human Factors in Secure Software Development</i>. University of Marburg, Germany, 2021."},"language":[{"iso":"eng"}],"extern":"1","_id":"47271","user_id":"14931","department":[{"_id":"34"},{"_id":"858"}],"status":"public","type":"dissertation"},{"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46315","language":[{"iso":"eng"}],"type":"conference","publication":"2021 IEEE Symposium Series on Computational Intelligence (SSCI)","status":"public","abstract":[{"text":"We propose a novel method for automated algorithm selection in the domain of single-objective continuous black-box optimization. In contrast to existing methods, we use convolutional neural networks as the selection apparatus which bases its decision on a so-called ‘fitness map’. This fitness map is a 2D representation of a two dimensional search space where different gray scales indicate the quality of found solutions in certain areas. Our devised approach uses a modular CMA-ES framework which offers the option to create the conventional CMA-ES, CMA-ES with the alternate step-size adaptation and many other variants proposed over the years. In total, 4 608 different configurations are possible where most configurations are of complementary nature. In this proof-of-concept work, we consider a subset of 32 possible configurations. The developed method is evaluated against an excerpt of BBOB functions and its performance is compared against baselines that are commonly used in automated algorithm selection - the best standalone algorithm (configuration) and the best obtainable sequence of configurations. While the results indicate that the use of the fitness map is not superior on every benchmark problem, it indubitably shows its merit on more hard-to-solve problems. This offers a promising perspective for generalizing to other types of optimization problems and problem domains.","lang":"eng"}],"date_created":"2023-08-04T07:25:08Z","author":[{"first_name":"Raphael Patrick","full_name":"Prager, Raphael Patrick","last_name":"Prager"},{"first_name":"Moritz","last_name":"Seiler","id":"105520","full_name":"Seiler, 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_updated":"2024-06-07T07:12:28Z","doi":"10.1109/SSCI50451.2021.9660174","title":"Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization","citation":{"ama":"Prager RP, Seiler M, Trautmann H, Kerschke P. Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization. In: <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>. ; 2021:1-8. doi:<a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>","chicago":"Prager, Raphael Patrick, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization.” In <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8, 2021. <a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">https://doi.org/10.1109/SSCI50451.2021.9660174</a>.","ieee":"R. P. Prager, M. Seiler, H. Trautmann, and P. Kerschke, “Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization,” in <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2021, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>.","mla":"Prager, Raphael Patrick, et al. “Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization.” <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2021, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>.","bibtex":"@inproceedings{Prager_Seiler_Trautmann_Kerschke_2021, title={Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization}, DOI={<a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">10.1109/SSCI50451.2021.9660174</a>}, booktitle={2021 IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Prager, Raphael Patrick and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, year={2021}, pages={1–8} }","short":"R.P. Prager, M. Seiler, H. Trautmann, P. Kerschke, in: 2021 IEEE Symposium Series on Computational Intelligence (SSCI), 2021, pp. 1–8.","apa":"Prager, R. P., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2021). Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization. <i>2021 IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 1–8. <a href=\"https://doi.org/10.1109/SSCI50451.2021.9660174\">https://doi.org/10.1109/SSCI50451.2021.9660174</a>"},"page":"1-8","year":"2021"},{"year":"2021","place":"Virtual Event","page":"1–14","citation":{"ama":"Assenmacher D, Niemann M, Müller K, Seiler M, Riehle DM, Trautmann H. RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets. In: <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>. ; 2021:1–14.","chicago":"Assenmacher, Dennis, Marco Niemann, Kilian Müller, Moritz Seiler, Dennis M. Riehle, and Heike Trautmann. “RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets.” In <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 1–14. Virtual Event, 2021.","ieee":"D. Assenmacher, M. Niemann, K. Müller, M. Seiler, D. M. Riehle, and H. Trautmann, “RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets,” in <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 2021, pp. 1–14.","apa":"Assenmacher, D., Niemann, M., Müller, K., Seiler, M., Riehle, D. M., &#38; Trautmann, H. (2021). RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets. <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 1–14.","mla":"Assenmacher, Dennis, et al. “RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets.” <i>Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)</i>, 2021, pp. 1–14.","bibtex":"@inproceedings{Assenmacher_Niemann_Müller_Seiler_Riehle_Trautmann_2021, place={Virtual Event}, title={RP-Mod &#38; RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets}, booktitle={Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)}, author={Assenmacher, Dennis and Niemann, Marco and Müller, Kilian and Seiler, Moritz and Riehle, Dennis M. and Trautmann, Heike}, year={2021}, pages={1–14} }","short":"D. Assenmacher, M. Niemann, K. Müller, M. Seiler, D.M. Riehle, H. Trautmann, in: Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021), Virtual Event, 2021, pp. 1–14."},"title":"RP-Mod & RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets","date_updated":"2024-06-07T07:13:04Z","date_created":"2023-08-04T07:22:59Z","author":[{"first_name":"Dennis","full_name":"Assenmacher, Dennis","last_name":"Assenmacher"},{"first_name":"Marco","full_name":"Niemann, Marco","last_name":"Niemann"},{"last_name":"Müller","full_name":"Müller, Kilian","first_name":"Kilian"},{"first_name":"Moritz","last_name":"Seiler","full_name":"Seiler, Moritz","id":"105520"},{"first_name":"Dennis M.","full_name":"Riehle, Dennis M.","last_name":"Riehle"},{"first_name":"Heike","full_name":"Trautmann, Heike","id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282"}],"abstract":[{"lang":"eng","text":"Abuse and hate are penetrating social media and many comment sections of news media companies. These platform providers invest considerable efforts to mod- erate user-generated contributions to prevent losing readers who get appalled by inappropriate texts. This is further enforced by legislative actions, which make non-clearance of these comments a punishable action. While (semi-)automated solutions using Natural Language Processing and advanced Machine Learning techniques are getting increasingly sophisticated, the domain of abusive language detection still struggles as large non-English and well-curated datasets are scarce or not publicly available. With this work, we publish and analyse the largest annotated German abusive language comment datasets to date. In contrast to existing datasets, we achieve a high labelling standard by conducting a thorough crowd-based an- notation study that complements professional moderators’ decisions, which are also included in the dataset. We compare and cross-evaluate the performance of baseline algorithms and state-of-the-art transformer-based language models, which are fine-tuned on our datasets and an existing alternative, showing the usefulness for the community."}],"status":"public","publication":"Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)","type":"conference","language":[{"iso":"eng"}],"_id":"46312","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504"},{"doi":"10.1145/3450218.3477308","title":"On the Potential of Normalized TSP Features for Automated Algorithm Selection","date_created":"2023-08-04T07:23:57Z","author":[{"last_name":"Heins","full_name":"Heins, Jonathan","first_name":"Jonathan"},{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob"},{"first_name":"Janina","full_name":"Pohl, Janina","last_name":"Pohl"},{"first_name":"Moritz","id":"105520","full_name":"Seiler, Moritz","last_name":"Seiler"},{"id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"}],"publisher":"Association for Computing Machinery","date_updated":"2024-06-10T11:57:04Z","citation":{"apa":"Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., &#38; Kerschke, P. (2021). On the Potential of Normalized TSP Features for Automated Algorithm Selection. In  for Computing Machinery Association (Ed.), <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)</i> (pp. 1–15). Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3450218.3477308\">https://doi.org/10.1145/3450218.3477308</a>","short":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, in:  for Computing Machinery Association (Ed.), Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI), Association for Computing Machinery, Dornbirn, Austria, 2021, pp. 1–15.","mla":"Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI)</i>, edited by for Computing Machinery Association, Association for Computing Machinery, 2021, pp. 1–15, doi:<a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>.","bibtex":"@inproceedings{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2021, place={Dornbirn, Austria}, title={On the Potential of Normalized TSP Features for Automated Algorithm Selection}, DOI={<a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>}, booktitle={Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)}, publisher={Association for Computing Machinery}, author={Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}, editor={Computing Machinery Association, for}, year={2021}, pages={1–15} }","ieee":"J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On the Potential of Normalized TSP Features for Automated Algorithm Selection,” in <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)</i>, 2021, pp. 1–15, doi: <a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>.","chicago":"Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated Algorithm Selection.” In <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI)</i>, edited by for Computing Machinery Association, 1–15. Dornbirn, Austria: Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3450218.3477308\">https://doi.org/10.1145/3450218.3477308</a>.","ama":"Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential of Normalized TSP Features for Automated Algorithm Selection. In: Computing Machinery Association  for, ed. <i>Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of Genetic Algorithms (FOGA XVI)</i>. Association for Computing Machinery; 2021:1–15. doi:<a href=\"https://doi.org/10.1145/3450218.3477308\">10.1145/3450218.3477308</a>"},"page":"1–15","year":"2021","place":"Dornbirn, Austria","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46313","status":"public","editor":[{"first_name":"for","full_name":"Computing Machinery Association, for","last_name":"Computing Machinery Association"}],"abstract":[{"text":"Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plethora of features have been suggested. Most of these features are, if at all, only normalized imprecisely raising the issue of feature values being strongly affected by the instance size. Such artifacts may have detrimental effects on algorithm selection models. We propose a normalization for two feature groups which stood out in multiple AS studies on the TSP: (a) features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph (NNG) transformation of the input instance. To this end we theoretically derive minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs. We analyze the differences in feature space between normalized versions of these features and their unnormalized counterparts. Our empirical investigations on various TSP benchmark sets point out that the feature scaling succeeds in eliminating the effect of the instance size. Eventually, a proof-of-concept AS-study shows promising results: models trained with normalized features tend to outperform those trained with the respective vanilla features.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)"},{"year":"2021","date_created":"2021-08-09T15:45:09Z","title":"Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe","abstract":[{"text":"Mit der zunehmenden Bedeutung von digitalen Lösungen und innovativen Dienstleistungen geht eine signifikante Transformation des produzierenden Gewerbes einher. Die Digitalisierung führt zu intelligenten Produkten, die Daten generieren und über das Internet austauschen. Auf Basis dieser Daten können Produkthersteller gänzlich neue digitale Dienstleistungen anbieten, sogenannte Smart Services. Ihre erfolgreiche Umsetzung ist essentiell, um in der Wettbewerbsarena der Zukunft bestehen zu können. Die Gestaltung eines Smart Service-Geschäfts ist jedoch nicht trivial. Ziel der vorliegenden Arbeit ist eine Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe. Die Systematik besteht aus drei Bestandteilen: der Erste ist die Konzeption von Smart Service-Strategien im Sinne eines Referenzmodells. Sie definiert die auszugestaltenden Aspekte. Der Zweite ist das Gestaltungswissen. Es werden Normstrategien und Funktionalitäten im Kontext von Smart Services für die Strategieentwicklung bereitgestellt. Die Strategieentwicklung wird im dritten Bestandteil adressiert, einer Methode bestehend aus einem Vorgehensmodell und unterstützenden Hilfsmitteln. Das Vorgehensmodell orchestriert den Einsatz der Hilfsmittel und des Gestaltungswissens. Resultat ist eine Smart Service-Strategie, die die Vision für das Smart Service-Geschäft sowie den Weg zu deren Realisierung darstellt. Die Systematik wurde anhand eines Unternehmens des Sondermaschinenbaus erfolgreich validiert.","lang":"ger"},{"lang":"eng","text":"The increasing importance of digital solutions and innovative services is accompanied by a significant transformation of manufacturing. Digitalization leads to intelligent products that generate data and exchange them via the internet. Based on these data, product manufacturers can offer completely new digital services, so-called smart services. Their successful implementation is essential in order to survive in the competitive arena of the future. However, the design of a smart service-business is not trivial.The goal of this dissertation is a procedure for the development of smart service-strategies in manufacturing. It consists of three components: the first one is the conceptualization of smart service-strategies in the sense of a reference model. It defines the aspects to be determined during strategy development. The second component is design knowledge. It provides standard strategies and functionalities in the context of smart services for the development of the strategy. This is done using the third component, a method consisting of a process model and corresponding tools. The process model orchestrates the use of the tools and the design knowledge. The result is a smart service-strategy, which includes the vision for the smart service-business and the way to its realization. The procedure was successfully validated by means of a company in the field of special-purpose machine construction."}],"file":[{"file_size":47059853,"access_level":"closed","file_name":"Dissertation_Christian_Koldewey(1).pdf","file_id":"23461","date_updated":"2021-08-20T18:35:06Z","creator":"koldewey","date_created":"2021-08-20T18:35:06Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"ddc":["650"],"keyword":["Smart Service","Strategie"],"language":[{"iso":"ger"}],"publication_status":"epub_ahead","publication_identifier":{"isbn":["978-3-947647-18-7"]},"has_accepted_license":"1","place":"Paderborn","jel":["O32"],"citation":{"mla":"Koldewey, Christian. <i>Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe</i>. 2021, pp. 4, 217, A-41, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1167\">10.17619/UNIPB/1-1167</a>.","short":"C. Koldewey, Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe, Paderborn, 2021.","bibtex":"@book{Koldewey_2021, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe}, volume={399}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1167\">10.17619/UNIPB/1-1167</a>}, author={Koldewey, Christian}, year={2021}, pages={4, 217, A-41}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","apa":"Koldewey, C. (2021). <i>Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe</i> (Vol. 399, pp. 4, 217, A-41). <a href=\"https://doi.org/10.17619/UNIPB/1-1167\">https://doi.org/10.17619/UNIPB/1-1167</a>","chicago":"Koldewey, Christian. <i>Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe</i>. Vol. 399. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Paderborn, 2021. <a href=\"https://doi.org/10.17619/UNIPB/1-1167\">https://doi.org/10.17619/UNIPB/1-1167</a>.","ieee":"C. Koldewey, <i>Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe</i>, vol. 399. Paderborn, 2021, pp. 4, 217, A-41.","ama":"Koldewey C. <i>Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe</i>. Vol 399.; 2021:4, 217, A-41. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1167\">10.17619/UNIPB/1-1167</a>"},"intvolume":"       399","page":"4, 217, A-41","date_updated":"2024-07-12T12:05:50Z","supervisor":[{"full_name":"Gausemeier, Jürgen","last_name":"Gausemeier","first_name":"Jürgen"},{"full_name":"Stark, Rainer","last_name":"Stark","first_name":"Rainer"}],"author":[{"first_name":"Christian","id":"43136","full_name":"Koldewey, Christian","last_name":"Koldewey","orcid":"https://orcid.org/0000-0001-7992-6399"}],"volume":399,"doi":"10.17619/UNIPB/1-1167","type":"dissertation","status":"public","_id":"23379","user_id":"1112","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","department":[{"_id":"563"},{"_id":"26"}],"file_date_updated":"2021-08-20T18:35:06Z"}]