---
_id: '52928'
author:
- first_name: Christian
  full_name: Alrabbaa, Christian
  last_name: Alrabbaa
- first_name: Willi
  full_name: Hieke, Willi
  last_name: Hieke
- first_name: Anni-Yasmin
  full_name: Turhan, Anni-Yasmin
  id: '104470'
  last_name: Turhan
citation:
  ama: 'Alrabbaa C, Hieke W, Turhan A-Y. Counter Model Transformation for Explaining
    Non-Subsumption in EL. In: Beierle C, Ragni M, Stolzenburg F, Thimm M, eds. <i>Proceedings
    of the 7th Workshop on Formal and Cognitive Reasoning Co-Located with the 44th
    German Conference on Artificial Intelligence (KI 2021), September 28, 2021</i>.
    Vol 2961. CEUR Workshop Proceedings. CEUR-WS.org; 2021:9–22.'
  apa: Alrabbaa, C., Hieke, W., &#38; Turhan, A.-Y. (2021). Counter Model Transformation
    for Explaining Non-Subsumption in EL. In C. Beierle, M. Ragni, F. Stolzenburg,
    &#38; M. Thimm (Eds.), <i>Proceedings of the 7th Workshop on Formal and Cognitive
    Reasoning co-located with the 44th German Conference on Artificial Intelligence
    (KI 2021), September 28, 2021</i> (Vol. 2961, pp. 9–22). CEUR-WS.org.
  bibtex: '@inproceedings{Alrabbaa_Hieke_Turhan_2021, series={CEUR Workshop Proceedings},
    title={Counter Model Transformation for Explaining Non-Subsumption in EL}, volume={2961},
    booktitle={Proceedings of the 7th Workshop on Formal and Cognitive Reasoning co-located
    with the 44th German Conference on Artificial Intelligence (KI 2021), September
    28, 2021}, publisher={CEUR-WS.org}, author={Alrabbaa, Christian and Hieke, Willi
    and Turhan, Anni-Yasmin}, editor={Beierle, Christoph and Ragni, Marco and Stolzenburg,
    Frieder and Thimm, Matthias}, year={2021}, pages={9–22}, collection={CEUR Workshop
    Proceedings} }'
  chicago: Alrabbaa, Christian, Willi Hieke, and Anni-Yasmin Turhan. “Counter Model
    Transformation for Explaining Non-Subsumption in EL.” In <i>Proceedings of the
    7th Workshop on Formal and Cognitive Reasoning Co-Located with the 44th German
    Conference on Artificial Intelligence (KI 2021), September 28, 2021</i>, edited
    by Christoph Beierle, Marco Ragni, Frieder Stolzenburg, and Matthias Thimm, 2961:9–22.
    CEUR Workshop Proceedings. CEUR-WS.org, 2021.
  ieee: C. Alrabbaa, W. Hieke, and A.-Y. Turhan, “Counter Model Transformation for
    Explaining Non-Subsumption in EL,” in <i>Proceedings of the 7th Workshop on Formal
    and Cognitive Reasoning co-located with the 44th German Conference on Artificial
    Intelligence (KI 2021), September 28, 2021</i>, 2021, vol. 2961, pp. 9–22.
  mla: Alrabbaa, Christian, et al. “Counter Model Transformation for Explaining Non-Subsumption
    in EL.” <i>Proceedings of the 7th Workshop on Formal and Cognitive Reasoning Co-Located
    with the 44th German Conference on Artificial Intelligence (KI 2021), September
    28, 2021</i>, edited by Christoph Beierle et al., vol. 2961, CEUR-WS.org, 2021,
    pp. 9–22.
  short: 'C. Alrabbaa, W. Hieke, A.-Y. Turhan, in: C. Beierle, M. Ragni, F. Stolzenburg,
    M. Thimm (Eds.), Proceedings of the 7th Workshop on Formal and Cognitive Reasoning
    Co-Located with the 44th German Conference on Artificial Intelligence (KI 2021),
    September 28, 2021, CEUR-WS.org, 2021, pp. 9–22.'
date_created: 2024-03-26T10:55:22Z
date_updated: 2024-10-14T08:05:31Z
department:
- _id: '888'
editor:
- first_name: Christoph
  full_name: Beierle, Christoph
  last_name: Beierle
- first_name: Marco
  full_name: Ragni, Marco
  last_name: Ragni
- first_name: Frieder
  full_name: Stolzenburg, Frieder
  last_name: Stolzenburg
- first_name: Matthias
  full_name: Thimm, Matthias
  last_name: Thimm
intvolume: '      2961'
language:
- iso: eng
page: 9–22
publication: Proceedings of the 7th Workshop on Formal and Cognitive Reasoning co-located
  with the 44th German Conference on Artificial Intelligence (KI 2021), September
  28, 2021
publisher: CEUR-WS.org
series_title: CEUR Workshop Proceedings
status: public
title: Counter Model Transformation for Explaining Non-Subsumption in EL
type: conference
user_id: '15504'
volume: 2961
year: '2021'
...
---
_id: '22462'
author:
- first_name: Ashwin Prasad
  full_name: Shivarpatna Venkatesh, Ashwin Prasad
  id: '66637'
  last_name: Shivarpatna Venkatesh
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
citation:
  ama: 'Shivarpatna Venkatesh AP, Bodden E. Automated Cell Header Generator for Jupyter
    Notebooks. In: <i>International Workshop on AI and Software Testing/Analysis (AISTA)</i>.
    ; 2021. doi:<a href="https://doi.org/10.1145/3464968.3468410">10.1145/3464968.3468410</a>'
  apa: Shivarpatna Venkatesh, A. P., &#38; Bodden, E. (2021). Automated Cell Header
    Generator for Jupyter Notebooks. <i>International Workshop on AI and Software
    Testing/Analysis (AISTA)</i>. <a href="https://doi.org/10.1145/3464968.3468410">https://doi.org/10.1145/3464968.3468410</a>
  bibtex: '@inproceedings{Shivarpatna Venkatesh_Bodden_2021, title={Automated Cell
    Header Generator for Jupyter Notebooks}, DOI={<a href="https://doi.org/10.1145/3464968.3468410">10.1145/3464968.3468410</a>},
    booktitle={International Workshop on AI and Software Testing/Analysis (AISTA)},
    author={Shivarpatna Venkatesh, Ashwin Prasad and Bodden, Eric}, year={2021} }'
  chicago: Shivarpatna Venkatesh, Ashwin Prasad, and Eric Bodden. “Automated Cell
    Header Generator for Jupyter Notebooks.” In <i>International Workshop on AI and
    Software Testing/Analysis (AISTA)</i>, 2021. <a href="https://doi.org/10.1145/3464968.3468410">https://doi.org/10.1145/3464968.3468410</a>.
  ieee: 'A. P. Shivarpatna Venkatesh and E. Bodden, “Automated Cell Header Generator
    for Jupyter Notebooks,” 2021, doi: <a href="https://doi.org/10.1145/3464968.3468410">10.1145/3464968.3468410</a>.'
  mla: Shivarpatna Venkatesh, Ashwin Prasad, and Eric Bodden. “Automated Cell Header
    Generator for Jupyter Notebooks.” <i>International Workshop on AI and Software
    Testing/Analysis (AISTA)</i>, 2021, doi:<a href="https://doi.org/10.1145/3464968.3468410">10.1145/3464968.3468410</a>.
  short: 'A.P. Shivarpatna Venkatesh, E. Bodden, in: International Workshop on AI
    and Software Testing/Analysis (AISTA), 2021.'
date_created: 2021-06-17T10:14:48Z
date_updated: 2025-04-07T10:21:29Z
department:
- _id: '76'
doi: 10.1145/3464968.3468410
language:
- iso: eng
publication: International Workshop on AI and Software Testing/Analysis (AISTA)
status: public
title: Automated Cell Header Generator for Jupyter Notebooks
type: conference
user_id: '15249'
year: '2021'
...
---
_id: '64262'
alternative_title:
- Für mittlere und kleine Projekte
author:
- first_name: Ursula
  full_name: Kusay-Merkle, Ursula
  last_name: Kusay-Merkle
citation:
  ama: Kusay-Merkle U. <i>Agiles Projektmanagement im Berufsalltag</i>. Springer Berlin
    Heidelberg; 2021. doi:<a href="https://doi.org/10.1007/978-3-662-62810-2">10.1007/978-3-662-62810-2</a>
  apa: Kusay-Merkle, U. (2021). <i>Agiles Projektmanagement im Berufsalltag</i>. Springer
    Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-662-62810-2">https://doi.org/10.1007/978-3-662-62810-2</a>
  bibtex: '@book{Kusay-Merkle_2021, place={Berlin, Heidelberg}, title={Agiles Projektmanagement
    im Berufsalltag}, DOI={<a href="https://doi.org/10.1007/978-3-662-62810-2">10.1007/978-3-662-62810-2</a>},
    publisher={Springer Berlin Heidelberg}, author={Kusay-Merkle, Ursula}, year={2021}
    }'
  chicago: 'Kusay-Merkle, Ursula. <i>Agiles Projektmanagement im Berufsalltag</i>.
    Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. <a href="https://doi.org/10.1007/978-3-662-62810-2">https://doi.org/10.1007/978-3-662-62810-2</a>.'
  ieee: 'U. Kusay-Merkle, <i>Agiles Projektmanagement im Berufsalltag</i>. Berlin,
    Heidelberg: Springer Berlin Heidelberg, 2021.'
  mla: Kusay-Merkle, Ursula. <i>Agiles Projektmanagement im Berufsalltag</i>. Springer
    Berlin Heidelberg, 2021, doi:<a href="https://doi.org/10.1007/978-3-662-62810-2">10.1007/978-3-662-62810-2</a>.
  short: U. Kusay-Merkle, Agiles Projektmanagement im Berufsalltag, Springer Berlin
    Heidelberg, Berlin, Heidelberg, 2021.
