@unpublished{56114,
  author       = {{Pinaud, Matthieu}},
  title        = {{{Manifolds of absolutely continuous functions with values in an infinite-dimensional manifold and regularity properties of half-Lie groups}}},
  year         = {{2024}},
}

@article{55782,
  abstract     = {{Schülerlabore haben unter anderem zum Ziel, die Motivation, insbesondere das Interesse – i.S. einer gegenstandsbezogenen Motivation – von Schüler*innen an MINT-Themen und -Arbeitsweisen zu fördern. Darüber hinaus konnten sie sich schneller und produktiver als die formalen Bildungsorte den Herausforderungen der digitalen Transformation stellen. Das Potenzial, Schülerlabore auch als innovative Orte der Lehrkräftefortbildung (LFB) zu nutzen und digitalisierungsbezogene Kompetenzen bei Lehrkräften aufzubauen, wurde bisher nicht ausgeschöpft. Im Verbundprojekt mit insgesamt acht Standorten werden Schülerlabore zu LFB-Labs-digital ausgebaut und die Frage nach Implementierungsvoraussetzungen gelingender Fortbildungen in der digitalen Welt im MINT-Bereich bearbeitet. In diesem Artikel werden die theoretische Fundierung, Ziele und anvisierten Forschungsarbeiten des Verbunds LFB-Labs-digital dargelegt. Zur Unterstützung der mit der forschungsbasierten Qualitätsentwicklung der MINT-bezogenen Aus-, Fort- und Weiterbildung von Lehrkräften betrauten Einrichtungen in den Ländern sollen in Kooperation mit dem Kompetenzzentrum MINT des Bundes die Lernorte „Schülerlabore“ für die digitale LFB erschlossen werden, um vermittelt hierüber die Motivation von Schüler*innen für die MINT-Fächer zu fördern. Die in den Schülerlaboren evaluierten und vom fächerübergreifenden adaptiven Qualitätsmanagement für die LFB wissenschaftlich begleiteten Good-Practice-Beispiele werden zur Grundlage für den „Referenzrahmen LFB-Labs-digital“. Dieser wird – vor dem Hintergrund einer Ergebnistriangulation aus der Begleitforschung sowie den damit parallelisierten Studien zur Evidenzbasierung der Lehrkräftequalifizierung in der digitalen Welt und dem Musterqualitätshandbuch LFB – entwickelt und von einem Implementierungsbeirat mit ausgewiesenen Expert*innen in diesem Bereich auf Transferoptionen hin geprüft. Die digitale Infrastruktur für die LFB-Labs-digital-Veranstaltungsformate wird hierzu prozessbegleitend ausgebaut.}},
  author       = {{Kirchhoff, Tim and Schwedler, Stefanie and Abels, Simone and Acher, Andres and Anselmetti, Dario and Besa, Kris-Stephen and Biehl, Jonathan and Blumberg, Eva and Breiter, Andreas and Brückmann, Maja and Büntemeyer, Doreen and El Tegani, Mahdi and Engelhardt, Alex and Grotjohann, Norbert and Kiel, Celina and Kleine, Michael and Koerber, Rolf and Lambrecht, Maike and Lehmenkühler, Anna and Meyer, David and Mußhoff, Alina and Panhorst, Maren and Peperkorn, Colin and Röllke, Kerstin and Roth, Jürgen and Schäfers, Maria Sophie and Schüler, Henning and Stinken-Rösner, Lisa and Strauß, Sebastian and Stricker, Janne and Temmen, Katrin and Tönsing, Katja and Verständig, Dan and Wegner, Claas and Wellensiek, Nicole and Wenzel, Annkathrin and Wördemann, Daniela and Ziegler, Matthias and Heinrich, Martin and Wilde, Matthias}},
  journal      = {{PFLB – PraxisForschungLehrer*innenBildung}},
  number       = {{1}},
  pages        = {{130–155}},
  title        = {{{LFB-Labs-digital: Schülerlabore als Ort der Lehrkräftefortbildung in der digitalen Welt: Ein Bericht zur Konzeption eines Verbundprojektes}}},
  doi          = {{https://doi.org/10.11576/pflb-7349}},
  volume       = {{6}},
  year         = {{2024}},
}

@book{56199,
  editor       = {{Liebendörfer, Michael and Schmitz, Angelika and Biehler, Rolf}},
  title        = {{{Lernvideos in der Mathematik – Beiträge zur Abschlusstagung des Projektes studiVEMINTvideos der Universität Paderborn und der TH Köln}}},
  year         = {{2024}},
}

@inproceedings{46649,
  abstract     = {{Different conflicting optimization criteria arise naturally in various Deep
Learning scenarios. These can address different main tasks (i.e., in the
setting of Multi-Task Learning), but also main and secondary tasks such as loss
minimization versus sparsity. The usual approach is a simple weighting of the
criteria, which formally only works in the convex setting. In this paper, we
present a Multi-Objective Optimization algorithm using a modified Weighted
Chebyshev scalarization for training Deep Neural Networks (DNNs) with respect
to several tasks. By employing this scalarization technique, the algorithm can
identify all optimal solutions of the original problem while reducing its
complexity to a sequence of single-objective problems. The simplified problems
are then solved using an Augmented Lagrangian method, enabling the use of
popular optimization techniques such as Adam and Stochastic Gradient Descent,
while efficaciously handling constraints. Our work aims to address the
(economical and also ecological) sustainability issue of DNN models, with a
particular focus on Deep Multi-Task models, which are typically designed with a
very large number of weights to perform equally well on multiple tasks. Through
experiments conducted on two Machine Learning datasets, we demonstrate the
possibility of adaptively sparsifying the model during training without
significantly impacting its performance, if we are willing to apply
task-specific adaptations to the network weights. Code is available at
https://github.com/salomonhotegni/MDMTN.}},
  author       = {{Hotegni, Sedjro Salomon and Berkemeier, Manuel Bastian and Peitz, Sebastian}},
  booktitle    = {{2024 International Joint Conference on Neural Networks (IJCNN)}},
  issn         = {{ 2161-4407}},
  location     = {{Yokohama, Japan}},
  pages        = {{9}},
  publisher    = {{IEEE}},
  title        = {{{Multi-Objective Optimization for Sparse Deep Multi-Task Learning}}},
  doi          = {{10.1109/IJCNN60899.2024.10650994}},
  year         = {{2024}},
}

@unpublished{56273,
  abstract     = {{This paper presents the CHiME-8 DASR challenge which carries on from the
previous edition CHiME-7 DASR (C7DASR) and the past CHiME-6 challenge. It
focuses on joint multi-channel distant speech recognition (DASR) and
diarization with one or more, possibly heterogeneous, devices. The main goal is
to spur research towards meeting transcription approaches that can generalize
across arbitrary number of speakers, diverse settings (formal vs. informal
conversations), meeting duration, wide-variety of acoustic scenarios and
different recording configurations. Novelties with respect to C7DASR include:
i) the addition of NOTSOFAR-1, an additional office/corporate meeting scenario,
ii) a manually corrected Mixer 6 development set, iii) a new track in which we
allow the use of large-language models (LLM) iv) a jury award mechanism to
encourage participants to explore also more practical and innovative solutions.
To lower the entry barrier for participants, we provide a standalone toolkit
for downloading and preparing such datasets as well as performing text
normalization and scoring their submissions. Furthermore, this year we also
provide two baseline systems, one directly inherited from C7DASR and based on
ESPnet and another one developed on NeMo and based on NeMo team submission in
last year C7DASR. Baseline system results suggest that the addition of the
NOTSOFAR-1 scenario significantly increases the task's difficulty due to its
high number of speakers and very short duration.}},
  author       = {{Cornell, Samuele and Park, Taejin and Huang, Steve and Boeddeker, Christoph and Chang, Xuankai and Maciejewski, Matthew and Wiesner, Matthew and Garcia, Paola and Watanabe, Shinji}},
  booktitle    = {{arXiv:2407.16447}},
  title        = {{{The CHiME-8 DASR Challenge for Generalizable and Array Agnostic Distant  Automatic Speech Recognition and Diarization}}},
  year         = {{2024}},
}

