@article{61042, abstract = {{We introduce the concept of a k-token signed graph and study some of its combinatorial and algebraic properties. We prove that two switching isomorphic signed graphs have switching isomorphic token graphs. Moreover, we show that the Laplacian spectrum of a balanced signed graph is contained in the Laplacian spectra of its k-token signed graph. Besides, we introduce and study the unbalance level of a signed graph, which is a new parameter that measures how far a signed graph is from being balanced. Moreover, we study the relation between the frustration index and the unbalance level of signed graphs and their token signed graphs.}}, author = {{Dalfó, C. and Fiol, M. A. and Steffen, Eckhard}}, issn = {{0925-9899}}, journal = {{Journal of Algebraic Combinatorics}}, number = {{1}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{On token signed graphs}}}, doi = {{10.1007/s10801-025-01416-4}}, volume = {{62}}, year = {{2025}}, } @inproceedings{61047, author = {{Rautenberg, Frederik and Seebauer, Fritz and Wiechmann, Jana and Kuhlmann, Michael and Wagner, Petra and Haeb-Umbach, Reinhold}}, booktitle = {{Interspeech 2025}}, location = {{Rotterdam}}, publisher = {{ISCA}}, title = {{{Synthesizing Speech with Selected Perceptual Voice Qualities – A Case Study with Creaky Voice}}}, doi = {{10.21437/Interspeech.2025-1443}}, year = {{2025}}, } @inproceedings{61090, author = {{Adler, Enno and Böttcher, Stefan and Hartel, Rita and Steininger, Cedric Alexander}}, booktitle = {{23rd International Symposium on Experimental Algorithms}}, pages = {{2:1----2:18}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}}, title = {{{IBB: Fast Burrows-Wheeler Transform Construction for Length-Diverse DNA Data}}}, volume = {{228}}, year = {{2025}}, } @article{61108, abstract = {{Greybox fuzzing is used extensively in research and practice. There are umpteen publications that improve greybox fuzzing. However, to what extent do these improvements affect the internal components or internals of a given fuzzer is not yet understood as the improvements are mostly evaluated using code coverage and bug finding capability. Such an evaluation is insufficient to understand the effect of improvements on the fuzzer internals. Some of the literature visualizes the outcomes of fuzzing to enhance the understanding. However, they only focus on high-level information and no previous research on visualization has been dedicated to understanding fuzzing internals. To close this gap, we propose the first step towards development of a fuzzing-specific visualization framework: a taxonomy of visualization analysis tasks that fuzzing experts desire to help them understand the fuzzing internals. Our approach involves conducting interviews with fuzzing experts and using qualitative data analysis to systematically extract the task taxonomy from the interview data. We also evaluate the support of existing fuzzing visualization tools through the lens of our taxonomy. In our study, we have conducted 33 interviews with fuzzing practitioners and extracted a taxonomy of 120 visualization analysis tasks. Our evaluation shows that the existing fuzzing visualization tools only provide aids to support 10 of them.}}, author = {{Kummita, Sriteja and Miao, Miao and Bodden, Eric and Wei, Shiyi}}, issn = {{1049-331X}}, journal = {{ACM Transactions on Software Engineering and Methodology}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Visualization Task Taxonomy to Understand the Fuzzing Internals}}}, doi = {{10.1145/3718346}}, year = {{2025}}, } @article{61125, author = {{Biehler, Rolf and Liebendörfer, Michael and Schmitz, Angela and Reich, Birte}}, journal = {{Mitteilungen der Deutschen Mathematiker-Vereinigung}}, number = {{3}}, pages = {{170–171}}, publisher = {{De Gruyter}}, title = {{{studiVEMINT Mathematik-Online-Vorkurs jetzt mit 300 integrierten Lernvideos frei verfügbar}}}, volume = {{33}}, year = {{2025}}, } @article{61140, author = {{Nicolai, Marcel and Bulling, Jannis and Narayanan, M.M. and Zeipert, Henning and Prager, Jens and Henning, Bernd}}, issn = {{0041-624X}}, journal = {{Ultrasonics}}, publisher = {{Elsevier BV}}, title = {{{Dynamic interface behavior in coupled plates: Investigating Lamb wave mode repulsion with a spring-based model}}}, doi = {{10.1016/j.ultras.2025.107799}}, volume = {{158}}, year = {{2025}}, } @inproceedings{61144, author = {{Kablo, Emiram and Kleber, Melina and Arias Cabarcos, Patricia}}, booktitle = {{34th USENIX Security Symposium (USENIX Security 25)}}, pages = {{1531–1548}}, title = {{{PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity}}}, year = {{2025}}, } @article{61123, abstract = {{Knowledge graphs are used by a growing number of applications to represent structured data. Hence, evaluating the veracity of assertions in knowledge graphs—dubbed fact checking—is currently a challenge of growing importance. However, manual fact checking is commonly impractical due to the sheer size of knowledge graphs. This paper is a systematic survey of recent works on automatic fact checking with a focus on knowledge graphs. We present recent fact-checking approaches, the varied sources they use as background knowledge, and the features they rely upon. Finally, we draw conclusions pertaining to possible future research directions in fact checking knowledge graphs.}}, author = {{Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}}, issn = {{0360-0300}}, journal = {{ACM Computing Surveys}}, keywords = {{fact checking, knowledge graphs, fact-checkers, check worthiness, evidence retrieval, trust, veracity.}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Fact Checking Knowledge Graphs -- A Survey}}}, doi = {{10.1145/3749838}}, volume = {{58}}, year = {{2025}}, } @article{59912, abstract = {{Abstract We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced logic first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics with the most studied logics in probabilistic team semantics setting, as well as relating their expressivity to a numerical variant of second-order logic. In addition, we introduce novel entropy atoms and show that the extension of first-order logic by entropy atoms subsumes probabilistic independence logic. Finally, we obtain some results on the complexity of model checking, validity and satisfiability of our logics.}}, author = {{Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni}}, issn = {{0955-792X}}, journal = {{Journal of Logic and Computation}}, number = {{3}}, publisher = {{Oxford University Press (OUP)}}, title = {{{Logics with probabilistic team semantics and the Boolean negation}}}, doi = {{10.1093/logcom/exaf021}}, volume = {{35}}, year = {{2025}}, } @inproceedings{59054, author = {{Firmansyah, Asep Fajar and Zahera, Hamada Mohamed Abdelsamee and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{ESWC2025}}, isbn = {{978-3-031-94575-5}}, keywords = {{firmansyah mousallem ngonga sherif zahera}}, pages = {{133----151}}, publisher = {{pringer Nature Switzerland}}, title = {{{ANTS: Abstractive Entity Summarization in Knowledge Graphs}}}, doi = {{10.1007/978-3-031-94575-5_8}}, year = {{2025}}, } @unpublished{61066, abstract = {{Argumentation is a central subarea of Artificial Intelligence (AI) for modeling and reasoning about arguments. The semantics of abstract argumentation frameworks (AFs) is given by sets of arguments (extensions) and conditions on the relationship between them, such as stable or admissible. Today's solvers implement tasks such as finding extensions, deciding credulous or skeptical acceptance, counting, or enumerating extensions. While these tasks are well charted, the area between decision, counting/enumeration and fine-grained reasoning requires expensive reasoning so far. We introduce a novel concept (facets) for reasoning between decision and enumeration. Facets are arguments that belong to some extensions (credulous) but not to all extensions (skeptical). They are most natural when a user aims to navigate, filter, or comprehend the significance of specific arguments, according to their needs. We study the complexity and show that tasks involving facets are much easier than counting extensions. Finally, we provide an implementation, and conduct experiments to demonstrate feasibility.}}, author = {{Fichte, Johannes and Fröhlich, Nicolas and Hecher, Markus and Lagerkvist, Victor and Mahmood, Yasir and Meier, Arne and Persson, Jonathan}}, booktitle = {{arXiv:2505.10982}}, title = {{{Facets in Argumentation: A Formal Approach to Argument Significance}}}, year = {{2025}}, } @inproceedings{61202, abstract = {{The number of datasets on the web of data increases continuously. However, the knowledge contained therein cannot be fully utilized without finding links between the entities contained in these datasets. Equivalent entities can not be identified solely by checking the equivalence of IRIs because of the different origins and naming schemes of different data providers. Yet, such equivalences can be discovered by computing the similarity of their attributes. In this paper we propose GLIDE, an approach that links entities from two different datasets by embedding a joint model of these datasets enriched by additional relations describing the similarity of literals. The joint model is embedded into a latent vector space while paying attention to juxtaposing similar literals. We evaluate our approach against state-of-the-art algorithms using real-world datasets commonly used in link discovery literature. The results show that GLIDE outperforms all baselines on 5 of 7 datasets with perfect or near-perfect accuracy. Our approach achieves its best performance on datasets that feature several literals with similarities. Our experiments indicate that researchers should not only pay attention to equal literals in knowledge graph embedding but should also be aware of the distance between similar literals.}}, author = {{Becker, Alexander and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed }}, booktitle = {{The Semantic Web – ISWC 2025}}, keywords = {{becker sherif enexa sailproject dice simba ngonga whale}}, title = {{{GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings}}}, year = {{2025}}, } @article{61134, author = {{Manzoor, Ali and Speck, René and Zahera, Hamada Mohamed Abdelsamee and Saleem, Muhammad and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}}, issn = {{2169-3536}}, journal = {{IEEE Access}}, pages = {{1--1}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Multilingual Relation Extraction - A Survey}}}, doi = {{10.1109/access.2025.3604258}}, year = {{2025}}, } @inbook{61222, author = {{Lenke, Michael and Klowait, Nils and Biere, Lea and Schulte, Carsten}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032012210}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects}}}, doi = {{10.1007/978-3-032-01222-7_8}}, year = {{2025}}, } @inproceedings{61396, author = {{Nölle, Florian and Schmid, Hans-Joachim and Bentrup, Leon Alexander and Temmen, Katrin}}, booktitle = {{MINT-Symposium}}, location = {{Nürnberg}}, title = {{{Erfolgreich Studieren - sinnvolle Lernstrategien erlernen (Posterbeitrag)}}}, year = {{2025}}, } @article{61445, abstract = {{ABSTRACT In recent years, there has been an increasing awareness of the importance of incorporating diversity into research projects, focusing on both how they are conducted and their content. Funding organizations have started to require that research applicants pay attention to inclusion and diversity by considering gender dimensions and other diversity factors in their project plans and ensuring gender equality during execution. Based on an extensive literature research and expert discussions on how to develop and implement diversity strategies in large collaborative research projects, we argue that there is a lack of practical advice in existing literature. Drawing from our own experiences in conceptualizing and implementing a Diversity Program across four universities in Germany, we propose a framework for effectively integrating diversity into collaborative research initiatives across various academic fields.}}, author = {{Lorke, Mariya and Amelung, Rena and Kuchling, Peter and Paaßen, Benjamin and Pein-Hackelbusch, Miriam and Schloots, Franziska Margarete and Schulz, Klara and Nauerth, Annette}}, journal = {{Diversity & Inclusion Research}}, keywords = {{collaborative research projects, diversity strategy, gender equality}}, number = {{4}}, pages = {{e70040}}, title = {{{Development and Implementation of Diversity Programs in Large Collaborative Research Projects: An Example From Germany}}}, doi = {{https://doi.org/10.1002/dvr2.70040}}, volume = {{2}}, year = {{2025}}, } @inproceedings{60970, author = {{Hebrok, Sven Niclas and Storm, Tim Leonhard and Cramer, Felix Matthias and Radoy, Maximilian Manfred and Somorovsky, Juraj}}, booktitle = {{34th USENIX Security Symposium}}, title = {{{STEK Sharing is Not Caring: Bypassing TLS Authentication in Web Servers using Session Tickets}}}, year = {{2025}}, } @article{61471, author = {{Governatori, Guido and Turhan, Anni-Yasmin}}, journal = {{Theory Pract. Log. Program.}}, number = {{2}}, pages = {{132–133}}, title = {{{Introduction to the Special Issue on Logic Rules and Reasoning: Selected Papers From the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)}}}, doi = {{10.1017/S1471068425000079}}, volume = {{25}}, year = {{2025}}, } @unpublished{59794, abstract = {{The depth of networks plays a crucial role in the effectiveness of deep learning. However, the memory requirement for backpropagation scales linearly with the number of layers, which leads to memory bottlenecks during training. Moreover, deep networks are often unable to handle time-series data appearing at irregular intervals. These issues can be resolved by considering continuous-depth networks based on the neural ODE framework in combination with reversible integration methods that allow for variable time-steps. Reversibility of the method ensures that the memory requirement for training is independent of network depth, while variable time-steps are required for assimilating time-series data on irregular intervals. However, at present, there are no known higher-order reversible methods with this property. High-order methods are especially important when a high level of accuracy in learning is required or when small time-steps are necessary due to large errors in time integration of neural ODEs, for instance in context of complex dynamical systems such as Kepler systems and molecular dynamics. The requirement of small time-steps when using a low-order method can significantly increase the computational cost of training as well as inference. In this work, we present an approach for constructing high-order reversible methods that allow adaptive time-stepping. Our numerical tests show the advantages in computational speed when applied to the task of learning dynamical systems.}}, author = {{Maslovskaya, Sofya and Ober-Blöbaum, Sina and Offen, Christian and Singh, Pranav and Wembe Moafo, Boris Edgar}}, title = {{{Adaptive higher order reversible integrators for memory efficient deep learning}}}, year = {{2025}}, } @article{60891, abstract = {{Straight dielectric waveguide channels made from slabs of thin-film lithium niobate (TFLN), or lithium niobate on insulator (LNOI), are investigated in the linear regime, for channels of rib and strip type with common trapezoidal cross sections, in Z-cut and X-cut samples at varying on-chip orientation. We clarify the theoretical basis for the waveguides with potentially non-diagonal core permittivity. Symmetry classes can be distinguished that differ in their consequences for potential modal degeneracy and polarization conversion. Our rigorous numerical analysis by means of a finite-element solver takes the anisotropy of the lithium niobate cores rigorously into account. We discuss extensive data for effective indices, polarization properties, and hybridization of guided modes, in single- and multimode channels. Scans over the waveguide width and orientation as primary parameters are complemented by a series of illustrations of vectorial mode profiles. These turn out to be essentially complex in cases of X-cut channels at non-crystal-axis-aligned orientations.}}, author = {{Hammer, Manfred and Khan, Shahriar and Taheri, Behnood and Farheen, Henna and Förstner, Jens}}, issn = {{2770-0208}}, journal = {{Optics Continuum}}, keywords = {{tet_topic_waveguide}}, number = {{10}}, pages = {{2356}}, publisher = {{Optica Publishing Group}}, title = {{{TFLN channel waveguides of rib and strip type: Properties of guided modes}}}, doi = {{10.1364/optcon.569959}}, volume = {{4}}, year = {{2025}}, }