---
_id: '27058'
author:
- first_name: Carsten
  full_name: Wiecher, Carsten
  last_name: Wiecher
- first_name: Jannik
  full_name: Fischbach, Jannik
  last_name: Fischbach
- first_name: Joel
  full_name: Greenyer, Joel
  last_name: Greenyer
- first_name: Andreas
  full_name: Vogelsang, Andreas
  last_name: Vogelsang
- first_name: Carsten
  full_name: Wolff, Carsten
  last_name: Wolff
- first_name: Roman
  full_name: Dumitrescu, Roman
  id: '16190'
  last_name: Dumitrescu
citation:
  ama: 'Wiecher C, Fischbach J, Greenyer J, Vogelsang A, Wolff C, Dumitrescu R. Integrated
    and Iterative Requirements Analysis and Test Specification: A Case Study at Kostal.
    <i>arXiv preprint</i>. 2021.'
  apa: 'Wiecher, C., Fischbach, J., Greenyer, J., Vogelsang, A., Wolff, C., &#38;
    Dumitrescu, R. (2021). Integrated and Iterative Requirements Analysis and Test
    Specification: A Case Study at Kostal. <i>ArXiv Preprint</i>.'
  bibtex: '@article{Wiecher_Fischbach_Greenyer_Vogelsang_Wolff_Dumitrescu_2021, title={Integrated
    and Iterative Requirements Analysis and Test Specification: A Case Study at Kostal},
    journal={arXiv preprint}, author={Wiecher, Carsten and Fischbach, Jannik and Greenyer,
    Joel and Vogelsang, Andreas and Wolff, Carsten and Dumitrescu, Roman}, year={2021}
    }'
  chicago: 'Wiecher, Carsten, Jannik Fischbach, Joel Greenyer, Andreas Vogelsang,
    Carsten Wolff, and Roman Dumitrescu. “Integrated and Iterative Requirements Analysis
    and Test Specification: A Case Study at Kostal.” <i>ArXiv Preprint</i>, 2021.'
  ieee: 'C. Wiecher, J. Fischbach, J. Greenyer, A. Vogelsang, C. Wolff, and R. Dumitrescu,
    “Integrated and Iterative Requirements Analysis and Test Specification: A Case
    Study at Kostal,” <i>arXiv preprint</i>, 2021.'
  mla: 'Wiecher, Carsten, et al. “Integrated and Iterative Requirements Analysis and
    Test Specification: A Case Study at Kostal.” <i>ArXiv Preprint</i>, 2021.'
  short: C. Wiecher, J. Fischbach, J. Greenyer, A. Vogelsang, C. Wolff, R. Dumitrescu,
    ArXiv Preprint (2021).
date_created: 2021-11-02T14:54:31Z
date_updated: 2022-10-13T11:01:39Z
department:
- _id: '563'
language:
- iso: eng
publication: arXiv preprint
publication_date: 2021-07-12
publication_status: published
status: public
title: 'Integrated and Iterative Requirements Analysis and Test Specification: A Case
  Study at Kostal'
type: newspaper_article
user_id: '15782'
year: '2021'
...
---
_id: '29292'
author:
- first_name: Robert
  full_name: Feldhans, Robert
  last_name: Feldhans
- first_name: Adrian
  full_name: Wilke, Adrian
  id: '9101'
  last_name: Wilke
  orcid: 0000-0002-6575-807X
- first_name: Stefan
  full_name: Heindorf, Stefan
  id: '11871'
  last_name: Heindorf
  orcid: 0000-0002-4525-6865
- first_name: Mohammad Hossein
  full_name: Shaker, Mohammad Hossein
  last_name: Shaker
- first_name: Barbara
  full_name: Hammer, Barbara
  last_name: Hammer
- first_name: Axel-Cyrille
  full_name: Ngonga Ngomo, Axel-Cyrille
  id: '65716'
  last_name: Ngonga Ngomo
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
citation:
  ama: 'Feldhans R, Wilke A, Heindorf S, et al. Drift Detection in Text Data with
    Document Embeddings. In: <i>Intelligent Data Engineering and Automated Learning
    – IDEAL 2021</i>. Springer International Publishing; 2021. doi:<a href="https://doi.org/10.1007/978-3-030-91608-4_11">10.1007/978-3-030-91608-4_11</a>'
  apa: Feldhans, R., Wilke, A., Heindorf, S., Shaker, M. H., Hammer, B., Ngonga Ngomo,
    A.-C., &#38; Hüllermeier, E. (2021). Drift Detection in Text Data with Document
    Embeddings. In <i>Intelligent Data Engineering and Automated Learning – IDEAL
    2021</i>. Springer International Publishing. <a href="https://doi.org/10.1007/978-3-030-91608-4_11">https://doi.org/10.1007/978-3-030-91608-4_11</a>
  bibtex: '@inbook{Feldhans_Wilke_Heindorf_Shaker_Hammer_Ngonga Ngomo_Hüllermeier_2021,
    place={Cham}, title={Drift Detection in Text Data with Document Embeddings}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-91608-4_11">10.1007/978-3-030-91608-4_11</a>},
    booktitle={Intelligent Data Engineering and Automated Learning – IDEAL 2021},
    publisher={Springer International Publishing}, author={Feldhans, Robert and Wilke,
    Adrian and Heindorf, Stefan and Shaker, Mohammad Hossein and Hammer, Barbara and
    Ngonga Ngomo, Axel-Cyrille and Hüllermeier, Eyke}, year={2021} }'
  chicago: 'Feldhans, Robert, Adrian Wilke, Stefan Heindorf, Mohammad Hossein Shaker,
    Barbara Hammer, Axel-Cyrille Ngonga Ngomo, and Eyke Hüllermeier. “Drift Detection
    in Text Data with Document Embeddings.” In <i>Intelligent Data Engineering and
    Automated Learning – IDEAL 2021</i>. Cham: Springer International Publishing,
    2021. <a href="https://doi.org/10.1007/978-3-030-91608-4_11">https://doi.org/10.1007/978-3-030-91608-4_11</a>.'
  ieee: 'R. Feldhans <i>et al.</i>, “Drift Detection in Text Data with Document Embeddings,”
    in <i>Intelligent Data Engineering and Automated Learning – IDEAL 2021</i>, Cham:
    Springer International Publishing, 2021.'
  mla: Feldhans, Robert, et al. “Drift Detection in Text Data with Document Embeddings.”
    <i>Intelligent Data Engineering and Automated Learning – IDEAL 2021</i>, Springer
    International Publishing, 2021, doi:<a href="https://doi.org/10.1007/978-3-030-91608-4_11">10.1007/978-3-030-91608-4_11</a>.
  short: 'R. Feldhans, A. Wilke, S. Heindorf, M.H. Shaker, B. Hammer, A.-C. Ngonga
    Ngomo, E. Hüllermeier, in: Intelligent Data Engineering and Automated Learning
    – IDEAL 2021, Springer International Publishing, Cham, 2021.'
date_created: 2022-01-12T10:27:23Z
date_updated: 2022-10-15T19:54:20Z
department:
- _id: '574'
doi: 10.1007/978-3-030-91608-4_11
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://papers.dice-research.org/2021/IDEAL2021_DriftDetectionEmbeddings/Drift-Detection-in-Text-Data-with-Document-Embeddings-public.pdf
oa: '1'
place: Cham
publication: Intelligent Data Engineering and Automated Learning – IDEAL 2021
publication_identifier:
  isbn:
  - '9783030916077'
  - '9783030916084'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer International Publishing
related_material:
  link:
  - relation: confirmation
    url: https://link.springer.com/chapter/10.1007/978-3-030-91608-4_11
status: public
title: Drift Detection in Text Data with Document Embeddings
type: book_chapter
user_id: '11871'
year: '2021'
...
---
_id: '29287'
abstract:
- lang: eng
  text: "Knowledge graph embedding research has mainly focused on the two smallest\r\nnormed
    division algebras, $\\mathbb{R}$ and $\\mathbb{C}$. Recent results suggest\r\nthat
    trilinear products of quaternion-valued embeddings can be a more effective\r\nmeans
    to tackle link prediction. In addition, models based on convolutions on\r\nreal-valued
    embeddings often yield state-of-the-art results for link\r\nprediction. In this
    paper, we investigate a composition of convolution\r\noperations with hypercomplex
    multiplications. We propose the four approaches\r\nQMult, OMult, ConvQ and ConvO
    to tackle the link prediction problem. QMult and\r\nOMult can be considered as
    quaternion and octonion extensions of previous\r\nstate-of-the-art approaches,
    including DistMult and ComplEx. ConvQ and ConvO\r\nbuild upon QMult and OMult
    by including convolution operations in a way\r\ninspired by the residual learning
    framework. We evaluated our approaches on\r\nseven link prediction datasets including
    WN18RR, FB15K-237 and YAGO3-10.\r\nExperimental results suggest that the benefits
    of learning hypercomplex-valued\r\nvector representations become more apparent
    as the size and complexity of the\r\nknowledge graph grows. ConvO outperforms
    state-of-the-art approaches on\r\nFB15K-237 in MRR, Hit@1 and Hit@3, while QMult,
    OMult, ConvQ and ConvO\r\noutperform state-of-the-approaches on YAGO3-10 in all
    metrics. Results also\r\nsuggest that link prediction performances can be further
    improved via\r\nprediction averaging. To foster reproducible research, we provide
    an\r\nopen-source implementation of approaches, including training and evaluation\r\nscripts
    as well as pretrained models."
