@article{48854,
  abstract     = {{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.}},
  author       = {{Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}},
  issn         = {{0178-4617}},
  journal      = {{Algorithmica}},
  keywords     = {{Dynamic optimization, Evolutionary algorithms, Running time analysis}},
  number       = {{10}},
  pages        = {{3148–3179}},
  title        = {{{Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}}},
  doi          = {{10.1007/s00453-021-00838-3}},
  volume       = {{83}},
  year         = {{2021}},
}

@inproceedings{29937,
  author       = {{Karp, Martin and Podobas, Artur and Jansson, Niclas and Kenter, Tobias and Plessl, Christian and Schlatter, Philipp and Markidis, Stefano}},
  booktitle    = {{2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}},
  publisher    = {{IEEE}},
  title        = {{{High-Performance Spectral Element Methods on Field-Programmable Gate Arrays : Implementation, Evaluation, and Future Projection}}},
  doi          = {{10.1109/ipdps49936.2021.00116}},
  year         = {{2021}},
}

@inproceedings{52927,
  author       = {{Gil, Oliver Fernández and Turhan, Anni-Yasmin}},
  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}},
  pages        = {{6340–6348}},
  publisher    = {{AAAI Press}},
  title        = {{{Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics}}},
  doi          = {{10.1609/AAAI.V35I7.16787}},
  year         = {{2021}},
}

@article{52926,
  author       = {{Dubslaff, Clemens and Koopmann, Patrick and Turhan, Anni-Yasmin}},
  journal      = {{Formal Aspects Comput.}},
  number       = {{6}},
  pages        = {{885–921}},
  title        = {{{Enhancing Probabilistic Model Checking with Ontologies}}},
  doi          = {{10.1007/S00165-021-00549-0}},
  volume       = {{33}},
  year         = {{2021}},
}

@inproceedings{22285,
  author       = {{Biermeier, Kai and Yigitbas, Enes and Weidmann, Nils and Engels, Gregor}},
  booktitle    = {{Proceedings of the International Workshop on Human-Centered Software Engineering for Changing Contexts of Use }},
  title        = {{{Ensuring User Interface Adaptation Consistency through Triple Graph Grammers}}},
  year         = {{2021}},
}

@inproceedings{46194,
  author       = {{Kenter, Tobias and Shambhu, Adesh and Faghih-Naini, Sara and Aizinger, Vadym}},
  booktitle    = {{Proceedings of the Platform for Advanced Scientific Computing Conference (PASC)}},
  publisher    = {{ACM}},
  title        = {{{Algorithm-hardware co-design of a discontinuous Galerkin shallow-water model for a dataflow architecture on FPGA}}},
  doi          = {{10.1145/3468267.3470617}},
  year         = {{2021}},
}

@inproceedings{29291,
  author       = {{Zahera, Hamada Mohamed Abdelsamee and Heindorf, Stefan and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Proceedings of the 11th on Knowledge Capture Conference}},
  publisher    = {{ACM}},
  title        = {{{ASSET: A Semi-supervised Approach for Entity Typing in Knowledge Graphs}}},
  doi          = {{10.1145/3460210.3493563}},
  year         = {{2021}},
}

@inbook{54586,
  author       = {{Manzoor, Ali and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web: ESWC 2021 Satellite Events}},
  isbn         = {{9783030804176}},
  issn         = {{0302-9743}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Unsupervised Relation Extraction Using Sentence Encoding}}},
  doi          = {{10.1007/978-3-030-80418-3_25}},
  year         = {{2021}},
}

@article{45844,
  abstract     = {{<jats:title>Abstract</jats:title>
               <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>}},
  author       = {{Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}},
  issn         = {{0955-792X}},
  journal      = {{Journal of Logic and Computation}},
  keywords     = {{Logic, Hardware and Architecture, Arts and Humanities (miscellaneous), Software, Theoretical Computer Science}},
  number       = {{1}},
  pages        = {{266--296}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Parameterized complexity of abduction in Schaefer’s framework}}},
  doi          = {{10.1093/logcom/exaa079}},
  volume       = {{31}},
  year         = {{2021}},
}

@inproceedings{47265,
  author       = {{Huaman, Nicolas and von Skarczinski, Bennet and Stransky, Christian and Wermke, Dominik and Acar, Yasemin and Dreißigacker, Arne and Fahl, Sascha}},
  booktitle    = {{30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}},
  editor       = {{Bailey, Michael and Greenstadt, Rachel}},
  pages        = {{1235–1252}},
  publisher    = {{USENIX Association}},
  title        = {{{A Large-Scale Interview Study on Information Security in and Attacks against Small and Medium-sized Enterprises}}},
  year         = {{2021}},
}

