@inbook{62645, author = {{Häsel-Weide, Uta and Nührenbörger, Marcus}}, booktitle = {{Handbuch Lehrerinnen- und Lehrerbildung}}, editor = {{Cramer, C. and König, J. and Rothland, M.}}, pages = {{549--555}}, publisher = {{Klinkhardt}}, title = {{{ Mathematik (Primarstufe) in der Lehrerinnen- und Lehrerbildung. Qualifizierung für das Lehren von Mathematik in der Grundschule}}}, doi = {{10.35468/hblb2025-070}}, year = {{2025}}, } @inproceedings{62163, abstract = {{Zero-shot classifiers based on Contrastive Language-Audio Pretraining (CLAP) models enable classification of given audio into classes defined at test time using text. These models are costly to run with respect to computation and memory requirements. In this work, we propose to build a specialized low-resource classifier for classes pre-defined using text, using a two-stage procedure consisting of zero-shot data set pruning and model compression. First, relevant in-domain data is selected from a source dataset using class label embeddings obtained from a pre-trained CLAP model. This data is then used to distill the audio encoder of a CLAP model. The proposed compression method produces compact audio encoders with slightly reduced accuracy. Note that neither labeled nor unlabeled in-domain audio data is required for its development. We verify by cross-dataset tests that the resulting classifiers are indeed specialized to their task.}}, author = {{Werning, Alexander and Häb-Umbach, Reinhold}}, booktitle = {{Proceedings of the 16th ITG Conference on Speech Communication}}, editor = {{Möller, Sebastian and Gerkmann, Timo and Kolossa, Dorothea}}, location = {{Berlin}}, pages = {{76--80}}, title = {{{A Fully Zero-Shot Approach to Obtaining Specialized and Compact Audio Tagging Models}}}, year = {{2025}}, } @inproceedings{59900, abstract = {{Running state-of-the-art large-scale audio models on edge devices is often infeasible due to their limited storage and computing resources. It is therefore necessary to compress and tune the models for the specific target task and hardware. This is commonly achieved by distilling the audio model, the teacher, to a small target model, the student. However, this approach can be improved by prepending a dataset pruning stage and training the teacher on the pruned data set only, which contains examples relevant to the target task. Recently, CLAP models have emerged that embed audio and text examples in a common embedding space. We use the audio embeddings of the CLAP model for the above pruning stage, which is realized using a domain classifier. After knowledge distillation, the student is eventually fine-tuned on some data from the target domain. The CLAP architecture combines text and audio embedding spaces, which allows to search for data given only a textual description, such as a class label. We show how this can help data pruning.}}, author = {{Werning, Alexander and Häb-Umbach, Reinhold}}, booktitle = {{Proceedings of DAS|DAGA 2025}}, location = {{Copenhagen}}, title = {{{Distilling Efficient Audio Models using Data Pruning with CLAP}}}, year = {{2025}}, } @inbook{62701, abstract = {{Learning continuous vector representations for knowledge graphs has significantly improved state-of-the-art performances in many challenging tasks. Yet, deep-learning-based models are only post-hoc and locally explainable. In contrast, learning Web Ontology Language (OWL) class expressions in Description Logics (DLs) is ante-hoc and globally explainable. However, state-of-the-art learners have two well-known lim-itations: scaling to large knowledge graphs and handling missing infor-mation. Here, we present a decision-tree-based learner (tDL) to learn Web Ontology Languages (OWLs) class expressions over large knowl-edge graphs, while imputing missing triples. Given positive and negative example individuals, tDL firstly constructs unique OWL expressions in .SHOIN from concise bounded descriptions of individuals. Each OWL class expression is used as a feature in a binary classification problem to represent input individuals. Thereafter, tDL fits a CART decision tree to learn Boolean decision rules distinguishing positive examples from nega-tive examples. A final OWL expression in.SHOIN is built by traversing the built CART decision tree from the root node to leaf nodes for each positive example. By this, tDL can learn OWL class expressions without exploration, i.e., the number of queries to a knowledge graph is bounded by the number of input individuals. Our empirical results show that tDL outperforms the current state-of-the-art models across datasets. Impor-tantly, our experiments over a large knowledge graph (DBpedia with 1.1 billion triples) show that tDL can effectively learn accurate OWL class expressions, while the state-of-the-art models fail to return any results. Finally, expressions learned by tDL can be seamlessly translated into natural language explanations using a pre-trained large language model and a DL verbalizer.}}, author = {{Demir, Caglar and Yekini, Moshood and Röder, Michael and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032060655}}, issn = {{0302-9743}}, keywords = {{Decision Tree, OWL Class Expression Learning, Description Logic, Knowledge Graph, Large Language Model, Verbalizer}}, location = {{Porto, Portugal}}, publisher = {{Springer Nature Switzerland}}, title = {{{Tree-Based OWL Class Expression Learner over Large Graphs}}}, doi = {{10.1007/978-3-032-06066-2_29}}, year = {{2025}}, } @inproceedings{62707, author = {{Heindorf, Stefan and Neib, Daniel}}, booktitle = {{Proceedings of the 34th ACM International Conference on Information and Knowledge Management}}, publisher = {{ACM}}, title = {{{Assessing Natural Language Explanations of Relational Graph Neural Networks}}}, doi = {{10.1145/3746252.3760918}}, year = {{2025}}, } @inproceedings{61041, abstract = {{Large Language Models (LLMs) are increasingly deployed in real-world applications that require access to up-to-date knowledge. However, retraining LLMs is computationally expensive. Therefore, knowledge editing techniques are crucial for maintaining current information and correcting erroneous assertions within pre-trained models. Current benchmarks for knowledge editing primarily focus on recalling edited facts, often neglecting their logical consequences. To address this limitation, we introduce a new benchmark designed to evaluate how knowledge editing methods handle the logical consequences of a single fact edit. Our benchmark extracts relevant logical rules from a knowledge graph for a given edit. Then, it generates multi-hop questions based on these rules to assess the impact on logical consequences. Our findings indicate that while existing knowledge editing approaches can accurately insert direct assertions into LLMs, they frequently fail to inject entailed knowledge. Specifically, experiments with popular methods like ROME and FT reveal a substantial performance gap, up to 24%, between evaluations on directly edited knowledge and on entailed knowledge. This highlights the critical need for semantics-aware evaluation frameworks in knowledge editing.}}, author = {{Moteu Ngoli, Tatiana and Kouagou, N'Dah Jean and Zahera, Hamada Mohamed Abdelsamee and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the 24th International Semantic Web Conference (ISWC 2025)}}, isbn = {{978-3-032-09530-5}}, keywords = {{dice sailproject moteu kouagou zahera ngonga}}, location = {{Nara, Japan}}, pages = {{pp 41--56}}, publisher = {{Springer, Cham}}, title = {{{Benchmarking Knowledge Editing using Logical Rules}}}, doi = {{https://doi.org/10.1007/978-3-032-09530-5_3}}, year = {{2025}}, } @article{62731, author = {{Meschede, Henning and Knorr, Lukas and Piacentino, Antonio and Markovska, Natasa and Duic, Neven}}, issn = {{0360-5442}}, journal = {{Energy}}, publisher = {{Elsevier BV}}, title = {{{Integrated and demand-responsive energy futures in the context of sustainable development of energy systems}}}, doi = {{10.1016/j.energy.2025.139453}}, year = {{2025}}, } @phdthesis{62750, abstract = {{Diese Dissertation enthält Beiträge zum Bereich der Mehrzieloptimierung mit einem Fokus auf unbeschränkten Problemen, die auf einem allgemeinen Hilbertraum definiert sind. Für Mehrzieloptimierungsprobleme mit lokal Lipschitz-stetigen Zielfunktionen definieren wir ein multikriterielles Subdifferential, das wir erstmals im Kontext allgemeiner Hilberträume analysieren. Aufbauend auf diesen theoretischen Untersuchungen präsentieren wir ein Abstiegsverfahren, bei welchem in jeder Iteration eine Abstiegsrichtung mittels einer numerischen Approximation des multikriteriellen Subdifferentials bestimmt wird. Im Kontext konvexer, stetig differenzierbarer Zielfunktionen mit Lipschitz-stetigen Gradienten, führen wir eine Familie von dynamischen Gradientensystemen mit Trägheitsterm ein, die bekannte kontinuierliche Systeme aus der skalaren Optimierung verallgemeinern. Wir stellen drei neue Systeme vor: eines mit konstanter Dämpfung, eines mit asymptotisch abnehmender Dämpfung und eines, das zusätzlich eine zeitabhängige Tikhonov-Regularisierung beinhaltet. Aufbauend auf den Untersuchungen der neuen dynamischen Gradientensysteme, entwickeln wir ein beschleunigtes Gradientenverfahren zur Mehrzieloptimierung, das auf einer Diskretisierung des multikriteriellen Gradientensystems mit asymptotisch abnehmender Dämpfung beruht. Das hergeleitete Verfahren bewahrt die günstigen Konvergenzeigenschaften des kontinuierlichen Systems und erreicht eine schnellere Konvergenz als klassische Verfahren.}}, author = {{Sonntag, Konstantin}}, publisher = {{Paderborn University}}, title = {{{First-order methods and gradient dynamical systems for multiobjective optimization}}}, doi = {{10.17619/UNIPB/1-2457}}, year = {{2025}}, } @inproceedings{62007, abstract = {{Ensemble methods are widely employed to improve generalization in machine learning. This has also prompted the adoption of ensemble learning for the knowledge graph embedding (KGE) models in performing link prediction. Typical approaches to this end train multiple models as part of the ensemble, and the diverse predictions are then averaged. However, this approach has some significant drawbacks. For instance, the computational overhead of training multiple models increases latency and memory overhead. In contrast, model merging approaches offer a promising alternative that does not require training multiple models. In this work, we introduce model merging, specifically weighted averaging, in KGE models. Herein, a running average of model parameters from a training epoch onward is maintained and used for predictions. To address this, we additionally propose an approach that selectively updates the running average of the ensemble model parameters only when the generalization performance improves on a validation dataset. We evaluate these two different weighted averaging approaches on link prediction tasks, comparing the state-of-the-art benchmark ensemble approach. Additionally, we evaluate the weighted averaging approach considering literal-augmented KGE models and multi-hop query answering tasks as well. The results demonstrate that the proposed weighted averaging approach consistently improves performance across diverse evaluation settings.}}, author = {{Sapkota, Rupesh and Demir, Caglar and Sharma, Arnab and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the Thirteenth International Conference on Knowledge Capture(K-CAP 2025)}}, keywords = {{Knowledge Graphs, Embeddings, Ensemble Learning}}, location = {{Dayton, OH, USA}}, publisher = {{ACM}}, title = {{{Parameter Averaging in Link Prediction}}}, doi = {{https://doi.org/10.1145/3731443.3771365}}, year = {{2025}}, } @article{62973, abstract = {{Large Language Models (LLMs) are increasingly being explored for their potential in software engineering, particularly in static analysis tasks. In this study, we investigate the potential of current LLMs to enhance call-graph analysis and type inference for Python and JavaScript programs. We empirically evaluated 24 LLMs, including OpenAI's GPT series and open-source models like LLaMA and Mistral, using existing and newly developed benchmarks. Specifically, we enhanced TypeEvalPy, a micro-benchmarking framework for type inference in Python, with auto-generation capabilities, expanding its scope from 860 to 77,268 type annotations for Python. Additionally, we introduced SWARM-CG and SWARM-JS, comprehensive benchmarking suites for evaluating call-graph construction tools across multiple programming languages. Our findings reveal a contrasting performance of LLMs in static analysis tasks. For call-graph generation, traditional static analysis tools such as PyCG for Python and Jelly for JavaScript consistently outperform LLMs. While advanced models like mistral-large-it-2407-123b and gpt-4o show promise, they still struggle with completeness and soundness in call-graph analysis across both languages. In contrast, LLMs demonstrate a clear advantage in type inference for Python, surpassing traditional tools like HeaderGen and hybrid approaches such as HiTyper. These results suggest that, while LLMs hold promise in type inference, their limitations in call-graph analysis highlight the need for further research. Our study provides a foundation for integrating LLMs into static analysis workflows, offering insights into their strengths and current limitations.}}, author = {{Shivarpatna Venkatesh, Ashwin Prasad and Sunil, Rose and Sabu, Samkutty and Mir, Amir M. and Reis, Sofia and Bodden, Eric}}, journal = {{Empirical Software Engineering}}, number = {{6}}, publisher = {{Springer}}, title = {{{An Empirical Study of Large Language Models for Type and Call Graph Analysis in Python and JavaScript}}}, doi = {{10.48550/ARXIV.2410.00603}}, volume = {{30}}, year = {{2025}}, } @article{62980, abstract = {{We introduce a new classification of multimode states with a fixed number of photons. This classification is based on the factorizability of homogeneous multivariate polynomials and is invariant under unitary transformations. The classes physically correspond to field excitations in terms of single and multiple photons, each of which is in an arbitrary irreducible superposition of quantized modes. We further show how the transitions between classes are rendered possible by photon addition, photon subtraction, and photon-projection nonlinearities. We explicitly put forward a design for a multilayer interferometer in which the states for different classes can be generated with state-of-the-art experimental techniques. Limitations of the proposed designs are analyzed using the introduced classification, providing a benchmark for the robustness of certain states and classes.}}, author = {{Kopylov, Denis A. and Offen, Christian and Ares, Laura and Wembe Moafo, Boris Edgar and Ober-Blöbaum, Sina and Meier, Torsten and Sharapova, Polina R. and Sperling, Jan}}, issn = {{2643-1564}}, journal = {{Physical Review Research}}, number = {{3}}, publisher = {{American Physical Society (APS)}}, title = {{{Multiphoton, multimode state classification for nonlinear optical circuits}}}, doi = {{10.1103/sv6z-v1gk}}, volume = {{7}}, year = {{2025}}, } @inproceedings{62271, author = {{Weizel, Maxim and Gudyriev, Sergiy and Zazzi, Andrea and Müller, Juliana and Schwabe, Tobias and Witzens, Jeremy and Scheytt, J. Christoph}}, booktitle = {{2025 32nd IEEE International Conference on Electronics, Circuits and Systems (ICECS)}}, location = {{Marrakesh, Morocco}}, publisher = {{IEEE}}, title = {{{High Voltage (5Vpp) Driver Monolithically Integrated with Thermally Tunable Optical Ring Resonators in a Silicon Photonics Technology}}}, doi = {{10.1109/ICECS66544.2025.11270577}}, year = {{2025}}, } @inproceedings{63054, author = {{Apostolo, Guilherme Henrique and Bauszat, Pablo and Nigade, Vinod and Bal, Henri E. and Wang, Lin}}, booktitle = {{Proceedings of the 31st Annual International Conference on Mobile Computing and Networking (MobiCom)}}, location = {{Hong Kong, China}}, publisher = {{ACM}}, title = {{{Uirapuru: Timely Video Analytics for High-Resolution Steerable Cameras on Edge Devices}}}, doi = {{10.1145/3680207.3765260}}, year = {{2025}}, } @article{63057, author = {{Pei, Qiangyu and Yuan, Yongjie and Hu, Haichuan and Wang, Lin and Zhang, Dong and Yan, Bingheng and Yu, Chen and Liu, Fangming}}, issn = {{2377-3782}}, journal = {{IEEE Transactions on Sustainable Computing}}, number = {{4}}, pages = {{804--819}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Working Smarter Not Harder: Hybrid Cooling for Deep Learning in Edge Datacenters}}}, doi = {{10.1109/tsusc.2025.3542563}}, volume = {{10}}, year = {{2025}}, } @inproceedings{63056, author = {{Wu, Jing and Wang, Lin and Deng, Quanfeng and Yu, Chen and Zhang, Dong and Yan, Bingheng and Liu, Fangming}}, booktitle = {{2025 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, location = {{Milan, Italy}}, publisher = {{IEEE}}, title = {{{It Takes Two to Tango: Serverless Workflow Serving via Bilaterally Engaged Resource Adaptation}}}, doi = {{10.1109/ipdps64566.2025.00012}}, year = {{2025}}, } @article{63053, author = {{Hernández, Carlos and Rodriguez-Fernandez, Angel E. and Schäpermeier, Lennart and Cuate, Oliver and Trautmann, Heike and Schütze, Oliver}}, journal = {{IEEE Transactions on Evolutionary Computation}}, keywords = {{Optimization, Evolutionary computation, Hands, Proposals, Convergence, Computational efficiency, Artificial intelligence, Accuracy, Approximation algorithms, Aerospace electronics, Multi-objective optimization, evolutionary algorithms, nearly optimal solutions, multimodal optimization, archiving, continuation}}, pages = {{1--1}}, title = {{{An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization}}}, doi = {{10.1109/TEVC.2025.3637276}}, year = {{2025}}, } @inproceedings{63036, author = {{Rezat, Sebastian and Glasnović Gracin, Dubravka and Van Steenbrugge, Hendrik and Sievert, Henning}}, booktitle = {{Proceedings of the Fifth International Conference on Mathematics Textbook Research and Development.}}, editor = {{Pepin, Birgit and Kohanová, Iveta and Langfeldt, Marit Buset}}, isbn = {{978-82-691902-2-9}}, location = {{Trondheim, Norway}}, pages = {{72–91}}, publisher = {{Norwegian University of Science and Technology.}}, title = {{{The quality of print and digital mathematics curriculum resources}}}, year = {{2025}}, } @inproceedings{63034, author = {{Stallmeister, Lea and Rezat, Sebastian}}, booktitle = {{Proceedings of the Fifth International Conference on Mathematics Textbook Research and Development}}, editor = {{Pepin, Birgit and Kohanová, Iveta and Langfeldt, Marit Buset}}, isbn = {{978-82-691902-2-9}}, location = {{Trondheim, Norway}}, publisher = {{Norwegian University of Science and Technology}}, title = {{{Students’ use of different material resources for specific purposes in the process of learning mathematics}}}, year = {{2025}}, } @inproceedings{63058, author = {{Ghafouri, Saeid and Razavi, Kamran and Salmani, Mehran and Sanaee, Alireza and Botran, Tania Lorido and Wang, Lin and Doyle, Joseph and Jamshidi, Pooyan}}, booktitle = {{Companion of the 16th ACM/SPEC International Conference on Performance Engineering}}, publisher = {{ACM}}, title = {{{IPA: Inference Pipeline Adaptation to Achieve High Accuracy and Cost-Efficiency}}}, doi = {{10.1145/3680256.3721266}}, year = {{2025}}, } @article{60196, abstract = {{This paper examines the governance and quality control of digital curriculum resources (DCR) for K-12 mathematics education in Germany. It focuses on approval processes and criteria set by the 16 federal states, arguing that these have the potential to influence the development of DCR. Using qualitative content analysis, the study explores three research questions: which DCR require official approval, the criteria applied for approval, and the extent to which these criteria are mathematics-specific. Findings indicate that 10 federal states maintain official approval systems, covering digital equivalents of printed textbooks and selected supplemental materials. However, most DCR fall outside these regulated processes, leaving their evaluation largely to individual schools and teachers. The study identifies 17 categories of quality criteria, but reveals a lack of detailed, mathematics-specific requirements. Instead, many criteria are broad references to didactical principles and educational goals, leaving the interpretation and application of these quality standards open-ended. Subject-specific criteria are included but remain limited in specificity. The study underscores the need for research-informed, mathematics-specific quality standards to guide DCR development and approval, emphasizing their importance amidst challenges like artificial intelligence. Policymakers are urged to adopt clearer criteria to ensure high-quality DCR to be used in schools.}}, author = {{Rezat, Sebastian}}, issn = {{1863-9690}}, journal = {{ZDM – Mathematics Education}}, keywords = {{governance, digital curriculum resources, digital textbooks, digital curriculum materials, quality}}, pages = {{ 891–904}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{The quality of digital curriculum resources for mathematics in German educational policy}}}, doi = {{10.1007/s11858-025-01708-w}}, volume = {{57}}, year = {{2025}}, }