author:
- first_name: Caglar
  full_name: Demir, Caglar
  id: '43817'
  last_name: Demir
- first_name: Diego
  full_name: Moussallem, Diego
  id: '71635'
  last_name: Moussallem
- first_name: Stefan
  full_name: Heindorf, Stefan
  id: '11871'
  last_name: Heindorf
  orcid: 0000-0002-4525-6865
- first_name: Axel-Cyrille
  full_name: Ngonga Ngomo, Axel-Cyrille
  id: '65716'
  last_name: Ngonga Ngomo
citation:
  ama: 'Demir C, Moussallem D, Heindorf S, Ngonga Ngomo A-C. Convolutional Hypercomplex
    Embeddings for Link Prediction. In: <i>The 13th Asian Conference on Machine Learning,
    ACML 2021</i>. ; 2021.'
  apa: Demir, C., Moussallem, D., Heindorf, S., &#38; Ngonga Ngomo, A.-C. (2021).
    Convolutional Hypercomplex Embeddings for Link Prediction. <i>The 13th Asian Conference
    on Machine Learning, ACML 2021</i>.
  bibtex: '@inproceedings{Demir_Moussallem_Heindorf_Ngonga Ngomo_2021, title={Convolutional
    Hypercomplex Embeddings for Link Prediction}, booktitle={The 13th Asian Conference
    on Machine Learning, ACML 2021}, author={Demir, Caglar and Moussallem, Diego and
    Heindorf, Stefan and Ngonga Ngomo, Axel-Cyrille}, year={2021} }'
  chicago: Demir, Caglar, Diego Moussallem, Stefan Heindorf, and Axel-Cyrille Ngonga
    Ngomo. “Convolutional Hypercomplex Embeddings for Link Prediction.” In <i>The
    13th Asian Conference on Machine Learning, ACML 2021</i>, 2021.
  ieee: C. Demir, D. Moussallem, S. Heindorf, and A.-C. Ngonga Ngomo, “Convolutional
    Hypercomplex Embeddings for Link Prediction,” 2021.
  mla: Demir, Caglar, et al. “Convolutional Hypercomplex Embeddings for Link Prediction.”
    <i>The 13th Asian Conference on Machine Learning, ACML 2021</i>, 2021.
  short: 'C. Demir, D. Moussallem, S. Heindorf, A.-C. Ngonga Ngomo, in: The 13th Asian
    Conference on Machine Learning, ACML 2021, 2021.'
date_created: 2022-01-12T10:21:10Z
date_updated: 2022-10-17T15:06:40Z
department:
- _id: '574'
external_id:
  arxiv:
  - '2106.15230'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://papers.dice-research.org/2021/ACML2021_HyperConv/public.pdf
oa: '1'
publication: The 13th Asian Conference on Machine Learning, ACML 2021
status: public
title: Convolutional Hypercomplex Embeddings for Link Prediction
type: conference
user_id: '11871'
year: '2021'
...
---
_id: '29294'
author:
- first_name: Tobias
  full_name: Nickchen, Tobias
  id: '27340'
  last_name: Nickchen
  orcid: 0000-0001-8958-9330
- first_name: Stefan
  full_name: Heindorf, Stefan
  id: '11871'
  last_name: Heindorf
  orcid: 0000-0002-4525-6865
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Nickchen T, Heindorf S, Engels G. Generating Physically Sound Training Data
    for Image Recognition of Additively Manufactured Parts. In: <i>2021 IEEE Winter
    Conference on Applications of Computer Vision (WACV)</i>. IEEE; 2021. doi:<a href="https://doi.org/10.1109/wacv48630.2021.00204">10.1109/wacv48630.2021.00204</a>'
  apa: Nickchen, T., Heindorf, S., &#38; Engels, G. (2021). Generating Physically
    Sound Training Data for Image Recognition of Additively Manufactured Parts. <i>2021
    IEEE Winter Conference on Applications of Computer Vision (WACV)</i>. <a href="https://doi.org/10.1109/wacv48630.2021.00204">https://doi.org/10.1109/wacv48630.2021.00204</a>
  bibtex: '@inproceedings{Nickchen_Heindorf_Engels_2021, title={Generating Physically
    Sound Training Data for Image Recognition of Additively Manufactured Parts}, DOI={<a
    href="https://doi.org/10.1109/wacv48630.2021.00204">10.1109/wacv48630.2021.00204</a>},
    booktitle={2021 IEEE Winter Conference on Applications of Computer Vision (WACV)},
    publisher={IEEE}, author={Nickchen, Tobias and Heindorf, Stefan and Engels, Gregor},
    year={2021} }'
  chicago: Nickchen, Tobias, Stefan Heindorf, and Gregor Engels. “Generating Physically
    Sound Training Data for Image Recognition of Additively Manufactured Parts.” In
    <i>2021 IEEE Winter Conference on Applications of Computer Vision (WACV)</i>.
    IEEE, 2021. <a href="https://doi.org/10.1109/wacv48630.2021.00204">https://doi.org/10.1109/wacv48630.2021.00204</a>.
  ieee: 'T. Nickchen, S. Heindorf, and G. Engels, “Generating Physically Sound Training
    Data for Image Recognition of Additively Manufactured Parts,” 2021, doi: <a href="https://doi.org/10.1109/wacv48630.2021.00204">10.1109/wacv48630.2021.00204</a>.'
  mla: Nickchen, Tobias, et al. “Generating Physically Sound Training Data for Image
    Recognition of Additively Manufactured Parts.” <i>2021 IEEE Winter Conference
    on Applications of Computer Vision (WACV)</i>, IEEE, 2021, doi:<a href="https://doi.org/10.1109/wacv48630.2021.00204">10.1109/wacv48630.2021.00204</a>.
  short: 'T. Nickchen, S. Heindorf, G. Engels, in: 2021 IEEE Winter Conference on
    Applications of Computer Vision (WACV), IEEE, 2021.'
date_created: 2022-01-12T10:31:42Z
date_updated: 2022-10-17T15:07:38Z
department:
- _id: '66'
- _id: '574'
doi: 10.1109/wacv48630.2021.00204
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://openaccess.thecvf.com/content/WACV2021/papers/Nickchen_Generating_Physically_Sound_Training_Data_for_Image_Recognition_of_Additively_WACV_2021_paper.pdf
oa: '1'
project:
- _id: '52'
  name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: 2021 IEEE Winter Conference on Applications of Computer Vision (WACV)
publication_status: published
publisher: IEEE
status: public
title: Generating Physically Sound Training Data for Image Recognition of Additively
  Manufactured Parts
type: conference
user_id: '11871'
year: '2021'
...
---
_id: '26407'
author:
- first_name: Goran
  full_name: Piskachev, Goran
  id: '41936'
  last_name: Piskachev
  orcid: 0000-0003-4424-5838
- first_name: Ranjith
  full_name: Krishnamurthy, Ranjith
  last_name: Krishnamurthy
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
citation:
  ama: 'Piskachev G, Krishnamurthy R, Bodden E. SecuCheck: Engineering configurable
    taint analysis for software developers. In: <i>2021 IEEE 21st International Working
    Conference on Source Code Analysis and Manipulation (SCAM)</i>. ; 2021.'
  apa: 'Piskachev, G., Krishnamurthy, R., &#38; Bodden, E. (2021). SecuCheck: Engineering
    configurable taint analysis for software developers. <i>2021 IEEE 21st International
    Working Conference on Source Code Analysis and Manipulation (SCAM)</i>.'
  bibtex: '@inproceedings{Piskachev_Krishnamurthy_Bodden_2021, title={SecuCheck: Engineering
    configurable taint analysis for software developers}, booktitle={2021 IEEE 21st
    International Working Conference on Source Code Analysis and Manipulation (SCAM)},
    author={Piskachev, Goran and Krishnamurthy, Ranjith and Bodden, Eric}, year={2021}
    }'
  chicago: 'Piskachev, Goran, Ranjith Krishnamurthy, and Eric Bodden. “SecuCheck:
    Engineering Configurable Taint Analysis for Software Developers.” In <i>2021 IEEE
    21st International Working Conference on Source Code Analysis and Manipulation
    (SCAM)</i>, 2021.'
  ieee: 'G. Piskachev, R. Krishnamurthy, and E. Bodden, “SecuCheck: Engineering configurable
    taint analysis for software developers,” 2021.'
  mla: 'Piskachev, Goran, et al. “SecuCheck: Engineering Configurable Taint Analysis
    for Software Developers.” <i>2021 IEEE 21st International Working Conference on
    Source Code Analysis and Manipulation (SCAM)</i>, 2021.'
  short: 'G. Piskachev, R. Krishnamurthy, E. Bodden, in: 2021 IEEE 21st International
    Working Conference on Source Code Analysis and Manipulation (SCAM), 2021.'
date_created: 2021-10-18T12:53:15Z
date_updated: 2022-10-20T12:44:31Z
department:
- _id: '76'
- _id: '662'
language:
- iso: eng
publication: 2021 IEEE 21st International Working Conference on Source Code Analysis
  and Manipulation (SCAM)