date_created: 2026-02-19T11:18:13Z
date_updated: 2026-02-20T14:47:32Z
department:
- _id: '563'
doi: 10.1007/978-3-662-62810-2
language:
- iso: ger
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783662628096'
  - '9783662628102'
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Agiles Projektmanagement im Berufsalltag
type: book
user_id: '15782'
year: '2021'
...
---
_id: '21178'
abstract:
- lang: eng
  text: "When engaging in argumentative discourse, skilled human debaters tailor\r\nclaims
    to the beliefs of the audience, to construct effective arguments.\r\nRecently,
    the field of computational argumentation witnessed extensive effort\r\nto address
    the automatic generation of arguments. However, existing approaches\r\ndo not
    perform any audience-specific adaptation. In this work, we aim to bridge\r\nthis
    gap by studying the task of belief-based claim generation: Given a\r\ncontroversial
    topic and a set of beliefs, generate an argumentative claim\r\ntailored to the
    beliefs. To tackle this task, we model the people's prior\r\nbeliefs through their
    stances on controversial topics and extend\r\nstate-of-the-art text generation
    models to generate claims conditioned on the\r\nbeliefs. Our automatic evaluation
    confirms the ability of our approach to adapt\r\nclaims to a set of given beliefs.
    In a manual study, we additionally evaluate\r\nthe generated claims in terms of
    informativeness and their likelihood to be\r\nuttered by someone with a respective
    belief. Our results reveal the limitations\r\nof modeling users' beliefs based
    on their stances, but demonstrate the\r\npotential of encoding beliefs into argumentative
    texts, laying the ground for\r\nfuture exploration of audience reach."
author:
- first_name: Milad
  full_name: Alshomary, Milad
  id: '73059'
  last_name: Alshomary
- first_name: Wei-Fan
  full_name: Chen, Wei-Fan
  id: '82920'
  last_name: Chen
- first_name: Timon
  full_name: Gurcke, Timon
  id: '52174'
  last_name: Gurcke
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
citation:
  ama: 'Alshomary M, Chen W-F, Gurcke T, Wachsmuth H. Belief-based Generation of Argumentative
    Claims. In: <i>Proceedings of the 16th Conference of the European Chapter of the
    Association for Computational Linguistics: Main Volume</i>. Association for Computational
    Linguistics; 2021:224-233. doi:<a href="https://doi.org/10.18653/v1/2021.eacl-main.17">10.18653/v1/2021.eacl-main.17</a>'
  apa: 'Alshomary, M., Chen, W.-F., Gurcke, T., &#38; Wachsmuth, H. (2021). Belief-based
    Generation of Argumentative Claims. <i>Proceedings of the 16th Conference of the
    European Chapter of the Association for Computational Linguistics: Main Volume</i>,
    224–233. <a href="https://doi.org/10.18653/v1/2021.eacl-main.17">https://doi.org/10.18653/v1/2021.eacl-main.17</a>'
  bibtex: '@inproceedings{Alshomary_Chen_Gurcke_Wachsmuth_2021, title={Belief-based
    Generation of Argumentative Claims}, DOI={<a href="https://doi.org/10.18653/v1/2021.eacl-main.17">10.18653/v1/2021.eacl-main.17</a>},
    booktitle={Proceedings of the 16th Conference of the European Chapter of the Association
    for Computational Linguistics: Main Volume}, publisher={Association for Computational
    Linguistics}, author={Alshomary, Milad and Chen, Wei-Fan and Gurcke, Timon and
    Wachsmuth, Henning}, year={2021}, pages={224–233} }'
  chicago: 'Alshomary, Milad, Wei-Fan Chen, Timon Gurcke, and Henning Wachsmuth. “Belief-Based
    Generation of Argumentative Claims.” In <i>Proceedings of the 16th Conference
    of the European Chapter of the Association for Computational Linguistics: Main
    Volume</i>, 224–33. Association for Computational Linguistics, 2021. <a href="https://doi.org/10.18653/v1/2021.eacl-main.17">https://doi.org/10.18653/v1/2021.eacl-main.17</a>.'
  ieee: 'M. Alshomary, W.-F. Chen, T. Gurcke, and H. Wachsmuth, “Belief-based Generation
    of Argumentative Claims,” in <i>Proceedings of the 16th Conference of the European
    Chapter of the Association for Computational Linguistics: Main Volume</i>, Online,
    2021, pp. 224–233, doi: <a href="https://doi.org/10.18653/v1/2021.eacl-main.17">10.18653/v1/2021.eacl-main.17</a>.'
  mla: 'Alshomary, Milad, et al. “Belief-Based Generation of Argumentative Claims.”
    <i>Proceedings of the 16th Conference of the European Chapter of the Association
    for Computational Linguistics: Main Volume</i>, Association for Computational
    Linguistics, 2021, pp. 224–33, doi:<a href="https://doi.org/10.18653/v1/2021.eacl-main.17">10.18653/v1/2021.eacl-main.17</a>.'
  short: 'M. Alshomary, W.-F. Chen, T. Gurcke, H. Wachsmuth, in: Proceedings of the
    16th Conference of the European Chapter of the Association for Computational Linguistics:
    Main Volume, Association for Computational Linguistics, 2021, pp. 224–233.'
conference:
  location: Online
  name: 'Proceedings of the 16th Conference of the European Chapter of the Association
    for Computational Linguistics: Main Volume'
date_created: 2021-02-05T08:00:07Z
date_updated: 2026-02-23T16:06:41Z
department:
- _id: '600'
doi: 10.18653/v1/2021.eacl-main.17
language:
- iso: eng
main_file_link:
- url: https://www.aclweb.org/anthology/2021.eacl-main.17
page: 224-233
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '9'
  name: 'SFB 901 - B1: SFB 901 - Subproject B1'
publication: 'Proceedings of the 16th Conference of the European Chapter of the Association
  for Computational Linguistics: Main Volume'
publisher: Association for Computational Linguistics
status: public
title: Belief-based Generation of Argumentative Claims
type: conference
user_id: '14972'
year: '2021'
...
---
_id: '54587'
abstract:
- lang: eng
  text: <jats:p>With significant growth in RDF datasets, application developers demand
    online availability of these datasets to meet the end users’ expectations. Various
    interfaces are available for querying RDF data using SPARQL query language. Studies
    show that SPARQL end-points may provide high query runtime performance at the
    cost of low availability. For example, it has been observed that only 32.2% of
    public endpoints have a monthly uptime of 99–100%. One possible reason for this
    low availability is the high workload experienced by these SPARQL endpoints. As
    complete query execution is performed at server side (i.e., SPARQL endpoint),
    this high query processing workload may result in performance degradation or even
    a service shutdown. We performed extensive experiments to show the query processing
    capabilities of well-known triple stores by using their SPARQL endpoints. In particular,
    we stressed these triple stores with multiple parallel requests from different
    querying agents. Our experiments revealed the maximum query processing capabilities
    of these triple stores after which point they lead to service shutdowns. We hope
    this analysis will help triple store developers to design workload-aware RDF engines
    to improve the availability of their public endpoints with high throughput.</jats:p>
author:
- first_name: Hashim
  full_name: Khan, Hashim
  id: '76510'
  last_name: Khan
  orcid: 0009-0006-5953-480X
- first_name: Ali
  full_name: Manzoor, Ali
  id: '77309'
  last_name: Manzoor
  orcid: https://orcid.org/0000-0001-8403-5160
- first_name: Axel-Cyrille
  full_name: Ngonga Ngomo, Axel-Cyrille
  id: '65716'
  last_name: Ngonga Ngomo
- first_name: Muhammad
  full_name: Saleem, Muhammad
  last_name: Saleem
citation:
  ama: 'Khan H, Manzoor A, Ngonga Ngomo A-C, Saleem M. When is the Peak Performance
    Reached? An Analysis of RDF Triple Stores. In: <i>Studies on the Semantic Web</i>.
    IOS Press; 2021. doi:<a href="https://doi.org/10.3233/ssw210042">10.3233/ssw210042</a>'
  apa: Khan, H., Manzoor, A., Ngonga Ngomo, A.-C., &#38; Saleem, M. (2021). When is
    the Peak Performance Reached? An Analysis of RDF Triple Stores. In <i>Studies
    on the Semantic Web</i>. IOS Press. <a href="https://doi.org/10.3233/ssw210042">https://doi.org/10.3233/ssw210042</a>
  bibtex: '@inbook{Khan_Manzoor_Ngonga Ngomo_Saleem_2021, title={When is the Peak
    Performance Reached? An Analysis of RDF Triple Stores}, DOI={<a href="https://doi.org/10.3233/ssw210042">10.3233/ssw210042</a>},
    booktitle={Studies on the Semantic Web}, publisher={IOS Press}, author={Khan,
    Hashim and Manzoor, Ali and Ngonga Ngomo, Axel-Cyrille and Saleem, Muhammad},
    year={2021} }'
  chicago: Khan, Hashim, Ali Manzoor, Axel-Cyrille Ngonga Ngomo, and Muhammad Saleem.
    “When Is the Peak Performance Reached? An Analysis of RDF Triple Stores.” In <i>Studies
    on the Semantic Web</i>. IOS Press, 2021. <a href="https://doi.org/10.3233/ssw210042">https://doi.org/10.3233/ssw210042</a>.
  ieee: H. Khan, A. Manzoor, A.-C. Ngonga Ngomo, and M. Saleem, “When is the Peak
    Performance Reached? An Analysis of RDF Triple Stores,” in <i>Studies on the Semantic
    Web</i>, IOS Press, 2021.
  mla: Khan, Hashim, et al. “When Is the Peak Performance Reached? An Analysis of
    RDF Triple Stores.” <i>Studies on the Semantic Web</i>, IOS Press, 2021, doi:<a
    href="https://doi.org/10.3233/ssw210042">10.3233/ssw210042</a>.
  short: 'H. Khan, A. Manzoor, A.-C. Ngonga Ngomo, M. Saleem, in: Studies on the Semantic
    Web, IOS Press, 2021.'
