@article{66074,
  abstract     = {{<jats:title>Abstract</jats:title>
                  <jats:p>This study investigates how secondary students construct and evaluate decision trees in an open exploratory task using CODAP. By analyzing students’ tree products and oral self-reports, we identified different data-based and context-based approaches to predictor selection and stopping criteria. Students engaged with key ideas of predictive modeling, including classification, model construction, accuracy, generalization, and interpretability. Informal exploration offered rich opportunities for subsequent teaching by enabling students to begin reconstructing central technical ideas and critical tensions of predictive modeling through diverse but meaningful reasoning approaches.</jats:p>}},
  author       = {{Fleischer, Franz Yannik and Biehler, Rolf}},
  issn         = {{1863-9690}},
  journal      = {{ZDM – Mathematics Education}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Informal approaches to predictive modeling: fostering data literacy and critical engagement through decision tree construction}}},
  doi          = {{10.1007/s11858-026-01806-3}},
  year         = {{2026}},
}

@inproceedings{66378,
  author       = {{Corman, Julien and Kontchakov, Roman and Okulmus, Cem}},
  booktitle    = {{Proceedings of the 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)}},
  location     = {{Cork, Ireland}},
  title        = {{{Querying Interval-Based Temporal Data with SPARQL}}},
  year         = {{2026}},
}

@inproceedings{66379,
  author       = {{Gortworst, Bente and Okulmus, Cem and Ortiz, Magdalena and Turhan, Anni-Yasmin}},
  booktitle    = {{Proceedings of the 39th International Workshop on Description Logics (DL 2026)}},
  title        = {{{Reaching for the Stars in EL Concept Learning}}},
  year         = {{2026}},
}

@misc{66382,
  author       = {{Wippermann, Mareen and Rickert, Marlene Ingeborg and Gebauer, Finn and Zeipert, Henning and Claes, Leander}},
  title        = {{{Characterisation of Internal Periodic Structures in Additively Manufactured Components Using Guided Acoustic Waves}}},
  year         = {{2026}},
}

@misc{66381,
  author       = {{Wippermann, Mareen and Rickert, Marlene Ingeborg and Gebauer, Finn}},
  title        = {{{Phononische Kristallographie mittels geführter akustischer Wellen}}},
  year         = {{2026}},
}

@inproceedings{66439,
  author       = {{Hüsing, Sven and Musaeus, Line Have and Caspersen, Michael E. and Schulte, Carsten and Barendsen, Erik and Grgurina, Nataša and Hauswirth, Matthias and Lonati, Violetta and Mani, Murali and Monga, Mattia and Nobles, Heidi and Reckinger, Scott and Silvia, Devin W. and Sparmann, Sören}},
  booktitle    = {{Proceedings of the 31st ACM Conference on Innovation and Technology in Computer Science Education V. 2}},
  publisher    = {{ACM}},
  title        = {{{Epistemic Programming as a Scientific Field: Building a Community of Practice and an Interaction-Based Framework}}},
  doi          = {{10.1145/3803401.3812051}},
  year         = {{2026}},
}

@article{60491,
  abstract     = {{We investigate generalisations of 1-factorisations and hyperfactorisations of the complete graph $K_{2n}$. We show that they are special subsets of the association scheme obtained from the Gelfand pair $(S_{2n},S_2 \wr S_n)$. This unifies and extends results by Cameron (1976) and gives rise to new existence and non-existence results. Our methods involve working in the group algebra $\mathbb{C}[S_{2n}]$ and using the representation theory of $S_{2n}$.}},
  author       = {{Klawuhn, Lukas-André Dominik and Bamberg, John}},
  journal      = {{Algebraic Combinatorics}},
  number       = {{3}},
  pages        = {{789--809}},
  title        = {{{On the association scheme of perfect matchings and their designs}}},
  doi          = {{10.5802/alco.490}},
  volume       = {{9}},
  year         = {{2026}},
}

@misc{66436,
  author       = {{Dören, Karl and Hetkämper, Tim}},
  title        = {{{Visualisierung von Schallausbreitungsphänomenen mittels Schlierentechnik}}},
  year         = {{2026}},
}

@misc{66434,
  author       = {{Hölscher, Jonas}},
  title        = {{{Effiziente Simulation nichtlinearer, elastodynamischer Prozesse}}},
  year         = {{2026}},
}

