---
_id: '22511'
abstract:
- lang: eng
text: "In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center
algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile
robots with limited viewing range in the plane. Remarquably, this algorithm exploits
the fact that during its execution, many collisions of robots occur. Such collisions
are interpreted as a success because it is assumed that such collided robots behave
the same from now on. This is acceptable under the assumption that each robot
is represented by a single point. Otherwise, collisions should be avoided. In
this paper, we consider a continuous Go-To-The-Center algorithm in which the robots
continuously observe the positions of their neighbors and adapt their speed (assuming
a speed limit) and direction. Our first results are time bounds of O(n2) for gathering
in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution
is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center
considering only the neighbors of a robot with respect to the Gabriel subgraph
of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that
this modification still correctly executes gathering in one and two dimensions,
with the same time bounds as above. Simulations exhibit a severe difference of
the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms:
Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm,
typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center
algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center
algorithm for one dimension. In two-dimensional Euclidean space, we conjecture
that the “collisionless property” holds for almost every initial configuration.
We support our conjecture with measurements obtained from the simulation where
robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n"
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Pavel
full_name: Podlipyan, Pavel
last_name: Podlipyan
citation:
ama: Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph
of the visibility graph on the gathering of mobile autonomous robots. Theoretical
Computer Science. 2021;852:29-40. doi:10.1016/j.tcs.2020.11.009
apa: Li, S., Meyer auf der Heide, F., & Podlipyan, P. (2021). The impact of
the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots. Theoretical Computer Science, 852, 29–40. https://doi.org/10.1016/j.tcs.2020.11.009
bibtex: '@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the
Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
robots}, volume={852}, DOI={10.1016/j.tcs.2020.11.009},
journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der
Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }'
chicago: 'Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The
Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile
Autonomous Robots.” Theoretical Computer Science 852 (2021): 29–40. https://doi.org/10.1016/j.tcs.2020.11.009.'
ieee: S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel
subgraph of the visibility graph on the gathering of mobile autonomous robots,”
Theoretical Computer Science, vol. 852, pp. 29–40, 2021.
mla: Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph
on the Gathering of Mobile Autonomous Robots.” Theoretical Computer Science,
vol. 852, 2021, pp. 29–40, doi:10.1016/j.tcs.2020.11.009.
short: S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science
852 (2021) 29–40.
date_created: 2021-06-28T09:34:45Z
date_updated: 2022-01-06T06:55:35Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.11.009
intvolume: ' 852'
keyword:
- Local algorithms
- Distributed algorithms
- Collisionless gathering
- Mobile robots
- Multiagent system
language:
- iso: eng
page: 29-40
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: The impact of the Gabriel subgraph of the visibility graph on the gathering
of mobile autonomous robots
type: journal_article
user_id: '15415'
volume: 852
year: '2021'
...
---
_id: '22532'
abstract:
- lang: eng
text: In this publication, further elements of the newly developed inductive localization
in the near field are presented. The advantage of inductive localization is the
usage of the magnetic fields, which have a very low influence of non-metallic
materials in the environment and thus follows good applications in the area of
medicine and biochemistry. This allows a precise localization of sensor platforms
in inhomogeneous mixtures of materials, where classical methods have major problems
with inhomogeneous dielectric conductivity or density. The calculation of the
localization of the searched object differs from other methods such as ultrasound
or electromagnetic waves due to the source-free propagation of the magnetic field.
Therefore, new mathematical evaluation methods and systematic adaptations are
necessary, which are presented in this paper in circuit analysis. For this purpose,
the exact circuit influences of one coil and the influence of another coil are
investigated and which resonance circuit should be selected for both coils for
a inductive localization with optimized signal strength.
author:
- first_name: Sven
full_name: Lange, Sven
id: '38240'
last_name: Lange
- first_name: Christian
full_name: Hedayat, Christian
last_name: Hedayat
- first_name: Harald
full_name: Kuhn, Harald
last_name: Kuhn
- first_name: Ulrich
full_name: Hilleringmann, Ulrich
last_name: Hilleringmann
citation:
ama: 'Lange S, Hedayat C, Kuhn H, Hilleringmann U. Adaptation and Optimization of
Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization
in the Near Field. In: 2021 Smart Systems Integration (SSI). Grenoble,
France: IEEE; 2021. doi:10.1109/ssi52265.2021.9466958'
apa: 'Lange, S., Hedayat, C., Kuhn, H., & Hilleringmann, U. (2021). Adaptation
and Optimization of Planar Coils for a More Accurate and Far-Reaching Magnetic
Field-Based Localization in the Near Field. In 2021 Smart Systems Integration
(SSI). Grenoble, France: IEEE. https://doi.org/10.1109/ssi52265.2021.9466958'
bibtex: '@inproceedings{Lange_Hedayat_Kuhn_Hilleringmann_2021, place={Grenoble,
France}, title={Adaptation and Optimization of Planar Coils for a More Accurate
and Far-Reaching Magnetic Field-Based Localization in the Near Field}, DOI={10.1109/ssi52265.2021.9466958},
booktitle={2021 Smart Systems Integration (SSI)}, publisher={IEEE}, author={Lange,
Sven and Hedayat, Christian and Kuhn, Harald and Hilleringmann, Ulrich}, year={2021}
}'
chicago: 'Lange, Sven, Christian Hedayat, Harald Kuhn, and Ulrich Hilleringmann.
“Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching
Magnetic Field-Based Localization in the Near Field.” In 2021 Smart Systems
Integration (SSI). Grenoble, France: IEEE, 2021. https://doi.org/10.1109/ssi52265.2021.9466958.'
ieee: S. Lange, C. Hedayat, H. Kuhn, and U. Hilleringmann, “Adaptation and Optimization
of Planar Coils for a More Accurate and Far-Reaching Magnetic Field-Based Localization
in the Near Field,” in 2021 Smart Systems Integration (SSI), Grenoble,
France , 2021.
mla: Lange, Sven, et al. “Adaptation and Optimization of Planar Coils for a More
Accurate and Far-Reaching Magnetic Field-Based Localization in the Near Field.”
2021 Smart Systems Integration (SSI), IEEE, 2021, doi:10.1109/ssi52265.2021.9466958.
short: 'S. Lange, C. Hedayat, H. Kuhn, U. Hilleringmann, in: 2021 Smart Systems
Integration (SSI), IEEE, Grenoble, France, 2021.'
conference:
end_date: 2021-04-29
location: 'Grenoble, France '
name: 2021 Smart Systems Integration (SSI)
start_date: 2021-04-27
date_created: 2021-07-05T19:31:52Z
date_updated: 2022-01-06T06:55:36Z
department:
- _id: '59'
- _id: '485'
doi: 10.1109/ssi52265.2021.9466958
keyword:
- Electrotechnical Characteristics of Real Coils
- Inductive Localization
- Resonant Circuit
- Mutual Inductance
- Near-Field
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/document/9466958
place: Grenoble, France
publication: 2021 Smart Systems Integration (SSI)
publication_identifier:
isbn:
- '9781665440929'
publication_status: published
publisher: IEEE
status: public
title: Adaptation and Optimization of Planar Coils for a More Accurate and Far-Reaching
Magnetic Field-Based Localization in the Near Field
type: conference
user_id: '38240'
year: '2021'
...
---
_id: '22814'
article_number: 10:1
author:
- first_name: Nils
full_name: Weidmann, Nils
id: '53103'
last_name: Weidmann
- first_name: Shubhangi
full_name: Salunkhe, Shubhangi
last_name: Salunkhe
- first_name: Anthony
full_name: Anjorin, Anthony
last_name: Anjorin
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: Weidmann N, Salunkhe S, Anjorin A, Yigitbas E, Engels G. Automating Model Transformations
for Railway Systems Engineering. The Journal of Object Technology. 2021.
doi:10.5381/jot.2021.20.3.a10
apa: Weidmann, N., Salunkhe, S., Anjorin, A., Yigitbas, E., & Engels, G. (2021).
Automating Model Transformations for Railway Systems Engineering. The Journal
of Object Technology. https://doi.org/10.5381/jot.2021.20.3.a10
bibtex: '@article{Weidmann_Salunkhe_Anjorin_Yigitbas_Engels_2021, title={Automating
Model Transformations for Railway Systems Engineering.}, DOI={10.5381/jot.2021.20.3.a10},
number={10:1}, journal={The Journal of Object Technology}, author={Weidmann, Nils
and Salunkhe, Shubhangi and Anjorin, Anthony and Yigitbas, Enes and Engels, Gregor},
year={2021} }'
chicago: Weidmann, Nils, Shubhangi Salunkhe, Anthony Anjorin, Enes Yigitbas, and
Gregor Engels. “Automating Model Transformations for Railway Systems Engineering.”
The Journal of Object Technology, 2021. https://doi.org/10.5381/jot.2021.20.3.a10.
ieee: N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, and G. Engels, “Automating
Model Transformations for Railway Systems Engineering.,” The Journal of Object
Technology, 2021.
mla: Weidmann, Nils, et al. “Automating Model Transformations for Railway Systems
Engineering.” The Journal of Object Technology, 10:1, 2021, doi:10.5381/jot.2021.20.3.a10.
short: N. Weidmann, S. Salunkhe, A. Anjorin, E. Yigitbas, G. Engels, The Journal
of Object Technology (2021).
date_created: 2021-07-26T13:54:55Z
date_updated: 2022-01-06T06:55:42Z
department:
- _id: '66'
- _id: '534'
doi: 10.5381/jot.2021.20.3.a10
language:
- iso: eng
publication: The Journal of Object Technology
publication_identifier:
issn:
- 1660-1769
publication_status: published
status: public
title: Automating Model Transformations for Railway Systems Engineering.
type: journal_article
user_id: '8447'
year: '2021'
...
---
_id: '22819'
author:
- first_name: Enes
full_name: Yigitbas, Enes
id: '8447'
last_name: Yigitbas
orcid: 0000-0002-5967-833X
- first_name: Kadiray
full_name: Karakaya, Kadiray
id: '70410'
last_name: Karakaya
orcid: https://orcid.org/0000-0001-9266-2084
- first_name: Ivan
full_name: Jovanovikj, Ivan
last_name: Jovanovikj
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Yigitbas E, Karakaya K, Jovanovikj I, Engels G. Enhancing Human-in-the-Loop
Adaptive Systems through Digital Twins and VR Interfaces. In: 2021 International
Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS).
; 2021. doi:10.1109/seams51251.2021.00015'
apa: Yigitbas, E., Karakaya, K., Jovanovikj, I., & Engels, G. (2021). Enhancing
Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces. In
2021 International Symposium on Software Engineering for Adaptive and Self-Managing
Systems (SEAMS). https://doi.org/10.1109/seams51251.2021.00015
bibtex: '@inproceedings{Yigitbas_Karakaya_Jovanovikj_Engels_2021, title={Enhancing
Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces}, DOI={10.1109/seams51251.2021.00015},
booktitle={2021 International Symposium on Software Engineering for Adaptive and
Self-Managing Systems (SEAMS)}, author={Yigitbas, Enes and Karakaya, Kadiray and
Jovanovikj, Ivan and Engels, Gregor}, year={2021} }'
chicago: Yigitbas, Enes, Kadiray Karakaya, Ivan Jovanovikj, and Gregor Engels. “Enhancing
Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces.” In
2021 International Symposium on Software Engineering for Adaptive and Self-Managing
Systems (SEAMS), 2021. https://doi.org/10.1109/seams51251.2021.00015.
ieee: E. Yigitbas, K. Karakaya, I. Jovanovikj, and G. Engels, “Enhancing Human-in-the-Loop
Adaptive Systems through Digital Twins and VR Interfaces,” in 2021 International
Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS),
2021.
mla: Yigitbas, Enes, et al. “Enhancing Human-in-the-Loop Adaptive Systems through
Digital Twins and VR Interfaces.” 2021 International Symposium on Software
Engineering for Adaptive and Self-Managing Systems (SEAMS), 2021, doi:10.1109/seams51251.2021.00015.
short: 'E. Yigitbas, K. Karakaya, I. Jovanovikj, G. Engels, in: 2021 International
Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS),
2021.'
date_created: 2021-07-27T08:34:48Z
date_updated: 2022-01-06T06:55:42Z
department:
- _id: '66'
- _id: '534'
doi: 10.1109/seams51251.2021.00015
language:
- iso: eng
publication: 2021 International Symposium on Software Engineering for Adaptive and
Self-Managing Systems (SEAMS)
publication_status: published
status: public
title: Enhancing Human-in-the-Loop Adaptive Systems through Digital Twins and VR Interfaces
type: conference
user_id: '8447'
year: '2021'
...
---
_id: '22913'
author:
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Alexander
full_name: Tornede, Alexander
id: '38209'
last_name: Tornede
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: 'Hüllermeier E, Mohr F, Tornede A, Wever MD. Automated Machine Learning, Bounded
Rationality, and Rational Metareasoning. In: ; 2021.'
apa: Hüllermeier, E., Mohr, F., Tornede, A., & Wever, M. D. (2021). Automated
Machine Learning, Bounded Rationality, and Rational Metareasoning. ECML/PKDD
Workshop on Automating Data Science, Bilbao (Virtual).
bibtex: '@inproceedings{Hüllermeier_Mohr_Tornede_Wever_2021, title={Automated Machine
Learning, Bounded Rationality, and Rational Metareasoning}, author={Hüllermeier,
Eyke and Mohr, Felix and Tornede, Alexander and Wever, Marcel Dominik}, year={2021}
}'
chicago: Hüllermeier, Eyke, Felix Mohr, Alexander Tornede, and Marcel Dominik Wever.
“Automated Machine Learning, Bounded Rationality, and Rational Metareasoning,”
2021.
ieee: E. Hüllermeier, F. Mohr, A. Tornede, and M. D. Wever, “Automated Machine Learning,
Bounded Rationality, and Rational Metareasoning,” presented at the ECML/PKDD Workshop
on Automating Data Science, Bilbao (Virtual), 2021.
mla: Hüllermeier, Eyke, et al. Automated Machine Learning, Bounded Rationality,
and Rational Metareasoning. 2021.
short: 'E. Hüllermeier, F. Mohr, A. Tornede, M.D. Wever, in: 2021.'
conference:
end_date: 2021-09-17
location: Bilbao (Virtual)
name: ECML/PKDD Workshop on Automating Data Science
start_date: 2021-09-13
date_created: 2021-08-02T07:46:29Z
date_updated: 2022-01-06T06:55:43Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '10'
name: SFB 901 - Subproject B2
quality_controlled: '1'
status: public
title: Automated Machine Learning, Bounded Rationality, and Rational Metareasoning
type: conference
user_id: '5786'
year: '2021'
...
---
_id: '22914'
author:
- first_name: Felix
full_name: Mohr, Felix
last_name: Mohr
- first_name: Marcel Dominik
full_name: Wever, Marcel Dominik
id: '33176'
last_name: Wever
orcid: ' https://orcid.org/0000-0001-9782-6818'
citation:
ama: 'Mohr F, Wever MD. Replacing the Ex-Def Baseline in AutoML by Naive AutoML.
In: ; 2021.'
apa: Mohr, F., & Wever, M. D. (2021). Replacing the Ex-Def Baseline in AutoML
by Naive AutoML. 8th ICML Workshop on Automated Machine Learning, Virtual.
bibtex: '@inproceedings{Mohr_Wever_2021, title={Replacing the Ex-Def Baseline in
AutoML by Naive AutoML}, author={Mohr, Felix and Wever, Marcel Dominik}, year={2021}
}'
chicago: Mohr, Felix, and Marcel Dominik Wever. “Replacing the Ex-Def Baseline in
AutoML by Naive AutoML,” 2021.
ieee: F. Mohr and M. D. Wever, “Replacing the Ex-Def Baseline in AutoML by Naive
AutoML,” presented at the 8th ICML Workshop on Automated Machine Learning, Virtual,
2021.
mla: Mohr, Felix, and Marcel Dominik Wever. Replacing the Ex-Def Baseline in
AutoML by Naive AutoML. 2021.
short: 'F. Mohr, M.D. Wever, in: 2021.'
conference:
end_date: 2021-07-23
location: Virtual
name: 8th ICML Workshop on Automated Machine Learning
start_date: 2021-07-23
date_created: 2021-08-02T07:48:07Z
date_updated: 2022-01-06T06:55:43Z
department:
- _id: '34'
- _id: '355'
- _id: '26'
language:
- iso: eng
status: public
title: Replacing the Ex-Def Baseline in AutoML by Naive AutoML
type: conference
user_id: '5786'
year: '2021'
...
---
_id: '22927'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Simon
full_name: Doherty, Simon
last_name: Doherty
- first_name: Brijesh
full_name: Dongol, Brijesh
last_name: Dongol
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. On Strong Observational
Refinement and Forward Simulation. In: Proceedings of the 35th International
Symposium on Distributed Computing (DISC). Leibniz International Proceedings
in Informatics. Schloß Dagstuhl.'
apa: Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., & Wehrheim, H. (n.d.).
On Strong Observational Refinement and Forward Simulation. In Proceedings of
the 35th International Symposium on Distributed Computing (DISC). Schloß Dagstuhl.
bibtex: '@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim, series={Leibniz
International Proceedings in Informatics}, title={On Strong Observational Refinement
and Forward Simulation}, booktitle={Proceedings of the 35th International Symposium
on Distributed Computing (DISC)}, publisher={Schloß Dagstuhl}, author={Derrick,
John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim,
Heike}, collection={Leibniz International Proceedings in Informatics} }'
chicago: Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike
Wehrheim. “On Strong Observational Refinement and Forward Simulation.” In Proceedings
of the 35th International Symposium on Distributed Computing (DISC). Leibniz
International Proceedings in Informatics. Schloß Dagstuhl, n.d.
ieee: J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “On Strong
Observational Refinement and Forward Simulation,” in Proceedings of the 35th
International Symposium on Distributed Computing (DISC).
mla: Derrick, John, et al. “On Strong Observational Refinement and Forward Simulation.”
Proceedings of the 35th International Symposium on Distributed Computing (DISC),
Schloß Dagstuhl.
short: 'J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Proceedings
of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl,
n.d.'
date_created: 2021-08-03T07:38:56Z
date_updated: 2022-01-06T06:55:43Z
department:
- _id: '7'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Proceedings of the 35th International Symposium on Distributed Computing
(DISC)
publication_status: accepted
publisher: Schloß Dagstuhl
series_title: Leibniz International Proceedings in Informatics
status: public
title: On Strong Observational Refinement and Forward Simulation
type: conference
user_id: '477'
year: '2021'
...
---
_id: '22959'
author:
- first_name: Nils
full_name: Weidmann, Nils
id: '53103'
last_name: Weidmann
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Weidmann N, Engels G. Concurrent model synchronisation with multiple objectives.
In: Proceedings of the Genetic and Evolutionary Computation Conference.
; 2021. doi:10.1145/3449639.3459283'
apa: Weidmann, N., & Engels, G. (2021). Concurrent model synchronisation with
multiple objectives. In Proceedings of the Genetic and Evolutionary Computation
Conference. Lille, France. https://doi.org/10.1145/3449639.3459283
bibtex: '@inproceedings{Weidmann_Engels_2021, title={Concurrent model synchronisation
with multiple objectives}, DOI={10.1145/3449639.3459283},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
author={Weidmann, Nils and Engels, Gregor}, year={2021} }'
chicago: Weidmann, Nils, and Gregor Engels. “Concurrent Model Synchronisation with
Multiple Objectives.” In Proceedings of the Genetic and Evolutionary Computation
Conference, 2021. https://doi.org/10.1145/3449639.3459283.
ieee: N. Weidmann and G. Engels, “Concurrent model synchronisation with multiple
objectives,” in Proceedings of the Genetic and Evolutionary Computation Conference,
Lille, France, 2021.
mla: Weidmann, Nils, and Gregor Engels. “Concurrent Model Synchronisation with Multiple
Objectives.” Proceedings of the Genetic and Evolutionary Computation Conference,
2021, doi:10.1145/3449639.3459283.
short: 'N. Weidmann, G. Engels, in: Proceedings of the Genetic and Evolutionary
Computation Conference, 2021.'
conference:
end_date: 2021-07-14
location: Lille, France
name: 'GECCO ''21: Genetic and Evolutionary Computation Conference'
start_date: 2021-07-10
date_created: 2021-08-07T15:18:48Z
date_updated: 2022-01-06T06:55:44Z
department:
- _id: '28'
- _id: '66'
doi: 10.1145/3449639.3459283
language:
- iso: eng
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_status: published
status: public
title: Concurrent model synchronisation with multiple objectives
type: conference
user_id: '53103'
year: '2021'
...
---
_id: '23374'
author:
- first_name: Sriteja
full_name: Kummita, Sriteja
last_name: Kummita
- first_name: Goran
full_name: Piskachev, Goran
last_name: Piskachev
- first_name: Johannes
full_name: Spath, Johannes
last_name: Spath
- first_name: Eric
full_name: Bodden, Eric
last_name: Bodden
citation:
ama: 'Kummita S, Piskachev G, Spath J, Bodden E. Qualitative and Quantitative Analysis
of Callgraph Algorithms for Python. In: 2021 International Conference on Code
Quality (ICCQ). ; 2021. doi:10.1109/iccq51190.2021.9392986'
apa: Kummita, S., Piskachev, G., Spath, J., & Bodden, E. (2021). Qualitative
and Quantitative Analysis of Callgraph Algorithms for Python. 2021 International
Conference on Code Quality (ICCQ). https://doi.org/10.1109/iccq51190.2021.9392986
bibtex: '@inproceedings{Kummita_Piskachev_Spath_Bodden_2021, title={Qualitative
and Quantitative Analysis of Callgraph Algorithms for Python}, DOI={10.1109/iccq51190.2021.9392986},
booktitle={2021 International Conference on Code Quality (ICCQ)}, author={Kummita,
Sriteja and Piskachev, Goran and Spath, Johannes and Bodden, Eric}, year={2021}
}'
chicago: Kummita, Sriteja, Goran Piskachev, Johannes Spath, and Eric Bodden. “Qualitative
and Quantitative Analysis of Callgraph Algorithms for Python.” In 2021 International
Conference on Code Quality (ICCQ), 2021. https://doi.org/10.1109/iccq51190.2021.9392986.
ieee: 'S. Kummita, G. Piskachev, J. Spath, and E. Bodden, “Qualitative and Quantitative
Analysis of Callgraph Algorithms for Python,” 2021, doi: 10.1109/iccq51190.2021.9392986.'
mla: Kummita, Sriteja, et al. “Qualitative and Quantitative Analysis of Callgraph
Algorithms for Python.” 2021 International Conference on Code Quality (ICCQ),
2021, doi:10.1109/iccq51190.2021.9392986.
short: 'S. Kummita, G. Piskachev, J. Spath, E. Bodden, in: 2021 International Conference
on Code Quality (ICCQ), 2021.'
date_created: 2021-08-09T12:01:11Z
date_updated: 2022-01-06T06:55:50Z
department:
- _id: '241'
- _id: '662'
- _id: '76'
doi: 10.1109/iccq51190.2021.9392986
language:
- iso: eng
publication: 2021 International Conference on Code Quality (ICCQ)
publication_status: published
status: public
title: Qualitative and Quantitative Analysis of Callgraph Algorithms for Python
type: conference
user_id: '5786'
year: '2021'
...
---
_id: '21727'
abstract:
- lang: eng
text: 'Platform-based business models underlie the success of many of today’s largest,
fastest-growing, and most disruptive companies. Despite the success of prominent
examples, such as Uber and Airbnb, creating a profitable platform ecosystem presents
a key challenge for many companies across all industries. Although research provides
knowledge about platforms’ different value drivers (e.g., network effects), companies
that seek to transform their current business model into a platform-based one
lack an artifact to reduce knowledge boundaries, collaborate effectively, and
cope with the complexities and dynamics of platform ecosystems. We address this
challenge by developing two artifacts and combining research from variability
modeling, business model dependencies, and system dynamics. This paper presents
a design science research approach to develop the platform ecosystem modeling
language and the platform ecosystem development tool that support researcher and
practitioner by visualizing and simulating platform ecosystems. '
author:
- first_name: Christian
full_name: Vorbohle, Christian
id: '29951'
last_name: Vorbohle
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
citation:
ama: 'Vorbohle C, Gottschalk S. Towards Visualizing and Simulating Business Models
in Dynamic Platform Ecosystems . In: Proceedings of the 29th European Conference
on Information Systems (ECIS). AIS.'
apa: 'Vorbohle, C., & Gottschalk, S. (n.d.). Towards Visualizing and Simulating
Business Models in Dynamic Platform Ecosystems . In Proceedings of the 29th
European Conference on Information Systems (ECIS). Virtual Conference/Workshop:
AIS.'
bibtex: '@inproceedings{Vorbohle_Gottschalk, title={Towards Visualizing and Simulating
Business Models in Dynamic Platform Ecosystems }, booktitle={Proceedings of the
29th European Conference on Information Systems (ECIS)}, publisher={AIS}, author={Vorbohle,
Christian and Gottschalk, Sebastian} }'
chicago: Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and
Simulating Business Models in Dynamic Platform Ecosystems .” In Proceedings
of the 29th European Conference on Information Systems (ECIS). AIS, n.d.
ieee: C. Vorbohle and S. Gottschalk, “Towards Visualizing and Simulating Business
Models in Dynamic Platform Ecosystems ,” in Proceedings of the 29th European
Conference on Information Systems (ECIS), Virtual Conference/Workshop.
mla: Vorbohle, Christian, and Sebastian Gottschalk. “Towards Visualizing and Simulating
Business Models in Dynamic Platform Ecosystems .” Proceedings of the 29th European
Conference on Information Systems (ECIS), AIS.
short: 'C. Vorbohle, S. Gottschalk, in: Proceedings of the 29th European Conference
on Information Systems (ECIS), AIS, n.d.'
conference:
location: Virtual Conference/Workshop
name: 29th European Conference on Information Systems (ECIS)
date_created: 2021-04-23T13:38:54Z
date_updated: 2022-01-06T06:55:12Z
department:
- _id: '66'
- _id: '534'
- _id: '276'
keyword:
- Platform Ecosystems
- Platform Ecosystem Modeling Language
- Platform Ecosystem Development Tool
- Business Models
- Design Science
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '17'
name: SFB 901 - Subproject C5
publication: Proceedings of the 29th European Conference on Information Systems (ECIS)
publication_status: accepted
publisher: AIS
status: public
title: 'Towards Visualizing and Simulating Business Models in Dynamic Platform Ecosystems '
type: conference
user_id: '47208'
year: '2021'
...
---
_id: '21808'
abstract:
- lang: eng
text: "Modern services consist of interconnected components,e.g., microservices
in a service mesh or machine learning functions in a pipeline. These services
can scale and run across multiple network nodes on demand. To process incoming
traffic, service components have to be instantiated and traffic assigned to these
instances, taking capacities, changing demands, and Quality of Service (QoS) requirements
into account. This challenge is usually solved with custom approaches designed
by experts. While this typically works well for the considered scenario, the models
often rely on unrealistic assumptions or on knowledge that is not available in
practice (e.g., a priori knowledge).\r\n\r\nWe propose DeepCoord, a novel deep
reinforcement learning approach that learns how to best coordinate services and
is geared towards realistic assumptions. It interacts with the network and relies
on available, possibly delayed monitoring information. Rather than defining a
complex model or an algorithm on how to achieve an objective, our model-free approach
adapts to various objectives and traffic patterns. An agent is trained offline
without expert knowledge and then applied online with minimal overhead. Compared
to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput
(up to 76%) and overall network utility (more than 2x) on realworld network topologies
and traffic traces. It also supports optimizing multiple, possibly competing objectives,
learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic
traffic, and scales to large real-world networks. For reproducibility and reuse,
our code is publicly available."
article_type: original
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Adnan
full_name: Manzoor, Adnan
last_name: Manzoor
- first_name: Haydar
full_name: Qarawlus, Haydar
last_name: Qarawlus
- first_name: Rafael
full_name: Schellenberg, Rafael
last_name: Schellenberg
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Artur
full_name: Hecker, Artur
last_name: Hecker
citation:
ama: Schneider SB, Khalili R, Manzoor A, et al. Self-Learning Multi-Objective Service
Coordination Using Deep Reinforcement Learning. Transactions on Network and
Service Management. 2021. doi:10.1109/TNSM.2021.3076503
apa: Schneider, S. B., Khalili, R., Manzoor, A., Qarawlus, H., Schellenberg, R.,
Karl, H., & Hecker, A. (2021). Self-Learning Multi-Objective Service Coordination
Using Deep Reinforcement Learning. Transactions on Network and Service Management.
https://doi.org/10.1109/TNSM.2021.3076503
bibtex: '@article{Schneider_Khalili_Manzoor_Qarawlus_Schellenberg_Karl_Hecker_2021,
title={Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement
Learning}, DOI={10.1109/TNSM.2021.3076503},
journal={Transactions on Network and Service Management}, publisher={IEEE}, author={Schneider,
Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and
Schellenberg, Rafael and Karl, Holger and Hecker, Artur}, year={2021} }'
chicago: Schneider, Stefan Balthasar, Ramin Khalili, Adnan Manzoor, Haydar Qarawlus,
Rafael Schellenberg, Holger Karl, and Artur Hecker. “Self-Learning Multi-Objective
Service Coordination Using Deep Reinforcement Learning.” Transactions on Network
and Service Management, 2021. https://doi.org/10.1109/TNSM.2021.3076503.
ieee: S. B. Schneider et al., “Self-Learning Multi-Objective Service Coordination
Using Deep Reinforcement Learning,” Transactions on Network and Service Management,
2021.
mla: Schneider, Stefan Balthasar, et al. “Self-Learning Multi-Objective Service
Coordination Using Deep Reinforcement Learning.” Transactions on Network and
Service Management, IEEE, 2021, doi:10.1109/TNSM.2021.3076503.
short: S.B. Schneider, R. Khalili, A. Manzoor, H. Qarawlus, R. Schellenberg, H.
Karl, A. Hecker, Transactions on Network and Service Management (2021).
date_created: 2021-04-27T08:04:16Z
date_updated: 2022-01-06T06:55:15Z
ddc:
- '000'
department:
- _id: '75'
doi: 10.1109/TNSM.2021.3076503
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2021-04-27T08:01:26Z
date_updated: 2021-04-27T08:01:26Z
description: Author version of the accepted paper
file_id: '21809'
file_name: ris-accepted-version.pdf
file_size: 4172270
relation: main_file
file_date_updated: 2021-04-27T08:01:26Z
has_accepted_license: '1'
keyword:
- network management
- service management
- coordination
- reinforcement learning
- self-learning
- self-adaptation
- multi-objective
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: Transactions on Network and Service Management
publisher: IEEE
status: public
title: Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement
Learning
type: journal_article
user_id: '35343'
year: '2021'
...
---
_id: '21820'
abstract:
- lang: eng
text: The reduction of high-dimensional systems to effective models on a
smaller set of variables is an essential task in many areas of science. For stochastic
dynamics governed by diffusion processes, a general procedure to find effective
equations is the conditioning approach. In this paper, we are interested in the
spectrum of the generator of the resulting effective dynamics, and how it compares
to the spectrum of the full generator. We prove a new relative error bound in
terms of the eigenfunction approximation error for reversible systems. We also
present numerical examples indicating that, if Kramers–Moyal (KM) type approximations
are used to compute the spectrum of the reduced generator, it seems largely insensitive
to the time window used for the KM estimators. We analyze the implications of
these observations for systems driven by underdamped Langevin dynamics, and show
how meaningful effective dynamics can be defined in this setting.
article_number: '134'
author:
- first_name: Feliks
full_name: Nüske, Feliks
id: '81513'
last_name: Nüske
orcid: 0000-0003-2444-7889
- first_name: Péter
full_name: Koltai, Péter
last_name: Koltai
- first_name: Lorenzo
full_name: Boninsegna, Lorenzo
last_name: Boninsegna
- first_name: Cecilia
full_name: Clementi, Cecilia
last_name: Clementi
citation:
ama: Nüske F, Koltai P, Boninsegna L, Clementi C. Spectral Properties of Effective
Dynamics from Conditional Expectations. Entropy. 2021. doi:10.3390/e23020134
apa: Nüske, F., Koltai, P., Boninsegna, L., & Clementi, C. (2021). Spectral
Properties of Effective Dynamics from Conditional Expectations. Entropy.
https://doi.org/10.3390/e23020134
bibtex: '@article{Nüske_Koltai_Boninsegna_Clementi_2021, title={Spectral Properties
of Effective Dynamics from Conditional Expectations}, DOI={10.3390/e23020134},
number={134}, journal={Entropy}, author={Nüske, Feliks and Koltai, Péter and Boninsegna,
Lorenzo and Clementi, Cecilia}, year={2021} }'
chicago: Nüske, Feliks, Péter Koltai, Lorenzo Boninsegna, and Cecilia Clementi.
“Spectral Properties of Effective Dynamics from Conditional Expectations.” Entropy,
2021. https://doi.org/10.3390/e23020134.
ieee: F. Nüske, P. Koltai, L. Boninsegna, and C. Clementi, “Spectral Properties
of Effective Dynamics from Conditional Expectations,” Entropy, 2021.
mla: Nüske, Feliks, et al. “Spectral Properties of Effective Dynamics from Conditional
Expectations.” Entropy, 134, 2021, doi:10.3390/e23020134.
short: F. Nüske, P. Koltai, L. Boninsegna, C. Clementi, Entropy (2021).
date_created: 2021-04-28T18:07:56Z
date_updated: 2022-01-06T06:55:16Z
department:
- _id: '101'
doi: 10.3390/e23020134
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.mdpi.com/1099-4300/23/2/134
oa: '1'
publication: Entropy
publication_identifier:
issn:
- 1099-4300
publication_status: published
status: public
title: Spectral Properties of Effective Dynamics from Conditional Expectations
type: journal_article
user_id: '81513'
year: '2021'
...
---
_id: '21932'
abstract:
- lang: eng
text: Gaussian-beam-like bundles of semi-guided waves propagating in a dielectric
slab can excite modes with high-order optical angular momentum supported by a
circular fiber. We consider a multimode step-index fiber with a high-index coating,
where the waves in the slab are evanescently coupled to the modes of the fiber.
Conditions for effective resonant interaction are identified. Based on a hybrid
analytical–numerical coupled mode model, our simulations predict that substantial
fractions of the input power can be focused into waves with specific orbital angular
momentum, of excellent purity, with a clear distinction between degenerate modes
with opposite vorticity.
author:
- first_name: Manfred
full_name: Hammer, Manfred
id: '48077'
last_name: Hammer
orcid: 0000-0002-6331-9348
- first_name: Lena
full_name: Ebers, Lena
id: '40428'
last_name: Ebers
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
citation:
ama: Hammer M, Ebers L, Förstner J. Resonant evanescent excitation of guided waves
with high-order optical angular momentum. Journal of the Optical Society of
America B. 2021;38(5):1717. doi:10.1364/josab.422731
apa: Hammer, M., Ebers, L., & Förstner, J. (2021). Resonant evanescent excitation
of guided waves with high-order optical angular momentum. Journal of the Optical
Society of America B, 38(5), 1717. https://doi.org/10.1364/josab.422731
bibtex: '@article{Hammer_Ebers_Förstner_2021, title={Resonant evanescent excitation
of guided waves with high-order optical angular momentum}, volume={38}, DOI={10.1364/josab.422731}, number={5},
journal={Journal of the Optical Society of America B}, author={Hammer, Manfred
and Ebers, Lena and Förstner, Jens}, year={2021}, pages={1717} }'
chicago: 'Hammer, Manfred, Lena Ebers, and Jens Förstner. “Resonant Evanescent Excitation
of Guided Waves with High-Order Optical Angular Momentum.” Journal of the Optical
Society of America B 38, no. 5 (2021): 1717. https://doi.org/10.1364/josab.422731.'
ieee: M. Hammer, L. Ebers, and J. Förstner, “Resonant evanescent excitation of guided
waves with high-order optical angular momentum,” Journal of the Optical Society
of America B, vol. 38, no. 5, p. 1717, 2021.
mla: Hammer, Manfred, et al. “Resonant Evanescent Excitation of Guided Waves with
High-Order Optical Angular Momentum.” Journal of the Optical Society of America
B, vol. 38, no. 5, 2021, p. 1717, doi:10.1364/josab.422731.
short: M. Hammer, L. Ebers, J. Förstner, Journal of the Optical Society of America
B 38 (2021) 1717.
date_created: 2021-04-30T11:54:03Z
date_updated: 2022-01-06T06:55:20Z
ddc:
- '530'
department:
- _id: '61'
- _id: '230'
doi: 10.1364/josab.422731
file:
- access_level: open_access
content_type: application/pdf
creator: fossie
date_created: 2021-04-30T11:57:14Z
date_updated: 2021-04-30T11:57:14Z
file_id: '21933'
file_name: oamex.pdf
file_size: 1963211
relation: main_file
- access_level: local
content_type: application/pdf
creator: fossie
date_created: 2021-04-30T11:59:16Z
date_updated: 2021-04-30T11:59:16Z
embargo: 2022-05-01
embargo_to: open_access
file_id: '21934'
file_name: 2021-04 Hammer - JOSA B - Resonant evanescent excitation of guides waves
with high-order angular momentum.pdf
file_size: 7750006
relation: main_file
file_date_updated: 2021-04-30T11:59:16Z
has_accepted_license: '1'
intvolume: ' 38'
issue: '5'
keyword:
- tet_topic_waveguides
language:
- iso: eng
oa: '1'
page: '1717'
project:
- _id: '56'
name: TRR 142 - Project Area C
- _id: '53'
name: TRR 142
- _id: '75'
name: TRR 142 - Subproject C5
publication: Journal of the Optical Society of America B
publication_identifier:
issn:
- 0740-3224
- 1520-8540
publication_status: published
status: public
title: Resonant evanescent excitation of guided waves with high-order optical angular
momentum
type: journal_article
user_id: '158'
volume: 38
year: '2021'
...
---
_id: '22013'
author:
- first_name: Henning
full_name: Zeipert, Henning
id: '32580'
last_name: Zeipert
- first_name: Leander
full_name: Claes, Leander
id: '11829'
last_name: Claes
orcid: 0000-0002-4393-268X
- first_name: Sarah
full_name: Johannesmann, Sarah
id: '29190'
last_name: Johannesmann
- first_name: Manuel
full_name: Webersen, Manuel
id: '11289'
last_name: Webersen
orcid: 0000-0001-6411-4232
- first_name: Yevgeniya
full_name: Lugovtsova, Yevgeniya
last_name: Lugovtsova
- first_name: Jens
full_name: Prager, Jens
last_name: Prager
- first_name: Bernd
full_name: Henning, Bernd
id: '213'
last_name: Henning
citation:
ama: 'Zeipert H, Claes L, Johannesmann S, et al. Measurement and Simulation of Lamb
Waves in Adhesive-bonded Multilayer Systems. In: ; 2021:91-92. doi:10.5162/SMSI2021/A8.2'
apa: Zeipert, H., Claes, L., Johannesmann, S., Webersen, M., Lugovtsova, Y., Prager,
J., & Henning, B. (2021). Measurement and Simulation of Lamb Waves in Adhesive-bonded
Multilayer Systems (pp. 91–92). Presented at the Sensor and Measurement Science
International, Nürnberg. https://doi.org/10.5162/SMSI2021/A8.2
bibtex: '@inproceedings{Zeipert_Claes_Johannesmann_Webersen_Lugovtsova_Prager_Henning_2021,
title={Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer
Systems}, DOI={10.5162/SMSI2021/A8.2},
author={Zeipert, Henning and Claes, Leander and Johannesmann, Sarah and Webersen,
Manuel and Lugovtsova, Yevgeniya and Prager, Jens and Henning, Bernd}, year={2021},
pages={91–92} }'
chicago: Zeipert, Henning, Leander Claes, Sarah Johannesmann, Manuel Webersen, Yevgeniya
Lugovtsova, Jens Prager, and Bernd Henning. “Measurement and Simulation of Lamb
Waves in Adhesive-Bonded Multilayer Systems,” 91–92, 2021. https://doi.org/10.5162/SMSI2021/A8.2.
ieee: H. Zeipert et al., “Measurement and Simulation of Lamb Waves in Adhesive-bonded
Multilayer Systems,” presented at the Sensor and Measurement Science International,
Nürnberg, 2021, pp. 91–92.
mla: Zeipert, Henning, et al. Measurement and Simulation of Lamb Waves in Adhesive-Bonded
Multilayer Systems. 2021, pp. 91–92, doi:10.5162/SMSI2021/A8.2.
short: 'H. Zeipert, L. Claes, S. Johannesmann, M. Webersen, Y. Lugovtsova, J. Prager,
B. Henning, in: 2021, pp. 91–92.'
conference:
location: Nürnberg
name: Sensor and Measurement Science International
date_created: 2021-05-07T07:33:54Z
date_updated: 2022-01-06T06:55:22Z
department:
- _id: '49'
doi: 10.5162/SMSI2021/A8.2
language:
- iso: eng
page: 91 - 92
project:
- _id: '105'
grant_number: '449607253'
name: Vermiedene Kreuzungen von Lamb-Wellenmoden in mehrlagigen Strukturen
status: public
title: Measurement and Simulation of Lamb Waves in Adhesive-bonded Multilayer Systems
type: conference
user_id: '32580'
year: '2021'
...
---
_id: '22057'
abstract:
- lang: eng
text: "We construct more efficient cryptosystems with provable\r\nsecurity against
adaptive attacks, based on simple and natural hardness\r\nassumptions in the standard
model. Concretely, we describe:\r\n– An adaptively-secure variant of the efficient,
selectively-secure LWE-\r\nbased identity-based encryption (IBE) scheme of Agrawal,
Boneh,\r\nand Boyen (EUROCRYPT 2010). In comparison to the previously\r\nmost
efficient such scheme by Yamada (CRYPTO 2017) we achieve\r\nsmaller lattice parameters
and shorter public keys of size O(log λ),\r\nwhere λ is the security parameter.\r\n–
Adaptively-secure variants of two efficient selectively-secure pairing-\r\nbased
IBEs of Boneh and Boyen (EUROCRYPT 2004). One is based\r\non the DBDH assumption,
has the same ciphertext size as the cor-\r\nresponding BB04 scheme, and achieves
full adaptive security with\r\npublic parameters of size only O(log λ). The other
is based on a q-\r\ntype assumption and has public key size O(λ), but a ciphertext
is\r\nonly a single group element and the security reduction is quadrat-\r\nically
tighter than the corresponding scheme by Jager and Kurek\r\n(ASIACRYPT 2018).\r\n–
A very efficient adaptively-secure verifiable random function where\r\nproofs,
public keys, and secret keys have size O(log λ).\r\nAs a technical contribution
we introduce blockwise partitioning, which\r\nleverages the assumption that a
cryptographic hash function is weak\r\nnear-collision resistant to prove full
adaptive security of cryptosystems."
author:
- first_name: Tibor
full_name: Jager, Tibor
last_name: Jager
- first_name: Rafael
full_name: Kurek, Rafael
last_name: Kurek
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Jager T, Kurek R, Niehues D. Efficient Adaptively-Secure IB-KEMs and VRFs
via Near-Collision Resistance. In: Public-Key Cryptography – PKC 2021.
Cham; 2021. doi:10.1007/978-3-030-75245-3_22'
apa: Jager, T., Kurek, R., & Niehues, D. (2021). Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance. In Public-Key Cryptography
– PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75245-3_22
bibtex: '@inbook{Jager_Kurek_Niehues_2021, place={Cham}, title={Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance}, DOI={10.1007/978-3-030-75245-3_22},
booktitle={Public-Key Cryptography – PKC 2021}, author={Jager, Tibor and Kurek,
Rafael and Niehues, David}, year={2021} }'
chicago: Jager, Tibor, Rafael Kurek, and David Niehues. “Efficient Adaptively-Secure
IB-KEMs and VRFs via Near-Collision Resistance.” In Public-Key Cryptography
– PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75245-3_22.
ieee: T. Jager, R. Kurek, and D. Niehues, “Efficient Adaptively-Secure IB-KEMs and
VRFs via Near-Collision Resistance,” in Public-Key Cryptography – PKC 2021,
Cham, 2021.
mla: Jager, Tibor, et al. “Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision
Resistance.” Public-Key Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75245-3_22.
short: 'T. Jager, R. Kurek, D. Niehues, in: Public-Key Cryptography – PKC 2021,
Cham, 2021.'
date_created: 2021-05-10T15:56:24Z
date_updated: 2022-01-06T06:55:23Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75245-3_22
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:02:02Z
date_updated: 2021-05-10T16:02:02Z
file_id: '22058'
file_name: Jager et al. - 2021 - Efficient Adaptively-Secure IB-KEMs and VRFs via
N.pdf
file_size: 701068
relation: main_file
file_date_updated: 2021-05-10T16:02:02Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752446'
- '9783030752453'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '22059'
abstract:
- lang: eng
text: "Verifiable random functions (VRFs), introduced by Micali,\r\nRabin and Vadhan
(FOCS’99), are the public-key equivalent of pseudo-\r\nrandom functions. A public
verification key and proofs accompanying the\r\noutput enable all parties to verify
the correctness of the output. How-\r\never, all known standard model VRFs have
a reduction loss that is much\r\nworse than what one would expect from known optimal
constructions of\r\nclosely related primitives like unique signatures. We show
that:\r\n1. Every security proof for a VRF that relies on a non-interactive\r\nassumption
has to lose a factor of Q, where Q is the number of adver-\r\nsarial queries.
To that end, we extend the meta-reduction technique\r\nof Bader et al. (EUROCRYPT’16)
to also cover VRFs.\r\n2. This raises the question: Is this bound optimal? We
answer this ques-\r\ntion in the affirmative by presenting the first VRF with
a reduction\r\nfrom the non-interactive qDBDHI assumption to the security of VRF\r\nthat
achieves this optimal loss.\r\nWe thus paint a complete picture of the achievability
of tight verifiable\r\nrandom functions: We show that a security loss of Q is
unavoidable and\r\npresent the first construction that achieves this bound."
author:
- first_name: David
full_name: Niehues, David
id: '36113'
last_name: Niehues
citation:
ama: 'Niehues D. Verifiable Random Functions with Optimal Tightness. In: Public-Key
Cryptography – PKC 2021. Cham; 2021. doi:10.1007/978-3-030-75248-4_3'
apa: Niehues, D. (2021). Verifiable Random Functions with Optimal Tightness. In
Public-Key Cryptography – PKC 2021. Cham. https://doi.org/10.1007/978-3-030-75248-4_3
bibtex: '@inbook{Niehues_2021, place={Cham}, title={Verifiable Random Functions
with Optimal Tightness}, DOI={10.1007/978-3-030-75248-4_3},
booktitle={Public-Key Cryptography – PKC 2021}, author={Niehues, David}, year={2021}
}'
chicago: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” In
Public-Key Cryptography – PKC 2021. Cham, 2021. https://doi.org/10.1007/978-3-030-75248-4_3.
ieee: D. Niehues, “Verifiable Random Functions with Optimal Tightness,” in Public-Key
Cryptography – PKC 2021, Cham, 2021.
mla: Niehues, David. “Verifiable Random Functions with Optimal Tightness.” Public-Key
Cryptography – PKC 2021, 2021, doi:10.1007/978-3-030-75248-4_3.
short: 'D. Niehues, in: Public-Key Cryptography – PKC 2021, Cham, 2021.'
date_created: 2021-05-10T16:07:50Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '000'
department:
- _id: '558'
doi: 10.1007/978-3-030-75248-4_3
file:
- access_level: closed
content_type: application/pdf
creator: davnie
date_created: 2021-05-10T16:09:17Z
date_updated: 2021-05-10T16:09:17Z
file_id: '22060'
file_name: Niehues - 2021 - Verifiable Random Functions with Optimal Tightness.pdf
file_size: 697361
relation: main_file
file_date_updated: 2021-05-10T16:09:17Z
has_accepted_license: '1'
language:
- iso: eng
place: Cham
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '13'
name: SFB 901 - Subproject C1
publication: Public-Key Cryptography – PKC 2021
publication_identifier:
isbn:
- '9783030752477'
- '9783030752484'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Verifiable Random Functions with Optimal Tightness
type: book_chapter
user_id: '36113'
year: '2021'
...
---
_id: '16867'
abstract:
- lang: eng
text: "In this article, we present an efficient descent method for locally Lipschitz\r\ncontinuous
multiobjective optimization problems (MOPs). The method is realized\r\nby combining
a theoretical result regarding the computation of descent\r\ndirections for nonsmooth
MOPs with a practical method to approximate the\r\nsubdifferentials of the objective
functions. We show convergence to points\r\nwhich satisfy a necessary condition
for Pareto optimality. Using a set of test\r\nproblems, we compare our method
to the multiobjective proximal bundle method by\r\nM\\\"akel\\\"a. The results
indicate that our method is competitive while being\r\neasier to implement. While
the number of objective function evaluations is\r\nlarger, the overall number
of subgradient evaluations is lower. Finally, we\r\nshow that our method can be
combined with a subdivision algorithm to compute\r\nentire Pareto sets of nonsmooth
MOPs."
author:
- first_name: Bennet
full_name: Gebken, Bennet
id: '32643'
last_name: Gebken
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: 0000-0002-3389-793X
citation:
ama: Gebken B, Peitz S. An efficient descent method for locally Lipschitz multiobjective
optimization problems. Journal of Optimization Theory and Applications.
2021;188:696-723. doi:10.1007/s10957-020-01803-w
apa: Gebken, B., & Peitz, S. (2021). An efficient descent method for locally
Lipschitz multiobjective optimization problems. Journal of Optimization Theory
and Applications, 188, 696–723. https://doi.org/10.1007/s10957-020-01803-w
bibtex: '@article{Gebken_Peitz_2021, title={An efficient descent method for locally
Lipschitz multiobjective optimization problems}, volume={188}, DOI={10.1007/s10957-020-01803-w},
journal={Journal of Optimization Theory and Applications}, author={Gebken, Bennet
and Peitz, Sebastian}, year={2021}, pages={696–723} }'
chicago: 'Gebken, Bennet, and Sebastian Peitz. “An Efficient Descent Method for
Locally Lipschitz Multiobjective Optimization Problems.” Journal of Optimization
Theory and Applications 188 (2021): 696–723. https://doi.org/10.1007/s10957-020-01803-w.'
ieee: B. Gebken and S. Peitz, “An efficient descent method for locally Lipschitz
multiobjective optimization problems,” Journal of Optimization Theory and Applications,
vol. 188, pp. 696–723, 2021.
mla: Gebken, Bennet, and Sebastian Peitz. “An Efficient Descent Method for Locally
Lipschitz Multiobjective Optimization Problems.” Journal of Optimization Theory
and Applications, vol. 188, 2021, pp. 696–723, doi:10.1007/s10957-020-01803-w.
short: B. Gebken, S. Peitz, Journal of Optimization Theory and Applications 188
(2021) 696–723.
date_created: 2020-04-27T09:11:22Z
date_updated: 2022-01-06T06:52:57Z
department:
- _id: '101'
doi: 10.1007/s10957-020-01803-w
intvolume: ' 188'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/content/pdf/10.1007/s10957-020-01803-w.pdf
oa: '1'
page: 696-723
publication: Journal of Optimization Theory and Applications
publication_status: published
status: public
title: An efficient descent method for locally Lipschitz multiobjective optimization
problems
type: journal_article
user_id: '47427'
volume: 188
year: '2021'
...
---
_id: '16295'
abstract:
- lang: eng
text: It is a challenging task to identify the objectives on which a certain decision
was based, in particular if several, potentially conflicting criteria are equally
important and a continuous set of optimal compromise decisions exists. This task
can be understood as the inverse problem of multiobjective optimization, where
the goal is to find the objective function vector of a given Pareto set. To this
end, we present a method to construct the objective function vector of an unconstrained
multiobjective optimization problem (MOP) such that the Pareto critical set contains
a given set of data points with prescribed KKT multipliers. If such an MOP can
not be found, then the method instead produces an MOP whose Pareto critical set
is at least close to the data points. The key idea is to consider the objective
function vector in the multiobjective KKT conditions as variable and then search
for the objectives that minimize the Euclidean norm of the resulting system of
equations. By expressing the objectives in a finite-dimensional basis, we transform
this problem into a homogeneous, linear system of equations that can be solved
efficiently. Potential applications of this approach include the identification
of objectives (both from clean and noisy data) and the construction of surrogate
models for expensive MOPs.
author:
- first_name: Bennet
full_name: Gebken, Bennet
id: '32643'
last_name: Gebken
- first_name: Sebastian
full_name: Peitz, Sebastian
id: '47427'
last_name: Peitz
orcid: https://orcid.org/0000-0002-3389-793X
citation:
ama: 'Gebken B, Peitz S. Inverse multiobjective optimization: Inferring decision
criteria from data. Journal of Global Optimization. 2021;80:3-29. doi:10.1007/s10898-020-00983-z'
apa: 'Gebken, B., & Peitz, S. (2021). Inverse multiobjective optimization: Inferring
decision criteria from data. Journal of Global Optimization, 80,
3–29. https://doi.org/10.1007/s10898-020-00983-z'
bibtex: '@article{Gebken_Peitz_2021, title={Inverse multiobjective optimization:
Inferring decision criteria from data}, volume={80}, DOI={10.1007/s10898-020-00983-z},
journal={Journal of Global Optimization}, publisher={Springer}, author={Gebken,
Bennet and Peitz, Sebastian}, year={2021}, pages={3–29} }'
chicago: 'Gebken, Bennet, and Sebastian Peitz. “Inverse Multiobjective Optimization:
Inferring Decision Criteria from Data.” Journal of Global Optimization
80 (2021): 3–29. https://doi.org/10.1007/s10898-020-00983-z.'
ieee: 'B. Gebken and S. Peitz, “Inverse multiobjective optimization: Inferring decision
criteria from data,” Journal of Global Optimization, vol. 80, pp. 3–29,
2021.'
mla: 'Gebken, Bennet, and Sebastian Peitz. “Inverse Multiobjective Optimization:
Inferring Decision Criteria from Data.” Journal of Global Optimization,
vol. 80, Springer, 2021, pp. 3–29, doi:10.1007/s10898-020-00983-z.'
short: B. Gebken, S. Peitz, Journal of Global Optimization 80 (2021) 3–29.
date_created: 2020-03-13T12:45:05Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '101'
doi: 10.1007/s10898-020-00983-z
intvolume: ' 80'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/content/pdf/10.1007/s10898-020-00983-z.pdf
oa: '1'
page: 3-29
publication: Journal of Global Optimization
publisher: Springer
status: public
title: 'Inverse multiobjective optimization: Inferring decision criteria from data'
type: journal_article
user_id: '47427'
volume: 80
year: '2021'
...
---
_id: '22217'
author:
- first_name: Stefan
full_name: Krauter, Stefan
id: '28836'
last_name: Krauter
orcid: 0000-0002-3594-260X
- first_name: Arash
full_name: Khatibi, Arash
id: '43538'
last_name: Khatibi
citation:
ama: 'Krauter S, Khatibi A. Einfluss von Steilaufstellung, Nachführung und Einsatz
bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung
Deutschlands. In: Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online,
ISBN 978-3-948176-14-3, S. 301-304. . Conexio; 2021:301-304.'
apa: Krauter, S., & Khatibi, A. (2021). Einfluss von Steilaufstellung, Nachführung
und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100%
EE-Versorgung Deutschlands. Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021,
online, ISBN 978-3-948176-14-3, S. 301-304. , 301–304.
bibtex: '@inproceedings{Krauter_Khatibi_2021, place={Pforzheim}, title={Einfluss
von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module auf den Speicherbedarf
und die Kosten einer 100% EE-Versorgung Deutschlands}, booktitle={Tagungsband
des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3, S. 301-304.
}, publisher={Conexio}, author={Krauter, Stefan and Khatibi, Arash}, year={2021},
pages={301–304} }'
chicago: 'Krauter, Stefan, and Arash Khatibi. “Einfluss von Steilaufstellung, Nachführung
und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100%
EE-Versorgung Deutschlands.” In Tagungsband des 36. PV-Symposium, 18.-26 Mai
2021, online, ISBN 978-3-948176-14-3, S. 301-304. , 301–4. Pforzheim: Conexio,
2021.'
ieee: S. Krauter and A. Khatibi, “Einfluss von Steilaufstellung, Nachführung und
Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100%
EE-Versorgung Deutschlands,” in Tagungsband des 36. PV-Symposium, 18.-26 Mai
2021, online, ISBN 978-3-948176-14-3, S. 301-304. , Staffelstein / online,
2021, pp. 301–304.
mla: Krauter, Stefan, and Arash Khatibi. “Einfluss von Steilaufstellung, Nachführung
und Einsatz bifazialer PV-Module auf den Speicherbedarf und die Kosten einer 100%
EE-Versorgung Deutschlands.” Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021,
online, ISBN 978-3-948176-14-3, S. 301-304. , Conexio, 2021, pp. 301–04.
short: 'S. Krauter, A. Khatibi, in: Tagungsband des 36. PV-Symposium, 18.-26 Mai
2021, online, ISBN 978-3-948176-14-3, S. 301-304. , Conexio, Pforzheim, 2021,
pp. 301–304.'
conference:
end_date: 2021-05-26
location: Staffelstein / online
name: 36. PV-Symposium, 18.-26 Mai 2021
start_date: 2021-05-18
date_created: 2021-05-20T09:51:14Z
date_updated: 2022-01-06T11:46:47Z
ddc:
- '620'
department:
- _id: '53'
file:
- access_level: closed
content_type: application/pdf
creator: krauter
date_created: 2022-01-06T11:44:09Z
date_updated: 2022-01-06T11:44:09Z
file_id: '29169'
file_name: Staffelstein 2021 Krauter Khatibi S.301-304.pdf
file_size: 3540634
relation: main_file
success: 1
file_date_updated: 2022-01-06T11:44:09Z
has_accepted_license: '1'
language:
- iso: ger
page: 301-304
place: Pforzheim
publication: 'Tagungsband des 36. PV-Symposium, 18.-26 Mai 2021, online, ISBN 978-3-948176-14-3,
S. 301-304. '
publication_identifier:
isbn:
- 978-3-948176-14-3
publication_status: published
publisher: Conexio
status: public
title: Einfluss von Steilaufstellung, Nachführung und Einsatz bifazialer PV-Module
auf den Speicherbedarf und die Kosten einer 100% EE-Versorgung Deutschlands
type: conference
user_id: '28836'
year: '2021'
...
---
_id: '21953'
author:
- first_name: Linus Matthias
full_name: Witschen, Linus Matthias
id: '49051'
last_name: Witschen
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Masood
full_name: Raeisi Nafchi, Masood
last_name: Raeisi Nafchi
- first_name: Arne
full_name: Bockhorn, Arne
last_name: Bockhorn
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Witschen LM, Wiersema T, Raeisi Nafchi M, Bockhorn A, Platzner M. Timing Optimization
for Virtual FPGA Configurations. In: Hannig F, Derrien S, Diniz P, Chillet D,
eds. Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21). Reconfigurable Computing: Architectures, Tools, and Applications.
Springer Lecture Notes in Computer Science. doi:10.1007/978-3-030-79025-7_4'
apa: Witschen, L. M., Wiersema, T., Raeisi Nafchi, M., Bockhorn, A., & Platzner,
M. (n.d.). Timing Optimization for Virtual FPGA Configurations. In F. Hannig,
S. Derrien, P. Diniz, & D. Chillet (Eds.), Proceedings of International
Symposium on Applied Reconfigurable Computing (ARC’21). Springer Lecture Notes
in Computer Science. https://doi.org/10.1007/978-3-030-79025-7_4
bibtex: '@inproceedings{Witschen_Wiersema_Raeisi Nafchi_Bockhorn_Platzner, series={Reconfigurable
Computing: Architectures, Tools, and Applications}, title={Timing Optimization
for Virtual FPGA Configurations}, DOI={10.1007/978-3-030-79025-7_4},
booktitle={Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21)}, publisher={Springer Lecture Notes in Computer Science}, author={Witschen,
Linus Matthias and Wiersema, Tobias and Raeisi Nafchi, Masood and Bockhorn, Arne
and Platzner, Marco}, editor={Hannig, Frank and Derrien, Steven and Diniz, Pedro
and Chillet, Daniel}, collection={Reconfigurable Computing: Architectures, Tools,
and Applications} }'
chicago: 'Witschen, Linus Matthias, Tobias Wiersema, Masood Raeisi Nafchi, Arne
Bockhorn, and Marco Platzner. “Timing Optimization for Virtual FPGA Configurations.”
In Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21), edited by Frank Hannig, Steven Derrien, Pedro Diniz, and Daniel
Chillet. Reconfigurable Computing: Architectures, Tools, and Applications. Springer
Lecture Notes in Computer Science, n.d. https://doi.org/10.1007/978-3-030-79025-7_4.'
ieee: 'L. M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, and M. Platzner,
“Timing Optimization for Virtual FPGA Configurations,” in Proceedings of International
Symposium on Applied Reconfigurable Computing (ARC’21), Virtual conference,
doi: 10.1007/978-3-030-79025-7_4.'
mla: Witschen, Linus Matthias, et al. “Timing Optimization for Virtual FPGA Configurations.”
Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC’21), edited by Frank Hannig et al., Springer Lecture Notes in Computer
Science, doi:10.1007/978-3-030-79025-7_4.
short: 'L.M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, M. Platzner,
in: F. Hannig, S. Derrien, P. Diniz, D. Chillet (Eds.), Proceedings of International
Symposium on Applied Reconfigurable Computing (ARC’21), Springer Lecture Notes
in Computer Science, n.d.'
conference:
end_date: 2021-07-01
location: Virtual conference
name: International Symposium on Applied Reconfigurable Computing
start_date: 2021-06-29
date_created: 2021-05-04T14:18:46Z
date_updated: 2022-02-14T11:03:09Z
department:
- _id: '78'
doi: 10.1007/978-3-030-79025-7_4
editor:
- first_name: Frank
full_name: Hannig, Frank
last_name: Hannig
- first_name: Steven
full_name: Derrien, Steven
last_name: Derrien
- first_name: Pedro
full_name: Diniz, Pedro
last_name: Diniz
- first_name: Daniel
full_name: Chillet, Daniel
last_name: Chillet
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Proceedings of International Symposium on Applied Reconfigurable Computing
(ARC'21)
publication_status: accepted
publisher: Springer Lecture Notes in Computer Science
series_title: 'Reconfigurable Computing: Architectures, Tools, and Applications'
status: public
title: Timing Optimization for Virtual FPGA Configurations
type: conference
user_id: '3118'
year: '2021'
...