@inproceedings{61922,
abstract = {{We present an extremely simple polynomial-space exponential-time
$(1-\varepsilon)$-approximation algorithm for MAX-k-SAT that is (slightly)
faster than the previous known polynomial-space $(1-\varepsilon)$-approximation
algorithms by Hirsch (Discrete Applied Mathematics, 2003) and Escoffier,
Paschos and Tourniaire (Theoretical Computer Science, 2014). Our algorithm
repeatedly samples an assignment uniformly at random until finding an
assignment that satisfies a large enough fraction of clauses. Surprisingly, we
can show the efficiency of this simpler approach by proving that in any
instance of MAX-k-SAT (or more generally any instance of MAXCSP), an
exponential number of assignments satisfy a fraction of clauses close to the
optimal value.}},
author = {{Buhrman, Harry and Gharibian, Sevag and Landau, Zeph and Gall, François Le and Schuch, Norbert and Tamaki, Suguru}},
booktitle = {{SIAM Symposium on Simplicity in Algorithms (SOSA)}},
pages = {{247--253}},
title = {{{A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT}}},
year = {{2026}},
}
@proceedings{64797,
editor = {{Birk, Lisa and Loth, Gerrit and Jotzo, Luca and Binder, Karin and Frischemeier, Daniel}},
location = {{Münster}},
publisher = {{International Association for Statistics Education}},
title = {{{14th IASE Satellite Conference "Statistics and Data Science Education in STEAM"}}},
doi = {{10.52041/iase25.158}},
year = {{2026}},
}
@inproceedings{63918,
abstract = {{Many real-world datasets, such as citation networks, social networks, and molecular structures, are naturally represented as heterogeneous graphs, where nodes belong to different types and have additional features. For example, in a citation network, nodes representing "Paper" or "Author" may include attributes like keywords or affiliations. A critical machine learning task on these graphs is node classification, which is useful for applications such as fake news detection, corporate risk assessment, and molecular property prediction. Although Heterogeneous Graph Neural Networks (HGNNs) perform well in these contexts, their predictions remain opaque. Existing post-hoc explanation methods lack support for actual node features beyond one-hot encoding of node type and often fail to generate realistic, faithful explanations. To address these gaps, we propose DiGNNExplainer, a model-level explanation approach that synthesizes heterogeneous graphs with realistic node features via discrete denoising diffusion. In particular, we generate realistic discrete features (e.g., bag-of-words features) using diffusion models within a discrete space, whereas previous approaches are limited to continuous spaces. We evaluate our approach on multiple datasets and show that DiGNNExplainer produces explanations that are realistic and faithful to the model's decision-making, outperforming state-of-the-art methods.}},
author = {{Das, Pallabee and Heindorf, Stefan}},
booktitle = {{Proceedings of the ACM Web Conference 2026 (WWW ’26)}},
location = {{Dubai, United Arab Emirates}},
publisher = {{ACM}},
title = {{{Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with Node Features}}},
year = {{2026}},
}
@inproceedings{65489,
author = {{Okulmus, Cem and Ahmetaj, Shqiponja and Boneva, Iovka and Hidders, Jan and Jakubowski, Maxime and Labra Gayo, José Emilio and Martens, Wim and Mogavero, Fabio and Murlak, Filip and Savković, Ognjen and Šimkus, Mantas and Tomaszuk, Dominik }},
booktitle = {{Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning (KR 2026)}},
location = {{Lisbon, Portugal}},
title = {{{Common Foundations for Recursive Shape Languages}}},
year = {{2026}},
}
@article{63135,
abstract = {{We propose a definition of Coxeter-Dynkin algebras of canonical type generalising the definition as a path algebra of a quiver. Moreover, we construct two tilting objects over the squid algebra - one via generalised APR-tilting and one via one-point-extensions and reflection functors - and identify their endomorphism algebras with the Coxeter-Dynkin algebra. This shows that our definition gives another representative in the derived equivalence class of the squid algebra, and hence of the corresponding canonical algebra. Finally, we have a closer look at the Grothendieck group and the Euler form which illustrates the connection to Saito's classification of marked extended affine root systems. On the other hand, this enables us to prove that in the domestic case Coxeter-Dynkin algebras are of finite representation type.}},
author = {{Perniok, Daniel}},
journal = {{Journal of Pure and Applied Algebra}},
number = {{5}},
title = {{{Coxeter-Dynkin algebras of canonical type}}},
doi = {{10.1016/j.jpaa.2026.108250}},
volume = {{230}},
year = {{2026}},
}
@article{61152,
abstract = {{While neural network quantization effectively reduces the cost of matrix multiplications, aggressive quantization can expose non-matrix-multiply operations as significant performance and resource bottlenecks on embedded systems. Addressing such bottlenecks requires a comprehensive approach to tailoring the precision across operations in the inference computation. To this end, we introduce scaled-integer range analysis (SIRA), a static analysis technique employing interval arithmetic to determine the range, scale, and bias for tensors in quantized neural networks. We show how this information can be exploited to reduce the resource footprint of FPGA dataflow neural network accelerators via tailored bitwidth adaptation for accumulators and downstream operations, aggregation of scales and biases, and conversion of consecutive elementwise operations to thresholding operations. We integrate SIRA-driven optimizations into the open-source FINN framework, then evaluate their effectiveness across a range of quantized neural network workloads and compare implementation alternatives for non-matrix-multiply operations. We demonstrate an average reduction of 17\% for LUTs, 66\% for DSPs, and 22\% for accumulator bitwidths with SIRA optimizations, providing detailed benchmark analysis and analytical models to guide the implementation style for non-matrix layers. Finally, we open-source SIRA to facilitate community exploration of its benefits across various applications and hardware platforms.}},
author = {{Umuroglu, Yaman and Berganski, Christoph and Jentzsch, Felix and Danilowicz, Michal and Kryjak, Tomasz and Bezaitis, Charalampos and Sjalander, Magnus and Colbert, Ian and Preusser, Thomas and Petri-Koenig, Jakoba and Blott, Michaela}},
issn = {{1936-7406}},
journal = {{ACM Transactions on Reconfigurable Technology and Systems}},
title = {{{SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural Network Accelerators}}},
doi = {{10.1145/3807510}},
year = {{2026}},
}
@inproceedings{65501,
author = {{Stasytis, Lukas and Jentzsch, Felix and Preusser, Thomas and Umuroglu, Yaman and Petri-Koenig, Jakoba and István, Zsolt}},
booktitle = {{2025 International Conference on Field Programmable Technology (ICFPT)}},
publisher = {{IEEE}},
title = {{{Heuristic & Expert-Guided Buffer Sizing for Neural Network Inference Applications on FPGAs}}},
doi = {{10.1109/icfpt67023.2025.00032}},
year = {{2026}},
}
@inproceedings{65500,
author = {{Jentzsch, Felix and Platzner, Marco}},
booktitle = {{2025 International Conference on Field Programmable Technology (ICFPT)}},
publisher = {{IEEE}},
title = {{{Empirical QoR Estimation Flow for Fast Design Space Exploration of DNN Dataflow Accelerators}}},
doi = {{10.1109/icfpt67023.2025.00044}},
year = {{2026}},
}
@article{65512,
abstract = {{Zusammenfassung
Risikokompetenz beinhaltet auch die Fähigkeit, stochastische Informationen, wie beispielsweise Anteile und Wahrscheinlichkeiten, richtig zu versprachlichen. Aus der Forschung zu bedingten Wahrscheinlichkeiten und Bayesianischen Aufgaben ist bekannt, dass die Nutzung von Visualisierungen und sogenannten „natürlichen Häufigkeiten“ (z. B. „80 von 100 Personen“) statt Wahrscheinlichkeiten in Prozent Verwechslungen beim Bestimmen von Wahrscheinlichkeiten eindämmen kann. Über den umgekehrten Prozess – das Versprachlichen von in Visualisierungen dargestellten Informationen – ist bisher jedoch wenig bekannt, obwohl diese Versprachlichungen auch für den Aufbau konzeptuellen Wissen als essentiell angesehen werden. In der vorliegenden Studie wurde daher untersucht, wie gut Schüler:innen die Versprachlichung von in Visualisierungen dargestellten Anteilen und natürlichen Häufigkeiten gelingt. Dazu wurde mit 138 Realschüler:innen aus der 9. Jahrgangsstufe ein Papier-und-Bleistift-Test durchgeführt, bei dem den Teilnehmenden nacheinander je ein (vollständig ausgefülltes) Baumdiagramm und ein Netzdiagramm präsentiert wurde. Die Schüler:innen sollten die inhaltliche Bedeutung der in der Visualisierung dargestellten stochastischen Informationen möglichst genau versprachlichen. Fokus der Studie ist der Einfluss der Visualisierung (Baumdiagramm vs. Netzdiagramm) und des Informationsformats der Visualisierung (Anteile in Prozent vs. natürliche Häufigkeiten) auf die richtige Versprachlichung von verschiedenen Relationstypen (Schnittinformationen vs. bedingte Informationen). Die Ergebnisse zeigen unter anderem, dass Informationen in natürlichen Häufigkeiten deutlich besser versprachlicht werden als in Prozenten und dass Schnittinformationen in Prozent besser anhand von Netzdiagrammen als von Baumdiagrammen versprachlicht werden. Die gewonnenen Erkenntnisse geben überdies Einblicke in typische (fehlerhafte) Versprachlichungen von Schüler:innen und könnten als Basis für die Entwicklung eines sprachsensiblen Unterrichts zu Anteilen und Wahrscheinlichkeiten im schulischen Stochastikunterricht dienen.}},
author = {{Rößner, Michael and Binder, Karin and Albrecht, Julian}},
issn = {{0173-5322}},
journal = {{Journal für Mathematik-Didaktik}},
number = {{1}},
publisher = {{Springer Science and Business Media LLC}},
title = {{{Versprachlichung von Anteilen und natürlichen Häufigkeiten anhand von Baum- und Netzdiagrammen Verbalization of proportions and natural frequencies based on tree diagrams and net diagrams}}},
doi = {{10.1007/s13138-026-00267-1}},
volume = {{47}},
year = {{2026}},
}
@inbook{65515,
abstract = {{Abstract This study explores the usability and onboarding process of a Mixed Reality (MR) application called PEARL, designed to prepare students for laboratory work. Originally developed for mobile Augmented Reality (mAR), PEARL was adapted for MR to offer a more immersive and intuitive experience through hand and gesture controls. Since many students lack experience with MR devices, a user-friendly onboarding system is essential. The study aims to redesign PEARL’s user interface and onboarding experience, evaluating how intuitive interaction elements impact usability. First, a literature review will identify existing usability guidelines for MR applications, which will guide the redesign of the interface. This new version will then be tested with students through a user study. Feedback will be collected via an online survey to assess the onboarding and user experience, and the findings will be used to refine the design further. The expected outcome is an improved onboarding process and interface, making PEARL accessible even for MR novices, enhancing their ability to interact with 3D objects in a real-world setting. Ultimately, the study aims to provide best practices for developing intuitive MR interfaces and effective onboarding experiences, especially in educational contexts.}},
author = {{Alptekin, Mesut and Münstermann, Daniel and Temmen, Katrin}},
booktitle = {{Lecture Notes in Networks and Systems}},
isbn = {{9783032073181}},
issn = {{2367-3370}},
keywords = {{Meta Quest 3, Augmented Reality, Mixed Reality, PEARL, Electrical Engineering, Laboratory Training, Onboarding, User Experience, User Interface, Heuristics}},
location = {{Santiago, Chile}},
pages = {{199--211}},
publisher = {{Springer Nature Switzerland}},
title = {{{Designing and Evaluating the Usability and Onboarding for a Mixed-Reality Application: A Case Study with PEARL (Paderborn Electrical Engineering AR Laboratory) and Meta Quest 3}}},
doi = {{10.1007/978-3-032-07319-8_19}},
volume = {{2}},
year = {{2026}},
}
@inbook{65518,
abstract = {{Abstract
Optically assisted digital-to-analog converters (DACs) using Nyquist pulse sequences (NPSs) are presented and investigated. Therefore, NPSs are mathematically described and analyzed. Based on this, the operating principle of a precise optical Nyquist pulse synthesizer digital-to-analog converter (PONyDAC) is described. Possible architectures of PONyDAC are derived and compared in terms of performance and practicability. Moreover, the limits of PONyDAC systems and their superiority over classical electronic DACs are discussed. Furthermore, discrete building-block based implementations and monolithic implementations in electronic-photonic integrated circuits (EPICs) are presented. To enable a practicable monolithic integration, a shrinkage of the Mach-Zehnder modulators (MZMs) has been performed by applying forward-biased phase shifters (FB-PSs). These FB-PSs are analyzed and modeled to allow the precise and reliable design of PONyDAC systems with multiple MZMs. Finally, data conversion and data transmission experiments are carried out to demonstrate the systems functionality, quantify its performance, and prove their superiority over purely electronic DACs.}},
author = {{Scheytt, J. Christoph and Schwabe, Tobias and Singh, Karanveer and Kress, Christian and Schneider, Thomas}},
booktitle = {{Electronic-Photonic Integrated Systems for Ultrafast Signal Processing}},
editor = {{Scheytt, J. Christoph and Kress, Christian and Berroth, Manfred and Pachnicke, Stephan and Witzens, Jeremy}},
isbn = {{9783032083395}},
publisher = {{Springer Nature Switzerland}},
title = {{{Precise Optical Nyquist Pulse Synthesizer Digital-to-Analog Converter}}},
doi = {{10.1007/978-3-032-08340-1_4}},
year = {{2026}},
}
@book{65256,
editor = {{Scheytt, J. Christoph and Kress, Christian and Berroth, Manfred and Pachnicke, Stephan and Witzens, Jeremy}},
isbn = {{9783032083395}},
publisher = {{Springer Nature Switzerland}},
title = {{{Electronic-Photonic Integrated Systems for Ultrafast Signal Processing}}},
doi = {{10.1007/978-3-032-08340-1}},
year = {{2026}},
}
@article{65554,
abstract = {{Abstract
An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction, while supporting not only contractible but also incontractible loops on the boundaries of manifold objects of higher genus and arbitrary non‐trivial topology. We describe an implementation of this algorithm in the discrete setting, with triangle mesh cut surfaces embedded in tetrahedral mesh objects. Making use of this novel cutting algorithm, we describe a method for the reliable construction of bijective volumetric maps between solid objects, demonstrating the algorithm's utility. This mapping method overcomes restrictions of the state of the art to topological balls, extending coverage to objects of arbitrary genus, specifically so‐called
1
‐handlebodies.
}},
author = {{Hinderink, Steffen and Campen, Marcel}},
issn = {{0167-7055}},
journal = {{Computer Graphics Forum}},
publisher = {{Wiley}},
title = {{{DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping}}},
doi = {{10.1111/cgf.70379}},
year = {{2026}},
}
@inproceedings{65567,
abstract = {{We introduce the notion of contrastive ABox explanations to answer questions of the type “Why is a an instance of C, but b is not?”. While there are various approaches for explaining positive entailments (why is C(a) entailed by the knowledge base) as well as missing entailments (why is C(b) not entailed) in isolation, contrastive explanations consider both at the same time, which allows them to focus on the relevant commonalities and differences between a and b. We develop an appropriate notion of contrastive explanations for the special case of ABox reasoning with description logic ontologies, and analyze the computational complexity for different variants under different optimality criteria, considering lightweight as well as more expressive description logics. We
implemented a first method for computing one variant of contrastive explanations, and evaluated it on generated problems for realistic knowledge bases.}},
author = {{Koopmann, Patrick and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille and Tiwari, Balram}},
booktitle = {{Proceedings of the AAAI Conference on Artificial Intelligence}},
issn = {{2374-3468}},
number = {{23}},
pages = {{19189--19197}},
publisher = {{Association for the Advancement of Artificial Intelligence (AAAI)}},
title = {{{Can You Tell the Difference? Contrastive Explanations for ABox Entailments}}},
doi = {{10.1609/aaai.v40i23.38993}},
volume = {{40}},
year = {{2026}},
}
@article{61759,
abstract = {{Intersection distribution and non-hitting index are concepts introduced recently by Li and Pott as a new way to view the behaviour of a collection of finite field polynomials. With both an algebraic interpretation via the intersection of a polynomial with a set of lines, and a geometric interpretation via a (q+1)-set possessing an internal nucleus, the concepts have proved their usefulness as a new way to view various long-standing problems, and have applications in areas such as Kakeya sets. In this paper, by exploiting connections with diverse areas including the theory of algebraic curves, cyclotomy and the enumeration of irreducible polynomials, we establish new results and resolve various Open Problems of Li and Pott. We prove geometric results which shed new light on the relationship between intersection distribution and projective equivalence of polynomials, and algebraic results which describe and characterise the degree of Sf - the index of the largest non-zero entry in the intersection distribution of f. We provide new insights into the non-hitting spectrum, and show the limitations of the non-hitting index as a tool for characterisation. Finally, the benefits provided by the connections to other areas are evidenced in two short new proofs of the cubic case. }},
author = {{Klawuhn, Lukas-André Dominik and Huczynska, Sophie and Paterson, Maura}},
journal = {{Finite Fields and Their Applications}},
publisher = {{Elsevier}},
title = {{{The Intersection Distribution: New Results and Perspectives}}},
doi = {{10.1016/j.ffa.2026.102828}},
volume = {{114}},
year = {{2026}},
}
@inproceedings{65586,
author = {{Zeipert, Henning and Claes, Leander and Hölscher, Jonas and Wippermann, Mareen and Henning, Bernd}},
booktitle = {{Fortschritte der Akustik - DAGA 2026}},
pages = {{1566–1569}},
title = {{{An Approach for the Efficient Solution of Eigenvalue-based Inverse Problems for the Material Characterisation Using Guided Acoustic Waves}}},
doi = {{10.71568/DAGA2026.043}},
year = {{2026}},
}
@inproceedings{65587,
author = {{Claes, Leander}},
booktitle = {{Fortschritte der Akustik - DAGA 2026}},
pages = {{1089–1092}},
title = {{{Simultaneous measurement of bulk and shear viscosity using guided acoustic waves}}},
doi = {{10.71568/DAGA2026.006}},
year = {{2026}},
}
@inbook{65521,
abstract = {{We present recent progress made towards ultra-broadband photonically assisted analog-to-digital converters, that leverage both the low jitter of best-of-class mode-locked lasers as well as the capability of optics to break down broadband signals into multiple lower speed tributaries that can be better handled by electronics. We review in particular our work on both time- and frequency-domain approaches and give an outlook on how these architectures can be extended to include further signal processing tasks such as equalization. Optically triggered track-and-hold amplifiers are reported with an equivalent jitter below 80 fs rms in a signal frequency range from 20 GHz to 70 GHz. Frequency-domain architectures implementing optical arbitrary waveform measurement up to signal bandwidths of 610 GHz are also shown. Finally, an architecture allowing the deserialization and equalization of PAM4 signals is introduced and modeled for operation in 400 Gb/s links.}},
author = {{Witzens, Jeremy and Drayss, Daniel and Fang, Dengyang and Moscoso Mártir, Alvaro and Müller, Juliana and Weizel, Maxim and Zazzi, Andrea and Freude, Wolfgang and Koos, Christian and Randel, Sebastian and Scheytt, J. Christoph}},
booktitle = {{Electronic-Photonic Integrated Systems for Ultrafast Signal Processing}},
editor = {{Scheytt, J. Christoph and Kress, Christian and Berroth, Manfred and Pachnicke, Stephan and Witzens, Jeremy}},
isbn = {{9783032083395}},
publisher = {{Springer Nature Switzerland}},
title = {{{Ultra-Broadband Photonically Assisted Analog-to-Digital-Converters}}},
doi = {{10.1007/978-3-032-08340-1_3}},
year = {{2026}},
}
@inbook{65600,
abstract = {{Integrated photonic-assisted signal processing has multiple applications such as signal amplification, multiplexing, and high-Q filtering in optical communication systems, optical sensing systems, and also microwave photonics. We will review recent works on integrated photonic-assisted signal processing for sinc-shaped Nyquist pulse generation, high-bandwidth Nyquist signal detection with low bandwidth devices, arbitrary waveform generation and measurement, and on-chip photonic frequency decoding. However, in such photonic integrated circuits (PICs), the photonic components are placed very close to each other on the chip, resulting in thermal crosstalk which degrades the system performance. Air-filled oxide and deep trench designs have proven to be very effective in mitigating the thermal crosstalk for various frequently deployed photonic devices like Mach-Zehnder modulators (MZMs), ring resonators, optical switches, and photodetectors designed on a standard silicon-on-insulator (SOI) platform. In this chapter, we will additionally review the basics of optical signal processing and some results for such trench-enhanced thermal crosstalk resilient circuits.}},
author = {{De, Souvaraj and Mandalawi, Younus and Das, Ranjan and Weizel, Maxim}},
booktitle = {{Metrology for THz Communications}},
isbn = {{9783032019851}},
issn = {{0342-4111}},
publisher = {{Springer Nature Switzerland}},
title = {{{Integrated Photonic-Assisted Signal Processing and Thermal Crosstalk}}},
doi = {{10.1007/978-3-032-01986-8_20}},
year = {{2026}},
}
@inbook{65601,
abstract = {{High-speed ADCs operating in the tens of gigahertz up to potentially terahertz range are largely constrained by the jitter in their clock sources. By incorporating photonically assisted samplers that exploit the ultralow jitter of specific mode-locked lasers (MLLs) as analogue ADC frontends, the performance limits of data converters can be pushed to achieve unprecedented levels of accuracy. Continuous advancements in electronic-photonic integration (silicon photonics) are clearing the path for integrating these systems on a chip scale, thereby leading to increased scalability, as well as reduced cost and power consumption.}},
author = {{Weizel, Maxim and Bahmanian, Meysam and Scheytt, J. Christoph}},
booktitle = {{Metrology for THz Communications}},
isbn = {{9783032019851}},
issn = {{0342-4111}},
publisher = {{Springer Nature Switzerland}},
title = {{{Integrated Photonically Assisted Samplers}}},
doi = {{10.1007/978-3-032-01986-8_29}},
year = {{2026}},
}