@inbook{57863, author = {{Alptekin, Mesut and Temmen, Katrin}}, booktitle = {{Smart Technologies for a Sustainable Future}}, editor = {{Auer, Michael E. and Langmann, Reinhard and May, Dominik and Roos, Kim}}, isbn = {{978-3-031-61890-1 978-3-031-61891-8}}, pages = {{297–304}}, publisher = {{Springer Nature Switzerland}}, title = {{{Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses}}}, doi = {{10.1007/978-3-031-61891-8_29}}, volume = {{1027}}, year = {{2024}}, } @article{54459, author = {{Knorr, Lukas and Schlosser, Florian and Horstmann, Nils and Divkovic, Denis and Meschede, Henning}}, issn = {{0306-2619}}, journal = {{Applied Energy}}, publisher = {{Elsevier BV}}, title = {{{Flexible operation and integration of high-temperature heat pumps using large temperature glides}}}, doi = {{10.1016/j.apenergy.2024.123417}}, volume = {{368}}, year = {{2024}}, } @inproceedings{55637, author = {{Kostan, Anastassija and Olschar, Sara and Simko, Lucy and Acar, Yasemin}}, booktitle = {{33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024}}, editor = {{Balzarotti, Davide and Xu, Wenyuan}}, publisher = {{USENIX Association}}, title = {{{Exploring digital security and privacy in relative poverty in Germany through qualitative interviews}}}, year = {{2024}}, } @inbook{59581, author = {{Häsel-Weide, Uta and Nührenbörger, M.}}, booktitle = {{Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik}}, editor = {{Ebers, P. and Rösken, F. and Barzel, B. and Büchter, A. and Schacht, F. and Scherer, P.}}, pages = {{207--210}}, title = {{{ Praktiken der Förderung im inklusiven Mathematikunterricht}}}, doi = {{https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0}}, year = {{2024}}, } @article{61172, author = {{Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, publisher = {{Elsevier BV}}, title = {{{Routing Schemes for Hybrid Communication Networks}}}, doi = {{10.1016/j.tcs.2023.114352}}, volume = {{985}}, year = {{2024}}, } @inproceedings{57240, abstract = {{Validating assertions before adding them to a knowledge graph is an essential part of its creation and maintenance. Due to the sheer size of knowledge graphs, automatic fact-checking approaches have been developed. These approaches rely on reference knowledge to decide whether a given assertion is correct. Recent hybrid approaches achieve good results by including several knowledge sources. However, it is often impractical to provide a sheer quantity of textual knowledge or generate embedding models to leverage these hybrid approaches. We present FaVEL, an approach that uses algorithm selection and ensemble learning to amalgamate several existing fact-checking approaches that rely solely on a reference knowledge graph and, hence, use fewer resources than current hybrid approaches. For our evaluation, we create updated versions of two existing datasets and a new dataset dubbed FaVEL-DS. Our evaluation compares our approach to 15 fact-checking approaches—including the state-of-the-art approach HybridFC—on 3 datasets. Our results demonstrate that FaVEL outperforms all other approaches significantly by at least 0.04 in terms of the area under the ROC curve. Our source code, datasets, and evaluation results are open-source and can be found at https://github.com/dice-group/favel.}}, author = {{Qudus, Umair and Röder, Michael and Tatkeu Pekarou, Franck Lionel and Morim da Silva, Ana Alexandra and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{EKAW 2024}}, editor = {{Rospocher, Marco}}, keywords = {{fact checking, ensemble learning, transfer learning, knowledge management.}}, location = {{Amsterdam, Netherlands}}, title = {{{FaVEL: Fact Validation Ensemble Learning}}}, year = {{2024}}, } @inproceedings{58377, abstract = {{The connection between inconsistent databases and Dung's abstract argumentation framework has recently drawn growing interest. Specifically, an inconsistent database, involving certain types of integrity constraints such as functional and inclusion dependencies, can be viewed as an argumentation framework in Dung's setting. Nevertheless, no prior work has explored the exact expressive power of Dung's theory of argumentation when compared to inconsistent databases and integrity constraints. In this paper, we close this gap by arguing that an argumentation framework can also be viewed as an inconsistent database. We first establish a connection between subset-repairs for databases and extensions for AFs, considering conflict-free, naive, admissible, and preferred semantics. Further, we define a new family of attribute-based repairs based on the principle of maximal content preservation. The effectiveness of these repairs is then highlighted by connecting them to stable, semi-stable, and stage semantics. Our main contributions include translating an argumentation framework into a database together with integrity constraints. Moreover, this translation can be achieved in polynomial time, which is essential in transferring complexity results between the two formalisms.}}, author = {{Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}}, title = {{{Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases}}}, doi = {{10.1609/AAAI.V39I14.33651}}, year = {{2024}}, } @inbook{57238, abstract = {{Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extensions) of arguments that allow AFs to be evaluated. For more expressiveness, AFs are augmented with acceptance conditions on directly interacting arguments or a constraint on the admissible sets of arguments, resulting in dialectic frameworks or constrained argumentation frameworks. In this paper, we consider flexible conditions for rejecting an argument from an extension, which we call rejection conditions (RCs). On the technical level, we associate each argument with a specific logic program. We analyze the resulting complexity, including the structural parameter treewidth. Rejection AFs are highly expressive, giving rise to natural problems on higher levels of the polynomial hierarchy.}}, author = {{Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}}, booktitle = {{Frontiers in Artificial Intelligence and Applications}}, isbn = {{9781643685489}}, issn = {{0922-6389}}, location = {{Santiago de Compostela, Spain}}, publisher = {{IOS Press}}, title = {{{Rejection in Abstract Argumentation: Harder Than Acceptance?}}}, doi = {{10.3233/faia240867}}, year = {{2024}}, } @inproceedings{55655, abstract = {{Argumentation is a well-established formalism for nonmonotonic reasoning, with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms support for a claim if it is consistent, subset-minimal, and implies the claim. Then, an argument comprises support and a claim. We observe that the computational task (ARG) of asking for support of a claim in a knowledge base is “brave”, since many claims with a single support are accepted. As a result, ARG falls short when it comes to the question of confidence in a claim, or claim strength. In this paper, we propose a concept for measuring the (acceptance) strength of claims, based on counting supports for a claim. Further, we settle classical and structural complexity of counting arguments favoring a given claim in propositional knowledge bases (KBs). We introduce quantitative reasoning to measure the strength of claims in a KB and to determine the relevance strength of a formula for a claim.}}, author = {{Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}}, booktitle = {{Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence}}, publisher = {{International Joint Conferences on Artificial Intelligence Organization}}, title = {{{Quantitative Claim-Centric Reasoning in Logic-Based Argumentation}}}, doi = {{10.24963/ijcai.2024/377}}, year = {{2024}}, } @unpublished{57814, abstract = {{We study consistent query answering via different graph representations. First, we introduce solution-conflict hypergraphs in which nodes represent facts and edges represent either conflicts or query solutions. Considering a monotonic query and a set of antimonotonic constraints, we present an explicit algorithm for counting the number of repairs satisfying the query based on a tree decomposition of the solution-conflict hypergraph. The algorithm not only provides fixed-parameter tractability results for data complexity over expressive query and constraint classes, but also introduces a novel and potentially implementable approach to repair counting. Second, we consider the Gaifman graphs arising from MSO descriptions of consistent query answering. Using a generalization of Courcelle's theorem, we then present fixed-parameter tractability results for combined complexity over expressive query and constraint classes.}}, author = {{Hankala, Teemu and Hannula, Miika and Mahmood, Yasir and Meier, Arne}}, booktitle = {{arXiv:2412.08324}}, title = {{{Parameterised Complexity of Consistent Query Answering via Graph Representations}}}, year = {{2024}}, } @inproceedings{56140, abstract = {{ Android apps collecting data from users must comply with legal frameworks to ensure data protection. This requirement has become even more important since the implementation of the General Data Protection Regulation (GDPR) by the European Union in 2018. Moreover, with the proposed Cyber Resilience Act on the horizon, stakeholders will soon need to assess software against even more stringent security and privacy standards. Effective privacy assessments require collaboration among groups with diverse expertise to function effectively as a cohesive unit. This paper motivates the need for an automated approach that enhances understanding of data protection in Android apps and improves communication between the various parties involved in privacy assessments. We propose the Assessor View, a tool designed to bridge the knowledge gap between these parties, facilitating more effective privacy assessments of Android applications. }}, author = {{Khedkar, Mugdha and Schlichtig, Michael and Bodden, Eric}}, booktitle = {{In Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW ’24)}}, location = {{Sacramento, California}}, title = {{{Advancing Android Privacy Assessments with Automation}}}, doi = {{10.1145/3691621.3694953}}, year = {{2024}}, } @inproceedings{63658, author = {{Klüttermann, Simon and Rutinowski, Jérôme and Polachowski, Frederik and Nguyen, Anh and Grimme, Britta and Roidl, Moritz and Müller, Emmanuel}}, booktitle = {{2024 International Conference on Machine Learning and Applications (ICMLA)}}, pages = {{1705–1711}}, title = {{{On the Effectiveness of Heterogeneous Ensemble Methods for Re-identification}}}, year = {{2024}}, } @unpublished{58873, abstract = {{We prove that the Patterson-Sullivan and Wigner distributions on the unit sphere bundle of a convex-cocompact hyperbolic surface are asymptotically identical. This generalizes results in the compact case by Anantharaman-Zelditch and Hansen-Hilgert-Schr\"oder.}}, author = {{Delarue, Benjamin and Palmirotta, Guendalina}}, booktitle = {{arXiv:2411.19782}}, title = {{{Patterson-Sullivan and Wigner distributions of convex-cocompact hyperbolic surfaces}}}, year = {{2024}}, } @article{52587, author = {{Bodden, Eric and Pottebaum, Jens and Fockel, Markus and Gräßler, Iris}}, issn = {{1540-7993}}, journal = {{IEEE Security & Privacy}}, keywords = {{Law, Electrical and Electronic Engineering, Computer Networks and Communications}}, number = {{1}}, pages = {{69--72}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Evaluating Security Through Isolation and Defense in Depth}}}, doi = {{10.1109/msec.2023.3336028}}, volume = {{22}}, year = {{2024}}, } @inbook{57154, author = {{Asiimwe, Henry and Bode, Henrik and Bogere, Paul and Freitag, Christine and Mangeni, Teddy}}, booktitle = {{Bildungsmedien für Erwachsene Educational Media for Adults }}, editor = {{Andrzejewska, Ewa and Matthes, Eva and Schütze, Sylvia and Van Wiele, Jan}}, isbn = {{978-3-7815-2670-9}}, pages = {{245–255}}, publisher = {{Verlag Julius Klinkhardt}}, title = {{{Which Media for Whom? The Implementation of Microgrids as a Trigger of Transformational Adult Learning Opportunities in Formal, Informal and Situational Settings in Times of Change}}}, doi = {{10.35468/6126}}, year = {{2024}}, } @inproceedings{56481, author = {{Berganski, Christoph and Jentzsch, Felix and Platzner, Marco and Kuhmichel, Max and Giefers, Heiner}}, location = {{Sydney}}, title = {{{FINN-T: Compiling Custom Dataflow Accelerators for Quantized Transformers}}}, year = {{2024}}, } @misc{54245, author = {{Henke, Luca-Sebastian}}, title = {{{Exploring Custom FPGA Accelerators for DNN-based RF Fingerprinting}}}, year = {{2024}}, } @inproceedings{62047, author = {{Reckmann, Eileen and Temmen, Katrin}}, location = {{Hannover}}, title = {{{Erste Ergebnisse aus einer Interviewstudie mit Workshop-Moderierenden mobiler Schülerlaborangebote an außerschulischen Lernorten}}}, year = {{2024}}, } @inproceedings{50273, abstract = {{The Polynomial-Time Hierarchy ($\mathsf{PH}$) is a staple of classical complexity theory, with applications spanning randomized computation to circuit lower bounds to ''quantum advantage'' analyses for near-term quantum computers. Quantumly, however, despite the fact that at least \emph{four} definitions of quantum $\mathsf{PH}$ exist, it has been challenging to prove analogues for these of even basic facts from $\mathsf{PH}$. This work studies three quantum-verifier based generalizations of $\mathsf{PH}$, two of which are from [Gharibian, Santha, Sikora, Sundaram, Yirka, 2022] and use classical strings ($\mathsf{QCPH}$) and quantum mixed states ($\mathsf{QPH}$) as proofs, and one of which is new to this work, utilizing quantum pure states ($\mathsf{pureQPH}$) as proofs. We first resolve several open problems from [GSSSY22], including a collapse theorem and a Karp-Lipton theorem for $\mathsf{QCPH}$. Then, for our new class $\mathsf{pureQPH}$, we show one-sided error reduction for $\mathsf{pureQPH}$, as well as the first bounds relating these quantum variants of $\mathsf{PH}$, namely $\mathsf{QCPH}\subseteq \mathsf{pureQPH} \subseteq \mathsf{EXP}^{\mathsf{PP}}$.}}, author = {{Agarwal, Avantika and Gharibian, Sevag and Koppula, Venkata and Rudolph, Dorian}}, booktitle = {{Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS)}}, number = {{7}}, pages = {{7--17}}, title = {{{Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds}}}, doi = {{10.4230/LIPIcs.MFCS.2024.7}}, volume = {{306}}, year = {{2024}}, } @inproceedings{50406, abstract = {{What is the power of polynomial-time quantum computation with access to an NP oracle? In this work, we focus on two fundamental tasks from the study of Boolean satisfiability (SAT) problems: search-to-decision reductions, and approximate counting. We first show that, in strong contrast to the classical setting where a poly-time Turing machine requires $\Theta(n)$ queries to an NP oracle to compute a witness to a given SAT formula, quantumly $\Theta(\log n)$ queries suffice. We then show this is tight in the black-box model - any quantum algorithm with "NP-like" query access to a formula requires $\Omega(\log n)$ queries to extract a solution with constant probability. Moving to approximate counting of SAT solutions, by exploiting a quantum link between search-to-decision reductions and approximate counting, we show that existing classical approximate counting algorithms are likely optimal. First, we give a lower bound in the "NP-like" black-box query setting: Approximate counting requires $\Omega(\log n)$ queries, even on a quantum computer. We then give a "white-box" lower bound (i.e. where the input formula is not hidden in the oracle) - if there exists a randomized poly-time classical or quantum algorithm for approximate counting making $o(log n)$ NP queries, then $\text{BPP}^{\text{NP}[o(n)]}$ contains a $\text{P}^{\text{NP}}$-complete problem if the algorithm is classical and $\text{FBQP}^{\text{NP}[o(n)]}$ contains an $\text{FP}^{\text{NP}}$-complete problem if the algorithm is quantum.}}, author = {{Gharibian, Sevag and Kamminga, Jonas}}, booktitle = {{Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP)}}, number = {{70}}, pages = {{1--19}}, title = {{{BQP, meet NP: Search-to-decision reductions and approximate counting}}}, volume = {{297}}, year = {{2024}}, }