status: public
title: 'SecuCheck: Engineering configurable taint analysis for software developers'
type: conference
user_id: '15249'
year: '2021'
...
---
_id: '22463'
author:
- first_name: Linghui
  full_name: Luo, Linghui
  last_name: Luo
- first_name: Martin
  full_name: Schäf, Martin
  last_name: Schäf
- first_name: Daniel
  full_name: Sanchez, Daniel
  last_name: Sanchez
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
citation:
  ama: 'Luo L, Schäf M, Sanchez D, Bodden E. IDE Support for Cloud-Based Static Analyses.
    In: <i>Proceedings of the 29th ACM Joint Meeting on European Software Engineering
    Conference and Symposium on the Foundations of Software Engineering</i>. ; 2021.'
  apa: Luo, L., Schäf, M., Sanchez, D., &#38; Bodden, E. (2021). IDE Support for Cloud-Based
    Static Analyses. <i>Proceedings of the 29th ACM Joint Meeting on European Software
    Engineering Conference and Symposium on the Foundations of Software Engineering</i>.
  bibtex: '@inproceedings{Luo_Schäf_Sanchez_Bodden_2021, title={IDE Support for Cloud-Based
    Static Analyses}, booktitle={Proceedings of the 29th ACM Joint Meeting on European
    Software Engineering Conference and Symposium on the Foundations of Software Engineering},
    author={Luo, Linghui and Schäf, Martin and Sanchez, Daniel and Bodden, Eric},
    year={2021} }'
  chicago: Luo, Linghui, Martin Schäf, Daniel Sanchez, and Eric Bodden. “IDE Support
    for Cloud-Based Static Analyses.” In <i>Proceedings of the 29th ACM Joint Meeting
    on European Software Engineering Conference and Symposium on the Foundations of
    Software Engineering</i>, 2021.
  ieee: L. Luo, M. Schäf, D. Sanchez, and E. Bodden, “IDE Support for Cloud-Based
    Static Analyses,” 2021.
  mla: Luo, Linghui, et al. “IDE Support for Cloud-Based Static Analyses.” <i>Proceedings
    of the 29th ACM Joint Meeting on European Software Engineering Conference and
    Symposium on the Foundations of Software Engineering</i>, 2021.
  short: 'L. Luo, M. Schäf, D. Sanchez, E. Bodden, in: Proceedings of the 29th ACM
    Joint Meeting on European Software Engineering Conference and Symposium on the
    Foundations of Software Engineering, 2021.'
date_created: 2021-06-17T10:18:05Z
date_updated: 2022-10-20T13:11:45Z
department:
- _id: '76'
language:
- iso: eng
publication: Proceedings of the 29th ACM Joint Meeting on European Software Engineering
  Conference and Symposium on the Foundations of Software Engineering
status: public
title: IDE Support for Cloud-Based Static Analyses
type: conference
user_id: '15249'
year: '2021'
...
---
_id: '33840'
author:
- first_name: Kadiray
  full_name: Karakaya, Kadiray
  id: '70410'
  last_name: Karakaya
  orcid: https://orcid.org/0000-0001-9266-2084
- first_name: Eric
  full_name: Bodden, Eric
  id: '59256'
  last_name: Bodden
  orcid: 0000-0003-3470-3647
citation:
  ama: 'Karakaya K, Bodden E. SootFX: A Static Code Feature Extraction Tool for Java
    and Android. In: <i>2021 IEEE 21st International Working Conference on Source
    Code Analysis and Manipulation (SCAM)</i>. ; 2021:181–186.'
  apa: 'Karakaya, K., &#38; Bodden, E. (2021). SootFX: A Static Code Feature Extraction
    Tool for Java and Android. <i>2021 IEEE 21st International Working Conference
    on Source Code Analysis and Manipulation (SCAM)</i>, 181–186.'
  bibtex: '@inproceedings{Karakaya_Bodden_2021, title={SootFX: A Static Code Feature
    Extraction Tool for Java and Android}, booktitle={2021 IEEE 21st International
    Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Karakaya,
    Kadiray and Bodden, Eric}, year={2021}, pages={181–186} }'
  chicago: 'Karakaya, Kadiray, and Eric Bodden. “SootFX: A Static Code Feature Extraction
    Tool for Java and Android.” In <i>2021 IEEE 21st International Working Conference
    on Source Code Analysis and Manipulation (SCAM)</i>, 181–186, 2021.'
  ieee: 'K. Karakaya and E. Bodden, “SootFX: A Static Code Feature Extraction Tool
    for Java and Android,” in <i>2021 IEEE 21st International Working Conference on
    Source Code Analysis and Manipulation (SCAM)</i>, 2021, pp. 181–186.'
  mla: 'Karakaya, Kadiray, and Eric Bodden. “SootFX: A Static Code Feature Extraction
    Tool for Java and Android.” <i>2021 IEEE 21st International Working Conference
    on Source Code Analysis and Manipulation (SCAM)</i>, 2021, pp. 181–186.'
  short: 'K. Karakaya, E. Bodden, in: 2021 IEEE 21st International Working Conference
    on Source Code Analysis and Manipulation (SCAM), 2021, pp. 181–186.'
date_created: 2022-10-20T13:09:08Z
date_updated: 2022-10-20T13:09:23Z
department:
- _id: '76'
language:
- iso: eng
page: 181–186
publication: 2021 IEEE 21st International Working Conference on Source Code Analysis
  and Manipulation (SCAM)
status: public
title: 'SootFX: A Static Code Feature Extraction Tool for Java and Android'
type: conference
user_id: '15249'
year: '2021'
...
---
_id: '32401'
author:
- first_name: Jan Niklas
  full_name: Siemer, Jan Niklas
  last_name: Siemer
citation:
  ama: Siemer JN. <i>Lattice Reductions and Their Applications to Cryptographic Systems</i>.;
    2021.
  apa: Siemer, J. N. (2021). <i>Lattice reductions and their applications to cryptographic
    systems</i>.
  bibtex: '@book{Siemer_2021, title={Lattice reductions and their applications to
    cryptographic systems}, author={Siemer, Jan Niklas}, year={2021} }'
  chicago: Siemer, Jan Niklas. <i>Lattice Reductions and Their Applications to Cryptographic
    Systems</i>, 2021.
  ieee: J. N. Siemer, <i>Lattice reductions and their applications to cryptographic
    systems</i>. 2021.
  mla: Siemer, Jan Niklas. <i>Lattice Reductions and Their Applications to Cryptographic
    Systems</i>. 2021.
  short: J.N. Siemer, Lattice Reductions and Their Applications to Cryptographic Systems,
    2021.
date_created: 2022-07-20T11:40:28Z
date_updated: 2023-01-10T10:49:33Z
department:
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Lattice reductions and their applications to cryptographic systems
type: bachelorsthesis
user_id: '47434'
year: '2021'
...
---
_id: '32400'
author:
- first_name: Anonymous
  full_name: Anonymous, Anonymous
  last_name: Anonymous
citation:
  ama: Anonymous A. <i>Performance Analysis of FHE Libraries</i>.; 2021.
  apa: Anonymous, A. (2021). <i>Performance Analysis of FHE Libraries</i>.
  bibtex: '@book{Anonymous_2021, title={Performance Analysis of FHE Libraries}, author={Anonymous,
    Anonymous}, year={2021} }'
  chicago: Anonymous, Anonymous. <i>Performance Analysis of FHE Libraries</i>, 2021.
  ieee: A. Anonymous, <i>Performance Analysis of FHE Libraries</i>. 2021.
  mla: Anonymous, Anonymous. <i>Performance Analysis of FHE Libraries</i>. 2021.
  short: A. Anonymous, Performance Analysis of FHE Libraries, 2021.
date_created: 2022-07-20T11:37:41Z
date_updated: 2023-01-10T11:54:39Z
department:
- _id: '64'
language:
- iso: eng
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Performance Analysis of FHE Libraries
type: mastersthesis
user_id: '47434'
year: '2021'
...
---
_id: '35889'
abstract:
- lang: eng
  text: Network and service coordination is important to provide modern services consisting
    of multiple interconnected components, e.g., in 5G, network function virtualization
    (NFV), or cloud and edge computing. In this paper, I outline my dissertation research,
    which proposes six approaches to automate such network and service coordination.
    All approaches dynamically react to the current demand and optimize coordination
    for high service quality and low costs. The approaches range from centralized
    to distributed methods and from conventional heuristic algorithms and mixed-integer
    linear programs to machine learning approaches using supervised and reinforcement
    learning. I briefly discuss their main ideas and advantages over other state-of-the-art
    approaches and compare strengths and weaknesses.
author:
- first_name: Stefan Balthasar
  full_name: Schneider, Stefan Balthasar
  id: '35343'
  last_name: Schneider
  orcid: 0000-0001-8210-4011