date_created: 2024-06-04T12:25:53Z
date_updated: 2025-09-11T11:39:47Z
department:
- _id: '574'
doi: 10.3233/ssw210042
language:
- iso: eng
publication: Studies on the Semantic Web
publication_identifier:
  issn:
  - 1868-1158
  - 2215-0870
publication_status: published
publisher: IOS Press
status: public
title: When is the Peak Performance Reached? An Analysis of RDF Triple Stores
type: book_chapter
user_id: '77309'
year: '2021'
...
---
_id: '31132'
author:
- first_name: Andreas Peter
  full_name: Dann, Andreas Peter
  id: '26886'
  last_name: Dann
- first_name: Henrik
  full_name: Plate, Henrik
  last_name: Plate
- first_name: Ben
  full_name: Hermann, Ben
  id: '66173'
  last_name: Hermann
  orcid: 0000-0001-9848-2017
- first_name: Serena Elisa
  full_name: Ponta, Serena Elisa
  last_name: Ponta
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
citation:
  ama: Dann AP, Plate H, Hermann B, Ponta SE, Bodden E. Identifying Challenges for
    OSS Vulnerability Scanners - A Study &#38;amp; Test Suite. <i>IEEE Transactions
    on Software Engineering</i>. Published online 2021:1-1. doi:<a href="https://doi.org/10.1109/tse.2021.3101739">10.1109/tse.2021.3101739</a>
  apa: Dann, A. P., Plate, H., Hermann, B., Ponta, S. E., &#38; Bodden, E. (2021).
    Identifying Challenges for OSS Vulnerability Scanners - A Study &#38;amp; Test
    Suite. <i>IEEE Transactions on Software Engineering</i>, 1–1. <a href="https://doi.org/10.1109/tse.2021.3101739">https://doi.org/10.1109/tse.2021.3101739</a>
  bibtex: '@article{Dann_Plate_Hermann_Ponta_Bodden_2021, title={Identifying Challenges
    for OSS Vulnerability Scanners - A Study &#38;amp; Test Suite}, DOI={<a href="https://doi.org/10.1109/tse.2021.3101739">10.1109/tse.2021.3101739</a>},
    journal={IEEE Transactions on Software Engineering}, publisher={Institute of Electrical
    and Electronics Engineers (IEEE)}, author={Dann, Andreas Peter and Plate, Henrik
    and Hermann, Ben and Ponta, Serena Elisa and Bodden, Eric}, year={2021}, pages={1–1}
    }'
  chicago: Dann, Andreas Peter, Henrik Plate, Ben Hermann, Serena Elisa Ponta, and
    Eric Bodden. “Identifying Challenges for OSS Vulnerability Scanners - A Study
    &#38;amp; Test Suite.” <i>IEEE Transactions on Software Engineering</i>, 2021,
    1–1. <a href="https://doi.org/10.1109/tse.2021.3101739">https://doi.org/10.1109/tse.2021.3101739</a>.
  ieee: 'A. P. Dann, H. Plate, B. Hermann, S. E. Ponta, and E. Bodden, “Identifying
    Challenges for OSS Vulnerability Scanners - A Study &#38;amp; Test Suite,” <i>IEEE
    Transactions on Software Engineering</i>, pp. 1–1, 2021, doi: <a href="https://doi.org/10.1109/tse.2021.3101739">10.1109/tse.2021.3101739</a>.'
  mla: Dann, Andreas Peter, et al. “Identifying Challenges for OSS Vulnerability Scanners
    - A Study &#38;amp; Test Suite.” <i>IEEE Transactions on Software Engineering</i>,
    Institute of Electrical and Electronics Engineers (IEEE), 2021, pp. 1–1, doi:<a
    href="https://doi.org/10.1109/tse.2021.3101739">10.1109/tse.2021.3101739</a>.
  short: A.P. Dann, H. Plate, B. Hermann, S.E. Ponta, E. Bodden, IEEE Transactions
    on Software Engineering (2021) 1–1.
date_created: 2022-05-09T13:02:35Z
date_updated: 2025-11-11T14:28:46Z
department:
- _id: '76'
doi: 10.1109/tse.2021.3101739
keyword:
- Software
language:
- iso: eng
page: 1-1
project:
- _id: '107'
  name: 'Reaktor: SFB 901 - Automatisierte Risikoanalyse in Bezug auf Open-Source-Abhängigkeiten
    (Hektor) (Transferproject T3)'
- _id: '1'
  name: 'SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in
    dynamischen Märkten'
- _id: '82'
  name: 'SFB 901; Projektbereich T: Transferprojekte des Sonderforschungsbereichs'
- _id: '107'
  name: 'SFB 901; TP T3: Automatisierte Risikoanalyse in Bezug auf Open-Source-Abhängigkeiten
    (Hektor)'
publication: IEEE Transactions on Software Engineering
publication_identifier:
  issn:
  - 0098-5589
  - 1939-3520
  - 2326-3881
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Identifying Challenges for OSS Vulnerability Scanners - A Study &amp; Test
  Suite
type: journal_article
user_id: '477'
year: '2021'
...
---
_id: '26405'
author:
- first_name: Philipp
  full_name: Schubert, Philipp
  id: '60543'
  last_name: Schubert
  orcid: 0000-0002-8674-1859
- first_name: Florian
  full_name: Sattler, Florian
  last_name: Sattler
- first_name: Fabian Benedikt
  full_name: Schiebel, Fabian Benedikt
  id: '55745'
  last_name: Schiebel
  orcid: 0009-0008-6867-9802
- first_name: Ben
  full_name: Hermann, Ben
  id: '66173'
  last_name: Hermann
  orcid: 0000-0001-9848-2017
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
citation:
  ama: 'Schubert P, Sattler F, Schiebel FB, Hermann B, Bodden E. Modeling the Effects
    of Global Variables in Data-Flow Analysis for C/C++. In: <i>2021 IEEE 21st International
    Working Conference on Source Code Analysis and Manipulation (SCAM)</i>. ; 2021.'
  apa: Schubert, P., Sattler, F., Schiebel, F. B., Hermann, B., &#38; Bodden, E. (2021).
    Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++. <i>2021
    IEEE 21st International Working Conference on Source Code Analysis and Manipulation
    (SCAM)</i>.
  bibtex: '@inproceedings{Schubert_Sattler_Schiebel_Hermann_Bodden_2021, title={Modeling
    the Effects of Global Variables in Data-Flow Analysis for C/C++}, booktitle={2021
    IEEE 21st International Working Conference on Source Code Analysis and Manipulation
    (SCAM)}, author={Schubert, Philipp and Sattler, Florian and Schiebel, Fabian Benedikt
    and Hermann, Ben and Bodden, Eric}, year={2021} }'
  chicago: Schubert, Philipp, Florian Sattler, Fabian Benedikt Schiebel, Ben Hermann,
    and Eric Bodden. “Modeling the Effects of Global Variables in Data-Flow Analysis
    for C/C++.” In <i>2021 IEEE 21st International Working Conference on Source Code
    Analysis and Manipulation (SCAM)</i>, 2021.
  ieee: P. Schubert, F. Sattler, F. B. Schiebel, B. Hermann, and E. Bodden, “Modeling
    the Effects of Global Variables in Data-Flow Analysis for C/C++,” 2021.
  mla: Schubert, Philipp, et al. “Modeling the Effects of Global Variables in Data-Flow
    Analysis for C/C++.” <i>2021 IEEE 21st International Working Conference on Source
    Code Analysis and Manipulation (SCAM)</i>, 2021.
  short: 'P. Schubert, F. Sattler, F.B. Schiebel, B. Hermann, E. Bodden, in: 2021
    IEEE 21st International Working Conference on Source Code Analysis and Manipulation
    (SCAM), 2021.'
date_created: 2021-10-18T12:50:35Z
date_updated: 2025-12-04T10:43:01Z
department:
- _id: '76'
language:
- iso: eng
project:
- _id: '12'
  name: 'SFB 901 - B4: SFB 901 - Subproject B4'
- _id: '3'
  name: 'SFB 901 - B: SFB 901 - Project Area B'
- _id: '1'
  name: 'SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen
    in dynamischen Märkten '
publication: 2021 IEEE 21st International Working Conference on Source Code Analysis
  and Manipulation (SCAM)
status: public
title: Modeling the Effects of Global Variables in Data-Flow Analysis for C/C++
type: conference
user_id: '15249'
year: '2021'
...
---
_id: '60447'
citation:
  ama: Andres B, Campen M, Sedlmair M, eds. <i>26th International Symposium on Vision,
    Modeling, and Visualization, VMV 2021, Virtual Event / Technische Universität
    Dresden, Germany, September 27-28, 2021</i>. Eurographics Association; 2021.
  apa: Andres, B., Campen, M., &#38; Sedlmair, M. (Eds.). (2021). <i>26th International
    Symposium on Vision, Modeling, and Visualization, VMV 2021, Virtual Event / Technische
    Universität Dresden, Germany, September 27-28, 2021</i>. Eurographics Association.
  bibtex: '@book{Andres_Campen_Sedlmair_2021, title={26th International Symposium
    on Vision, Modeling, and Visualization, VMV 2021, Virtual Event / Technische Universität
    Dresden, Germany, September 27-28, 2021}, publisher={Eurographics Association},
    year={2021} }'
  chicago: Andres, Bjoern, Marcel Campen, and Michael Sedlmair, eds. <i>26th International
    Symposium on Vision, Modeling, and Visualization, VMV 2021, Virtual Event / Technische
    Universität Dresden, Germany, September 27-28, 2021</i>. Eurographics Association,
    2021.
  ieee: B. Andres, M. Campen, and M. Sedlmair, Eds., <i>26th International Symposium
    on Vision, Modeling, and Visualization, VMV 2021, Virtual Event / Technische Universität
    Dresden, Germany, September 27-28, 2021</i>. Eurographics Association, 2021.
  mla: Andres, Bjoern, et al., editors. <i>26th International Symposium on Vision,
    Modeling, and Visualization, VMV 2021, Virtual Event / Technische Universität
    Dresden, Germany, September 27-28, 2021</i>. Eurographics Association, 2021.
  short: B. Andres, M. Campen, M. Sedlmair, eds., 26th International Symposium on
    Vision, Modeling, and Visualization, VMV 2021, Virtual Event / Technische Universität
    Dresden, Germany, September 27-28, 2021, Eurographics Association, 2021.
