---
_id: '65098'
author:
- first_name: Daniel
full_name: Weber, Daniel
last_name: Weber
- first_name: Jarren
full_name: Lange, Jarren
last_name: Lange
- first_name: Oliver
full_name: Wallscheid, Oliver
last_name: Wallscheid
citation:
ama: Weber D, Lange J, Wallscheid O. Reinforcement Learning-Based Control of Voltage-Forming
Grid Inverters With Arbitrary Loads. IEEE Journal of Emerging and Selected
Topics in Industrial Electronics. Published online 2026:1-12. doi:10.1109/jestie.2026.3654784
apa: Weber, D., Lange, J., & Wallscheid, O. (2026). Reinforcement Learning-Based
Control of Voltage-Forming Grid Inverters With Arbitrary Loads. IEEE Journal
of Emerging and Selected Topics in Industrial Electronics, 1–12. https://doi.org/10.1109/jestie.2026.3654784
bibtex: '@article{Weber_Lange_Wallscheid_2026, title={Reinforcement Learning-Based
Control of Voltage-Forming Grid Inverters With Arbitrary Loads}, DOI={10.1109/jestie.2026.3654784},
journal={IEEE Journal of Emerging and Selected Topics in Industrial Electronics},
publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Weber,
Daniel and Lange, Jarren and Wallscheid, Oliver}, year={2026}, pages={1–12} }'
chicago: Weber, Daniel, Jarren Lange, and Oliver Wallscheid. “Reinforcement Learning-Based
Control of Voltage-Forming Grid Inverters With Arbitrary Loads.” IEEE Journal
of Emerging and Selected Topics in Industrial Electronics, 2026, 1–12. https://doi.org/10.1109/jestie.2026.3654784.
ieee: 'D. Weber, J. Lange, and O. Wallscheid, “Reinforcement Learning-Based Control
of Voltage-Forming Grid Inverters With Arbitrary Loads,” IEEE Journal of Emerging
and Selected Topics in Industrial Electronics, pp. 1–12, 2026, doi: 10.1109/jestie.2026.3654784.'
mla: Weber, Daniel, et al. “Reinforcement Learning-Based Control of Voltage-Forming
Grid Inverters With Arbitrary Loads.” IEEE Journal of Emerging and Selected
Topics in Industrial Electronics, Institute of Electrical and Electronics
Engineers (IEEE), 2026, pp. 1–12, doi:10.1109/jestie.2026.3654784.
short: D. Weber, J. Lange, O. Wallscheid, IEEE Journal of Emerging and Selected
Topics in Industrial Electronics (2026) 1–12.
date_created: 2026-03-23T16:35:16Z
date_updated: 2026-03-23T16:35:24Z
department:
- _id: '34'
- _id: '52'
doi: 10.1109/jestie.2026.3654784
language:
- iso: eng
page: 1-12
publication: IEEE Journal of Emerging and Selected Topics in Industrial Electronics
publication_identifier:
issn:
- 2687-9735
- 2687-9743
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Reinforcement Learning-Based Control of Voltage-Forming Grid Inverters With
Arbitrary Loads
type: journal_article
user_id: '24041'
year: '2026'
...
---
_id: '65178'
abstract:
- lang: eng
text: "Large intermediate results can cause join queries to run unexpectedly long.
This problem is particularly common for analytical queries, which aggregate data
over many tables to produce a comparatively small final output, and queries on
graph data, where intermediate results blow up quickly. Recent work inspired by
Yannakakis’ algorithm approaches this by modifying the query engine to avoid materializing
unnecessary tuples. However, this requires significant changes to the core of
the system, which is not feasible in many situations such as cloud environments
or proprietary systems.\r\nIn this work, we propose a flexible approach for optimizing
long-running join queries from the outside of the DBMS. Rewriting-based realizations
of Yannakakis’ algorithm suffer from inherent overhead due to the creation of
intermediate tables. Thus, we present an approach for detecting and targeting
queries which would benefit from a Yannakakis-style optimization. We introduce
a new benchmark combining 5 standard benchmarks and augmenting them with additional
instances, which provides a sufficient size and diversity for a machine learning
based solution. On PostgreSQL, DuckDB and SparkSQL, slowdowns on queries where
the rewriting is counterproductive are mostly avoided, as opposed to a naïve application
of the rewriting, and we observe significant improvements in end-to-end runtimes
over standard query execution and unconditional rewriting."
author:
- first_name: Daniela
full_name: Böhm, Daniela
last_name: Böhm
- first_name: Georg
full_name: Gottlob, Georg
last_name: Gottlob
- first_name: Matthias
full_name: Lanzinger, Matthias
last_name: Lanzinger
- first_name: Davide Mario
full_name: Longo, Davide Mario
last_name: Longo
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Reinhard
full_name: Pichler, Reinhard
last_name: Pichler
- first_name: Alexander
full_name: Selzer, Alexander
last_name: Selzer
citation:
ama: 'Böhm D, Gottlob G, Lanzinger M, et al. Selective Use of Yannakakis’ Algorithm
for Consistent Performance Gains. In: Proceedings of the 28th International
Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
(DOLAP 2026). ; 2026.'
apa: Böhm, D., Gottlob, G., Lanzinger, M., Longo, D. M., Okulmus, C., Pichler, R.,
& Selzer, A. (2026). Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains. Proceedings of the 28th International Workshop on Design,
Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026).
bibtex: '@inproceedings{Böhm_Gottlob_Lanzinger_Longo_Okulmus_Pichler_Selzer_2026,
place={Tampere, Finland}, title={Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains}, booktitle={Proceedings of the 28th International Workshop
on Design, Optimization, Languages and Analytical Processing of Big Data (DOLAP
2026)}, author={Böhm, Daniela and Gottlob, Georg and Lanzinger, Matthias and Longo,
Davide Mario and Okulmus, Cem and Pichler, Reinhard and Selzer, Alexander}, year={2026}
}'
chicago: Böhm, Daniela, Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem
Okulmus, Reinhard Pichler, and Alexander Selzer. “Selective Use of Yannakakis’
Algorithm for Consistent Performance Gains.” In Proceedings of the 28th International
Workshop on Design, Optimization, Languages and Analytical Processing of Big Data
(DOLAP 2026). Tampere, Finland, 2026.
ieee: D. Böhm et al., “Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains,” 2026.
mla: Böhm, Daniela, et al. “Selective Use of Yannakakis’ Algorithm for Consistent
Performance Gains.” Proceedings of the 28th International Workshop on Design,
Optimization, Languages and Analytical Processing of Big Data (DOLAP 2026),
2026.
short: 'D. Böhm, G. Gottlob, M. Lanzinger, D.M. Longo, C. Okulmus, R. Pichler, A.
Selzer, in: Proceedings of the 28th International Workshop on Design, Optimization,
Languages and Analytical Processing of Big Data (DOLAP 2026), Tampere, Finland,
2026.'
date_created: 2026-03-27T15:20:54Z
date_updated: 2026-03-27T15:22:01Z
department:
- _id: '888'
keyword:
- Join Queries
- Acyclic Queries
- Query Processing
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://ceur-ws.org/Vol-4186/paper2.pdf
oa: '1'
place: Tampere, Finland
publication: Proceedings of the 28th International Workshop on Design, Optimization,
Languages and Analytical Processing of Big Data (DOLAP 2026)
status: public
title: Selective Use of Yannakakis’ Algorithm for Consistent Performance Gains
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '57580'
abstract:
- lang: eng
text: We investigate dispersive and Strichartz estimates for the Schrödinger equation
involving the fractional Laplacian in real hyperbolic spaces and their discrete
analogues, homogeneous trees. Due to the Knapp phenomenon, the Strichartz estimates
on Euclidean spaces for the fractional Laplacian exhibit loss of derivatives.
A similar phenomenon appears on real hyperbolic spaces. However, such a loss disappears
on homogeneous trees, due to the triviality of the estimates for small times.
author:
- first_name: Guendalina
full_name: Palmirotta, Guendalina
id: '109467'
last_name: Palmirotta
- first_name: Yannick
full_name: Sire, Yannick
last_name: Sire
- first_name: Jean-Philippe
full_name: Anker, Jean-Philippe
last_name: Anker
citation:
ama: Palmirotta G, Sire Y, Anker J-P. The Schrödinger equation with fractional Laplacian
on hyperbolic spaces and homogeneous trees. Journal of Differential Equations.
Published online 2026. doi:10.1016/j.jde.2025.114065
apa: Palmirotta, G., Sire, Y., & Anker, J.-P. (2026). The Schrödinger equation
with fractional Laplacian on hyperbolic spaces and homogeneous trees. Journal
of Differential Equations. https://doi.org/10.1016/j.jde.2025.114065
bibtex: '@article{Palmirotta_Sire_Anker_2026, title={The Schrödinger equation with
fractional Laplacian on hyperbolic spaces and homogeneous trees}, DOI={10.1016/j.jde.2025.114065},
journal={Journal of Differential Equations}, publisher={Elsevier}, author={Palmirotta,
Guendalina and Sire, Yannick and Anker, Jean-Philippe}, year={2026} }'
chicago: Palmirotta, Guendalina, Yannick Sire, and Jean-Philippe Anker. “The Schrödinger
Equation with Fractional Laplacian on Hyperbolic Spaces and Homogeneous Trees.”
Journal of Differential Equations, 2026. https://doi.org/10.1016/j.jde.2025.114065.
ieee: 'G. Palmirotta, Y. Sire, and J.-P. Anker, “The Schrödinger equation with fractional
Laplacian on hyperbolic spaces and homogeneous trees,” Journal of Differential
Equations, 2026, doi: 10.1016/j.jde.2025.114065.'
mla: Palmirotta, Guendalina, et al. “The Schrödinger Equation with Fractional Laplacian
on Hyperbolic Spaces and Homogeneous Trees.” Journal of Differential Equations,
Elsevier, 2026, doi:10.1016/j.jde.2025.114065.
short: G. Palmirotta, Y. Sire, J.-P. Anker, Journal of Differential Equations (2026).
date_created: 2024-12-04T16:21:38Z
date_updated: 2026-03-30T12:03:37Z
department:
- _id: '10'
- _id: '548'
doi: 10.1016/j.jde.2025.114065
external_id:
arxiv:
- '2412.00780'
keyword:
- Schrödinger equation
- Fractional Laplacian
- Dispersive estimates
- Strichartz estimates
- Real hyperbolic spaces
- Homogeneous trees
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.jde.2025.114065
oa: '1'
project:
- _id: '356'
name: 'TRR 358 - B02: TRR 358 - Spektraltheorie in höherem Rang und unendlichem
Volumen (Teilprojekt B02)'
publication: Journal of Differential Equations
publication_status: published
publisher: Elsevier
related_material:
link:
- relation: confirmation
url: https://www.sciencedirect.com/science/article/pii/S0022039625010927?via%3Dihub
status: public
title: The Schrödinger equation with fractional Laplacian on hyperbolic spaces and
homogeneous trees
type: journal_article
user_id: '109467'
year: '2026'
...
---
_id: '65232'
abstract:
- lang: eng
text: On finite regular graphs, we construct Patterson-Sullivan distributions associated
with eigenfunctions of the discrete Laplace operator via their boundary values
on the phase space. These distributions are closely related to Wigner distributions
defined via a pseudo-differential calculus on graphs, which appear naturally in
the study of quantum chaos. Using a pairing formula, we prove that Patterson-Sullivan
distributions are also related to invariant Ruelle distributions arising from
the transfer operator of the geodesic flow on the shift space. Both relationships
provide discrete analogues of results for compact hyperbolic surfaces obtained
by Anantharaman-Zelditch and by Guillarmou-Hilgert-Weich.
author:
- first_name: Christian
full_name: Arends, Christian
last_name: Arends
- first_name: Guendalina
full_name: Palmirotta, Guendalina
id: '109467'
last_name: Palmirotta
citation:
ama: Arends C, Palmirotta G. Patterson-Sullivan distributions of finite regular
graphs. arXiv:260309779. Published online 2026.
apa: Arends, C., & Palmirotta, G. (2026). Patterson-Sullivan distributions of
finite regular graphs. In arXiv:2603.09779.
bibtex: '@article{Arends_Palmirotta_2026, title={Patterson-Sullivan distributions
of finite regular graphs}, journal={arXiv:2603.09779}, author={Arends, Christian
and Palmirotta, Guendalina}, year={2026} }'
chicago: Arends, Christian, and Guendalina Palmirotta. “Patterson-Sullivan Distributions
of Finite Regular Graphs.” ArXiv:2603.09779, 2026.
ieee: C. Arends and G. Palmirotta, “Patterson-Sullivan distributions of finite regular
graphs,” arXiv:2603.09779. 2026.
mla: Arends, Christian, and Guendalina Palmirotta. “Patterson-Sullivan Distributions
of Finite Regular Graphs.” ArXiv:2603.09779, 2026.
short: C. Arends, G. Palmirotta, ArXiv:2603.09779 (2026).
date_created: 2026-03-30T11:56:04Z
date_updated: 2026-03-30T12:02:56Z
department:
- _id: '548'
- _id: '10'
- _id: '34'
external_id:
arxiv:
- '2603.09779'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2603.09779
oa: '1'
page: '38'
project:
- _id: '358'
name: 'TRR 358; TP B04: Geodätische Flüsse und Weyl Kammer Flüsse auf affinen Gebäuden'
publication: arXiv:2603.09779
status: public
title: Patterson-Sullivan distributions of finite regular graphs
type: preprint
user_id: '109467'
year: '2026'
...
---
_id: '63530'
abstract:
- lang: eng
text: 'The widespread deployment of 5G networks, together with the coexistence of
4G/LTE networks, provides mobile devices a diverse set of candidate cells to connect
to. However, associating mobile devices to cells to maximize overall network performance,
a.k.a. cell (re)selection, remains a key challenge for mobile operators. Today,
cell (re)selection parameters are typically configured manually based on operator
experience and rarely adapted to dynamic network conditions. In this work, we
ask: Can an agent automatically learn and adapt cell (re)selection parameters
to consistently improve network performance? We present a reinforcement learning
(RL)-based framework called CellPilot that adaptively tunes cell (re)selection
parameters by learning spatiotemporal patterns of mobile network dynamics. Our
study with real-world data demonstrates that even a lightweight RL agent can outperform
conventional heuristic reconfigurations by up to 167%, while generalizing effectively
across different network scenarios. These results indicate that data-driven approaches
can significantly improve cell (re)selection configurations and enhance mobile
network performance.'
author:
- first_name: Marvin
full_name: Illian, Marvin
id: '44169'
last_name: Illian
orcid: 0009-0007-2992-8346
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Antonio A. de A.
full_name: Rocha, Antonio A. de A.
last_name: Rocha
- first_name: Lin
full_name: Wang, Lin
id: '102868'
last_name: Wang
orcid: 0000-0001-7181-6128
citation:
ama: 'Illian M, Khalili R, Rocha AA de A, Wang L. Cells on Autopilot: Adaptive Cell
(Re)Selection via Reinforcement Learning. arXiv:260104083. Published online
2026.'
apa: 'Illian, M., Khalili, R., Rocha, A. A. de A., & Wang, L. (2026). Cells
on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning. In arXiv:2601.04083.'
bibtex: '@article{Illian_Khalili_Rocha_Wang_2026, title={Cells on Autopilot: Adaptive
Cell (Re)Selection via Reinforcement Learning}, journal={arXiv:2601.04083}, author={Illian,
Marvin and Khalili, Ramin and Rocha, Antonio A. de A. and Wang, Lin}, year={2026}
}'
chicago: 'Illian, Marvin, Ramin Khalili, Antonio A. de A. Rocha, and Lin Wang. “Cells
on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning.” ArXiv:2601.04083,
2026.'
ieee: 'M. Illian, R. Khalili, A. A. de A. Rocha, and L. Wang, “Cells on Autopilot:
Adaptive Cell (Re)Selection via Reinforcement Learning,” arXiv:2601.04083.
2026.'
mla: 'Illian, Marvin, et al. “Cells on Autopilot: Adaptive Cell (Re)Selection via
Reinforcement Learning.” ArXiv:2601.04083, 2026.'
short: M. Illian, R. Khalili, A.A. de A. Rocha, L. Wang, ArXiv:2601.04083 (2026).
date_created: 2026-01-08T07:58:22Z
date_updated: 2026-03-31T06:44:22Z
department:
- _id: '75'
external_id:
arxiv:
- '2601.04083'
language:
- iso: eng
publication: arXiv:2601.04083
status: public
title: 'Cells on Autopilot: Adaptive Cell (Re)Selection via Reinforcement Learning'
type: preprint
user_id: '102868'
year: '2026'
...
---
_id: '65249'
author:
- first_name: Huzaifa
full_name: Shaaban KabakiboKabakibo, Huzaifa
last_name: Shaaban KabakiboKabakibo
- first_name: Animesh
full_name: Trivedi, Animesh
last_name: Trivedi
- first_name: Lin
full_name: Wang, Lin
id: '102868'
last_name: Wang
orcid: 0000-0001-7181-6128
citation:
ama: 'Shaaban KabakiboKabakibo H, Trivedi A, Wang L. Breaking the Ice: Analyzing
Cold Start Latency in vLLM. In: The 9th Annual Conference on Machine Learning
and Systems (MLSys). ; 2026.'
apa: 'Shaaban KabakiboKabakibo, H., Trivedi, A., & Wang, L. (2026). Breaking
the Ice: Analyzing Cold Start Latency in vLLM. The 9th Annual Conference on
Machine Learning and Systems (MLSys). The 9th Annual Conference on Machine
Learning and Systems (MLSys 2026) , Bellevue, WA.'
bibtex: '@inproceedings{Shaaban KabakiboKabakibo_Trivedi_Wang_2026, title={Breaking
the Ice: Analyzing Cold Start Latency in vLLM}, booktitle={The 9th Annual Conference
on Machine Learning and Systems (MLSys)}, author={Shaaban KabakiboKabakibo, Huzaifa
and Trivedi, Animesh and Wang, Lin}, year={2026} }'
chicago: 'Shaaban KabakiboKabakibo, Huzaifa, Animesh Trivedi, and Lin Wang. “Breaking
the Ice: Analyzing Cold Start Latency in VLLM.” In The 9th Annual Conference
on Machine Learning and Systems (MLSys), 2026.'
ieee: 'H. Shaaban KabakiboKabakibo, A. Trivedi, and L. Wang, “Breaking the Ice:
Analyzing Cold Start Latency in vLLM,” presented at the The 9th Annual Conference
on Machine Learning and Systems (MLSys 2026) , Bellevue, WA, 2026.'
mla: 'Shaaban KabakiboKabakibo, Huzaifa, et al. “Breaking the Ice: Analyzing Cold
Start Latency in VLLM.” The 9th Annual Conference on Machine Learning and Systems
(MLSys), 2026.'
short: 'H. Shaaban KabakiboKabakibo, A. Trivedi, L. Wang, in: The 9th Annual Conference
on Machine Learning and Systems (MLSys), 2026.'
conference:
end_date: 2026-05-22
location: Bellevue, WA
name: 'The 9th Annual Conference on Machine Learning and Systems (MLSys 2026) '
start_date: 2026-05-18
date_created: 2026-03-31T06:34:37Z
date_updated: 2026-03-31T06:41:10Z
department:
- _id: '34'
- _id: '7'
- _id: '75'
language:
- iso: eng
publication: The 9th Annual Conference on Machine Learning and Systems (MLSys)
status: public
title: 'Breaking the Ice: Analyzing Cold Start Latency in vLLM'
type: conference
user_id: '102868'
year: '2026'
...
---
_id: '65250'
author:
- first_name: Sepideh
full_name: Zohdi, Sepideh
last_name: Zohdi
- first_name: Lin
full_name: Wang, Lin
id: '102868'
last_name: Wang
orcid: 0000-0001-7181-6128
citation:
ama: 'Zohdi S, Wang L. Before the First Token: Benchmarking Data Preprocessing in
Vision-Language Models . In: The 6th Workshop on Machine Learning and Systems
(EuroMLSys). ; 2026.'
apa: 'Zohdi, S., & Wang, L. (2026). Before the First Token: Benchmarking Data
Preprocessing in Vision-Language Models . The 6th Workshop on Machine Learning
and Systems (EuroMLSys). The 6th Workshop on Machine Learning and Systems
(EuroMLSys), Edinburg.'
bibtex: '@inproceedings{Zohdi_Wang_2026, title={Before the First Token: Benchmarking
Data Preprocessing in Vision-Language Models }, booktitle={The 6th Workshop on
Machine Learning and Systems (EuroMLSys)}, author={Zohdi, Sepideh and Wang, Lin},
year={2026} }'
chicago: 'Zohdi, Sepideh, and Lin Wang. “Before the First Token: Benchmarking Data
Preprocessing in Vision-Language Models .” In The 6th Workshop on Machine Learning
and Systems (EuroMLSys), 2026.'
ieee: 'S. Zohdi and L. Wang, “Before the First Token: Benchmarking Data Preprocessing
in Vision-Language Models ,” presented at the The 6th Workshop on Machine Learning
and Systems (EuroMLSys), Edinburg, 2026.'
mla: 'Zohdi, Sepideh, and Lin Wang. “Before the First Token: Benchmarking Data Preprocessing
in Vision-Language Models .” The 6th Workshop on Machine Learning and Systems
(EuroMLSys), 2026.'
short: 'S. Zohdi, L. Wang, in: The 6th Workshop on Machine Learning and Systems
(EuroMLSys), 2026.'
conference:
end_date: 2026-04-27
location: Edinburg
name: The 6th Workshop on Machine Learning and Systems (EuroMLSys)
start_date: 2026-04-27
date_created: 2026-03-31T06:38:34Z
date_updated: 2026-03-31T06:39:41Z
department:
- _id: '34'
- _id: '7'
- _id: '75'
language:
- iso: eng
publication: The 6th Workshop on Machine Learning and Systems (EuroMLSys)
status: public
title: 'Before the First Token: Benchmarking Data Preprocessing in Vision-Language
Models '
type: conference
user_id: '102868'
year: '2026'
...
---
_id: '65253'
article_number: '306'
author:
- first_name: Ali Hassan Ali
full_name: Abdelwanis, Ali Hassan Ali
last_name: Abdelwanis
- first_name: Barnabas
full_name: Haucke-Korber, Barnabas
id: '93461'
last_name: Haucke-Korber
orcid: 0000-0003-0862-2069
- first_name: Darius
full_name: Jakobeit, Darius
last_name: Jakobeit
- first_name: Wilhelm
full_name: Kirchgässner, Wilhelm
id: '49265'
last_name: Kirchgässner
orcid: 0000-0001-9490-1843
- first_name: Marvin
full_name: Meyer, Marvin
last_name: Meyer
- first_name: Maximilian
full_name: Schenke, Maximilian
id: '52638'
last_name: Schenke
orcid: 0000-0001-5427-9527
- first_name: Hendrik
full_name: Vater, Hendrik
id: '63220'
last_name: Vater
- first_name: Oliver
full_name: Wallscheid, Oliver
id: '11291'
last_name: Wallscheid
orcid: https://orcid.org/0000-0001-9362-8777
- first_name: Daniel
full_name: Weber, Daniel
id: '24041'
last_name: Weber
orcid: 0000-0003-3367-5998
citation:
ama: 'Abdelwanis AHA, Haucke-Korber B, Jakobeit D, et al. Reinforcement Learning:
A Comprehensive Open-Source Course. Journal of Open Source Education. 2026;9(97).
doi:10.21105/jose.00306'
apa: 'Abdelwanis, A. H. A., Haucke-Korber, B., Jakobeit, D., Kirchgässner, W., Meyer,
M., Schenke, M., Vater, H., Wallscheid, O., & Weber, D. (2026). Reinforcement
Learning: A Comprehensive Open-Source Course. Journal of Open Source Education,
9(97), Article 306. https://doi.org/10.21105/jose.00306'
bibtex: '@article{Abdelwanis_Haucke-Korber_Jakobeit_Kirchgässner_Meyer_Schenke_Vater_Wallscheid_Weber_2026,
title={Reinforcement Learning: A Comprehensive Open-Source Course}, volume={9},
DOI={10.21105/jose.00306}, number={97306},
journal={Journal of Open Source Education}, publisher={The Open Journal}, author={Abdelwanis,
Ali Hassan Ali and Haucke-Korber, Barnabas and Jakobeit, Darius and Kirchgässner,
Wilhelm and Meyer, Marvin and Schenke, Maximilian and Vater, Hendrik and Wallscheid,
Oliver and Weber, Daniel}, year={2026} }'
chicago: 'Abdelwanis, Ali Hassan Ali, Barnabas Haucke-Korber, Darius Jakobeit, Wilhelm
Kirchgässner, Marvin Meyer, Maximilian Schenke, Hendrik Vater, Oliver Wallscheid,
and Daniel Weber. “Reinforcement Learning: A Comprehensive Open-Source Course.”
Journal of Open Source Education 9, no. 97 (2026). https://doi.org/10.21105/jose.00306.'
ieee: 'A. H. A. Abdelwanis et al., “Reinforcement Learning: A Comprehensive
Open-Source Course,” Journal of Open Source Education, vol. 9, no. 97,
Art. no. 306, 2026, doi: 10.21105/jose.00306.'
mla: 'Abdelwanis, Ali Hassan Ali, et al. “Reinforcement Learning: A Comprehensive
Open-Source Course.” Journal of Open Source Education, vol. 9, no. 97,
306, The Open Journal, 2026, doi:10.21105/jose.00306.'
short: A.H.A. Abdelwanis, B. Haucke-Korber, D. Jakobeit, W. Kirchgässner, M. Meyer,
M. Schenke, H. Vater, O. Wallscheid, D. Weber, Journal of Open Source Education
9 (2026).
date_created: 2026-03-31T07:30:04Z
date_updated: 2026-03-31T07:32:23Z
department:
- _id: '52'
doi: 10.21105/jose.00306
intvolume: ' 9'
issue: '97'
language:
- iso: eng
publication: Journal of Open Source Education
publication_identifier:
issn:
- 2577-3569
publication_status: published
publisher: The Open Journal
status: public
title: 'Reinforcement Learning: A Comprehensive Open-Source Course'
type: journal_article
user_id: '93461'
volume: 9
year: '2026'
...
---
_id: '65440'
abstract:
- lang: eng
text: "Abstract\r\n We present
a novel algorithm for quantization and subsequent hexahedral mesh generation from
seamless volumetric maps. Quantization is the process of choosing integers that
represent the numbers of hexahedral elements to be placed in each region of the
volume, and transforming the seamless map into an integer‐grid map matching that
choice, inducing a hexahedral mesh. Previous work computes such quantizations
under the restriction of a fixed predetermined singularity graph. Our novel approach
allows for implicit modification and, in particular, simplification of the map's
singularity structure wherever that benefits the chosen objective, such as matching
target hexahedron sizes as closely as possible. It comes with two novel ingredients:
A feature‐focused distortion measure guiding the quantization, and constraints
ensuring map injectivity and structure preservation of geometric and topological
features, both without relying on a fixed singularity structure. We demonstrate
the benefit of the added flexibility offered by this approach: it allows for the
generation of hexahedral meshes that more accurately match a desired resolution
globally, as well as of meshes exhibiting a simpler block structure."
article_number: e70349
author:
- first_name: Hendrik
full_name: Brückler, Hendrik
last_name: Brückler
- first_name: Marcel
full_name: Campen, Marcel
id: '114904'
last_name: Campen
orcid: 0000-0003-2340-3462
citation:
ama: Brückler H, Campen M. Volume Quantization with Flexible Singularities for Hexahedral
Meshing. Computer Graphics Forum. Published online 2026. doi:10.1111/cgf.70349
apa: Brückler, H., & Campen, M. (2026). Volume Quantization with Flexible Singularities
for Hexahedral Meshing. Computer Graphics Forum, Article e70349. https://doi.org/10.1111/cgf.70349
bibtex: '@article{Brückler_Campen_2026, title={Volume Quantization with Flexible
Singularities for Hexahedral Meshing}, DOI={10.1111/cgf.70349},
number={e70349}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Brückler,
Hendrik and Campen, Marcel}, year={2026} }'
chicago: Brückler, Hendrik, and Marcel Campen. “Volume Quantization with Flexible
Singularities for Hexahedral Meshing.” Computer Graphics Forum, 2026. https://doi.org/10.1111/cgf.70349.
ieee: 'H. Brückler and M. Campen, “Volume Quantization with Flexible Singularities
for Hexahedral Meshing,” Computer Graphics Forum, Art. no. e70349, 2026,
doi: 10.1111/cgf.70349.'
mla: Brückler, Hendrik, and Marcel Campen. “Volume Quantization with Flexible Singularities
for Hexahedral Meshing.” Computer Graphics Forum, e70349, Wiley, 2026,
doi:10.1111/cgf.70349.
short: H. Brückler, M. Campen, Computer Graphics Forum (2026).
date_created: 2026-04-15T07:32:52Z
date_updated: 2026-04-15T08:06:49Z
department:
- _id: '969'
doi: 10.1111/cgf.70349
language:
- iso: eng
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
- 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Volume Quantization with Flexible Singularities for Hexahedral Meshing
type: journal_article
user_id: '117512'
year: '2026'
...
---
_id: '65426'
abstract:
- lang: ger
text: In diesem Forschungsprojekt wurde ein Messverfahren zur Bestimmung akustischer
Materialparameter von Polymeren im Ultraschallfrequenzbereich entwickelt. Das
Verfahrens sollte, die üblichen standardisierten Prüfmethoden erweitern, die bislang
primär im quasistatischen oder niederfrequenten Bereich eingesetzt wurden. Im
Gegensatz zu bestehenden Verfahren wie dem Zeitstandversuch oder der Dynamisch
Mechanischen Analyse (DMA) nach [DIN6721] sollte die neue Methode eine nicht-invasive
Charakterisierung der (visko-)elastischen Materialparameter im Frequenzbereich
von 0,75 MHz bis 2,5 MHz ermöglichen. Das entwickelte Ultraschallmesssystem arbeitet
nach dem Puls Echo-Prinzip und kann eine räumlich segmentierte, ringförmige Anregung
erzeugen. Die Bestimmung der frequenzabhängigen Materialparameter geschieht hierbei
über ein inverses Verfahren. Die Ergebnisse des Projekts zeigen, dass die Segmentierung
der Anregung, die Geometrie der Probe sowie das Puls-Echo-Messprinzip die Messergebnisse
sowie die Sensitivität gegenüber Scherparametern wesentlich beeinflussen. Im Rahmen
des Projektes wurde auch eine statistische Auswertung des Optimierungsverfahrens
hinsichtlich transversal-isotroper Materialsymmetrie mit Rayleigh-Dämpfung durchgeführt.
Die Ergebnisse zeigen, dass das entwickelte Verfahren gute Konvergenzeigenschaften
aufweist und sich durch verbesserte Robustheit auszeichnet.
- lang: eng
text: This research project involved developing a measurement method to determine
the acoustic material parameters of polymers within the ultrasonic frequency range.
The aim of this method is to extend the range of standardised tests that operate
in the quasi-static or low-frequency range. In contrast to existing methods such
as the creep test or dynamic mechanical analysis according to [DIN6721], the developed
method is capable of non-invasive characterisation of the (visco-)elastic material
parameters in the frequency range of 0,75 MHz bis 2,5 MHz. The developed ultrasonic
measurement setup utilises the pulse-echo principle and can generate a spatially
segmented, ring-shaped excitation. The frequency-dependent material parameters
are determined using an inverse method. The final results of the project show
that the segmentation of the excitation, the geometry of the specimen and the
pulse-echo measurement principle have a significant influence on the measurement
results and the sensitivity to shear movements. As part of the project, a statistical
evaluation of the optimisation process was also carried out with regard to transversely
isotropic material symmetry with Rayleigh damping. The results show that the developed
process has good convergence properties and is characterised by improved robustness.
author:
- first_name: Dmitrij
full_name: Dreiling, Dmitrij
id: '32616'
last_name: Dreiling
- first_name: Dominik
full_name: Itner, Dominik
last_name: Itner
- first_name: Carolin
full_name: Birk, Carolin
last_name: Birk
- first_name: Hauke
full_name: Gravenkamp, Hauke
last_name: Gravenkamp
- first_name: Bernd
full_name: Henning, Bernd
id: '213'
last_name: Henning
citation:
ama: 'Dreiling D, Itner D, Birk C, Gravenkamp H, Henning B. Vollständige Bestimmung
der akustischen Materialparameter von Polymeren II. Hannover : Technische
Informationsbibliothek; 2026. doi:https://doi.org/10.34657/33602'
apa: 'Dreiling, D., Itner, D., Birk, C., Gravenkamp, H., & Henning, B. (2026).
Vollständige Bestimmung der akustischen Materialparameter von Polymeren II.
Hannover : Technische Informationsbibliothek. https://doi.org/10.34657/33602'
bibtex: '@book{Dreiling_Itner_Birk_Gravenkamp_Henning_2026, title={Vollständige
Bestimmung der akustischen Materialparameter von Polymeren II}, DOI={https://doi.org/10.34657/33602},
publisher={Hannover : Technische Informationsbibliothek}, author={Dreiling, Dmitrij
and Itner, Dominik and Birk, Carolin and Gravenkamp, Hauke and Henning, Bernd},
year={2026} }'
chicago: 'Dreiling, Dmitrij, Dominik Itner, Carolin Birk, Hauke Gravenkamp, and
Bernd Henning. Vollständige Bestimmung der akustischen Materialparameter von
Polymeren II. Hannover : Technische Informationsbibliothek, 2026. https://doi.org/10.34657/33602.'
ieee: 'D. Dreiling, D. Itner, C. Birk, H. Gravenkamp, and B. Henning, Vollständige
Bestimmung der akustischen Materialparameter von Polymeren II. Hannover :
Technische Informationsbibliothek, 2026.'
mla: 'Dreiling, Dmitrij, et al. Vollständige Bestimmung der akustischen Materialparameter
von Polymeren II. Hannover : Technische Informationsbibliothek, 2026, doi:https://doi.org/10.34657/33602.'
short: 'D. Dreiling, D. Itner, C. Birk, H. Gravenkamp, B. Henning, Vollständige
Bestimmung der akustischen Materialparameter von Polymeren II, Hannover : Technische
Informationsbibliothek, 2026.'
date_created: 2026-04-14T06:43:03Z
date_updated: 2026-04-17T07:18:16Z
department:
- _id: '49'
doi: https://doi.org/10.34657/33602
keyword:
- Materialcharakterisierung
- Polymer
- Inverses Problem
- Ultraschall
- Optimierung
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://oa.tib.eu/renate/handle/123456789/34534
oa: '1'
page: '12'
project:
- _id: '89'
name: Vollständige Bestimmung der akustischen Materialparameter von Polymeren
publication_status: published
publisher: 'Hannover : Technische Informationsbibliothek'
report_number: '409779252'
status: public
title: Vollständige Bestimmung der akustischen Materialparameter von Polymeren II
type: report
user_id: '32616'
year: '2026'
...
---
_id: '61922'
abstract:
- lang: eng
text: "We present an extremely simple polynomial-space exponential-time\r\n$(1-\\varepsilon)$-approximation
algorithm for MAX-k-SAT that is (slightly)\r\nfaster than the previous known polynomial-space
$(1-\\varepsilon)$-approximation\r\nalgorithms by Hirsch (Discrete Applied Mathematics,
2003) and Escoffier,\r\nPaschos and Tourniaire (Theoretical Computer Science,
2014). Our algorithm\r\nrepeatedly samples an assignment uniformly at random until
finding an\r\nassignment that satisfies a large enough fraction of clauses. Surprisingly,
we\r\ncan show the efficiency of this simpler approach by proving that in any\r\ninstance
of MAX-k-SAT (or more generally any instance of MAXCSP), an\r\nexponential number
of assignments satisfy a fraction of clauses close to the\r\noptimal value."
author:
- first_name: Harry
full_name: Buhrman, Harry
last_name: Buhrman
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Zeph
full_name: Landau, Zeph
last_name: Landau
- first_name: François Le
full_name: Gall, François Le
last_name: Gall
- first_name: Norbert
full_name: Schuch, Norbert
last_name: Schuch
- first_name: Suguru
full_name: Tamaki, Suguru
last_name: Tamaki
citation:
ama: 'Buhrman H, Gharibian S, Landau Z, Gall FL, Schuch N, Tamaki S. A Simpler Exponential-Time
Approximation Algorithm for MAX-k-SAT. In: SIAM Symposium on Simplicity in
Algorithms (SOSA). ; :247-253.'
apa: Buhrman, H., Gharibian, S., Landau, Z., Gall, F. L., Schuch, N., & Tamaki,
S. (n.d.). A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT. SIAM
Symposium on Simplicity in Algorithms (SOSA), 247–253.
bibtex: '@inproceedings{Buhrman_Gharibian_Landau_Gall_Schuch_Tamaki, title={A Simpler
Exponential-Time Approximation Algorithm for MAX-k-SAT}, booktitle={SIAM Symposium
on Simplicity in Algorithms (SOSA)}, author={Buhrman, Harry and Gharibian, Sevag
and Landau, Zeph and Gall, François Le and Schuch, Norbert and Tamaki, Suguru},
pages={247–253} }'
chicago: Buhrman, Harry, Sevag Gharibian, Zeph Landau, François Le Gall, Norbert
Schuch, and Suguru Tamaki. “A Simpler Exponential-Time Approximation Algorithm
for MAX-k-SAT.” In SIAM Symposium on Simplicity in Algorithms (SOSA), 247–53,
n.d.
ieee: H. Buhrman, S. Gharibian, Z. Landau, F. L. Gall, N. Schuch, and S. Tamaki,
“A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT,” in SIAM
Symposium on Simplicity in Algorithms (SOSA), pp. 247–253.
mla: Buhrman, Harry, et al. “A Simpler Exponential-Time Approximation Algorithm
for MAX-k-SAT.” SIAM Symposium on Simplicity in Algorithms (SOSA), pp.
247–53.
short: 'H. Buhrman, S. Gharibian, Z. Landau, F.L. Gall, N. Schuch, S. Tamaki, in:
SIAM Symposium on Simplicity in Algorithms (SOSA), n.d., pp. 247–253.'
date_created: 2025-10-22T09:33:22Z
date_updated: 2026-04-20T13:53:03Z
department:
- _id: '7'
- _id: '623'
external_id:
arxiv:
- '2510.18164'
language:
- iso: eng
page: 247-253
publication: SIAM Symposium on Simplicity in Algorithms (SOSA)
publication_status: inpress
status: public
title: A Simpler Exponential-Time Approximation Algorithm for MAX-k-SAT
type: conference
user_id: '71541'
year: '2026'
...
---
_id: '64797'
alternative_title:
- Editorial
citation:
ama: Birk L, Loth G, Jotzo L, Binder K, Frischemeier D, eds. 14th IASE Satellite
Conference “Statistics and Data Science Education in STEAM.” International
Association for Statistics Education; 2026. doi:10.52041/iase25.158
apa: Birk, L., Loth, G., Jotzo, L., Binder, K., & Frischemeier, D. (Eds.). (2026).
14th IASE Satellite Conference “Statistics and Data Science Education in STEAM.”
International Association for Statistics Education. https://doi.org/10.52041/iase25.158
bibtex: '@book{Birk_Loth_Jotzo_Binder_Frischemeier_2026, title={14th IASE Satellite
Conference “Statistics and Data Science Education in STEAM”}, DOI={10.52041/iase25.158},
publisher={International Association for Statistics Education}, year={2026} }'
chicago: Birk, Lisa, Gerrit Loth, Luca Jotzo, Karin Binder, and Daniel Frischemeier,
eds. 14th IASE Satellite Conference “Statistics and Data Science Education
in STEAM.” International Association for Statistics Education, 2026. https://doi.org/10.52041/iase25.158.
ieee: L. Birk, G. Loth, L. Jotzo, K. Binder, and D. Frischemeier, Eds., 14th
IASE Satellite Conference “Statistics and Data Science Education in STEAM.”
International Association for Statistics Education, 2026.
mla: Birk, Lisa, et al., editors. 14th IASE Satellite Conference “Statistics
and Data Science Education in STEAM.” International Association for Statistics
Education, 2026, doi:10.52041/iase25.158.
short: L. Birk, G. Loth, L. Jotzo, K. Binder, D. Frischemeier, eds., 14th IASE Satellite
Conference “Statistics and Data Science Education in STEAM,” International Association
for Statistics Education, 2026.
conference:
end_date: 2025-10-02
location: Münster
name: 14th IASE Satellite Conference "Statistics and Data Science Education in STEAM"
start_date: 2025-09-30
date_created: 2026-03-01T13:18:24Z
date_updated: 2026-04-20T16:19:18Z
ddc:
- '370'
department:
- _id: '979'
doi: 10.52041/iase25.158
editor:
- first_name: Lisa
full_name: Birk, Lisa
last_name: Birk
- first_name: Gerrit
full_name: Loth, Gerrit
last_name: Loth
- first_name: Luca
full_name: Jotzo, Luca
id: '88811'
last_name: Jotzo
orcid: 0009-0003-1440-6466
- first_name: Karin
full_name: Binder, Karin
id: '83381'
last_name: Binder
- first_name: Daniel
full_name: Frischemeier, Daniel
last_name: Frischemeier
file:
- access_level: closed
content_type: application/pdf
creator: binder
date_created: 2026-04-20T16:18:30Z
date_updated: 2026-04-20T16:18:30Z
file_id: '65467'
file_name: Birk, Loth, Jotzo, Binder, Frischemeier 2025 IASE Satellite Editorial.pdf
file_size: 1447145
relation: main_file
success: 1
file_date_updated: 2026-04-20T16:18:30Z
has_accepted_license: '1'
language:
- iso: eng
publication_status: published
publisher: International Association for Statistics Education
status: public
title: 14th IASE Satellite Conference "Statistics and Data Science Education in STEAM"
type: conference_editor
user_id: '83381'
year: '2026'
...
---
_id: '63918'
abstract:
- lang: eng
text: 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:
- first_name: Pallabee
full_name: Das, Pallabee
last_name: Das
- first_name: Stefan
full_name: Heindorf, Stefan
id: '11871'
last_name: Heindorf
orcid: 0000-0002-4525-6865
citation:
ama: 'Das P, Heindorf S. Discrete Diffusion-Based Model-Level Explanation of Heterogeneous
GNNs with Node Features. In: Proceedings of the ACM Web Conference 2026 (WWW
’26). ACM; 2026.'
apa: Das, P., & Heindorf, S. (2026). Discrete Diffusion-Based Model-Level Explanation
of Heterogeneous GNNs with Node Features. Proceedings of the ACM Web Conference
2026 (WWW ’26). The Web Conference, Dubai, United Arab Emirates.
bibtex: '@inproceedings{Das_Heindorf_2026, title={Discrete Diffusion-Based Model-Level
Explanation of Heterogeneous GNNs with Node Features}, booktitle={Proceedings
of the ACM Web Conference 2026 (WWW ’26)}, publisher={ACM}, author={Das, Pallabee
and Heindorf, Stefan}, year={2026} }'
chicago: Das, Pallabee, and Stefan Heindorf. “Discrete Diffusion-Based Model-Level
Explanation of Heterogeneous GNNs with Node Features.” In Proceedings of the
ACM Web Conference 2026 (WWW ’26). ACM, 2026.
ieee: P. Das and S. Heindorf, “Discrete Diffusion-Based Model-Level Explanation
of Heterogeneous GNNs with Node Features,” presented at the The Web Conference,
Dubai, United Arab Emirates, 2026.
mla: Das, Pallabee, and Stefan Heindorf. “Discrete Diffusion-Based Model-Level Explanation
of Heterogeneous GNNs with Node Features.” Proceedings of the ACM Web Conference
2026 (WWW ’26), ACM, 2026.
short: 'P. Das, S. Heindorf, in: Proceedings of the ACM Web Conference 2026 (WWW
’26), ACM, 2026.'
conference:
end_date: 2026-04-17
location: Dubai, United Arab Emirates
name: The Web Conference
start_date: 2026-04-13
date_created: 2026-02-06T18:44:34Z
date_updated: 2026-04-23T08:34:44Z
department:
- _id: '760'
external_id:
arxiv:
- '2508.08458'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/epdf/10.1145/3774904.3792518
oa: '1'
publication: Proceedings of the ACM Web Conference 2026 (WWW ’26)
publisher: ACM
status: public
title: Discrete Diffusion-Based Model-Level Explanation of Heterogeneous GNNs with
Node Features
type: conference
user_id: '11871'
year: '2026'
...
---
_id: '65489'
author:
- first_name: Cem
full_name: Okulmus, Cem
id: '114410'
last_name: Okulmus
orcid: 0000-0002-7742-0439
- first_name: Shqiponja
full_name: Ahmetaj, Shqiponja
last_name: Ahmetaj
- first_name: 'Iovka '
full_name: 'Boneva, Iovka '
last_name: Boneva
- first_name: Jan
full_name: Hidders, Jan
last_name: Hidders
- first_name: 'Maxime '
full_name: 'Jakubowski, Maxime '
last_name: Jakubowski
- first_name: José Emilio
full_name: ' Labra Gayo, José Emilio'
last_name: ' Labra Gayo'
- first_name: Wim
full_name: Martens, Wim
last_name: Martens
- first_name: 'Fabio '
full_name: 'Mogavero, Fabio '
last_name: Mogavero
- first_name: 'Filip '
full_name: 'Murlak, Filip '
last_name: Murlak
- first_name: ' Ognjen '
full_name: 'Savković, Ognjen '
last_name: Savković
- first_name: 'Mantas '
full_name: 'Šimkus, Mantas '
last_name: Šimkus
- first_name: 'Dominik '
full_name: 'Tomaszuk, Dominik '
last_name: Tomaszuk
citation:
ama: 'Okulmus C, Ahmetaj S, Boneva I, et al. Common Foundations for Recursive Shape
Languages. In: Proceedings of the 23rd International Conference on Principles
of Knowledge Representation and Reasoning (KR 2026). ; 2026.'
apa: Okulmus, C., Ahmetaj, S., Boneva, I., Hidders, J., Jakubowski, M., Labra Gayo,
J. E., Martens, W., Mogavero, F., Murlak, F., Savković, Ognjen , Šimkus, M.,
& Tomaszuk, D. (2026). Common Foundations for Recursive Shape Languages. Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026). 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026), Lisbon, Portugal.
bibtex: '@inproceedings{Okulmus_Ahmetaj_Boneva_Hidders_Jakubowski_ Labra Gayo_Martens_Mogavero_Murlak_Savković_et
al._2026, title={Common Foundations for Recursive Shape Languages}, booktitle={Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026)}, 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
et al.}, year={2026} }'
chicago: Okulmus, Cem, Shqiponja Ahmetaj, Iovka Boneva, Jan Hidders, Maxime Jakubowski,
José Emilio Labra Gayo, Wim Martens, et al. “Common Foundations for Recursive
Shape Languages.” In Proceedings of the 23rd International Conference on Principles
of Knowledge Representation and Reasoning (KR 2026), 2026.
ieee: C. Okulmus et al., “Common Foundations for Recursive Shape Languages,”
presented at the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026), Lisbon, Portugal, 2026.
mla: Okulmus, Cem, et al. “Common Foundations for Recursive Shape Languages.” Proceedings
of the 23rd International Conference on Principles of Knowledge Representation
and Reasoning (KR 2026), 2026.
short: 'C. Okulmus, S. Ahmetaj, I. Boneva, J. Hidders, M. Jakubowski, J.E. Labra
Gayo, W. Martens, F. Mogavero, F. Murlak, Ognjen Savković, M. Šimkus, D. Tomaszuk,
in: Proceedings of the 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026), 2026.'
conference:
end_date: 2026-07-23
location: Lisbon, Portugal
name: 23rd International Conference on Principles of Knowledge Representation and
Reasoning (KR 2026)
start_date: 2026-07-20
date_created: 2026-04-22T14:16:58Z
date_updated: 2026-04-22T14:17:20Z
department:
- _id: '888'
language:
- iso: eng
publication: Proceedings of the 23rd International Conference on Principles of Knowledge
Representation and Reasoning (KR 2026)
status: public
title: Common Foundations for Recursive Shape Languages
type: conference
user_id: '114410'
year: '2026'
...
---
_id: '63135'
abstract:
- lang: eng
text: 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:
- first_name: Daniel
full_name: Perniok, Daniel
id: '64242'
last_name: Perniok
citation:
ama: Perniok D. Coxeter-Dynkin algebras of canonical type. Journal of Pure and
Applied Algebra. 2026;230(5). doi:10.1016/j.jpaa.2026.108250
apa: Perniok, D. (2026). Coxeter-Dynkin algebras of canonical type. Journal of
Pure and Applied Algebra, 230(5). https://doi.org/10.1016/j.jpaa.2026.108250
bibtex: '@article{Perniok_2026, title={Coxeter-Dynkin algebras of canonical type},
volume={230}, DOI={10.1016/j.jpaa.2026.108250},
number={5}, journal={Journal of Pure and Applied Algebra}, author={Perniok, Daniel},
year={2026} }'
chicago: Perniok, Daniel. “Coxeter-Dynkin Algebras of Canonical Type.” Journal
of Pure and Applied Algebra 230, no. 5 (2026). https://doi.org/10.1016/j.jpaa.2026.108250.
ieee: 'D. Perniok, “Coxeter-Dynkin algebras of canonical type,” Journal of Pure
and Applied Algebra, vol. 230, no. 5, 2026, doi: 10.1016/j.jpaa.2026.108250.'
mla: Perniok, Daniel. “Coxeter-Dynkin Algebras of Canonical Type.” Journal of
Pure and Applied Algebra, vol. 230, no. 5, 2026, doi:10.1016/j.jpaa.2026.108250.
short: D. Perniok, Journal of Pure and Applied Algebra 230 (2026).
date_created: 2025-12-16T14:20:09Z
date_updated: 2026-04-23T13:00:59Z
department:
- _id: '602'
doi: 10.1016/j.jpaa.2026.108250
external_id:
arxiv:
- '2509.17887'
intvolume: ' 230'
issue: '5'
language:
- iso: eng
publication: Journal of Pure and Applied Algebra
status: public
title: Coxeter-Dynkin algebras of canonical type
type: journal_article
user_id: '64242'
volume: 230
year: '2026'
...
---
_id: '61152'
abstract:
- lang: eng
text: 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:
- first_name: Yaman
full_name: Umuroglu, Yaman
last_name: Umuroglu
- first_name: Christoph
full_name: Berganski, Christoph
id: '98854'
last_name: Berganski
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Michal
full_name: Danilowicz, Michal
last_name: Danilowicz
- first_name: Tomasz
full_name: Kryjak, Tomasz
last_name: Kryjak
- first_name: Charalampos
full_name: Bezaitis, Charalampos
last_name: Bezaitis
- first_name: Magnus
full_name: Sjalander, Magnus
last_name: Sjalander
- first_name: Ian
full_name: Colbert, Ian
last_name: Colbert
- first_name: Thomas
full_name: Preusser, Thomas
last_name: Preusser
- first_name: Jakoba
full_name: Petri-Koenig, Jakoba
last_name: Petri-Koenig
- first_name: Michaela
full_name: Blott, Michaela
last_name: Blott
citation:
ama: 'Umuroglu Y, Berganski C, Jentzsch F, et al. SIRA: Scaled-Integer Range Analysis
for Optimizing FPGA Dataflow Neural Network Accelerators. ACM Transactions
on Reconfigurable Technology and Systems. doi:10.1145/3807510'
apa: 'Umuroglu, Y., Berganski, C., Jentzsch, F., Danilowicz, M., Kryjak, T., Bezaitis,
C., Sjalander, M., Colbert, I., Preusser, T., Petri-Koenig, J., & Blott, M.
(n.d.). SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural
Network Accelerators. ACM Transactions on Reconfigurable Technology and Systems.
https://doi.org/10.1145/3807510'
bibtex: '@article{Umuroglu_Berganski_Jentzsch_Danilowicz_Kryjak_Bezaitis_Sjalander_Colbert_Preusser_Petri-Koenig_et
al., title={SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural
Network Accelerators}, DOI={10.1145/3807510},
journal={ACM Transactions on Reconfigurable Technology and Systems}, 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 et al.} }'
chicago: 'Umuroglu, Yaman, Christoph Berganski, Felix Jentzsch, Michal Danilowicz,
Tomasz Kryjak, Charalampos Bezaitis, Magnus Sjalander, et al. “SIRA: Scaled-Integer
Range Analysis for Optimizing FPGA Dataflow Neural Network Accelerators.” ACM
Transactions on Reconfigurable Technology and Systems, n.d. https://doi.org/10.1145/3807510.'
ieee: 'Y. Umuroglu et al., “SIRA: Scaled-Integer Range Analysis for Optimizing
FPGA Dataflow Neural Network Accelerators,” ACM Transactions on Reconfigurable
Technology and Systems, doi: 10.1145/3807510.'
mla: 'Umuroglu, Yaman, et al. “SIRA: Scaled-Integer Range Analysis for Optimizing
FPGA Dataflow Neural Network Accelerators.” ACM Transactions on Reconfigurable
Technology and Systems, doi:10.1145/3807510.'
short: Y. Umuroglu, C. Berganski, F. Jentzsch, M. Danilowicz, T. Kryjak, C. Bezaitis,
M. Sjalander, I. Colbert, T. Preusser, J. Petri-Koenig, M. Blott, ACM Transactions
on Reconfigurable Technology and Systems (n.d.).
date_created: 2025-09-08T14:10:39Z
date_updated: 2026-04-27T14:13:50Z
department:
- _id: '78'
doi: 10.1145/3807510
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: ACM Transactions on Reconfigurable Technology and Systems
publication_identifier:
issn:
- 1936-7406
publication_status: submitted
status: public
title: 'SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural Network
Accelerators'
type: journal_article
user_id: '55631'
year: '2026'
...
---
_id: '65501'
author:
- first_name: Lukas
full_name: Stasytis, Lukas
last_name: Stasytis
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Thomas
full_name: Preusser, Thomas
last_name: Preusser
- first_name: Yaman
full_name: Umuroglu, Yaman
last_name: Umuroglu
- first_name: Jakoba
full_name: Petri-Koenig, Jakoba
last_name: Petri-Koenig
- first_name: Zsolt
full_name: István, Zsolt
last_name: István
citation:
ama: 'Stasytis L, Jentzsch F, Preusser T, Umuroglu Y, Petri-Koenig J, István Z.
Heuristic & Expert-Guided Buffer Sizing for Neural Network Inference Applications
on FPGAs. In: 2025 International Conference on Field Programmable Technology
(ICFPT). IEEE; 2026. doi:10.1109/icfpt67023.2025.00032'
apa: Stasytis, L., Jentzsch, F., Preusser, T., Umuroglu, Y., Petri-Koenig, J., &
István, Z. (2026). Heuristic & Expert-Guided Buffer Sizing for Neural
Network Inference Applications on FPGAs. 2025 International Conference on Field
Programmable Technology (ICFPT). https://doi.org/10.1109/icfpt67023.2025.00032
bibtex: '@inproceedings{Stasytis_Jentzsch_Preusser_Umuroglu_Petri-Koenig_István_2026,
title={Heuristic & Expert-Guided Buffer Sizing for Neural Network Inference
Applications on FPGAs}, DOI={10.1109/icfpt67023.2025.00032},
booktitle={2025 International Conference on Field Programmable Technology (ICFPT)},
publisher={IEEE}, author={Stasytis, Lukas and Jentzsch, Felix and Preusser, Thomas
and Umuroglu, Yaman and Petri-Koenig, Jakoba and István, Zsolt}, year={2026} }'
chicago: Stasytis, Lukas, Felix Jentzsch, Thomas Preusser, Yaman Umuroglu, Jakoba
Petri-Koenig, and Zsolt István. “Heuristic & Expert-Guided Buffer Sizing
for Neural Network Inference Applications on FPGAs.” In 2025 International
Conference on Field Programmable Technology (ICFPT). IEEE, 2026. https://doi.org/10.1109/icfpt67023.2025.00032.
ieee: 'L. Stasytis, F. Jentzsch, T. Preusser, Y. Umuroglu, J. Petri-Koenig, and
Z. István, “Heuristic & Expert-Guided Buffer Sizing for Neural Network
Inference Applications on FPGAs,” 2026, doi: 10.1109/icfpt67023.2025.00032.'
mla: Stasytis, Lukas, et al. “Heuristic & Expert-Guided Buffer Sizing for
Neural Network Inference Applications on FPGAs.” 2025 International Conference
on Field Programmable Technology (ICFPT), IEEE, 2026, doi:10.1109/icfpt67023.2025.00032.
short: 'L. Stasytis, F. Jentzsch, T. Preusser, Y. Umuroglu, J. Petri-Koenig, Z.
István, in: 2025 International Conference on Field Programmable Technology (ICFPT),
IEEE, 2026.'
date_created: 2026-04-27T14:24:25Z
date_updated: 2026-04-27T14:25:51Z
department:
- _id: '78'
doi: 10.1109/icfpt67023.2025.00032
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 2025 International Conference on Field Programmable Technology (ICFPT)
publication_status: published
publisher: IEEE
status: public
title: Heuristic & Expert-Guided Buffer Sizing for Neural Network Inference Applications
on FPGAs
type: conference
user_id: '55631'
year: '2026'
...
---
_id: '65500'
author:
- first_name: Felix
full_name: Jentzsch, Felix
id: '55631'
last_name: Jentzsch
orcid: 0000-0003-4987-5708
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Jentzsch F, Platzner M. Empirical QoR Estimation Flow for Fast Design Space
Exploration of DNN Dataflow Accelerators. In: 2025 International Conference
on Field Programmable Technology (ICFPT). IEEE; 2026. doi:10.1109/icfpt67023.2025.00044'
apa: Jentzsch, F., & Platzner, M. (2026). Empirical QoR Estimation Flow for
Fast Design Space Exploration of DNN Dataflow Accelerators. 2025 International
Conference on Field Programmable Technology (ICFPT). https://doi.org/10.1109/icfpt67023.2025.00044
bibtex: '@inproceedings{Jentzsch_Platzner_2026, title={Empirical QoR Estimation
Flow for Fast Design Space Exploration of DNN Dataflow Accelerators}, DOI={10.1109/icfpt67023.2025.00044},
booktitle={2025 International Conference on Field Programmable Technology (ICFPT)},
publisher={IEEE}, author={Jentzsch, Felix and Platzner, Marco}, year={2026} }'
chicago: Jentzsch, Felix, and Marco Platzner. “Empirical QoR Estimation Flow for
Fast Design Space Exploration of DNN Dataflow Accelerators.” In 2025 International
Conference on Field Programmable Technology (ICFPT). IEEE, 2026. https://doi.org/10.1109/icfpt67023.2025.00044.
ieee: 'F. Jentzsch and M. Platzner, “Empirical QoR Estimation Flow for Fast Design
Space Exploration of DNN Dataflow Accelerators,” 2026, doi: 10.1109/icfpt67023.2025.00044.'
mla: Jentzsch, Felix, and Marco Platzner. “Empirical QoR Estimation Flow for Fast
Design Space Exploration of DNN Dataflow Accelerators.” 2025 International
Conference on Field Programmable Technology (ICFPT), IEEE, 2026, doi:10.1109/icfpt67023.2025.00044.
short: 'F. Jentzsch, M. Platzner, in: 2025 International Conference on Field Programmable
Technology (ICFPT), IEEE, 2026.'
date_created: 2026-04-27T14:22:50Z
date_updated: 2026-04-27T14:26:01Z
department:
- _id: '78'
doi: 10.1109/icfpt67023.2025.00044
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: 2025 International Conference on Field Programmable Technology (ICFPT)
publication_status: published
publisher: IEEE
status: public
title: Empirical QoR Estimation Flow for Fast Design Space Exploration of DNN Dataflow
Accelerators
type: conference
user_id: '55631'
year: '2026'
...
---
_id: '65512'
abstract:
- lang: eng
text: "Zusammenfassung\r\n 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."
article_number: '5'
author:
- first_name: Michael
full_name: Rößner, Michael
id: '87801'
last_name: Rößner
- first_name: Karin
full_name: Binder, Karin
id: '83381'
last_name: Binder
- first_name: Julian
full_name: Albrecht, Julian
last_name: Albrecht
citation:
ama: Rößner M, Binder K, Albrecht J. 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. Journal für
Mathematik-Didaktik. 2026;47(1). doi:10.1007/s13138-026-00267-1
apa: Rößner, M., Binder, K., & Albrecht, J. (2026). 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.
Journal für Mathematik-Didaktik, 47(1), Article 5. https://doi.org/10.1007/s13138-026-00267-1
bibtex: '@article{Rößner_Binder_Albrecht_2026, 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},
volume={47}, DOI={10.1007/s13138-026-00267-1},
number={15}, journal={Journal für Mathematik-Didaktik}, publisher={Springer Science
and Business Media LLC}, author={Rößner, Michael and Binder, Karin and Albrecht,
Julian}, year={2026} }'
chicago: Rößner, Michael, Karin Binder, and Julian Albrecht. “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.”
Journal für Mathematik-Didaktik 47, no. 1 (2026). https://doi.org/10.1007/s13138-026-00267-1.
ieee: 'M. Rößner, K. Binder, and J. Albrecht, “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,”
Journal für Mathematik-Didaktik, vol. 47, no. 1, Art. no. 5, 2026, doi:
10.1007/s13138-026-00267-1.'
mla: Rößner, Michael, et al. “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.” Journal für Mathematik-Didaktik,
vol. 47, no. 1, 5, Springer Science and Business Media LLC, 2026, doi:10.1007/s13138-026-00267-1.
short: M. Rößner, K. Binder, J. Albrecht, Journal für Mathematik-Didaktik 47 (2026).
date_created: 2026-04-29T08:25:18Z
date_updated: 2026-04-29T08:29:01Z
ddc:
- '370'
department:
- _id: '983'
doi: 10.1007/s13138-026-00267-1
file:
- access_level: closed
content_type: application/pdf
creator: binder
date_created: 2026-04-29T08:28:25Z
date_updated: 2026-04-29T08:28:25Z
file_id: '65514'
file_name: Rößner Binder Albrecht 2026 Versprachlichung von Anteilen und natürlichen
Häufigkeiten anhand von Baum- und Netzdiagrammen.pdf
file_size: 2993685
relation: main_file
success: 1
file_date_updated: 2026-04-29T08:28:25Z
has_accepted_license: '1'
intvolume: ' 47'
issue: '1'
language:
- iso: ger
publication: Journal für Mathematik-Didaktik
publication_identifier:
issn:
- 0173-5322
- 1869-2699
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
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
type: journal_article
user_id: '83381'
volume: 47
year: '2026'
...
---
_id: '65515'
abstract:
- lang: eng
text: 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:
- first_name: Mesut
full_name: Alptekin, Mesut
id: '11763'
last_name: Alptekin
orcid: 0009-0004-8545-1165
- first_name: Daniel
full_name: Münstermann, Daniel
last_name: Münstermann
- first_name: Katrin
full_name: Temmen, Katrin
last_name: Temmen
citation:
ama: 'Alptekin M, Münstermann D, Temmen K. 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. In: Lecture Notes in
Networks and Systems. Vol 2. Smart Technologies for an All-Electric Society.
Springer Nature Switzerland; 2026:199-211. doi:10.1007/978-3-032-07319-8_19'
apa: 'Alptekin, M., Münstermann, D., & Temmen, K. (2026). 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. In Lecture
Notes in Networks and Systems (Vol. 2, pp. 199–211). Springer Nature Switzerland.
https://doi.org/10.1007/978-3-032-07319-8_19'
bibtex: '@inbook{Alptekin_Münstermann_Temmen_2026, place={Cham}, series={Smart Technologies
for an All-Electric Society}, 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}, volume={2}, DOI={10.1007/978-3-032-07319-8_19},
booktitle={Lecture Notes in Networks and Systems}, publisher={Springer Nature
Switzerland}, author={Alptekin, Mesut and Münstermann, Daniel and Temmen, Katrin},
year={2026}, pages={199–211}, collection={Smart Technologies for an All-Electric
Society} }'
chicago: 'Alptekin, Mesut, Daniel Münstermann, and Katrin Temmen. “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.” In Lecture
Notes in Networks and Systems, 2:199–211. Smart Technologies for an All-Electric
Society. Cham: Springer Nature Switzerland, 2026. https://doi.org/10.1007/978-3-032-07319-8_19.'
ieee: 'M. Alptekin, D. Münstermann, and K. Temmen, “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,” in Lecture Notes in
Networks and Systems, vol. 2, Cham: Springer Nature Switzerland, 2026, pp.
199–211.'
mla: 'Alptekin, Mesut, et al. “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.” Lecture Notes in Networks and
Systems, vol. 2, Springer Nature Switzerland, 2026, pp. 199–211, doi:10.1007/978-3-032-07319-8_19.'
short: 'M. Alptekin, D. Münstermann, K. Temmen, in: Lecture Notes in Networks and
Systems, Springer Nature Switzerland, Cham, 2026, pp. 199–211.'
conference:
end_date: 2025-04-11
location: Santiago, Chile
name: International Conference on Smart Technologies & Education (STE2025)
start_date: 2025-04-09
date_created: 2026-04-29T09:12:41Z
date_updated: 2026-04-29T09:23:02Z
department:
- _id: '34'
- _id: '3'
- _id: '300'
doi: 10.1007/978-3-032-07319-8_19
intvolume: ' 2'
keyword:
- Meta Quest 3
- Augmented Reality
- Mixed Reality
- PEARL
- Electrical Engineering
- Laboratory Training
- Onboarding
- User Experience
- User Interface
- Heuristics
language:
- iso: eng
page: 199-211
place: Cham
publication: Lecture Notes in Networks and Systems
publication_identifier:
isbn:
- '9783032073181'
- '9783032073198'
issn:
- 2367-3370
- 2367-3389
publication_status: published
publisher: Springer Nature Switzerland
series_title: Smart Technologies for an All-Electric Society
status: public
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'
type: book_chapter
user_id: '11763'
volume: 2
year: '2026'
...