---
_id: '60504'
author:
- first_name: Tom
full_name: Nellius, Tom
last_name: Nellius
- first_name: Kevin
full_name: Henne, Kevin
id: '56918'
last_name: Henne
- first_name: Maximilian
full_name: Hartinger, Maximilian
last_name: Hartinger
- first_name: Lars
full_name: Meihost, Lars
id: '24769'
last_name: Meihost
- first_name: Tim
full_name: Hetkämper, Tim
id: '38123'
last_name: Hetkämper
- first_name: Henning
full_name: Zeipert, Henning
id: '32580'
last_name: Zeipert
- first_name: Leander
full_name: Claes, Leander
id: '11829'
last_name: Claes
orcid: 0000-0002-4393-268X
- first_name: Bernd
full_name: Henning, Bernd
id: '213'
last_name: Henning
citation:
ama: 'Nellius T, Henne K, Hartinger M, et al. Ultrasonic phased array interface
using programmable I/O and microprocessor clock synchronisation. In: ; 2025. doi: 10.5162/SMSI2025/A5.4'
apa: Nellius, T., Henne, K., Hartinger, M., Meihost, L., Hetkämper, T., Zeipert,
H., Claes, L., & Henning, B. (2025). Ultrasonic phased array interface
using programmable I/O and microprocessor clock synchronisation. SMSI 2025,
Nürnberg. https://doi.org/ 10.5162/SMSI2025/A5.4
bibtex: '@inproceedings{Nellius_Henne_Hartinger_Meihost_Hetkämper_Zeipert_Claes_Henning_2025,
title={Ultrasonic phased array interface using programmable I/O and microprocessor
clock synchronisation}, DOI={
10.5162/SMSI2025/A5.4}, author={Nellius, Tom and Henne, Kevin and Hartinger,
Maximilian and Meihost, Lars and Hetkämper, Tim and Zeipert, Henning and Claes,
Leander and Henning, Bernd}, year={2025} }'
chicago: Nellius, Tom, Kevin Henne, Maximilian Hartinger, Lars Meihost, Tim Hetkämper,
Henning Zeipert, Leander Claes, and Bernd Henning. “Ultrasonic Phased Array Interface
Using Programmable I/O and Microprocessor Clock Synchronisation,” 2025. https://doi.org/ 10.5162/SMSI2025/A5.4.
ieee: 'T. Nellius et al., “Ultrasonic phased array interface using programmable
I/O and microprocessor clock synchronisation,” presented at the SMSI 2025, Nürnberg,
2025, doi: 10.5162/SMSI2025/A5.4.'
mla: Nellius, Tom, et al. Ultrasonic Phased Array Interface Using Programmable
I/O and Microprocessor Clock Synchronisation. 2025, doi: 10.5162/SMSI2025/A5.4.
short: 'T. Nellius, K. Henne, M. Hartinger, L. Meihost, T. Hetkämper, H. Zeipert,
L. Claes, B. Henning, in: 2025.'
conference:
end_date: 2025-05-08
location: Nürnberg
name: SMSI 2025
start_date: 2025-05-06
date_created: 2025-07-03T07:17:54Z
date_updated: 2026-04-08T08:51:39Z
department:
- _id: '49'
doi: ' 10.5162/SMSI2025/A5.4'
language:
- iso: eng
status: public
title: Ultrasonic phased array interface using programmable I/O and microprocessor
clock synchronisation
type: conference
user_id: '11829'
year: '2025'
...
---
_id: '64902'
abstract:
- lang: ger
text: 'Diese Dissertation behandelt die Entwicklung, Erprobung und Evaluation einer
mobilen Augmented Reality Anwendung (mAR-App) namens PEARL (Paderborner Elektrotechnik
AR Laborpraktikum), die als Vorbereitungsmaßnahme für elektrotechnische Laborpraktika
konzipiert wird. Ziel ist es, Studierenden eine zeitlich und örtlich flexible
Möglichkeit zu bieten, den realitätsnahen Umgang mit Laborgeräten - primär dem
Oszilloskop - zu erlernen. Die methodische Grundlage bilden der Makrozyklus von
Design-Based Research (DBR) als strukturierender Rahmen und das heuristische Modell
des Research Pentagons, das die Durchführung auf Mikroebene bestimmt. In insgesamt
vier Research Pentagons werden didaktische, technologische, motivationale und
evaluative Komponenten systematisch untersucht und weiterentwickelt. Das erste
Pentagon fokussiert die Entwicklung eines didaktisch fundierten Konzepts nach
dem Prinzip des Constructive Alignment, das Lernziele, Lernaktivitäten und Prüfungsformen
in fünf abgestufte Lernlevel überführt. Diese reichen von der initialen Orientierung
bis zur eigenständigen Problemlösung in einem freien Experimentiermodus. Im zweiten
Research Pentagon wird die technische Machbarkeit von Augmented - und Virtual
Reality (VR) im Laborumfeld anhand mehrerer funktionaler Prototypen evaluiert.
Während sich VR aufgrund technischer Einschränkungen als ungeeignet erweist, zeigt
AR - insbesondere in der markerlosen Ausführung mittels der Software Development
Kits (SDKs) ARCore und ARKit - ein hohes Potenzial für den praktischen Einsatz.
Im dritten Pentagon entsteht ein Onboarding-Modul, das auf die erste Version der
mobilen App (V0.17.01) aufsetzt und grundlegende Funktionen eines realen Oszilloskops
digital abbildet. Dabei werden Nutzer:innen schrittweise an das virtuelle Oszilloskop
herangeführt und lernen zugleich die zentralen Funktionen der mAR-App kennen.
Die Ergebnisse zeigen eine insgesamt neutrale bis leicht positive Nutzungserfahrung,
wobei technische Schwächen (z.B. Reaktionszeit oder Objektverankerung) die Effizienz
und Steuerbarkeit beeinträchtigen. Im Exkurs-Kapitel erfolgt eine Eye-Tracking-Studie
zur Untersuchung visueller Aufmerksamkeit und individueller Lösungsstrategien
von Expert:innen und Noviz:innen bei der Arbeit am realen Oszilloskop. Heatmaps
und Zeitverläufe in definierten Areas of Interest (AOI) liefern erste Hinweise
auf Unterschiede im Blickverhalten zwischen den Gruppen. Die algorithmischen Scanpfadanalysen
der Blickverläufe hingegen zeigen eine geringe Trennschärfe. Das Potenzial von
Eye-Tracking als Evaluationsmethode wird daher kritisch reflektiert, aber angesichts
technologischer Entwicklungen und verfügbarer Eye-Tracker in Mixed Reality (MR)
Brillen weiterhin als zukunftsrelevant eingeordnet. Die abschließende summative
Evaluation nutzt ein Prä‑Post-Test-Design mit Kontrollgruppenvergleich mit 70
Teilnehmenden, um die Lernwirksamkeit der überarbeiteten mAR-App mit klassischen
Materialien wie Videos und Handbüchern zu vergleichen. In der Interventionsgruppe
(IG) zeigen sich auf kognitiver und affektiver Ebene signifikant positive Veränderungen:
Die Leistungen steigen deutlich, insbesondere in den Taxonomiestufen Anwendung,
Verständnis und Analyse; zugleich nehmen experimentelles Selbstkonzept und experimentelles
Sachinteresse zu, während Überforderung und Ängstlichkeit im Hinblick auf die
Laborpraktika abnehmen. Als Einschränkung zeigt sich, dass die mAR-App keinen
klaren Vorsprung gegenüber der Kontrollgruppe (KG) erreicht, was sowohl auf die
sehr gut ausgearbeiteten Materialien und Videos der KG als auch auf technische
Begrenzungen der mobilen Umsetzung zurückzuführen ist: Kleine Displays, 2D-Oberflächen
für 3D-Geräte und unpräzise Touch-Interaktionen erschweren komplexe, feinmotorische
Aufgaben. In den begleitenden User Interface (UI) und User Experience (UX) Fragebögen
spiegeln sich diese Limitationen in gemischten Bewertungen der App wider. Die
Arbeit verdeutlicht, dass die mobile AR-Anwendung trotz technischer Einschränkungen
wertvolle Möglichkeiten für die Vorbereitung auf Laborpraktika und das Kennenlernen
von Laborgeräten bieten kann. Der Fokus bei der Entwicklung liegt von Beginn an
auf einer modularen und flexiblen App-Architektur, um sie mit neuen Geräten und
Aufgaben zu erweitern. Der Hauptnutzen liegt perspektivisch nicht in der mobilen
Anwendung selbst, sondern in der strategischen Ausrichtung auf zukunftsfähige,
skalierbare Lösungen für MR-Brillen. Diese erlauben eine authentische Gestensteuerung
und realitätsnahe Interaktionen.'
- lang: eng
text: 'This thesis examines the development, testing, and evaluation of a mobile
augmented reality application (mAR app), which is designed as a preparation tool
for electrical engineering laboratory courses. The aim is to offer students an
opportunity to work with laboratory equipment - primarily the oscilloscope - realistically
without location and time constraints. The methodological basis is formed by the
macrocycle of design-based research (DBR) as a structured framework and the heuristic
model of the research pentagon, which specifies the implementation at the micro
level. Didactic, technological, motivational, and evaluative components are systematically
examined and further developed in a total of four research pentagons. The first
pentagon focuses on the development of a didactically sound concept based on the
principle of constructive alignment, which incorporates learning objectives, learning
activities, and forms of assessment into five graduated learning levels. These
range from initial orientation to independent problem-solving in a free experimentation
mode. The second phase evaluates the technical feasibility of augmented and virtual
reality (VR) in the laboratory environment using several prototypes. While VR
turns out to be unsuitable due to technical limitations, AR - especially in the
markerless version using the ARCore and ARKit software development kits (SDKs)
- shows great potential for everyday use. In the third research pentagon, an onboarding
module is created based on the first version of the mobile app (V0.17.01), which
digitally maps the basic functions of a real oscilloscope. During this process,
users are introduced to the virtual oscilloscope and become familiar with the
main functions of the mAR app. The results show an overall neutral to slightly
positive user experience, although technical weaknesses (e.g., reaction time and
object fixing) negatively impact efficiency and controllability. In the fourth
research pentagon, an eye-tracking study is carried out to investigate visual
attention and individual solution strategies of expert and novice users when working
with real oscilloscopes. Heatmaps and time sequences in defined areas of interest
(AOI) provide first indications of differences in gaze behavior between the groups.
The algorithmic scan path analysis, on the other hand, reveals a low degree of
differentiation. The potential of eye tracking as an evaluation method is therefore
critically reflected, but it is still considered to be relevant for future studies
in light of technological advancements and the availability of eye trackers in
mixed reality (MR) glasses. The final summative evaluation is carried out in the
way of a pre-post test design with 70 participants and compares the usage of traditional
materials such as videos and manuals with the improved mAR app. In the intervention
group (IG), significant improvements emerge on both cognitive and affective levels:
performance increases particularly in the areas of application, understanding,
and analysis, while experimental self-concept and subject-related interest rise
and feelings of overload and anxiety regarding the lab courses decline. As a limitation,
the mAR app does not yield a clear advantage over the control group (CG), which
can be attributed both to the highly refined materials and videos used in the
CG and to technical constraints inherent to the mobile implementation: small displays,
2D interfaces on 3D devices, and imprecise touch interaction limit complex, sensitive
motor tasks. These limitations are also reflected in the accompanying user interface
(UI) and user experience (UX) questionnaires, which indicate mixed app ratings.
Both groups show significant learning gains - particularly in the areas of application,
understanding, and analysis. However, a significant advantage of the mAR App cannot
be proven. Affective characteristics such as experimental self-concept and general
experimental interests increase in both groups, while the feeling of fear before
conducting real laboratory work decreases. The app itself achieves average ratings
in user interface (UI) and user experience (UX) questionnaires. The thesis demonstrates
that, despite technical limitations, the mobile AR application can provide a valuable
alternative for preparing students for laboratory courses and familiarizing them
with laboratory equipment. From the very beginning, the primary goal during development
was a modular and flexible app architecture that can be extended with new devices,
tasks, and functions. The main benefit is not in the mobile application itself,
but in the strategic direction of future-oriented and scalable solutions for MR
glasses, which allow immersive and realistic gesture interactions.'
author:
- first_name: Mesut
full_name: Alptekin, Mesut
id: '11763'
last_name: Alptekin
orcid: 0009-0004-8545-1165
citation:
ama: Alptekin M. Entwicklung Einer Augmented Reality Basierten Anwendung Als
Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik. LibreCat University;
2025. doi:10.17619/UNIPB/1-2483
apa: Alptekin, M. (2025). Entwicklung einer Augmented Reality basierten Anwendung
als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik. LibreCat
University. https://doi.org/10.17619/UNIPB/1-2483
bibtex: '@book{Alptekin_2025, title={Entwicklung einer Augmented Reality basierten
Anwendung als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik},
DOI={10.17619/UNIPB/1-2483},
publisher={LibreCat University}, author={Alptekin, Mesut}, year={2025} }'
chicago: Alptekin, Mesut. Entwicklung Einer Augmented Reality Basierten Anwendung
Als Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik. LibreCat
University, 2025. https://doi.org/10.17619/UNIPB/1-2483.
ieee: M. Alptekin, Entwicklung einer Augmented Reality basierten Anwendung als
Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik. LibreCat University,
2025.
mla: Alptekin, Mesut. Entwicklung Einer Augmented Reality Basierten Anwendung
Als Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik. LibreCat
University, 2025, doi:10.17619/UNIPB/1-2483.
short: M. Alptekin, Entwicklung Einer Augmented Reality Basierten Anwendung Als
Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik, LibreCat University,
2025.
date_created: 2026-03-11T11:05:08Z
date_updated: 2026-04-20T07:46:37Z
ddc:
- '620'
department:
- _id: '34'
- _id: '3'
- _id: '300'
doi: 10.17619/UNIPB/1-2483
publisher: LibreCat University
status: public
title: Entwicklung einer Augmented Reality basierten Anwendung als Vorbereitungsmaßnahme
zum Laborpraktikum in der Elektrotechnik
type: research_data
user_id: '14972'
year: '2025'
...
---
_id: '65466'
author:
- first_name: Fabian
full_name: Bäumer, Fabian
last_name: Bäumer
- first_name: Marcus
full_name: Brinkmann, Marcus
last_name: Brinkmann
- first_name: Maximilian
full_name: Radoy, Maximilian
last_name: Radoy
- first_name: Jörg
full_name: Schwenk, Jörg
last_name: Schwenk
- first_name: Juraj
full_name: Somorovsky, Juraj
last_name: Somorovsky
citation:
ama: 'Bäumer F, Brinkmann M, Radoy M, Schwenk J, Somorovsky J. On the Security of
SSH Client Signatures. In: Proceedings of the 2025 ACM SIGSAC Conference on
Computer and Communications Security. ACM; 2025. doi:10.1145/3719027.3765079'
apa: Bäumer, F., Brinkmann, M., Radoy, M., Schwenk, J., & Somorovsky, J. (2025).
On the Security of SSH Client Signatures. Proceedings of the 2025 ACM SIGSAC
Conference on Computer and Communications Security. https://doi.org/10.1145/3719027.3765079
bibtex: '@inproceedings{Bäumer_Brinkmann_Radoy_Schwenk_Somorovsky_2025, title={On
the Security of SSH Client Signatures}, DOI={10.1145/3719027.3765079},
booktitle={Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications
Security}, publisher={ACM}, author={Bäumer, Fabian and Brinkmann, Marcus and Radoy,
Maximilian and Schwenk, Jörg and Somorovsky, Juraj}, year={2025} }'
chicago: Bäumer, Fabian, Marcus Brinkmann, Maximilian Radoy, Jörg Schwenk, and Juraj
Somorovsky. “On the Security of SSH Client Signatures.” In Proceedings of the
2025 ACM SIGSAC Conference on Computer and Communications Security. ACM, 2025.
https://doi.org/10.1145/3719027.3765079.
ieee: 'F. Bäumer, M. Brinkmann, M. Radoy, J. Schwenk, and J. Somorovsky, “On the
Security of SSH Client Signatures,” 2025, doi: 10.1145/3719027.3765079.'
mla: Bäumer, Fabian, et al. “On the Security of SSH Client Signatures.” Proceedings
of the 2025 ACM SIGSAC Conference on Computer and Communications Security,
ACM, 2025, doi:10.1145/3719027.3765079.
short: 'F. Bäumer, M. Brinkmann, M. Radoy, J. Schwenk, J. Somorovsky, in: Proceedings
of the 2025 ACM SIGSAC Conference on Computer and Communications Security, ACM,
2025.'
date_created: 2026-04-20T13:09:17Z
date_updated: 2026-04-20T13:09:29Z
department:
- _id: '632'
- _id: '632'
doi: 10.1145/3719027.3765079
publication: Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications
Security
publication_status: published
publisher: ACM
status: public
title: On the Security of SSH Client Signatures
type: conference
user_id: '68826'
year: '2025'
...
---
_id: '65474'
author:
- first_name: Jeroen
full_name: Rook, Jeroen
id: '102977'
last_name: Rook
- first_name: Manuel
full_name: López-Ibáñez, Manuel
last_name: López-Ibáñez
citation:
ama: 'Rook J, López-Ibáñez M. Advanced Use of Automatic Algorithm Configuration:
Single- and Multi-Objective Approaches. In: Filipic B, ed. Proceedings of the
Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga
Hotel, Malaga, Spain, July 14-18, 2025. ACM; 2025:1617–1642. doi:10.1145/3712255.3716537'
apa: 'Rook, J., & López-Ibáñez, M. (2025). Advanced Use of Automatic Algorithm
Configuration: Single- and Multi-Objective Approaches. In B. Filipic (Ed.), Proceedings
of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025,
NH Malaga Hotel, Malaga, Spain, July 14-18, 2025 (pp. 1617–1642). ACM. https://doi.org/10.1145/3712255.3716537'
bibtex: '@inproceedings{Rook_López-Ibáñez_2025, title={Advanced Use of Automatic
Algorithm Configuration: Single- and Multi-Objective Approaches}, DOI={10.1145/3712255.3716537},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025}, publisher={ACM},
author={Rook, Jeroen and López-Ibáñez, Manuel}, editor={Filipic, Bogdan}, year={2025},
pages={1617–1642} }'
chicago: 'Rook, Jeroen, and Manuel López-Ibáñez. “Advanced Use of Automatic Algorithm
Configuration: Single- and Multi-Objective Approaches.” In Proceedings of the
Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga
Hotel, Malaga, Spain, July 14-18, 2025, edited by Bogdan Filipic, 1617–1642.
ACM, 2025. https://doi.org/10.1145/3712255.3716537.'
ieee: 'J. Rook and M. López-Ibáñez, “Advanced Use of Automatic Algorithm Configuration:
Single- and Multi-Objective Approaches,” in Proceedings of the Genetic and
Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga,
Spain, July 14-18, 2025, 2025, pp. 1617–1642, doi: 10.1145/3712255.3716537.'
mla: 'Rook, Jeroen, and Manuel López-Ibáñez. “Advanced Use of Automatic Algorithm
Configuration: Single- and Multi-Objective Approaches.” Proceedings of the
Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga
Hotel, Malaga, Spain, July 14-18, 2025, edited by Bogdan Filipic, ACM, 2025,
pp. 1617–1642, doi:10.1145/3712255.3716537.'
short: 'J. Rook, M. López-Ibáñez, in: B. Filipic (Ed.), Proceedings of the Genetic
and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel,
Malaga, Spain, July 14-18, 2025, ACM, 2025, pp. 1617–1642.'
date_created: 2026-04-21T11:50:48Z
date_updated: 2026-04-21T11:51:59Z
department:
- _id: '819'
doi: 10.1145/3712255.3716537
editor:
- first_name: Bogdan
full_name: Filipic, Bogdan
last_name: Filipic
language:
- iso: eng
page: 1617–1642
publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion,
GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025
publisher: ACM
status: public
title: 'Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective
Approaches'
type: conference
user_id: '15504'
year: '2025'
...
---
_id: '59895'
abstract:
- lang: eng
text: The generation of optically broadband Nyquist pulse sequences using an integrated
Mach-Zehnder modulator (MZM) in a thin-film lithium-niobate (TFLN) platform with
repetition rates of 5 to 32 GHz and optical bandwidths of up to 160 GHz is demonstrated.
Nyquist pulse sequences with high optical bandwidth can be used as synchronization
and control signals in quantum sources based on photon pair generation.
author:
- first_name: Christian
full_name: Kress, Christian
id: '13256'
last_name: Kress
orcid: 0000-0002-4403-2237
- first_name: Martin Miroslavov
full_name: Mihaylov, Martin Miroslavov
id: '42449'
last_name: Mihaylov
- first_name: Tobias
full_name: Schwabe, Tobias
id: '39217'
last_name: Schwabe
- first_name: Christine
full_name: Silberhorn, Christine
id: '26263'
last_name: Silberhorn
- first_name: J. Christoph
full_name: Scheytt, J. Christoph
id: '37144'
last_name: Scheytt
orcid: '0000-0002-5950-6618 '
citation:
ama: 'Kress C, Mihaylov MM, Schwabe T, Silberhorn C, Scheytt JC. Broadband Nyquist
Pulse Generation on TFLN Platform for Integrated Quantum Source. In: PIERS
Proceedings . PhotonIcs and Electromagnetics Research Symposium (PIERS). doi:10.1109/PIERS-Spring66516.2025.11276835'
apa: Kress, C., Mihaylov, M. M., Schwabe, T., Silberhorn, C., & Scheytt, J.
C. (n.d.). Broadband Nyquist Pulse Generation on TFLN Platform for Integrated
Quantum Source. PIERS Proceedings . PhotonIcs and Electromagnetics Research
Symposium (PIERS), Abu Dhabi. https://doi.org/10.1109/PIERS-Spring66516.2025.11276835
bibtex: '@inproceedings{Kress_Mihaylov_Schwabe_Silberhorn_Scheytt, title={Broadband
Nyquist Pulse Generation on TFLN Platform for Integrated Quantum Source}, DOI={10.1109/PIERS-Spring66516.2025.11276835},
booktitle={PIERS Proceedings }, publisher={PhotonIcs and Electromagnetics Research
Symposium (PIERS)}, author={Kress, Christian and Mihaylov, Martin Miroslavov and
Schwabe, Tobias and Silberhorn, Christine and Scheytt, J. Christoph} }'
chicago: Kress, Christian, Martin Miroslavov Mihaylov, Tobias Schwabe, Christine
Silberhorn, and J. Christoph Scheytt. “Broadband Nyquist Pulse Generation on TFLN
Platform for Integrated Quantum Source.” In PIERS Proceedings . PhotonIcs
and Electromagnetics Research Symposium (PIERS), n.d. https://doi.org/10.1109/PIERS-Spring66516.2025.11276835.
ieee: 'C. Kress, M. M. Mihaylov, T. Schwabe, C. Silberhorn, and J. C. Scheytt, “Broadband
Nyquist Pulse Generation on TFLN Platform for Integrated Quantum Source,” presented
at the PhotonIcs and Electromagnetics Research Symposium (PIERS), Abu Dhabi, doi:
10.1109/PIERS-Spring66516.2025.11276835.'
mla: Kress, Christian, et al. “Broadband Nyquist Pulse Generation on TFLN Platform
for Integrated Quantum Source.” PIERS Proceedings , PhotonIcs and Electromagnetics
Research Symposium (PIERS), doi:10.1109/PIERS-Spring66516.2025.11276835.
short: 'C. Kress, M.M. Mihaylov, T. Schwabe, C. Silberhorn, J.C. Scheytt, in: PIERS
Proceedings , PhotonIcs and Electromagnetics Research Symposium (PIERS), n.d.'
conference:
end_date: 2025-05-09
location: Abu Dhabi
name: PhotonIcs and Electromagnetics Research Symposium (PIERS)
start_date: 2025-05-03
date_created: 2025-05-14T09:59:50Z
date_updated: 2026-04-29T14:27:08Z
department:
- _id: '58'
- _id: '623'
doi: 10.1109/PIERS-Spring66516.2025.11276835
language:
- iso: eng
project:
- _id: '302'
name: 'PONyDAC: SPP 2111 - PONyDAC II - Präziser Optischer Nyquist-Puls-Synthesizer
DAC'
- _id: '175'
name: 'TRR 142 - C11: TRR 142 - Kompakte Photonenpaar-Quelle mit ultraschnellen
Modulatoren auf Basis von CMOS und LNOI (C11*)'
publication: 'PIERS Proceedings '
publication_status: accepted
publisher: PhotonIcs and Electromagnetics Research Symposium (PIERS)
status: public
title: Broadband Nyquist Pulse Generation on TFLN Platform for Integrated Quantum
Source
type: conference
user_id: '13256'
year: '2025'
...
---
_id: '61778'
abstract:
- lang: eng
text: "Understanding the entanglement structure of local Hamiltonian ground spaces\r\nis
a physically motivated problem, with applications ranging from tensor\r\nnetwork
design to quantum error-correcting codes. To this end, we study the\r\ncomplexity
of estimating ground state entanglement, and more generally entropy\r\nestimation
for low energy states and Gibbs states. We find, in particular, that\r\nthe classes
qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum\r\nanalogue of
public-coin AM) and QMA(2) (QMA with unentangled proofs) play a\r\ncrucial role
for such problems, showing: (1) Detecting a high-entanglement\r\nground state
is qq-QAM-complete, (2) computing an additive error approximation\r\nto the Helmholtz
free energy (equivalently, a multiplicative error\r\napproximation to the partition
function) is in qq-QAM, (3) detecting a\r\nlow-entanglement ground state is QMA(2)-hard,
and (4) detecting low energy\r\nstates which are close to product states can range
from QMA-complete to\r\nQMA(2)-complete. Our results make progress on an open
question of [Bravyi,\r\nChowdhury, Gosset and Wocjan, Nature Physics 2022] on
free energy, and yield\r\nthe first QMA(2)-complete Hamiltonian problem using
local Hamiltonians (cf. the\r\nsparse QMA(2)-complete Hamiltonian problem of [Chailloux,
Sattath, CCC 2012])."
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Jonas
full_name: Kamminga, Jonas
last_name: Kamminga
citation:
ama: Gharibian S, Kamminga J. On the complexity of estimating ground state entanglement
and free energy. arXiv:251006796. Published online 2025.
apa: Gharibian, S., & Kamminga, J. (2025). On the complexity of estimating ground
state entanglement and free energy. In arXiv:2510.06796.
bibtex: '@article{Gharibian_Kamminga_2025, title={On the complexity of estimating
ground state entanglement and free energy}, journal={arXiv:2510.06796}, author={Gharibian,
Sevag and Kamminga, Jonas}, year={2025} }'
chicago: Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating
Ground State Entanglement and Free Energy.” ArXiv:2510.06796, 2025.
ieee: S. Gharibian and J. Kamminga, “On the complexity of estimating ground state
entanglement and free energy,” arXiv:2510.06796. 2025.
mla: Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating Ground
State Entanglement and Free Energy.” ArXiv:2510.06796, 2025.
short: S. Gharibian, J. Kamminga, ArXiv:2510.06796 (2025).
date_created: 2025-10-10T13:45:28Z
date_updated: 2026-04-30T14:08:44Z
department:
- _id: '7'
- _id: '623'
external_id:
arxiv:
- '2510.06796'
language:
- iso: eng
publication: arXiv:2510.06796
status: public
title: On the complexity of estimating ground state entanglement and free energy
type: preprint
user_id: '71541'
year: '2025'
...
---
_id: '48632'
abstract:
- lang: eng
text: Digital Servitization is one of the significant trends affecting the manufacturing
industry. Companies try to tackle challenges regarding their differentiation and
profitability using digital services. One specific type of digital services are
smart services, which are digital services built on data from smart products.
Introducing these kinds of offerings into the portfolio of manufacturing companies
is not trivial. Moreover, they require conscious action to align all relevant
capabilities to realize the respective business goals. However, what capabilities
are generally relevant for smart services remains opaque. We conducted a systematic
literature review to identify them and extended the results through an interview
study. Our analysis results in 78 capabilities clustered among 12 principles and
six dimensions. These results provide significant support for the smart service
transformation of manufacturing companies and for structuring the research field
of smart services.
author:
- first_name: Christian
full_name: Koldewey, Christian
id: '43136'
last_name: Koldewey
orcid: https://orcid.org/0000-0001-7992-6399
- first_name: Timm
full_name: Fichtler, Timm
id: '66731'
last_name: Fichtler
orcid: https://orcid.org/0000-0001-6034-4399
- first_name: Michel
full_name: Scholtysik, Michel
id: '50562'
last_name: Scholtysik
- first_name: Jan
full_name: Biehler, Jan
last_name: Biehler
- first_name: Nick
full_name: Schreiner, Nick
last_name: Schreiner
- first_name: Franziska
full_name: Sommer, Franziska
last_name: Sommer
- first_name: Maximilian
full_name: Schacht, Maximilian
last_name: Schacht
- first_name: Jonas
full_name: Kaufmann, Jonas
last_name: Kaufmann
- first_name: Martin
full_name: Rabe, Martin
last_name: Rabe
- first_name: Joachim
full_name: Sedlmeier, Joachim
last_name: Sedlmeier
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: 'Koldewey C, Fichtler T, Scholtysik M, et al. Exploring Capabilities for the
Smart Service Transformation in Manufacturing: Insights from Theory and Practice.
In: ; 2024.'
apa: 'Koldewey, C., Fichtler, T., Scholtysik, M., Biehler, J., Schreiner, N., Sommer,
F., Schacht, M., Kaufmann, J., Rabe, M., Sedlmeier, J., & Dumitrescu, R. (2024).
Exploring Capabilities for the Smart Service Transformation in Manufacturing:
Insights from Theory and Practice. Hawaii International Conference on System
Sciences, Hawaii.'
bibtex: '@inproceedings{Koldewey_Fichtler_Scholtysik_Biehler_Schreiner_Sommer_Schacht_Kaufmann_Rabe_Sedlmeier_et
al._2024, title={Exploring Capabilities for the Smart Service Transformation in
Manufacturing: Insights from Theory and Practice}, author={Koldewey, Christian
and Fichtler, Timm and Scholtysik, Michel and Biehler, Jan and Schreiner, Nick
and Sommer, Franziska and Schacht, Maximilian and Kaufmann, Jonas and Rabe, Martin
and Sedlmeier, Joachim and et al.}, year={2024} }'
chicago: 'Koldewey, Christian, Timm Fichtler, Michel Scholtysik, Jan Biehler, Nick
Schreiner, Franziska Sommer, Maximilian Schacht, et al. “Exploring Capabilities
for the Smart Service Transformation in Manufacturing: Insights from Theory and
Practice,” 2024.'
ieee: 'C. Koldewey et al., “Exploring Capabilities for the Smart Service
Transformation in Manufacturing: Insights from Theory and Practice,” presented
at the Hawaii International Conference on System Sciences, Hawaii, 2024.'
mla: 'Koldewey, Christian, et al. Exploring Capabilities for the Smart Service
Transformation in Manufacturing: Insights from Theory and Practice. 2024.'
short: 'C. Koldewey, T. Fichtler, M. Scholtysik, J. Biehler, N. Schreiner, F. Sommer,
M. Schacht, J. Kaufmann, M. Rabe, J. Sedlmeier, R. Dumitrescu, in: 2024.'
conference:
end_date: 2024-01-06
location: Hawaii
name: Hawaii International Conference on System Sciences
start_date: 2024-01-03
date_created: 2023-11-06T15:31:32Z
date_updated: 2023-11-06T15:40:33Z
department:
- _id: '563'
- _id: '241'
keyword:
- Digital Servitization
- Transformation
- Capabilities
- Maturity
- Smart Services
language:
- iso: eng
status: public
title: 'Exploring Capabilities for the Smart Service Transformation in Manufacturing:
Insights from Theory and Practice'
type: conference
user_id: '66731'
year: '2024'
...
---
_id: '49354'
author:
- first_name: Lameya
full_name: Afroze, Lameya
last_name: Afroze
- first_name: Silke
full_name: Merkelbach, Silke
last_name: Merkelbach
- first_name: Sebastian
full_name: von Enzberg, Sebastian
last_name: von Enzberg
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: 'Afroze L, Merkelbach S, von Enzberg S, Dumitrescu R. Domain Knowledge Injection
Guidance for Predictive Maintenance. In: ML4CPS 2023. ; 2024.'
apa: Afroze, L., Merkelbach, S., von Enzberg, S., & Dumitrescu, R. (2024). Domain
Knowledge Injection Guidance for Predictive Maintenance. ML4CPS 2023. ML4CPS
– Machine Learning For Cyber-Physical Systems, Hamburg.
bibtex: '@inproceedings{Afroze_Merkelbach_von Enzberg_Dumitrescu_2024, title={Domain
Knowledge Injection Guidance for Predictive Maintenance}, booktitle={ML4CPS 2023},
author={Afroze, Lameya and Merkelbach, Silke and von Enzberg, Sebastian and Dumitrescu,
Roman}, year={2024} }'
chicago: Afroze, Lameya, Silke Merkelbach, Sebastian von Enzberg, and Roman Dumitrescu.
“Domain Knowledge Injection Guidance for Predictive Maintenance.” In ML4CPS
2023, 2024.
ieee: L. Afroze, S. Merkelbach, S. von Enzberg, and R. Dumitrescu, “Domain Knowledge
Injection Guidance for Predictive Maintenance,” presented at the ML4CPS – Machine
Learning For Cyber-Physical Systems, Hamburg, 2024.
mla: Afroze, Lameya, et al. “Domain Knowledge Injection Guidance for Predictive
Maintenance.” ML4CPS 2023, 2024.
short: 'L. Afroze, S. Merkelbach, S. von Enzberg, R. Dumitrescu, in: ML4CPS 2023,
2024.'
conference:
end_date: 2023-0331
location: Hamburg
name: ML4CPS – Machine Learning For Cyber-Physical Systems
start_date: 2023-03-29
date_created: 2023-11-30T09:59:41Z
date_updated: 2023-11-30T14:09:47Z
department:
- _id: '563'
language:
- iso: eng
publication: ML4CPS 2023
status: public
title: Domain Knowledge Injection Guidance for Predictive Maintenance
type: conference
user_id: '15782'
year: '2024'
...
---
_id: '49364'
author:
- first_name: Michel
full_name: Scholtysik, Michel
id: '50562'
last_name: Scholtysik
- first_name: Malte
full_name: Rohde, Malte
last_name: Rohde
- first_name: Christian
full_name: Koldewey, Christian
id: '43136'
last_name: Koldewey
orcid: https://orcid.org/0000-0001-7992-6399
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: 'Scholtysik M, Rohde M, Koldewey C, Dumitrescu R. Business strategy taxonomy
and solution patterns for the circular economy. In: ; 2024.'
apa: Scholtysik, M., Rohde, M., Koldewey, C., & Dumitrescu, R. (2024). Business
strategy taxonomy and solution patterns for the circular economy.
bibtex: '@inproceedings{Scholtysik_Rohde_Koldewey_Dumitrescu_2024, title={Business
strategy taxonomy and solution patterns for the circular economy}, author={Scholtysik,
Michel and Rohde, Malte and Koldewey, Christian and Dumitrescu, Roman}, year={2024}
}'
chicago: Scholtysik, Michel, Malte Rohde, Christian Koldewey, and Roman Dumitrescu.
“Business Strategy Taxonomy and Solution Patterns for the Circular Economy,” 2024.
ieee: M. Scholtysik, M. Rohde, C. Koldewey, and R. Dumitrescu, “Business strategy
taxonomy and solution patterns for the circular economy,” 2024.
mla: Scholtysik, Michel, et al. Business Strategy Taxonomy and Solution Patterns
for the Circular Economy. 2024.
short: 'M. Scholtysik, M. Rohde, C. Koldewey, R. Dumitrescu, in: 2024.'
date_created: 2023-11-30T10:57:30Z
date_updated: 2023-11-30T14:27:55Z
department:
- _id: '563'
language:
- iso: eng
status: public
title: Business strategy taxonomy and solution patterns for the circular economy
type: conference
user_id: '50562'
year: '2024'
...
---
_id: '51160'
abstract:
- lang: eng
text: "We rigorously derive novel and sharp finite-data error bounds for highly\r\nsample-efficient
Extended Dynamic Mode Decomposition (EDMD) for both i.i.d. and\r\nergodic sampling.
In particular, we show all results in a very general setting\r\nremoving most
of the typically imposed assumptions such that, among others,\r\ndiscrete- and
continuous-time stochastic processes as well as nonlinear partial\r\ndifferential
equations are contained in the considered system class. Besides\r\nshowing an
exponential rate for i.i.d. sampling, we prove, to the best of our\r\nknowledge,
the first superlinear convergence rates for ergodic sampling of\r\ndeterministic
systems. We verify sharpness of the derived error bounds by\r\nconducting numerical
simulations for highly-complex applications from molecular\r\ndynamics and chaotic
flame propagation."
author:
- first_name: Friedrich M.
full_name: Philipp, Friedrich M.
last_name: Philipp
- first_name: Manuel
full_name: Schaller, Manuel
last_name: Schaller
- first_name: Septimus
full_name: Boshoff, Septimus
last_name: Boshoff
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
- first_name: Feliks
full_name: Nüske, Feliks
last_name: Nüske
- first_name: Karl
full_name: Worthmann, Karl
last_name: Worthmann
citation:
ama: 'Philipp FM, Schaller M, Boshoff S, Peitz S, Nüske F, Worthmann K. Extended
Dynamic Mode Decomposition: Sharp bounds on the sample efficiency. arXiv:240202494.
Published online 2024.'
apa: 'Philipp, F. M., Schaller, M., Boshoff, S., Peitz, S., Nüske, F., & Worthmann,
K. (2024). Extended Dynamic Mode Decomposition: Sharp bounds on the sample efficiency.
In arXiv:2402.02494.'
bibtex: '@article{Philipp_Schaller_Boshoff_Peitz_Nüske_Worthmann_2024, title={Extended
Dynamic Mode Decomposition: Sharp bounds on the sample efficiency}, journal={arXiv:2402.02494},
author={Philipp, Friedrich M. and Schaller, Manuel and Boshoff, Septimus and Peitz,
Sebastian and Nüske, Feliks and Worthmann, Karl}, year={2024} }'
chicago: 'Philipp, Friedrich M., Manuel Schaller, Septimus Boshoff, Sebastian Peitz,
Feliks Nüske, and Karl Worthmann. “Extended Dynamic Mode Decomposition: Sharp
Bounds on the Sample Efficiency.” ArXiv:2402.02494, 2024.'
ieee: 'F. M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, and K. Worthmann,
“Extended Dynamic Mode Decomposition: Sharp bounds on the sample efficiency,”
arXiv:2402.02494. 2024.'
mla: 'Philipp, Friedrich M., et al. “Extended Dynamic Mode Decomposition: Sharp
Bounds on the Sample Efficiency.” ArXiv:2402.02494, 2024.'
short: F.M. Philipp, M. Schaller, S. Boshoff, S. Peitz, F. Nüske, K. Worthmann,
ArXiv:2402.02494 (2024).
date_created: 2024-02-06T08:52:21Z
date_updated: 2024-02-06T08:52:44Z
department:
- _id: '655'
external_id:
arxiv:
- '2402.02494'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2402.02494.pdf
oa: '1'
publication: arXiv:2402.02494
status: public
title: 'Extended Dynamic Mode Decomposition: Sharp bounds on the sample efficiency'
type: preprint
user_id: '47427'
year: '2024'
...
---
_id: '51208'
abstract:
- lang: eng
text: AbstractApproximation of subdifferentials
is one of the main tasks when computing descent directions for nonsmooth optimization
problems. In this article, we propose a bisection method for weakly lower semismooth
functions which is able to compute new subgradients that improve a given approximation
in case a direction with insufficient descent was computed. Combined with a recently
proposed deterministic gradient sampling approach, this yields a deterministic
and provably convergent way to approximate subdifferentials for computing descent
directions.
author:
- first_name: Bennet
full_name: Gebken, Bennet
id: '32643'
last_name: Gebken
citation:
ama: Gebken B. A note on the convergence of deterministic gradient sampling in nonsmooth
optimization. Computational Optimization and Applications. Published online
2024. doi:10.1007/s10589-024-00552-0
apa: Gebken, B. (2024). A note on the convergence of deterministic gradient sampling
in nonsmooth optimization. Computational Optimization and Applications.
https://doi.org/10.1007/s10589-024-00552-0
bibtex: '@article{Gebken_2024, title={A note on the convergence of deterministic
gradient sampling in nonsmooth optimization}, DOI={10.1007/s10589-024-00552-0},
journal={Computational Optimization and Applications}, publisher={Springer Science
and Business Media LLC}, author={Gebken, Bennet}, year={2024} }'
chicago: Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling
in Nonsmooth Optimization.” Computational Optimization and Applications,
2024. https://doi.org/10.1007/s10589-024-00552-0.
ieee: 'B. Gebken, “A note on the convergence of deterministic gradient sampling
in nonsmooth optimization,” Computational Optimization and Applications,
2024, doi: 10.1007/s10589-024-00552-0.'
mla: Gebken, Bennet. “A Note on the Convergence of Deterministic Gradient Sampling
in Nonsmooth Optimization.” Computational Optimization and Applications,
Springer Science and Business Media LLC, 2024, doi:10.1007/s10589-024-00552-0.
short: B. Gebken, Computational Optimization and Applications (2024).
date_created: 2024-02-07T07:23:23Z
date_updated: 2024-02-08T08:05:54Z
department:
- _id: '101'
doi: 10.1007/s10589-024-00552-0
keyword:
- Applied Mathematics
- Computational Mathematics
- Control and Optimization
language:
- iso: eng
publication: Computational Optimization and Applications
publication_identifier:
issn:
- 0926-6003
- 1573-2894
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: A note on the convergence of deterministic gradient sampling in nonsmooth optimization
type: journal_article
user_id: '32643'
year: '2024'
...
---
_id: '46019'
abstract:
- lang: eng
text: We derive efficient algorithms to compute weakly Pareto optimal solutions
for smooth, convex and unconstrained multiobjective optimization problems in general
Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical
system in the multiobjective setting, which trajectories converge weakly to Pareto
optimal solutions. Discretization of this system yields an inertial multiobjective
algorithm which generates sequences that converge weakly to Pareto optimal solutions.
We employ Nesterov acceleration to define an algorithm with an improved convergence
rate compared to the plain multiobjective steepest descent method (Algorithm 1).
A further improvement in terms of efficiency is achieved by avoiding the solution
of a quadratic subproblem to compute a common step direction for all objective
functions, which is usually required in first-order methods. Using a different
discretization of our inertial gradient-like dynamical system, we obtain an accelerated
multiobjective gradient method that does not require the solution of a subproblem
in each step (Algorithm 2). While this algorithm does not converge in general,
it yields good results on test problems while being faster than standard steepest
descent.
author:
- first_name: Konstantin
full_name: Sonntag, Konstantin
id: '56399'
last_name: Sonntag
orcid: https://orcid.org/0000-0003-3384-3496
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
citation:
ama: Sonntag K, Peitz S. Fast Multiobjective Gradient Methods with Nesterov Acceleration
via Inertial Gradient-Like Systems. Journal of Optimization Theory and Applications.
Published online 2024. doi:10.1007/s10957-024-02389-3
apa: Sonntag, K., & Peitz, S. (2024). Fast Multiobjective Gradient Methods with
Nesterov Acceleration via Inertial Gradient-Like Systems. Journal of Optimization
Theory and Applications. https://doi.org/10.1007/s10957-024-02389-3
bibtex: '@article{Sonntag_Peitz_2024, title={Fast Multiobjective Gradient Methods
with Nesterov Acceleration via Inertial Gradient-Like Systems}, DOI={10.1007/s10957-024-02389-3},
journal={Journal of Optimization Theory and Applications}, publisher={Springer},
author={Sonntag, Konstantin and Peitz, Sebastian}, year={2024} }'
chicago: Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient
Methods with Nesterov Acceleration via Inertial Gradient-Like Systems.” Journal
of Optimization Theory and Applications, 2024. https://doi.org/10.1007/s10957-024-02389-3.
ieee: 'K. Sonntag and S. Peitz, “Fast Multiobjective Gradient Methods with Nesterov
Acceleration via Inertial Gradient-Like Systems,” Journal of Optimization Theory
and Applications, 2024, doi: 10.1007/s10957-024-02389-3.'
mla: Sonntag, Konstantin, and Sebastian Peitz. “Fast Multiobjective Gradient Methods
with Nesterov Acceleration via Inertial Gradient-Like Systems.” Journal of
Optimization Theory and Applications, Springer, 2024, doi:10.1007/s10957-024-02389-3.
short: K. Sonntag, S. Peitz, Journal of Optimization Theory and Applications (2024).
date_created: 2023-07-12T06:35:58Z
date_updated: 2024-02-21T10:13:33Z
department:
- _id: '101'
- _id: '655'
doi: 10.1007/s10957-024-02389-3
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/content/pdf/10.1007/s10957-024-02389-3.pdf
oa: '1'
publication: Journal of Optimization Theory and Applications
publication_status: published
publisher: Springer
status: public
title: Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial
Gradient-Like Systems
type: journal_article
user_id: '56399'
year: '2024'
...
---
_id: '51334'
abstract:
- lang: eng
text: The efficient optimization method for locally Lipschitz continuous multiobjective
optimization problems from [1] is extended from finite-dimensional problems to
general Hilbert spaces. The method iteratively computes Pareto critical points,
where in each iteration, an approximation of the subdifferential is computed in
an efficient manner and then used to compute a common descent direction for all
objective functions. To prove convergence, we present some new optimality results
for nonsmooth multiobjective optimization problems in Hilbert spaces. Using these,
we can show that every accumulation point of the sequence generated by our algorithm
is Pareto critical under common assumptions. Computational efficiency for finding
Pareto critical points is numerically demonstrated for multiobjective optimal
control of an obstacle problem.
author:
- first_name: Konstantin
full_name: Sonntag, Konstantin
id: '56399'
last_name: Sonntag
orcid: https://orcid.org/0000-0003-3384-3496
- first_name: Bennet
full_name: Gebken, Bennet
id: '32643'
last_name: Gebken
- first_name: Georg
full_name: Müller, Georg
last_name: Müller
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
- first_name: Stefan
full_name: Volkwein, Stefan
last_name: Volkwein
citation:
ama: Sonntag K, Gebken B, Müller G, Peitz S, Volkwein S. A Descent Method for Nonsmooth
Multiobjective Optimization in Hilbert Spaces. arXiv:240206376. Published
online 2024.
apa: Sonntag, K., Gebken, B., Müller, G., Peitz, S., & Volkwein, S. (2024).
A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces.
In arXiv:2402.06376.
bibtex: '@article{Sonntag_Gebken_Müller_Peitz_Volkwein_2024, title={A Descent Method
for Nonsmooth Multiobjective Optimization in Hilbert Spaces}, journal={arXiv:2402.06376},
author={Sonntag, Konstantin and Gebken, Bennet and Müller, Georg and Peitz, Sebastian
and Volkwein, Stefan}, year={2024} }'
chicago: Sonntag, Konstantin, Bennet Gebken, Georg Müller, Sebastian Peitz, and
Stefan Volkwein. “A Descent Method for Nonsmooth Multiobjective Optimization in
Hilbert Spaces.” ArXiv:2402.06376, 2024.
ieee: K. Sonntag, B. Gebken, G. Müller, S. Peitz, and S. Volkwein, “A Descent Method
for Nonsmooth Multiobjective Optimization in Hilbert Spaces,” arXiv:2402.06376.
2024.
mla: Sonntag, Konstantin, et al. “A Descent Method for Nonsmooth Multiobjective
Optimization in Hilbert Spaces.” ArXiv:2402.06376, 2024.
short: K. Sonntag, B. Gebken, G. Müller, S. Peitz, S. Volkwein, ArXiv:2402.06376
(2024).
date_created: 2024-02-13T09:35:26Z
date_updated: 2024-02-21T10:21:03Z
department:
- _id: '101'
- _id: '655'
external_id:
arxiv:
- "\t2402.06376"
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2402.06376
oa: '1'
publication: arXiv:2402.06376
status: public
title: A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces
type: preprint
user_id: '56399'
year: '2024'
...
---
_id: '40171'
abstract:
- lang: eng
text: We present a convolutional framework which significantly reduces the complexity
and thus, the computational effort for distributed reinforcement learning control
of dynamical systems governed by partial differential equations (PDEs). Exploiting
translational equivariances, the high-dimensional distributed control problem
can be transformed into a multi-agent control problem with many identical, uncoupled
agents. Furthermore, using the fact that information is transported with finite
velocity in many cases, the dimension of the agents’ environment can be drastically
reduced using a convolution operation over the state space of the PDE, by which
we effectively tackle the curse of dimensionality otherwise present in deep reinforcement
learning. In this setting, the complexity can be flexibly adjusted via the kernel
width or by using a stride greater than one (meaning that we do not place an actuator
at each sensor location). Moreover, scaling from smaller to larger domains – or
the transfer between different domains – becomes a straightforward task requiring
little effort. We demonstrate the performance of the proposed framework using
several PDE examples with increasing complexity, where stabilization is achieved
by training a low-dimensional deep deterministic policy gradient agent using minimal
computing resources.
article_type: original
author:
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
- first_name: Jan
full_name: Stenner, Jan
id: '65520'
last_name: Stenner
- first_name: Vikas
full_name: Chidananda, Vikas
last_name: Chidananda
- first_name: Oliver
full_name: Wallscheid, Oliver
id: '11291'
last_name: Wallscheid
orcid: https://orcid.org/0000-0001-9362-8777
- first_name: Steven L.
full_name: Brunton, Steven L.
last_name: Brunton
- first_name: Kunihiko
full_name: Taira, Kunihiko
last_name: Taira
citation:
ama: 'Peitz S, Stenner J, Chidananda V, Wallscheid O, Brunton SL, Taira K. Distributed
Control of Partial Differential Equations Using Convolutional Reinforcement Learning.
Physica D: Nonlinear Phenomena. 2024;461:134096. doi:10.1016/j.physd.2024.134096'
apa: 'Peitz, S., Stenner, J., Chidananda, V., Wallscheid, O., Brunton, S. L., &
Taira, K. (2024). Distributed Control of Partial Differential Equations Using
Convolutional Reinforcement Learning. Physica D: Nonlinear Phenomena, 461,
134096. https://doi.org/10.1016/j.physd.2024.134096'
bibtex: '@article{Peitz_Stenner_Chidananda_Wallscheid_Brunton_Taira_2024, title={Distributed
Control of Partial Differential Equations Using Convolutional Reinforcement Learning},
volume={461}, DOI={10.1016/j.physd.2024.134096},
journal={Physica D: Nonlinear Phenomena}, publisher={Elsevier}, author={Peitz,
Sebastian and Stenner, Jan and Chidananda, Vikas and Wallscheid, Oliver and Brunton,
Steven L. and Taira, Kunihiko}, year={2024}, pages={134096} }'
chicago: 'Peitz, Sebastian, Jan Stenner, Vikas Chidananda, Oliver Wallscheid, Steven
L. Brunton, and Kunihiko Taira. “Distributed Control of Partial Differential Equations
Using Convolutional Reinforcement Learning.” Physica D: Nonlinear Phenomena
461 (2024): 134096. https://doi.org/10.1016/j.physd.2024.134096.'
ieee: 'S. Peitz, J. Stenner, V. Chidananda, O. Wallscheid, S. L. Brunton, and K.
Taira, “Distributed Control of Partial Differential Equations Using Convolutional
Reinforcement Learning,” Physica D: Nonlinear Phenomena, vol. 461, p. 134096,
2024, doi: 10.1016/j.physd.2024.134096.'
mla: 'Peitz, Sebastian, et al. “Distributed Control of Partial Differential Equations
Using Convolutional Reinforcement Learning.” Physica D: Nonlinear Phenomena,
vol. 461, Elsevier, 2024, p. 134096, doi:10.1016/j.physd.2024.134096.'
short: 'S. Peitz, J. Stenner, V. Chidananda, O. Wallscheid, S.L. Brunton, K. Taira,
Physica D: Nonlinear Phenomena 461 (2024) 134096.'
date_created: 2023-01-26T07:56:26Z
date_updated: 2024-02-23T10:53:42Z
department:
- _id: '655'
doi: 10.1016/j.physd.2024.134096
intvolume: ' 461'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.physd.2024.134096
oa: '1'
page: '134096'
publication: 'Physica D: Nonlinear Phenomena'
publisher: Elsevier
status: public
title: Distributed Control of Partial Differential Equations Using Convolutional
Reinforcement Learning
type: journal_article
user_id: '47427'
volume: 461
year: '2024'
...
---
_id: '52318'
author:
- first_name: Svitlana
full_name: Dorociak, Svitlana
last_name: Dorociak
citation:
ama: Dorociak S. Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung.;
2024.
apa: Dorociak, S. (2024). Implementierung eines Algorithmus zur motivbasierten
Schnitt-Sparsifizierung.
bibtex: '@book{Dorociak_2024, title={Implementierung eines Algorithmus zur motivbasierten
Schnitt-Sparsifizierung}, author={Dorociak, Svitlana}, year={2024} }'
chicago: Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten
Schnitt-Sparsifizierung, 2024.
ieee: S. Dorociak, Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung.
2024.
mla: Dorociak, Svitlana. Implementierung Eines Algorithmus Zur Motivbasierten
Schnitt-Sparsifizierung. 2024.
short: S. Dorociak, Implementierung Eines Algorithmus Zur Motivbasierten Schnitt-Sparsifizierung,
2024.
date_created: 2024-03-05T12:52:59Z
date_updated: 2024-03-05T12:53:25Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung
type: bachelorsthesis
user_id: '15578'
year: '2024'
...
---
_id: '33461'
abstract:
- lang: eng
text: Data-driven models for nonlinear dynamical systems based on approximating
the underlying Koopman operator or generator have proven to be successful tools
for forecasting, feature learning, state estimation, and control. It has become
well known that the Koopman generators for control-affine systems also have affine
dependence on the input, leading to convenient finite-dimensional bilinear approximations
of the dynamics. Yet there are still two main obstacles that limit the scope of
current approaches for approximating the Koopman generators of systems with actuation.
First, the performance of existing methods depends heavily on the choice of basis
functions over which the Koopman generator is to be approximated; and there is
currently no universal way to choose them for systems that are not measure preserving.
Secondly, if we do not observe the full state, we may not gain access to a sufficiently
rich collection of such functions to describe the dynamics. This is because the
commonly used method of forming time-delayed observables fails when there is actuation.
To remedy these issues, we write the dynamics of observables governed by the Koopman
generator as a bilinear hidden Markov model, and determine the model parameters
using the expectation-maximization (EM) algorithm. The E-step involves a standard
Kalman filter and smoother, while the M-step resembles control-affine dynamic
mode decomposition for the generator. We demonstrate the performance of this method
on three examples, including recovery of a finite-dimensional Koopman-invariant
subspace for an actuated system with a slow manifold; estimation of Koopman eigenfunctions
for the unforced Duffing equation; and model-predictive control of a fluidic pinball
system based only on noisy observations of lift and drag.
author:
- first_name: Samuel E.
full_name: Otto, Samuel E.
last_name: Otto
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
- first_name: Clarence W.
full_name: Rowley, Clarence W.
last_name: Rowley
citation:
ama: Otto SE, Peitz S, Rowley CW. Learning Bilinear Models of Actuated Koopman Generators
from Partially-Observed Trajectories. SIAM Journal on Applied Dynamical Systems.
2024;23(1):885-923. doi:10.1137/22M1523601
apa: Otto, S. E., Peitz, S., & Rowley, C. W. (2024). Learning Bilinear Models
of Actuated Koopman Generators from Partially-Observed Trajectories. SIAM
Journal on Applied Dynamical Systems, 23(1), 885–923. https://doi.org/10.1137/22M1523601
bibtex: '@article{Otto_Peitz_Rowley_2024, title={Learning Bilinear Models of Actuated
Koopman Generators from Partially-Observed Trajectories}, volume={23}, DOI={10.1137/22M1523601}, number={1},
journal={SIAM Journal on Applied Dynamical Systems}, publisher={SIAM}, author={Otto,
Samuel E. and Peitz, Sebastian and Rowley, Clarence W.}, year={2024}, pages={885–923}
}'
chicago: 'Otto, Samuel E., Sebastian Peitz, and Clarence W. Rowley. “Learning Bilinear
Models of Actuated Koopman Generators from Partially-Observed Trajectories.”
SIAM Journal on Applied Dynamical Systems 23, no. 1 (2024): 885–923. https://doi.org/10.1137/22M1523601.'
ieee: 'S. E. Otto, S. Peitz, and C. W. Rowley, “Learning Bilinear Models of Actuated
Koopman Generators from Partially-Observed Trajectories,” SIAM Journal on
Applied Dynamical Systems, vol. 23, no. 1, pp. 885–923, 2024, doi: 10.1137/22M1523601.'
mla: Otto, Samuel E., et al. “Learning Bilinear Models of Actuated Koopman Generators
from Partially-Observed Trajectories.” SIAM Journal on Applied Dynamical Systems,
vol. 23, no. 1, SIAM, 2024, pp. 885–923, doi:10.1137/22M1523601.
short: S.E. Otto, S. Peitz, C.W. Rowley, SIAM Journal on Applied Dynamical Systems
23 (2024) 885–923.
date_created: 2022-09-22T07:21:40Z
date_updated: 2024-03-18T10:40:08Z
department:
- _id: '655'
doi: 10.1137/22M1523601
external_id:
arxiv:
- '2209.09977'
intvolume: ' 23'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2209.09977.pdf
oa: '1'
page: 885-923
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: SIAM Journal on Applied Dynamical Systems
publication_status: published
publisher: SIAM
status: public
title: Learning Bilinear Models of Actuated Koopman Generators from Partially-Observed
Trajectories
type: journal_article
user_id: '47427'
volume: 23
year: '2024'
...
---
_id: '52663'
abstract:
- lang: eng
text: "Context\r\nStatic analyses are well-established to aid in understanding bugs
or vulnerabilities during the development process or in large-scale studies. A
low false-positive rate is essential for the adaption in practice and for precise
results of empirical studies. Unfortunately, static analyses tend to report where
a vulnerability manifests rather than the fix location. This can cause presumed
false positives or imprecise results.\r\nMethod\r\nTo address this problem, we
designed an adaption of an existing static analysis algorithm that can distinguish
between a manifestation and fix location, and reports error chains. An error chain
represents at least two interconnected errors that occur successively, thus building
the connection between the fix and manifestation location. We used our tool CogniCryptSUBS
for a case study on 471 GitHub repositories, a performance benchmark to compare
different analysis configurations, and conducted an expert interview.\r\nResult\r\nWe
found that 50 % of the projects with a report had at least one error chain. Our
runtime benchmark demonstrated that our improvement caused only a minimal runtime
overhead of less than 4 %. The results of our expert interview indicate that with
our adapted version participants require fewer executions of the analysis.\r\nConclusion\r\nOur
results indicate that error chains occur frequently in real-world projects, and
ignoring them can lead to imprecise evaluation results. The runtime benchmark
indicates that our tool is a feasible and efficient solution for detecting error
chains in real-world projects. Further, our results gave a hint that the usability
of static analyses may benefit from supporting error chains."
author:
- first_name: Anna-Katharina
full_name: Wickert, Anna-Katharina
last_name: Wickert
- first_name: Michael
full_name: Schlichtig, Michael
id: '32312'
last_name: Schlichtig
orcid: 0000-0001-6600-6171
- first_name: Marvin
full_name: Vogel, Marvin
last_name: Vogel
- first_name: Lukas
full_name: Winter, Lukas
last_name: Winter
- first_name: Mira
full_name: Mezini, Mira
last_name: Mezini
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
citation:
ama: Wickert A-K, Schlichtig M, Vogel M, Winter L, Mezini M, Bodden E. Supporting
Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability.;
2024.
apa: Wickert, A.-K., Schlichtig, M., Vogel, M., Winter, L., Mezini, M., & Bodden,
E. (2024). Supporting Error Chains in Static Analysis for Precise Evaluation
Results and Enhanced Usability.
bibtex: '@book{Wickert_Schlichtig_Vogel_Winter_Mezini_Bodden_2024, title={Supporting
Error Chains in Static Analysis for Precise Evaluation Results and Enhanced Usability},
author={Wickert, Anna-Katharina and Schlichtig, Michael and Vogel, Marvin and
Winter, Lukas and Mezini, Mira and Bodden, Eric}, year={2024} }'
chicago: Wickert, Anna-Katharina, Michael Schlichtig, Marvin Vogel, Lukas Winter,
Mira Mezini, and Eric Bodden. Supporting Error Chains in Static Analysis for
Precise Evaluation Results and Enhanced Usability, 2024.
ieee: A.-K. Wickert, M. Schlichtig, M. Vogel, L. Winter, M. Mezini, and E. Bodden,
Supporting Error Chains in Static Analysis for Precise Evaluation Results and
Enhanced Usability. 2024.
mla: Wickert, Anna-Katharina, et al. Supporting Error Chains in Static Analysis
for Precise Evaluation Results and Enhanced Usability. 2024.
short: A.-K. Wickert, M. Schlichtig, M. Vogel, L. Winter, M. Mezini, E. Bodden,
Supporting Error Chains in Static Analysis for Precise Evaluation Results and
Enhanced Usability, 2024.
date_created: 2024-03-20T09:28:36Z
date_updated: 2024-03-20T09:32:29Z
department:
- _id: '76'
keyword:
- Static analysis
- error chains
- false positive re- duction
- empirical studies
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/2403.07808
status: public
title: Supporting Error Chains in Static Analysis for Precise Evaluation Results and
Enhanced Usability
type: misc
user_id: '32312'
year: '2024'
...
---
_id: '52691'
abstract:
- lang: eng
text: "We prove Feynman-Kac formulas for the semigroups generated by selfadjoint\r\noperators
in a class containing Fr\\\"ohlich Hamiltonians known from solid state\r\nphysics.
The latter model multi-polarons, i.e., a fixed number of quantum\r\nmechanical
electrons moving in a polarizable crystal and interacting with the\r\nquantized
phonon field generated by the crystal's vibrational modes. Both the\r\nelectrons
and phonons can be confined to suitable open subsets of Euclidean\r\nspace. We
also include possibly very singular magnetic vector potentials and\r\nelectrostatic
potentials. Our Feynman-Kac formulas comprise Fock space\r\noperator-valued multiplicative
functionals and can be applied to every vector\r\nin the underlying Hilbert space.
In comparison to the renormalized Nelson\r\nmodel, for which analogous Feynman-Kac
formulas are known, the analysis of the\r\ncreation and annihilation terms in
the multiplicative functionals requires\r\nnovel ideas to overcome difficulties
caused by the phonon dispersion relation\r\nbeing constant. Getting these terms
under control and generalizing other\r\nconstruction steps so as to cover confined
systems are the main achievements of\r\nthis article."
author:
- first_name: Benjamin
full_name: Hinrichs, Benjamin
id: '99427'
last_name: Hinrichs
orcid: 0000-0001-9074-1205
- first_name: Oliver
full_name: Matte, Oliver
last_name: Matte
citation:
ama: Hinrichs B, Matte O. Feynman-Kac formulas for semigroups generated by multi-polaron
Hamiltonians in magnetic fields and on general domains. arXiv:240312147.
Published online 2024.
apa: Hinrichs, B., & Matte, O. (2024). Feynman-Kac formulas for semigroups generated
by multi-polaron Hamiltonians in magnetic fields and on general domains. In arXiv:2403.12147.
bibtex: '@article{Hinrichs_Matte_2024, title={Feynman-Kac formulas for semigroups
generated by multi-polaron Hamiltonians in magnetic fields and on general domains},
journal={arXiv:2403.12147}, author={Hinrichs, Benjamin and Matte, Oliver}, year={2024}
}'
chicago: Hinrichs, Benjamin, and Oliver Matte. “Feynman-Kac Formulas for Semigroups
Generated by Multi-Polaron Hamiltonians in Magnetic Fields and on General Domains.”
ArXiv:2403.12147, 2024.
ieee: B. Hinrichs and O. Matte, “Feynman-Kac formulas for semigroups generated by
multi-polaron Hamiltonians in magnetic fields and on general domains,” arXiv:2403.12147.
2024.
mla: Hinrichs, Benjamin, and Oliver Matte. “Feynman-Kac Formulas for Semigroups
Generated by Multi-Polaron Hamiltonians in Magnetic Fields and on General Domains.”
ArXiv:2403.12147, 2024.
short: B. Hinrichs, O. Matte, ArXiv:2403.12147 (2024).
date_created: 2024-03-20T14:56:05Z
date_updated: 2024-03-20T14:56:50Z
department:
- _id: '799'
external_id:
arxiv:
- '2403.12147'
language:
- iso: eng
publication: arXiv:2403.12147
status: public
title: Feynman-Kac formulas for semigroups generated by multi-polaron Hamiltonians
in magnetic fields and on general domains
type: preprint
user_id: '99427'
year: '2024'
...
---
_id: '52686'
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: Ahmed QA, Wiersema T, Platzner M. Post-configuration Activation of Hardware
Trojans in FPGAs. Journal of Hardware and Systems Security. Published online
2024. doi:10.1007/s41635-024-00147-5
apa: Ahmed, Q. A., Wiersema, T., & Platzner, M. (2024). Post-configuration Activation
of Hardware Trojans in FPGAs. Journal of Hardware and Systems Security.
https://doi.org/10.1007/s41635-024-00147-5
bibtex: '@article{Ahmed_Wiersema_Platzner_2024, title={Post-configuration Activation
of Hardware Trojans in FPGAs}, DOI={10.1007/s41635-024-00147-5},
journal={Journal of Hardware and Systems Security}, publisher={Springer Science
and Business Media LLC}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner,
Marco}, year={2024} }'
chicago: Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Post-Configuration
Activation of Hardware Trojans in FPGAs.” Journal of Hardware and Systems Security,
2024. https://doi.org/10.1007/s41635-024-00147-5.
ieee: 'Q. A. Ahmed, T. Wiersema, and M. Platzner, “Post-configuration Activation
of Hardware Trojans in FPGAs,” Journal of Hardware and Systems Security,
2024, doi: 10.1007/s41635-024-00147-5.'
mla: Ahmed, Qazi Arbab, et al. “Post-Configuration Activation of Hardware Trojans
in FPGAs.” Journal of Hardware and Systems Security, Springer Science and
Business Media LLC, 2024, doi:10.1007/s41635-024-00147-5.
short: Q.A. Ahmed, T. Wiersema, M. Platzner, Journal of Hardware and Systems Security
(2024).
date_created: 2024-03-20T12:24:50Z
date_updated: 2024-03-20T12:31:36Z
department:
- _id: '78'
doi: 10.1007/s41635-024-00147-5
keyword:
- General Engineering
- Energy Engineering and Power Technology
language:
- iso: eng
publication: Journal of Hardware and Systems Security
publication_identifier:
issn:
- 2509-3428
- 2509-3436
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Post-configuration Activation of Hardware Trojans in FPGAs
type: journal_article
user_id: '72764'
year: '2024'
...
---
_id: '52379'
author:
- first_name: Sven
full_name: Hüsing, Sven
id: '58465'
last_name: Hüsing
- first_name: Carsten
full_name: Schulte, Carsten
id: '60311'
last_name: Schulte
- first_name: Sören
full_name: Sparmann, Sören
id: '63216'
last_name: Sparmann
- first_name: Mario
full_name: Bolte, Mario
last_name: Bolte
citation:
ama: 'Hüsing S, Schulte C, Sparmann S, Bolte M. Using Worked Examples for Engaging
in Epistemic Programming Projects. In: Proceedings of the 55th ACM Technical
Symposium on Computer Science Education V. 1. ACM; 2024. doi:10.1145/3626252.3630961'
apa: Hüsing, S., Schulte, C., Sparmann, S., & Bolte, M. (2024). Using Worked
Examples for Engaging in Epistemic Programming Projects. Proceedings of the
55th ACM Technical Symposium on Computer Science Education V. 1. https://doi.org/10.1145/3626252.3630961
bibtex: '@inproceedings{Hüsing_Schulte_Sparmann_Bolte_2024, title={Using Worked
Examples for Engaging in Epistemic Programming Projects}, DOI={10.1145/3626252.3630961},
booktitle={Proceedings of the 55th ACM Technical Symposium on Computer Science
Education V. 1}, publisher={ACM}, author={Hüsing, Sven and Schulte, Carsten and
Sparmann, Sören and Bolte, Mario}, year={2024} }'
chicago: Hüsing, Sven, Carsten Schulte, Sören Sparmann, and Mario Bolte. “Using
Worked Examples for Engaging in Epistemic Programming Projects.” In Proceedings
of the 55th ACM Technical Symposium on Computer Science Education V. 1. ACM,
2024. https://doi.org/10.1145/3626252.3630961.
ieee: 'S. Hüsing, C. Schulte, S. Sparmann, and M. Bolte, “Using Worked Examples
for Engaging in Epistemic Programming Projects,” 2024, doi: 10.1145/3626252.3630961.'
mla: Hüsing, Sven, et al. “Using Worked Examples for Engaging in Epistemic Programming
Projects.” Proceedings of the 55th ACM Technical Symposium on Computer Science
Education V. 1, ACM, 2024, doi:10.1145/3626252.3630961.
short: 'S. Hüsing, C. Schulte, S. Sparmann, M. Bolte, in: Proceedings of the 55th
ACM Technical Symposium on Computer Science Education V. 1, ACM, 2024.'
date_created: 2024-03-08T08:01:50Z
date_updated: 2024-03-21T23:19:04Z
department:
- _id: '67'
doi: 10.1145/3626252.3630961
language:
- iso: eng
publication: Proceedings of the 55th ACM Technical Symposium on Computer Science Education
V. 1
publication_status: published
publisher: ACM
status: public
title: Using Worked Examples for Engaging in Epistemic Programming Projects
type: conference
user_id: '58465'
year: '2024'
...