date_created: 2025-06-27T10:28:46Z
date_updated: 2025-07-14T12:41:02Z
department:
- _id: '969'
editor:
- first_name: Bjoern
  full_name: Andres, Bjoern
  last_name: Andres
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Michael
  full_name: Sedlmair, Michael
  last_name: Sedlmair
extern: '1'
language:
- iso: eng
publication_identifier:
  isbn:
  - 978-3-03868-161-8
publisher: Eurographics Association
status: public
title: 26th International Symposium on Vision, Modeling, and Visualization, VMV 2021,
  Virtual Event / Technische Universität Dresden, Germany, September 27-28, 2021
type: conference_editor
user_id: '114904'
year: '2021'
...
---
_id: '60377'
abstract:
- lang: eng
  text: <jats:p>We present a guaranteed quality mesh generation algorithm for the
    curvilinear triangulation of planar domains with piecewise polynomial boundary.
    The resulting mesh consists of higher-order triangular elements which are not
    only regular (i.e., with injective geometric map) but respect strict bounds on
    quality measures like scaled Jacobian and MIPS distortion. This also implies that
    the curved triangles' inner angles are bounded from above and below. These are
    key quality criteria, for instance, in the field of finite element analysis. The
    domain boundary is reproduced exactly, without geometric approximation error.
    The central idea is to transform the curvilinear meshing problem into a linear
    meshing problem via a carefully constructed transformation of bounded distortion,
    enabling us to leverage key results on guaranteed-quality straight-edge triangulation.
    The transformation is based on a simple yet general construction and observations
    about convergence properties of curves under subdivision. Our algorithm can handle
    arbitrary polynomial order, arbitrarily sharp corners, feature and interface curves,
    and can be executed using rational arithmetic for strict reliability.</jats:p>
author:
- first_name: Manish
  full_name: Mandad, Manish
  last_name: Mandad
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
citation:
  ama: Mandad M, Campen M. Guaranteed-quality higher-order triangular meshing of 2D
    domains. <i>ACM Transactions on Graphics</i>. 2021;40(4):1-14. doi:<a href="https://doi.org/10.1145/3450626.3459673">10.1145/3450626.3459673</a>
  apa: Mandad, M., &#38; Campen, M. (2021). Guaranteed-quality higher-order triangular
    meshing of 2D domains. <i>ACM Transactions on Graphics</i>, <i>40</i>(4), 1–14.
    <a href="https://doi.org/10.1145/3450626.3459673">https://doi.org/10.1145/3450626.3459673</a>
  bibtex: '@article{Mandad_Campen_2021, title={Guaranteed-quality higher-order triangular
    meshing of 2D domains}, volume={40}, DOI={<a href="https://doi.org/10.1145/3450626.3459673">10.1145/3450626.3459673</a>},
    number={4}, journal={ACM Transactions on Graphics}, publisher={Association for
    Computing Machinery (ACM)}, author={Mandad, Manish and Campen, Marcel}, year={2021},
    pages={1–14} }'
  chicago: 'Mandad, Manish, and Marcel Campen. “Guaranteed-Quality Higher-Order Triangular
    Meshing of 2D Domains.” <i>ACM Transactions on Graphics</i> 40, no. 4 (2021):
    1–14. <a href="https://doi.org/10.1145/3450626.3459673">https://doi.org/10.1145/3450626.3459673</a>.'
  ieee: 'M. Mandad and M. Campen, “Guaranteed-quality higher-order triangular meshing
    of 2D domains,” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, pp. 1–14,
    2021, doi: <a href="https://doi.org/10.1145/3450626.3459673">10.1145/3450626.3459673</a>.'
  mla: Mandad, Manish, and Marcel Campen. “Guaranteed-Quality Higher-Order Triangular
    Meshing of 2D Domains.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 4, Association
    for Computing Machinery (ACM), 2021, pp. 1–14, doi:<a href="https://doi.org/10.1145/3450626.3459673">10.1145/3450626.3459673</a>.
  short: M. Mandad, M. Campen, ACM Transactions on Graphics 40 (2021) 1–14.
date_created: 2025-06-25T10:06:07Z
date_updated: 2025-07-14T12:47:43Z
department:
- _id: '969'
doi: 10.1145/3450626.3459673
extern: '1'
intvolume: '        40'
issue: '4'
language:
- iso: eng
page: 1-14
publication: ACM Transactions on Graphics
publication_identifier:
  issn:
  - 0730-0301
  - 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Guaranteed-quality higher-order triangular meshing of 2D domains
type: journal_article
user_id: '117512'
volume: 40
year: '2021'
...
---
_id: '60378'
abstract:
- lang: eng
  text: <jats:p>We describe an efficient algorithm to compute a discrete metric with
    prescribed Gaussian curvature at all interior vertices and prescribed geodesic
    curvature along the boundary of a mesh. The metric is (discretely) conformally
    equivalent to the input metric. Its construction is based on theory developed
    in [Gu et al. 2018b] and [Springborn 2020], relying on results on hyperbolic ideal
    Delaunay triangulations. Generality is achieved by considering the surface's intrinsic
    triangulation as a degree of freedom, and particular attention is paid to the
    proper treatment of surface boundaries. While via a double cover approach the
    case with boundary can be reduced to the case without boundary quite naturally,
    the implied symmetry of the setting causes additional challenges related to stable
    Delaunay-critical configurations that we address explicitly. We furthermore explore
    the numerical limits of the approach and derive continuous maps from the discrete
    metrics.</jats:p>
author:
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Ryan
  full_name: Capouellez, Ryan
  last_name: Capouellez
- first_name: Hanxiao
  full_name: Shen, Hanxiao
  last_name: Shen
- first_name: Leyi
  full_name: Zhu, Leyi
  last_name: Zhu
- first_name: Daniele
  full_name: Panozzo, Daniele
  last_name: Panozzo
- first_name: Denis
  full_name: Zorin, Denis
  last_name: Zorin
citation:
  ama: Campen M, Capouellez R, Shen H, Zhu L, Panozzo D, Zorin D. Efficient and robust
    discrete conformal equivalence with boundary. <i>ACM Transactions on Graphics</i>.
    2021;40(6):1-16. doi:<a href="https://doi.org/10.1145/3478513.3480557">10.1145/3478513.3480557</a>
  apa: Campen, M., Capouellez, R., Shen, H., Zhu, L., Panozzo, D., &#38; Zorin, D.
    (2021). Efficient and robust discrete conformal equivalence with boundary. <i>ACM
    Transactions on Graphics</i>, <i>40</i>(6), 1–16. <a href="https://doi.org/10.1145/3478513.3480557">https://doi.org/10.1145/3478513.3480557</a>
  bibtex: '@article{Campen_Capouellez_Shen_Zhu_Panozzo_Zorin_2021, title={Efficient
    and robust discrete conformal equivalence with boundary}, volume={40}, DOI={<a
    href="https://doi.org/10.1145/3478513.3480557">10.1145/3478513.3480557</a>}, number={6},
    journal={ACM Transactions on Graphics}, publisher={Association for Computing Machinery
    (ACM)}, author={Campen, Marcel and Capouellez, Ryan and Shen, Hanxiao and Zhu,
    Leyi and Panozzo, Daniele and Zorin, Denis}, year={2021}, pages={1–16} }'
  chicago: 'Campen, Marcel, Ryan Capouellez, Hanxiao Shen, Leyi Zhu, Daniele Panozzo,
    and Denis Zorin. “Efficient and Robust Discrete Conformal Equivalence with Boundary.”
    <i>ACM Transactions on Graphics</i> 40, no. 6 (2021): 1–16. <a href="https://doi.org/10.1145/3478513.3480557">https://doi.org/10.1145/3478513.3480557</a>.'
  ieee: 'M. Campen, R. Capouellez, H. Shen, L. Zhu, D. Panozzo, and D. Zorin, “Efficient
    and robust discrete conformal equivalence with boundary,” <i>ACM Transactions
    on Graphics</i>, vol. 40, no. 6, pp. 1–16, 2021, doi: <a href="https://doi.org/10.1145/3478513.3480557">10.1145/3478513.3480557</a>.'
  mla: Campen, Marcel, et al. “Efficient and Robust Discrete Conformal Equivalence
    with Boundary.” <i>ACM Transactions on Graphics</i>, vol. 40, no. 6, Association
    for Computing Machinery (ACM), 2021, pp. 1–16, doi:<a href="https://doi.org/10.1145/3478513.3480557">10.1145/3478513.3480557</a>.
  short: M. Campen, R. Capouellez, H. Shen, L. Zhu, D. Panozzo, D. Zorin, ACM Transactions
    on Graphics 40 (2021) 1–16.
date_created: 2025-06-25T10:08:08Z
date_updated: 2025-07-14T12:47:47Z
department:
- _id: '969'
doi: 10.1145/3478513.3480557
extern: '1'
intvolume: '        40'
issue: '6'
language:
- iso: eng
page: 1-16
publication: ACM Transactions on Graphics
publication_identifier:
  issn:
  - 0730-0301
  - 1557-7368