citation:
  ama: Schneider SB. <i>Conventional and Machine Learning Approaches for Network and
    Service Coordination</i>.; 2021.
  apa: Schneider, S. B. (2021). <i>Conventional and Machine Learning Approaches for
    Network and Service Coordination</i>.
  bibtex: '@book{Schneider_2021, title={Conventional and Machine Learning Approaches
    for Network and Service Coordination}, author={Schneider, Stefan Balthasar}, year={2021}
    }'
  chicago: Schneider, Stefan Balthasar. <i>Conventional and Machine Learning Approaches
    for Network and Service Coordination</i>, 2021.
  ieee: S. B. Schneider, <i>Conventional and Machine Learning Approaches for Network
    and Service Coordination</i>. 2021.
  mla: Schneider, Stefan Balthasar. <i>Conventional and Machine Learning Approaches
    for Network and Service Coordination</i>. 2021.
  short: S.B. Schneider, Conventional and Machine Learning Approaches for Network
    and Service Coordination, 2021.
date_created: 2023-01-10T15:08:50Z
date_updated: 2023-01-10T15:09:05Z
ddc:
- '004'
department:
- _id: '75'
file:
- access_level: open_access
  content_type: application/pdf
  creator: stschn
  date_created: 2023-01-10T15:07:03Z
  date_updated: 2023-01-10T15:07:03Z
  file_id: '35890'
  file_name: main.pdf
  file_size: 133340
  relation: main_file
file_date_updated: 2023-01-10T15:07:03Z
has_accepted_license: '1'
keyword:
- nfv
- coordination
- machine learning
- reinforcement learning
- phd
- digest
language:
- iso: eng
oa: '1'
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '16'
  name: 'SFB 901 - C4: SFB 901 - Subproject C4'
status: public
title: Conventional and Machine Learning Approaches for Network and Service Coordination
type: working_paper
user_id: '35343'
year: '2021'
...
---
_id: '46318'
abstract:
- lang: eng
  text: 'Multi-objective (MO) optimization, i.e., the simultaneous optimization of
    multiple conflicting objectives, is gaining more and more attention in various
    research areas, such as evolutionary computation, machine learning (e.g., (hyper-)parameter
    optimization), or logistics (e.g., vehicle routing). Many works in this domain
    mention the structural problem property of multimodality as a challenge from two
    classical perspectives: (1) finding all globally optimal solution sets, and (2)
    avoiding to get trapped in local optima. Interestingly, these streams seem to
    transfer many traditional concepts of single-objective (SO) optimization into
    claims, assumptions, or even terminology regarding the MO domain, but mostly neglect
    the understanding of the structural properties as well as the algorithmic search
    behavior on a problem’s landscape. However, some recent works counteract this
    trend, by investigating the fundamentals and characteristics of MO problems using
    new visualization techniques and gaining surprising insights. Using these visual
    insights, this work proposes a step towards a unified terminology to capture multimodality
    and locality in a broader way than it is usually done. This enables us to investigate
    current research activities in multimodal continuous MO optimization and to highlight
    new implications and promising research directions for the design of benchmark
    suites, the discovery of MO landscape features, the development of new MO (or
    even SO) optimization algorithms, and performance indicators. For all these topics,
    we provide a review of ideas and methods but also an outlook on future challenges,
    research potential and perspectives that result from recent developments.'
author:
- first_name: Christian
  full_name: Grimme, Christian
  last_name: Grimme
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Pelin
  full_name: Aspar, Pelin
  last_name: Aspar
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
- first_name: Mike
  full_name: Preuss, Mike
  last_name: Preuss
- first_name: André H.
  full_name: Deutz, André H.
  last_name: Deutz
- first_name: Hao
  full_name: Wang, Hao
  last_name: Wang
- first_name: Michael
  full_name: Emmerich, Michael
  last_name: Emmerich
citation:
  ama: 'Grimme C, Kerschke P, Aspar P, et al. Peeking beyond peaks: Challenges and
    research potentials of continuous multimodal multi-objective optimization. <i>Computers
    &#38; Operations Research</i>. 2021;136:105489. doi:<a href="https://doi.org/10.1016/j.cor.2021.105489">https://doi.org/10.1016/j.cor.2021.105489</a>'
  apa: 'Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A.
    H., Wang, H., &#38; Emmerich, M. (2021). Peeking beyond peaks: Challenges and
    research potentials of continuous multimodal multi-objective optimization. <i>Computers
    &#38; Operations Research</i>, <i>136</i>, 105489. <a href="https://doi.org/10.1016/j.cor.2021.105489">https://doi.org/10.1016/j.cor.2021.105489</a>'
  bibtex: '@article{Grimme_Kerschke_Aspar_Trautmann_Preuss_Deutz_Wang_Emmerich_2021,
    title={Peeking beyond peaks: Challenges and research potentials of continuous
    multimodal multi-objective optimization}, volume={136}, DOI={<a href="https://doi.org/10.1016/j.cor.2021.105489">https://doi.org/10.1016/j.cor.2021.105489</a>},
    journal={Computers &#38; Operations Research}, author={Grimme, Christian and Kerschke,
    Pascal and Aspar, Pelin and Trautmann, Heike and Preuss, Mike and Deutz, André
    H. and Wang, Hao and Emmerich, Michael}, year={2021}, pages={105489} }'
  chicago: 'Grimme, Christian, Pascal Kerschke, Pelin Aspar, Heike Trautmann, Mike
    Preuss, André H. Deutz, Hao Wang, and Michael Emmerich. “Peeking beyond Peaks:
    Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.”
    <i>Computers &#38; Operations Research</i> 136 (2021): 105489. <a href="https://doi.org/10.1016/j.cor.2021.105489">https://doi.org/10.1016/j.cor.2021.105489</a>.'
  ieee: 'C. Grimme <i>et al.</i>, “Peeking beyond peaks: Challenges and research potentials
    of continuous multimodal multi-objective optimization,” <i>Computers &#38; Operations
    Research</i>, vol. 136, p. 105489, 2021, doi: <a href="https://doi.org/10.1016/j.cor.2021.105489">https://doi.org/10.1016/j.cor.2021.105489</a>.'
  mla: 'Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials
    of Continuous Multimodal Multi-Objective Optimization.” <i>Computers &#38; Operations
    Research</i>, vol. 136, 2021, p. 105489, doi:<a href="https://doi.org/10.1016/j.cor.2021.105489">https://doi.org/10.1016/j.cor.2021.105489</a>.'
  short: C. Grimme, P. Kerschke, P. Aspar, H. Trautmann, M. Preuss, A.H. Deutz, H.
    Wang, M. Emmerich, Computers &#38; Operations Research 136 (2021) 105489.
date_created: 2023-08-04T07:28:34Z
date_updated: 2023-10-16T12:58:42Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1016/j.cor.2021.105489
intvolume: '       136'
keyword:
- Multimodal optimization
- Multi-objective continuous optimization
- Landscape analysis
- Visualization
- Benchmarking
- Theory
- Algorithms
language:
- iso: eng
page: '105489'
publication: Computers & Operations Research
publication_identifier:
  issn:
  - 0305-0548
status: public
title: 'Peeking beyond peaks: Challenges and research potentials of continuous multimodal
  multi-objective optimization'
type: journal_article
user_id: '15504'
volume: 136
year: '2021'
...
---
_id: '46311'
abstract:
- lang: eng
  text: "In this work we examine the inner mechanisms of the recently developed sophisticated
    local search procedure SOMOGSA. This method solves multimodal single-objective
    continuous optimization problems by first expanding the problem with an additional
    objective (e.g., a sphere function) to the bi-objective space, and subsequently
    exploiting local structures and ridges of the resulting landscapes. Our study
    particularly focusses on the sensitivity of this multiobjectivization approach
    w.r.t. (i) the parametrization of the artificial second objective, as well as
    (ii) the position of the initial starting points in the search space.\r\n\r\nAs
    SOMOGSA is a modular framework for encapsulating local search, we integrate Gradient
    and Nelder-Mead local search (as optimizers in the respective module) and compare
    the performance of the resulting hybrid local search to their original single-objective
    counterparts. We show that the SOMOGSA framework can significantly boost local
    search by multiobjectivization. Combined with more sophisticated local search
    and metaheuristics this may help in solving highly multimodal optimization problems
    in future."
author:
- first_name: Pelin
  full_name: Aspar, Pelin
  last_name: Aspar
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
- first_name: Vera
  full_name: Steinhoff, Vera
  last_name: Steinhoff
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
- first_name: Christian
  full_name: Grimme, Christian
  last_name: Grimme