@article{56366,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>We discuss in which cases the Dunkl convolution  of distributions , possibly both with non‐compact support, can be defined and study its analytic properties. We prove results on the (singular‐)support of Dunkl convolutions. Based on this, we are able to prove a theorem on elliptic regularity for a certain class of Dunkl operators, called elliptic Dunkl operators. Finally, for the root system  we consider the Riesz distributions  and prove that their Dunkl convolution exists and that  holds.</jats:p>}},
  author       = {{Brennecken, Dominik}},
  issn         = {{0025-584X}},
  journal      = {{Mathematische Nachrichten}},
  publisher    = {{Wiley}},
  title        = {{{Dunkl convolution and elliptic regularity for Dunkl operators}}},
  doi          = {{10.1002/mana.202300370}},
  year         = {{2024}},
}

@inbook{56079,
  author       = {{Radoy, Maximilian Manfred and Hebrok, Sven Niclas and Somorovsky, Juraj}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031708954}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{In Search of Partitioning Oracle Attacks Against TLS Session Tickets}}},
  doi          = {{10.1007/978-3-031-70896-1_16}},
  year         = {{2024}},
}

@inbook{56476,
  author       = {{Höper, Lukas and Schulte, Carsten and Benzmüller, Christoph}},
  booktitle    = {{Künstliche Intelligenz für Lehrkräfte}},
  editor       = {{Furbach, Ulrich and Kitzelmann, Emanuel and Michaeli, Tilman and Schmid, Ute}},
  isbn         = {{9783658442477}},
  issn         = {{2662-5970}},
  publisher    = {{Springer Fachmedien Wiesbaden}},
  title        = {{{Verantwortung}}},
  doi          = {{10.1007/978-3-658-44248-4_16}},
  year         = {{2024}},
}

