---
_id: '45884'
author:
- first_name: Jonas Manuel
full_name: Hanselle, Jonas Manuel
id: '43980'
last_name: Hanselle
orcid: 0000-0002-1231-4985
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
id: '65716'
last_name: Ngonga Ngomo
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
orcid: https://orcid.org/0000-0002-9927-2203
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: 'Hanselle JM, Hüllermeier E, Mohr F, et al. Configuration and Evaluation. In:
Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:85-104.
doi:10.5281/zenodo.8068466'
apa: Hanselle, J. M., Hüllermeier, E., Mohr, F., Ngonga Ngomo, A.-C., Sherif, M.,
Tornede, A., & Wever, M. D. (2023). Configuration and Evaluation. In C.-J.
Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.),
On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol.
412, pp. 85–104). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068466
bibtex: '@inbook{Hanselle_Hüllermeier_Mohr_Ngonga Ngomo_Sherif_Tornede_Wever_2023,
place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts},
title={Configuration and Evaluation}, volume={412}, DOI={10.5281/zenodo.8068466},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Hanselle, Jonas
Manuel and Hüllermeier, Eyke and Mohr, Felix and Ngonga Ngomo, Axel-Cyrille and
Sherif, Mohamed and Tornede, Alexander and Wever, Marcel Dominik}, editor={Haake,
Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth,
Henning and Wehrheim, Heike}, year={2023}, pages={85–104}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts} }'
chicago: 'Hanselle, Jonas Manuel, Eyke Hüllermeier, Felix Mohr, Axel-Cyrille Ngonga
Ngomo, Mohamed Sherif, Alexander Tornede, and Marcel Dominik Wever. “Configuration
and Evaluation.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic
Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco
Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:85–104. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn,
2023. https://doi.org/10.5281/zenodo.8068466.'
ieee: 'J. M. Hanselle et al., “Configuration and Evaluation,” in On-The-Fly
Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J.
Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds.
Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104.'
mla: Hanselle, Jonas Manuel, et al. “Configuration and Evaluation.” On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen
Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp.
85–104, doi:10.5281/zenodo.8068466.
short: 'J.M. Hanselle, E. Hüllermeier, F. Mohr, A.-C. Ngonga Ngomo, M. Sherif, A.
Tornede, M.D. Wever, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H.
Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services
in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn,
2023, pp. 85–104.'
date_created: 2023-07-07T07:50:53Z
date_updated: 2023-07-07T11:20:12Z
ddc:
- '040'
department:
- _id: '7'
doi: 10.5281/zenodo.8068466
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T07:50:34Z
date_updated: 2023-07-07T11:20:11Z
file_id: '45885'
file_name: B2-Chapter-SFB-Buch-Final.pdf
file_size: 895091
relation: main_file
file_date_updated: 2023-07-07T11:20:11Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 85-104
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
grant_number: '160364472'
name: 'SFB 901 - B2: Konfiguration und Bewertung (B02)'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Configuration and Evaluation
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45878'
author:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: 'Haake C-J, Hehenkamp B, Polevoy G. The Market for Services: Incentives, Algorithms,
Implementation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H,
Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic
Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz
Nixdorf Institut, Universität Paderborn; 2023:21-44. doi:10.5281/zenodo.8068414'
apa: 'Haake, C.-J., Hehenkamp, B., & Polevoy, G. (2023). The Market for Services:
Incentives, Algorithms, Implementation. In C.-J. Haake, F. Meyer auf der Heide,
M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly Computing --
Individualized IT-services in dynamic markets (Vol. 412, pp. 21–44). Heinz
Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068414'
bibtex: '@inbook{Haake_Hehenkamp_Polevoy_2023, place={Paderborn}, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts}, title={The Market for Services: Incentives, Algorithms,
Implementation}, volume={412}, DOI={10.5281/zenodo.8068414},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen
and Hehenkamp, Burkhard and Polevoy, Gleb}, editor={Haake, Claus-Jochen and Meyer
auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim,
Heike}, year={2023}, pages={21–44}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts} }'
chicago: 'Haake, Claus-Jochen, Burkhard Hehenkamp, and Gleb Polevoy. “The Market
for Services: Incentives, Algorithms, Implementation.” In On-The-Fly Computing
-- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake,
Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim,
412:21–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz
Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068414.'
ieee: 'C.-J. Haake, B. Hehenkamp, and G. Polevoy, “The Market for Services: Incentives,
Algorithms, Implementation,” in On-The-Fly Computing -- Individualized IT-services
in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner,
H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität
Paderborn, 2023, pp. 21–44.'
mla: 'Haake, Claus-Jochen, et al. “The Market for Services: Incentives, Algorithms,
Implementation.” On-The-Fly Computing -- Individualized IT-Services in Dynamic
Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut,
Universität Paderborn, 2023, pp. 21–44, doi:10.5281/zenodo.8068414.'
short: 'C.-J. Haake, B. Hehenkamp, G. Polevoy, in: C.-J. Haake, F. Meyer auf der
Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing --
Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität
Paderborn, Paderborn, 2023, pp. 21–44.'
date_created: 2023-07-07T07:02:44Z
date_updated: 2023-07-07T11:23:08Z
ddc:
- '004'
department:
- _id: '7'
- _id: '19'
doi: 10.5281/zenodo.8068414
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T06:59:23Z
date_updated: 2023-07-07T11:23:07Z
file_id: '45879'
file_name: A3-Chapter-SFB-Buch-Final.pdf
file_size: 1116173
relation: main_file
file_date_updated: 2023-07-07T11:23:07Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 21-44
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '7'
grant_number: '160364472'
name: 'SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation
(Subproject A3)'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: 'The Market for Services: Incentives, Algorithms, Implementation'
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45886'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Steffen
full_name: Becker, Steffen
last_name: Becker
- first_name: Matthias
full_name: Becker, Matthias
last_name: Becker
- first_name: Cedric
full_name: Richter, Cedric
id: '50003'
last_name: Richter
- first_name: Arnab
full_name: Sharma, Arnab
id: '67200'
last_name: Sharma
citation:
ama: 'Wehrheim H, Hüllermeier E, Becker S, Becker M, Richter C, Sharma A. Composition
Analysis in Unknown Contexts. In: Haake C-J, Meyer auf der Heide F, Platzner M,
Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services
in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts.
Heinz Nixdorf Institut, Universität Paderborn; 2023:105-123. doi:10.5281/zenodo.8068510'
apa: Wehrheim, H., Hüllermeier, E., Becker, S., Becker, M., Richter, C., & Sharma,
A. (2023). Composition Analysis in Unknown Contexts. In C.-J. Haake, F. Meyer
auf der Heide, M. Platzner, H. Wachsmuth, & H. Wehrheim (Eds.), On-The-Fly
Computing -- Individualized IT-services in dynamic markets (Vol. 412, pp.
105–123). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068510
bibtex: '@inbook{Wehrheim_Hüllermeier_Becker_Becker_Richter_Sharma_2023, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Composition
Analysis in Unknown Contexts}, volume={412}, DOI={10.5281/zenodo.8068510},
booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets},
publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike
and Hüllermeier, Eyke and Becker, Steffen and Becker, Matthias and Richter, Cedric
and Sharma, Arnab}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm
and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023},
pages={105–123}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts}
}'
chicago: 'Wehrheim, Heike, Eyke Hüllermeier, Steffen Becker, Matthias Becker, Cedric
Richter, and Arnab Sharma. “Composition Analysis in Unknown Contexts.” In On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen
Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike
Wehrheim, 412:105–23. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn:
Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068510.'
ieee: 'H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, and A. Sharma,
“Composition Analysis in Unknown Contexts,” in On-The-Fly Computing -- Individualized
IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide,
M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut,
Universität Paderborn, 2023, pp. 105–123.'
mla: Wehrheim, Heike, et al. “Composition Analysis in Unknown Contexts.” On-The-Fly
Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen
Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp.
105–23, doi:10.5281/zenodo.8068510.
short: 'H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, A. Sharma,
in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim
(Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets,
Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 105–123.'
date_created: 2023-07-07T07:56:08Z
date_updated: 2023-07-07T11:19:40Z
ddc:
- '004'
department:
- _id: '7'
doi: 10.5281/zenodo.8068510
editor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
last_name: Haake
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
last_name: Meyer auf der Heide
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
- first_name: Henning
full_name: Wachsmuth, Henning
last_name: Wachsmuth
- first_name: Heike
full_name: Wehrheim, Heike
last_name: Wehrheim
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2023-07-07T07:55:57Z
date_updated: 2023-07-07T11:19:40Z
file_id: '45887'
file_name: B3-Chapter-SFB-Buch-Final.pdf
file_size: 370888
relation: main_file
file_date_updated: 2023-07-07T11:19:40Z
has_accepted_license: '1'
intvolume: ' 412'
language:
- iso: eng
oa: '1'
page: 105-123
place: Paderborn
project:
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '11'
name: 'SFB 901 - B3: SFB 901 - Subproject B3'
publication: On-The-Fly Computing -- Individualized IT-services in dynamic markets
publisher: Heinz Nixdorf Institut, Universität Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Composition Analysis in Unknown Contexts
type: book_chapter
user_id: '477'
volume: 412
year: '2023'
...
---
_id: '45917'
author:
- first_name: Masood
full_name: Raeisi Nafchi, Masood
last_name: Raeisi Nafchi
citation:
ama: Raeisi Nafchi M. Reconfigurable Random Forest Implementation on FPGA.
Paderborn University; 2023.
apa: Raeisi Nafchi, M. (2023). Reconfigurable Random Forest Implementation on
FPGA. Paderborn University.
bibtex: '@book{Raeisi Nafchi_2023, title={Reconfigurable Random Forest Implementation
on FPGA}, publisher={Paderborn University}, author={Raeisi Nafchi, Masood}, year={2023}
}'
chicago: Raeisi Nafchi, Masood. Reconfigurable Random Forest Implementation on
FPGA. Paderborn University, 2023.
ieee: M. Raeisi Nafchi, Reconfigurable Random Forest Implementation on FPGA.
Paderborn University, 2023.
mla: Raeisi Nafchi, Masood. Reconfigurable Random Forest Implementation on FPGA.
Paderborn University, 2023.
short: M. Raeisi Nafchi, Reconfigurable Random Forest Implementation on FPGA, Paderborn
University, 2023.
date_created: 2023-07-09T13:01:10Z
date_updated: 2023-07-09T13:07:25Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '83'
name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
publisher: Paderborn University
status: public
supervisor:
- first_name: 'Marco '
full_name: 'Platzner, Marco '
last_name: Platzner
title: Reconfigurable Random Forest Implementation on FPGA
type: mastersthesis
user_id: '398'
year: '2023'
...
---
_id: '45916'
author:
- first_name: Nihal
full_name: Yadalam Murali Kumar, Nihal
last_name: Yadalam Murali Kumar
citation:
ama: Yadalam Murali Kumar N. Data Analytics for Predictive Maintenance of Time
Series Data. Paderborn University; 2023.
apa: Yadalam Murali Kumar, N. (2023). Data Analytics for Predictive Maintenance
of Time Series Data. Paderborn University.
bibtex: '@book{Yadalam Murali Kumar_2023, title={Data Analytics for Predictive Maintenance
of Time Series Data}, publisher={Paderborn University}, author={Yadalam Murali
Kumar, Nihal}, year={2023} }'
chicago: Yadalam Murali Kumar, Nihal. Data Analytics for Predictive Maintenance
of Time Series Data. Paderborn University, 2023.
ieee: N. Yadalam Murali Kumar, Data Analytics for Predictive Maintenance of Time
Series Data. Paderborn University, 2023.
mla: Yadalam Murali Kumar, Nihal. Data Analytics for Predictive Maintenance of
Time Series Data. Paderborn University, 2023.
short: N. Yadalam Murali Kumar, Data Analytics for Predictive Maintenance of Time
Series Data, Paderborn University, 2023.
date_created: 2023-07-09T12:59:28Z
date_updated: 2023-07-09T13:06:37Z
department:
- _id: '78'
language:
- iso: eng
project:
- _id: '83'
name: 'SFB 901 - T1: SFB 901 -Subproject T1'
- _id: '82'
name: 'SFB 901 - T: SFB 901 - Project Area T'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
publisher: Paderborn University
status: public
title: Data Analytics for Predictive Maintenance of Time Series Data
type: mastersthesis
user_id: '398'
year: '2023'
...
---
_id: '34138'
abstract:
- lang: eng
text: "Variational Quantum Algorithms (VQAs), such as the Quantum Approximate\r\nOptimization
Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen\r\nintense study
towards near-term applications on quantum hardware. A crucial\r\nparameter for
VQAs is the depth of the variational ansatz used - the smaller\r\nthe depth, the
more amenable the ansatz is to near-term quantum hardware in\r\nthat it gives
the circuit a chance to be fully executed before the system\r\ndecoheres. This
potential for depth reduction has made VQAs a staple of Noisy\r\nIntermediate-Scale
Quantum (NISQ)-era research.\r\n In this work, we show that approximating the
optimal depth for a given VQA\r\nansatz is intractable. Formally, we show that
for any constant $\\epsilon>0$, it\r\nis QCMA-hard to approximate the optimal
depth of a VQA ansatz within\r\nmultiplicative factor $N^{1-\\epsilon}$, for $N$
denoting the encoding size of\r\nthe VQA instance. (Here, Quantum Classical Merlin-Arthur
(QCMA) is a quantum\r\ngeneralization of NP.) We then show that this hardness
persists even in the\r\n\"simpler\" setting of QAOAs. To our knowledge, this yields
the first natural\r\nQCMA-hard-to-approximate problems. To achieve these results,
we bypass the need\r\nfor a PCP theorem for QCMA by appealing to the disperser-based
NP-hardness of\r\napproximation construction of [Umans, FOCS 1999]."
author:
- first_name: Lennart
full_name: Bittel, Lennart
last_name: Bittel
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Martin
full_name: Kliesch, Martin
last_name: Kliesch
citation:
ama: 'Bittel L, Gharibian S, Kliesch M. The Optimal Depth of Variational Quantum
Algorithms Is QCMA-Hard to Approximate. In: Proceedings of the 38th Computational
Complexity Conference (CCC). Vol 264. Leibniz International Proceedings in
Informatics (LIPIcs). ; 2023:34:1-34:24. doi:10.4230/LIPIcs.CCC.2023.34'
apa: Bittel, L., Gharibian, S., & Kliesch, M. (2023). The Optimal Depth of Variational
Quantum Algorithms Is QCMA-Hard to Approximate. Proceedings of the 38th Computational
Complexity Conference (CCC), 264(34), 34:1-34:24. https://doi.org/10.4230/LIPIcs.CCC.2023.34
bibtex: '@inproceedings{Bittel_Gharibian_Kliesch_2023, series={Leibniz International
Proceedings in Informatics (LIPIcs)}, title={The Optimal Depth of Variational
Quantum Algorithms Is QCMA-Hard to Approximate}, volume={264}, DOI={10.4230/LIPIcs.CCC.2023.34},
number={34}, booktitle={Proceedings of the 38th Computational Complexity Conference
(CCC)}, author={Bittel, Lennart and Gharibian, Sevag and Kliesch, Martin}, year={2023},
pages={34:1-34:24}, collection={Leibniz International Proceedings in Informatics
(LIPIcs)} }'
chicago: Bittel, Lennart, Sevag Gharibian, and Martin Kliesch. “The Optimal Depth
of Variational Quantum Algorithms Is QCMA-Hard to Approximate.” In Proceedings
of the 38th Computational Complexity Conference (CCC), 264:34:1-34:24. Leibniz
International Proceedings in Informatics (LIPIcs), 2023. https://doi.org/10.4230/LIPIcs.CCC.2023.34.
ieee: 'L. Bittel, S. Gharibian, and M. Kliesch, “The Optimal Depth of Variational
Quantum Algorithms Is QCMA-Hard to Approximate,” in Proceedings of the 38th
Computational Complexity Conference (CCC), 2023, vol. 264, no. 34, p. 34:1-34:24,
doi: 10.4230/LIPIcs.CCC.2023.34.'
mla: Bittel, Lennart, et al. “The Optimal Depth of Variational Quantum Algorithms
Is QCMA-Hard to Approximate.” Proceedings of the 38th Computational Complexity
Conference (CCC), vol. 264, no. 34, 2023, p. 34:1-34:24, doi:10.4230/LIPIcs.CCC.2023.34.
short: 'L. Bittel, S. Gharibian, M. Kliesch, in: Proceedings of the 38th Computational
Complexity Conference (CCC), 2023, p. 34:1-34:24.'
date_created: 2022-11-24T08:07:56Z
date_updated: 2023-07-10T14:33:00Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.CCC.2023.34
external_id:
arxiv:
- '2211.12519'
intvolume: ' 264'
issue: '34'
language:
- iso: eng
page: 34:1-34:24
publication: Proceedings of the 38th Computational Complexity Conference (CCC)
publication_status: published
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate
type: conference
user_id: '71541'
volume: 264
year: '2023'
...
---
_id: '45781'
author:
- first_name: Simon
full_name: Pukrop, Simon
id: '44428'
last_name: Pukrop
citation:
ama: Pukrop S. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.;
2023. doi:10.17619/UNIPB/1-1768
apa: Pukrop, S. (2023). On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling. https://doi.org/10.17619/UNIPB/1-1768
bibtex: '@book{Pukrop_2023, title={On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling}, DOI={10.17619/UNIPB/1-1768
}, author={Pukrop, Simon}, year={2023} }'
chicago: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained
Scheduling, 2023. https://doi.org/10.17619/UNIPB/1-1768
.
ieee: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.
2023.
mla: Pukrop, Simon. On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling.
2023, doi:10.17619/UNIPB/1-1768
.
short: S. Pukrop, On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling,
2023.
date_created: 2023-06-27T05:24:19Z
date_updated: 2023-07-14T09:27:44Z
department:
- _id: '63'
doi: '10.17619/UNIPB/1-1768 '
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)'
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
type: dissertation
user_id: '15504'
year: '2023'
...
---
_id: '46053'
author:
- first_name: Fabian
full_name: Schneider, Fabian
last_name: Schneider
citation:
ama: Schneider F. Utilizing Redundancy in Distributed Heterogeneous Storage.;
2023.
apa: Schneider, F. (2023). Utilizing Redundancy in Distributed Heterogeneous
Storage.
bibtex: '@book{Schneider_2023, title={Utilizing Redundancy in Distributed Heterogeneous
Storage}, author={Schneider, Fabian}, year={2023} }'
chicago: Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous
Storage, 2023.
ieee: F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage.
2023.
mla: Schneider, Fabian. Utilizing Redundancy in Distributed Heterogeneous Storage.
2023.
short: F. Schneider, Utilizing Redundancy in Distributed Heterogeneous Storage,
2023.
date_created: 2023-07-13T12:46:28Z
date_updated: 2023-07-17T07:05:22Z
ddc:
- '004'
department:
- _id: '79'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2023-07-17T07:05:05Z
date_updated: 2023-07-17T07:05:05Z
file_id: '46071'
file_name: BA-Schneider.pdf
file_size: 1977565
relation: main_file
success: 1
file_date_updated: 2023-07-17T07:05:05Z
has_accepted_license: '1'
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: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Utilizing Redundancy in Distributed Heterogeneous Storage
type: bachelorsthesis
user_id: '15504'
year: '2023'
...
---
_id: '46087'
author:
- first_name: Amruta
full_name: Ranade, Amruta
last_name: Ranade
citation:
ama: Ranade A. Graph Neural Network-Based Anomaly Detection in Smart Grid Energy
Consumption.; 2023.
apa: Ranade, A. (2023). Graph Neural Network-based Anomaly Detection in Smart
Grid Energy Consumption.
bibtex: '@book{Ranade_2023, title={Graph Neural Network-based Anomaly Detection
in Smart Grid Energy Consumption}, author={Ranade, Amruta}, year={2023} }'
chicago: Ranade, Amruta. Graph Neural Network-Based Anomaly Detection in Smart
Grid Energy Consumption, 2023.
ieee: A. Ranade, Graph Neural Network-based Anomaly Detection in Smart Grid
Energy Consumption. 2023.
mla: Ranade, Amruta. Graph Neural Network-Based Anomaly Detection in Smart Grid
Energy Consumption. 2023.
short: A. Ranade, Graph Neural Network-Based Anomaly Detection in Smart Grid Energy
Consumption, 2023.
date_created: 2023-07-19T06:09:17Z
date_updated: 2023-07-19T06:09:36Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '46086'
author:
- first_name: Osama
full_name: Ali, Osama
last_name: Ali
citation:
ama: Ali O. Highly Accurate Deep Compressed Facial Recognition.; 2023.
apa: Ali, O. (2023). Highly accurate deep compressed facial recognition.
bibtex: '@book{Ali_2023, title={Highly accurate deep compressed facial recognition},
author={Ali, Osama}, year={2023} }'
chicago: Ali, Osama. Highly Accurate Deep Compressed Facial Recognition,
2023.
ieee: O. Ali, Highly accurate deep compressed facial recognition. 2023.
mla: Ali, Osama. Highly Accurate Deep Compressed Facial Recognition. 2023.
short: O. Ali, Highly Accurate Deep Compressed Facial Recognition, 2023.
date_created: 2023-07-19T06:08:13Z
date_updated: 2023-07-19T06:09:31Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Highly accurate deep compressed facial recognition
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '46110'
author:
- first_name: Nivedita
full_name: Ashri, Nivedita
last_name: Ashri
citation:
ama: Ashri N. Virtual On-Demand Volunteer System Based on Delaunay Triangulation.;
2023.
apa: Ashri, N. (2023). Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
bibtex: '@book{Ashri_2023, title={Virtual On-Demand Volunteer System Based on Delaunay
Triangulation}, author={Ashri, Nivedita}, year={2023} }'
chicago: Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay
Triangulation, 2023.
ieee: N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
2023.
mla: Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
2023.
short: N. Ashri, Virtual On-Demand Volunteer System Based on Delaunay Triangulation,
2023.
date_created: 2023-07-21T08:52:38Z
date_updated: 2023-07-21T08:53:13Z
department:
- _id: '79'
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: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
grant_number: '160364472'
name: 'SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen
Netzen (Subproject A1)'
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Virtual On-Demand Volunteer System Based on Delaunay Triangulation
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '38041'
abstract:
- lang: eng
text: "While FPGA accelerator boards and their respective high-level design
tools are maturing, there is still a lack of multi-FPGA applications, libraries,
and not least, benchmarks and reference implementations towards sustained HPC
usage of these devices. As in the early days of GPUs in HPC, for workloads that
can reasonably be decoupled into loosely coupled working sets, multi-accelerator
support can be achieved by using standard communication interfaces like MPI on
the host side. However, for performance and productivity, some applications can
profit from a tighter coupling of the accelerators. FPGAs offer unique opportunities
here when extending the dataflow characteristics to their communication interfaces.\r\n
\ In this work, we extend the HPCC FPGA benchmark suite by multi-FPGA
support and three missing benchmarks that particularly characterize or stress
inter-device communication: b_eff, PTRANS, and LINPACK. With all benchmarks implemented
for current boards with Intel and Xilinx FPGAs, we established a baseline for
multi-FPGA performance. Additionally, for the communication-centric benchmarks,
we explored the potential of direct FPGA-to-FPGA communication with a circuit-switched
inter-FPGA network that is currently only available for one of the boards. The
evaluation with parallel execution on up to 26 FPGA boards makes use of one of
the largest academic FPGA installations."
author:
- first_name: Marius
full_name: Meyer, Marius
id: '40778'
last_name: Meyer
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Meyer M, Kenter T, Plessl C. Multi-FPGA Designs and Scaling of HPC Challenge
Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks. ACM Transactions
on Reconfigurable Technology and Systems. Published online 2023. doi:10.1145/3576200
apa: Meyer, M., Kenter, T., & Plessl, C. (2023). Multi-FPGA Designs and Scaling
of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks.
ACM Transactions on Reconfigurable Technology and Systems. https://doi.org/10.1145/3576200
bibtex: '@article{Meyer_Kenter_Plessl_2023, title={Multi-FPGA Designs and Scaling
of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks},
DOI={10.1145/3576200}, journal={ACM
Transactions on Reconfigurable Technology and Systems}, publisher={Association
for Computing Machinery (ACM)}, author={Meyer, Marius and Kenter, Tobias and Plessl,
Christian}, year={2023} }'
chicago: Meyer, Marius, Tobias Kenter, and Christian Plessl. “Multi-FPGA Designs
and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA
Networks.” ACM Transactions on Reconfigurable Technology and Systems, 2023.
https://doi.org/10.1145/3576200.
ieee: 'M. Meyer, T. Kenter, and C. Plessl, “Multi-FPGA Designs and Scaling of HPC
Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks,” ACM
Transactions on Reconfigurable Technology and Systems, 2023, doi: 10.1145/3576200.'
mla: Meyer, Marius, et al. “Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks
via MPI and Circuit-Switched Inter-FPGA Networks.” ACM Transactions on Reconfigurable
Technology and Systems, Association for Computing Machinery (ACM), 2023, doi:10.1145/3576200.
short: M. Meyer, T. Kenter, C. Plessl, ACM Transactions on Reconfigurable Technology
and Systems (2023).
date_created: 2023-01-23T08:40:42Z
date_updated: 2023-07-28T08:02:05Z
department:
- _id: '27'
- _id: '518'
doi: 10.1145/3576200
keyword:
- General Computer Science
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/doi/10.1145/3576200
oa: '1'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901'
- _id: '14'
grant_number: '160364472'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
publication: ACM Transactions on Reconfigurable Technology and Systems
publication_identifier:
issn:
- 1936-7406
- 1936-7414
publication_status: published
publisher: Association for Computing Machinery (ACM)
quality_controlled: '1'
status: public
title: Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched
Inter-FPGA Networks
type: journal_article
user_id: '24135'
year: '2023'
...
---
_id: '46221'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Improving the End-of-Line Test of Custom-Built Geared Motors Using
Clustering Based on Neural Networks.; 2023.
apa: N., N. (2023). Improving the End-of-Line Test of Custom-Built Geared Motors
using Clustering based on Neural Networks.
bibtex: '@book{N._2023, title={Improving the End-of-Line Test of Custom-Built Geared
Motors using Clustering based on Neural Networks}, author={N., N.}, year={2023}
}'
chicago: N., N. Improving the End-of-Line Test of Custom-Built Geared Motors
Using Clustering Based on Neural Networks, 2023.
ieee: N. N., Improving the End-of-Line Test of Custom-Built Geared Motors using
Clustering based on Neural Networks. 2023.
mla: N., N. Improving the End-of-Line Test of Custom-Built Geared Motors Using
Clustering Based on Neural Networks. 2023.
short: N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using
Clustering Based on Neural Networks, 2023.
date_created: 2023-07-31T10:49:12Z
date_updated: 2023-07-31T10:49:30Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
title: Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering
based on Neural Networks
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '46251'
author:
- first_name: Caglar
full_name: Demir, Caglar
id: '43817'
last_name: Demir
- first_name: Axel-Cyrille
full_name: Ngonga Ngomo, Axel-Cyrille
last_name: Ngonga Ngomo
citation:
ama: Demir C, Ngonga Ngomo A-C. Neuro-Symbolic Class Expression Learning. International
Joint Conference on Artificial Intelligence. Published online 2023.
apa: Demir, C., & Ngonga Ngomo, A.-C. (2023). Neuro-Symbolic Class Expression
Learning. International Joint Conference on Artificial Intelligence. International
Joint Conference on Artificial Intelligence IJCAI 2023, Macau.
bibtex: '@article{Demir_Ngonga Ngomo_2023, title={Neuro-Symbolic Class Expression
Learning}, journal={International Joint Conference on Artificial Intelligence},
author={Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}, year={2023} }'
chicago: Demir, Caglar, and Axel-Cyrille Ngonga Ngomo. “Neuro-Symbolic Class Expression
Learning.” International Joint Conference on Artificial Intelligence, 2023.
ieee: C. Demir and A.-C. Ngonga Ngomo, “Neuro-Symbolic Class Expression Learning,”
International Joint Conference on Artificial Intelligence, 2023.
mla: Demir, Caglar, and Axel-Cyrille Ngonga Ngomo. “Neuro-Symbolic Class Expression
Learning.” International Joint Conference on Artificial Intelligence, 2023.
short: C. Demir, A.-C. Ngonga Ngomo, International Joint Conference on Artificial
Intelligence (2023).
conference:
location: Macau
name: International Joint Conference on Artificial Intelligence IJCAI 2023
date_created: 2023-08-01T09:30:37Z
date_updated: 2023-08-01T09:44:30Z
ddc:
- '000'
department:
- _id: '574'
file:
- access_level: open_access
content_type: application/pdf
creator: cdemir
date_created: 2023-08-01T09:30:35Z
date_updated: 2023-08-01T09:30:35Z
file_id: '46252'
file_name: public.pdf
file_size: 340865
relation: main_file
file_date_updated: 2023-08-01T09:30:35Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '407'
grant_number: '101070305'
name: 'ENEXA: Efficient Explainable Learning on Knowledge Graphs'
- _id: '410'
name: 'KnowGraphs: KnowGraphs: Knowledge Graphs at Scale'
- _id: '285'
grant_number: NW21-059D
name: 'SAIL: SAIL: SustAInable Life-cycle of Intelligent Socio-Technical Systems'
publication: International Joint Conference on Artificial Intelligence
status: public
title: Neuro-Symbolic Class Expression Learning
type: journal_article
user_id: '43817'
year: '2023'
...
---
_id: '43228'
abstract:
- lang: eng
text: "The computation of electron repulsion integrals (ERIs) over Gaussian-type
orbitals (GTOs) is a challenging problem in quantum-mechanics-based atomistic
simulations. In practical simulations, several trillions of ERIs may have to be\r\ncomputed
for every time step.\r\nIn this work, we investigate FPGAs as accelerators for
the ERI computation. We use template parameters, here within the Intel oneAPI
tool flow, to create customized designs for 256 different ERI quartet classes,
based on their orbitals. To maximize data reuse, all intermediates are buffered
in FPGA on-chip memory with customized layout. The pre-calculation of intermediates
also helps to overcome data dependencies caused by multi-dimensional recurrence\r\nrelations.
The involved loop structures are partially or even fully unrolled for high throughput
of FPGA kernels. Furthermore, a lossy compression algorithm utilizing arbitrary
bitwidth integers is integrated in the FPGA kernels. To our\r\nbest knowledge,
this is the first work on ERI computation on FPGAs that supports more than just
the single most basic quartet class. Also, the integration of ERI computation
and compression it a novelty that is not even covered by CPU or GPU libraries
so far.\r\nOur evaluation shows that using 16-bit integer for the ERI compression,
the fastest FPGA kernels exceed the performance of 10 GERIS ($10 \\times 10^9$
ERIs per second) on one Intel Stratix 10 GX 2800 FPGA, with maximum absolute errors
around $10^{-7}$ - $10^{-5}$ Hartree. The measured throughput can be accurately
explained by a performance model. The FPGA kernels deployed on 2 FPGAs outperform
similar computations using the widely used libint reference on a two-socket server
with 40 Xeon Gold 6148 CPU cores of the same process technology by factors up
to 6.0x and on a new two-socket server with 128 EPYC 7713 CPU cores by up to 1.9x."
author:
- first_name: Xin
full_name: Wu, Xin
id: '77439'
last_name: Wu
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Robert
full_name: Schade, Robert
id: '75963'
last_name: Schade
orcid: 0000-0002-6268-539
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Wu X, Kenter T, Schade R, Kühne T, Plessl C. Computing and Compressing Electron
Repulsion Integrals on FPGAs. In: 2023 IEEE 31st Annual International Symposium
on Field-Programmable Custom Computing Machines (FCCM). ; 2023:162-173. doi:10.1109/FCCM57271.2023.00026'
apa: Wu, X., Kenter, T., Schade, R., Kühne, T., & Plessl, C. (2023). Computing
and Compressing Electron Repulsion Integrals on FPGAs. 2023 IEEE 31st Annual
International Symposium on Field-Programmable Custom Computing Machines (FCCM),
162–173. https://doi.org/10.1109/FCCM57271.2023.00026
bibtex: '@inproceedings{Wu_Kenter_Schade_Kühne_Plessl_2023, title={Computing and
Compressing Electron Repulsion Integrals on FPGAs}, DOI={10.1109/FCCM57271.2023.00026},
booktitle={2023 IEEE 31st Annual International Symposium on Field-Programmable
Custom Computing Machines (FCCM)}, author={Wu, Xin and Kenter, Tobias and Schade,
Robert and Kühne, Thomas and Plessl, Christian}, year={2023}, pages={162–173}
}'
chicago: Wu, Xin, Tobias Kenter, Robert Schade, Thomas Kühne, and Christian Plessl.
“Computing and Compressing Electron Repulsion Integrals on FPGAs.” In 2023
IEEE 31st Annual International Symposium on Field-Programmable Custom Computing
Machines (FCCM), 162–73, 2023. https://doi.org/10.1109/FCCM57271.2023.00026.
ieee: 'X. Wu, T. Kenter, R. Schade, T. Kühne, and C. Plessl, “Computing and Compressing
Electron Repulsion Integrals on FPGAs,” in 2023 IEEE 31st Annual International
Symposium on Field-Programmable Custom Computing Machines (FCCM), 2023, pp.
162–173, doi: 10.1109/FCCM57271.2023.00026.'
mla: Wu, Xin, et al. “Computing and Compressing Electron Repulsion Integrals on
FPGAs.” 2023 IEEE 31st Annual International Symposium on Field-Programmable
Custom Computing Machines (FCCM), 2023, pp. 162–73, doi:10.1109/FCCM57271.2023.00026.
short: 'X. Wu, T. Kenter, R. Schade, T. Kühne, C. Plessl, in: 2023 IEEE 31st Annual
International Symposium on Field-Programmable Custom Computing Machines (FCCM),
2023, pp. 162–173.'
date_created: 2023-03-30T11:15:40Z
date_updated: 2023-08-02T15:05:42Z
department:
- _id: '27'
- _id: '518'
doi: 10.1109/FCCM57271.2023.00026
external_id:
arxiv:
- '2303.13632'
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/10171537
page: 162-173
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: 2023 IEEE 31st Annual International Symposium on Field-Programmable Custom
Computing Machines (FCCM)
quality_controlled: '1'
status: public
title: Computing and Compressing Electron Repulsion Integrals on FPGAs
type: conference
user_id: '75963'
year: '2023'
...
---
_id: '45361'
abstract:
- lang: eng
text: The non-orthogonal local submatrix method applied to electronic structure–based
molecular dynamics simulations is shown to exceed 1.1 EFLOP/s in FP16/FP32-mixed
floating-point arithmetic when using 4400 NVIDIA A100 GPUs of the Perlmutter system.
This is enabled by a modification of the original method that pushes the sustained
fraction of the peak performance to about 80%. Example calculations are performed
for SARS-CoV-2 spike proteins with up to 83 million atoms.
article_number: '109434202311776'
article_type: original
author:
- first_name: Robert
full_name: Schade, Robert
id: '75963'
last_name: Schade
orcid: 0000-0002-6268-539
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Hossam
full_name: Elgabarty, Hossam
id: '60250'
last_name: Elgabarty
orcid: 0000-0002-4945-1481
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Schade R, Kenter T, Elgabarty H, Lass M, Kühne T, Plessl C. Breaking the exascale
barrier for the electronic structure problem in ab-initio molecular dynamics.
The International Journal of High Performance Computing Applications. Published
online 2023. doi:10.1177/10943420231177631
apa: Schade, R., Kenter, T., Elgabarty, H., Lass, M., Kühne, T., & Plessl, C.
(2023). Breaking the exascale barrier for the electronic structure problem in
ab-initio molecular dynamics. The International Journal of High Performance
Computing Applications, Article 109434202311776. https://doi.org/10.1177/10943420231177631
bibtex: '@article{Schade_Kenter_Elgabarty_Lass_Kühne_Plessl_2023, title={Breaking
the exascale barrier for the electronic structure problem in ab-initio molecular
dynamics}, DOI={10.1177/10943420231177631},
number={109434202311776}, journal={The International Journal of High Performance
Computing Applications}, publisher={SAGE Publications}, author={Schade, Robert
and Kenter, Tobias and Elgabarty, Hossam and Lass, Michael and Kühne, Thomas and
Plessl, Christian}, year={2023} }'
chicago: Schade, Robert, Tobias Kenter, Hossam Elgabarty, Michael Lass, Thomas Kühne,
and Christian Plessl. “Breaking the Exascale Barrier for the Electronic Structure
Problem in Ab-Initio Molecular Dynamics.” The International Journal of High
Performance Computing Applications, 2023. https://doi.org/10.1177/10943420231177631.
ieee: 'R. Schade, T. Kenter, H. Elgabarty, M. Lass, T. Kühne, and C. Plessl, “Breaking
the exascale barrier for the electronic structure problem in ab-initio molecular
dynamics,” The International Journal of High Performance Computing Applications,
Art. no. 109434202311776, 2023, doi: 10.1177/10943420231177631.'
mla: Schade, Robert, et al. “Breaking the Exascale Barrier for the Electronic Structure
Problem in Ab-Initio Molecular Dynamics.” The International Journal of High
Performance Computing Applications, 109434202311776, SAGE Publications, 2023,
doi:10.1177/10943420231177631.
short: R. Schade, T. Kenter, H. Elgabarty, M. Lass, T. Kühne, C. Plessl, The International
Journal of High Performance Computing Applications (2023).
date_created: 2023-05-30T09:19:09Z
date_updated: 2023-08-02T15:04:53Z
department:
- _id: '27'
- _id: '518'
doi: 10.1177/10943420231177631
keyword:
- Hardware and Architecture
- Theoretical Computer Science
- Software
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://journals.sagepub.com/doi/10.1177/10943420231177631
oa: '1'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: The International Journal of High Performance Computing Applications
publication_identifier:
issn:
- 1094-3420
- 1741-2846
publication_status: published
publisher: SAGE Publications
quality_controlled: '1'
status: public
title: Breaking the exascale barrier for the electronic structure problem in ab-initio
molecular dynamics
type: journal_article
user_id: '75963'
year: '2023'
...
---
_id: '45780'
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
citation:
ama: 'Tornede A. Advanced Algorithm Selection with Machine Learning: Handling
Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions.;
2023. doi:10.17619/UNIPB/1-1780
'
apa: 'Tornede, A. (2023). Advanced Algorithm Selection with Machine Learning:
Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta
Level Decisions. https://doi.org/10.17619/UNIPB/1-1780
'
bibtex: '@book{Tornede_2023, title={Advanced Algorithm Selection with Machine Learning:
Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta
Level Decisions}, DOI={10.17619/UNIPB/1-1780
}, author={Tornede, Alexander}, year={2023} }'
chicago: 'Tornede, Alexander. Advanced Algorithm Selection with Machine Learning:
Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta
Level Decisions, 2023. https://doi.org/10.17619/UNIPB/1-1780
.'
ieee: 'A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling
Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions.
2023.'
mla: 'Tornede, Alexander. Advanced Algorithm Selection with Machine Learning:
Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta
Level Decisions. 2023, doi:10.17619/UNIPB/1-1780 .'
short: 'A. Tornede, Advanced Algorithm Selection with Machine Learning: Handling
Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions,
2023.'
date_created: 2023-06-27T05:20:14Z
date_updated: 2023-08-04T06:01:49Z
ddc:
- '006'
department:
- _id: '355'
doi: '10.17619/UNIPB/1-1780 '
file:
- access_level: open_access
content_type: application/pdf
creator: ahetzer
date_created: 2023-07-24T08:40:35Z
date_updated: 2023-07-24T08:42:01Z
file_id: '46118'
file_name: dissertation_alexander_tornede_final_publishing_compressed.pdf
file_size: 4300633
relation: main_file
title: ' Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm
Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions'
file_date_updated: 2023-07-24T08:42:01Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
project:
- _id: '10'
grant_number: '160364472'
name: 'SFB 901 - B2: Konfiguration und Bewertung (B02)'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '1'
grant_number: '160364472'
name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
in dynamischen Märkten '
status: public
supervisor:
- first_name: Eyke
full_name: Hüllermeier, Eyke
last_name: Hüllermeier
title: 'Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm
Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions'
type: dissertation
user_id: '15504'
year: '2023'
...
---
_id: '46579'
abstract:
- lang: eng
text: "The Koopman operator has become an essential tool for data-driven analysis,
prediction and control of complex systems, the main reason being the enormous
potential of identifying linear function space representations of nonlinear\r\ndynamics
from measurements. Until now, the situation where for large-scale systems, we
(i) only have access to partial observations (i.e., measurements, as is very common
for experimental data) or (ii) deliberately perform coarse\r\ngraining (for efficiency
reasons) has not been treated to its full extent. In this paper, we address the
pitfall associated with this situation, that the classical EDMD algorithm does
not automatically provide a Koopman operator approximation for the underlying
system if we do not carefully select the number of observables. Moreover, we show
that symmetries in the system dynamics can be carried over to the Koopman operator,
which allows us to massively increase the model efficiency. We also briefly draw
a connection to domain decomposition techniques for partial differential equations
and present numerical evidence using the Kuramoto--Sivashinsky equation."
author:
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
- first_name: Hans
full_name: Harder, Hans
id: '98879'
last_name: Harder
- first_name: Feliks
full_name: Nüske, Feliks
last_name: Nüske
- 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
citation:
ama: Peitz S, Harder H, Nüske F, Philipp F, Schaller M, Worthmann K. Partial observations,
coarse graining and equivariance in Koopman operator theory for large-scale dynamical
systems. arXiv:230715325. Published online 2023.
apa: Peitz, S., Harder, H., Nüske, F., Philipp, F., Schaller, M., & Worthmann,
K. (2023). Partial observations, coarse graining and equivariance in Koopman
operator theory for large-scale dynamical systems. In arXiv:2307.15325.
bibtex: '@article{Peitz_Harder_Nüske_Philipp_Schaller_Worthmann_2023, title={Partial
observations, coarse graining and equivariance in Koopman operator theory for
large-scale dynamical systems}, journal={arXiv:2307.15325}, author={Peitz, Sebastian
and Harder, Hans and Nüske, Feliks and Philipp, Friedrich and Schaller, Manuel
and Worthmann, Karl}, year={2023} }'
chicago: Peitz, Sebastian, Hans Harder, Feliks Nüske, Friedrich Philipp, Manuel
Schaller, and Karl Worthmann. “Partial Observations, Coarse Graining and Equivariance
in Koopman Operator Theory for Large-Scale Dynamical Systems.” ArXiv:2307.15325,
2023.
ieee: S. Peitz, H. Harder, F. Nüske, F. Philipp, M. Schaller, and K. Worthmann,
“Partial observations, coarse graining and equivariance in Koopman operator theory
for large-scale dynamical systems,” arXiv:2307.15325. 2023.
mla: Peitz, Sebastian, et al. “Partial Observations, Coarse Graining and Equivariance
in Koopman Operator Theory for Large-Scale Dynamical Systems.” ArXiv:2307.15325,
2023.
short: S. Peitz, H. Harder, F. Nüske, F. Philipp, M. Schaller, K. Worthmann, ArXiv:2307.15325
(2023).
date_created: 2023-08-21T05:52:24Z
date_updated: 2023-08-21T05:53:35Z
department:
- _id: '655'
external_id:
arxiv:
- '2307.15325'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2307.15325
oa: '1'
publication: arXiv:2307.15325
status: public
title: Partial observations, coarse graining and equivariance in Koopman operator
theory for large-scale dynamical systems
type: preprint
user_id: '47427'
year: '2023'
...
---
_id: '23428'
abstract:
- lang: eng
text: "The Koopman operator has become an essential tool for data-driven approximation
of dynamical (control) systems in recent years, e.g., via extended dynamic mode
decomposition. Despite its popularity, convergence results and, in particular,
error bounds are still quite scarce. In this paper, we derive probabilistic bounds
for the approximation error and the prediction error depending on the number of
training data points; for both ordinary and stochastic differential equations.
Moreover, we extend our analysis to nonlinear control-affine systems using either
ergodic trajectories or i.i.d.\r\nsamples. Here, we exploit the linearity of the
Koopman generator to obtain a bilinear system and, thus, circumvent the curse
of dimensionality since we do not autonomize the system by augmenting the state
by the control inputs. To the\r\nbest of our knowledge, this is the first finite-data
error analysis in the stochastic and/or control setting. Finally, we demonstrate
the effectiveness of the proposed approach by comparing it with state-of-the-art
techniques showing its superiority whenever state and control are coupled."
article_number: '14'
author:
- first_name: Feliks
full_name: Nüske, Feliks
id: '81513'
last_name: Nüske
orcid: 0000-0003-2444-7889
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
- 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
citation:
ama: Nüske F, Peitz S, Philipp F, Schaller M, Worthmann K. Finite-data error bounds
for Koopman-based prediction and control. Journal of Nonlinear Science.
2023;33. doi:10.1007/s00332-022-09862-1
apa: Nüske, F., Peitz, S., Philipp, F., Schaller, M., & Worthmann, K. (2023).
Finite-data error bounds for Koopman-based prediction and control. Journal
of Nonlinear Science, 33, Article 14. https://doi.org/10.1007/s00332-022-09862-1
bibtex: '@article{Nüske_Peitz_Philipp_Schaller_Worthmann_2023, title={Finite-data
error bounds for Koopman-based prediction and control}, volume={33}, DOI={10.1007/s00332-022-09862-1},
number={14}, journal={Journal of Nonlinear Science}, author={Nüske, Feliks and
Peitz, Sebastian and Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl},
year={2023} }'
chicago: Nüske, Feliks, Sebastian Peitz, Friedrich Philipp, Manuel Schaller, and
Karl Worthmann. “Finite-Data Error Bounds for Koopman-Based Prediction and Control.”
Journal of Nonlinear Science 33 (2023). https://doi.org/10.1007/s00332-022-09862-1.
ieee: 'F. Nüske, S. Peitz, F. Philipp, M. Schaller, and K. Worthmann, “Finite-data
error bounds for Koopman-based prediction and control,” Journal of Nonlinear
Science, vol. 33, Art. no. 14, 2023, doi: 10.1007/s00332-022-09862-1.'
mla: Nüske, Feliks, et al. “Finite-Data Error Bounds for Koopman-Based Prediction
and Control.” Journal of Nonlinear Science, vol. 33, 14, 2023, doi:10.1007/s00332-022-09862-1.
short: F. Nüske, S. Peitz, F. Philipp, M. Schaller, K. Worthmann, Journal of Nonlinear
Science 33 (2023).
date_created: 2021-08-17T12:25:09Z
date_updated: 2023-08-24T07:50:12Z
department:
- _id: '101'
- _id: '655'
doi: 10.1007/s00332-022-09862-1
intvolume: ' 33'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/content/pdf/10.1007/s00332-022-09862-1.pdf
oa: '1'
publication: Journal of Nonlinear Science
publication_status: published
status: public
title: Finite-data error bounds for Koopman-based prediction and control
type: journal_article
user_id: '47427'
volume: 33
year: '2023'
...
---
_id: '21600'
abstract:
- lang: eng
text: Many problems in science and engineering require an efficient numerical approximation
of integrals or solutions to differential equations. For systems with rapidly
changing dynamics, an equidistant discretization is often inadvisable as it results
in prohibitively large errors or computational effort. To this end, adaptive schemes,
such as solvers based on Runge–Kutta pairs, have been developed which adapt the
step size based on local error estimations at each step. While the classical schemes
apply very generally and are highly efficient on regular systems, they can behave
suboptimally when an inefficient step rejection mechanism is triggered by structurally
complex systems such as chaotic systems. To overcome these issues, we propose
a method to tailor numerical schemes to the problem class at hand. This is achieved
by combining simple, classical quadrature rules or ODE solvers with data-driven
time-stepping controllers. Compared with learning solution operators to ODEs directly,
it generalizes better to unseen initial data as our approach employs classical
numerical schemes as base methods. At the same time it can make use of identified
structures of a problem class and, therefore, outperforms state-of-the-art adaptive
schemes. Several examples demonstrate superior efficiency. Source code is available
at https://github.com/lueckem/quadrature-ML.
author:
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Marvin
full_name: Lücke, Marvin
last_name: Lücke
- 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
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
- first_name: Karlson
full_name: Pfannschmidt, Karlson
id: '13472'
last_name: Pfannschmidt
orcid: 0000-0001-9407-7903
citation:
ama: Dellnitz M, Hüllermeier E, Lücke M, et al. Efficient time stepping for numerical
integration using reinforcement learning. SIAM Journal on Scientific Computing.
2023;45(2):A579-A595. doi:10.1137/21M1412682
apa: Dellnitz, M., Hüllermeier, E., Lücke, M., Ober-Blöbaum, S., Offen, C., Peitz,
S., & Pfannschmidt, K. (2023). Efficient time stepping for numerical integration
using reinforcement learning. SIAM Journal on Scientific Computing, 45(2),
A579–A595. https://doi.org/10.1137/21M1412682
bibtex: '@article{Dellnitz_Hüllermeier_Lücke_Ober-Blöbaum_Offen_Peitz_Pfannschmidt_2023,
title={Efficient time stepping for numerical integration using reinforcement
learning}, volume={45}, DOI={10.1137/21M1412682},
number={2}, journal={SIAM Journal on Scientific Computing}, author={Dellnitz,
Michael and Hüllermeier, Eyke and Lücke, Marvin and Ober-Blöbaum, Sina and Offen,
Christian and Peitz, Sebastian and Pfannschmidt, Karlson}, year={2023}, pages={A579–A595}
}'
chicago: 'Dellnitz, Michael, Eyke Hüllermeier, Marvin Lücke, Sina Ober-Blöbaum,
Christian Offen, Sebastian Peitz, and Karlson Pfannschmidt. “Efficient Time Stepping
for Numerical Integration Using Reinforcement Learning.” SIAM Journal on Scientific
Computing 45, no. 2 (2023): A579–95. https://doi.org/10.1137/21M1412682.'
ieee: 'M. Dellnitz et al., “Efficient time stepping for numerical integration
using reinforcement learning,” SIAM Journal on Scientific Computing, vol.
45, no. 2, pp. A579–A595, 2023, doi: 10.1137/21M1412682.'
mla: Dellnitz, Michael, et al. “Efficient Time Stepping for Numerical Integration
Using Reinforcement Learning.” SIAM Journal on Scientific Computing, vol.
45, no. 2, 2023, pp. A579–95, doi:10.1137/21M1412682.
short: M. Dellnitz, E. Hüllermeier, M. Lücke, S. Ober-Blöbaum, C. Offen, S. Peitz,
K. Pfannschmidt, SIAM Journal on Scientific Computing 45 (2023) A579–A595.
date_created: 2021-04-09T07:59:19Z
date_updated: 2023-08-25T09:24:50Z
ddc:
- '510'
department:
- _id: '101'
- _id: '636'
- _id: '355'
- _id: '655'
doi: 10.1137/21M1412682
external_id:
arxiv:
- arXiv:2104.03562
has_accepted_license: '1'
intvolume: ' 45'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://epubs.siam.org/doi/reader/10.1137/21M1412682
page: A579-A595
publication: SIAM Journal on Scientific Computing
publication_status: published
related_material:
link:
- description: GitHub
relation: software
url: https://github.com/lueckem/quadrature-ML
status: public
title: Efficient time stepping for numerical integration using reinforcement learning
type: journal_article
user_id: '47427'
volume: 45
year: '2023'
...