@article{60189, abstract = {{AbstractSeveral state‐of‐the‐art algorithms for semi‐structured hexahedral meshing involve a so called quantization step to decide on the integer DoFs of the meshing problem, corresponding to the number of hexahedral elements to embed into certain regions of the domain. Existing reliable methods for quantization are based on solving a sequence of integer quadratic programs (IQP). Solving these in a timely and predictable manner with general‐purpose solvers is a challenge, even more so in the open‐source field. We present here an alternative robust and efficient quantization scheme that is instead based on solving a series of continuous linear programs (LP), for which solver availability and efficiency are not an issue. In our formulation, such LPs are used to determine where inflation or deflation of virtual hexahedral sheets are favorable. We compare our method to two implementations of the former IQP formulation (using a commercial and an open‐source MIP solver, respectively), finding that (a) the solutions found by our method are near‐optimal or optimal in most cases, (b) these solutions are found within a much more predictable time frame, and (c) the state of the art run time is outperformed, in the case of using the open‐source solver by orders of magnitude.}}, author = {{Brückler, Hendrik and Bommes, David and Campen, Marcel}}, issn = {{0167-7055}}, journal = {{Comput. Graph. Forum}}, number = {{5}}, publisher = {{Wiley}}, title = {{{Integer‐Sheet‐Pump Quantization for Hexahedral Meshing}}}, doi = {{10.1111/cgf.15131}}, volume = {{43}}, year = {{2024}}, } @article{60240, author = {{Ludwig, Ingmar and Campen, Marcel}}, journal = {{Comput. Graph. Forum}}, number = {{7}}, pages = {{i–xxii}}, title = {{{Strictly Conservative Neural Implicits}}}, doi = {{10.1111/CGF.15241}}, volume = {{43}}, year = {{2024}}, } @article{60314, abstract = {{A method for the construction of bijective volumetric maps between 3D shapes is presented. Arbitrary shapes of ball-topology are supported, overcoming restrictions of previous methods to convex or star-shaped targets. In essence, the mapping problem is decomposed into a set of simpler mapping problems, each of which can be solved with previous methods for discrete star-shaped mapping problems. Addressing the key challenges in this endeavor, algorithms are described to reliably construct structurally compatible partitions of two shapes with constraints regarding star-shapedness and to compute a parsimonious common refinement of two triangulations.}}, author = {{Hinderink, Steffen and Brückler, Hendrik and Campen, Marcel}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--11}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Bijective Volumetric Mapping via Star Decomposition}}}, doi = {{10.1145/3687950}}, volume = {{43}}, year = {{2024}}, } @article{60331, abstract = {{ We present a novel algorithm to map ball-topology tetrahedral meshes onto star-shaped domains with guarantees regarding bijectivity. Our algorithm is based on the recently introduced idea of Shrink-and-Expand, where images of interior vertices are initially clustered at one point (Shrink-), before being sequentially moved to non-degenerate positions yielding a bijective map (-and-Expand). In this context, we introduce the concept of the cluster mesh , i.e. the unexpanded interior mesh consisting of geometrically degenerate simplices. Using local, per-vertex connectivity information solely from the cluster mesh, we show that a viable expansion sequence guaranteed to produce a bijective map can always be found as long as the mesh is shellable. In addition to robustness guarantees for this ubiquitous class of inputs, other practically relevant benefits include improved parsimony and reduced algorithmic complexity. While inheriting some of the worst-case high run time requirements of the state of the art, significant acceleration for the average case is experimentally demonstrated. }}, author = {{Nigolian, Valentin Zénon and Campen, Marcel and Bommes, David}}, issn = {{0730-0301}}, journal = {{ACM Transactions on Graphics}}, number = {{6}}, pages = {{1--14}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{A Progressive Embedding Approach to Bijective Tetrahedral Maps driven by Cluster Mesh Topology}}}, doi = {{10.1145/3687992}}, volume = {{43}}, year = {{2024}}, } @inproceedings{57085, abstract = {{We propose an approach for simultaneous diarization and separation of meeting data. It consists of a complex Angular Central Gaussian Mixture Model (cACGMM) for speech source separation, and a von-Mises-Fisher Mixture Model (VMFMM) for diarization in a joint statistical framework. Through the integration, both spatial and spectral information are exploited for diarization and separation. We also develop a method for counting the number of active speakers in a segment of a meeting to support block-wise processing. While the total number of speakers in a meeting may be known, it is usually not known on a per-segment level. With the proposed speaker counting, joint diarization and source separation can be done segment-by-segment, and the permutation problem across segments is solved, thus allowing for block-online processing in the future. Experimental results on the LibriCSS meeting corpus show that the integrated approach outperforms a cascaded approach of diarization and speech enhancement in terms of WER, both on a per-segment and on a per-meeting level.}}, author = {{Cord-Landwehr, Tobias and Boeddeker, Christoph and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}}, keywords = {{diarization, source separation, mixture model, meeting}}, location = {{Hyderabad, India}}, title = {{{Simultaneous Diarization and Separation of Meetings through the Integration of Statistical Mixture Models}}}, doi = {{10.1109/ICASSP49660.2025.10888445}}, year = {{2024}}, } @inproceedings{53659, author = {{Cord-Landwehr, Tobias and Boeddeker, Christoph and Zorilă, Cătălin and Doddipatla, Rama and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}}, location = {{Seoul}}, publisher = {{IEEE}}, title = {{{Geodesic Interpolation of Frame-Wise Speaker Embeddings for the Diarization of Meeting Scenarios}}}, doi = {{10.1109/icassp48485.2024.10445911}}, year = {{2024}}, } @inproceedings{57864, abstract = {{This book includes the proceedings of the 21st International Conference on Smart Technologies & Education (STE2024). The "International Conference on Smart Technologies & Education" (STE) is an annual global meeting dedicated to the fundamentals, applications, and experiences in the field of Smart Technologies, Online, Remote, and Virtual Engineering, Virtual Instrumentation, and other related new technologies. Nowadays, online and smart technologies are the core of most fields of engineering and the whole society. Consequently, the motto of this year’s STE2024 was "Smart Technologies for a Sustainable Future". The STE conference is the successor of the long-standing annual REV Conferences and the annual meeting of the International Association of Online Engineering (IAOE) together with the EduNet World Association (EWA) and the International Education Network (EduNet). In a globally connected world, the interest in online collaboration, teleworking, remote services, and other digital working environments is rapidly increasing. In response to that, the general objective of this conference is to contribute and discuss fundamentals, applications, and experiences in the field of Online and Remote Engineering, Virtual Instrumentation, and other related new technologies like Cross Reality, Open Science and Big Data, Internet of Things and Industrial Internet of Things, Industry 4.0, Cyber Security, and M2M and Smart Objects. Another objective of the conference is to discuss guidelines and new concepts for engineering education in higher and vocational education institutions, including emerging technologies in learning, MOOCs and MOOLs, and Open Resources. This year, STE2024 has been organized in Helsinki, Finland as an onsite event supporting remote presentations, from March 6 until March 8, 2024. The co-organizers of STE2024 were the Arcada University of Applied Sciences, the International Association of Online Engineering (IAOE) together with the Global Online Laboratory Consortium (GOLC), the International Education Network (EduNet), and the EduNet World Association (EWA). STE2024 has attracted 140 scientists and industrial leaders from more than 40 countries}}, author = {{Alptekin, Mesut and Temmen, Katrin}}, booktitle = {{Smart Technologies for a Sustainable Future: Proceedings of the 21st International Conference on Smart Technologies & Education. Volume 1}}, isbn = {{3-031-61891-2 978-3-031-61891-8}}, pages = {{297}}, publisher = {{Springer Nature}}, title = {{{Extended Results for Effectiveness Study of an Augmented Reality App as Preparation Tool for Electrical Engineering Laboratory Courses}}}, volume = {{1}}, year = {{2024}}, } @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}}, }