---
_id: '22304'
author:
- first_name: Stefan
full_name: Schott, Stefan
id: '54847'
last_name: Schott
citation:
ama: Schott S. Android App Analysis Benchmark Case Generation. Paderborn;
2021.
apa: Schott, S. (2021). Android App Analysis Benchmark Case Generation. Paderborn.
bibtex: '@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark
Case Generation}, author={Schott, Stefan}, year={2021} }'
chicago: Schott, Stefan. Android App Analysis Benchmark Case Generation.
Paderborn, 2021.
ieee: S. Schott, Android App Analysis Benchmark Case Generation. Paderborn,
2021.
mla: Schott, Stefan. Android App Analysis Benchmark Case Generation. 2021.
short: S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.
date_created: 2021-06-09T06:04:12Z
date_updated: 2022-01-06T06:55:31Z
ddc:
- '000'
department:
- _id: '77'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: fpauck
date_created: 2021-06-09T06:01:45Z
date_updated: 2021-06-09T06:01:45Z
file_id: '22305'
file_name: Masters_Thesis_Stefan_Schott_unsigned.pdf
file_size: 1918444
relation: main_file
file_date_updated: 2021-06-09T06:01:45Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
place: Paderborn
project:
- _id: '1'
name: SFB 901
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
status: public
supervisor:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
title: Android App Analysis Benchmark Case Generation
type: mastersthesis
user_id: '477'
year: '2021'
...
---
_id: '22306'
author:
- first_name: Christian
full_name: Koldewey, Christian
id: '43136'
last_name: Koldewey
orcid: https://orcid.org/0000-0001-7992-6399
- 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: Hans-Heinrich
full_name: Evers, Hans-Heinrich
last_name: Evers
- first_name: Maximilian
full_name: Frank, Maximilian
last_name: Frank
- first_name: Jannik
full_name: Reinhold, Jannik
id: '33669'
last_name: Reinhold
citation:
ama: 'Koldewey C, Gausemeier J, Dumitrescu R, Evers H-H, Frank M, Reinhold J. Development
Process for Smart Service Strategies: Grasping the Potentials of Digitalization
for Servitization. In: Schallmo DR, Tidd J, eds. Digitalization. Management
for Professionals. Springer Nature; 2021:205-237. doi:https://doi.org/10.1007/978-3-030-69380-0_12#DOI'
apa: 'Koldewey, C., Gausemeier, J., Dumitrescu, R., Evers, H.-H., Frank, M., &
Reinhold, J. (2021). Development Process for Smart Service Strategies: Grasping
the Potentials of Digitalization for Servitization. In D. R. Schallmo & J.
Tidd (Eds.), Digitalization (pp. 205–237). Springer Nature. https://doi.org/10.1007/978-3-030-69380-0_12#DOI'
bibtex: '@inbook{Koldewey_Gausemeier_Dumitrescu_Evers_Frank_Reinhold_2021, place={Cham},
series={Management for Professionals}, title={Development Process for Smart Service
Strategies: Grasping the Potentials of Digitalization for Servitization}, DOI={https://doi.org/10.1007/978-3-030-69380-0_12#DOI},
booktitle={Digitalization}, publisher={Springer Nature}, author={Koldewey, Christian
and Gausemeier, Jürgen and Dumitrescu, Roman and Evers, Hans-Heinrich and Frank,
Maximilian and Reinhold, Jannik}, editor={Schallmo, Daniel R. and Tidd, Joseph},
year={2021}, pages={205–237}, collection={Management for Professionals} }'
chicago: 'Koldewey, Christian, Jürgen Gausemeier, Roman Dumitrescu, Hans-Heinrich
Evers, Maximilian Frank, and Jannik Reinhold. “Development Process for Smart Service
Strategies: Grasping the Potentials of Digitalization for Servitization.” In Digitalization,
edited by Daniel R. Schallmo and Joseph Tidd, 205–37. Management for Professionals.
Cham: Springer Nature, 2021. https://doi.org/10.1007/978-3-030-69380-0_12#DOI.'
ieee: 'C. Koldewey, J. Gausemeier, R. Dumitrescu, H.-H. Evers, M. Frank, and J.
Reinhold, “Development Process for Smart Service Strategies: Grasping the Potentials
of Digitalization for Servitization,” in Digitalization, D. R. Schallmo
and J. Tidd, Eds. Cham: Springer Nature, 2021, pp. 205–237.'
mla: 'Koldewey, Christian, et al. “Development Process for Smart Service Strategies:
Grasping the Potentials of Digitalization for Servitization.” Digitalization,
edited by Daniel R. Schallmo and Joseph Tidd, Springer Nature, 2021, pp. 205–37,
doi:https://doi.org/10.1007/978-3-030-69380-0_12#DOI.'
short: 'C. Koldewey, J. Gausemeier, R. Dumitrescu, H.-H. Evers, M. Frank, J. Reinhold,
in: D.R. Schallmo, J. Tidd (Eds.), Digitalization, Springer Nature, Cham, 2021,
pp. 205–237.'
date_created: 2021-06-09T13:07:05Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '563'
doi: https://doi.org/10.1007/978-3-030-69380-0_12#DOI
editor:
- first_name: Daniel R.
full_name: Schallmo, Daniel R.
last_name: Schallmo
- first_name: Joseph
full_name: Tidd, Joseph
last_name: Tidd
language:
- iso: eng
page: 205-237
place: Cham
publication: Digitalization
publication_status: published
publisher: Springer Nature
series_title: Management for Professionals
status: public
title: 'Development Process for Smart Service Strategies: Grasping the Potentials
of Digitalization for Servitization'
type: book_chapter
user_id: '15782'
year: '2021'
...
---
_id: '22307'
author:
- first_name: Daniel
full_name: Eckertz, Daniel
last_name: Eckertz
- first_name: Marus
full_name: Möller, Marus
last_name: Möller
- first_name: Harald
full_name: Anacker, Harald
last_name: Anacker
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: 'Eckertz D, Möller M, Anacker H, Dumitrescu R. Digital Knowledge Base for Industrial
Augmented Reality Systems Based on Semantic Technologies. In: Proceedings
of the International Conference on Information and Computer Technologies.
; 2021.'
apa: Eckertz, D., Möller, M., Anacker, H., & Dumitrescu, R. (2021). Digital
Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies.
In Proceedings of the International Conference on Information and Computer
Technologies. Kahului, Hawaii, United States of America.
bibtex: '@inproceedings{Eckertz_Möller_Anacker_Dumitrescu_2021, title={Digital Knowledge
Base for Industrial Augmented Reality Systems Based on Semantic Technologies},
booktitle={ Proceedings of the International Conference on Information and Computer
Technologies}, author={Eckertz, Daniel and Möller, Marus and Anacker, Harald and
Dumitrescu, Roman}, year={2021} }'
chicago: Eckertz, Daniel, Marus Möller, Harald Anacker, and Roman Dumitrescu. “Digital
Knowledge Base for Industrial Augmented Reality Systems Based on Semantic Technologies.”
In Proceedings of the International Conference on Information and Computer
Technologies, 2021.
ieee: D. Eckertz, M. Möller, H. Anacker, and R. Dumitrescu, “Digital Knowledge Base
for Industrial Augmented Reality Systems Based on Semantic Technologies,” in
Proceedings of the International Conference on Information and Computer Technologies,
Kahului, Hawaii, United States of America, 2021.
mla: Eckertz, Daniel, et al. “Digital Knowledge Base for Industrial Augmented Reality
Systems Based on Semantic Technologies.” Proceedings of the International
Conference on Information and Computer Technologies, 2021.
short: 'D. Eckertz, M. Möller, H. Anacker, R. Dumitrescu, in: Proceedings of the
International Conference on Information and Computer Technologies, 2021.'
conference:
end_date: 2021-03-14
location: Kahului, Hawaii, United States of America
name: 4th International Conference on Information and Computer Technologies (ICICT
2021)
start_date: 2021-03-11
date_created: 2021-06-11T09:16:17Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '563'
language:
- iso: eng
publication: ' Proceedings of the International Conference on Information and Computer
Technologies'
status: public
title: Digital Knowledge Base for Industrial Augmented Reality Systems Based on Semantic
Technologies
type: conference_abstract
user_id: '15782'
year: '2021'
...
---
_id: '22309'
abstract:
- lang: eng
text: Approximate computing (AC) has acquired significant maturity in recent years
as a promising approach to obtain energy and area-efficient hardware. Automated
approximate accelerator synthesis involves a great deal of complexity on the size
of design space which exponentially grows with the number of possible approximations.
Design space exploration of approximate accelerator synthesis is usually targeted
via heuristic-based search methods. The majority of existing frameworks prune
a large part of the design space using a greedy-based approach to keep the problem
tractable. Therefore, they result in inferior solutions since many potential solutions
are neglected in the pruning process without the possibility of backtracking of
removed approximate instances. In this paper, we address the aforementioned issue
by adopting Monte Carlo Tree Search (MCTS), as an efficient stochastic learning-based
search algorithm, in the context of automated synthesis of approximate accelerators.
This enables the synthesis frameworks to deeply subsamples the design space of
approximate accelerator synthesis toward most promising approximate instances
based on the required performance goals, i.e., power consumption, area, or/and
delay. We investigated the challenges of providing an efficient open-source framework
that benefits analytical and search-based approximation techniques simultaneously
to both speed up the synthesis runtime and improve the quality of obtained results.
Besides, we studied the utilization of machine learning algorithms to improve
the performance of several critical steps, i.e., accelerator quality testing,
in the synthesis framework. The proposed framework can help the community to rapidly
generate efficient approximate accelerators in a reasonable runtime.
author:
- first_name: Muhammad
full_name: Awais, Muhammad
id: '64665'
last_name: Awais
orcid: https://orcid.org/0000-0003-4148-2969
- first_name: Marco
full_name: Platzner, Marco
last_name: Platzner
citation:
ama: 'Awais M, Platzner M. MCTS-Based Synthesis Towards Efficient Approximate Accelerators.
In: Proceedings of IEEE Computer Society Annual Symposium on VLSI. IEEE;
2021:384-389.'
apa: Awais, M., & Platzner, M. (2021). MCTS-Based Synthesis Towards Efficient
Approximate Accelerators. Proceedings of IEEE Computer Society Annual Symposium
on VLSI, 384–389.
bibtex: '@inproceedings{Awais_Platzner_2021, title={MCTS-Based Synthesis Towards
Efficient Approximate Accelerators}, booktitle={Proceedings of IEEE Computer Society
Annual Symposium on VLSI}, publisher={IEEE}, author={Awais, Muhammad and Platzner,
Marco}, year={2021}, pages={384–389} }'
chicago: Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient
Approximate Accelerators.” In Proceedings of IEEE Computer Society Annual Symposium
on VLSI, 384–89. IEEE, 2021.
ieee: M. Awais and M. Platzner, “MCTS-Based Synthesis Towards Efficient Approximate
Accelerators,” in Proceedings of IEEE Computer Society Annual Symposium on
VLSI, Tampa, Florida USA (Virtual), 2021, pp. 384–389.
mla: Awais, Muhammad, and Marco Platzner. “MCTS-Based Synthesis Towards Efficient
Approximate Accelerators.” Proceedings of IEEE Computer Society Annual Symposium
on VLSI, IEEE, 2021, pp. 384–89.
short: 'M. Awais, M. Platzner, in: Proceedings of IEEE Computer Society Annual Symposium
on VLSI, IEEE, 2021, pp. 384–389.'
conference:
end_date: 2021-07-09
location: Tampa, Florida USA (Virtual)
name: IEEE Computer Society Annual Symposium on VLSI
start_date: 2021-07-07
date_created: 2021-06-14T14:05:17Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '78'
keyword:
- Approximate computing
- Design space exploration
- Accelerator synthesis
language:
- iso: eng
page: 384-389
publication: Proceedings of IEEE Computer Society Annual Symposium on VLSI
publisher: IEEE
status: public
title: MCTS-Based Synthesis Towards Efficient Approximate Accelerators
type: conference
user_id: '64665'
year: '2021'
...
---
_id: '22448'
author:
- first_name: Johannes
full_name: Kiesel, Johannes
last_name: Kiesel
- first_name: Damiano
full_name: Spina, Damiano
last_name: Spina
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
- first_name: Benno
full_name: Stein, Benno
last_name: Stein
citation:
ama: 'Kiesel J, Spina D, Wachsmuth H, Stein B. The Meant, the Said, and the Understood:
Conversational Argument Search and Cognitive Biases. In: Proceedings of the
2021 Conversational User Interfaces Conference. ; 2021:1-5.'
apa: 'Kiesel, J., Spina, D., Wachsmuth, H., & Stein, B. (2021). The Meant, the
Said, and the Understood: Conversational Argument Search and Cognitive Biases.
Proceedings of the 2021 Conversational User Interfaces Conference, 1–5.'
bibtex: '@inproceedings{Kiesel_Spina_Wachsmuth_Stein_2021, title={The Meant, the
Said, and the Understood: Conversational Argument Search and Cognitive Biases},
booktitle={Proceedings of the 2021 Conversational User Interfaces Conference},
author={Kiesel, Johannes and Spina, Damiano and Wachsmuth, Henning and Stein,
Benno}, year={2021}, pages={1–5} }'
chicago: 'Kiesel, Johannes, Damiano Spina, Henning Wachsmuth, and Benno Stein. “The
Meant, the Said, and the Understood: Conversational Argument Search and Cognitive
Biases.” In Proceedings of the 2021 Conversational User Interfaces Conference,
1–5, 2021.'
ieee: 'J. Kiesel, D. Spina, H. Wachsmuth, and B. Stein, “The Meant, the Said, and
the Understood: Conversational Argument Search and Cognitive Biases,” in Proceedings
of the 2021 Conversational User Interfaces Conference, 2021, pp. 1–5.'
mla: 'Kiesel, Johannes, et al. “The Meant, the Said, and the Understood: Conversational
Argument Search and Cognitive Biases.” Proceedings of the 2021 Conversational
User Interfaces Conference, 2021, pp. 1–5.'
short: 'J. Kiesel, D. Spina, H. Wachsmuth, B. Stein, in: Proceedings of the 2021
Conversational User Interfaces Conference, 2021, pp. 1–5.'
date_created: 2021-06-15T13:51:36Z
date_updated: 2022-01-06T06:55:33Z
department:
- _id: '600'
language:
- iso: eng
main_file_link:
- url: https://dl.acm.org/doi/fullHtml/10.1145/3469595.3469615
page: 1-5
publication: Proceedings of the 2021 Conversational User Interfaces Conference
status: public
title: 'The Meant, the Said, and the Understood: Conversational Argument Search and
Cognitive Biases'
type: conference
user_id: '82920'
year: '2021'
...
---
_id: '22483'
abstract:
- lang: eng
text: This bachelor thesis presents a C/C++ implementation of the XCS algorithm
for an embedded system and profiling results concerning the execution time of
the functions. These are then analyzed in relation to the input characteristics
of the examined learning environments and compared with related work. Three main
conclusions can be drawn from the measured results. First, the maximum size of
the population of the classifiers influences the runtime of the genetic algorithm;
second, the size of the input space has a direct effect on the execution time
of the matching function; and last, a larger action space results in a longer
runtime generating the prediction for the possible actions. The dependencies identified
here can serve to optimize the computational efficiency and make XCS more suitable
for embedded systems.
author:
- first_name: Mathis
full_name: Brede, Mathis
last_name: Brede
citation:
ama: 'Brede M. Implementation and Profiling of XCS in the Context of Embedded
Systems. Paderborn: Paderborn University; 2021.'
apa: 'Brede, M. (2021). Implementation and Profiling of XCS in the Context of
Embedded Systems. Paderborn: Paderborn University.'
bibtex: '@book{Brede_2021, place={Paderborn}, title={Implementation and Profiling
of XCS in the Context of Embedded Systems}, publisher={Paderborn University},
author={Brede, Mathis}, year={2021} }'
chicago: 'Brede, Mathis. Implementation and Profiling of XCS in the Context of
Embedded Systems. Paderborn: Paderborn University, 2021.'
ieee: 'M. Brede, Implementation and Profiling of XCS in the Context of Embedded
Systems. Paderborn: Paderborn University, 2021.'
mla: Brede, Mathis. Implementation and Profiling of XCS in the Context of Embedded
Systems. Paderborn University, 2021.
short: M. Brede, Implementation and Profiling of XCS in the Context of Embedded
Systems, Paderborn University, Paderborn, 2021.
date_created: 2021-06-21T09:35:03Z
date_updated: 2022-01-06T06:55:33Z
department:
- _id: '78'
extern: '1'
language:
- iso: eng
place: Paderborn
project:
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '1'
name: SFB 901
publisher: Paderborn University
status: public
supervisor:
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Tim
full_name: Hansmeier, Tim
id: '49992'
last_name: Hansmeier
orcid: 0000-0003-1377-3339
title: Implementation and Profiling of XCS in the Context of Embedded Systems
type: bachelorsthesis
user_id: '477'
year: '2021'
...
---
_id: '22510'
abstract:
- lang: eng
text: 'Over the past decades, the Gathering problem, which asks to gather a group
of robots in finite time given some restrictions, has been intensively studied.
In this paper, we are given a group of n autonomous, dimensionless, deterministic,
and anonymous robots, with bounded viewing range. Assuming a continuous time model,
the goal is to gather these robots into one point in finite time. We introduce
a simple convergence criterion that defines a new class of algorithms which perform
gathering in O(nd) time, where d is the diameter of the initial robot configuration.
We show that some gathering algorithms in the literature belong to this class
and propose two new algorithms that belong to this class and have quadratic running
time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center
algorithm (S-GTRC). We prove that the latter can perform gathering without collision
by using a slightly more complex robot model: non oblivious, chiral, and luminous
(i.e. robots have observable external memory, as in [8]). We also consider a variant
of the Gathering problem, the Near-Gathering problem, in which robots must get
close to each other without colliding. We show that S-GTRC solves the Near-Gathering
problem in quadratic time and assumes a weaker robot model than the one assumed
in the current state-of-the-art.'
author:
- first_name: Shouwei
full_name: Li, Shouwei
last_name: Li
- first_name: Christine
full_name: Markarian, Christine
last_name: Markarian
- 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, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy
for collisionless gathering. Theoretical Computer Science. 2021;852:41-60.
doi:10.1016/j.tcs.2020.10.037
apa: Li, S., Markarian, C., Meyer auf der Heide, F., & Podlipyan, P. (2021).
A continuous strategy for collisionless gathering. Theoretical Computer Science,
852, 41–60. https://doi.org/10.1016/j.tcs.2020.10.037
bibtex: '@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous
strategy for collisionless gathering}, volume={852}, DOI={10.1016/j.tcs.2020.10.037},
journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine
and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60}
}'
chicago: 'Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel
Podlipyan. “A Continuous Strategy for Collisionless Gathering.” Theoretical
Computer Science 852 (2021): 41–60. https://doi.org/10.1016/j.tcs.2020.10.037.'
ieee: S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous
strategy for collisionless gathering,” Theoretical Computer Science, vol.
852, pp. 41–60, 2021.
mla: Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” Theoretical
Computer Science, vol. 852, 2021, pp. 41–60, doi:10.1016/j.tcs.2020.10.037.
short: S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer
Science 852 (2021) 41–60.
date_created: 2021-06-28T09:24:15Z
date_updated: 2022-01-06T06:55:35Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.10.037
intvolume: ' 852'
keyword:
- Local algorithms
- Distributed algorithms
- Collisionless gathering
- Mobile robots
- Multiagent system
language:
- iso: eng
page: 41-60
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: A continuous strategy for collisionless gathering
type: journal_article
user_id: '15415'
volume: 852
year: '2021'
...
---
_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: '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: '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: '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'
...