---
_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: '29302'
abstract:
- lang: eng
text: "This paper introduces the project Scale4Edge. The project is focused on enabling
an effective RISC-V ecosystem for optimization of edge applications. We describe
the basic components of this ecosystem and introduce the envisioned\r\ndemonstrators,
which will be used in their evaluation."
author:
- first_name: Wolfgang
full_name: Ecker, Wolfgang
last_name: Ecker
- first_name: Peer
full_name: Adelt, Peer
id: '5603'
last_name: Adelt
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Reinhold
full_name: Heckmann, Reinhold
last_name: Heckmann
- first_name: Milos
full_name: Krstic, Milos
last_name: Krstic
- first_name: Vladimir
full_name: Herdt, Vladimir
last_name: Herdt
- first_name: Rolf
full_name: Drechsler, Rolf
last_name: Drechsler
- first_name: Gerhard
full_name: Angst, Gerhard
last_name: Angst
- first_name: Ralf
full_name: Wimmer, Ralf
last_name: Wimmer
- first_name: Andreas
full_name: Mauderer, Andreas
last_name: Mauderer
- first_name: Rafael
full_name: Stahl, Rafael
last_name: Stahl
- first_name: Karsten
full_name: Emrich, Karsten
last_name: Emrich
- first_name: Daniel
full_name: Mueller-Gritschneder, Daniel
last_name: Mueller-Gritschneder
- first_name: Bernd
full_name: Becker, Bernd
last_name: Becker
- first_name: Philipp
full_name: Scholl, Philipp
last_name: Scholl
- first_name: Eyck
full_name: Jentzsch, Eyck
last_name: Jentzsch
- first_name: Jan
full_name: Schlamelcher, Jan
last_name: Schlamelcher
- first_name: Kim
full_name: Grüttner, Kim
last_name: Grüttner
- first_name: Paul Palomero
full_name: Bernardo, Paul Palomero
last_name: Bernardo
- first_name: Oliver
full_name: Brinkmann, Oliver
last_name: Brinkmann
- first_name: Mihaela
full_name: Damian, Mihaela
last_name: Damian
- first_name: Julian
full_name: Oppermann, Julian
last_name: Oppermann
- first_name: Andreas
full_name: Koch, Andreas
last_name: Koch
- first_name: Jörg
full_name: Bormann, Jörg
last_name: Bormann
- first_name: Johannes
full_name: Partzsch, Johannes
last_name: Partzsch
- first_name: Christian
full_name: Mayr, Christian
last_name: Mayr
- first_name: Wolfgang
full_name: Kunz, Wolfgang
last_name: Kunz
citation:
ama: 'Ecker W, Adelt P, Müller W, et al. The Scale4Edge RISC-V Ecosystem. In: In
Proceedings of the Design Automation and Test Conference and Exhibition (DATE
2022). ; 2022.'
apa: Ecker, W., Adelt, P., Müller, W., Heckmann, R., Krstic, M., Herdt, V., Drechsler,
R., Angst, G., Wimmer, R., Mauderer, A., Stahl, R., Emrich, K., Mueller-Gritschneder,
D., Becker, B., Scholl, P., Jentzsch, E., Schlamelcher, J., Grüttner, K., Bernardo,
P. P., … Kunz, W. (2022). The Scale4Edge RISC-V Ecosystem. In Proceedings of
the Design Automation and Test Conference and Exhibition (DATE 2022).
bibtex: '@inproceedings{Ecker_Adelt_Müller_Heckmann_Krstic_Herdt_Drechsler_Angst_Wimmer_Mauderer_et
al._2022, title={The Scale4Edge RISC-V Ecosystem}, booktitle={In Proceedings of
the Design Automation and Test Conference and Exhibition (DATE 2022)}, author={Ecker,
Wolfgang and Adelt, Peer and Müller, Wolfgang and Heckmann, Reinhold and Krstic,
Milos and Herdt, Vladimir and Drechsler, Rolf and Angst, Gerhard and Wimmer, Ralf
and Mauderer, Andreas and et al.}, year={2022} }'
chicago: Ecker, Wolfgang, Peer Adelt, Wolfgang Müller, Reinhold Heckmann, Milos
Krstic, Vladimir Herdt, Rolf Drechsler, et al. “The Scale4Edge RISC-V Ecosystem.”
In In Proceedings of the Design Automation and Test Conference and Exhibition
(DATE 2022), 2022.
ieee: W. Ecker et al., “The Scale4Edge RISC-V Ecosystem,” 2022.
mla: Ecker, Wolfgang, et al. “The Scale4Edge RISC-V Ecosystem.” In Proceedings
of the Design Automation and Test Conference and Exhibition (DATE 2022), 2022.
short: 'W. Ecker, P. Adelt, W. Müller, R. Heckmann, M. Krstic, V. Herdt, R. Drechsler,
G. Angst, R. Wimmer, A. Mauderer, R. Stahl, K. Emrich, D. Mueller-Gritschneder,
B. Becker, P. Scholl, E. Jentzsch, J. Schlamelcher, K. Grüttner, P.P. Bernardo,
O. Brinkmann, M. Damian, J. Oppermann, A. Koch, J. Bormann, J. Partzsch, C. Mayr,
W. Kunz, in: In Proceedings of the Design Automation and Test Conference and Exhibition
(DATE 2022), 2022.'
conference:
end_date: 15.03.2022
start_date: 14.03.2022
date_created: 2022-01-13T07:27:46Z
date_updated: 2022-01-13T07:30:38Z
department:
- _id: '58'
language:
- iso: eng
publication: In Proceedings of the Design Automation and Test Conference and Exhibition
(DATE 2022)
status: public
title: The Scale4Edge RISC-V Ecosystem
type: conference
user_id: '15931'
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: '29351'
abstract:
- lang: eng
text: Safety-critical systems have to follow extremely high dependability requirements
as specified in the standards for automotive, air, and space applications. The
required high fault coverage at runtime is usually obtained by a combination of
concurrent error detection or correction and periodic tests within rather short
time intervals. The concurrent scheme ensures the integrity of computed results
while the periodic test has to identify potential aging problems and to prevent
any fault accumulation which may invalidate the concurrent error detection mechanism.
Such periodic built-in self-test (BIST) schemes are already commercialized for
memories and for random logic. The paper at hand extends this approach to interconnect
structures. A BIST scheme is presented which targets interconnect defects before
they will actually affect the system functionality at nominal speed. A BIST schedule
is developed which significantly reduces aging caused by electromigration during
the lifetime application of the periodic test.
article_type: original
author:
- first_name: Somayeh
full_name: Sadeghi-Kohan, Somayeh
id: '78614'
last_name: Sadeghi-Kohan
- first_name: Sybille
full_name: Hellebrand, Sybille
id: '209'
last_name: Hellebrand
orcid: 0000-0002-3717-3939
- first_name: Hans-Joachim
full_name: Wunderlich, Hans-Joachim
last_name: Wunderlich
citation:
ama: Sadeghi-Kohan S, Hellebrand S, Wunderlich H-J. Stress-Aware Periodic Test of
Interconnects. Journal of Electronic Testing. Published online 2022. doi:10.1007/s10836-021-05979-5
apa: Sadeghi-Kohan, S., Hellebrand, S., & Wunderlich, H.-J. (2022). Stress-Aware
Periodic Test of Interconnects. Journal of Electronic Testing. https://doi.org/10.1007/s10836-021-05979-5
bibtex: '@article{Sadeghi-Kohan_Hellebrand_Wunderlich_2022, title={Stress-Aware
Periodic Test of Interconnects}, DOI={10.1007/s10836-021-05979-5},
journal={Journal of Electronic Testing}, publisher={Springer Science and Business
Media LLC}, author={Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich,
Hans-Joachim}, year={2022} }'
chicago: Sadeghi-Kohan, Somayeh, Sybille Hellebrand, and Hans-Joachim Wunderlich.
“Stress-Aware Periodic Test of Interconnects.” Journal of Electronic Testing,
2022. https://doi.org/10.1007/s10836-021-05979-5.
ieee: 'S. Sadeghi-Kohan, S. Hellebrand, and H.-J. Wunderlich, “Stress-Aware Periodic
Test of Interconnects,” Journal of Electronic Testing, 2022, doi: 10.1007/s10836-021-05979-5.'
mla: Sadeghi-Kohan, Somayeh, et al. “Stress-Aware Periodic Test of Interconnects.”
Journal of Electronic Testing, Springer Science and Business Media LLC,
2022, doi:10.1007/s10836-021-05979-5.
short: S. Sadeghi-Kohan, S. Hellebrand, H.-J. Wunderlich, Journal of Electronic
Testing (2022).
date_created: 2022-01-14T11:16:34Z
date_updated: 2022-05-11T16:10:01Z
department:
- _id: '48'
doi: 10.1007/s10836-021-05979-5
keyword:
- Electrical and Electronic Engineering
language:
- iso: eng
publication: Journal of Electronic Testing
publication_identifier:
issn:
- 0923-8174
- 1573-0727
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Stress-Aware Periodic Test of Interconnects
type: journal_article
user_id: '209'
year: '2022'
...
---
_id: '29890'
author:
- first_name: Somayeh
full_name: Sadeghi-Kohan, Somayeh
id: '78614'
last_name: Sadeghi-Kohan
- first_name: Sybille
full_name: Hellebrand, Sybille
id: '209'
last_name: Hellebrand
orcid: 0000-0002-3717-3939
- first_name: Hans-Joachim
full_name: Wunderlich, Hans-Joachim
last_name: Wunderlich
citation:
ama: Sadeghi-Kohan S, Hellebrand S, Wunderlich H-J. EM-Aware Interconnect BIST.
European Workshop on Silicon Lifecycle Management, March 18, 2022; 2022.
apa: Sadeghi-Kohan, S., Hellebrand, S., & Wunderlich, H.-J. (2022). EM-Aware
Interconnect BIST. European Workshop on Silicon Lifecycle Management, March
18, 2022.
bibtex: '@book{Sadeghi-Kohan_Hellebrand_Wunderlich_2022, place={Online}, title={EM-Aware
Interconnect BIST}, publisher={European Workshop on Silicon Lifecycle Management,
March 18, 2022}, author={Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich,
Hans-Joachim}, year={2022} }'
chicago: 'Sadeghi-Kohan, Somayeh, Sybille Hellebrand, and Hans-Joachim Wunderlich.
EM-Aware Interconnect BIST. Online: European Workshop on Silicon Lifecycle
Management, March 18, 2022, 2022.'
ieee: 'S. Sadeghi-Kohan, S. Hellebrand, and H.-J. Wunderlich, EM-Aware Interconnect
BIST. Online: European Workshop on Silicon Lifecycle Management, March 18,
2022, 2022.'
mla: Sadeghi-Kohan, Somayeh, et al. EM-Aware Interconnect BIST. European
Workshop on Silicon Lifecycle Management, March 18, 2022, 2022.
short: S. Sadeghi-Kohan, S. Hellebrand, H.-J. Wunderlich, EM-Aware Interconnect
BIST, European Workshop on Silicon Lifecycle Management, March 18, 2022, Online,
2022.
date_created: 2022-02-19T14:21:24Z
date_updated: 2022-05-11T17:07:24Z
department:
- _id: '48'
keyword:
- WORKSHOP
language:
- iso: eng
page: '2'
place: Online
publication_status: published
publisher: European Workshop on Silicon Lifecycle Management, March 18, 2022
status: public
title: EM-Aware Interconnect BIST
type: misc
user_id: '209'
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: '31556'
abstract:
- lang: ger
text: Mehrzieloptimierung behandelt Probleme, bei denen mehrere skalare Zielfunktionen
simultan optimiert werden sollen. Ein Punkt ist in diesem Fall optimal, wenn es
keinen anderen Punkt gibt, der mindestens genauso gut ist in allen Zielfunktionen
und besser in mindestens einer Zielfunktion. Ein notwendiges Optimalitätskriterium
lässt sich über Ableitungsinformationen erster Ordnung der Zielfunktionen herleiten.
Die Menge der Punkte, die dieses notwendige Kriterium erfüllen, wird als Pareto-kritische
Menge bezeichnet. Diese Arbeit enthält neue Resultate über Pareto-kritische Mengen
für glatte und nicht-glatte Mehrzieloptimierungsprobleme, sowohl was deren Berechnung
betrifft als auch deren Struktur. Im glatten Fall erfolgt die Berechnung über
ein Fortsetzungsverfahren, im nichtglatten Fall über ein Abstiegsverfahren. Anschließend
wird die Struktur des Randes der Pareto-kritischen Menge analysiert, welcher aus
Pareto-kritischen Mengen kleinerer Subprobleme besteht. Schlussendlich werden
inverse Probleme betrachtet, bei denen zu einer gegebenen Datenmenge ein Zielfunktionsvektor
gefunden werden soll, für den die Datenpunkte kritisch sind.
- lang: eng
text: Multiobjective optimization is concerned with the simultaneous optimization
of multiple scalar-valued functions. In this case, a point is optimal if there
is no other point that is at least as good in all objectives and better in at
least one objective. A necessary condition for optimality can be derived based
on first-order information of the objectives. The set of points that satisfy this
necessary condition is called the Pareto critical set. This thesis presents new
results about Pareto critical sets for smooth and nonsmooth multiobjective optimization
problems, both in terms of their efficient computation and structural properties.
In the smooth case they are computed via a continuation method and in the nonsmooth
case via a descent method. Afterwards, the structure of the boundary of the Pareto
critical set is analyzed, which consists of Pareto critical sets of smaller subproblems.
Finally, inverse problems are considered, where a data set is given and an objective
vector is sought for which the data points are critical.
author:
- first_name: Bennet
full_name: Gebken, Bennet
id: '32643'
last_name: Gebken
citation:
ama: Gebken B. Computation and Analysis of Pareto Critical Sets in Smooth and
Nonsmooth Multiobjective Optimization.; 2022. doi:10.17619/UNIPB/1-1327
apa: Gebken, B. (2022). Computation and analysis of Pareto critical sets in smooth
and nonsmooth multiobjective optimization. https://doi.org/10.17619/UNIPB/1-1327
bibtex: '@book{Gebken_2022, title={Computation and analysis of Pareto critical sets
in smooth and nonsmooth multiobjective optimization}, DOI={10.17619/UNIPB/1-1327},
author={Gebken, Bennet}, year={2022} }'
chicago: Gebken, Bennet. Computation and Analysis of Pareto Critical Sets in
Smooth and Nonsmooth Multiobjective Optimization, 2022. https://doi.org/10.17619/UNIPB/1-1327.
ieee: B. Gebken, Computation and analysis of Pareto critical sets in smooth and
nonsmooth multiobjective optimization. 2022.
mla: Gebken, Bennet. Computation and Analysis of Pareto Critical Sets in Smooth
and Nonsmooth Multiobjective Optimization. 2022, doi:10.17619/UNIPB/1-1327.
short: B. Gebken, Computation and Analysis of Pareto Critical Sets in Smooth and
Nonsmooth Multiobjective Optimization, 2022.
date_created: 2022-06-01T06:48:08Z
date_updated: 2022-06-01T07:13:09Z
department:
- _id: '101'
doi: 10.17619/UNIPB/1-1327
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://digital.ub.uni-paderborn.de/hs/download/pdf/6531779
oa: '1'
status: public
supervisor:
- first_name: Michael
full_name: Dellnitz, Michael
last_name: Dellnitz
title: Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective
optimization
type: dissertation
user_id: '32643'
year: '2022'
...
---
_id: '31574'
abstract:
- lang: eng
text: We model negative polarization, which is observed for planetary regoliths
at backscattering, solving a full wave problem of light scattering with a numerically
exact Discontinuous Galerkin Time Domain (DGTD) method. Pieces of layers with
the bulk packing density of particles close to 0.5 are used. The model particles
are highly absorbing and have irregular shapes and sizes larger than the wavelength
of light. This represents a realistic analog of low-albedo planetary regoliths.
Our simulations confirm coherent backscattering mechanism of the origin of negative
polarization. We show that angular profiles of polarization are stabilized if
the number of particles in a layer piece becomes larger than ten. This allows
application of our approach to the negative polarization modeling for planetary
regoliths.
author:
- first_name: Yevgen
full_name: Grynko, Yevgen
id: '26059'
last_name: Grynko
- first_name: Yuriy
full_name: Shkuratov, Yuriy
last_name: Shkuratov
- first_name: Samer
full_name: Alhaddad, Samer
id: '42456'
last_name: Alhaddad
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
citation:
ama: Grynko Y, Shkuratov Y, Alhaddad S, Förstner J. Negative polarization of light
at backscattering from a numerical analog of planetary regoliths. Icarus.
2022;384:115099. doi:10.1016/j.icarus.2022.115099
apa: Grynko, Y., Shkuratov, Y., Alhaddad, S., & Förstner, J. (2022). Negative
polarization of light at backscattering from a numerical analog of planetary regoliths.
Icarus, 384, 115099. https://doi.org/10.1016/j.icarus.2022.115099
bibtex: '@article{Grynko_Shkuratov_Alhaddad_Förstner_2022, title={Negative polarization
of light at backscattering from a numerical analog of planetary regoliths}, volume={384},
DOI={10.1016/j.icarus.2022.115099},
journal={Icarus}, publisher={Elsevier BV}, author={Grynko, Yevgen and Shkuratov,
Yuriy and Alhaddad, Samer and Förstner, Jens}, year={2022}, pages={115099} }'
chicago: 'Grynko, Yevgen, Yuriy Shkuratov, Samer Alhaddad, and Jens Förstner. “Negative
Polarization of Light at Backscattering from a Numerical Analog of Planetary Regoliths.”
Icarus 384 (2022): 115099. https://doi.org/10.1016/j.icarus.2022.115099.'
ieee: 'Y. Grynko, Y. Shkuratov, S. Alhaddad, and J. Förstner, “Negative polarization
of light at backscattering from a numerical analog of planetary regoliths,” Icarus,
vol. 384, p. 115099, 2022, doi: 10.1016/j.icarus.2022.115099.'
mla: Grynko, Yevgen, et al. “Negative Polarization of Light at Backscattering from
a Numerical Analog of Planetary Regoliths.” Icarus, vol. 384, Elsevier
BV, 2022, p. 115099, doi:10.1016/j.icarus.2022.115099.
short: Y. Grynko, Y. Shkuratov, S. Alhaddad, J. Förstner, Icarus 384 (2022) 115099.
date_created: 2022-06-01T18:53:35Z
date_updated: 2022-06-01T18:57:51Z
ddc:
- '530'
department:
- _id: '61'
doi: 10.1016/j.icarus.2022.115099
file:
- access_level: open_access
content_type: application/pdf
creator: fossie
date_created: 2022-06-01T18:56:44Z
date_updated: 2022-06-01T18:56:44Z
file_id: '31575'
file_name: 2022-06 Grynko - Icarus - Negative polarization of light at backscattering
from a numerical analog of planetary regoliths.pdf
file_size: 1419286
relation: main_file
file_date_updated: 2022-06-01T18:56:44Z
has_accepted_license: '1'
intvolume: ' 384'
keyword:
- tet_topic_scattering
language:
- iso: eng
oa: '1'
page: '115099'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Icarus
publication_identifier:
issn:
- 0019-1035
publication_status: published
publisher: Elsevier BV
status: public
title: Negative polarization of light at backscattering from a numerical analog of
planetary regoliths
type: journal_article
user_id: '158'
volume: 384
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: '32796'
author:
- first_name: Joachim
full_name: Böcker, Joachim
id: '66'
last_name: Böcker
orcid: 0000-0002-8480-7295
citation:
ama: 'Böcker J. Concept Study of an LLC Converter with Magnetically Resonant Inductor.
In: 2022 International Symposium on Power Electronics, Electrical Drives, Automation
and Motion (SPEEDAM). IEEE; 2022. doi:10.1109/speedam53979.2022.9842047'
apa: Böcker, J. (2022). Concept Study of an LLC Converter with Magnetically Resonant
Inductor. 2022 International Symposium on Power Electronics, Electrical Drives,
Automation and Motion (SPEEDAM). SPEEDAM, Sorrento, Italy. https://doi.org/10.1109/speedam53979.2022.9842047
bibtex: '@inproceedings{Böcker_2022, title={Concept Study of an LLC Converter with
Magnetically Resonant Inductor}, DOI={10.1109/speedam53979.2022.9842047},
booktitle={2022 International Symposium on Power Electronics, Electrical Drives,
Automation and Motion (SPEEDAM)}, publisher={IEEE}, author={Böcker, Joachim},
year={2022} }'
chicago: Böcker, Joachim. “Concept Study of an LLC Converter with Magnetically Resonant
Inductor.” In 2022 International Symposium on Power Electronics, Electrical
Drives, Automation and Motion (SPEEDAM). IEEE, 2022. https://doi.org/10.1109/speedam53979.2022.9842047.
ieee: 'J. Böcker, “Concept Study of an LLC Converter with Magnetically Resonant
Inductor,” presented at the SPEEDAM, Sorrento, Italy, 2022, doi: 10.1109/speedam53979.2022.9842047.'
mla: Böcker, Joachim. “Concept Study of an LLC Converter with Magnetically Resonant
Inductor.” 2022 International Symposium on Power Electronics, Electrical Drives,
Automation and Motion (SPEEDAM), IEEE, 2022, doi:10.1109/speedam53979.2022.9842047.
short: 'J. Böcker, in: 2022 International Symposium on Power Electronics, Electrical
Drives, Automation and Motion (SPEEDAM), IEEE, 2022.'
conference:
location: Sorrento, Italy
name: SPEEDAM
start_date: 2022-06
date_created: 2022-08-11T08:46:36Z
date_updated: 2022-08-19T06:27:55Z
department:
- _id: '52'
doi: 10.1109/speedam53979.2022.9842047
language:
- iso: eng
publication: 2022 International Symposium on Power Electronics, Electrical Drives,
Automation and Motion (SPEEDAM)
publication_status: published
publisher: IEEE
status: public
title: Concept Study of an LLC Converter with Magnetically Resonant Inductor
type: conference
user_id: '66'
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'
...
---
_id: '33150'
abstract:
- lang: eng
text: In this article, we build on previous work to present an optimization algorithm
for nonlinearly constrained multi-objective optimization problems. The algorithm
combines a surrogate-assisted derivative-free trust-region approach with the filter
method known from single-objective optimization. Instead of the true objective
and constraint functions, so-called fully linear models are employed and we show
how to deal with the gradient inexactness in the composite step setting, adapted
from single-objective optimization as well. Under standard assumptions, we prove
convergence of a subset of iterates to a quasi-stationary point and if constraint
qualifications hold, then the limit point is also a KKT-point of the multi-objective
problem.
author:
- first_name: Manuel Bastian
full_name: Berkemeier, Manuel Bastian
id: '51701'
last_name: Berkemeier
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
citation:
ama: Berkemeier MB, Peitz S. Multi-Objective Trust-Region Filter Method for Nonlinear
Constraints using Inexact Gradients. arXiv:220812094. Published online
2022.
apa: Berkemeier, M. B., & Peitz, S. (2022). Multi-Objective Trust-Region Filter
Method for Nonlinear Constraints using Inexact Gradients. In arXiv:2208.12094.
bibtex: '@article{Berkemeier_Peitz_2022, title={Multi-Objective Trust-Region Filter
Method for Nonlinear Constraints using Inexact Gradients}, journal={arXiv:2208.12094},
author={Berkemeier, Manuel Bastian and Peitz, Sebastian}, year={2022} }'
chicago: Berkemeier, Manuel Bastian, and Sebastian Peitz. “Multi-Objective Trust-Region
Filter Method for Nonlinear Constraints Using Inexact Gradients.” ArXiv:2208.12094,
2022.
ieee: M. B. Berkemeier and S. Peitz, “Multi-Objective Trust-Region Filter Method
for Nonlinear Constraints using Inexact Gradients,” arXiv:2208.12094. 2022.
mla: Berkemeier, Manuel Bastian, and Sebastian Peitz. “Multi-Objective Trust-Region
Filter Method for Nonlinear Constraints Using Inexact Gradients.” ArXiv:2208.12094,
2022.
short: M.B. Berkemeier, S. Peitz, ArXiv:2208.12094 (2022).
date_created: 2022-08-26T06:08:06Z
date_updated: 2022-08-26T06:12:10Z
department:
- _id: '101'
- _id: '655'
external_id:
arxiv:
- '2208.12094'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2208.12094
oa: '1'
publication: arXiv:2208.12094
status: public
title: Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using
Inexact Gradients
type: preprint
user_id: '47427'
year: '2022'
...
---
_id: '33230'
author:
- first_name: Joshua J.
full_name: Daymude, Joshua J.
last_name: Daymude
- first_name: Andréa W.
full_name: Richa, Andréa W.
last_name: Richa
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Daymude JJ, Richa AW, Scheideler C. Local Mutual Exclusion for Dynamic, Anonymous,
Bounded Memory Message Passing Systems. In: Aspnes J, Michail O, eds. 1st Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022,
Virtual Conference. Vol 221. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2022:12:1–12:19. doi:10.4230/LIPIcs.SAND.2022.12'
apa: Daymude, J. J., Richa, A. W., & Scheideler, C. (2022). Local Mutual Exclusion
for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &
O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks,
SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19).
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.12
bibtex: '@inproceedings{Daymude_Richa_Scheideler_2022, series={LIPIcs}, title={Local
Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems},
volume={221}, DOI={10.4230/LIPIcs.SAND.2022.12},
booktitle={1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND
2022, March 28-30, 2022, Virtual Conference}, publisher={Schloss Dagstuhl - Leibniz-Zentrum
für Informatik}, author={Daymude, Joshua J. and Richa, Andréa W. and Scheideler,
Christian}, editor={Aspnes, James and Michail, Othon}, year={2022}, pages={12:1–12:19},
collection={LIPIcs} }'
chicago: Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual
Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.” In
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March
28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail,
221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
https://doi.org/10.4230/LIPIcs.SAND.2022.12.
ieee: 'J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for
Dynamic, Anonymous, Bounded Memory Message Passing Systems,” in 1st Symposium
on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022,
Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi: 10.4230/LIPIcs.SAND.2022.12.'
mla: Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous,
Bounded Memory Message Passing Systems.” 1st Symposium on Algorithmic Foundations
of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited
by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12.
short: 'J.J. Daymude, A.W. Richa, C. Scheideler, in: J. Aspnes, O. Michail (Eds.),
1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March
28-30, 2022, Virtual Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2022, p. 12:1–12:19.'
date_created: 2022-08-30T06:31:21Z
date_updated: 2022-08-30T06:33:44Z
department:
- _id: '79'
doi: 10.4230/LIPIcs.SAND.2022.12
editor:
- first_name: James
full_name: Aspnes, James
last_name: Aspnes
- first_name: Othon
full_name: Michail, Othon
last_name: Michail
intvolume: ' 221'
language:
- iso: eng
page: 12:1–12:19
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: 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022,
March 28-30, 2022, Virtual Conference
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
series_title: LIPIcs
status: public
title: Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing
Systems
type: conference
user_id: '15504'
volume: 221
year: '2022'
...
---
_id: '33240'
author:
- first_name: Thorsten
full_name: Götte, Thorsten
id: '34727'
last_name: Götte
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Götte T, Scheideler C. Brief Announcement: The (Limited) Power of Multiple
Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience
through Collusion. In: Agrawal K, Lee I-TA, eds. SPAA ’22: 34th ACM Symposium
on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11
- 14, 2022. ACM; 2022:99–101. doi:10.1145/3490148.3538556'
apa: 'Götte, T., & Scheideler, C. (2022). Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion. In K. Agrawal & I.-T. A. Lee (Eds.), SPAA
’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia,
PA, USA, July 11 - 14, 2022 (pp. 99–101). ACM. https://doi.org/10.1145/3490148.3538556'
bibtex: '@inproceedings{Götte_Scheideler_2022, title={Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion}, DOI={10.1145/3490148.3538556},
booktitle={SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Philadelphia, PA, USA, July 11 - 14, 2022}, publisher={ACM}, author={Götte, Thorsten
and Scheideler, Christian}, editor={Agrawal, Kunal and Lee, I-Ting Angelina},
year={2022}, pages={99–101} }'
chicago: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion.” In SPAA ’22: 34th ACM Symposium on Parallelism
in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022,
edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022. https://doi.org/10.1145/3490148.3538556.'
ieee: 'T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple
Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience
through Collusion,” in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms
and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101,
doi: 10.1145/3490148.3538556.'
mla: 'Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited)
Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved
Resilience through Collusion.” SPAA ’22: 34th ACM Symposium on Parallelism
in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022,
edited by Kunal Agrawal and I-Ting Angelina Lee, ACM, 2022, pp. 99–101, doi:10.1145/3490148.3538556.'
short: 'T. Götte, C. Scheideler, in: K. Agrawal, I.-T.A. Lee (Eds.), SPAA ’22: 34th
ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA,
USA, July 11 - 14, 2022, ACM, 2022, pp. 99–101.'
date_created: 2022-09-01T07:55:00Z
date_updated: 2022-09-01T07:57:53Z
department:
- _id: '79'
doi: 10.1145/3490148.3538556
editor:
- first_name: Kunal
full_name: Agrawal, Kunal
last_name: Agrawal
- first_name: I-Ting Angelina
full_name: Lee, I-Ting Angelina
last_name: Lee
language:
- iso: eng
page: 99–101
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: 'SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Philadelphia, PA, USA, July 11 - 14, 2022'
publisher: ACM
status: public
title: 'Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous
Byzantine Reliable Broadcast with Improved Resilience through Collusion'
type: conference
user_id: '15504'
year: '2022'
...
---
_id: '30941'
abstract:
- lang: eng
text: "Decision support systems are crucial in helping decision makers to quickly
identify optimal business decisions in increasingly volatile and complex business
environments. However, the ideal DSS for one decision maker may not optimally
address the requirements for decision support of another decision maker. This
is due to differences between\r\ndecision makers in business goals, regulatory
restrictions or availability of resources such as data. By using a suboptimal
DSS, decision makers risk implementing suboptimal decision recommendations which
endanger the success of their business. This presents DSS developers with the
challenge to implement a customizable DSS which can be tailored to the individual
requirements for decision support of a single decision maker. In order to address
this challenge, we suggest a decision support ecosystem in which DSS developers,
decision makers and other domain experts collaborate using a shared platform to
provide and combine reusable decision support services into a tailored DSS. The
contribution of our paper is twofold: First, we define the concept of a decision
support ecosystem with respect to existing digital business ecosystems and discuss
expected benefits and challenges. Second, we present a reference architecture
for a shared platform supporting the realization of a decision support ecosystem.
We demonstrate our contributions in the example application domain of regional
energy distribution network planning."
author:
- first_name: Jonas
full_name: Kirchhoff, Jonas
id: '39928'
last_name: Kirchhoff
- first_name: Christoph
full_name: Weskamp, Christoph
last_name: Weskamp
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Kirchhoff J, Weskamp C, Engels G. Decision Support Ecosystems: Definition and
Platform Architecture. In: Decision Support Systems XII: Decision Support Addressing
Modern Industry, Business, and Societal Needs. Vol 447. Lecture Notes in Business
Information Processing . Springer; 2022. doi:10.1007/978-3-031-06530-9_8'
apa: 'Kirchhoff, J., Weskamp, C., & Engels, G. (2022). Decision Support Ecosystems:
Definition and Platform Architecture. In Decision Support Systems XII: Decision
Support Addressing Modern Industry, Business, and Societal Needs (Vol. 447).
Springer. https://doi.org/10.1007/978-3-031-06530-9_8'
bibtex: '@inbook{Kirchhoff_Weskamp_Engels_2022, series={Lecture Notes in Business
Information Processing }, title={Decision Support Ecosystems: Definition and Platform
Architecture}, volume={447}, DOI={10.1007/978-3-031-06530-9_8},
booktitle={Decision Support Systems XII: Decision Support Addressing Modern Industry,
Business, and Societal Needs}, publisher={Springer}, author={Kirchhoff, Jonas
and Weskamp, Christoph and Engels, Gregor}, year={2022}, collection={Lecture Notes
in Business Information Processing } }'
chicago: 'Kirchhoff, Jonas, Christoph Weskamp, and Gregor Engels. “Decision Support
Ecosystems: Definition and Platform Architecture.” In Decision Support Systems
XII: Decision Support Addressing Modern Industry, Business, and Societal Needs,
Vol. 447. Lecture Notes in Business Information Processing . Springer, 2022. https://doi.org/10.1007/978-3-031-06530-9_8.'
ieee: 'J. Kirchhoff, C. Weskamp, and G. Engels, “Decision Support Ecosystems: Definition
and Platform Architecture,” in Decision Support Systems XII: Decision Support
Addressing Modern Industry, Business, and Societal Needs, vol. 447, Springer,
2022.'
mla: 'Kirchhoff, Jonas, et al. “Decision Support Ecosystems: Definition and Platform
Architecture.” Decision Support Systems XII: Decision Support Addressing Modern
Industry, Business, and Societal Needs, vol. 447, Springer, 2022, doi:10.1007/978-3-031-06530-9_8.'
short: 'J. Kirchhoff, C. Weskamp, G. Engels, in: Decision Support Systems XII: Decision
Support Addressing Modern Industry, Business, and Societal Needs, Springer, 2022.'
conference:
name: 8th International Conference on Decision Support System Technology (ICDSST'22)
date_created: 2022-04-25T11:33:09Z
date_updated: 2022-09-07T08:56:38Z
ddc:
- '000'
department:
- _id: '534'
- _id: '66'
doi: 10.1007/978-3-031-06530-9_8
file:
- access_level: closed
content_type: application/pdf
creator: jonaskir
date_created: 2022-04-25T11:34:18Z
date_updated: 2022-04-25T11:34:18Z
file_id: '30942'
file_name: ICDSST22_5504_Paper.pdf
file_size: 425852
relation: main_file
success: 1
file_date_updated: 2022-04-25T11:34:18Z
has_accepted_license: '1'
intvolume: ' 447'
language:
- iso: eng
publication: 'Decision Support Systems XII: Decision Support Addressing Modern Industry,
Business, and Societal Needs'
publisher: Springer
series_title: 'Lecture Notes in Business Information Processing '
status: public
title: 'Decision Support Ecosystems: Definition and Platform Architecture'
type: book_chapter
user_id: '39928'
volume: 447
year: '2022'
...