---
_id: '33253'
author:
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
- first_name: Mathis
full_name: Brede, Mathis
last_name: Brede
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Hansmeier T, Brede M, Platzner M. XCS on Embedded Systems: An Analysis of
Execution Profiles and Accelerated Classifier Deletion. In: GECCO ’22: Proceedings
of the Genetic and Evolutionary Computation Conference Companion. Association
for Computing Machinery (ACM); 2022:2071-2079. doi:10.1145/3520304.3533977'
apa: 'Hansmeier, T., Brede, M., & Platzner, M. (2022). XCS on Embedded Systems:
An Analysis of Execution Profiles and Accelerated Classifier Deletion. GECCO
’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion,
2071–2079. https://doi.org/10.1145/3520304.3533977'
bibtex: '@inproceedings{Hansmeier_Brede_Platzner_2022, place={New York, NY, United
States}, title={XCS on Embedded Systems: An Analysis of Execution Profiles and
Accelerated Classifier Deletion}, DOI={10.1145/3520304.3533977},
booktitle={GECCO ’22: Proceedings of the Genetic and Evolutionary Computation
Conference Companion}, publisher={Association for Computing Machinery (ACM)},
author={Hansmeier, Tim and Brede, Mathis and Platzner, Marco}, year={2022}, pages={2071–2079}
}'
chicago: 'Hansmeier, Tim, Mathis Brede, and Marco Platzner. “XCS on Embedded Systems:
An Analysis of Execution Profiles and Accelerated Classifier Deletion.” In GECCO
’22: Proceedings of the Genetic and Evolutionary Computation Conference Companion,
2071–79. New York, NY, United States: Association for Computing Machinery (ACM),
2022. https://doi.org/10.1145/3520304.3533977.'
ieee: 'T. Hansmeier, M. Brede, and M. Platzner, “XCS on Embedded Systems: An Analysis
of Execution Profiles and Accelerated Classifier Deletion,” in GECCO ’22: Proceedings
of the Genetic and Evolutionary Computation Conference Companion, Boston,
MA, USA, 2022, pp. 2071–2079, doi: 10.1145/3520304.3533977.'
mla: 'Hansmeier, Tim, et al. “XCS on Embedded Systems: An Analysis of Execution
Profiles and Accelerated Classifier Deletion.” GECCO ’22: Proceedings of the
Genetic and Evolutionary Computation Conference Companion, Association for
Computing Machinery (ACM), 2022, pp. 2071–79, doi:10.1145/3520304.3533977.'
short: 'T. Hansmeier, M. Brede, M. Platzner, in: GECCO ’22: Proceedings of the Genetic
and Evolutionary Computation Conference Companion, Association for Computing Machinery
(ACM), New York, NY, United States, 2022, pp. 2071–2079.'
conference:
end_date: 2022-07-13
location: Boston, MA, USA
name: International Workshop on Learning Classifier Systems (IWLCS 2022)
start_date: 2022-07-09
date_created: 2022-09-02T11:47:17Z
date_updated: 2022-11-18T10:13:22Z
department:
- _id: '78'
doi: 10.1145/3520304.3533977
language:
- iso: eng
page: 2071-2079
place: New York, NY, United States
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 'GECCO ''22: Proceedings of the Genetic and Evolutionary Computation
Conference Companion'
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: 'XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated
Classifier Deletion'
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33274'
author:
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Mei-Hua
full_name: Chen, Mei-Hua
last_name: Chen
- first_name: Garima
full_name: Mudgal, Garima
last_name: Mudgal
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument
Structures in Learner Essays. In: Proceedings of the 9th Workshop on Argument
Mining (ArgMining 2022). ; 2022:51-61.'
apa: Chen, W.-F., Chen, M.-H., Mudgal, G., & Wachsmuth, H. (2022). Analyzing
Culture-Specific Argument Structures in Learner Essays. Proceedings of the
9th Workshop on Argument Mining (ArgMining 2022), 51–61.
bibtex: '@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific
Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop
on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua
and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }'
chicago: Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing
Culture-Specific Argument Structures in Learner Essays.” In Proceedings of
the 9th Workshop on Argument Mining (ArgMining 2022), 51–61, 2022.
ieee: W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific
Argument Structures in Learner Essays,” in Proceedings of the 9th Workshop
on Argument Mining (ArgMining 2022), 2022, pp. 51–61.
mla: Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner
Essays.” Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022),
2022, pp. 51–61.
short: 'W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the
9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.'
date_created: 2022-09-06T13:51:23Z
date_updated: 2022-11-18T09:56:17Z
department:
- _id: '600'
language:
- iso: eng
page: 51 - 61
project:
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
publication: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)
status: public
title: Analyzing Culture-Specific Argument Structures in Learner Essays
type: conference
user_id: '477'
year: '2022'
...
---
_id: '33491'
author:
- 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: Anna Rodriguez
full_name: Rasmussen, Anna Rodriguez
last_name: Rasmussen
citation:
ama: 'Maack M, Pukrop S, Rasmussen AR. (In-)Approximability Results for Interval,
Resource Restricted, and Low Rank Scheduling. In: Chechik S, Navarro G, Rotenberg
E, Herman G, eds. 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany. Vol 244. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2022:77:1–77:13. doi:10.4230/LIPIcs.ESA.2022.77'
apa: Maack, M., Pukrop, S., & Rasmussen, A. R. (2022). (In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling. In S. Chechik,
G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium
on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany (Vol.
244, p. 77:1–77:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.77
bibtex: '@inproceedings{Maack_Pukrop_Rasmussen_2022, series={LIPIcs}, title={(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling}, volume={244},
DOI={10.4230/LIPIcs.ESA.2022.77},
booktitle={30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez},
editor={Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz},
year={2022}, pages={77:1–77:13}, collection={LIPIcs} }'
chicago: Maack, Marten, Simon Pukrop, and Anna Rodriguez Rasmussen. “(In-)Approximability
Results for Interval, Resource Restricted, and Low Rank Scheduling.” In 30th
Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam,
Germany, edited by Shiri Chechik, Gonzalo Navarro, Eva Rotenberg, and Grzegorz
Herman, 244:77:1–77:13. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022. https://doi.org/10.4230/LIPIcs.ESA.2022.77.
ieee: 'M. Maack, S. Pukrop, and A. R. Rasmussen, “(In-)Approximability Results for
Interval, Resource Restricted, and Low Rank Scheduling,” in 30th Annual European
Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany,
2022, vol. 244, p. 77:1–77:13, doi: 10.4230/LIPIcs.ESA.2022.77.'
mla: Maack, Marten, et al. “(In-)Approximability Results for Interval, Resource
Restricted, and Low Rank Scheduling.” 30th Annual European Symposium on Algorithms,
ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany, edited by Shiri Chechik
et al., vol. 244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p.
77:1–77:13, doi:10.4230/LIPIcs.ESA.2022.77.
short: 'M. Maack, S. Pukrop, A.R. Rasmussen, in: S. Chechik, G. Navarro, E. Rotenberg,
G. Herman (Eds.), 30th Annual European Symposium on Algorithms, ESA 2022, September
5-9, 2022, Berlin/Potsdam, Germany, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 77:1–77:13.'
date_created: 2022-09-27T13:06:05Z
date_updated: 2022-11-18T10:14:14Z
department:
- _id: '63'
doi: 10.4230/LIPIcs.ESA.2022.77
editor:
- first_name: Shiri
full_name: Chechik, Shiri
last_name: Chechik
- first_name: Gonzalo
full_name: Navarro, Gonzalo
last_name: Navarro
- first_name: Eva
full_name: Rotenberg, Eva
last_name: Rotenberg
- first_name: Grzegorz
full_name: Herman, Grzegorz
last_name: Herman
intvolume: ' 244'
language:
- iso: eng
page: 77:1–77:13
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
publication: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9,
2022, Berlin/Potsdam, Germany
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: (In-)Approximability Results for Interval, Resource Restricted, and Low Rank
Scheduling
type: conference
user_id: '477'
volume: 244
year: '2022'
...
---
_id: '29769'
abstract:
- lang: eng
text: 'Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender
Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe
zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden
zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in
eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können
auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei
zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen
oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt
sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren
Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung
von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers
mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen
den Trojaner ``Heimtückische LUT'''' stellen wir die allererste erfolgreiche Gegenmaßnahme
vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene
direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren
ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen
für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher
bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom
in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff
zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer
vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.'
- lang: eng
text: The battle of developing hardware Trojans and corresponding countermeasures
has taken adversaries towards ingenious ways of compromising hardware designs
by circumventing even advanced testing and verification methods. Besides conventional
methods of inserting Trojans into a design by a malicious entity, the design flow
for field-programmable gate arrays (FPGAs) can also be surreptitiously compromised
to assist the attacker to perform a successful malfunctioning or information leakage
attack. This thesis mainly focuses on the two aspects of hardware Trojans in reconfigurable
systems, the defenders perspective which corresponds to the bitstream-level Trojan
detection technique, and the attackers perspective which corresponds to a novel
FPGA Trojan attack. From the defender's perspective, we introduce a first-ever
successful pre-configuration countermeasure against the ``Malicious LUT''-hardware
Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH) and present
the complete design-and-verification flow for iCE40 FPGAs. Likewise, from an attackers
perspective, we present a novel attack that leverages malicious routing of the
inserted Trojan circuit to acquire a dormant state even in the generated and transmitted
bitstream. Since the Trojan is injected in a post-synthesis step and remains unconnected
in the bitstream, the presented attack can currently neither be prevented by conventional
testing and verification methods nor by bitstream-level verification techniques.
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
citation:
ama: Ahmed QA. Hardware Trojans in Reconfigurable Computing. Paderborn University,
Paderborn, Germany; 2022. doi:10.17619/UNIPB/1-1271
apa: Ahmed, Q. A. (2022). Hardware Trojans in Reconfigurable Computing. Paderborn
University, Paderborn, Germany. https://doi.org/10.17619/UNIPB/1-1271
bibtex: '@book{Ahmed_2022, place={Paderborn}, title={Hardware Trojans in Reconfigurable
Computing}, DOI={10.17619/UNIPB/1-1271},
publisher={ Paderborn University, Paderborn, Germany}, author={Ahmed, Qazi Arbab},
year={2022} }'
chicago: 'Ahmed, Qazi Arbab. Hardware Trojans in Reconfigurable Computing.
Paderborn: Paderborn University, Paderborn, Germany, 2022. https://doi.org/10.17619/UNIPB/1-1271.'
ieee: 'Q. A. Ahmed, Hardware Trojans in Reconfigurable Computing. Paderborn: Paderborn
University, Paderborn, Germany, 2022.'
mla: Ahmed, Qazi Arbab. Hardware Trojans in Reconfigurable Computing. Paderborn
University, Paderborn, Germany, 2022, doi:10.17619/UNIPB/1-1271.
short: Q.A. Ahmed, Hardware Trojans in Reconfigurable Computing, Paderborn University,
Paderborn, Germany, Paderborn, 2022.
date_created: 2022-02-07T14:02:36Z
date_updated: 2022-11-30T13:39:01Z
ddc:
- '004'
department:
- _id: '78'
doi: 10.17619/UNIPB/1-1271
has_accepted_license: '1'
keyword:
- FPGA Security
- Hardware Trojans
- Bitstream-level Trojans
- Bitstream Verification
language:
- iso: eng
main_file_link:
- open_access: '1'
url: "\turn:nbn:de:hbz:466:2-40303"
oa: '1'
place: Paderborn
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '14'
name: 'SFB 901 - C2: SFB 901 - Subproject C2'
publication_status: published
publisher: ' Paderborn University, Paderborn, Germany'
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
title: Hardware Trojans in Reconfigurable Computing
type: dissertation
user_id: '477'
year: '2022'
...
---
_id: '34197'
abstract:
- lang: eng
text: AbstractComprehensive data understanding
is a key success driver for data analytics projects. Knowing the characteristics
of the data helps a lot in selecting the appropriate data analysis techniques.
Especially in data-driven product planning, knowledge about the data is a necessary
prerequisite because data of the use phase is very heterogeneous. However, companies
often do not have the necessary know-how or time to build up solid data understanding
in connection with data analysis. In this paper, we develop a methodology to organize
and categorize and thus understand use phase data in a way that makes it accessible
to general data analytics workflows, following a design science research approach.
We first present a knowledge base that lists typical use phase data from a product
planning view. Second, we develop a taxonomy based on standard literature and
real data objects, which covers the diversity of the data considered. The taxonomy
provides 8 dimensions that support classification of use phase data and allows
to capture data characteristics from a data analytics view. Finally, we combine
both views by clustering the objects of the knowledge base according to the taxonomy.
Each of the resulting clusters covers a typical combination of analytics relevant
characteristics occurring in practice. By abstracting from the diversity of use
phase data into artifacts with manageable complexity, our approach provides guidance
to choose appropriate data analysis and AI techniques.
author:
- first_name: Melina
full_name: Panzner, Melina
last_name: Panzner
- first_name: Sebastian
full_name: von Enzberg, Sebastian
last_name: von Enzberg
- first_name: Maurice
full_name: Meyer, Maurice
last_name: Meyer
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
citation:
ama: Panzner M, von Enzberg S, Meyer M, Dumitrescu R. Characterization of Usage
Data with the Help of Data Classifications. Journal of the Knowledge Economy.
Published online 2022. doi:10.1007/s13132-022-01081-z
apa: Panzner, M., von Enzberg, S., Meyer, M., & Dumitrescu, R. (2022). Characterization
of Usage Data with the Help of Data Classifications. Journal of the Knowledge
Economy. https://doi.org/10.1007/s13132-022-01081-z
bibtex: '@article{Panzner_von Enzberg_Meyer_Dumitrescu_2022, title={Characterization
of Usage Data with the Help of Data Classifications}, DOI={10.1007/s13132-022-01081-z},
journal={Journal of the Knowledge Economy}, publisher={Springer Science and Business
Media LLC}, author={Panzner, Melina and von Enzberg, Sebastian and Meyer, Maurice
and Dumitrescu, Roman}, year={2022} }'
chicago: Panzner, Melina, Sebastian von Enzberg, Maurice Meyer, and Roman Dumitrescu.
“Characterization of Usage Data with the Help of Data Classifications.” Journal
of the Knowledge Economy, 2022. https://doi.org/10.1007/s13132-022-01081-z.
ieee: 'M. Panzner, S. von Enzberg, M. Meyer, and R. Dumitrescu, “Characterization
of Usage Data with the Help of Data Classifications,” Journal of the Knowledge
Economy, 2022, doi: 10.1007/s13132-022-01081-z.'
mla: Panzner, Melina, et al. “Characterization of Usage Data with the Help of Data
Classifications.” Journal of the Knowledge Economy, Springer Science and
Business Media LLC, 2022, doi:10.1007/s13132-022-01081-z.
short: M. Panzner, S. von Enzberg, M. Meyer, R. Dumitrescu, Journal of the Knowledge
Economy (2022).
date_created: 2022-12-05T12:49:56Z
date_updated: 2022-12-05T12:51:03Z
department:
- _id: '563'
doi: 10.1007/s13132-022-01081-z
keyword:
- Economics and Econometrics
language:
- iso: eng
publication: Journal of the Knowledge Economy
publication_identifier:
issn:
- 1868-7865
- 1868-7873
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Characterization of Usage Data with the Help of Data Classifications
type: journal_article
user_id: '15782'
year: '2022'
...
---
_id: '34196'
abstract:
- lang: eng
text: Mounting sensors in disk stack separators is often a major challenge
due to the operating conditions. However, a process cannot be optimally monitored
without sensors. Virtual sensors can be a solution to calculate the sought parameters
from measurable values. We measured the vibrations of disk stack separators and
applied machine learning (ML) to detect whether the separator contains only water
or whether particles are also present. We combined seven ML classification algorithms
with three feature engineering strategies and evaluated our model successfully
on vibration data of an experimental disk stack separator. Our experimental results
demonstrate that random forest in combination with manual feature engineering
using domain specific knowledge about suitable features outperforms all other
models with an accuracy of 91.27 %.
author:
- first_name: Silke
full_name: Merkelbach, Silke
last_name: Merkelbach
- first_name: Lameya
full_name: Afroze, Lameya
last_name: Afroze
- first_name: Nils
full_name: Janssen, Nils
last_name: Janssen
- first_name: Sebastian
full_name: von Enzberg, Sebastian
last_name: von Enzberg
- first_name: Arno
full_name: Kühn, Arno
last_name: Kühn
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
citation:
ama: Merkelbach S, Afroze L, Janssen N, von Enzberg S, Kühn A, Dumitrescu R. Using
vibration data to classify conditions in disk stack separators. Vibroengineering
PROCEDIA. 2022;46:21-26. doi:10.21595/vp.2022.23000
apa: Merkelbach, S., Afroze, L., Janssen, N., von Enzberg, S., Kühn, A., & Dumitrescu,
R. (2022). Using vibration data to classify conditions in disk stack separators.
Vibroengineering PROCEDIA, 46, 21–26. https://doi.org/10.21595/vp.2022.23000
bibtex: '@article{Merkelbach_Afroze_Janssen_von Enzberg_Kühn_Dumitrescu_2022, title={Using
vibration data to classify conditions in disk stack separators}, volume={46},
DOI={10.21595/vp.2022.23000},
journal={Vibroengineering PROCEDIA}, publisher={JVE International Ltd.}, author={Merkelbach,
Silke and Afroze, Lameya and Janssen, Nils and von Enzberg, Sebastian and Kühn,
Arno and Dumitrescu, Roman}, year={2022}, pages={21–26} }'
chicago: 'Merkelbach, Silke, Lameya Afroze, Nils Janssen, Sebastian von Enzberg,
Arno Kühn, and Roman Dumitrescu. “Using Vibration Data to Classify Conditions
in Disk Stack Separators.” Vibroengineering PROCEDIA 46 (2022): 21–26.
https://doi.org/10.21595/vp.2022.23000.'
ieee: 'S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, and R. Dumitrescu,
“Using vibration data to classify conditions in disk stack separators,” Vibroengineering
PROCEDIA, vol. 46, pp. 21–26, 2022, doi: 10.21595/vp.2022.23000.'
mla: Merkelbach, Silke, et al. “Using Vibration Data to Classify Conditions in Disk
Stack Separators.” Vibroengineering PROCEDIA, vol. 46, JVE International
Ltd., 2022, pp. 21–26, doi:10.21595/vp.2022.23000.
short: S. Merkelbach, L. Afroze, N. Janssen, S. von Enzberg, A. Kühn, R. Dumitrescu,
Vibroengineering PROCEDIA 46 (2022) 21–26.
date_created: 2022-12-05T12:47:22Z
date_updated: 2022-12-05T12:51:08Z
department:
- _id: '563'
doi: 10.21595/vp.2022.23000
intvolume: ' 46'
keyword:
- General Medicine
language:
- iso: eng
page: 21-26
publication: Vibroengineering PROCEDIA
publication_identifier:
issn:
- 2345-0533
- 2538-8479
publication_status: published
publisher: JVE International Ltd.
status: public
title: Using vibration data to classify conditions in disk stack separators
type: journal_article
user_id: '15782'
volume: 46
year: '2022'
...
---
_id: '34195'
author:
- first_name: Daniela
full_name: Hobscheidt, Daniela
last_name: Hobscheidt
- first_name: Jörn Steffen
full_name: Menzefricke, Jörn Steffen
last_name: Menzefricke
- first_name: Stefan
full_name: Gabriel, Stefan
last_name: Gabriel
- first_name: Arno
full_name: Kühn, Arno
last_name: Kühn
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
citation:
ama: 'Hobscheidt D, Menzefricke JS, Gabriel S, Kühn A, Dumitrescu R. Soziotechnische
Herausforderungen bei der Einführung von RPA managen. In: Praxishandbuch Robotic
Process Automation (RPA). Springer Fachmedien Wiesbaden; 2022. doi:10.1007/978-3-658-38379-4_8'
apa: Hobscheidt, D., Menzefricke, J. S., Gabriel, S., Kühn, A., & Dumitrescu,
R. (2022). Soziotechnische Herausforderungen bei der Einführung von RPA managen.
In Praxishandbuch Robotic Process Automation (RPA). Springer Fachmedien
Wiesbaden. https://doi.org/10.1007/978-3-658-38379-4_8
bibtex: '@inbook{Hobscheidt_Menzefricke_Gabriel_Kühn_Dumitrescu_2022, place={Wiesbaden},
title={Soziotechnische Herausforderungen bei der Einführung von RPA managen},
DOI={10.1007/978-3-658-38379-4_8},
booktitle={Praxishandbuch Robotic Process Automation (RPA)}, publisher={Springer
Fachmedien Wiesbaden}, author={Hobscheidt, Daniela and Menzefricke, Jörn Steffen
and Gabriel, Stefan and Kühn, Arno and Dumitrescu, Roman}, year={2022} }'
chicago: 'Hobscheidt, Daniela, Jörn Steffen Menzefricke, Stefan Gabriel, Arno Kühn,
and Roman Dumitrescu. “Soziotechnische Herausforderungen Bei Der Einführung von
RPA Managen.” In Praxishandbuch Robotic Process Automation (RPA). Wiesbaden:
Springer Fachmedien Wiesbaden, 2022. https://doi.org/10.1007/978-3-658-38379-4_8.'
ieee: 'D. Hobscheidt, J. S. Menzefricke, S. Gabriel, A. Kühn, and R. Dumitrescu,
“Soziotechnische Herausforderungen bei der Einführung von RPA managen,” in Praxishandbuch
Robotic Process Automation (RPA), Wiesbaden: Springer Fachmedien Wiesbaden,
2022.'
mla: Hobscheidt, Daniela, et al. “Soziotechnische Herausforderungen Bei Der Einführung
von RPA Managen.” Praxishandbuch Robotic Process Automation (RPA), Springer
Fachmedien Wiesbaden, 2022, doi:10.1007/978-3-658-38379-4_8.
short: 'D. Hobscheidt, J.S. Menzefricke, S. Gabriel, A. Kühn, R. Dumitrescu, in:
Praxishandbuch Robotic Process Automation (RPA), Springer Fachmedien Wiesbaden,
Wiesbaden, 2022.'
date_created: 2022-12-05T12:46:56Z
date_updated: 2022-12-05T12:51:11Z
department:
- _id: '563'
doi: 10.1007/978-3-658-38379-4_8
language:
- iso: eng
place: Wiesbaden
publication: Praxishandbuch Robotic Process Automation (RPA)
publication_identifier:
isbn:
- '9783658383787'
- '9783658383794'
publication_status: published
publisher: Springer Fachmedien Wiesbaden
status: public
title: Soziotechnische Herausforderungen bei der Einführung von RPA managen
type: book_chapter
user_id: '15782'
year: '2022'
...
---
_id: '34193'
author:
- first_name: Michael
full_name: Bansmann, Michael
last_name: Bansmann
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
- first_name: Christian
full_name: Fechtelpeter, Christian
last_name: Fechtelpeter
citation:
ama: 'Bansmann M, Dumitrescu R, Fechtelpeter C. Transfer von Arbeit 4.0-Anwendungsszenarien.
In: Gestaltung Digitalisierter Arbeitswelten. Springer Berlin Heidelberg;
2022. doi:10.1007/978-3-662-58014-1_3'
apa: Bansmann, M., Dumitrescu, R., & Fechtelpeter, C. (2022). Transfer von Arbeit
4.0-Anwendungsszenarien. In Gestaltung digitalisierter Arbeitswelten. Springer
Berlin Heidelberg. https://doi.org/10.1007/978-3-662-58014-1_3
bibtex: '@inbook{Bansmann_Dumitrescu_Fechtelpeter_2022, place={Berlin, Heidelberg},
title={Transfer von Arbeit 4.0-Anwendungsszenarien}, DOI={10.1007/978-3-662-58014-1_3},
booktitle={Gestaltung digitalisierter Arbeitswelten}, publisher={Springer Berlin
Heidelberg}, author={Bansmann, Michael and Dumitrescu, Roman and Fechtelpeter,
Christian}, year={2022} }'
chicago: 'Bansmann, Michael, Roman Dumitrescu, and Christian Fechtelpeter. “Transfer
von Arbeit 4.0-Anwendungsszenarien.” In Gestaltung Digitalisierter Arbeitswelten.
Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. https://doi.org/10.1007/978-3-662-58014-1_3.'
ieee: 'M. Bansmann, R. Dumitrescu, and C. Fechtelpeter, “Transfer von Arbeit 4.0-Anwendungsszenarien,”
in Gestaltung digitalisierter Arbeitswelten, Berlin, Heidelberg: Springer
Berlin Heidelberg, 2022.'
mla: Bansmann, Michael, et al. “Transfer von Arbeit 4.0-Anwendungsszenarien.” Gestaltung
Digitalisierter Arbeitswelten, Springer Berlin Heidelberg, 2022, doi:10.1007/978-3-662-58014-1_3.
short: 'M. Bansmann, R. Dumitrescu, C. Fechtelpeter, in: Gestaltung Digitalisierter
Arbeitswelten, Springer Berlin Heidelberg, Berlin, Heidelberg, 2022.'
date_created: 2022-12-05T12:45:43Z
date_updated: 2022-12-05T12:51:19Z
department:
- _id: '563'
doi: 10.1007/978-3-662-58014-1_3
language:
- iso: eng
place: Berlin, Heidelberg
publication: Gestaltung digitalisierter Arbeitswelten
publication_identifier:
isbn:
- '9783662580134'
- '9783662580141'
issn:
- 2523-3637
- 2523-3645
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Transfer von Arbeit 4.0-Anwendungsszenarien
type: book_chapter
user_id: '15782'
year: '2022'
...
---
_id: '34194'
author:
- first_name: Jonathan
full_name: Brock, Jonathan
last_name: Brock
- first_name: Sebastian
full_name: von Enzberg, Sebastian
last_name: von Enzberg
- first_name: Arno
full_name: Kühn, Arno
last_name: Kühn
- first_name: Roman
full_name: Dumitrescu, Roman
last_name: Dumitrescu
citation:
ama: 'Brock J, von Enzberg S, Kühn A, Dumitrescu R. Nutzung von Process Mining in
RPA-Projekten. In: Praxishandbuch Robotic Process Automation (RPA). Springer
Fachmedien Wiesbaden; 2022. doi:10.1007/978-3-658-38379-4_5'
apa: Brock, J., von Enzberg, S., Kühn, A., & Dumitrescu, R. (2022). Nutzung
von Process Mining in RPA-Projekten. In Praxishandbuch Robotic Process Automation
(RPA). Springer Fachmedien Wiesbaden. https://doi.org/10.1007/978-3-658-38379-4_5
bibtex: '@inbook{Brock_von Enzberg_Kühn_Dumitrescu_2022, place={Wiesbaden}, title={Nutzung
von Process Mining in RPA-Projekten}, DOI={10.1007/978-3-658-38379-4_5},
booktitle={Praxishandbuch Robotic Process Automation (RPA)}, publisher={Springer
Fachmedien Wiesbaden}, author={Brock, Jonathan and von Enzberg, Sebastian and
Kühn, Arno and Dumitrescu, Roman}, year={2022} }'
chicago: 'Brock, Jonathan, Sebastian von Enzberg, Arno Kühn, and Roman Dumitrescu.
“Nutzung von Process Mining in RPA-Projekten.” In Praxishandbuch Robotic Process
Automation (RPA). Wiesbaden: Springer Fachmedien Wiesbaden, 2022. https://doi.org/10.1007/978-3-658-38379-4_5.'
ieee: 'J. Brock, S. von Enzberg, A. Kühn, and R. Dumitrescu, “Nutzung von Process
Mining in RPA-Projekten,” in Praxishandbuch Robotic Process Automation (RPA),
Wiesbaden: Springer Fachmedien Wiesbaden, 2022.'
mla: Brock, Jonathan, et al. “Nutzung von Process Mining in RPA-Projekten.” Praxishandbuch
Robotic Process Automation (RPA), Springer Fachmedien Wiesbaden, 2022, doi:10.1007/978-3-658-38379-4_5.
short: 'J. Brock, S. von Enzberg, A. Kühn, R. Dumitrescu, in: Praxishandbuch Robotic
Process Automation (RPA), Springer Fachmedien Wiesbaden, Wiesbaden, 2022.'
date_created: 2022-12-05T12:46:26Z
date_updated: 2022-12-05T12:51:14Z
department:
- _id: '563'
doi: 10.1007/978-3-658-38379-4_5
language:
- iso: eng
place: Wiesbaden
publication: Praxishandbuch Robotic Process Automation (RPA)
publication_identifier:
isbn:
- '9783658383787'
- '9783658383794'
publication_status: published
publisher: Springer Fachmedien Wiesbaden
status: public
title: Nutzung von Process Mining in RPA-Projekten
type: book_chapter
user_id: '15782'
year: '2022'
...
---
_id: '34292'
author:
- first_name: Dennis
full_name: Wolters, Dennis
id: '11308'
last_name: Wolters
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Wolters D, Engels G. Towards Situational Process Management for Professional
Education Programmes. In: Taibi D, Kuhrmann M, Mikkonen T, Klünder J, Abrahamsson
P, eds. Product-Focused Software Process Improvement. Vol 13709. Lecture
Notes in Computer Science. Springer International Publishing; 2022:235-242. doi:10.1007/978-3-031-21388-5_16'
apa: Wolters, D., & Engels, G. (2022). Towards Situational Process Management
for Professional Education Programmes. In D. Taibi, M. Kuhrmann, T. Mikkonen,
J. Klünder, & P. Abrahamsson (Eds.), Product-Focused Software Process Improvement
(Vol. 13709, pp. 235–242). Springer International Publishing. https://doi.org/10.1007/978-3-031-21388-5_16
bibtex: '@inbook{Wolters_Engels_2022, place={Cham}, series={Lecture Notes in Computer
Science}, title={Towards Situational Process Management for Professional Education
Programmes}, volume={13709}, DOI={10.1007/978-3-031-21388-5_16},
booktitle={Product-Focused Software Process Improvement}, publisher={Springer
International Publishing}, author={Wolters, Dennis and Engels, Gregor}, editor={Taibi,
Davide and Kuhrmann, Marco and Mikkonen, Tommi and Klünder, Jil and Abrahamsson,
Pekka}, year={2022}, pages={235–242}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Wolters, Dennis, and Gregor Engels. “Towards Situational Process Management
for Professional Education Programmes.” In Product-Focused Software Process
Improvement, edited by Davide Taibi, Marco Kuhrmann, Tommi Mikkonen, Jil Klünder,
and Pekka Abrahamsson, 13709:235–42. Lecture Notes in Computer Science. Cham:
Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-21388-5_16.'
ieee: 'D. Wolters and G. Engels, “Towards Situational Process Management for Professional
Education Programmes,” in Product-Focused Software Process Improvement,
vol. 13709, D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder, and P. Abrahamsson,
Eds. Cham: Springer International Publishing, 2022, pp. 235–242.'
mla: Wolters, Dennis, and Gregor Engels. “Towards Situational Process Management
for Professional Education Programmes.” Product-Focused Software Process Improvement,
edited by Davide Taibi et al., vol. 13709, Springer International Publishing,
2022, pp. 235–42, doi:10.1007/978-3-031-21388-5_16.
short: 'D. Wolters, G. Engels, in: D. Taibi, M. Kuhrmann, T. Mikkonen, J. Klünder,
P. Abrahamsson (Eds.), Product-Focused Software Process Improvement, Springer
International Publishing, Cham, 2022, pp. 235–242.'
date_created: 2022-12-08T19:23:46Z
date_updated: 2022-12-17T19:00:40Z
department:
- _id: '66'
doi: 10.1007/978-3-031-21388-5_16
editor:
- first_name: Davide
full_name: Taibi, Davide
last_name: Taibi
- first_name: Marco
full_name: Kuhrmann, Marco
last_name: Kuhrmann
- first_name: Tommi
full_name: Mikkonen, Tommi
last_name: Mikkonen
- first_name: Jil
full_name: Klünder, Jil
last_name: Klünder
- first_name: Pekka
full_name: Abrahamsson, Pekka
last_name: Abrahamsson
intvolume: ' 13709'
language:
- iso: eng
page: 235-242
place: Cham
publication: Product-Focused Software Process Improvement
publication_identifier:
isbn:
- '9783031213878'
- '9783031213885'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Towards Situational Process Management for Professional Education Programmes
type: book_chapter
user_id: '11308'
volume: 13709
year: '2022'
...
---
_id: '29220'
abstract:
- lang: eng
text: "Modern services often comprise several components, such as chained virtual
network functions, microservices, or\r\nmachine learning functions. Providing
such services requires to decide how often to instantiate each component, where
to place these instances in the network, how to chain them and route traffic through
them. \r\nTo overcome limitations of conventional, hardwired heuristics, deep
reinforcement learning (DRL) approaches for self-learning network and service
management have emerged recently. These model-free DRL approaches are more flexible
but typically learn tabula rasa, i.e., disregard existing understanding of networks,
services, and their coordination. \r\n\r\nInstead, we propose FutureCoord, a novel
model-based AI approach that leverages existing understanding of networks and
services for more efficient and effective coordination without time-intensive
training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic
model. This allows FutureCoord to estimate the impact of future incoming traffic
and effectively optimize long-term effects, taking fluctuating demand and Quality
of Service (QoS) requirements into account. Our extensive evaluation based on
real-world network topologies, services, and traffic traces indicates that FutureCoord
clearly outperforms state-of-the-art model-free and model-based approaches with
up to 51% higher flow success ratios."
author:
- first_name: Stefan
full_name: Werner, Stefan
last_name: Werner
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Werner S, Schneider SB, Karl H. Use What You Know: Network and Service Coordination
Beyond Certainty. In: IEEE/IFIP Network Operations and Management Symposium
(NOMS). IEEE; 2022.'
apa: 'Werner, S., Schneider, S. B., & Karl, H. (2022). Use What You Know: Network
and Service Coordination Beyond Certainty. IEEE/IFIP Network Operations and
Management Symposium (NOMS). IEEE/IFIP Network Operations and Management Symposium
(NOMS), Budapest.'
bibtex: '@inproceedings{Werner_Schneider_Karl_2022, title={Use What You Know: Network
and Service Coordination Beyond Certainty}, booktitle={IEEE/IFIP Network Operations
and Management Symposium (NOMS)}, publisher={IEEE}, author={Werner, Stefan and
Schneider, Stefan Balthasar and Karl, Holger}, year={2022} }'
chicago: 'Werner, Stefan, Stefan Balthasar Schneider, and Holger Karl. “Use What
You Know: Network and Service Coordination Beyond Certainty.” In IEEE/IFIP
Network Operations and Management Symposium (NOMS). IEEE, 2022.'
ieee: 'S. Werner, S. B. Schneider, and H. Karl, “Use What You Know: Network and
Service Coordination Beyond Certainty,” presented at the IEEE/IFIP Network Operations
and Management Symposium (NOMS), Budapest, 2022.'
mla: 'Werner, Stefan, et al. “Use What You Know: Network and Service Coordination
Beyond Certainty.” IEEE/IFIP Network Operations and Management Symposium (NOMS),
IEEE, 2022.'
short: 'S. Werner, S.B. Schneider, H. Karl, in: IEEE/IFIP Network Operations and
Management Symposium (NOMS), IEEE, 2022.'
conference:
end_date: 2022-04-29
location: Budapest
name: IEEE/IFIP Network Operations and Management Symposium (NOMS)
start_date: 2022-04-25
date_created: 2022-01-11T08:43:26Z
date_updated: 2022-01-11T08:44:04Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2022-01-11T08:39:57Z
date_updated: 2022-01-11T08:39:57Z
file_id: '29222'
file_name: author_version.pdf
file_size: 528653
relation: main_file
file_date_updated: 2022-01-11T08:39:57Z
has_accepted_license: '1'
keyword:
- network management
- service management
- AI
- Monte Carlo Tree Search
- model-based
- QoS
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
name: 'SFB 901 - C4: SFB 901 - Subproject C4'
publication: IEEE/IFIP Network Operations and Management Symposium (NOMS)
publisher: IEEE
quality_controlled: '1'
status: public
title: 'Use What You Know: Network and Service Coordination Beyond Certainty'
type: conference
user_id: '35343'
year: '2022'
...
---
_id: '27776'
article_number: '121329'
author:
- first_name: Christian
full_name: Koldewey, Christian
id: '43136'
last_name: Koldewey
orcid: https://orcid.org/0000-0001-7992-6399
- first_name: Anja
full_name: Rasor, Anja
id: '34415'
last_name: Rasor
- first_name: Jannik
full_name: Reinhold, Jannik
id: '33669'
last_name: Reinhold
- first_name: Jürgen
full_name: Gausemeier, Jürgen
id: '163'
last_name: Gausemeier
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
- first_name: Nadia
full_name: Chohan, Nadia
last_name: Chohan
- first_name: Maximilian
full_name: Frank, Maximilian
id: '38255'
last_name: Frank
citation:
ama: Koldewey C, Rasor A, Reinhold J, et al. Aligning strategic position, behavior,
and structure for smart service businesses in manufacturing. Technological
Forecasting and Social Change. Published online 2022. doi:10.1016/j.techfore.2021.121329
apa: Koldewey, C., Rasor, A., Reinhold, J., Gausemeier, J., Dumitrescu, R., Chohan,
N., & Frank, M. (2022). Aligning strategic position, behavior, and structure
for smart service businesses in manufacturing. Technological Forecasting and
Social Change, Article 121329. https://doi.org/10.1016/j.techfore.2021.121329
bibtex: '@article{Koldewey_Rasor_Reinhold_Gausemeier_Dumitrescu_Chohan_Frank_2022,
title={Aligning strategic position, behavior, and structure for smart service
businesses in manufacturing}, DOI={10.1016/j.techfore.2021.121329},
number={121329}, journal={Technological Forecasting and Social Change}, publisher={Elsevier},
author={Koldewey, Christian and Rasor, Anja and Reinhold, Jannik and Gausemeier,
Jürgen and Dumitrescu, Roman and Chohan, Nadia and Frank, Maximilian}, year={2022}
}'
chicago: Koldewey, Christian, Anja Rasor, Jannik Reinhold, Jürgen Gausemeier, Roman
Dumitrescu, Nadia Chohan, and Maximilian Frank. “Aligning Strategic Position,
Behavior, and Structure for Smart Service Businesses in Manufacturing.” Technological
Forecasting and Social Change, 2022. https://doi.org/10.1016/j.techfore.2021.121329.
ieee: 'C. Koldewey et al., “Aligning strategic position, behavior, and structure
for smart service businesses in manufacturing,” Technological Forecasting and
Social Change, Art. no. 121329, 2022, doi: 10.1016/j.techfore.2021.121329.'
mla: Koldewey, Christian, et al. “Aligning Strategic Position, Behavior, and Structure
for Smart Service Businesses in Manufacturing.” Technological Forecasting and
Social Change, 121329, Elsevier, 2022, doi:10.1016/j.techfore.2021.121329.
short: C. Koldewey, A. Rasor, J. Reinhold, J. Gausemeier, R. Dumitrescu, N. Chohan,
M. Frank, Technological Forecasting and Social Change (2022).
date_created: 2021-11-24T09:52:18Z
date_updated: 2022-01-25T08:52:39Z
department:
- _id: '563'
doi: 10.1016/j.techfore.2021.121329
language:
- iso: eng
publication: Technological Forecasting and Social Change
publication_identifier:
issn:
- 0040-1625
publication_status: published
publisher: Elsevier
status: public
title: Aligning strategic position, behavior, and structure for smart service businesses
in manufacturing
type: journal_article
user_id: '15782'
year: '2022'
...
---
_id: '29541'
author:
- first_name: Christian
full_name: Lienen, Christian
id: '60323'
last_name: Lienen
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Lienen C, Platzner M. ReconROS Executor: Event-Driven Programming of FPGA-accelerated
ROS 2 Applications. Published online 2022.'
apa: 'Lienen, C., & Platzner, M. (2022). ReconROS Executor: Event-Driven
Programming of FPGA-accelerated ROS 2 Applications.'
bibtex: '@article{Lienen_Platzner_2022, title={ReconROS Executor: Event-Driven Programming
of FPGA-accelerated ROS 2 Applications}, author={Lienen, Christian and Platzner,
Marco}, year={2022} }'
chicago: 'Lienen, Christian, and Marco Platzner. “ReconROS Executor: Event-Driven
Programming of FPGA-Accelerated ROS 2 Applications,” 2022.'
ieee: 'C. Lienen and M. Platzner, “ReconROS Executor: Event-Driven Programming of
FPGA-accelerated ROS 2 Applications.” 2022.'
mla: 'Lienen, Christian, and Marco Platzner. ReconROS Executor: Event-Driven
Programming of FPGA-Accelerated ROS 2 Applications. 2022.'
short: C. Lienen, M. Platzner, (2022).
date_created: 2022-01-26T08:52:20Z
date_updated: 2022-01-28T08:30:16Z
department:
- _id: '78'
language:
- iso: eng
main_file_link:
- url: https://arxiv.org/abs/2201.07454
status: public
title: 'ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications'
type: preprint
user_id: '60323'
year: '2022'
...
---
_id: '29763'
abstract:
- lang: eng
text: "Modern-day communication has become more and more digital. While this comes
with many advantages such as a more efficient economy, it has also created more
and more opportunities for various adversaries to manipulate communication or
eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness
of these threats. To protect the communication of people, companies, and states
from such threats, we require cryptography with strong security guarantees.\r\nDifferent
applications may require different security properties from cryptographic schemes.
For most applications, however, so-called adaptive security is considered a reasonable
minimal requirement of security. Cryptographic schemes with adaptive security
remain secure in the presence of an adversary that can corrupt communication partners
to respond to messages of the adversaries choice, while the adversary may choose
the messages based on previously observed interactions.\r\nWhile cryptography
is associated the most with encryption, this is only one of many primitives that
are essential for the security of digital interactions. This thesis presents novel
identity-based encryption (IBE) schemes and verifiable random functions (VRFs)
that achieve adaptive security as outlined above. Moreover, the cryptographic
schemes presented in this thesis are proven secure in the standard model. That
is without making use of idealized models like the random oracle model."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: Niehues D. More Efficient Techniques for Adaptively-Secure Cryptography.;
2022. doi:10.25926/rdtq-jw45
apa: Niehues, D. (2022). More Efficient Techniques for Adaptively-Secure Cryptography.
https://doi.org/10.25926/rdtq-jw45
bibtex: '@book{Niehues_2022, title={More Efficient Techniques for Adaptively-Secure
Cryptography}, DOI={10.25926/rdtq-jw45},
author={Niehues, David}, year={2022} }'
chicago: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography,
2022. https://doi.org/10.25926/rdtq-jw45.
ieee: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography.
2022.
mla: Niehues, David. More Efficient Techniques for Adaptively-Secure Cryptography.
2022, doi:10.25926/rdtq-jw45.
short: D. Niehues, More Efficient Techniques for Adaptively-Secure Cryptography,
2022.
date_created: 2022-02-07T13:29:07Z
date_updated: 2022-02-07T13:32:28Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.25926/rdtq-jw45
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2022-02-07T13:26:05Z
date_updated: 2022-02-07T13:26:05Z
file_id: '29764'
file_name: de2107.pdf
file_size: 1542089
relation: main_file
success: 1
file_date_updated: 2022-02-07T13:26:05Z
has_accepted_license: '1'
keyword:
- public-key cryptography
- lattices
- pairings
- verifiable random functions
- identity-based encryption
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://elpub.bib.uni-wuppertal.de/servlets/DerivateServlet/Derivate-14686/de2107.pdf
oa: '1'
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
name: 'SFB 901 - C1: SFB 901 - Subproject C1'
publication_status: published
status: public
supervisor:
- first_name: Tibor
full_name: Jager, Tibor
id: '64669'
last_name: Jager
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
title: More Efficient Techniques for Adaptively-Secure Cryptography
type: dissertation
user_id: '36113'
year: '2022'
...
---
_id: '31068'
author:
- first_name: Mei-Hua
full_name: Chen, Mei-Hua
last_name: Chen
- first_name: Garima
full_name: Mudgal, Garima
last_name: Mudgal
- first_name: Wei-Fan
full_name: Chen, Wei-Fan
id: '82920'
last_name: Chen
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Chen M-H, Mudgal G, Chen W-F, Wachsmuth H. Investigating the argumentation
structures of EFL learners from diverse language backgrounds. In: EUROCALL.
; 2022.'
apa: Chen, M.-H., Mudgal, G., Chen, W.-F., & Wachsmuth, H. (2022). Investigating
the argumentation structures of EFL learners from diverse language backgrounds.
EUROCALL.
bibtex: '@inproceedings{Chen_Mudgal_Chen_Wachsmuth_2022, title={Investigating the
argumentation structures of EFL learners from diverse language backgrounds}, booktitle={EUROCALL},
author={Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning},
year={2022} }'
chicago: Chen, Mei-Hua, Garima Mudgal, Wei-Fan Chen, and Henning Wachsmuth. “Investigating
the Argumentation Structures of EFL Learners from Diverse Language Backgrounds.”
In EUROCALL, 2022.
ieee: M.-H. Chen, G. Mudgal, W.-F. Chen, and H. Wachsmuth, “Investigating the argumentation
structures of EFL learners from diverse language backgrounds,” 2022.
mla: Chen, Mei-Hua, et al. “Investigating the Argumentation Structures of EFL Learners
from Diverse Language Backgrounds.” EUROCALL, 2022.
short: 'M.-H. Chen, G. Mudgal, W.-F. Chen, H. Wachsmuth, in: EUROCALL, 2022.'
date_created: 2022-05-05T07:50:21Z
date_updated: 2022-05-09T14:58:39Z
department:
- _id: '600'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: EUROCALL
status: public
title: Investigating the argumentation structures of EFL learners from diverse language
backgrounds
type: conference_abstract
user_id: '82920'
year: '2022'
...
---
_id: '31479'
author:
- first_name: Surender
full_name: Baswana, Surender
last_name: Baswana
- first_name: Shiv
full_name: Gupta, Shiv
last_name: Gupta
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
citation:
ama: Baswana S, Gupta S, Knollmann T. Mincut Sensitivity Data Structures for the
Insertion of an Edge. Algorithmica. Published online 2022. doi:10.1007/s00453-022-00978-0
apa: Baswana, S., Gupta, S., & Knollmann, T. (2022). Mincut Sensitivity Data
Structures for the Insertion of an Edge. Algorithmica. https://doi.org/10.1007/s00453-022-00978-0
bibtex: '@article{Baswana_Gupta_Knollmann_2022, title={Mincut Sensitivity Data Structures
for the Insertion of an Edge}, DOI={10.1007/s00453-022-00978-0},
journal={Algorithmica}, publisher={Springer Science and Business Media LLC}, author={Baswana,
Surender and Gupta, Shiv and Knollmann, Till}, year={2022} }'
chicago: Baswana, Surender, Shiv Gupta, and Till Knollmann. “Mincut Sensitivity
Data Structures for the Insertion of an Edge.” Algorithmica, 2022. https://doi.org/10.1007/s00453-022-00978-0.
ieee: 'S. Baswana, S. Gupta, and T. Knollmann, “Mincut Sensitivity Data Structures
for the Insertion of an Edge,” Algorithmica, 2022, doi: 10.1007/s00453-022-00978-0.'
mla: Baswana, Surender, et al. “Mincut Sensitivity Data Structures for the Insertion
of an Edge.” Algorithmica, Springer Science and Business Media LLC, 2022,
doi:10.1007/s00453-022-00978-0.
short: S. Baswana, S. Gupta, T. Knollmann, Algorithmica (2022).
date_created: 2022-05-27T10:09:24Z
date_updated: 2022-05-27T10:14:27Z
department:
- _id: '63'
doi: 10.1007/s00453-022-00978-0
genbank:
- tillk
keyword:
- Applied Mathematics
- Computer Science Applications
- General Computer Science
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '2'
name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
name: 'SFB 901 - A1: SFB 901 - Subproject A1'
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Mincut Sensitivity Data Structures for the Insertion of an Edge
type: journal_article
user_id: '39241'
year: '2022'
...
---
_id: '32792'
abstract:
- lang: eng
text: Decision makers in complex business environments have different goals and
constraints and therefore require tailored decision support systems (DSS). Following
a low-code approach, a tailored DSS can be created by a decision maker as a process-based
composition of existing, interoperable decision support services. Data incompatibilities
may be introduced during the design or execution of such a process-driven DSS,
e.g., when a service always generates or a decision maker selects data which violates
a data constraint of a subsequent service. These incompatibilities cause interrupted
or erroneous decision processes. In this paper, we contribute an approach which
enables the detection of data incompatibilities in process-driven DSS during process
design and execution. Our approach utilizes the JSON Schema specification to define
service interfaces and associated type constraints which data produced by services
or decision makers can be validated against. We demonstrate our approach in the
context of decision support for energy network planning using a prototypical open-source
implementation.
author:
- first_name: Jonas
full_name: Kirchhoff, Jonas
id: '39928'
last_name: Kirchhoff
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Kirchhoff J, Gottschalk S, Engels G. Detecting Data Incompatibilities in Process-Driven
Decision Support Systems. In: Lecture Notes in Business Information Processing.
Springer International Publishing; 2022. doi:10.1007/978-3-031-11510-3_6'
apa: Kirchhoff, J., Gottschalk, S., & Engels, G. (2022). Detecting Data Incompatibilities
in Process-Driven Decision Support Systems. In Lecture Notes in Business Information
Processing. Springer International Publishing. https://doi.org/10.1007/978-3-031-11510-3_6
bibtex: '@inbook{Kirchhoff_Gottschalk_Engels_2022, place={Cham}, title={Detecting
Data Incompatibilities in Process-Driven Decision Support Systems}, DOI={10.1007/978-3-031-11510-3_6},
booktitle={Lecture Notes in Business Information Processing}, publisher={Springer
International Publishing}, author={Kirchhoff, Jonas and Gottschalk, Sebastian
and Engels, Gregor}, year={2022} }'
chicago: 'Kirchhoff, Jonas, Sebastian Gottschalk, and Gregor Engels. “Detecting
Data Incompatibilities in Process-Driven Decision Support Systems.” In Lecture
Notes in Business Information Processing. Cham: Springer International Publishing,
2022. https://doi.org/10.1007/978-3-031-11510-3_6.'
ieee: 'J. Kirchhoff, S. Gottschalk, and G. Engels, “Detecting Data Incompatibilities
in Process-Driven Decision Support Systems,” in Lecture Notes in Business Information
Processing, Cham: Springer International Publishing, 2022.'
mla: Kirchhoff, Jonas, et al. “Detecting Data Incompatibilities in Process-Driven
Decision Support Systems.” Lecture Notes in Business Information Processing,
Springer International Publishing, 2022, doi:10.1007/978-3-031-11510-3_6.
short: 'J. Kirchhoff, S. Gottschalk, G. Engels, in: Lecture Notes in Business Information
Processing, Springer International Publishing, Cham, 2022.'
date_created: 2022-08-10T13:18:30Z
date_updated: 2022-08-10T13:21:34Z
department:
- _id: '534'
- _id: '66'
doi: 10.1007/978-3-031-11510-3_6
language:
- iso: eng
place: Cham
publication: Lecture Notes in Business Information Processing
publication_identifier:
isbn:
- '9783031115097'
- '9783031115103'
issn:
- 1865-1348
- 1865-1356
publication_status: published
publisher: Springer International Publishing
status: public
title: Detecting Data Incompatibilities in Process-Driven Decision Support Systems
type: book_chapter
user_id: '39928'
year: '2022'
...
---
_id: '33033'
author:
- first_name: Lukas
full_name: Fehring, Lukas
id: '75695'
last_name: Fehring
citation:
ama: Fehring L. Combined Ranking and Regression Trees for Algorithm Selection.;
2022.
apa: Fehring, L. (2022). Combined Ranking and Regression Trees for Algorithm
Selection.
bibtex: '@book{Fehring_2022, place={Paderborn}, title={Combined Ranking and Regression
Trees for Algorithm Selection}, author={Fehring, Lukas}, year={2022} }'
chicago: Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm
Selection. Paderborn, 2022.
ieee: L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection.
Paderborn, 2022.
mla: Fehring, Lukas. Combined Ranking and Regression Trees for Algorithm Selection.
2022.
short: L. Fehring, Combined Ranking and Regression Trees for Algorithm Selection,
Paderborn, 2022.
date_created: 2022-08-19T09:41:14Z
date_updated: 2022-08-20T07:02:04Z
ddc:
- '006'
department:
- _id: '34'
- _id: '7'
- _id: '26'
file:
- access_level: open_access
content_type: application/pdf
creator: ahetzer
date_created: 2022-08-19T09:39:57Z
date_updated: 2022-08-19T09:39:57Z
file_id: '33034'
file_name: Final Bachelor Thesis.pdf
file_size: 24830795
relation: main_file
file_date_updated: 2022-08-19T09:39:57Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Paderborn
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
name: 'SFB 901 - B2: SFB 901 - Subproject B2'
status: public
title: Combined Ranking and Regression Trees for Algorithm Selection
type: bachelorsthesis
user_id: '38209'
year: '2022'
...
---
_id: '30867'
abstract:
- lang: eng
text: "In online algorithm selection (OAS), instances of an algorithmic problem\r\nclass
are presented to an agent one after another, and the agent has to quickly\r\nselect
a presumably best algorithm from a fixed set of candidate algorithms.\r\nFor decision
problems such as satisfiability (SAT), quality typically refers to\r\nthe algorithm's
runtime. As the latter is known to exhibit a heavy-tail\r\ndistribution, an algorithm
is normally stopped when exceeding a predefined\r\nupper time limit. As a consequence,
machine learning methods used to optimize\r\nan algorithm selection strategy in
a data-driven manner need to deal with\r\nright-censored samples, a problem that
has received little attention in the\r\nliterature so far. In this work, we revisit
multi-armed bandit algorithms for\r\nOAS and discuss their capability of dealing
with the problem. Moreover, we\r\nadapt them towards runtime-oriented losses,
allowing for partially censored\r\ndata while keeping a space- and time-complexity
independent of the time\r\nhorizon. In an extensive experimental evaluation on
an adapted version of the\r\nASlib benchmark, we demonstrate that theoretically
well-founded methods based\r\non Thompson sampling perform specifically strong
and improve in comparison to\r\nexisting methods."
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Viktor
full_name: Bengs, Viktor
id: '76599'
last_name: Bengs
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Tornede A, Bengs V, Hüllermeier E. Machine Learning for Online Algorithm Selection
under Censored Feedback. Proceedings of the 36th AAAI Conference on Artificial
Intelligence. Published online 2022.
apa: Tornede, A., Bengs, V., & Hüllermeier, E. (2022). Machine Learning for
Online Algorithm Selection under Censored Feedback. In Proceedings of the 36th
AAAI Conference on Artificial Intelligence. AAAI.
bibtex: '@article{Tornede_Bengs_Hüllermeier_2022, title={Machine Learning for Online
Algorithm Selection under Censored Feedback}, journal={Proceedings of the 36th
AAAI Conference on Artificial Intelligence}, publisher={AAAI}, author={Tornede,
Alexander and Bengs, Viktor and Hüllermeier, Eyke}, year={2022} }'
chicago: Tornede, Alexander, Viktor Bengs, and Eyke Hüllermeier. “Machine Learning
for Online Algorithm Selection under Censored Feedback.” Proceedings of the
36th AAAI Conference on Artificial Intelligence. AAAI, 2022.
ieee: A. Tornede, V. Bengs, and E. Hüllermeier, “Machine Learning for Online Algorithm
Selection under Censored Feedback,” Proceedings of the 36th AAAI Conference
on Artificial Intelligence. AAAI, 2022.
mla: Tornede, Alexander, et al. “Machine Learning for Online Algorithm Selection
under Censored Feedback.” Proceedings of the 36th AAAI Conference on Artificial
Intelligence, AAAI, 2022.
short: A. Tornede, V. Bengs, E. Hüllermeier, Proceedings of the 36th AAAI Conference
on Artificial Intelligence (2022).
date_created: 2022-04-12T11:58:56Z
date_updated: 2022-08-24T12:44:27Z
department:
- _id: '34'
- _id: '7'
- _id: '26'
external_id:
arxiv:
- '2109.06234'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
name: 'SFB 901 - B2: SFB 901 - Subproject B2'
publication: Proceedings of the 36th AAAI Conference on Artificial Intelligence
publisher: AAAI
status: public
title: Machine Learning for Online Algorithm Selection under Censored Feedback
type: preprint
user_id: '38209'
year: '2022'
...
---
_id: '30865'
abstract:
- lang: eng
text: "The problem of selecting an algorithm that appears most suitable for a\r\nspecific
instance of an algorithmic problem class, such as the Boolean\r\nsatisfiability
problem, is called instance-specific algorithm selection. Over\r\nthe past decade,
the problem has received considerable attention, resulting in\r\na number of different
methods for algorithm selection. Although most of these\r\nmethods are based on
machine learning, surprisingly little work has been done\r\non meta learning,
that is, on taking advantage of the complementarity of\r\nexisting algorithm selection
methods in order to combine them into a single\r\nsuperior algorithm selector.
In this paper, we introduce the problem of meta\r\nalgorithm selection, which
essentially asks for the best way to combine a given\r\nset of algorithm selectors.
We present a general methodological framework for\r\nmeta algorithm selection
as well as several concrete learning methods as\r\ninstantiations of this framework,
essentially combining ideas of meta learning\r\nand ensemble learning. In an extensive
experimental evaluation, we demonstrate\r\nthat ensembles of algorithm selectors
can significantly outperform single\r\nalgorithm selectors and have the potential
to form the new state of the art in\r\nalgorithm selection."
author:
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Lukas
full_name: Gehring, Lukas
last_name: Gehring
- first_name: Tanja
full_name: Tornede, Tanja
id: '40795'
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'
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: Tornede A, Gehring L, Tornede T, Wever MD, Hüllermeier E. Algorithm Selection
on a Meta Level. Machine Learning. Published online 2022.
apa: Tornede, A., Gehring, L., Tornede, T., Wever, M. D., & Hüllermeier, E.
(2022). Algorithm Selection on a Meta Level. In Machine Learning.
bibtex: '@article{Tornede_Gehring_Tornede_Wever_Hüllermeier_2022, title={Algorithm
Selection on a Meta Level}, journal={Machine Learning}, author={Tornede, Alexander
and Gehring, Lukas and Tornede, Tanja and Wever, Marcel Dominik and Hüllermeier,
Eyke}, year={2022} }'
chicago: Tornede, Alexander, Lukas Gehring, Tanja Tornede, Marcel Dominik Wever,
and Eyke Hüllermeier. “Algorithm Selection on a Meta Level.” Machine Learning,
2022.
ieee: A. Tornede, L. Gehring, T. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm
Selection on a Meta Level,” Machine Learning. 2022.
mla: Tornede, Alexander, et al. “Algorithm Selection on a Meta Level.” Machine
Learning, 2022.
short: A. Tornede, L. Gehring, T. Tornede, M.D. Wever, E. Hüllermeier, Machine Learning
(2022).
date_created: 2022-04-12T11:55:18Z
date_updated: 2022-08-24T12:45:39Z
department:
- _id: '34'
- _id: '7'
- _id: '26'
external_id:
arxiv:
- '2107.09414'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '3'
name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '10'
name: 'SFB 901 - B2: SFB 901 - Subproject B2'
publication: Machine Learning
status: public
title: Algorithm Selection on a Meta Level
type: preprint
user_id: '38209'
year: '2022'
...