publication_status: published
publisher: Association for Computing Machinery (ACM)
status: public
title: Efficient and robust discrete conformal equivalence with boundary
type: journal_article
user_id: '117512'
volume: 40
year: '2021'
...
---
_id: '60376'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>A homeomorphism between two surfaces
    not only defines a (continuous and bijective) geometric correspondence of points
    but also (by implication) an identification of topological features, i.e. handles
    and tunnels, and how the map twists around them. However, in practice, surface
    maps are often encoded via sparse correspondences or fuzzy representations that
    merely approximate a homeomorphism and are therefore inherently ambiguous about
    map topology. In this work, we show a way to infer topological information from
    an imperfect input map between two shapes. In particular, we compute a homology
    map, a linear map that transports homology classes of cycles from one surface
    to the other, subject to a global consistency constraint. Our inference robustly
    handles imperfect (e.g., partial, sparse, fuzzy, noisy, outlier‐ridden, non‐injective)
    input maps and is guaranteed to produce homology maps that are compatible with
    true homeomorphisms between the input shapes. Homology maps inferred by our method
    can be directly used to transfer homological information between shapes, or serve
    as foundation for the construction of a proper homeomorphism guided by the input
    map, e.g., via compatible surface decomposition.</jats:p>
author:
- first_name: Janis
  full_name: Born, Janis
  last_name: Born
- first_name: Patrick
  full_name: Schmidt, Patrick
  last_name: Schmidt
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Leif
  full_name: Kobbelt, Leif
  last_name: Kobbelt
citation:
  ama: Born J, Schmidt P, Campen M, Kobbelt L. Surface Map Homology Inference. <i>Computer
    Graphics Forum</i>. 2021;40(5):193-204. doi:<a href="https://doi.org/10.1111/cgf.14367">10.1111/cgf.14367</a>
  apa: Born, J., Schmidt, P., Campen, M., &#38; Kobbelt, L. (2021). Surface Map Homology
    Inference. <i>Computer Graphics Forum</i>, <i>40</i>(5), 193–204. <a href="https://doi.org/10.1111/cgf.14367">https://doi.org/10.1111/cgf.14367</a>
  bibtex: '@article{Born_Schmidt_Campen_Kobbelt_2021, title={Surface Map Homology
    Inference}, volume={40}, DOI={<a href="https://doi.org/10.1111/cgf.14367">10.1111/cgf.14367</a>},
    number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Born,
    Janis and Schmidt, Patrick and Campen, Marcel and Kobbelt, Leif}, year={2021},
    pages={193–204} }'
  chicago: 'Born, Janis, Patrick Schmidt, Marcel Campen, and Leif Kobbelt. “Surface
    Map Homology Inference.” <i>Computer Graphics Forum</i> 40, no. 5 (2021): 193–204.
    <a href="https://doi.org/10.1111/cgf.14367">https://doi.org/10.1111/cgf.14367</a>.'
  ieee: 'J. Born, P. Schmidt, M. Campen, and L. Kobbelt, “Surface Map Homology Inference,”
    <i>Computer Graphics Forum</i>, vol. 40, no. 5, pp. 193–204, 2021, doi: <a href="https://doi.org/10.1111/cgf.14367">10.1111/cgf.14367</a>.'
  mla: Born, Janis, et al. “Surface Map Homology Inference.” <i>Computer Graphics
    Forum</i>, vol. 40, no. 5, Wiley, 2021, pp. 193–204, doi:<a href="https://doi.org/10.1111/cgf.14367">10.1111/cgf.14367</a>.
  short: J. Born, P. Schmidt, M. Campen, L. Kobbelt, Computer Graphics Forum 40 (2021)
    193–204.
date_created: 2025-06-25T09:54:02Z
date_updated: 2025-07-14T12:47:40Z
department:
- _id: '969'
doi: 10.1111/cgf.14367
extern: '1'
intvolume: '        40'
issue: '5'
language:
- iso: eng
page: 193-204
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Surface Map Homology Inference
type: journal_article
user_id: '117512'
volume: 40
year: '2021'
...
---
_id: '60374'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>We present a robust and fast method
    for the creation of conforming quad layouts on surfaces. Our algorithm is based
    on the quantization of a T‐mesh, i.e. an assignment of integer lengths to the
    sides of a non‐conforming rectangular partition of the surface. This representation
    has the benefit of being able to encode an infinite number of layout connectivity
    options in a finite manner, which guarantees that a valid layout can always be
    found. We carefully construct the T‐mesh from a given seamless parametrization
    such that the algorithm can provide guarantees on the results' quality. In particular,
    the user can specify a bound on the angular deviation of layout edges from prescribed
    directions. We solve an integer linear program (ILP) to find a coarse quad layout
    adhering to that maximal deviation. Our algorithm is guaranteed to yield a conforming
    quad layout free of T‐junctions together with bounded angle distortion. Our results
    show that the presented method is fast, reliable, and achieves high quality layouts.</jats:p>
author:
- first_name: Max
  full_name: Lyon, Max
  last_name: Lyon
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Leif
  full_name: Kobbelt, Leif
  last_name: Kobbelt
citation:
  ama: Lyon M, Campen M, Kobbelt L. Quad Layouts via Constrained T‐Mesh Quantization.
    <i>Computer Graphics Forum</i>. 2021;40(2):305-314. doi:<a href="https://doi.org/10.1111/cgf.142634">10.1111/cgf.142634</a>
  apa: Lyon, M., Campen, M., &#38; Kobbelt, L. (2021). Quad Layouts via Constrained
    T‐Mesh Quantization. <i>Computer Graphics Forum</i>, <i>40</i>(2), 305–314. <a
    href="https://doi.org/10.1111/cgf.142634">https://doi.org/10.1111/cgf.142634</a>
  bibtex: '@article{Lyon_Campen_Kobbelt_2021, title={Quad Layouts via Constrained
    T‐Mesh Quantization}, volume={40}, DOI={<a href="https://doi.org/10.1111/cgf.142634">10.1111/cgf.142634</a>},
    number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Lyon,
    Max and Campen, Marcel and Kobbelt, Leif}, year={2021}, pages={305–314} }'
  chicago: 'Lyon, Max, Marcel Campen, and Leif Kobbelt. “Quad Layouts via Constrained
    T‐Mesh Quantization.” <i>Computer Graphics Forum</i> 40, no. 2 (2021): 305–14.
    <a href="https://doi.org/10.1111/cgf.142634">https://doi.org/10.1111/cgf.142634</a>.'
  ieee: 'M. Lyon, M. Campen, and L. Kobbelt, “Quad Layouts via Constrained T‐Mesh
    Quantization,” <i>Computer Graphics Forum</i>, vol. 40, no. 2, pp. 305–314, 2021,
    doi: <a href="https://doi.org/10.1111/cgf.142634">10.1111/cgf.142634</a>.'
  mla: Lyon, Max, et al. “Quad Layouts via Constrained T‐Mesh Quantization.” <i>Computer
    Graphics Forum</i>, vol. 40, no. 2, Wiley, 2021, pp. 305–14, doi:<a href="https://doi.org/10.1111/cgf.142634">10.1111/cgf.142634</a>.
  short: M. Lyon, M. Campen, L. Kobbelt, Computer Graphics Forum 40 (2021) 305–314.
date_created: 2025-06-25T09:17:15Z
date_updated: 2025-07-14T12:47:35Z
department:
- _id: '969'
doi: 10.1111/cgf.142634
extern: '1'
intvolume: '        40'
issue: '2'
language:
- iso: eng
page: 305-314
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Quad Layouts via Constrained T‐Mesh Quantization
type: journal_article
user_id: '117512'
volume: 40
year: '2021'
...
---
_id: '60375'
abstract:
- lang: eng
  text: <jats:title>Abstract</jats:title><jats:p>A common approach to automatic quad
    layout generation on surfaces is to, in a first stage, decide on the positioning
    of irregular layout vertices, followed by finding sensible layout edges connecting
    these vertices and partitioning the surface into quadrilateral patches in a second
    stage. While this two‐step approach reduces the problem's complexity, this separation
    also limits the result quality. In the worst case, the set of layout vertices
    fixed in the first stage without consideration of the second may not even permit
    a valid quad layout. We propose an algorithm for the creation of quad layouts
    in which the initial layout vertices can be adjusted in the second stage. Whenever
    beneficial for layout quality or even validity, these vertices may be moved within
    a prescribed radius or even be removed. Our algorithm is based on a robust quantization
    strategy, turning a continuous T‐mesh structure into a discrete layout. We show
    the effectiveness of our algorithm on a variety of inputs.</jats:p>
author:
- first_name: Max
  full_name: Lyon, Max
  last_name: Lyon
- first_name: Marcel
  full_name: Campen, Marcel
  id: '114904'
  last_name: Campen
  orcid: 0000-0003-2340-3462
- first_name: Leif
  full_name: Kobbelt, Leif
  last_name: Kobbelt
citation:
  ama: Lyon M, Campen M, Kobbelt L. Simpler Quad Layouts using Relaxed Singularities.
    <i>Computer Graphics Forum</i>. 2021;40(5):169-180. doi:<a href="https://doi.org/10.1111/cgf.14365">10.1111/cgf.14365</a>
  apa: Lyon, M., Campen, M., &#38; Kobbelt, L. (2021). Simpler Quad Layouts using
    Relaxed Singularities. <i>Computer Graphics Forum</i>, <i>40</i>(5), 169–180.
    <a href="https://doi.org/10.1111/cgf.14365">https://doi.org/10.1111/cgf.14365</a>
  bibtex: '@article{Lyon_Campen_Kobbelt_2021, title={Simpler Quad Layouts using Relaxed
    Singularities}, volume={40}, DOI={<a href="https://doi.org/10.1111/cgf.14365">10.1111/cgf.14365</a>},
    number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Lyon,
    Max and Campen, Marcel and Kobbelt, Leif}, year={2021}, pages={169–180} }'
  chicago: 'Lyon, Max, Marcel Campen, and Leif Kobbelt. “Simpler Quad Layouts Using
    Relaxed Singularities.” <i>Computer Graphics Forum</i> 40, no. 5 (2021): 169–80.
    <a href="https://doi.org/10.1111/cgf.14365">https://doi.org/10.1111/cgf.14365</a>.'
  ieee: 'M. Lyon, M. Campen, and L. Kobbelt, “Simpler Quad Layouts using Relaxed Singularities,”
    <i>Computer Graphics Forum</i>, vol. 40, no. 5, pp. 169–180, 2021, doi: <a href="https://doi.org/10.1111/cgf.14365">10.1111/cgf.14365</a>.'
  mla: Lyon, Max, et al. “Simpler Quad Layouts Using Relaxed Singularities.” <i>Computer
    Graphics Forum</i>, vol. 40, no. 5, Wiley, 2021, pp. 169–80, doi:<a href="https://doi.org/10.1111/cgf.14365">10.1111/cgf.14365</a>.
  short: M. Lyon, M. Campen, L. Kobbelt, Computer Graphics Forum 40 (2021) 169–180.