citation:
  ama: 'Aspar P, Kerschke P, Steinhoff V, Trautmann H, Grimme C. Multi^3: Optimizing
    Multimodal Single-Objective Continuous Problems in the Multi-Objective Space by
    Means of Multiobjectivization. In: et al. Ishibuchi H, ed. <i>Evolutionary Multi-Criterion
    Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen, China, March
    28–31, 2021, Proceedings</i>. Springer; 2021:311–322. doi:<a href="https://doi.org/10.1007/978-3-030-72062-9_25">10.1007/978-3-030-72062-9_25</a>'
  apa: 'Aspar, P., Kerschke, P., Steinhoff, V., Trautmann, H., &#38; Grimme, C. (2021).
    Multi^3: Optimizing Multimodal Single-Objective Continuous Problems in the Multi-Objective
    Space by Means of Multiobjectivization. In H. et al. Ishibuchi (Ed.), <i>Evolutionary
    Multi-Criterion Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen,
    China, March 28–31, 2021, Proceedings</i> (pp. 311–322). Springer. <a href="https://doi.org/10.1007/978-3-030-72062-9_25">https://doi.org/10.1007/978-3-030-72062-9_25</a>'
  bibtex: '@inproceedings{Aspar_Kerschke_Steinhoff_Trautmann_Grimme_2021, place={Heidelberg,
    Berlin}, title={Multi^3: Optimizing Multimodal Single-Objective Continuous Problems
    in the Multi-Objective Space by Means of Multiobjectivization}, DOI={<a href="https://doi.org/10.1007/978-3-030-72062-9_25">10.1007/978-3-030-72062-9_25</a>},
    booktitle={Evolutionary Multi-Criterion Optimization: 11$^th$ International Conference,
    EMO 2021, Shenzhen, China, March 28–31, 2021, Proceedings}, publisher={Springer},
    author={Aspar, Pelin and Kerschke, Pascal and Steinhoff, Vera and Trautmann, Heike
    and Grimme, Christian}, editor={et al. Ishibuchi, H.}, year={2021}, pages={311–322}
    }'
  chicago: 'Aspar, Pelin, Pascal Kerschke, Vera Steinhoff, Heike Trautmann, and Christian
    Grimme. “Multi^3: Optimizing Multimodal Single-Objective Continuous Problems in
    the Multi-Objective Space by Means of Multiobjectivization.” In <i>Evolutionary
    Multi-Criterion Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen,
    China, March 28–31, 2021, Proceedings</i>, edited by H. et al. Ishibuchi, 311–322.
    Heidelberg, Berlin: Springer, 2021. <a href="https://doi.org/10.1007/978-3-030-72062-9_25">https://doi.org/10.1007/978-3-030-72062-9_25</a>.'
  ieee: 'P. Aspar, P. Kerschke, V. Steinhoff, H. Trautmann, and C. Grimme, “Multi^3:
    Optimizing Multimodal Single-Objective Continuous Problems in the Multi-Objective
    Space by Means of Multiobjectivization,” in <i>Evolutionary Multi-Criterion Optimization:
    11$^th$ International Conference, EMO 2021, Shenzhen, China, March 28–31, 2021,
    Proceedings</i>, 2021, pp. 311–322, doi: <a href="https://doi.org/10.1007/978-3-030-72062-9_25">10.1007/978-3-030-72062-9_25</a>.'
  mla: 'Aspar, Pelin, et al. “Multi^3: Optimizing Multimodal Single-Objective Continuous
    Problems in the Multi-Objective Space by Means of Multiobjectivization.” <i>Evolutionary
    Multi-Criterion Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen,
    China, March 28–31, 2021, Proceedings</i>, edited by H. et al. Ishibuchi, Springer,
    2021, pp. 311–322, doi:<a href="https://doi.org/10.1007/978-3-030-72062-9_25">10.1007/978-3-030-72062-9_25</a>.'
  short: 'P. Aspar, P. Kerschke, V. Steinhoff, H. Trautmann, C. Grimme, in: H. et
    al. Ishibuchi (Ed.), Evolutionary Multi-Criterion Optimization: 11$^th$ International
    Conference, EMO 2021, Shenzhen, China, March 28–31, 2021, Proceedings, Springer,
    Heidelberg, Berlin, 2021, pp. 311–322.'
date_created: 2023-08-04T07:21:17Z
date_updated: 2023-10-16T12:54:29Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-030-72062-9_25
editor:
- first_name: H.
  full_name: et al. Ishibuchi, H.
  last_name: et al. Ishibuchi
language:
- iso: eng
page: 311–322
place: Heidelberg, Berlin
publication: 'Evolutionary Multi-Criterion Optimization: 11$^th$ International Conference,
  EMO 2021, Shenzhen, China, March 28–31, 2021, Proceedings'
publisher: Springer
status: public
title: 'Multi^3: Optimizing Multimodal Single-Objective Continuous Problems in the
  Multi-Objective Space by Means of Multiobjectivization'
type: conference
user_id: '15504'
year: '2021'
...
---
_id: '46317'
abstract:
- lang: eng
  text: 'One of the most significant recent technological developments concerns the
    development and implementation of ‘intelligent machines’ that draw on recent advances
    in artificial intelligence (AI) and robotics. However, there are growing tensions
    between human freedoms and machine controls. This article reports the findings
    of a workshop that investigated the application of the principles of human freedom
    throughout intelligent machine development and use. Forty IS researchers from
    ten different countries discussed four contemporary AI and humanity issues and
    the most relevant IS domain challenges. This article summarizes their experiences
    and opinions regarding four AI and humanity themes: Crime & conflict, Jobs, Attention,
    and Wellbeing. The outcomes of the workshop discussions identify three attributes
    of humanity that need preservation: a critique of the design and application of
    AI, and the intelligent machines it can create; human involvement in the loop
    of intelligent machine decision-making processes; and the ability to interpret
    and explain intelligent machine decision-making processes. The article provides
    an agenda for future AI and humanity research.'
author:
- first_name: Crispin
  full_name: Coombs, Crispin
  last_name: Coombs
- first_name: Patrick
  full_name: Stacey, Patrick
  last_name: Stacey
- first_name: Peter
  full_name: Kawalek, Peter
  last_name: Kawalek
- first_name: Boyka
  full_name: Simeonova, Boyka
  last_name: Simeonova
- first_name: Jörg
  full_name: Becker, Jörg
  last_name: Becker
- first_name: Katrin
  full_name: Bergener, Katrin
  last_name: Bergener
- first_name: João Álvaro
  full_name: Carvalho, João Álvaro
  last_name: Carvalho
- first_name: Marcelo
  full_name: Fantinato, Marcelo
  last_name: Fantinato
- first_name: Niels F.
  full_name: Garmann-Johnsen, Niels F.
  last_name: Garmann-Johnsen
- first_name: Christian
  full_name: Grimme, Christian
  last_name: Grimme
- first_name: Armin
  full_name: Stein, Armin
  last_name: Stein
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
citation:
  ama: Coombs C, Stacey P, Kawalek P, et al. What Is It About Humanity That We Can’t
    Give Away To Intelligent Machines? A European Perspective. <i>International Journal
    of Information Management</i>. 2021;58. doi:<a href="https://doi.org/10.1016/j.ijinfomgt.2021.102311">10.1016/j.ijinfomgt.2021.102311</a>
  apa: Coombs, C., Stacey, P., Kawalek, P., Simeonova, B., Becker, J., Bergener, K.,
    Carvalho, J. Á., Fantinato, M., Garmann-Johnsen, N. F., Grimme, C., Stein, A.,
    &#38; Trautmann, H. (2021). What Is It About Humanity That We Can’t Give Away
    To Intelligent Machines? A European Perspective. <i>International Journal of Information
    Management</i>, <i>58</i>. <a href="https://doi.org/10.1016/j.ijinfomgt.2021.102311">https://doi.org/10.1016/j.ijinfomgt.2021.102311</a>
  bibtex: '@article{Coombs_Stacey_Kawalek_Simeonova_Becker_Bergener_Carvalho_Fantinato_Garmann-Johnsen_Grimme_et
    al._2021, title={What Is It About Humanity That We Can’t Give Away To Intelligent
    Machines? A European Perspective}, volume={58}, DOI={<a href="https://doi.org/10.1016/j.ijinfomgt.2021.102311">10.1016/j.ijinfomgt.2021.102311</a>},
    journal={International Journal of Information Management}, author={Coombs, Crispin
    and Stacey, Patrick and Kawalek, Peter and Simeonova, Boyka and Becker, Jörg and
    Bergener, Katrin and Carvalho, João Álvaro and Fantinato, Marcelo and Garmann-Johnsen,
    Niels F. and Grimme, Christian and et al.}, year={2021} }'
  chicago: Coombs, Crispin, Patrick Stacey, Peter Kawalek, Boyka Simeonova, Jörg Becker,
    Katrin Bergener, João Álvaro Carvalho, et al. “What Is It About Humanity That
    We Can’t Give Away To Intelligent Machines? A European Perspective.” <i>International
    Journal of Information Management</i> 58 (2021). <a href="https://doi.org/10.1016/j.ijinfomgt.2021.102311">https://doi.org/10.1016/j.ijinfomgt.2021.102311</a>.
  ieee: 'C. Coombs <i>et al.</i>, “What Is It About Humanity That We Can’t Give Away
    To Intelligent Machines? A European Perspective,” <i>International Journal of
    Information Management</i>, vol. 58, 2021, doi: <a href="https://doi.org/10.1016/j.ijinfomgt.2021.102311">10.1016/j.ijinfomgt.2021.102311</a>.'
  mla: Coombs, Crispin, et al. “What Is It About Humanity That We Can’t Give Away
    To Intelligent Machines? A European Perspective.” <i>International Journal of
    Information Management</i>, vol. 58, 2021, doi:<a href="https://doi.org/10.1016/j.ijinfomgt.2021.102311">10.1016/j.ijinfomgt.2021.102311</a>.
  short: C. Coombs, P. Stacey, P. Kawalek, B. Simeonova, J. Becker, K. Bergener, J.Á.
    Carvalho, M. Fantinato, N.F. Garmann-Johnsen, C. Grimme, A. Stein, H. Trautmann,
    International Journal of Information Management 58 (2021).