@article{56497,
  author       = {{Cappello, Chiara and Naserasr, Reza and Steffen, Eckhard and Wang, Zhouningxin}},
  issn         = {{0012-365X}},
  journal      = {{Discrete Mathematics}},
  number       = {{1}},
  publisher    = {{Elsevier BV}},
  title        = {{{Critically 3-frustrated signed graphs}}},
  doi          = {{10.1016/j.disc.2024.114258}},
  volume       = {{348}},
  year         = {{2024}},
}

@article{56584,
  author       = {{Suri, Ali}},
  journal      = {{Journal of Geometry and Physics}},
  pages        = {{105109}},
  title        = {{{Curvature and stability of quasi-geostrophic motion}}},
  volume       = {{198}},
  year         = {{2024}},
}

@article{56585,
  author       = {{Suri, Ali}},
  journal      = {{Journal of Geometry and Physics}},
  pages        = {{105333}},
  title        = {{{Conjugate points along spherical harmonics}}},
  volume       = {{206}},
  year         = {{2024}},
}

@unpublished{56583,
  author       = {{Glöckner, Helge and Suri, Ali}},
  title        = {{{L^1-regularity of strong ILB-Lie groups}}},
  year         = {{2024}},
}

@inproceedings{55479,
  author       = {{Peñaloza, Rafael and Turhan, Anni-Yasmin}},
  booktitle    = {{Rules and Reasoning - Eighth International Joint Conference, RuleML+RR 2024, Proceedings}},
  editor       = {{Kirrane, Sabrina and Simkus, Mantas and Soylu, Ahmet and Roman, Dumitru}},
  publisher    = {{Springer}},
  title        = {{{Reasoning in Rough Description Logics with Multiple Indiscernibility Relations}}},
  doi          = {{10.1007/978-3-031-72407-7\_11}},
  year         = {{2024}},
}

@inbook{56592,
  author       = {{Giesa, Felix and Hartel, Rita and Dunst, Alexander}},
  booktitle    = {{Comics | Histories}},
  isbn         = {{9783988580566}},
  publisher    = {{Rombach Wissenschaft – ein Verlag in der Nomos Verlagsgesellschaft}},
  title        = {{{On German Comics Traditions: An Explorative Approach to Digital Comics Historiography}}},
  doi          = {{10.5771/9783988580566-239}},
  year         = {{2024}},
}

@article{49655,
  abstract     = {{In today's digital world, data-driven digital artefacts pose challenges for education, as many students lack an understanding of data and feel powerless when interacting with them. This article addresses these challenges and introduces the data awareness framework. It focuses on understanding data-driven technologies and reflecting on the role of data in everyday life. The paper also presents an empirical study on young school students' data awareness. The study involves a teaching unit on data awareness framed by a pretest-posttest design using a questionnaire on students' awareness and understanding of and reflection on data practices of data-driven digital artefacts. The study's findings indicate that the data awareness framework supports students in understanding data practices of data-driven digital artefacts. The findings also suggest that the framework encourages students to reflect on these data practices and think about their daily behaviour. Students learn a model about interactions with data-driven digital artefacts and use it to analyse data-driven applications. This approach appears to enable students to understand these artefacts from everyday life and reflect on these interactions. The work contributes to research on data and AI literacies and suggests a way to support students in developing self-determination and agency during interactions with data-driven digital artefacts.}},
  author       = {{Höper, Lukas and Schulte, Carsten}},
  issn         = {{2398-5348}},
  journal      = {{Information and Learning Sciences}},
  keywords     = {{Library and Information Sciences, Computer Science Applications, Education}},
  number       = {{7/8}},
  pages        = {{491--512}},
  publisher    = {{Emerald}},
  title        = {{{The data awareness framework as part of data literacies in K-12 education}}},
  doi          = {{10.1108/ils-06-2023-0075}},
  volume       = {{125}},
  year         = {{2024}},
}

