---
_id: '49760'
author:
- first_name: Darius
full_name: Jakobeit, Darius
last_name: Jakobeit
- first_name: Maximilian
full_name: Schenke, Maximilian
last_name: Schenke
- first_name: Oliver
full_name: Wallscheid, Oliver
last_name: Wallscheid
citation:
ama: Jakobeit D, Schenke M, Wallscheid O. Meta-Reinforcement-Learning-Based Current
Control of Permanent Magnet Synchronous Motor Drives for a Wide Range of Power
Classes. IEEE Transactions on Power Electronics. 2023;38(7):8062-8074.
doi:10.1109/tpel.2023.3256424
apa: Jakobeit, D., Schenke, M., & Wallscheid, O. (2023). Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes. IEEE Transactions on Power Electronics, 38(7),
8062–8074. https://doi.org/10.1109/tpel.2023.3256424
bibtex: '@article{Jakobeit_Schenke_Wallscheid_2023, title={Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes}, volume={38}, DOI={10.1109/tpel.2023.3256424},
number={7}, journal={IEEE Transactions on Power Electronics}, publisher={Institute
of Electrical and Electronics Engineers (IEEE)}, author={Jakobeit, Darius and
Schenke, Maximilian and Wallscheid, Oliver}, year={2023}, pages={8062–8074} }'
chicago: 'Jakobeit, Darius, Maximilian Schenke, and Oliver Wallscheid. “Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes.” IEEE Transactions on Power Electronics 38, no. 7 (2023):
8062–74. https://doi.org/10.1109/tpel.2023.3256424.'
ieee: 'D. Jakobeit, M. Schenke, and O. Wallscheid, “Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes,” IEEE Transactions on Power Electronics, vol. 38, no.
7, pp. 8062–8074, 2023, doi: 10.1109/tpel.2023.3256424.'
mla: Jakobeit, Darius, et al. “Meta-Reinforcement-Learning-Based Current Control
of Permanent Magnet Synchronous Motor Drives for a Wide Range of Power Classes.”
IEEE Transactions on Power Electronics, vol. 38, no. 7, Institute of Electrical
and Electronics Engineers (IEEE), 2023, pp. 8062–74, doi:10.1109/tpel.2023.3256424.
short: D. Jakobeit, M. Schenke, O. Wallscheid, IEEE Transactions on Power Electronics
38 (2023) 8062–8074.
date_created: 2023-12-18T09:54:18Z
date_updated: 2023-12-18T09:55:19Z
department:
- _id: '52'
doi: 10.1109/tpel.2023.3256424
intvolume: ' 38'
issue: '7'
keyword:
- Electrical and Electronic Engineering
language:
- iso: eng
page: 8062-8074
publication: IEEE Transactions on Power Electronics
publication_identifier:
issn:
- 0885-8993
- 1941-0107
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Meta-Reinforcement-Learning-Based Current Control of Permanent Magnet Synchronous
Motor Drives for a Wide Range of Power Classes
type: journal_article
user_id: '52638'
volume: 38
year: '2023'
...
---
_id: '48946'
abstract:
- lang: ger
text: inhalt Der verlässliche Betrieb von technischen Produkten wird zunehmend durch
bewusste Angriffe bedroht. Vollständige Sicherheit ist dabei nicht möglich, durchschlagende
Angriffe sind unvermeidbar (Assume Breach). Dies erfordert einen Paradigmenwechsel
in der sicherheitsgerechten Entwicklung mechatronischer und cyber-physischer Systeme
hin zu Defense-in-Depth. Systeme müssen so ausgelegt werden, dass sie auch bei
gezielten Angriffen möglichst hohe Zuverlässigkeit und Sicherheit gewährleisten.
Der hier beschriebene Lösungsansatz erweitert das Systemmodell um Angriffsszenarien
und Verteidigungslinien. Diese werden am Beispiel eines industriellen Schließsystems
zur Anlagensicherheit erläutert. Entwickler werden sensibilisiert, Angriffe systematisch
zu berücksichtigen und interdisziplinär Verteidigungselemente gegenüber Bedrohungen
und Angriffen zu spezifizieren.
- lang: eng
text: The reliable operation of technical products is increasingly threatened by
deliberate attacks. Complete security is not possible, striking attacks are unavoidable
(assume breach). This requires a paradigm shift in security-oriented engineering
of mechatronic and cyber-physical systems towards Defense-in-Depth. Systems need
to be engineered in a way that full reliability and security are ensured even
in case of targeted attacks. The solution approach described here expands the
system model to include attack scenarios and lines of defence. It is applied to
an industrial locking system for plant security as an example. Developers are
sensitised to systematically consider attacks and to specify interdisciplinary
defence elements against threats and attacks.
article_type: original
author:
- first_name: Iris
full_name: Gräßler, Iris
id: '47565'
last_name: Gräßler
orcid: 0000-0001-5765-971X
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Dominik
full_name: Wiechel, Dominik
id: '67161'
last_name: Wiechel
- first_name: Jens
full_name: Pottebaum, Jens
id: '405'
last_name: Pottebaum
orcid: http://orcid.org/0000-0001-8778-2989
citation:
ama: 'Gräßler I, Bodden E, Wiechel D, Pottebaum J. Defense-in-Depth als neues Paradigma
der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste
und lösungsorientierte Security. Konstruktion. 2023;75(11-12):60-65. doi:10.37544/0720-5953-2023-11-12-60'
apa: 'Gräßler, I., Bodden, E., Wiechel, D., & Pottebaum, J. (2023). Defense-in-Depth
als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security. Konstruktion, 75(11–12),
60–65. https://doi.org/10.37544/0720-5953-2023-11-12-60'
bibtex: '@article{Gräßler_Bodden_Wiechel_Pottebaum_2023, title={Defense-in-Depth
als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security}, volume={75}, DOI={10.37544/0720-5953-2023-11-12-60},
number={11–12}, journal={Konstruktion}, publisher={VDI Fachmedien GmbH and Co.
KG}, author={Gräßler, Iris and Bodden, Eric and Wiechel, Dominik and Pottebaum,
Jens}, year={2023}, pages={60–65} }'
chicago: 'Gräßler, Iris, Eric Bodden, Dominik Wiechel, and Jens Pottebaum. “Defense-in-Depth
als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security.” Konstruktion 75, no.
11–12 (2023): 60–65. https://doi.org/10.37544/0720-5953-2023-11-12-60.'
ieee: 'I. Gräßler, E. Bodden, D. Wiechel, and J. Pottebaum, “Defense-in-Depth als
neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security,” Konstruktion, vol.
75, no. 11–12, pp. 60–65, 2023, doi: 10.37544/0720-5953-2023-11-12-60.'
mla: 'Gräßler, Iris, et al. “Defense-in-Depth als neues Paradigma der sicherheitsgerechten
Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte
Security.” Konstruktion, vol. 75, no. 11–12, VDI Fachmedien GmbH and Co.
KG, 2023, pp. 60–65, doi:10.37544/0720-5953-2023-11-12-60.'
short: I. Gräßler, E. Bodden, D. Wiechel, J. Pottebaum, Konstruktion 75 (2023) 60–65.
date_created: 2023-11-16T08:23:12Z
date_updated: 2023-12-20T14:10:51Z
department:
- _id: '152'
- _id: '76'
doi: 10.37544/0720-5953-2023-11-12-60
intvolume: ' 75'
issue: 11-12
keyword:
- Mechanical Engineering
- Mechanics of Materials
- General Materials Science
- Theoretical Computer Science
language:
- iso: ger
page: 60-65
publication: Konstruktion
publication_identifier:
issn:
- 0720-5953
publication_status: published
publisher: VDI Fachmedien GmbH and Co. KG
quality_controlled: '1'
status: public
title: 'Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung:
interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security'
type: journal_article
user_id: '405'
volume: 75
year: '2023'
...
---
_id: '48599'
abstract:
- lang: eng
text: AbstractThe biexciton‐exciton emission cascade
commonly used in quantum‐dot systems to generate polarization entanglement yields
photons with intrinsically limited indistinguishability. In the present work,
it focuses on the generation of pairs of photons with high degrees of polarization
entanglement and simultaneously high indistinguishability. It achieves this goal
by selectively reducing the biexciton lifetime with an optical resonator. It demonstrates
that a suitably tailored circular Bragg reflector fulfills the requirements of
sufficient selective Purcell enhancement of biexciton emission paired with spectrally
broad photon extraction and twofold degenerate optical modes. The in‐depth theoretical
study combines (i) the optimization of realistic photonic structures solving Maxwell's
equations from which model parameters are extracted as input for (ii) microscopic
simulations of quantum‐dot cavity excitation dynamics with full access to photon
properties. It reports non‐trivial dependencies on system parameters and use the
predictive power of the combined theoretical approach to determine the optimal
range of Purcell enhancement that maximizes indistinguishability and entanglement
to near unity values, here specifically for the telecom C‐band at 1550 nm.
author:
- first_name: David
full_name: Bauch, David
last_name: Bauch
- first_name: Dustin
full_name: Siebert, Dustin
last_name: Siebert
- first_name: Klaus
full_name: Jöns, Klaus
id: '85353'
last_name: Jöns
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Stefan
full_name: Schumacher, Stefan
id: '27271'
last_name: Schumacher
orcid: 0000-0003-4042-4951
citation:
ama: Bauch D, Siebert D, Jöns K, Förstner J, Schumacher S. On‐Demand Indistinguishable
and Entangled Photons Using Tailored Cavity Designs. Advanced Quantum Technologies.
Published online 2023. doi:10.1002/qute.202300142
apa: Bauch, D., Siebert, D., Jöns, K., Förstner, J., & Schumacher, S. (2023).
On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs.
Advanced Quantum Technologies. https://doi.org/10.1002/qute.202300142
bibtex: '@article{Bauch_Siebert_Jöns_Förstner_Schumacher_2023, title={On‐Demand
Indistinguishable and Entangled Photons Using Tailored Cavity Designs}, DOI={10.1002/qute.202300142}, journal={Advanced
Quantum Technologies}, publisher={Wiley}, author={Bauch, David and Siebert, Dustin
and Jöns, Klaus and Förstner, Jens and Schumacher, Stefan}, year={2023} }'
chicago: Bauch, David, Dustin Siebert, Klaus Jöns, Jens Förstner, and Stefan Schumacher.
“On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs.”
Advanced Quantum Technologies, 2023. https://doi.org/10.1002/qute.202300142.
ieee: 'D. Bauch, D. Siebert, K. Jöns, J. Förstner, and S. Schumacher, “On‐Demand
Indistinguishable and Entangled Photons Using Tailored Cavity Designs,” Advanced
Quantum Technologies, 2023, doi: 10.1002/qute.202300142.'
mla: Bauch, David, et al. “On‐Demand Indistinguishable and Entangled Photons Using
Tailored Cavity Designs.” Advanced Quantum Technologies, Wiley, 2023, doi:10.1002/qute.202300142.
short: D. Bauch, D. Siebert, K. Jöns, J. Förstner, S. Schumacher, Advanced Quantum
Technologies (2023).
date_created: 2023-11-03T10:07:38Z
date_updated: 2023-12-21T10:41:17Z
department:
- _id: '61'
- _id: '230'
- _id: '429'
- _id: '623'
doi: 10.1002/qute.202300142
keyword:
- tet_topic_qd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://onlinelibrary.wiley.com/doi/10.1002/qute.202300142
oa: '1'
project:
- _id: '173'
grant_number: '231447078'
name: 'TRR 142 - C09: TRR 142 - Ideale Erzeugung von Photonenpaaren für Verschränkungsaustausch
bei Telekom Wellenlängen (C09*)'
- _id: '167'
grant_number: '231447078'
name: 'TRR 142 - B06: TRR 142 - Ultraschnelle kohärente opto-elektronische Kontrolle
eines photonischen Quantensystems (B06*)'
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Advanced Quantum Technologies
publication_identifier:
issn:
- 2511-9044
- 2511-9044
publication_status: published
publisher: Wiley
related_material:
record:
- id: '43246'
relation: earlier_version
status: public
status: public
title: On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs
type: journal_article
user_id: '158'
year: '2023'
...
---
_id: '43246'
abstract:
- lang: eng
text: The biexciton-exciton emission cascade commonly used in quantum-dot systems
to generate polarization entanglement yields photons with intrinsically limited
indistinguishability. In the present work we focus on the generation of pairs
of photons with high degrees of polarization entanglement and simultaneously high
indistinguishibility. We achieve this goal by selectively reducing the biexciton
lifetime with an optical resonator. We demonstrate that a suitably tailored circular
Bragg reflector fulfills the requirements of sufficient selective Purcell enhancement
of biexciton emission paired with spectrally broad photon extraction and two-fold
degenerate optical modes. Our in-depth theoretical study combines (i) the optimization
of realistic photonic structures solving Maxwell's equations from which model
parameters are extracted as input for (ii) microscopic simulations of quantum-dot
cavity excitation dynamics with full access to photon properties. We report non-trivial
dependencies on system parameters and use the predictive power of our combined
theoretical approach to determine the optimal range of Purcell enhancement that
maximizes indistinguishability and entanglement to near unity values in the telecom
C-band at $1550\,\mathrm{nm}$.
author:
- first_name: David
full_name: Bauch, David
last_name: Bauch
- first_name: Dustin
full_name: Siebert, Dustin
last_name: Siebert
- first_name: Klaus
full_name: Jöns, Klaus
id: '85353'
last_name: Jöns
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Stefan
full_name: Schumacher, Stefan
id: '27271'
last_name: Schumacher
orcid: 0000-0003-4042-4951
citation:
ama: Bauch D, Siebert D, Jöns K, Förstner J, Schumacher S. On-demand indistinguishable
and entangled photons at telecom frequencies using tailored cavity designs. Published
online 2023.
apa: Bauch, D., Siebert, D., Jöns, K., Förstner, J., & Schumacher, S. (2023).
On-demand indistinguishable and entangled photons at telecom frequencies using
tailored cavity designs.
bibtex: '@article{Bauch_Siebert_Jöns_Förstner_Schumacher_2023, title={On-demand
indistinguishable and entangled photons at telecom frequencies using tailored
cavity designs}, author={Bauch, David and Siebert, Dustin and Jöns, Klaus and
Förstner, Jens and Schumacher, Stefan}, year={2023} }'
chicago: Bauch, David, Dustin Siebert, Klaus Jöns, Jens Förstner, and Stefan Schumacher.
“On-Demand Indistinguishable and Entangled Photons at Telecom Frequencies Using
Tailored Cavity Designs,” 2023.
ieee: D. Bauch, D. Siebert, K. Jöns, J. Förstner, and S. Schumacher, “On-demand
indistinguishable and entangled photons at telecom frequencies using tailored
cavity designs.” 2023.
mla: Bauch, David, et al. On-Demand Indistinguishable and Entangled Photons at
Telecom Frequencies Using Tailored Cavity Designs. 2023.
short: D. Bauch, D. Siebert, K. Jöns, J. Förstner, S. Schumacher, (2023).
date_created: 2023-03-31T13:22:05Z
date_updated: 2023-12-21T10:41:17Z
department:
- _id: '61'
- _id: '230'
- _id: '429'
- _id: '623'
- _id: '15'
- _id: '35'
- _id: '170'
- _id: '297'
keyword:
- tet_topic_phc
- tet_topic_qd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2303.13871.pdf
oa: '1'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
- _id: '173'
grant_number: '231447078'
name: 'TRR 142 - C09: TRR 142 - Subproject C09'
- _id: '167'
grant_number: '231447078'
name: 'TRR 142 - B06: TRR 142 - Subproject B06'
- _id: '53'
grant_number: '231447078'
name: 'TRR 142: TRR 142'
- _id: '55'
name: 'TRR 142 - B: TRR 142 - Project Area B'
- _id: '56'
name: 'TRR 142 - C: TRR 142 - Project Area C'
related_material:
record:
- id: '48599'
relation: later_version
status: public
status: public
title: On-demand indistinguishable and entangled photons at telecom frequencies using
tailored cavity designs
type: preprint
user_id: '16199'
year: '2023'
...
---
_id: '34135'
abstract:
- lang: eng
text: By one of the most fundamental principles in physics, a dynamical system will
exhibit those motions which extremise an action functional. This leads to the
formation of the Euler-Lagrange equations, which serve as a model of how the system
will behave in time. If the dynamics exhibit additional symmetries, then the motion
fulfils additional conservation laws, such as conservation of energy (time invariance),
momentum (translation invariance), or angular momentum (rotational invariance).
To learn a system representation, one could learn the discrete Euler-Lagrange
equations, or alternatively, learn the discrete Lagrangian function Ld which defines
them. Based on ideas from Lie group theory, in this work we introduce a framework
to learn a discrete Lagrangian along with its symmetry group from discrete observations
of motions and, therefore, identify conserved quantities. The learning process
does not restrict the form of the Lagrangian, does not require velocity or momentum
observations or predictions and incorporates a cost term which safeguards against
unwanted solutions and against potential numerical issues in forward simulations.
The learnt discrete quantities are related to their continuous analogues using
variational backward error analysis and numerical results demonstrate the improvement
such models can have both qualitatively and quantitatively even in the presence
of noise.
author:
- first_name: Yana
full_name: Lishkova, Yana
last_name: Lishkova
- first_name: Paul
full_name: Scherer, Paul
last_name: Scherer
- first_name: Steffen
full_name: Ridderbusch, Steffen
last_name: Ridderbusch
- first_name: Mateja
full_name: Jamnik, Mateja
last_name: Jamnik
- first_name: Pietro
full_name: Liò, Pietro
last_name: Liò
- first_name: Sina
full_name: Ober-Blöbaum, Sina
id: '16494'
last_name: Ober-Blöbaum
- first_name: Christian
full_name: Offen, Christian
id: '85279'
last_name: Offen
orcid: 0000-0002-5940-8057
citation:
ama: 'Lishkova Y, Scherer P, Ridderbusch S, et al. Discrete Lagrangian Neural Networks
with Automatic Symmetry Discovery. In: IFAC-PapersOnLine. Vol 56. Elsevier;
2023:3203-3210. doi:10.1016/j.ifacol.2023.10.1457'
apa: Lishkova, Y., Scherer, P., Ridderbusch, S., Jamnik, M., Liò, P., Ober-Blöbaum,
S., & Offen, C. (2023). Discrete Lagrangian Neural Networks with Automatic
Symmetry Discovery. IFAC-PapersOnLine, 56(2), 3203–3210. https://doi.org/10.1016/j.ifacol.2023.10.1457
bibtex: '@inproceedings{Lishkova_Scherer_Ridderbusch_Jamnik_Liò_Ober-Blöbaum_Offen_2023,
title={Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery},
volume={56}, DOI={10.1016/j.ifacol.2023.10.1457},
number={2}, booktitle={IFAC-PapersOnLine}, publisher={Elsevier}, author={Lishkova,
Yana and Scherer, Paul and Ridderbusch, Steffen and Jamnik, Mateja and Liò, Pietro
and Ober-Blöbaum, Sina and Offen, Christian}, year={2023}, pages={3203–3210} }'
chicago: Lishkova, Yana, Paul Scherer, Steffen Ridderbusch, Mateja Jamnik, Pietro
Liò, Sina Ober-Blöbaum, and Christian Offen. “Discrete Lagrangian Neural Networks
with Automatic Symmetry Discovery.” In IFAC-PapersOnLine, 56:3203–10. Elsevier,
2023. https://doi.org/10.1016/j.ifacol.2023.10.1457.
ieee: 'Y. Lishkova et al., “Discrete Lagrangian Neural Networks with Automatic
Symmetry Discovery,” in IFAC-PapersOnLine, Yokohama, Japan, 2023, vol.
56, no. 2, pp. 3203–3210, doi: 10.1016/j.ifacol.2023.10.1457.'
mla: Lishkova, Yana, et al. “Discrete Lagrangian Neural Networks with Automatic
Symmetry Discovery.” IFAC-PapersOnLine, vol. 56, no. 2, Elsevier, 2023,
pp. 3203–10, doi:10.1016/j.ifacol.2023.10.1457.
short: 'Y. Lishkova, P. Scherer, S. Ridderbusch, M. Jamnik, P. Liò, S. Ober-Blöbaum,
C. Offen, in: IFAC-PapersOnLine, Elsevier, 2023, pp. 3203–3210.'
conference:
end_date: 2023-07-14
location: ' Yokohama, Japan'
name: The 22nd World Congress of the International Federation of Automatic Control
start_date: 2023-07-09
date_created: 2022-11-23T08:17:10Z
date_updated: 2023-12-29T14:26:00Z
ddc:
- '510'
department:
- _id: '636'
doi: 10.1016/j.ifacol.2023.10.1457
external_id:
arxiv:
- '2211.10830'
file:
- access_level: open_access
content_type: application/pdf
creator: coffen
date_created: 2023-04-17T08:05:55Z
date_updated: 2023-04-17T08:05:55Z
description: |-
By one of the most fundamental principles in physics, a dynamical system will
exhibit those motions which extremise an action functional. This leads to the formation of
the Euler-Lagrange equations, which serve as a model of how the system will behave in time.
If the dynamics exhibit additional symmetries, then the motion fulfils additional conservation
laws, such as conservation of energy (time invariance), momentum (translation invariance), or
angular momentum (rotational invariance). To learn a system representation, one could learn
the discrete Euler-Lagrange equations, or alternatively, learn the discrete Lagrangian function
Ld which defines them. Based on ideas from Lie group theory, we introduce a framework to learn
a discrete Lagrangian along with its symmetry group from discrete observations of motions and,
therefore, identify conserved quantities. The learning process does not restrict the form of the
Lagrangian, does not require velocity or momentum observations or predictions and incorporates
a cost term which safeguards against unwanted solutions and against potential numerical issues
in forward simulations. The learnt discrete quantities are related to their continuous analogues
using variational backward error analysis and numerical results demonstrate the improvement
such models can have both qualitatively and quantitatively even in the presence of noise.
file_id: '44037'
file_name: LNN_project.pdf
file_size: 576115
relation: main_file
title: Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery
file_date_updated: 2023-04-17T08:05:55Z
has_accepted_license: '1'
intvolume: ' 56'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/S2405896323018657
oa: '1'
page: 3203-3210
publication: IFAC-PapersOnLine
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: GitHub
relation: software
url: https://github.com/yanalish/SymDLNN
status: public
title: Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery
type: conference
user_id: '85279'
volume: 56
year: '2023'
...
---
_id: '46738'
author:
- first_name: Somayeh
full_name: Sadeghi-Kohan, Somayeh
id: '78614'
last_name: Sadeghi-Kohan
orcid: https://orcid.org/0000-0001-7246-0610
- first_name: Jan Dennis
full_name: Reimer, Jan Dennis
id: '36703'
last_name: Reimer
- first_name: Sybille
full_name: Hellebrand, Sybille
id: '209'
last_name: Hellebrand
orcid: 0000-0002-3717-3939
- first_name: Hans-Joachim
full_name: Wunderlich, Hans-Joachim
last_name: Wunderlich
citation:
ama: 'Sadeghi-Kohan S, Reimer JD, Hellebrand S, Wunderlich H-J. Optimizing the Streaming
of Sensor Data with Approximate Communication. In: IEEE Asian Test Symposium
(ATS’23), October 2023. ; 2023.'
apa: Sadeghi-Kohan, S., Reimer, J. D., Hellebrand, S., & Wunderlich, H.-J. (2023).
Optimizing the Streaming of Sensor Data with Approximate Communication. IEEE
Asian Test Symposium (ATS’23), October 2023. IEEE Asian Test Symposium (ATS’23).
bibtex: '@inproceedings{Sadeghi-Kohan_Reimer_Hellebrand_Wunderlich_2023, place={Beijing,
China}, title={Optimizing the Streaming of Sensor Data with Approximate Communication},
booktitle={IEEE Asian Test Symposium (ATS’23), October 2023}, author={Sadeghi-Kohan,
Somayeh and Reimer, Jan Dennis and Hellebrand, Sybille and Wunderlich, Hans-Joachim},
year={2023} }'
chicago: Sadeghi-Kohan, Somayeh, Jan Dennis Reimer, Sybille Hellebrand, and Hans-Joachim
Wunderlich. “Optimizing the Streaming of Sensor Data with Approximate Communication.”
In IEEE Asian Test Symposium (ATS’23), October 2023. Beijing, China, 2023.
ieee: S. Sadeghi-Kohan, J. D. Reimer, S. Hellebrand, and H.-J. Wunderlich, “Optimizing
the Streaming of Sensor Data with Approximate Communication,” presented at the
IEEE Asian Test Symposium (ATS’23), 2023.
mla: Sadeghi-Kohan, Somayeh, et al. “Optimizing the Streaming of Sensor Data with
Approximate Communication.” IEEE Asian Test Symposium (ATS’23), October 2023,
2023.
short: 'S. Sadeghi-Kohan, J.D. Reimer, S. Hellebrand, H.-J. Wunderlich, in: IEEE
Asian Test Symposium (ATS’23), October 2023, Beijing, China, 2023.'
conference:
end_date: 2023-10-17
name: IEEE Asian Test Symposium (ATS'23)
start_date: 2023-10-14
date_created: 2023-08-26T08:47:52Z
date_updated: 2024-01-08T08:49:08Z
department:
- _id: '48'
language:
- iso: eng
place: Beijing, China
publication: IEEE Asian Test Symposium (ATS'23), October 2023
status: public
title: Optimizing the Streaming of Sensor Data with Approximate Communication
type: conference
user_id: '36703'
year: '2023'
...
---
_id: '50298'
abstract:
- lang: eng
text: A finite classical polar space of rank $n$ consists of the totally isotropic
subspaces of a finite vector space equipped with a nondegenerate form such that
$n$ is the maximal dimension of such a subspace. A $t$-Steiner system in a finite
classical polar space of rank $n$ is a collection $Y$ of totally isotropic $n$-spaces
such that each totally isotropic $t$-space is contained in exactly one member
of $Y$. Nontrivial examples are known only for $t=1$ and $t=n-1$. We give an almost
complete classification of such $t$-Steiner systems, showing that such objects
can only exist in some corner cases. This classification result arises from a
more general result on packings in polar spaces.
author:
- first_name: Kai-Uwe
full_name: Schmidt, Kai-Uwe
last_name: Schmidt
- first_name: Charlene
full_name: Weiß, Charlene
id: '70420'
last_name: Weiß
citation:
ama: Schmidt K-U, Weiß C. Packings and Steiner systems in polar spaces. Combinatorial
Theory. 2023;3(1). doi:10.5070/c63160424
apa: Schmidt, K.-U., & Weiß, C. (2023). Packings and Steiner systems in polar
spaces. Combinatorial Theory, 3(1). https://doi.org/10.5070/c63160424
bibtex: '@article{Schmidt_Weiß_2023, title={Packings and Steiner systems in polar
spaces}, volume={3}, DOI={10.5070/c63160424},
number={1}, journal={Combinatorial Theory}, author={Schmidt, Kai-Uwe and Weiß,
Charlene}, year={2023} }'
chicago: Schmidt, Kai-Uwe, and Charlene Weiß. “Packings and Steiner Systems in Polar
Spaces.” Combinatorial Theory 3, no. 1 (2023). https://doi.org/10.5070/c63160424.
ieee: 'K.-U. Schmidt and C. Weiß, “Packings and Steiner systems in polar spaces,”
Combinatorial Theory, vol. 3, no. 1, 2023, doi: 10.5070/c63160424.'
mla: Schmidt, Kai-Uwe, and Charlene Weiß. “Packings and Steiner Systems in Polar
Spaces.” Combinatorial Theory, vol. 3, no. 1, 2023, doi:10.5070/c63160424.
short: K.-U. Schmidt, C. Weiß, Combinatorial Theory 3 (2023).
date_created: 2024-01-08T14:33:54Z
date_updated: 2024-01-08T14:39:20Z
department:
- _id: '100'
doi: 10.5070/c63160424
intvolume: ' 3'
issue: '1'
language:
- iso: eng
publication: Combinatorial Theory
publication_status: published
status: public
title: Packings and Steiner systems in polar spaces
type: journal_article
user_id: '70420'
volume: 3
year: '2023'
...
---
_id: '50297'
abstract:
- lang: eng
text: We show that there exist ordered orthogonal arrays, whose sizes deviate from
the Rao bound by a factor that is polynomial in the parameters of the ordered
orthogonal array. The proof is nonconstructive and based on a probabilistic method
due to Kuperberg, Lovett and Peled.
author:
- first_name: Kai‐Uwe
full_name: Schmidt, Kai‐Uwe
last_name: Schmidt
- first_name: Charlene
full_name: Weiß, Charlene
id: '70420'
last_name: Weiß
citation:
ama: Schmidt K, Weiß C. Existence of small ordered orthogonal arrays. Journal
of Combinatorial Designs. 2023;31(9):422-431. doi:10.1002/jcd.21903
apa: Schmidt, K., & Weiß, C. (2023). Existence of small ordered orthogonal arrays.
Journal of Combinatorial Designs, 31(9), 422–431. https://doi.org/10.1002/jcd.21903
bibtex: '@article{Schmidt_Weiß_2023, title={Existence of small ordered orthogonal
arrays}, volume={31}, DOI={10.1002/jcd.21903},
number={9}, journal={Journal of Combinatorial Designs}, publisher={Wiley}, author={Schmidt,
Kai‐Uwe and Weiß, Charlene}, year={2023}, pages={422–431} }'
chicago: 'Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal
Arrays.” Journal of Combinatorial Designs 31, no. 9 (2023): 422–31. https://doi.org/10.1002/jcd.21903.'
ieee: 'K. Schmidt and C. Weiß, “Existence of small ordered orthogonal arrays,” Journal
of Combinatorial Designs, vol. 31, no. 9, pp. 422–431, 2023, doi: 10.1002/jcd.21903.'
mla: Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal
Arrays.” Journal of Combinatorial Designs, vol. 31, no. 9, Wiley, 2023,
pp. 422–31, doi:10.1002/jcd.21903.
short: K. Schmidt, C. Weiß, Journal of Combinatorial Designs 31 (2023) 422–431.
date_created: 2024-01-08T14:25:28Z
date_updated: 2024-01-08T14:38:53Z
department:
- _id: '100'
doi: 10.1002/jcd.21903
intvolume: ' 31'
issue: '9'
language:
- iso: eng
page: 422-431
publication: Journal of Combinatorial Designs
publication_status: published
publisher: Wiley
status: public
title: Existence of small ordered orthogonal arrays
type: journal_article
user_id: '70420'
volume: 31
year: '2023'
...
---
_id: '50300'
abstract:
- lang: eng
text: Digital communications relies heavily on the usage of different types of codes.
Prominent codes nowadays are rank-metric codes and subspace codes - the q-analogs
of binary codes and binary codes with constant weight. All these codes can be
viewed as subsets of classical association schemes. A central coding-theoretic
problem is to derive upper bounds for the size of codes. This thesis investigates
Delsartes powerful linear program whose optimum is precisely such a bound for
codes in association schemes. The linear programs for binary codes and binary
constant-weight codes have been extensively studied since the 1970s, but their
optimum is still unknown. We determine in a unified way the optimum of the linear
program in several ordinary q-analogs as well as in their affine counterparts.
In particular, bounds and constructions for codes in polar spaces are established,
where the bounds are sharp up to a constant factor in many cases. Moreover, based
on these results, an almost complete classification of Steiner systems in polar
spaces is provided by showing that they could only exist in some corner cases.
author:
- first_name: Charlene
full_name: Weiß, Charlene
id: '70420'
last_name: Weiß
citation:
ama: Weiß C. Linear Programming Bounds in Classical Association Schemes.;
2023. doi:10.17619/UNIPB/1-1672
apa: Weiß, C. (2023). Linear programming bounds in classical association schemes.
https://doi.org/10.17619/UNIPB/1-1672
bibtex: '@book{Weiß_2023, title={Linear programming bounds in classical association
schemes}, DOI={10.17619/UNIPB/1-1672},
author={Weiß, Charlene}, year={2023} }'
chicago: Weiß, Charlene. Linear Programming Bounds in Classical Association Schemes,
2023. https://doi.org/10.17619/UNIPB/1-1672.
ieee: C. Weiß, Linear programming bounds in classical association schemes.
2023.
mla: Weiß, Charlene. Linear Programming Bounds in Classical Association Schemes.
2023, doi:10.17619/UNIPB/1-1672.
short: C. Weiß, Linear Programming Bounds in Classical Association Schemes, 2023.
date_created: 2024-01-08T14:42:12Z
date_updated: 2024-01-08T14:46:14Z
department:
- _id: '100'
doi: 10.17619/UNIPB/1-1672
language:
- iso: eng
status: public
title: Linear programming bounds in classical association schemes
type: dissertation
user_id: '70420'
year: '2023'
...
---
_id: '48335'
author:
- first_name: Lukas
full_name: Knorr, Lukas
id: '90391'
last_name: Knorr
- first_name: André
full_name: Jungeilges, André
id: '45189'
last_name: Jungeilges
- first_name: Florian
full_name: Pfeifer, Florian
id: '22717'
last_name: Pfeifer
- first_name: Sascha Christian
full_name: Burmeister, Sascha Christian
id: '32685'
last_name: Burmeister
orcid: 0000-0001-6679-0453
- first_name: Henning
full_name: Meschede, Henning
id: '86954'
last_name: Meschede
orcid: 0000-0002-1538-089X
citation:
ama: Knorr L, Jungeilges A, Pfeifer F, Burmeister SC, Meschede H. Regenerative
Energien für einen effizienten Betrieb von Presshärtelinien. 4. Aachener Ofenbau-
und Thermoprozess-Kolloquium; 2023.
apa: Knorr, L., Jungeilges, A., Pfeifer, F., Burmeister, S. C., & Meschede,
H. (2023). Regenerative Energien für einen effizienten Betrieb von Presshärtelinien.
4. Aachener Ofenbau- und Thermoprozess-Kolloquium.
bibtex: '@book{Knorr_Jungeilges_Pfeifer_Burmeister_Meschede_2023, place={Aachen},
title={Regenerative Energien für einen effizienten Betrieb von Presshärtelinien},
publisher={4. Aachener Ofenbau- und Thermoprozess-Kolloquium}, author={Knorr,
Lukas and Jungeilges, André and Pfeifer, Florian and Burmeister, Sascha Christian
and Meschede, Henning}, year={2023} }'
chicago: 'Knorr, Lukas, André Jungeilges, Florian Pfeifer, Sascha Christian Burmeister,
and Henning Meschede. Regenerative Energien für einen effizienten Betrieb von
Presshärtelinien. Aachen: 4. Aachener Ofenbau- und Thermoprozess-Kolloquium,
2023.'
ieee: 'L. Knorr, A. Jungeilges, F. Pfeifer, S. C. Burmeister, and H. Meschede, Regenerative
Energien für einen effizienten Betrieb von Presshärtelinien. Aachen: 4. Aachener
Ofenbau- und Thermoprozess-Kolloquium, 2023.'
mla: Knorr, Lukas, et al. Regenerative Energien für einen effizienten Betrieb
von Presshärtelinien. 4. Aachener Ofenbau- und Thermoprozess-Kolloquium, 2023.
short: L. Knorr, A. Jungeilges, F. Pfeifer, S.C. Burmeister, H. Meschede, Regenerative
Energien für einen effizienten Betrieb von Presshärtelinien, 4. Aachener Ofenbau-
und Thermoprozess-Kolloquium, Aachen, 2023.
date_created: 2023-10-19T10:34:14Z
date_updated: 2024-01-11T09:05:19Z
department:
- _id: '644'
- _id: '149'
- _id: '277'
- _id: '321'
language:
- iso: ger
place: Aachen
publisher: 4. Aachener Ofenbau- und Thermoprozess-Kolloquium
status: public
title: Regenerative Energien für einen effizienten Betrieb von Presshärtelinien
type: misc
user_id: '45189'
year: '2023'
...
---
_id: '50458'
abstract:
- lang: eng
text: AbstractConsider a set of jobs connected
to a directed acyclic task graph with a fixed source and sink. The edges of this
graph model precedence constraints and the jobs have to be scheduled with respect
to those. We introduce the server cloud scheduling problem, in which the jobs
have to be processed either on a single local machine or on one of infinitely
many cloud machines. For each job, processing times both on the server and in
the cloud are given. Furthermore, for each edge in the task graph, a communication
delay is included in the input and has to be taken into account if one of the
two jobs is scheduled on the server and the other in the cloud. The server processes
jobs sequentially, whereas the cloud can serve as many as needed in parallel,
but induces costs. We consider both makespan and cost minimization. The main results
are an FPTAS for the makespan objective for graphs with a constant source and
sink dividing cut and strong hardness for the case with unit processing times
and delays.
author:
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
citation:
ama: Maack M, Meyer auf der Heide F, Pukrop S. Server Cloud Scheduling. Algorithmica.
Published online 2023. doi:10.1007/s00453-023-01189-x
apa: Maack, M., Meyer auf der Heide, F., & Pukrop, S. (2023). Server Cloud Scheduling.
Algorithmica. https://doi.org/10.1007/s00453-023-01189-x
bibtex: '@article{Maack_Meyer auf der Heide_Pukrop_2023, title={Server Cloud Scheduling},
DOI={10.1007/s00453-023-01189-x},
journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Maack,
Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}, year={2023} }'
chicago: Maack, Marten, Friedhelm Meyer auf der Heide, and Simon Pukrop. “Server
Cloud Scheduling.” Algorithmica, 2023. https://doi.org/10.1007/s00453-023-01189-x.
ieee: 'M. Maack, F. Meyer auf der Heide, and S. Pukrop, “Server Cloud Scheduling,”
Algorithmica, 2023, doi: 10.1007/s00453-023-01189-x.'
mla: Maack, Marten, et al. “Server Cloud Scheduling.” Algorithmica, Springer
Science and Business Media LLC, 2023, doi:10.1007/s00453-023-01189-x.
short: M. Maack, F. Meyer auf der Heide, S. Pukrop, Algorithmica (2023).
date_created: 2024-01-11T11:10:53Z
date_updated: 2024-01-11T11:19:33Z
department:
- _id: '63'
doi: 10.1007/s00453-023-01189-x
extern: '1'
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Server Cloud Scheduling
type: journal_article
user_id: '44428'
year: '2023'
...
---
_id: '50460'
author:
- first_name: Max A.
full_name: Deppert, Max A.
last_name: Deppert
- first_name: Klaus
full_name: Jansen, Klaus
last_name: Jansen
- first_name: Marten
full_name: Maack, Marten
id: '88252'
last_name: Maack
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
- first_name: Malin
full_name: Rau, Malin
last_name: Rau
citation:
ama: 'Deppert MA, Jansen K, Maack M, Pukrop S, Rau M. Scheduling with Many Shared
Resources. In: 2023 IEEE International Parallel and Distributed Processing
Symposium (IPDPS). IEEE; 2023. doi:10.1109/ipdps54959.2023.00049'
apa: Deppert, M. A., Jansen, K., Maack, M., Pukrop, S., & Rau, M. (2023). Scheduling
with Many Shared Resources. 2023 IEEE International Parallel and Distributed
Processing Symposium (IPDPS). https://doi.org/10.1109/ipdps54959.2023.00049
bibtex: '@inproceedings{Deppert_Jansen_Maack_Pukrop_Rau_2023, title={Scheduling
with Many Shared Resources}, DOI={10.1109/ipdps54959.2023.00049},
booktitle={2023 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)}, publisher={IEEE}, author={Deppert, Max A. and Jansen, Klaus and Maack,
Marten and Pukrop, Simon and Rau, Malin}, year={2023} }'
chicago: Deppert, Max A., Klaus Jansen, Marten Maack, Simon Pukrop, and Malin Rau.
“Scheduling with Many Shared Resources.” In 2023 IEEE International Parallel
and Distributed Processing Symposium (IPDPS). IEEE, 2023. https://doi.org/10.1109/ipdps54959.2023.00049.
ieee: 'M. A. Deppert, K. Jansen, M. Maack, S. Pukrop, and M. Rau, “Scheduling with
Many Shared Resources,” 2023, doi: 10.1109/ipdps54959.2023.00049.'
mla: Deppert, Max A., et al. “Scheduling with Many Shared Resources.” 2023 IEEE
International Parallel and Distributed Processing Symposium (IPDPS), IEEE,
2023, doi:10.1109/ipdps54959.2023.00049.
short: 'M.A. Deppert, K. Jansen, M. Maack, S. Pukrop, M. Rau, in: 2023 IEEE International
Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2023.'
date_created: 2024-01-11T11:30:14Z
date_updated: 2024-01-11T11:31:11Z
department:
- _id: '63'
doi: 10.1109/ipdps54959.2023.00049
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
grant_number: '160364472'
name: 'SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter
Dienste in konfigurierbaren Rechenzentren (Subproject C4)'
publication: 2023 IEEE International Parallel and Distributed Processing Symposium
(IPDPS)
publication_status: published
publisher: IEEE
status: public
title: Scheduling with Many Shared Resources
type: conference
user_id: '44428'
year: '2023'
...
---
_id: '50479'
abstract:
- lang: eng
text: Verifying assertions is an essential part of creating and maintaining knowledge
graphs. Most often, this task cannot be carried out manually due to the sheer
size of modern knowledge graphs. Hence, automatic fact-checking approaches have
been proposed over the last decade. These approaches aim to compute automatically
whether a given assertion is correct or incorrect. However, most fact-checking
approaches are binary classifiers that fail to consider the volatility of some
assertions, i.e., the fact that such assertions are only valid at certain times
or for specific time intervals. Moreover, the few approaches able to predict when
an assertion was valid (i.e., time-point prediction approaches) rely on manual
feature engineering. This paper presents TEMPORALFC, a temporal fact-checking
approach that uses multiple sources of background knowledge to assess the veracity
and temporal validity of a given assertion. We evaluate TEMPORALFC on two datasets
and compare it to the state of the art in fact-checking and time-point prediction.
Our results suggest that TEMPORALFC outperforms the state of the art on the fact-checking
task by 0.13 to 0.15 in terms of Area Under the Receiver Operating Characteristic
curve and on the time-point prediction task by 0.25 to 0.27 in terms of Mean Reciprocal
Rank. Our code is open-source and can be found at https://github.com/dice-group/TemporalFC.
author:
- first_name: Umair
full_name: Qudus, Umair
last_name: Qudus
- first_name: Michael
full_name: Röder, Michael
last_name: Röder
- first_name: Sabrina
full_name: Kirrane, Sabrina
last_name: Kirrane
- first_name: Axel-Cyrille Ngonga
full_name: Ngomo, Axel-Cyrille Ngonga
last_name: Ngomo
citation:
ama: 'Qudus U, Röder M, Kirrane S, Ngomo A-CN. TemporalFC: A Temporal Fact Checking
Approach over Knowledge Graphs. In: R. Payne T, Presutti V, Qi G, et al., eds.
The Semantic Web – ISWC 2023. Vol 14265. Lecture Notes in Computer Science.
Springer, Cham; 2023:465–483. doi:10.1007/978-3-031-47240-4_25'
apa: 'Qudus, U., Röder, M., Kirrane, S., & Ngomo, A.-C. N. (2023). TemporalFC:
A Temporal Fact Checking Approach over Knowledge Graphs. In T. R. Payne, V. Presutti,
G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, &
J. Li (Eds.), The Semantic Web – ISWC 2023 (Vol. 14265, pp. 465–483). Springer,
Cham. https://doi.org/10.1007/978-3-031-47240-4_25'
bibtex: '@inproceedings{Qudus_Röder_Kirrane_Ngomo_2023, place={Cham}, series={ Lecture
Notes in Computer Science}, title={TemporalFC: A Temporal Fact Checking Approach
over Knowledge Graphs}, volume={14265}, DOI={10.1007/978-3-031-47240-4_25},
booktitle={The Semantic Web – ISWC 2023}, publisher={Springer, Cham}, author={Qudus,
Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga},
editor={R. Payne, Terry and Presutti, Valentina and Qi, Guilin and Poveda-Villalón,
María and Stoilos, Giorgos and Hollink, Laura and Kaoudi, Zoi and Cheng, Gong
and Li, Juanzi}, year={2023}, pages={465–483}, collection={ Lecture Notes in Computer
Science} }'
chicago: 'Qudus, Umair, Michael Röder, Sabrina Kirrane, and Axel-Cyrille Ngonga
Ngomo. “TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs.”
In The Semantic Web – ISWC 2023, edited by Terry R. Payne, Valentina Presutti,
Guilin Qi, María Poveda-Villalón, Giorgos Stoilos, Laura Hollink, Zoi Kaoudi,
Gong Cheng, and Juanzi Li, 14265:465–483. Lecture Notes in Computer Science.
Cham: Springer, Cham, 2023. https://doi.org/10.1007/978-3-031-47240-4_25.'
ieee: 'U. Qudus, M. Röder, S. Kirrane, and A.-C. N. Ngomo, “TemporalFC: A Temporal
Fact Checking Approach over Knowledge Graphs,” in The Semantic Web – ISWC 2023,
Athens, Greece, 2023, vol. 14265, pp. 465–483, doi: 10.1007/978-3-031-47240-4_25.'
mla: 'Qudus, Umair, et al. “TemporalFC: A Temporal Fact Checking Approach over Knowledge
Graphs.” The Semantic Web – ISWC 2023, edited by Terry R. Payne et al.,
vol. 14265, Springer, Cham, 2023, pp. 465–483, doi:10.1007/978-3-031-47240-4_25.'
short: 'U. Qudus, M. Röder, S. Kirrane, A.-C.N. Ngomo, in: T. R. Payne, V. Presutti,
G. Qi, M. Poveda-Villalón, G. Stoilos, L. Hollink, Z. Kaoudi, G. Cheng, J. Li
(Eds.), The Semantic Web – ISWC 2023, Springer, Cham, Cham, 2023, pp. 465–483.'
conference:
end_date: 2023-11-10
location: Athens, Greece
name: The Semantic Web – ISWC 2023
start_date: 2023-11-06
date_created: 2024-01-13T11:22:15Z
date_updated: 2024-01-13T11:48:28Z
ddc:
- '006'
department:
- _id: '34'
doi: 10.1007/978-3-031-47240-4_25
editor:
- first_name: Terry
full_name: R. Payne, Terry
last_name: R. Payne
- first_name: Valentina
full_name: Presutti, Valentina
last_name: Presutti
- first_name: Guilin
full_name: Qi, Guilin
last_name: Qi
- first_name: María
full_name: Poveda-Villalón, María
last_name: Poveda-Villalón
- first_name: Giorgos
full_name: Stoilos, Giorgos
last_name: Stoilos
- first_name: Laura
full_name: Hollink, Laura
last_name: Hollink
- first_name: Zoi
full_name: Kaoudi, Zoi
last_name: Kaoudi
- first_name: Gong
full_name: Cheng, Gong
last_name: Cheng
- first_name: Juanzi
full_name: Li, Juanzi
last_name: Li
file:
- access_level: closed
content_type: application/pdf
creator: uqudus
date_created: 2024-01-13T11:25:48Z
date_updated: 2024-01-13T11:25:48Z
file_id: '50480'
file_name: ISWC 2023 TemporalFC-A Temporal Fact Checking approach over Knowledge
Graphs.pdf
file_size: 1944818
relation: main_file
success: 1
file_date_updated: 2024-01-13T11:25:48Z
has_accepted_license: '1'
intvolume: ' 14265'
jel:
- C
keyword:
- temporal fact checking · ensemble learning · transfer learning · time-point prediction
· temporal knowledge graphs
language:
- iso: eng
page: 465–483
place: Cham
project:
- _id: '410'
grant_number: '860801'
name: 'KnowGraphs: KnowGraphs: Knowledge Graphs at Scale'
publication: The Semantic Web – ISWC 2023
publication_identifier:
isbn:
- '9783031472398'
- '9783031472404'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer, Cham
series_title: ' Lecture Notes in Computer Science'
status: public
title: 'TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs'
type: conference
user_id: '83392'
volume: 14265
year: '2023'
...
---
_id: '43439'
abstract:
- lang: eng
text: "This preprint makes the claim of having computed the $9^{th}$ Dedekind\r\nNumber.
This was done by building an efficient FPGA Accelerator for the core\r\noperation
of the process, and parallelizing it on the Noctua 2 Supercluster at\r\nPaderborn
University. The resulting value is\r\n286386577668298411128469151667598498812366.
This value can be verified in two\r\nsteps. We have made the data file containing
the 490M results available, each\r\nof which can be verified separately on CPU,
and the whole file sums to our\r\nproposed value."
author:
- first_name: Lennart
full_name: Van Hirtum, Lennart
last_name: Van Hirtum
- first_name: Patrick
full_name: De Causmaecker, Patrick
last_name: De Causmaecker
- first_name: Jens
full_name: Goemaere, Jens
last_name: Goemaere
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Van Hirtum L, De Causmaecker P, Goemaere J, et al. A computation of D(9) using
FPGA Supercomputing. arXiv:230403039. Published online 2023.
apa: Van Hirtum, L., De Causmaecker, P., Goemaere, J., Kenter, T., Riebler, H.,
Lass, M., & Plessl, C. (2023). A computation of D(9) using FPGA Supercomputing.
In arXiv:2304.03039.
bibtex: '@article{Van Hirtum_De Causmaecker_Goemaere_Kenter_Riebler_Lass_Plessl_2023,
title={A computation of D(9) using FPGA Supercomputing}, journal={arXiv:2304.03039},
author={Van Hirtum, Lennart and De Causmaecker, Patrick and Goemaere, Jens and
Kenter, Tobias and Riebler, Heinrich and Lass, Michael and Plessl, Christian},
year={2023} }'
chicago: Van Hirtum, Lennart, Patrick De Causmaecker, Jens Goemaere, Tobias Kenter,
Heinrich Riebler, Michael Lass, and Christian Plessl. “A Computation of D(9) Using
FPGA Supercomputing.” ArXiv:2304.03039, 2023.
ieee: L. Van Hirtum et al., “A computation of D(9) using FPGA Supercomputing,”
arXiv:2304.03039. 2023.
mla: Van Hirtum, Lennart, et al. “A Computation of D(9) Using FPGA Supercomputing.”
ArXiv:2304.03039, 2023.
short: L. Van Hirtum, P. De Causmaecker, J. Goemaere, T. Kenter, H. Riebler, M.
Lass, C. Plessl, ArXiv:2304.03039 (2023).
date_created: 2023-04-08T11:05:29Z
date_updated: 2024-01-22T09:56:42Z
department:
- _id: '27'
- _id: '518'
external_id:
arxiv:
- '2304.03039'
language:
- iso: eng
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: arXiv:2304.03039
status: public
title: A computation of D(9) using FPGA Supercomputing
type: preprint
user_id: '3145'
year: '2023'
...
---
_id: '51131'
author:
- first_name: Lara Marie
full_name: Graf, Lara Marie
id: '89837'
last_name: Graf
- first_name: Uta
full_name: Häsel-Weide, Uta
id: '60267'
last_name: Häsel-Weide
- first_name: K.
full_name: Höveler, K.
last_name: Höveler
- first_name: M.
full_name: Nührenbörger, M.
last_name: Nührenbörger
citation:
ama: 'Graf LM, Häsel-Weide U, Höveler K, Nührenbörger M. Insights into out-of-field
teachers’ self-reports: Fostering the understanding of addition and subtraction
as a basis for children to overcome difficulties in mathematics. In: Drijvers
P, Csapodi C, Palmér H, Gosztonyi K, Kónya E, Alfréd Rényi Institute of Mathematics
and ERME, eds. Proceedings of the Thirteenth Congress of the European Society
for Research in Mathematics Education (CERME13). ; 2023:3203-3210.'
apa: 'Graf, L. M., Häsel-Weide, U., Höveler, K., & Nührenbörger, M. (2023).
Insights into out-of-field teachers’ self-reports: Fostering the understanding
of addition and subtraction as a basis for children to overcome difficulties in
mathematics. In P. Drijvers, C. Csapodi, H. Palmér, K. Gosztonyi, E. Kónya, &
Alfréd Rényi Institute of Mathematics and ERME (Eds.), Proceedings of the Thirteenth
Congress of the European Society for Research in Mathematics Education (CERME13)
(pp. 3203–3210).'
bibtex: '@inproceedings{Graf_Häsel-Weide_Höveler_Nührenbörger_2023, title={Insights
into out-of-field teachers’ self-reports: Fostering the understanding of addition
and subtraction as a basis for children to overcome difficulties in mathematics},
booktitle={Proceedings of the Thirteenth Congress of the European Society for
Research in Mathematics Education (CERME13)}, author={Graf, Lara Marie and Häsel-Weide,
Uta and Höveler, K. and Nührenbörger, M.}, editor={Drijvers, P. and Csapodi, C.
and Palmér, H. and Gosztonyi, K. and Kónya, E. and Alfréd Rényi Institute of Mathematics
and ERME}, year={2023}, pages={3203–3210} }'
chicago: 'Graf, Lara Marie, Uta Häsel-Weide, K. Höveler, and M. Nührenbörger. “Insights
into Out-of-Field Teachers’ Self-Reports: Fostering the Understanding of Addition
and Subtraction as a Basis for Children to Overcome Difficulties in Mathematics.”
In Proceedings of the Thirteenth Congress of the European Society for Research
in Mathematics Education (CERME13), edited by P. Drijvers, C. Csapodi, H.
Palmér, K. Gosztonyi, E. Kónya, and Alfréd Rényi Institute of Mathematics and
ERME, 3203–10, 2023.'
ieee: 'L. M. Graf, U. Häsel-Weide, K. Höveler, and M. Nührenbörger, “Insights into
out-of-field teachers’ self-reports: Fostering the understanding of addition and
subtraction as a basis for children to overcome difficulties in mathematics,”
in Proceedings of the Thirteenth Congress of the European Society for Research
in Mathematics Education (CERME13), 2023, pp. 3203–3210.'
mla: 'Graf, Lara Marie, et al. “Insights into Out-of-Field Teachers’ Self-Reports:
Fostering the Understanding of Addition and Subtraction as a Basis for Children
to Overcome Difficulties in Mathematics.” Proceedings of the Thirteenth Congress
of the European Society for Research in Mathematics Education (CERME13), edited
by P. Drijvers et al., 2023, pp. 3203–10.'
short: 'L.M. Graf, U. Häsel-Weide, K. Höveler, M. Nührenbörger, in: P. Drijvers,
C. Csapodi, H. Palmér, K. Gosztonyi, E. Kónya, Alfréd Rényi Institute of Mathematics
and ERME (Eds.), Proceedings of the Thirteenth Congress of the European Society
for Research in Mathematics Education (CERME13), 2023, pp. 3203–3210.'
corporate_editor:
- Alfréd Rényi Institute of Mathematics and ERME
date_created: 2024-02-05T08:47:35Z
date_updated: 2024-02-05T08:55:43Z
department:
- _id: '543'
editor:
- first_name: P.
full_name: Drijvers, P.
last_name: Drijvers
- first_name: C.
full_name: Csapodi, C.
last_name: Csapodi
- first_name: H.
full_name: Palmér, H.
last_name: Palmér
- first_name: K.
full_name: Gosztonyi, K.
last_name: Gosztonyi
- first_name: E.
full_name: Kónya, E.
last_name: Kónya
language:
- iso: eng
page: 3203-3210
publication: Proceedings of the Thirteenth Congress of the European Society for Research
in Mathematics Education (CERME13)
status: public
title: 'Insights into out-of-field teachers’ self-reports: Fostering the understanding
of addition and subtraction as a basis for children to overcome difficulties in
mathematics'
type: conference
user_id: '14931'
year: '2023'
...
---
_id: '51159'
abstract:
- lang: eng
text: Sparsity is a highly desired feature in deep neural networks (DNNs) since
it ensures numerical efficiency, improves the interpretability of models (due
to the smaller number of relevant features), and robustness. In machine learning
approaches based on linear models, it is well known that there exists a connecting
path between the sparsest solution in terms of the $\ell^1$ norm,i.e., zero weights
and the non-regularized solution, which is called the regularization path. Very
recently, there was a first attempt to extend the concept of regularization paths
to DNNs by means of treating the empirical loss and sparsity ($\ell^1$ norm) as
two conflicting criteria and solving the resulting multiobjective optimization
problem. However, due to the non-smoothness of the $\ell^1$ norm and the high
number of parameters, this approach is not very efficient from a computational
perspective. To overcome this limitation, we present an algorithm that allows
for the approximation of the entire Pareto front for the above-mentioned objectives
in a very efficient manner. We present numerical examples using both deterministic
and stochastic gradients. We furthermore demonstrate that knowledge of the regularization
path allows for a well-generalizing network parametrization.
author:
- first_name: Augustina Chidinma
full_name: Amakor, Augustina Chidinma
id: '97916'
last_name: Amakor
- first_name: Konstantin
full_name: Sonntag, Konstantin
id: '56399'
last_name: Sonntag
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
citation:
ama: Amakor AC, Sonntag K, Peitz S. A multiobjective continuation method to compute
the regularization path of deep neural networks. arXiv. Published online
2023.
apa: Amakor, A. C., Sonntag, K., & Peitz, S. (2023). A multiobjective continuation
method to compute the regularization path of deep neural networks. In arXiv.
bibtex: '@article{Amakor_Sonntag_Peitz_2023, title={A multiobjective continuation
method to compute the regularization path of deep neural networks}, journal={arXiv},
author={Amakor, Augustina Chidinma and Sonntag, Konstantin and Peitz, Sebastian},
year={2023} }'
chicago: Amakor, Augustina Chidinma, Konstantin Sonntag, and Sebastian Peitz. “A
Multiobjective Continuation Method to Compute the Regularization Path of Deep
Neural Networks.” ArXiv, 2023.
ieee: A. C. Amakor, K. Sonntag, and S. Peitz, “A multiobjective continuation method
to compute the regularization path of deep neural networks,” arXiv. 2023.
mla: Amakor, Augustina Chidinma, et al. “A Multiobjective Continuation Method to
Compute the Regularization Path of Deep Neural Networks.” ArXiv, 2023.
short: A.C. Amakor, K. Sonntag, S. Peitz, ArXiv (2023).
date_created: 2024-02-06T08:51:00Z
date_updated: 2024-02-06T08:52:07Z
department:
- _id: '655'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2308.12044.pdf
oa: '1'
publication: arXiv
status: public
title: A multiobjective continuation method to compute the regularization path of
deep neural networks
type: preprint
user_id: '47427'
year: '2023'
...
---
_id: '51158'
abstract:
- lang: eng
text: "Extended Dynamic Mode Decomposition (EDMD) is a popular data-driven method
to\r\napproximate the Koopman operator for deterministic and stochastic (control)\r\nsystems.
This operator is linear and encompasses full information on the\r\n(expected stochastic)
dynamics. In this paper, we analyze a kernel-based EDMD\r\nalgorithm, known as
kEDMD, where the dictionary consists of the canonical\r\nkernel features at the
data points. The latter are acquired by i.i.d. samples\r\nfrom a user-defined
and application-driven distribution on a compact set. We\r\nprove bounds on the
prediction error of the kEDMD estimator when sampling from\r\nthis (not necessarily
ergodic) distribution. The error analysis is further\r\nextended to control-affine
systems, where the considered invariance of the\r\nReproducing Kernel Hilbert
Space is significantly less restrictive in\r\ncomparison to invariance assumptions
on an a-priori chosen dictionary."
author:
- first_name: Friedrich
full_name: Philipp, Friedrich
last_name: Philipp
- first_name: Manuel
full_name: Schaller, Manuel
last_name: Schaller
- first_name: Karl
full_name: Worthmann, Karl
last_name: Worthmann
- 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
citation:
ama: Philipp F, Schaller M, Worthmann K, Peitz S, Nüske F. Error analysis of kernel
EDMD for prediction and control in the Koopman framework. arXiv:231210460.
Published online 2023.
apa: Philipp, F., Schaller, M., Worthmann, K., Peitz, S., & Nüske, F. (2023).
Error analysis of kernel EDMD for prediction and control in the Koopman framework.
In arXiv:2312.10460.
bibtex: '@article{Philipp_Schaller_Worthmann_Peitz_Nüske_2023, title={Error analysis
of kernel EDMD for prediction and control in the Koopman framework}, journal={arXiv:2312.10460},
author={Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl and Peitz,
Sebastian and Nüske, Feliks}, year={2023} }'
chicago: Philipp, Friedrich, Manuel Schaller, Karl Worthmann, Sebastian Peitz, and
Feliks Nüske. “Error Analysis of Kernel EDMD for Prediction and Control in the
Koopman Framework.” ArXiv:2312.10460, 2023.
ieee: F. Philipp, M. Schaller, K. Worthmann, S. Peitz, and F. Nüske, “Error analysis
of kernel EDMD for prediction and control in the Koopman framework,” arXiv:2312.10460.
2023.
mla: Philipp, Friedrich, et al. “Error Analysis of Kernel EDMD for Prediction and
Control in the Koopman Framework.” ArXiv:2312.10460, 2023.
short: F. Philipp, M. Schaller, K. Worthmann, S. Peitz, F. Nüske, ArXiv:2312.10460
(2023).
date_created: 2024-02-06T08:49:50Z
date_updated: 2024-02-06T08:50:32Z
department:
- _id: '655'
external_id:
arxiv:
- '2312.10460'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2312.10460.pdf
oa: '1'
publication: arXiv:2312.10460
status: public
title: Error analysis of kernel EDMD for prediction and control in the Koopman framework
type: preprint
user_id: '47427'
year: '2023'
...
---
_id: '31189'
abstract:
- lang: eng
text: "Given a geometrically finite hyperbolic surface of infinite volume it is
a\r\nclassical result of Patterson that the positive Laplace-Beltrami operator
has\r\nno $L^2$-eigenvalues $\\geq 1/4$. In this article we prove a generalization
of\r\nthis result for the joint $L^2$-eigenvalues of the algebra of commuting\r\ndifferential
operators on Riemannian locally symmetric spaces $\\Gamma\\backslash\r\nG/K$ of
higher rank. We derive dynamical assumptions on the $\\Gamma$-action on\r\nthe
geodesic and the Satake compactifications which imply the absence of the\r\ncorresponding
principal eigenvalues. A large class of examples fulfilling these\r\nassumptions
are the non-compact quotients by Anosov subgroups."
author:
- first_name: Tobias
full_name: Weich, Tobias
id: '49178'
last_name: Weich
orcid: 0000-0002-9648-6919
- first_name: Lasse Lennart
full_name: Wolf, Lasse Lennart
id: '45027'
last_name: Wolf
citation:
ama: Weich T, Wolf LL. Absence of principal eigenvalues for higher rank locally
symmetric spaces. Communications in Mathematical Physics. 2023;403. doi:https://doi.org/10.1007/s00220-023-04819-1
apa: Weich, T., & Wolf, L. L. (2023). Absence of principal eigenvalues for higher
rank locally symmetric spaces. Communications in Mathematical Physics,
403. https://doi.org/10.1007/s00220-023-04819-1
bibtex: '@article{Weich_Wolf_2023, title={Absence of principal eigenvalues for higher
rank locally symmetric spaces}, volume={403}, DOI={https://doi.org/10.1007/s00220-023-04819-1},
journal={Communications in Mathematical Physics}, author={Weich, Tobias and Wolf,
Lasse Lennart}, year={2023} }'
chicago: Weich, Tobias, and Lasse Lennart Wolf. “Absence of Principal Eigenvalues
for Higher Rank Locally Symmetric Spaces.” Communications in Mathematical
Physics 403 (2023). https://doi.org/10.1007/s00220-023-04819-1.
ieee: 'T. Weich and L. L. Wolf, “Absence of principal eigenvalues for higher rank
locally symmetric spaces,” Communications in Mathematical Physics, vol.
403, 2023, doi: https://doi.org/10.1007/s00220-023-04819-1.'
mla: Weich, Tobias, and Lasse Lennart Wolf. “Absence of Principal Eigenvalues for
Higher Rank Locally Symmetric Spaces.” Communications in Mathematical Physics,
vol. 403, 2023, doi:https://doi.org/10.1007/s00220-023-04819-1.
short: T. Weich, L.L. Wolf, Communications in Mathematical Physics 403 (2023).
date_created: 2022-05-11T10:38:11Z
date_updated: 2024-02-06T20:52:40Z
department:
- _id: '10'
- _id: '548'
- _id: '623'
doi: https://doi.org/10.1007/s00220-023-04819-1
external_id:
arxiv:
- '2205.03167'
intvolume: ' 403'
language:
- iso: eng
publication: Communications in Mathematical Physics
publication_identifier:
unknown:
- 1275-1295
status: public
title: Absence of principal eigenvalues for higher rank locally symmetric spaces
type: journal_article
user_id: '49178'
volume: 403
year: '2023'
...
---
_id: '47049'
abstract:
- lang: eng
text: "As technology advances, Unmanned Aerial Vehicles ( UAVs) have emerged as
an innovative solution to a variety of problems in many fields. Automated control
of UAVs is most common in large area operations, but they may also increase the
versatility of smart home compositions by acting as a physical helper. For example,
a voice- controlled UAV could act as an intelligent aerial assistant that can
be seamlessly integrated into smart home systems. In this paper, we present a
novel Augmented Reality (AR )-based UAV control that provides high-level control
over a UAV by automating common UAV missions. In our work, we enable users to
operate a small UAV hands-free using only a small set of voice commands. To help
users identify the targets, and to understand the UAV ’s intentions, targets within
the user’s field of vision are highlighted in an AR interface. We evaluate our
approach in a user study (n=26) regarding usability, physical and mental demand,
as well as a focus on the users’ preferences. Our study showed that the use of
the proposed control was not only accepted, but some users stated that they would
use such a system at home to help with some tasks at home\r\n"
author:
- first_name: Robin
full_name: Helmert, Robin
last_name: Helmert
- first_name: Tobias
full_name: Hardes, Tobias
id: '35441'
last_name: Hardes
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
citation:
ama: 'Helmert R, Hardes T, Yigitbas E. Design and Evaluation of an AR Voice-based
Indoor UAV Assistant for Smart Home Scenarios. In: Proceedings of the ACM Symposium
on Spatial User Interaction (SUI 2023). ACM; 2023.'
apa: Helmert, R., Hardes, T., & Yigitbas, E. (2023). Design and Evaluation of
an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios. Proceedings
of the ACM Symposium on Spatial User Interaction (SUI 2023). ACM Symposium
on Spatial User Interaction, Sydney, Australia .
bibtex: '@inproceedings{Helmert_Hardes_Yigitbas_2023, title={Design and Evaluation
of an AR Voice-based Indoor UAV Assistant for Smart Home Scenarios}, booktitle={Proceedings
of the ACM Symposium on Spatial User Interaction (SUI 2023)}, publisher={ACM},
author={Helmert, Robin and Hardes, Tobias and Yigitbas, Enes}, year={2023} }'
chicago: Helmert, Robin, Tobias Hardes, and Enes Yigitbas. “Design and Evaluation
of an AR Voice-Based Indoor UAV Assistant for Smart Home Scenarios.” In Proceedings
of the ACM Symposium on Spatial User Interaction (SUI 2023). ACM, 2023.
ieee: R. Helmert, T. Hardes, and E. Yigitbas, “Design and Evaluation of an AR Voice-based
Indoor UAV Assistant for Smart Home Scenarios,” presented at the ACM Symposium
on Spatial User Interaction, Sydney, Australia , 2023.
mla: Helmert, Robin, et al. “Design and Evaluation of an AR Voice-Based Indoor UAV
Assistant for Smart Home Scenarios.” Proceedings of the ACM Symposium on Spatial
User Interaction (SUI 2023), ACM, 2023.
short: 'R. Helmert, T. Hardes, E. Yigitbas, in: Proceedings of the ACM Symposium
on Spatial User Interaction (SUI 2023), ACM, 2023.'
conference:
end_date: As technology advances, Unmanned Aerial Vehicles ( UAVs) have emerged
as an innovative solution to a variety of problems in many fields. Automated control
of UAVs is most common in large area operations, but they may also increase the
versatility of smart home compositions by acting as a physical helper. For example,
a voice- controlled UAV could act as an intelligent aerial assistant that can
be seamlessly integrated into smart home systems. In this paper, we present a
novel Augmented Reality (AR )-based UAV control that provides high-level control
over a UAV by automating common UAV missions. In our work, we enable users to
operate a small UAV hands-free using only a small set of voice commands. To help
users identify the targets, and to understand the UAV ’s intentions, targets within
the user’s field of vision are highlighted in an AR interface. We evaluate our
approach in a user study (n=26) regarding usability, physical and mental demand,
as well as a focus on the users’ preferences. Our study showed that the use of
the proposed control was not only accepted, but some users stated that they would
use such a system at home to help with some tasks at home
location: ' Sydney, Australia '
name: ACM Symposium on Spatial User Interaction
start_date: 2023-10-13
date_created: 2023-09-14T07:57:37Z
date_updated: 2024-02-08T07:58:15Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
publication: Proceedings of the ACM Symposium on Spatial User Interaction (SUI 2023)
publication_status: published
publisher: ACM
status: public
title: Design and Evaluation of an AR Voice-based Indoor UAV Assistant for Smart Home
Scenarios
type: conference
user_id: '35441'
year: '2023'
...
---
_id: '51206'
abstract:
- lang: eng
text: "We present a numerical algorithm for the computation of invariant Ruelle\r\ndistributions
on convex co-compact hyperbolic surfaces. This is achieved by\r\nexploiting the
connection between invariant Ruelle distributions and residues\r\nof meromorphically
continued weighted zeta functions established by the authors\r\ntogether with
Barkhofen (2021). To make this applicable for numerics we express\r\nthe weighted
zeta as the logarithmic derivative of a suitable parameter\r\ndependent Fredholm
determinant similar to Borthwick (2014). As an additional\r\ndifficulty our transfer
operator has to include a contracting direction which\r\nwe account for with techniques
developed by Rugh (1992). We achieve a further\r\nimprovement in convergence speed
for our algorithm in the case of surfaces with\r\nadditional symmetries by proving
and applying a symmetry reduction of weighted\r\nzeta functions."
author:
- first_name: Philipp
full_name: Schütte, Philipp
id: '50168'
last_name: Schütte
- first_name: Tobias
full_name: Weich, Tobias
id: '49178'
last_name: Weich
orcid: 0000-0002-9648-6919
citation:
ama: Schütte P, Weich T. Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic
Surfaces -- A Numerical Algorithm via Weighted Zeta Functions. arXiv:230813463.
Published online 2023.
apa: Schütte, P., & Weich, T. (2023). Invariant Ruelle Distributions on Convex-Cocompact
Hyperbolic Surfaces -- A Numerical Algorithm via Weighted Zeta Functions. In
arXiv:2308.13463.
bibtex: '@article{Schütte_Weich_2023, title={Invariant Ruelle Distributions on Convex-Cocompact
Hyperbolic Surfaces -- A Numerical Algorithm via Weighted Zeta Functions}, journal={arXiv:2308.13463},
author={Schütte, Philipp and Weich, Tobias}, year={2023} }'
chicago: Schütte, Philipp, and Tobias Weich. “Invariant Ruelle Distributions on
Convex-Cocompact Hyperbolic Surfaces -- A Numerical Algorithm via Weighted Zeta
Functions.” ArXiv:2308.13463, 2023.
ieee: P. Schütte and T. Weich, “Invariant Ruelle Distributions on Convex-Cocompact
Hyperbolic Surfaces -- A Numerical Algorithm via Weighted Zeta Functions,” arXiv:2308.13463.
2023.
mla: Schütte, Philipp, and Tobias Weich. “Invariant Ruelle Distributions on Convex-Cocompact
Hyperbolic Surfaces -- A Numerical Algorithm via Weighted Zeta Functions.” ArXiv:2308.13463,
2023.
short: P. Schütte, T. Weich, ArXiv:2308.13463 (2023).
date_created: 2024-02-06T20:58:35Z
date_updated: 2024-02-11T19:56:01Z
department:
- _id: '10'
- _id: '623'
- _id: '548'
external_id:
arxiv:
- '2308.13463'
language:
- iso: eng
publication: arXiv:2308.13463
status: public
title: Invariant Ruelle Distributions on Convex-Cocompact Hyperbolic Surfaces --
A Numerical Algorithm via Weighted Zeta Functions
type: preprint
user_id: '49178'
year: '2023'
...