date_created: 2023-08-04T07:27:14Z
date_updated: 2023-10-16T12:58:02Z
department:
- _id: '34'
- _id: '819'
doi: 10.1016/j.ijinfomgt.2021.102311
intvolume: '        58'
language:
- iso: eng
publication: International Journal of Information Management
status: public
title: What Is It About Humanity That We Can’t Give Away To Intelligent Machines?
  A European Perspective
type: journal_article
user_id: '15504'
volume: 58
year: '2021'
...
---
_id: '21272'
author:
- first_name: Patrick
  full_name: Ködding, Patrick
  id: '45402'
  last_name: Ködding
- first_name: Roman
  full_name: Dumitrescu, Roman
  id: '16190'
  last_name: Dumitrescu
citation:
  ama: 'Ködding P, Dumitrescu R. Forschungsfelder für Künstliche Intelligenz in der
    strategischen Produktplanung. In: Hartmann EA, ed. <i>Digitalisisierung souverän
    gestalten</i>. Springer Vieweg; 2021:59-73.'
  apa: Ködding, P., &#38; Dumitrescu, R. (2021). Forschungsfelder für Künstliche Intelligenz
    in der strategischen Produktplanung. In E. A. Hartmann (Ed.), <i>Digitalisisierung
    souverän gestalten</i> (pp. 59–73). Springer Vieweg.
  bibtex: '@inproceedings{Ködding_Dumitrescu_2021, place={Berlin, Heidelberg}, title={Forschungsfelder
    für Künstliche Intelligenz in der strategischen Produktplanung}, booktitle={Digitalisisierung
    souverän gestalten}, publisher={Springer Vieweg}, author={Ködding, Patrick and
    Dumitrescu, Roman}, editor={Hartmann, Ernst A.}, year={2021}, pages={59–73} }'
  chicago: 'Ködding, Patrick, and Roman Dumitrescu. “Forschungsfelder für Künstliche
    Intelligenz in der strategischen Produktplanung.” In <i>Digitalisisierung souverän
    gestalten</i>, edited by Ernst A. Hartmann, 59–73. Berlin, Heidelberg: Springer
    Vieweg, 2021.'
  ieee: P. Ködding and R. Dumitrescu, “Forschungsfelder für Künstliche Intelligenz
    in der strategischen Produktplanung,” in <i>Digitalisisierung souverän gestalten</i>,
    2021, pp. 59–73.
  mla: Ködding, Patrick, and Roman Dumitrescu. “Forschungsfelder für Künstliche Intelligenz
    in der strategischen Produktplanung.” <i>Digitalisisierung souverän gestalten</i>,
    edited by Ernst A. Hartmann, Springer Vieweg, 2021, pp. 59–73.
  short: 'P. Ködding, R. Dumitrescu, in: E.A. Hartmann (Ed.), Digitalisisierung souverän
    gestalten, Springer Vieweg, Berlin, Heidelberg, 2021, pp. 59–73.'
date_created: 2021-02-24T13:07:33Z
date_updated: 2023-10-06T12:32:24Z
department:
- _id: '563'
editor:
- first_name: Ernst A.
  full_name: Hartmann, Ernst A.
  last_name: Hartmann
language:
- iso: ger
page: pp. 59-73
place: Berlin, Heidelberg
publication: Digitalisisierung souverän gestalten
publication_status: published
publisher: Springer Vieweg
status: public
title: Forschungsfelder für Künstliche Intelligenz in der strategischen Produktplanung
type: conference
user_id: '45402'
year: '2021'
...
---
_id: '48286'
author:
- first_name: Ivan
  full_name: Habernal, Ivan
  id: '101881'
  last_name: Habernal
citation:
  ama: 'Habernal I. When differential privacy meets NLP: The devil is in the detail.
    In: <i>Proceedings of the 2021 Conference on Empirical Methods in Natural Language
    Processing</i>. Association for Computational Linguistics; 2021. doi:<a href="https://doi.org/10.18653/v1/2021.emnlp-main.114">10.18653/v1/2021.emnlp-main.114</a>'
  apa: 'Habernal, I. (2021). When differential privacy meets NLP: The devil is in
    the detail. <i>Proceedings of the 2021 Conference on Empirical Methods in Natural
    Language Processing</i>. <a href="https://doi.org/10.18653/v1/2021.emnlp-main.114">https://doi.org/10.18653/v1/2021.emnlp-main.114</a>'
  bibtex: '@inproceedings{Habernal_2021, title={When differential privacy meets NLP:
    The devil is in the detail}, DOI={<a href="https://doi.org/10.18653/v1/2021.emnlp-main.114">10.18653/v1/2021.emnlp-main.114</a>},
    booktitle={Proceedings of the 2021 Conference on Empirical Methods in Natural
    Language Processing}, publisher={Association for Computational Linguistics}, author={Habernal,
    Ivan}, year={2021} }'
  chicago: 'Habernal, Ivan. “When Differential Privacy Meets NLP: The Devil Is in
    the Detail.” In <i>Proceedings of the 2021 Conference on Empirical Methods in
    Natural Language Processing</i>. Association for Computational Linguistics, 2021.
    <a href="https://doi.org/10.18653/v1/2021.emnlp-main.114">https://doi.org/10.18653/v1/2021.emnlp-main.114</a>.'
  ieee: 'I. Habernal, “When differential privacy meets NLP: The devil is in the detail,”
    2021, doi: <a href="https://doi.org/10.18653/v1/2021.emnlp-main.114">10.18653/v1/2021.emnlp-main.114</a>.'
  mla: 'Habernal, Ivan. “When Differential Privacy Meets NLP: The Devil Is in the
    Detail.” <i>Proceedings of the 2021 Conference on Empirical Methods in Natural
    Language Processing</i>, Association for Computational Linguistics, 2021, doi:<a
    href="https://doi.org/10.18653/v1/2021.emnlp-main.114">10.18653/v1/2021.emnlp-main.114</a>.'
  short: 'I. Habernal, in: Proceedings of the 2021 Conference on Empirical Methods
    in Natural Language Processing, Association for Computational Linguistics, 2021.'
date_created: 2023-10-19T08:21:43Z
date_updated: 2023-10-19T12:04:40Z
department:
- _id: '34'
- _id: '820'
doi: 10.18653/v1/2021.emnlp-main.114
language:
- iso: eng
publication: Proceedings of the 2021 Conference on Empirical Methods in Natural Language
  Processing
publication_status: published
publisher: Association for Computational Linguistics
status: public
title: 'When differential privacy meets NLP: The devil is in the detail'
type: conference
user_id: '15504'
year: '2021'
...
---
_id: '24456'
abstract:
- lang: eng
  text: One objective of current research in explainable intelligent systems is to
    implement social aspects in order to increase the relevance of explanations. In
    this paper, we argue that a novel conceptual framework is needed to overcome shortcomings
    of existing AI systems with little attention to processes of interaction and learning.
    Drawing from research in interaction and development, we first outline the novel
    conceptual framework that pushes the design of AI systems toward true interactivity
    with an emphasis on the role of the partner and social relevance. We propose that
    AI systems will be able to provide a meaningful and relevant explanation only
    if the process of explaining is extended to active contribution of both partners
    that brings about dynamics that is modulated by different levels of analysis.
    Accordingly, our conceptual framework comprises monitoring and scaffolding as
    key concepts and claims that the process of explaining is not only modulated by
    the interaction between explainee and explainer but is embedded into a larger
    social context in which conventionalized and routinized behaviors are established.
    We discuss our conceptual framework in relation to the established objectives
    of transparency and autonomy that are raised for the design of explainable AI
    systems currently.
article_type: original
author:
- first_name: Katharina J.
  full_name: Rohlfing, Katharina J.
  id: '50352'
  last_name: Rohlfing
- first_name: Philipp
  full_name: Cimiano, Philipp
  last_name: Cimiano
- first_name: Ingrid
  full_name: Scharlau, Ingrid
  id: '451'
  last_name: Scharlau
  orcid: 0000-0003-2364-9489
- first_name: Tobias
  full_name: Matzner, Tobias
  id: '65695'
  last_name: Matzner
- first_name: Heike M.
  full_name: Buhl, Heike M.
  id: '27152'
  last_name: Buhl
- first_name: Hendrik
  full_name: Buschmeier, Hendrik
  last_name: Buschmeier
- first_name: Elena
  full_name: Esposito, Elena
  last_name: Esposito
- first_name: Angela
  full_name: Grimminger, Angela
  id: '57578'
  last_name: Grimminger
- first_name: Barbara
  full_name: Hammer, Barbara
  last_name: Hammer
- first_name: Reinhold
  full_name: Haeb-Umbach, Reinhold
  id: '242'
  last_name: Haeb-Umbach
- first_name: Ilona
  full_name: Horwath, Ilona
  id: '68836'
  last_name: Horwath
- first_name: Eyke
  full_name: Hüllermeier, Eyke
  id: '48129'
  last_name: Hüllermeier
- first_name: Friederike
  full_name: Kern, Friederike
  last_name: Kern
- first_name: Stefan
  full_name: Kopp, Stefan
  last_name: Kopp