@inproceedings{63758,
  abstract     = {{Resilient systems require monitoring and prediction of environmental and intrinsic conditions and the ability to adapt to changing circumstances to optimize the trade-off between performance, power consumption, and fault tolerance. TETRISC was introduced as a resilient multicore RISC-V processor system based on the PULPissimo platform. This paper presents the migration of TETRISC to the Rocket Chip SoC, which is freely scalable to the number of processors through parametrizable Chisel models. As such, we discuss and evaluate the main advantages and obstacles that come with the Chipyard framework for RTL simulation and FPGA synthesis for the rapid prototyping of resilient, scalable architectures that are online configurable through software for different multicore and lock-step modes.}},
  author       = {{Hannemann, Kai Arne and Luchterhandt, Lars and Müller, Wolfgang and Ulbricht, Markus and Lu, Li}},
  booktitle    = {{38. ITG / GMM / GI - Workshop Testmethoden und Zuverlässigkeit von Schaltungen und Systemen}},
  keywords     = {{RISC-V, Multicore, Fault Tolerant, TETRISC, Chisel, Chipyard}},
  location     = {{Potsdam}},
  title        = {{{Redesigning the TETRISC Architecture for Scalable Rocket Chip Implementations}}},
  year         = {{2026}},
}

@inproceedings{65595,
  abstract     = {{Resilient systems require monitoring and prediction of environmental and intrinsic conditions, as well as the ability to adapt to environmental hazards while optimizing the trade-off among performance, power consumption, and fault tolerance. TETRISC was introduced as a resilient multicore RISC-V processor system based on the PULPissimo platform. We introduce the migration of TETRISC to the open-source Rocket Chip SoC, targeting scalable TETRISC Chisel implementations. As such, we discuss and evaluate the main advantages and obstacles that come with the Chipyard framework for RTL simulation and FPGA synthesis, enabling rapid prototyping of resilient, scalable architectures configurable for multicore and lockstep modes.}},
  author       = {{Hannemann, Kai Arne and Luchterhandt, Lars and Müller, Wolfgang and Ulbricht, Markus and Lu, Li and Scheytt, J. Christoph}},
  booktitle    = {{29. Workshop Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV 2026)}},
  location     = {{Würzburg}},
  title        = {{{TETRISC on Rocket Chip: A Scalable and Adaptive RISC-V Multicore Architecture}}},
  year         = {{2026}},
}

@inproceedings{66603,
  author       = {{Dou, Jinfeng and Götte, Thorsten and Hillebrandt, Henning and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783032264640}},
  issn         = {{0302-9743}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Fast Distributed Computation of Compact Routing Schemes}}},
  doi          = {{10.1007/978-3-032-26465-7_19}},
  year         = {{2026}},
}

@inproceedings{66602,
  author       = {{Augustine, John and Hillebrandt, Henning and Kumar, Manish and Scheideler, Christian and Werthmann, Julian}},
  booktitle    = {{Proceedings of the ACM Symposium on Principles of Distributed Computing}},
  publisher    = {{ACM}},
  title        = {{{Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers}}},
  doi          = {{10.1145/3796701.3815939}},
  year         = {{2026}},
}

@inproceedings{66604,
  author       = {{Friesen, Olga and Hölscher, Jonas and Spieker, Carsten and Förstner, Jens and Claes, Leander}},
  location     = {{München}},
  title        = {{{Quantitative Modelling of Dynamic Nonlinearity in Piezoelectric Components}}},
  year         = {{2026}},
}

@unpublished{66642,
  abstract     = {{In this work, we build a bridge between the Pólya--Schur program and Voiculescu's free probability theory. A cornerstone of the former is the Pólya--Benz Theorem, classifying a central family of real-root preserving operators on the space of polynomials, as those given by $f(\partial_z)$ for a Laguerre--Pólya function $f$ and the derivative operator $\partial_{z}$. We prove that any free (additive) infinitely divisible distribution can be attained as the weak limit of root distributions of Appell polynomials $f_n(\partial_z)z^n$ as $n\to\infty$, for a suitably chosen sequence $f_n$ of Laguerre--Pólya functions.
  Such questions on the (global) limiting distributions of real rooted polynomials belong to the active research area of finite free probability. In contrast to its standard tools, our approach allows for non-compactly supported limiting distributions, (barely) complex rooted polynomials and even provides the full microscopic description of the roots. Moreover, we extend our results to differential operators generating free multiplicative infinitely divisible distributions, to the rectangular free convolution, and to $f_n(\partial_z)p_n$ for real rooted polynomials $p_n$, implying a generalization of the recent connections between the heat flow and free Brownian motion to any free Lévy process.
  As corollaries, we identify free stable distributions by choosing $f_n$ to be a fixed rescaled Laguerre--Pólya function, and we prove various convergence results on the zero distributions of Jensen polynomials, e.g. the limiting root distribution of Jensen polynomial of the Riemann $Ξ$-function is given by the Cauchy distribution.}},
  author       = {{Campbell, Andrew and Jalowy, Jonas}},
  booktitle    = {{arXiv:2605.31356}},
  title        = {{{Pólya--Schur problems and free probability}}},
  year         = {{2026}},
}

