@misc{54385,
  author       = {{Ewe, Frederik}},
  title        = {{{Fließfähigkeit von Schüttgütern bei erhöhten Temperaturen (Studienarbeit)}}},
  year         = {{2021}},
}

@article{27508,
  abstract     = {{<jats:p>To analyze the influence of suspension kinematics on tire wear, detailed simulation models are required. In this study, a non-linear, flexible multibody model of a rear axle system is built up in the simulation software MSC Adams/View. The physical model comprises the suspension kinematics, compliance, and dynamics as well as the non-linear behavior of the tire using the FTire model. FTire is chosen because it has a separate tire tread model to compute the contact pressure and friction force distribution in the tire contact patch. To build up the simulation model, a large amount of data is needed. Bushings, spring, and damper characteristics are modeled based on measurements. For the structural components (e.g., control arms), reverse engineering techniques are used. The components are 3D-scanned, reworked, and included as a modal reduced finite element (FE)-model using component mode synthesis by Craig–Bampton. Finally, the suspension model is validated by comparing the simulated kinematic and compliance characteristics to experimental results. To investigate the interaction of suspension kinematics and tire wear, straight line driving events, such as acceleration, driving with constant velocity, and deceleration, are simulated with different setups of wheel suspension kinematics. The influence of the setups on the resulting friction work between tire and road is examined, and an exemplarily calculation of tire wear based on a validated FTire tire model is carried out. The results demonstrate, on the one hand, that the chosen concept of elasto-kinematic axle leads to a relatively good match with experimental results and, on the other hand, that there are significant possibilities to reduce tire wear by adjusting the suspension kinematics.</jats:p>}},
  author       = {{Schütte, Jan and Sextro, Walter}},
  issn         = {{2624-8921}},
  journal      = {{Vehicles}},
  pages        = {{233--256}},
  title        = {{{Tire Wear Reduction Based on an Extended Multibody Rear Axle Model}}},
  doi          = {{10.3390/vehicles3020015}},
  year         = {{2021}},
}

@inbook{54307,
  author       = {{Janus, Richard}},
  booktitle    = {{Er ist unser Friede. Lesepredigten 1. Advent 2021 bis Pfingstmontag 2022. Textreihe IV/1}},
  editor       = {{Schult, Maike}},
  pages        = {{234--239}},
  publisher    = {{Evangelischer Verlagsanstalt}},
  title        = {{{Jubilate (08.05.2022): 1. Mose 1,1-4a.26-28.31a; 2, 1-4a}}},
  year         = {{2021}},
}

@article{54514,
  author       = {{Risse, Sylvia and Scholle, Oliver}},
  journal      = {{Praxis Deutsch}},
  number       = {{285}},
  pages        = {{31--37}},
  title        = {{{"Durch die Synästhesie wird deutlich, dass..." Die Wirklung sprachlicher Mittel in Gedichten erklären}}},
  volume       = {{48}},
  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}},
}

@inproceedings{54539,
  author       = {{Bauer, Maike}},
  location     = {{Essen (online)}},
  title        = {{{Diaspora-Literatures in the EFL Classroom – A new Didactic Impulse?}}},
  year         = {{2021}},
}

@article{49463,
  author       = {{Trang, Simon Thanh-Nam and Nastjuk, I.}},
  journal      = {{Computers & Security}},
  title        = {{{Examining the role of stress and information security policy design in information security compliance behaviour: An experimental study of in-task behaviour}}},
  volume       = {{104}},
  year         = {{2021}},
}

@article{49464,
  author       = {{Trang, Simon Thanh-Nam and Weiger, W.}},
  journal      = {{Computers in Human Behavior}},
  title        = {{{The perils of gamification: Does engaging with gamified services increase users’ willingness to disclose personal information?}}},
  volume       = {{116}},
  year         = {{2021}},
}

@article{49462,
  author       = {{Brendel, A.B. and Greve, M. and Masuch, K. and Trang, Simon Thanh-Nam}},
  journal      = {{HMD Praxis der Wirtschaftsinformatik}},
  pages        = {{698–711}},
  title        = {{{Corona Tracing Apps – Eine Analyse und Strukturierung des europäischen Marktes}}},
  volume       = {{58}},
  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}},
}

@inproceedings{45840,
  abstract     = {{<jats:p>Argumentation is a widely applied framework for modeling and evaluating arguments and its reasoning with various applications. Popular frameworks are abstract argumentation (Dung’s framework) or logic-based argumentation (Besnard-Hunter’s framework). Their computational complexity has been studied quite in-depth. Incorporating treewidth into the complexity analysis is particularly interesting, as solvers oftentimes employ SAT-based solvers, which can solve instances of low treewidth fast. In this paper, we address whether one can design reductions from argumentation problems to SAT-problems while linearly preserving the treewidth, which results in decomposition-guided (DG) reductions. It turns out that the linear treewidth overhead caused by our DG reductions, cannot be significantly improved under reasonable assumptions. Finally, we consider logic-based argumentation and establish new upper bounds using DG reductions and lower bounds.</jats:p>}},
  author       = {{Fichte, Johannes and Hecher, Markus and Mahmood, Yasir and Meier, Arne}},
  booktitle    = {{Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence}},
  publisher    = {{International Joint Conferences on Artificial Intelligence Organization}},
  title        = {{{Decomposition-Guided Reductions for Argumentation and Treewidth}}},
  doi          = {{10.24963/ijcai.2021/259}},
  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{45841,
  abstract     = {{<jats:p>Logic-based argumentation is a well-established formalism modeling nonmonotonic reasoning. It has been playing a major role in AI for decades, now.  Informally, a set of formulas is the support for a given claim if it is consistent, subset-minimal, and implies the claim. In such a case, the pair of the support and the claim together is called an argument. In this paper, we study the propositional variants of the following three computational tasks studied in argumentation: ARG (exists a support for a given claim with respect to a given set of formulas), ARG-Check (is a given set a support for a given claim), and ARG-Rel (similarly as ARG plus requiring an additionally given formula to be contained in the support). ARG-Check is complete for the complexity class DP, and the other two problems are known to be complete for the second level of the polynomial hierarchy and, accordingly, are highly intractable. Analyzing the reason for this intractability, we perform a two-dimensional classification: first, we consider all possible propositional fragments of the problem within Schaefer's framework, and then study different parameterizations for each of the fragment.
We identify a list of reasonable structural parameters (size of the claim, support, knowledge-base) that are connected to the aforementioned decision problems. Eventually, we thoroughly draw a fine border of parameterized intractability for each of the problems showing where the problems are fixed-parameter tractable and when this exactly stops. Surprisingly, several cases are of very high intractability (paraNP and beyond).</jats:p>}},
  author       = {{Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}},
  booktitle    = {{Proceedings of the AAAI Conference on Artificial Intelligence}},
  issn         = {{2374-3468}},
  keywords     = {{General Medicine}},
  number       = {{7}},
  pages        = {{6426--6434}},
  publisher    = {{Association for the Advancement of Artificial Intelligence (AAAI)}},
  title        = {{{Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework}}},
  doi          = {{10.1609/aaai.v35i7.16797}},
  volume       = {{35}},
  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}},
}