- first_name: Kirsten
  full_name: Thommes, Kirsten
  id: '72497'
  last_name: Thommes
- first_name: Axel-Cyrille
  full_name: Ngonga Ngomo, Axel-Cyrille
  id: '65716'
  last_name: Ngonga Ngomo
- first_name: Carsten
  full_name: Schulte, Carsten
  id: '60311'
  last_name: Schulte
- first_name: Henning
  full_name: Wachsmuth, Henning
  id: '3900'
  last_name: Wachsmuth
- first_name: Petra
  full_name: Wagner, Petra
  last_name: Wagner
- first_name: Britta
  full_name: Wrede, Britta
  last_name: Wrede
citation:
  ama: 'Rohlfing KJ, Cimiano P, Scharlau I, et al. Explanation as a Social Practice:
    Toward a Conceptual Framework for the Social Design of AI Systems. <i>IEEE Transactions
    on Cognitive and Developmental Systems</i>. 2021;13(3):717-728. doi:<a href="https://doi.org/10.1109/tcds.2020.3044366">10.1109/tcds.2020.3044366</a>'
  apa: 'Rohlfing, K. J., Cimiano, P., Scharlau, I., Matzner, T., Buhl, H. M., Buschmeier,
    H., Esposito, E., Grimminger, A., Hammer, B., Haeb-Umbach, R., Horwath, I., Hüllermeier,
    E., Kern, F., Kopp, S., Thommes, K., Ngonga Ngomo, A.-C., Schulte, C., Wachsmuth,
    H., Wagner, P., &#38; Wrede, B. (2021). Explanation as a Social Practice: Toward
    a Conceptual Framework for the Social Design of AI Systems. <i>IEEE Transactions
    on Cognitive and Developmental Systems</i>, <i>13</i>(3), 717–728. <a href="https://doi.org/10.1109/tcds.2020.3044366">https://doi.org/10.1109/tcds.2020.3044366</a>'
  bibtex: '@article{Rohlfing_Cimiano_Scharlau_Matzner_Buhl_Buschmeier_Esposito_Grimminger_Hammer_Haeb-Umbach_et
    al._2021, title={Explanation as a Social Practice: Toward a Conceptual Framework
    for the Social Design of AI Systems}, volume={13}, DOI={<a href="https://doi.org/10.1109/tcds.2020.3044366">10.1109/tcds.2020.3044366</a>},
    number={3}, journal={IEEE Transactions on Cognitive and Developmental Systems},
    author={Rohlfing, Katharina J. and Cimiano, Philipp and Scharlau, Ingrid and Matzner,
    Tobias and Buhl, Heike M. and Buschmeier, Hendrik and Esposito, Elena and Grimminger,
    Angela and Hammer, Barbara and Haeb-Umbach, Reinhold and et al.}, year={2021},
    pages={717–728} }'
  chicago: 'Rohlfing, Katharina J., Philipp Cimiano, Ingrid Scharlau, Tobias Matzner,
    Heike M. Buhl, Hendrik Buschmeier, Elena Esposito, et al. “Explanation as a Social
    Practice: Toward a Conceptual Framework for the Social Design of AI Systems.”
    <i>IEEE Transactions on Cognitive and Developmental Systems</i> 13, no. 3 (2021):
    717–28. <a href="https://doi.org/10.1109/tcds.2020.3044366">https://doi.org/10.1109/tcds.2020.3044366</a>.'
  ieee: 'K. J. Rohlfing <i>et al.</i>, “Explanation as a Social Practice: Toward a
    Conceptual Framework for the Social Design of AI Systems,” <i>IEEE Transactions
    on Cognitive and Developmental Systems</i>, vol. 13, no. 3, pp. 717–728, 2021,
    doi: <a href="https://doi.org/10.1109/tcds.2020.3044366">10.1109/tcds.2020.3044366</a>.'
  mla: 'Rohlfing, Katharina J., et al. “Explanation as a Social Practice: Toward a
    Conceptual Framework for the Social Design of AI Systems.” <i>IEEE Transactions
    on Cognitive and Developmental Systems</i>, vol. 13, no. 3, 2021, pp. 717–28,
    doi:<a href="https://doi.org/10.1109/tcds.2020.3044366">10.1109/tcds.2020.3044366</a>.'
  short: K.J. Rohlfing, P. Cimiano, I. Scharlau, T. Matzner, H.M. Buhl, H. Buschmeier,
    E. Esposito, A. Grimminger, B. Hammer, R. Haeb-Umbach, I. Horwath, E. Hüllermeier,
    F. Kern, S. Kopp, K. Thommes, A.-C. Ngonga Ngomo, C. Schulte, H. Wachsmuth, P.
    Wagner, B. Wrede, IEEE Transactions on Cognitive and Developmental Systems 13
    (2021) 717–728.
date_created: 2021-09-14T20:52:57Z
date_updated: 2023-12-05T10:15:02Z
ddc:
- '300'
department:
- _id: '603'
- _id: '749'
- _id: '424'
- _id: '67'
- _id: '574'
- _id: '184'
- _id: '757'
- _id: '54'
- _id: '178'
doi: 10.1109/tcds.2020.3044366
file:
- access_level: open_access
  content_type: application/pdf
  creator: haebumb
  date_created: 2023-11-20T16:33:51Z
  date_updated: 2023-11-20T16:33:51Z
  file_id: '49081'
  file_name: 2020-12-01_explainability_final_version.pdf
  file_size: 626217
  relation: main_file
file_date_updated: 2023-11-20T16:33:51Z
has_accepted_license: '1'
intvolume: '        13'
issue: '3'
keyword:
- Explainability
- process ofexplaining andunderstanding
- explainable artificial systems
language:
- iso: eng
oa: '1'
page: 717-728
project:
- _id: '109'
  grant_number: '438445824'
  name: 'TRR 318: TRR 318 - Erklärbarkeit konstruieren'
publication: IEEE Transactions on Cognitive and Developmental Systems
publication_identifier:
  issn:
  - 2379-8920
  - 2379-8939
publication_status: published
quality_controlled: '1'
status: public
title: 'Explanation as a Social Practice: Toward a Conceptual Framework for the Social
  Design of AI Systems'
type: journal_article
user_id: '42933'
volume: 13
year: '2021'
...
---
_id: '48853'
abstract:
- lang: eng
  text: In practise, it is often desirable to provide the decision-maker with a rich
    set of diverse solutions of decent quality instead of just a single solution.
    In this paper we study evolutionary diversity optimization for the knapsack problem
    (KP). Our goal is to evolve a population of solutions that all have a profit of
    at least (1 - {$ϵ$}) {$\cdot$} OPT, where OPT is the value of an optimal solution.
    Furthermore, they should differ in structure with respect to an entropy-based
    diversity measure. To this end we propose a simple ({$\mu$} + 1)-EA with initial
    approximate solutions calculated by a well-known FPTAS for the KP. We investigate
    the effect of different standard mutation operators and introduce biased mutation
    and crossover which puts strong probability on flipping bits of low and/or high
    frequency within the population. An experimental study on different instances
    and settings shows that the proposed mutation operators in most cases perform
    slightly inferior in the long term, but show strong benefits if the number of
    function evaluations is severely limited.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Aneta
  full_name: Neumann, Aneta
  last_name: Neumann
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
citation:
  ama: 'Bossek J, Neumann A, Neumann F. Breeding Diverse Packings for the Knapsack
    Problem by Means of Diversity-Tailored Evolutionary Algorithms. In: <i>Proceedings
    of the Genetic and Evolutionary Computation Conference</i>. GECCO ’21. Association
    for Computing Machinery; 2021:556–564. doi:<a href="https://doi.org/10.1145/3449639.3459364">10.1145/3449639.3459364</a>'
  apa: Bossek, J., Neumann, A., &#38; Neumann, F. (2021). Breeding Diverse Packings
    for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.
    <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 556–564.
    <a href="https://doi.org/10.1145/3449639.3459364">https://doi.org/10.1145/3449639.3459364</a>
  bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={New York, NY, USA},
    series={GECCO ’21}, title={Breeding Diverse Packings for the Knapsack Problem
    by Means of Diversity-Tailored Evolutionary Algorithms}, DOI={<a href="https://doi.org/10.1145/3449639.3459364">10.1145/3449639.3459364</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
    publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
    Aneta and Neumann, Frank}, year={2021}, pages={556–564}, collection={GECCO ’21}
    }'
  chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings
    for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.”
    In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>,
    556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021.
    <a href="https://doi.org/10.1145/3449639.3459364">https://doi.org/10.1145/3449639.3459364</a>.'
  ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Breeding Diverse Packings for the
    Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms,” in <i>Proceedings
    of the Genetic and Evolutionary Computation Conference</i>, 2021, pp. 556–564,
    doi: <a href="https://doi.org/10.1145/3449639.3459364">10.1145/3449639.3459364</a>.'
  mla: Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by
    Means of Diversity-Tailored Evolutionary Algorithms.” <i>Proceedings of the Genetic
    and Evolutionary Computation Conference</i>, Association for Computing Machinery,
    2021, pp. 556–564, doi:<a href="https://doi.org/10.1145/3449639.3459364">10.1145/3449639.3459364</a>.
  short: 'J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary
    Computation Conference, Association for Computing Machinery, New York, NY, USA,
    2021, pp. 556–564.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:22Z