date_created: 2025-06-25T09:39:31Z
date_updated: 2025-07-14T12:47:37Z
department:
- _id: '969'
doi: 10.1111/cgf.14365
extern: '1'
intvolume: '        40'
issue: '5'
language:
- iso: eng
page: 169-180
publication: Computer Graphics Forum
publication_identifier:
  issn:
  - 0167-7055
  - 1467-8659
publication_status: published
publisher: Wiley
status: public
title: Simpler Quad Layouts using Relaxed Singularities
type: journal_article
user_id: '117512'
volume: 40
year: '2021'
...
---
_id: '25212'
abstract:
- lang: eng
  text: "Finding a good query plan is key to the optimization of query runtime. This
    holds in particular for cost-based federation\r\nengines, which make use of cardinality
    estimations to achieve this goal. A number of studies compare SPARQL federation
    engines across different performance metrics, including query runtime, result
    set completeness and correctness, number of sources selected and number of requests
    sent. Albeit informative, these metrics are generic and unable to quantify and
    evaluate the accuracy of the cardinality estimators of cost-based federation engines.
    To thoroughly evaluate cost-based federation engines, the effect of estimated
    cardinality errors on the overall query runtime performance must be measured.
    In this paper, we address this challenge by presenting novel evaluation metrics
    targeted at a fine-grained benchmarking of cost-based federated SPARQL query engines.
    We evaluate five cost-based federated SPARQL query engines using existing as well
    as novel evaluation metrics by using LargeRDFBench queries. Our results provide
    a detailed analysis of the experimental outcomes that reveal novel insights, useful
    for the development of future cost-based federated SPARQL query processing engines."
article_type: original
author:
- first_name: Umair
  full_name: Qudus, Umair
  id: '83392'
  last_name: Qudus
  orcid: 0000-0001-6714-8729
- first_name: Muhammad
  full_name: Saleem, Muhammad
  last_name: Saleem
- first_name: Axel-Cyrille
  full_name: Ngonga Ngomo, Axel-Cyrille
  id: '65716'
  last_name: Ngonga Ngomo
- first_name: Young-Koo
  full_name: Lee, Young-Koo
  last_name: Lee
citation:
  ama: Qudus U, Saleem M, Ngonga Ngomo A-C, Lee Y-K. An Empirical Evaluation of Cost-based
    Federated SPARQL Query Processing Engines. <i>Semantic Web</i>. 12(6):843-868.
    doi:<a href="https://doi.org/10.3233/SW-200420">10.3233/SW-200420</a>
  apa: Qudus, U., Saleem, M., Ngonga Ngomo, A.-C., &#38; Lee, Y.-K. (n.d.). An Empirical
    Evaluation of Cost-based Federated SPARQL Query Processing Engines. <i>Semantic
    Web</i>, <i>12</i>(6), 843–868. <a href="https://doi.org/10.3233/SW-200420">https://doi.org/10.3233/SW-200420</a>
  bibtex: '@article{Qudus_Saleem_Ngonga Ngomo_Lee, title={An Empirical Evaluation
    of Cost-based Federated SPARQL Query Processing Engines}, volume={12}, DOI={<a
    href="https://doi.org/10.3233/SW-200420">10.3233/SW-200420</a>}, number={6}, journal={Semantic
    Web}, publisher={ISO Press}, author={Qudus, Umair and Saleem, Muhammad and Ngonga
    Ngomo, Axel-Cyrille and Lee, Young-Koo}, pages={843–868} }'
  chicago: 'Qudus, Umair, Muhammad Saleem, Axel-Cyrille Ngonga Ngomo, and Young-Koo
    Lee. “An Empirical Evaluation of Cost-Based Federated SPARQL Query Processing
    Engines.” <i>Semantic Web</i> 12, no. 6 (n.d.): 843–68. <a href="https://doi.org/10.3233/SW-200420">https://doi.org/10.3233/SW-200420</a>.'
  ieee: 'U. Qudus, M. Saleem, A.-C. Ngonga Ngomo, and Y.-K. Lee, “An Empirical Evaluation
    of Cost-based Federated SPARQL Query Processing Engines,” <i>Semantic Web</i>,
    vol. 12, no. 6, pp. 843–868, doi: <a href="https://doi.org/10.3233/SW-200420">10.3233/SW-200420</a>.'
  mla: Qudus, Umair, et al. “An Empirical Evaluation of Cost-Based Federated SPARQL
    Query Processing Engines.” <i>Semantic Web</i>, vol. 12, no. 6, ISO Press, pp.
    843–68, doi:<a href="https://doi.org/10.3233/SW-200420">10.3233/SW-200420</a>.
  short: U. Qudus, M. Saleem, A.-C. Ngonga Ngomo, Y.-K. Lee, Semantic Web 12 (n.d.)
    843–868.
date_created: 2021-10-01T06:52:52Z
date_updated: 2025-09-11T09:50:14Z
ddc:
- '000'
department:
- _id: '574'
doi: 10.3233/SW-200420
file:
- access_level: closed
  content_type: application/pdf
  creator: uqudus
  date_created: 2024-01-13T11:35:53Z
  date_updated: 2024-01-13T11:35:53Z
  file_id: '50483'
  file_name: swj2604.pdf
  file_size: 978478
  relation: main_file
  success: 1
file_date_updated: 2024-01-13T11:35:53Z
has_accepted_license: '1'
intvolume: '        12'
issue: '6'
keyword:
- SPARQL
- benchmarking
- cost-based
- cost-free
- federated
- querying
language:
- iso: eng
page: 843-868
project:
- _id: '410'
  name: 'KnowGraphs: KnowGraphs: Knowledge Graphs at Scale'
publication: Semantic Web
publication_identifier:
  issn:
  - 2210-4968
publication_status: accepted
publisher: ISO Press
status: public
title: An Empirical Evaluation of Cost-based Federated SPARQL Query Processing Engines
type: journal_article
user_id: '83392'
volume: 12
year: '2021'
...
---
_id: '25334'
author:
- first_name: Paul
  full_name: Fiterau-Brostean, Paul
  last_name: Fiterau-Brostean
- first_name: Bengt
  full_name: Jonsson, Bengt
  last_name: Jonsson
- first_name: Robert
  full_name: Merget, Robert
  last_name: Merget
- first_name: Joeri
  full_name: de Ruiter, Joeri
  last_name: de Ruiter
- first_name: Konstantinos
  full_name: Sagonas, Konstantinos
  last_name: Sagonas
- first_name: Juraj
  full_name: Somorovsky, Juraj
  id: '83504'
  last_name: Somorovsky
  orcid: 0000-0002-3593-7720
citation:
  ama: 'Fiterau-Brostean P, Jonsson B, Merget R, de Ruiter J, Sagonas K, Somorovsky
    J. Analysis of DTLS Implementations Using Protocol State Fuzzing. In: <i>29th
    {USENIX} Security Symposium ({USENIX} Security 20)</i>. {USENIX} Association;
    2020:2523-2540.'
  apa: Fiterau-Brostean, P., Jonsson, B., Merget, R., de Ruiter, J., Sagonas, K.,
    &#38; Somorovsky, J. (2020). Analysis of DTLS Implementations Using Protocol State
    Fuzzing. <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>, 2523–2540.
  bibtex: '@inproceedings{Fiterau-Brostean_Jonsson_Merget_de Ruiter_Sagonas_Somorovsky_2020,
    title={Analysis of DTLS Implementations Using Protocol State Fuzzing}, booktitle={29th
    {USENIX} Security Symposium ({USENIX} Security 20)}, publisher={{USENIX} Association},
    author={Fiterau-Brostean, Paul and Jonsson, Bengt and Merget, Robert and de Ruiter,
    Joeri and Sagonas, Konstantinos and Somorovsky, Juraj}, year={2020}, pages={2523–2540}
    }'
  chicago: Fiterau-Brostean, Paul, Bengt Jonsson, Robert Merget, Joeri de Ruiter,
    Konstantinos Sagonas, and Juraj Somorovsky. “Analysis of DTLS Implementations
    Using Protocol State Fuzzing.” In <i>29th {USENIX} Security Symposium ({USENIX}
    Security 20)</i>, 2523–40. {USENIX} Association, 2020.
  ieee: P. Fiterau-Brostean, B. Jonsson, R. Merget, J. de Ruiter, K. Sagonas, and
    J. Somorovsky, “Analysis of DTLS Implementations Using Protocol State Fuzzing,”
    in <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>, 2020, pp. 2523–2540.
  mla: Fiterau-Brostean, Paul, et al. “Analysis of DTLS Implementations Using Protocol
    State Fuzzing.” <i>29th {USENIX} Security Symposium ({USENIX} Security 20)</i>,
    {USENIX} Association, 2020, pp. 2523–40.
  short: 'P. Fiterau-Brostean, B. Jonsson, R. Merget, J. de Ruiter, K. Sagonas, J.
    Somorovsky, in: 29th {USENIX} Security Symposium ({USENIX} Security 20), {USENIX}
    Association, 2020, pp. 2523–2540.'
date_created: 2021-10-04T18:56:41Z
date_updated: 2022-01-06T06:57:01Z
department:
- _id: '632'
language:
- iso: eng
page: 2523-2540
publication: 29th {USENIX} Security Symposium ({USENIX} Security 20)
publication_identifier:
  isbn:
  - 978-1-939133-17-5