@inproceedings{47268,
  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}},
  booktitle    = {{Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021}},
  editor       = {{Chiasson, Sonia}},
  pages        = {{437–454}},
  publisher    = {{USENIX Association}},
  title        = {{{On the Limited Impact of Visualizing Encryption: Perceptions of E2E Messaging Security}}},
  year         = {{2021}},
}

@inproceedings{47267,
  author       = {{Huaman, Nicolas and Amft, Sabrina and Oltrogge, Marten and Acar, Yasemin and Fahl, Sascha}},
  booktitle    = {{2021 IEEE Symposium on Security and Privacy (SP)}},
  publisher    = {{IEEE}},
  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}},
  year         = {{2021}},
}

@inproceedings{47266,
  author       = {{Haney, Julie M. and Acar, Yasemin and Furman, Susanne}},
  booktitle    = {{30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}},
  editor       = {{Bailey, Michael and Greenstadt, Rachel}},
  pages        = {{411–428}},
  publisher    = {{USENIX Association}},
  title        = {{{"It’s the Company, the Government, You and I": User Perceptions of Responsibility for Smart Home Privacy and Security}}},
  year         = {{2021}},
}

@inproceedings{47264,
  author       = {{Oltrogge, Marten and Huaman, Nicolas and Amft, Sabrina and Acar, Yasemin and Backes, Michael and Fahl, Sascha}},
  booktitle    = {{30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021}},
  editor       = {{Bailey, Michael and Greenstadt, Rachel}},
  pages        = {{4347–4364}},
  publisher    = {{USENIX Association}},
  title        = {{{Why Eve and Mallory Still Love Android: Revisiting TLS (In)Security in Android Applications}}},
  year         = {{2021}},
}

@inproceedings{47269,
  author       = {{Neil, Lorenzo and Bouma-Sims, Elijah and Lafontaine, Evan and Acar, Yasemin and Reaves, Bradley}},
  booktitle    = {{Seventeenth Symposium on Usable Privacy and Security, SOUPS 2021, August 8-10, 2021}},
  editor       = {{Chiasson, Sonia}},
  pages        = {{359–376}},
  publisher    = {{USENIX Association}},
  title        = {{{Investigating Web Service Account Remediation Advice}}},
  year         = {{2021}},
}

@phdthesis{47271,
  author       = {{Acar, Yasemin}},
  publisher    = {{University of Marburg, Germany}},
  title        = {{{Human Factors in Secure Software Development}}},
  year         = {{2021}},
}

@inproceedings{46315,
  abstract     = {{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.}},
  author       = {{Prager, Raphael Patrick and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}},
  booktitle    = {{2021 IEEE Symposium Series on Computational Intelligence (SSCI)}},
  pages        = {{1--8}},
  title        = {{{Towards Feature-Free Automated Algorithm Selection for Single-Objective Continuous Black-Box Optimization}}},
  doi          = {{10.1109/SSCI50451.2021.9660174}},
  year         = {{2021}},
}

@inproceedings{46312,
  abstract     = {{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.}},
  author       = {{Assenmacher, Dennis and Niemann, Marco and Müller, Kilian and Seiler, Moritz and Riehle, Dennis M. and Trautmann, Heike}},
  booktitle    = {{Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1 (NeurIPS Datasets and Benchmarks 2021)}},
  pages        = {{1–14}},
  title        = {{{RP-Mod & RP-Crowd: Moderator- and Crowd-Annotated German News Comment Datasets}}},
  year         = {{2021}},
}

@inproceedings{46313,
  abstract     = {{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.}},
  author       = {{Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}},
  booktitle    = {{Proceedings of the 16$^th$ ACM/SIGEVO Conference on Foundations of genetic Algorithms (FOGA XVI)}},
  editor       = {{Computing Machinery Association, for}},
  pages        = {{1–15}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{On the Potential of Normalized TSP Features for Automated Algorithm Selection}}},
  doi          = {{10.1145/3450218.3477308}},
  year         = {{2021}},
}

@phdthesis{23379,
  abstract     = {{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.}},
  author       = {{Koldewey, Christian}},
  isbn         = {{978-3-947647-18-7}},
  keywords     = {{Smart Service, Strategie}},
  pages        = {{4, 217, A--41}},
  title        = {{{Systematik zur Entwicklung von Smart Service-Strategien im produzierenden Gewerbe}}},
  doi          = {{10.17619/UNIPB/1-1167}},
  volume       = {{399}},
  year         = {{2021}},
}