department:
- _id: '819'
doi: 10.1145/3449639.3459364
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- knapsack problem
- tailored operators
language:
- iso: eng
page: 556–564
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored
  Evolutionary Algorithms
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48855'
abstract:
- lang: eng
  text: Computing sets of high quality solutions has gained increasing interest in
    recent years. In this paper, we investigate how to obtain sets of optimal solutions
    for the classical knapsack problem. We present an algorithm to count exactly the
    number of optima to a zero-one knapsack problem instance. In addition, we show
    how to efficiently sample uniformly at random from the set of all global optima.
    In our experimental study, we investigate how the number of optima develops for
    classical random benchmark instances dependent on their generator parameters.
    We find that the number of global optima can increase exponentially for practically
    relevant classes of instances with correlated weights and profits which poses
    a justification for the considered exact counting problem.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Aneta
  full_name: Neumann, Aneta
  last_name: Neumann
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
citation:
  ama: 'Bossek J, Neumann A, Neumann F. Exact Counting and~Sampling of Optima for
    the Knapsack Problem. In: <i>Learning and Intelligent Optimization</i>. Springer-Verlag;
    2021:40–54. doi:<a href="https://doi.org/10.1007/978-3-030-92121-7_4">10.1007/978-3-030-92121-7_4</a>'
  apa: Bossek, J., Neumann, A., &#38; Neumann, F. (2021). Exact Counting and~Sampling
    of Optima for the Knapsack Problem. <i>Learning and Intelligent Optimization</i>,
    40–54. <a href="https://doi.org/10.1007/978-3-030-92121-7_4">https://doi.org/10.1007/978-3-030-92121-7_4</a>
  bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={Berlin, Heidelberg},
    title={Exact Counting and~Sampling of Optima for the Knapsack Problem}, DOI={<a
    href="https://doi.org/10.1007/978-3-030-92121-7_4">10.1007/978-3-030-92121-7_4</a>},
    booktitle={Learning and Intelligent Optimization}, publisher={Springer-Verlag},
    author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={40–54}
    }'
  chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Exact Counting And~Sampling
    of Optima for the Knapsack Problem.” In <i>Learning and Intelligent Optimization</i>,
    40–54. Berlin, Heidelberg: Springer-Verlag, 2021. <a href="https://doi.org/10.1007/978-3-030-92121-7_4">https://doi.org/10.1007/978-3-030-92121-7_4</a>.'
  ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Exact Counting and~Sampling of Optima
    for the Knapsack Problem,” in <i>Learning and Intelligent Optimization</i>, 2021,
    pp. 40–54, doi: <a href="https://doi.org/10.1007/978-3-030-92121-7_4">10.1007/978-3-030-92121-7_4</a>.'
  mla: Bossek, Jakob, et al. “Exact Counting And~Sampling of Optima for the Knapsack
    Problem.” <i>Learning and Intelligent Optimization</i>, Springer-Verlag, 2021,
    pp. 40–54, doi:<a href="https://doi.org/10.1007/978-3-030-92121-7_4">10.1007/978-3-030-92121-7_4</a>.
  short: 'J. Bossek, A. Neumann, F. Neumann, in: Learning and Intelligent Optimization,
    Springer-Verlag, Berlin, Heidelberg, 2021, pp. 40–54.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:14Z
department:
- _id: '819'
doi: 10.1007/978-3-030-92121-7_4
extern: '1'
keyword:
- Dynamic programming
- Exact counting
- Sampling
- Zero-one knapsack problem
language:
- iso: eng
page: 40–54
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
  isbn:
  - 978-3-030-92120-0
publication_status: published
publisher: Springer-Verlag
status: public
title: Exact Counting and~Sampling of Optima for the Knapsack Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48860'
abstract:
- lang: eng
  text: In the area of evolutionary computation the calculation of diverse sets of
    high-quality solutions to a given optimization problem has gained momentum in
    recent years under the term evolutionary diversity optimization. Theoretical insights
    into the working principles of baseline evolutionary algorithms for diversity
    optimization are still rare. In this paper we study the well-known Minimum Spanning
    Tree problem (MST) in the context of diversity optimization where population diversity
    is measured by the sum of pairwise edge overlaps. Theoretical results provide
    insights into the fitness landscape of the MST diversity optimization problem
    pointing out that even for a population of {$\mu$} = 2 fitness plateaus (of constant
    length) can be reached, but nevertheless diverse sets can be calculated in polynomial
    time. We supplement our theoretical results with a series of experiments for the
    unconstrained and constraint case where all solutions need to fulfill a minimal
    quality threshold. Our results show that a simple ({$\mu$} + 1)-EA can effectively
    compute a diversified population of spanning trees of high quality.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
citation:
  ama: 'Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning
    Tree Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>.
    GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:<a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>'
  apa: Bossek, J., &#38; Neumann, F. (2021). Evolutionary Diversity Optimization and
    the Minimum Spanning Tree Problem. <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, 198–206. <a href="https://doi.org/10.1145/3449639.3459363">https://doi.org/10.1145/3449639.3459363</a>
  bibtex: '@inproceedings{Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO
    ’21}, title={Evolutionary Diversity Optimization and the Minimum Spanning Tree
    Problem}, DOI={<a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
    publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
    Frank}, year={2021}, pages={198–206}, collection={GECCO ’21} }'
  chicago: 'Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization
    and the Minimum Spanning Tree Problem.” In <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, 198–206. GECCO ’21. New York, NY, USA: Association
    for Computing Machinery, 2021. <a href="https://doi.org/10.1145/3449639.3459363">https://doi.org/10.1145/3449639.3459363</a>.'
  ieee: 'J. Bossek and F. Neumann, “Evolutionary Diversity Optimization and the Minimum
    Spanning Tree Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation
    Conference</i>, 2021, pp. 198–206, doi: <a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>.'
  mla: Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and
    the Minimum Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, Association for Computing Machinery, 2021, pp. 198–206,
    doi:<a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>.
  short: 'J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation
    Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp.
    198–206.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:37Z
department:
- _id: '819'
doi: 10.1145/3449639.3459363
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- minimum spanning tree
- runtime analysis
language:
- iso: eng
page: 198–206
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48862'
abstract:
- lang: eng
  text: 'Most runtime analyses of randomised search heuristics focus on the expected
    number of function evaluations to find a unique global optimum. We ask a fundamental
    question: if additional search points are declared optimal, or declared as desirable
    target points, do these additional optima speed up evolutionary algorithms? More
    formally, we analyse the expected hitting time of a target set OPT {$\cup$} S
    where S is a set of non-optimal search points and OPT is the set of optima and
    compare it to the expected hitting time of OPT. We show that the answer to our
    question depends on the number and placement of search points in S. For all black-box
    algorithms and all fitness functions we show that, if additional optima are placed
    randomly, even an exponential number of optima has a negligible effect on the
    expected optimisation time. Considering Hamming balls around all global optima
    gives an easier target for some algorithms and functions and can shift the phase
    transition with respect to offspring population sizes in the (1,{$\lambda$}) EA
    on One-Max. Finally, on functions where search trajectories typically join in
    a single search point, turning one search point into an optimum drastically reduces
    the expected optimisation time.'
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: 'Bossek J, Sudholt D. Do Additional Optima Speed up Evolutionary Algorithms?
    In: <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
    Algorithms</i>. Association for Computing Machinery; 2021:1–11.'
  apa: Bossek, J., &#38; Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary
    Algorithms? In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations
    of Genetic Algorithms</i> (pp. 1–11). Association for Computing Machinery.
  bibtex: '@inbook{Bossek_Sudholt_2021, place={New York, NY, USA}, title={Do Additional
    Optima Speed up Evolutionary Algorithms?}, booktitle={Proceedings of the 16th
    ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association
    for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2021},
    pages={1–11} }'
  chicago: 'Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
    Algorithms?” In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations
    of Genetic Algorithms</i>, 1–11. New York, NY, USA: Association for Computing
    Machinery, 2021.'
  ieee: 'J. Bossek and D. Sudholt, “Do Additional Optima Speed up Evolutionary Algorithms?,”
    in <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
    Algorithms</i>, New York, NY, USA: Association for Computing Machinery, 2021,
    pp. 1–11.'
  mla: Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
    Algorithms?” <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of
    Genetic Algorithms</i>, Association for Computing Machinery, 2021, pp. 1–11.
  short: 'J. Bossek, D. Sudholt, in: Proceedings of the 16th ACM/SIGEVO Conference
    on Foundations of Genetic Algorithms, Association for Computing Machinery, New
    York, NY, USA, 2021, pp. 1–11.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:31Z
department:
- _id: '819'
extern: '1'
keyword:
- evolutionary algorithms
- pseudo-boolean functions
- runtime analysis
- theory
language:
- iso: eng
page: 1–11
place: New York, NY, USA
publication: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
  Algorithms
publication_identifier:
  isbn:
  - 978-1-4503-8352-3
publication_status: published
publisher: Association for Computing Machinery
status: public
title: Do Additional Optima Speed up Evolutionary Algorithms?
type: book_chapter
user_id: '102979'
year: '2021'
...