publisher: '{USENIX} Association'
status: public
title: Analysis of DTLS Implementations Using Protocol State Fuzzing
type: conference
user_id: '83504'
year: '2020'
...
---
_id: '19521'
author:
- first_name: Karlson
  full_name: Pfannschmidt, Karlson
  last_name: Pfannschmidt
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  last_name: Hüllermeier
citation:
  ama: 'Pfannschmidt K, Hüllermeier E. Learning Choice Functions via Pareto-Embeddings.
    In: <i>Lecture Notes in Computer Science</i>. Cham; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-58285-2_30">10.1007/978-3-030-58285-2_30</a>'
  apa: Pfannschmidt, K., &#38; Hüllermeier, E. (2020). Learning Choice Functions via
    Pareto-Embeddings. In <i>Lecture Notes in Computer Science</i>. Cham. <a href="https://doi.org/10.1007/978-3-030-58285-2_30">https://doi.org/10.1007/978-3-030-58285-2_30</a>
  bibtex: '@inbook{Pfannschmidt_Hüllermeier_2020, place={Cham}, title={Learning Choice
    Functions via Pareto-Embeddings}, DOI={<a href="https://doi.org/10.1007/978-3-030-58285-2_30">10.1007/978-3-030-58285-2_30</a>},
    booktitle={Lecture Notes in Computer Science}, author={Pfannschmidt, Karlson and
    Hüllermeier, Eyke}, year={2020} }'
  chicago: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions
    via Pareto-Embeddings.” In <i>Lecture Notes in Computer Science</i>. Cham, 2020.
    <a href="https://doi.org/10.1007/978-3-030-58285-2_30">https://doi.org/10.1007/978-3-030-58285-2_30</a>.
  ieee: K. Pfannschmidt and E. Hüllermeier, “Learning Choice Functions via Pareto-Embeddings,”
    in <i>Lecture Notes in Computer Science</i>, Cham, 2020.
  mla: Pfannschmidt, Karlson, and Eyke Hüllermeier. “Learning Choice Functions via
    Pareto-Embeddings.” <i>Lecture Notes in Computer Science</i>, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-58285-2_30">10.1007/978-3-030-58285-2_30</a>.
  short: 'K. Pfannschmidt, E. Hüllermeier, in: Lecture Notes in Computer Science,
    Cham, 2020.'
date_created: 2020-09-17T10:52:41Z
date_updated: 2022-01-06T06:54:06Z
department:
- _id: '7'
- _id: '355'
doi: 10.1007/978-3-030-58285-2_30
language:
- iso: eng
place: Cham
project:
- _id: '52'
  name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783030582845'
  - '9783030582852'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Learning Choice Functions via Pareto-Embeddings
type: book_chapter
user_id: '13472'
year: '2020'
...
---
_id: '19606'
abstract:
- lang: eng
  text: Mobile shopping apps have been using Augmented Reality (AR) in the last years
    to place their products in the environment of the customer. While this is possible
    with atomic 3D objects, there is is still a lack in the runtime conﬁguration of
    3D object compositions based on user needs and environmental constraints. For
    this, we previously developed an approach for model-based AR-assisted product
    conﬁguration based on the concept of Dynamic Software Product Lines. In this demonstration
    paper, we present the corresponding tool support ProConAR in the form of a Product
    Modeler and a Product Conﬁgurator. While the Product Modeler is an Angular web
    app that splits products (e.g. table) up into atomic parts (e.g. tabletop, table
    legs, funnier) and saves it within a conﬁguration model, the Product Conﬁgurator
    is an Android client that uses the conﬁguration model to place diﬀerent product
    conﬁgurations within the environment of the customer. We show technical details
    of our ready to use tool-chain ProConAR by describing its implementation and usage
    as well as pointing out future research directions.
author:
- first_name: Sebastian
  full_name: Gottschalk, Sebastian
  id: '47208'
  last_name: Gottschalk
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Eugen
  full_name: Schmidt, Eugen
  last_name: Schmidt
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Gottschalk S, Yigitbas E, Schmidt E, Engels G. ProConAR: A Tool Support for
    Model-based AR Product Configuration. In: Bernhaupt R, Ardito C, Sauer S, eds.
    <i>Human-Centered Software Engineering. HCSE 2020</i>. Vol 12481. Lecture Notes
    in Computer Science. Cham: Springer; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-64266-2_14">10.1007/978-3-030-64266-2_14</a>'
  apa: 'Gottschalk, S., Yigitbas, E., Schmidt, E., &#38; Engels, G. (2020). ProConAR:
    A Tool Support for Model-based AR Product Configuration. In R. Bernhaupt, C. Ardito,
    &#38; S. Sauer (Eds.), <i>Human-Centered Software Engineering. HCSE 2020</i> (Vol.
    12481). Cham: Springer. <a href="https://doi.org/10.1007/978-3-030-64266-2_14">https://doi.org/10.1007/978-3-030-64266-2_14</a>'
  bibtex: '@inproceedings{Gottschalk_Yigitbas_Schmidt_Engels_2020, place={Cham}, series={Lecture
    Notes in Computer Science}, title={ProConAR: A Tool Support for Model-based AR
    Product Configuration}, volume={12481}, DOI={<a href="https://doi.org/10.1007/978-3-030-64266-2_14">10.1007/978-3-030-64266-2_14</a>},
    booktitle={Human-Centered Software Engineering. HCSE 2020}, publisher={Springer},
    author={Gottschalk, Sebastian and Yigitbas, Enes and Schmidt, Eugen and Engels,
    Gregor}, editor={Bernhaupt, Regina and Ardito, Carmelo and Sauer, StefanEditors},
    year={2020}, collection={Lecture Notes in Computer Science} }'
  chicago: 'Gottschalk, Sebastian, Enes Yigitbas, Eugen Schmidt, and Gregor Engels.
    “ProConAR: A Tool Support for Model-Based AR Product Configuration.” In <i>Human-Centered
    Software Engineering. HCSE 2020</i>, edited by Regina Bernhaupt, Carmelo Ardito,
    and Stefan Sauer, Vol. 12481. Lecture Notes in Computer Science. Cham: Springer,
    2020. <a href="https://doi.org/10.1007/978-3-030-64266-2_14">https://doi.org/10.1007/978-3-030-64266-2_14</a>.'
  ieee: 'S. Gottschalk, E. Yigitbas, E. Schmidt, and G. Engels, “ProConAR: A Tool
    Support for Model-based AR Product Configuration,” in <i>Human-Centered Software
    Engineering. HCSE 2020</i>, Eindhoven, 2020, vol. 12481.'
  mla: 'Gottschalk, Sebastian, et al. “ProConAR: A Tool Support for Model-Based AR
    Product Configuration.” <i>Human-Centered Software Engineering. HCSE 2020</i>,
    edited by Regina Bernhaupt et al., vol. 12481, Springer, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-64266-2_14">10.1007/978-3-030-64266-2_14</a>.'
  short: 'S. Gottschalk, E. Yigitbas, E. Schmidt, G. Engels, in: R. Bernhaupt, C.
    Ardito, S. Sauer (Eds.), Human-Centered Software Engineering. HCSE 2020, Springer,
    Cham, 2020.'
conference:
  end_date: 2020-12-02
  location: Eindhoven
  name: 8th International Working Conference on Human-Centered Software Engineering
    (HCSE'20)
  start_date: 2020-11-30
date_created: 2020-09-21T17:01:11Z
date_updated: 2022-01-06T06:54:07Z
ddc:
- '000'
department:
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-030-64266-2_14
editor:
- first_name: Regina
  full_name: Bernhaupt, Regina
  last_name: Bernhaupt
- first_name: Carmelo
  full_name: Ardito, Carmelo
  last_name: Ardito
- first_name: Stefan
  full_name: Sauer, Stefan
  last_name: Sauer
file:
- access_level: open_access
  content_type: application/pdf
  creator: sego
  date_created: 2020-11-30T08:39:18Z
  date_updated: 2020-11-30T08:39:18Z
  file_id: '20542'
  file_name: HCSE20_demo.pdf
  file_size: 3913885
  relation: main_file
file_date_updated: 2020-11-30T08:39:18Z
has_accepted_license: '1'
intvolume: '     12481'
keyword:
- Product Configuration
- Augmented Reality
- Model-based
- Tool Support
language:
- iso: eng
oa: '1'
place: Cham
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
publication: Human-Centered Software Engineering. HCSE 2020
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'ProConAR: A Tool Support for Model-based AR Product Configuration'
type: conference
user_id: '47208'
volume: 12481
year: '2020'
...
---
_id: '19607'
abstract:
- lang: eng
  text: "Modern services consist of modular, interconnected\r\ncomponents, e.g., microservices
    forming a service mesh. To\r\ndynamically adjust to ever-changing service demands,
    service\r\ncomponents have to be instantiated on nodes across the network.\r\nIncoming
    flows requesting a service then need to be routed\r\nthrough the deployed instances
    while considering node and link\r\ncapacities. Ultimately, the goal is to maximize
    the successfully\r\nserved flows and Quality of Service (QoS) through online service\r\ncoordination.
    Current approaches for service coordination are\r\nusually centralized, assuming
    up-to-date global knowledge and\r\nmaking global decisions for all nodes in the
    network. Such global\r\nknowledge and centralized decisions are not realistic
    in practical\r\nlarge-scale networks.\r\n\r\nTo solve this problem, we propose
    two algorithms for fully\r\ndistributed service coordination. The proposed algorithms
    can be\r\nexecuted individually at each node in parallel and require only\r\nvery
    limited global knowledge. We compare and evaluate both\r\nalgorithms with a state-of-the-art
    centralized approach in extensive\r\nsimulations on a large-scale, real-world
    network topology.\r\nOur results indicate that the two algorithms can compete
    with\r\ncentralized approaches in terms of solution quality but require\r\nless
    global knowledge and are magnitudes faster (more than\r\n100x)."
author:
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
- first_name: Lars Dietrich
  full_name: Klenner, Lars Dietrich
  last_name: Klenner
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Schneider SB, Klenner LD, Karl H. Every Node for Itself: Fully Distributed
    Service Coordination. In: <i>IEEE International Conference on Network and Service
    Management (CNSM)</i>. IEEE; 2020.'
  apa: 'Schneider, S. B., Klenner, L. D., &#38; Karl, H. (2020). Every Node for Itself:
    Fully Distributed Service Coordination. In <i>IEEE International Conference on
    Network and Service Management (CNSM)</i>. IEEE.'
  bibtex: '@inproceedings{Schneider_Klenner_Karl_2020, title={Every Node for Itself:
    Fully Distributed Service Coordination}, booktitle={IEEE International Conference
    on Network and Service Management (CNSM)}, publisher={IEEE}, author={Schneider,
    Stefan Balthasar and Klenner, Lars Dietrich and Karl, Holger}, year={2020} }'
  chicago: 'Schneider, Stefan Balthasar, Lars Dietrich Klenner, and Holger Karl. “Every
    Node for Itself: Fully Distributed Service Coordination.” In <i>IEEE International
    Conference on Network and Service Management (CNSM)</i>. IEEE, 2020.'
  ieee: 'S. B. Schneider, L. D. Klenner, and H. Karl, “Every Node for Itself: Fully
    Distributed Service Coordination,” in <i>IEEE International Conference on Network
    and Service Management (CNSM)</i>, 2020.'
  mla: 'Schneider, Stefan Balthasar, et al. “Every Node for Itself: Fully Distributed
    Service Coordination.” <i>IEEE International Conference on Network and Service
    Management (CNSM)</i>, IEEE, 2020.'
  short: 'S.B. Schneider, L.D. Klenner, H. Karl, in: IEEE International Conference
    on Network and Service Management (CNSM), IEEE, 2020.'