@inbook{56606,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>Most FPGA boards in the HPC domain are well-suited for parallel scaling because of the direct integration of versatile and high-throughput network ports. However, the utilization of their network capabilities is often challenging and error-prone because the whole network stack and communication patterns have to be implemented and managed on the FPGAs. Also, this approach conceptually involves a trade-off between the performance potential of improved communication and the impact of resource consumption for communication infrastructure, since the utilized resources on the FPGAs could otherwise be used for computations. In this work, we investigate this trade-off, firstly, by using synthetic benchmarks to evaluate the different configuration options of the communication framework ACCL and their impact on communication latency and throughput. Finally, we use our findings to implement a shallow water simulation whose scalability heavily depends on low-latency communication. With a suitable configuration of ACCL, good scaling behavior can be shown to all 48 FPGAs installed in the system. Overall, the results show that the availability of inter-FPGA communication frameworks as well as the configurability of framework and network stack are crucial to achieve the best application performance with low latency communication.</jats:p>}},
  author       = {{Meyer, Marius and Kenter, Tobias and Petrica, Lucian and O’Brien, Kenneth and Blott, Michaela and Plessl, Christian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783031697654}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Optimizing Communication for Latency Sensitive HPC Applications on up to 48 FPGAs Using ACCL}}},
  doi          = {{10.1007/978-3-031-69766-1_9}},
  year         = {{2024}},
}

@inproceedings{56158,
  author       = {{Gil, Oliver Fernández and Patrizi, Fabio and Perelli, Giuseppe and Turhan, Anni-Yasmin}},
  booktitle    = {{Proceedings of the 37th International Workshop on Description Logics (DL 2024), Bergen, Norway, June 18-21, 2024}},
  editor       = {{Giordano, Laura and Jung, Jean Christoph and Ozaki, Ana}},
  publisher    = {{CEUR-WS.org}},
  title        = {{{Optimal Alignment of Temporal Knowledge Bases (Extended Abstract)}}},
  volume       = {{3739}},
  year         = {{2024}},
}

@inproceedings{56605,
  author       = {{Opdenhövel, Jan-Oliver and Alt, Christoph and Plessl, Christian and Kenter, Tobias}},
  booktitle    = {{2024 34th International Conference on Field-Programmable Logic and Applications (FPL)}},
  publisher    = {{IEEE}},
  title        = {{{StencilStream: A SYCL-based Stencil Simulation Framework Targeting FPGAs}}},
  doi          = {{10.1109/fpl64840.2024.00023}},
  year         = {{2024}},
}

@inproceedings{56607,
  author       = {{Tareen, Abdul Rehman and Meyer, Marius and Plessl, Christian and Kenter, Tobias}},
  booktitle    = {{2024 IEEE 32nd Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)}},
  publisher    = {{IEEE}},
  title        = {{{HiHiSpMV: Sparse Matrix Vector Multiplication with Hierarchical Row Reductions on FPGAs with High Bandwidth Memory}}},
  doi          = {{10.1109/fccm60383.2024.00014}},
  volume       = {{35}},
  year         = {{2024}},
}

@inproceedings{56609,
  abstract     = {{The computation of electron repulsion integrals (ERIs) is a key component for quantum chemical methods. The intensive computation and bandwidth demand for ERI evaluation presents a significant challenge for quantum-mechanics-based atomistic simulations with hybrid density functional theory: due to the tens of trillions of ERI computations in each time step, practical applications are usually limited to thousands of atoms. In this work, we propose SERI, a high-throughput streaming accelerator for ERI computation on HBM-based FPGAs. In contrast to prior buffer-based designs, SERI proposes a novel streaming architecture to address the on-chip buffer limitation and the floorplanning challenge, and leverages the high-bandwidth memory to overcome the bandwidth bottleneck in prior designs. Moreover, to meet the varying computation, bandwidth, and floorplanning requirements between the 55 canonical quartet classes in ERI calculation, we design an automation tool, together with an accurate performance model, to automatically customize the architecture and floorplanning strategy for each canonical quartet class to maximize their throughput. Our performance evaluation on the AMD/Xilinx Alveo U280 FPGA board shows that, SERI achieves an average speedup of 9.80 x over the previous best-performing FPGA design, a 3.21x speedup over a 64-core AMD EPYC 7713 CPU, and a 15.64x speedup over an Nvidia A40 GPU. It reaches a peak throughput of 23.8 GERIS ($10^9$ ERIs per second) on one Alveo U280 FPGA. SERI will be released soon at https://github.com/SFU-HiAccel/SERI.}},
  author       = {{Stachura, Philip and Li, Guanyu and Wu, Xin and Plessl, Christian and Fang, Zhenman}},
  booktitle    = {{2024 34th International Conference on Field-Programmable Logic and Applications (FPL)}},
  pages        = {{60--68}},
  publisher    = {{IEEE}},
  title        = {{{SERI: High-Throughput Streaming Acceleration of Electron Repulsion Integral Computation in Quantum Chemistry using HBM-based FPGAs}}},
  doi          = {{10.1109/fpl64840.2024.00018}},
  year         = {{2024}},
}