@article{66641,
  author       = {{Jalowy, Jonas and Stange, Hanna}},
  issn         = {{0304-4149}},
  journal      = {{Stochastic Processes and their Applications}},
  publisher    = {{Elsevier BV}},
  title        = {{{Box-covariances of hyperuniform point processes}}},
  doi          = {{10.1016/j.spa.2026.104996}},
  volume       = {{199}},
  year         = {{2026}},
}

@inproceedings{66687,
  abstract     = {{With a range of consumer devices available, augmented reality (AR) continues to make its way into everyday life and is also increasingly used in professional and sensitive contexts. Especially collaborative use cases, such as remote meetings or maintenance, offer potential, but also move issues in the area of privacy and security into focus. We conducted a scoping review to gain an overview of the current situation and found a lack of clear standards, with most approaches focusing on single protection features. Using the knowledge from the scoping review, we set up and conducted expert interviews. They revealed that end-users are almost completely dependent on developers or device manufacturers regarding their options for protection. The interviews also showed that most developers put little focus on privacy and security, often due to external constraints, such as employers treating the topic as an “afterthought” and not budgeting enough time for it. The experts suggested offering better software support to developers to enable the inclusion of privacy and security with less overhead as a solution. It was also suggested that a general rise in privacy and security awareness could improve the overall situation.}},
  author       = {{Krings, Sarah Claudia and Yigitbas, Enes and Sauer, Stefan}},
  booktitle    = {{Blending Experiences in Interaction Design}},
  editor       = {{Maciel, Cristiano and Spano, Davide Lucio and Ardito, Carmelo and Freire, André and Prates, Raquel}},
  isbn         = {{978-3-032-22934-2}},
  pages        = {{253–276}},
  publisher    = {{Springer Nature Switzerland}},
  title        = {{{Perspectives on Privacy and Security in Collaborative AR - Insights from a Scoping Review and an Expert Interview Study}}},
  year         = {{2026}},
}

@article{66688,
  author       = {{Wüppelmann, Dennis and Yigitbas, Enes}},
  issn         = {{2944-7682}},
  journal      = {{GI - Software Engineering }},
  publisher    = {{Gesellschaft für Informatik, Bonn}},
  title        = {{{SecCityVR: Visualization and Collaborative Exploration of Software Vulnerabilities in Virtual Reality}}},
  doi          = {{10.18420/se2026_53}},
  year         = {{2026}},
}

@unpublished{66731,
  abstract     = {{We generalize intersection numbers for combinatorial designs to designs in finite meet-semilattices satisfying suitable regularity conditions. While designs in regular semilattices go back to Delsarte, our regularity assumptions are weaker than his and need not give rise to an association scheme. In this framework, we extend Mendelsohn's equations, prove a generalized Singleton bound with Steiner systems as equality cases, and determine the block intersection distribution at any block of a Steiner system. In particular, this distribution is independent of the chosen block.
  Specializing to several classical semilattice families, our results recover a number of well-known distributions in coding and design theory. In the Hamming and the $q$-Hamming (or bilinear forms) schemes, they give the local distance distributions of MDS and MRD codes, respectively. In the Johnson and $q$-Johnson (or Graßmann) schemes, they reproduce the block intersection distribution of classical and $q$-analog Steiner systems, equivalently the distance distribution of diameter-perfect constant-weight codes and diameter-perfect constant-dimension subspace codes. For the $q$-Johnson schemes, to the best of our knowledge, this result is new. As a further illustration, we apply our theory to designs of perfect matchings.
  Our approach provides a unified treatment of these cases in the strongest form known in the literature, determining the distribution relative to each individual block or codeword, without averaging and without linearity or additivity assumptions. Moreover, it identifies the natural double-counting objects underlying these distributions, leading to formulas in the regularity parameters of the semilattice and avoiding the more cumbersome expressions that arise in eigenvalue-based approaches via the ambient association scheme.}},
  author       = {{Kiermaier, Michael and Klawuhn, Lukas-André Dominik}},
  title        = {{{Intersection numbers for designs in regular semilattices}}},
  year         = {{2026}},
}

@inproceedings{66832,
  author       = {{Tahir, Faiza and Ullah, Ubaid and Bodden, Eric}},
  booktitle    = {{Proceedings of the 21st International Conference on Software Technologies}},
  publisher    = {{SCITEPRESS - Science and Technology Publications}},
  title        = {{{Trustworthy AI: Operationalizing Responsibility in Lifecycle-Aware AI Threat Modeling through RACI}}},
  doi          = {{10.5220/0015000700004088}},
  year         = {{2026}},
}