date_created: 2020-09-22T06:23:40Z
date_updated: 2022-01-06T06:54:08Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: stschn
  date_created: 2020-09-22T06:25:57Z
  date_updated: 2020-09-22T06:36:25Z
  file_id: '19608'
  file_name: ris_with_copyright.pdf
  file_size: 500948
  relation: main_file
file_date_updated: 2020-09-22T06:36:25Z
has_accepted_license: '1'
keyword:
- distributed management
- service coordination
- network coordination
- nfv
- softwarization
- orchestration
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: IEEE International Conference on Network and Service Management (CNSM)
publisher: IEEE
status: public
title: 'Every Node for Itself: Fully Distributed Service Coordination'
type: conference
user_id: '35343'
year: '2020'
...
---
_id: '19609'
abstract:
- lang: eng
  text: "Modern services comprise interconnected components,\r\ne.g., microservices
    in a service mesh, that can scale and\r\nrun on multiple nodes across the network
    on demand. To process\r\nincoming traffic, service components have to be instantiated
    and\r\ntraffic assigned to these instances, taking capacities and changing\r\ndemands
    into account. This challenge is usually solved with\r\ncustom approaches designed
    by experts. While this typically\r\nworks well for the considered scenario, the
    models often rely\r\non unrealistic assumptions or on knowledge that is not available\r\nin
    practice (e.g., a priori knowledge).\r\n\r\nWe propose a novel deep reinforcement
    learning approach that\r\nlearns how to best coordinate services and is geared
    towards\r\nrealistic assumptions. It interacts with the network and relies on\r\navailable,
    possibly delayed monitoring information. Rather than\r\ndefining a complex model
    or an algorithm how to achieve an\r\nobjective, our model-free approach adapts
    to various objectives\r\nand traffic patterns. An agent is trained offline without
    expert\r\nknowledge and then applied online with minimal overhead. Compared\r\nto
    a state-of-the-art heuristic, it significantly improves flow\r\nthroughput and
    overall network utility on real-world network\r\ntopologies and traffic traces.
    It also learns to optimize different\r\nobjectives, generalizes to scenarios with
    unseen, stochastic traffic\r\npatterns, and scales to large real-world networks."
author:
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
- 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: Ramin
  full_name: Khalili, Ramin
  last_name: Khalili
- first_name: Artur
  full_name: Hecker, Artur
  last_name: Hecker
citation:
  ama: 'Schneider SB, Manzoor A, Qarawlus H, et al. Self-Driving Network and Service
    Coordination Using Deep Reinforcement Learning. In: <i>IEEE International Conference
    on Network and Service Management (CNSM)</i>. IEEE; 2020.'
  apa: Schneider, S. B., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., Khalili,
    R., &#38; Hecker, A. (2020). Self-Driving Network and Service Coordination Using
    Deep Reinforcement Learning. In <i>IEEE International Conference on Network and
    Service Management (CNSM)</i>. IEEE.
  bibtex: '@inproceedings{Schneider_Manzoor_Qarawlus_Schellenberg_Karl_Khalili_Hecker_2020,
    title={Self-Driving Network and Service Coordination Using Deep Reinforcement
    Learning}, booktitle={IEEE International Conference on Network and Service Management
    (CNSM)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Manzoor, Adnan
    and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Khalili, Ramin
    and Hecker, Artur}, year={2020} }'
  chicago: Schneider, Stefan Balthasar, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg,
    Holger Karl, Ramin Khalili, and Artur Hecker. “Self-Driving Network and Service
    Coordination Using Deep Reinforcement Learning.” In <i>IEEE International Conference
    on Network and Service Management (CNSM)</i>. IEEE, 2020.
  ieee: S. B. Schneider <i>et al.</i>, “Self-Driving Network and Service Coordination
    Using Deep Reinforcement Learning,” in <i>IEEE International Conference on Network
    and Service Management (CNSM)</i>, 2020.
  mla: Schneider, Stefan Balthasar, et al. “Self-Driving Network and Service Coordination
    Using Deep Reinforcement Learning.” <i>IEEE International Conference on Network
    and Service Management (CNSM)</i>, IEEE, 2020.
  short: 'S.B. Schneider, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, R. Khalili,
    A. Hecker, in: IEEE International Conference on Network and Service Management
    (CNSM), IEEE, 2020.'
date_created: 2020-09-22T06:28:22Z
date_updated: 2022-01-06T06:54:08Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: stschn
  date_created: 2020-09-22T06:29:16Z
  date_updated: 2020-09-22T06:36:00Z
  file_id: '19610'
  file_name: ris_with_copyright.pdf
  file_size: 642999
  relation: main_file
file_date_updated: 2020-09-22T06:36:00Z
has_accepted_license: '1'
keyword:
- self-driving networks
- self-learning
- network coordination
- service coordination
- reinforcement learning
- deep learning
- nfv
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: IEEE International Conference on Network and Service Management (CNSM)
publisher: IEEE
status: public
title: Self-Driving Network and Service Coordination Using Deep Reinforcement Learning
type: conference
user_id: '35343'
year: '2020'
...
---
_id: '19632'
author:
- first_name: Ivan
  full_name: Jovanovikj, Ivan
  id: '39187'
  last_name: Jovanovikj
  orcid: https://orcid.org/0000-0002-1838-794X
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Stefan
  full_name: Sauer, Stefan
  id: '447'
  last_name: Sauer
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Jovanovikj I, Yigitbas E, Sauer S, Engels G. Augmented and Virtual Reality
    Object Repository for Rapid Prototyping . In: <i>Proceedings of the 8th International
    Working Conference on Human-Centered Software Engineering (HCSE’20)</i>. Springer;
    2020:216-224.'
  apa: Jovanovikj, I., Yigitbas, E., Sauer, S., &#38; Engels, G. (2020). Augmented
    and Virtual Reality Object Repository for Rapid Prototyping . In <i>Proceedings
    of the 8th International Working Conference on Human-Centered Software Engineering
    (HCSE’20)</i> (pp. 216–224). Springer.
  bibtex: '@inproceedings{Jovanovikj_Yigitbas_Sauer_Engels_2020, title={Augmented
    and Virtual Reality Object Repository for Rapid Prototyping }, booktitle={Proceedings
    of the 8th International Working Conference on Human-Centered Software Engineering
    (HCSE’20)}, publisher={Springer}, author={Jovanovikj, Ivan and Yigitbas, Enes
    and Sauer, Stefan and Engels, Gregor}, year={2020}, pages={216–224} }'
  chicago: Jovanovikj, Ivan, Enes Yigitbas, Stefan Sauer, and Gregor Engels. “Augmented
    and Virtual Reality Object Repository for Rapid Prototyping .” In <i>Proceedings
    of the 8th International Working Conference on Human-Centered Software Engineering
    (HCSE’20)</i>, 216–24. Springer, 2020.
  ieee: I. Jovanovikj, E. Yigitbas, S. Sauer, and G. Engels, “Augmented and Virtual
    Reality Object Repository for Rapid Prototyping ,” in <i>Proceedings of the 8th
    International Working Conference on Human-Centered Software Engineering (HCSE’20)</i>,
    2020, pp. 216–224.
  mla: Jovanovikj, Ivan, et al. “Augmented and Virtual Reality Object Repository for
    Rapid Prototyping .” <i>Proceedings of the 8th International Working Conference
    on Human-Centered Software Engineering (HCSE’20)</i>, Springer, 2020, pp. 216–24.
  short: 'I. Jovanovikj, E. Yigitbas, S. Sauer, G. Engels, in: Proceedings of the
    8th International Working Conference on Human-Centered Software Engineering (HCSE’20),
    Springer, 2020, pp. 216–224.'
date_created: 2020-09-22T12:44:51Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '66'
- _id: '534'
language:
- iso: eng
page: 216-224
publication: Proceedings of the 8th International Working Conference on Human-Centered
  Software Engineering (HCSE'20)
publisher: Springer
status: public
title: 'Augmented and Virtual Reality Object Repository for Rapid Prototyping '
type: conference
user_id: '8447'
year: '2020'
...
