---
_id: '49361'
author:
- first_name: Tobias
full_name: Seidenberg, Tobias
last_name: Seidenberg
- first_name: Jan-Philipp
full_name: Disselkamp, Jan-Philipp
last_name: Disselkamp
- first_name: Christoph
full_name: Jürgenhake, Christoph
last_name: Jürgenhake
- first_name: Ansgar
full_name: Wicker, Ansgar
last_name: Wicker
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
- first_name: Edmund
full_name: Tolo, Edmund
last_name: Tolo
citation:
ama: 'Seidenberg T, Disselkamp J-P, Jürgenhake C, Wicker A, Dumitrescu R, Tolo E.
TCO analysis of a modular and integral product architecture in shipbuilding. In:
; 2023. doi: 10.1109/ICE/ITMC58018.2023.10332277'
apa: Seidenberg, T., Disselkamp, J.-P., Jürgenhake, C., Wicker, A., Dumitrescu,
R., & Tolo, E. (2023). TCO analysis of a modular and integral product architecture
in shipbuilding. IEEE Ice Conference 2023, Edingburgh. https://doi.org/ 10.1109/ICE/ITMC58018.2023.10332277
bibtex: '@inproceedings{Seidenberg_Disselkamp_Jürgenhake_Wicker_Dumitrescu_Tolo_2023,
title={TCO analysis of a modular and integral product architecture in shipbuilding},
DOI={ 10.1109/ICE/ITMC58018.2023.10332277},
author={Seidenberg, Tobias and Disselkamp, Jan-Philipp and Jürgenhake, Christoph
and Wicker, Ansgar and Dumitrescu, Roman and Tolo, Edmund}, year={2023} }'
chicago: Seidenberg, Tobias, Jan-Philipp Disselkamp, Christoph Jürgenhake, Ansgar
Wicker, Roman Dumitrescu, and Edmund Tolo. “TCO Analysis of a Modular and Integral
Product Architecture in Shipbuilding,” 2023. https://doi.org/
10.1109/ICE/ITMC58018.2023.10332277.
ieee: 'T. Seidenberg, J.-P. Disselkamp, C. Jürgenhake, A. Wicker, R. Dumitrescu,
and E. Tolo, “TCO analysis of a modular and integral product architecture in shipbuilding,”
presented at the IEEE Ice Conference 2023, Edingburgh, 2023, doi: 10.1109/ICE/ITMC58018.2023.10332277.'
mla: Seidenberg, Tobias, et al. TCO Analysis of a Modular and Integral Product
Architecture in Shipbuilding. 2023, doi:
10.1109/ICE/ITMC58018.2023.10332277.
short: 'T. Seidenberg, J.-P. Disselkamp, C. Jürgenhake, A. Wicker, R. Dumitrescu,
E. Tolo, in: 2023.'
conference:
end_date: 2023-06-22
location: Edingburgh
name: IEEE Ice Conference 2023
start_date: 2023-06-19
date_created: 2023-11-30T10:27:50Z
date_updated: 2023-12-06T07:46:08Z
department:
- _id: '563'
doi: ' 10.1109/ICE/ITMC58018.2023.10332277'
language:
- iso: eng
status: public
title: TCO analysis of a modular and integral product architecture in shipbuilding
type: conference
user_id: '15782'
year: '2023'
...
---
_id: '49360'
author:
- first_name: Jan-Philipp
full_name: Disselkamp, Jan-Philipp
last_name: Disselkamp
- first_name: Tobias
full_name: Seidenberg, Tobias
last_name: Seidenberg
- first_name: Christoph
full_name: Jürgenhake, Christoph
last_name: Jürgenhake
- first_name: Harald
full_name: Anacker, Harald
last_name: Anacker
- first_name: Roman
full_name: Dumitrescu, Roman
id: '16190'
last_name: Dumitrescu
citation:
ama: 'Disselkamp J-P, Seidenberg T, Jürgenhake C, Anacker H, Dumitrescu R. Future
production of ships – case study for modular high-speed ferries. In: ; 2023. doi: 10.1109/ICE/ITMC58018.2023.10332382'
apa: Disselkamp, J.-P., Seidenberg, T., Jürgenhake, C., Anacker, H., & Dumitrescu,
R. (2023). Future production of ships – case study for modular high-speed ferries.
IEEE Ice Conference 2023, Edingburgh. https://doi.org/
10.1109/ICE/ITMC58018.2023.10332382
bibtex: '@inproceedings{Disselkamp_Seidenberg_Jürgenhake_Anacker_Dumitrescu_2023,
title={Future production of ships – case study for modular high-speed ferries},
DOI={ 10.1109/ICE/ITMC58018.2023.10332382},
author={Disselkamp, Jan-Philipp and Seidenberg, Tobias and Jürgenhake, Christoph
and Anacker, Harald and Dumitrescu, Roman}, year={2023} }'
chicago: Disselkamp, Jan-Philipp, Tobias Seidenberg, Christoph Jürgenhake, Harald
Anacker, and Roman Dumitrescu. “Future Production of Ships – Case Study for Modular
High-Speed Ferries,” 2023. https://doi.org/
10.1109/ICE/ITMC58018.2023.10332382.
ieee: 'J.-P. Disselkamp, T. Seidenberg, C. Jürgenhake, H. Anacker, and R. Dumitrescu,
“Future production of ships – case study for modular high-speed ferries,” presented
at the IEEE Ice Conference 2023, Edingburgh, 2023, doi: 10.1109/ICE/ITMC58018.2023.10332382.'
mla: Disselkamp, Jan-Philipp, et al. Future Production of Ships – Case Study
for Modular High-Speed Ferries. 2023, doi:
10.1109/ICE/ITMC58018.2023.10332382.
short: 'J.-P. Disselkamp, T. Seidenberg, C. Jürgenhake, H. Anacker, R. Dumitrescu,
in: 2023.'
conference:
end_date: 2023-06-22
location: Edingburgh
name: IEEE Ice Conference 2023
start_date: 2023-06-19
date_created: 2023-11-30T10:26:12Z
date_updated: 2023-12-06T07:45:25Z
department:
- _id: '563'
doi: ' 10.1109/ICE/ITMC58018.2023.10332382'
language:
- iso: eng
status: public
title: Future production of ships – case study for modular high-speed ferries
type: conference
user_id: '15782'
year: '2023'
...
---
_id: '49372'
author:
- first_name: Jürgen
full_name: Klüners, Jürgen
id: '21202'
last_name: Klüners
- first_name: Jiuya
full_name: Wang, Jiuya
last_name: Wang
citation:
ama: Klüners J, Wang J. Idélic Approach in Enumerating Heisenberg Extensions. La
Matematica. Published online 2023. doi:10.1007/s44007-023-00067-w
apa: Klüners, J., & Wang, J. (2023). Idélic Approach in Enumerating Heisenberg
Extensions. La Matematica. https://doi.org/10.1007/s44007-023-00067-w
bibtex: '@article{Klüners_Wang_2023, title={Idélic Approach in Enumerating Heisenberg
Extensions}, DOI={10.1007/s44007-023-00067-w},
journal={La Matematica}, publisher={Springer Science and Business Media LLC},
author={Klüners, Jürgen and Wang, Jiuya}, year={2023} }'
chicago: Klüners, Jürgen, and Jiuya Wang. “Idélic Approach in Enumerating Heisenberg
Extensions.” La Matematica, 2023. https://doi.org/10.1007/s44007-023-00067-w.
ieee: 'J. Klüners and J. Wang, “Idélic Approach in Enumerating Heisenberg Extensions,”
La Matematica, 2023, doi: 10.1007/s44007-023-00067-w.'
mla: Klüners, Jürgen, and Jiuya Wang. “Idélic Approach in Enumerating Heisenberg
Extensions.” La Matematica, Springer Science and Business Media LLC, 2023,
doi:10.1007/s44007-023-00067-w.
short: J. Klüners, J. Wang, La Matematica (2023).
date_created: 2023-12-01T09:23:59Z
date_updated: 2023-12-06T09:50:43Z
department:
- _id: '102'
doi: 10.1007/s44007-023-00067-w
language:
- iso: eng
publication: La Matematica
publication_identifier:
issn:
- 2730-9657
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Idélic Approach in Enumerating Heisenberg Extensions
type: journal_article
user_id: '21202'
year: '2023'
...
---
_id: '48869'
abstract:
- lang: eng
text: Evolutionary algorithms have been shown to obtain good solutions for complex
optimization problems in static and dynamic environments. It is important to understand
the behaviour of evolutionary algorithms for complex optimization problems that
also involve dynamic and/or stochastic components in a systematic way in order
to further increase their applicability to real-world problems. We investigate
the node weighted traveling salesperson problem (W-TSP), which provides an abstraction
of a wide range of weighted TSP problems, in dynamic settings. In the dynamic
setting of the problem, items that have to be collected as part of a TSP tour
change over time. We first present a dynamic setup for the dynamic W-TSP parameterized
by different types of changes that are applied to the set of items to be collected
when traversing the tour. Our first experimental investigations study the impact
of such changes on resulting optimized tours in order to provide structural insights
of optimization solutions. Afterwards, we investigate simple mutation-based evolutionary
algorithms and study the impact of the mutation operators and the use of populations
with dealing with the dynamic changes to the node weights of the 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. On the Impact of Basic Mutation Operators
and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling
Salesperson Problem. In: Proceedings of the Genetic and Evolutionary Computation
Conference. GECCO’23. Association for Computing Machinery; 2023:248–256. doi:10.1145/3583131.3590384'
apa: Bossek, J., Neumann, A., & Neumann, F. (2023). On the Impact of Basic Mutation
Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted
Traveling Salesperson Problem. Proceedings of the Genetic and Evolutionary
Computation Conference, 248–256. https://doi.org/10.1145/3583131.3590384
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2023, place={New York, NY, USA},
series={GECCO’23}, title={On the Impact of Basic Mutation Operators and Populations
within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson
Problem}, DOI={10.1145/3583131.3590384},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Aneta and Neumann, Frank}, year={2023}, pages={248–256}, collection={GECCO’23}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “On the Impact of Basic
Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic
Weighted Traveling Salesperson Problem.” In Proceedings of the Genetic and
Evolutionary Computation Conference, 248–256. GECCO’23. New York, NY, USA:
Association for Computing Machinery, 2023. https://doi.org/10.1145/3583131.3590384.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “On the Impact of Basic Mutation Operators
and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling
Salesperson Problem,” in Proceedings of the Genetic and Evolutionary Computation
Conference, 2023, pp. 248–256, doi: 10.1145/3583131.3590384.'
mla: Bossek, Jakob, et al. “On the Impact of Basic Mutation Operators and Populations
within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson
Problem.” Proceedings of the Genetic and Evolutionary Computation Conference,
Association for Computing Machinery, 2023, pp. 248–256, doi:10.1145/3583131.3590384.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2023, pp. 248–256.'
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:46:27Z
department:
- _id: '819'
doi: 10.1145/3583131.3590384
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- re-optimization
- weighted traveling salesperson problem
language:
- iso: eng
page: 248–256
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- '9798400701191'
publisher: Association for Computing Machinery
series_title: GECCO’23
status: public
title: On the Impact of Basic Mutation Operators and Populations within Evolutionary
Algorithms for the Dynamic Weighted Traveling Salesperson Problem
type: conference
user_id: '102979'
year: '2023'
...
---
_id: '48872'
abstract:
- lang: eng
text: Quality diversity (QD) is a branch of evolutionary computation that gained
increasing interest in recent years. The Map-Elites QD approach defines a feature
space, i.e., a partition of the search space, and stores the best solution for
each cell of this space. We study a simple QD algorithm in the context of pseudo-Boolean
optimisation on the "number of ones" feature space, where the ith cell stores
the best solution amongst those with a number of ones in [(i - 1)k, ik - 1]. Here
k is a granularity parameter 1 {$\leq$} k {$\leq$} n+1. We give a tight bound
on the expected time until all cells are covered for arbitrary fitness functions
and for all k and analyse the expected optimisation time of QD on OneMax and other
problems whose structure aligns favourably with the feature space. On combinatorial
problems we show that QD finds a (1 - 1/e)-approximation when maximising any monotone
sub-modular function with a single uniform cardinality constraint efficiently.
Defining the feature space as the number of connected components of a connected
graph, we show that QD finds a minimum spanning tree in expected polynomial 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. Runtime Analysis of Quality Diversity Algorithms. In:
Proceedings of the Genetic and Evolutionary Computation Conference. GECCO’23.
Association for Computing Machinery; 2023:1546–1554. doi:10.1145/3583131.3590383'
apa: Bossek, J., & Sudholt, D. (2023). Runtime Analysis of Quality Diversity
Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference,
1546–1554. https://doi.org/10.1145/3583131.3590383
bibtex: '@inproceedings{Bossek_Sudholt_2023, place={New York, NY, USA}, series={GECCO’23},
title={Runtime Analysis of Quality Diversity Algorithms}, DOI={10.1145/3583131.3590383},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Sudholt,
Dirk}, year={2023}, pages={1546–1554}, collection={GECCO’23} }'
chicago: 'Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity
Algorithms.” In Proceedings of the Genetic and Evolutionary Computation Conference,
1546–1554. GECCO’23. New York, NY, USA: Association for Computing Machinery, 2023.
https://doi.org/10.1145/3583131.3590383.'
ieee: 'J. Bossek and D. Sudholt, “Runtime Analysis of Quality Diversity Algorithms,”
in Proceedings of the Genetic and Evolutionary Computation Conference,
2023, pp. 1546–1554, doi: 10.1145/3583131.3590383.'
mla: Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity Algorithms.”
Proceedings of the Genetic and Evolutionary Computation Conference, Association
for Computing Machinery, 2023, pp. 1546–1554, doi:10.1145/3583131.3590383.
short: 'J. Bossek, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation
Conference, Association for Computing Machinery, New York, NY, USA, 2023, pp.
1546–1554.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:48:26Z
department:
- _id: '819'
doi: 10.1145/3583131.3590383
extern: '1'
keyword:
- quality diversity
- runtime analysis
language:
- iso: eng
page: 1546–1554
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- '9798400701191'
publisher: Association for Computing Machinery
series_title: GECCO’23
status: public
title: Runtime Analysis of Quality Diversity Algorithms
type: conference
user_id: '102979'
year: '2023'
...
---
_id: '48886'
abstract:
- lang: eng
text: 'Generating new instances via evolutionary methods is commonly used to create
new benchmarking data-sets, with a focus on attempting to cover an instance-space
as completely as possible. Recent approaches have exploited Quality-Diversity
methods to evolve sets of instances that are both diverse and discriminatory with
respect to a portfolio of solvers, but these methods can be challenging when attempting
to find diversity in a high-dimensional feature-space. We address this issue by
training a model based on Principal Component Analysis on existing instances to
create a low-dimension projection of the high-dimension feature-vectors, and then
apply Novelty Search directly in the new low-dimension space. We conduct experiments
to evolve diverse and discriminatory instances of Knapsack Problems, comparing
the use of Novelty Search in the original feature-space to using Novelty Search
in a low-dimensional projection, and repeat over a given set of dimensions. We
find that the methods are complementary: if treated as an ensemble, they collectively
provide increased coverage of the space. Specifically, searching for novelty in
a low-dimension space contributes 56% of the filled regions of the space, while
searching directly in the feature-space covers the remaining 44%.'
author:
- first_name: Alejandro
full_name: Marrero, Alejandro
last_name: Marrero
- first_name: Eduardo
full_name: Segredo, Eduardo
last_name: Segredo
- first_name: Emma
full_name: Hart, Emma
last_name: Hart
- 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
citation:
ama: 'Marrero A, Segredo E, Hart E, Bossek J, Neumann A. Generating Diverse and
Discriminatory Knapsack Instances by Searching for Novelty in Variable Dimensions
of Feature-Space. In: Proceedings of the Genetic} and Evolutionary Computation
Conference. GECCO’23. Association for Computing Machinery; 2023:312–320. doi:10.1145/3583131.3590504'
apa: Marrero, A., Segredo, E., Hart, E., Bossek, J., & Neumann, A. (2023). Generating
Diverse and Discriminatory Knapsack Instances by Searching for Novelty in Variable
Dimensions of Feature-Space. Proceedings of the Genetic} and Evolutionary Computation
Conference, 312–320. https://doi.org/10.1145/3583131.3590504
bibtex: '@inproceedings{Marrero_Segredo_Hart_Bossek_Neumann_2023, place={New York,
NY, USA}, series={GECCO’23}, title={Generating Diverse and Discriminatory Knapsack
Instances by Searching for Novelty in Variable Dimensions of Feature-Space}, DOI={10.1145/3583131.3590504}, booktitle={Proceedings
of the Genetic} and Evolutionary Computation Conference}, publisher={Association
for Computing Machinery}, author={Marrero, Alejandro and Segredo, Eduardo and
Hart, Emma and Bossek, Jakob and Neumann, Aneta}, year={2023}, pages={312–320},
collection={GECCO’23} }'
chicago: 'Marrero, Alejandro, Eduardo Segredo, Emma Hart, Jakob Bossek, and Aneta
Neumann. “Generating Diverse and Discriminatory Knapsack Instances by Searching
for Novelty in Variable Dimensions of Feature-Space.” In Proceedings of the
Genetic} and Evolutionary Computation Conference, 312–320. GECCO’23. New York,
NY, USA: Association for Computing Machinery, 2023. https://doi.org/10.1145/3583131.3590504.'
ieee: 'A. Marrero, E. Segredo, E. Hart, J. Bossek, and A. Neumann, “Generating Diverse
and Discriminatory Knapsack Instances by Searching for Novelty in Variable Dimensions
of Feature-Space,” in Proceedings of the Genetic} and Evolutionary Computation
Conference, 2023, pp. 312–320, doi: 10.1145/3583131.3590504.'
mla: Marrero, Alejandro, et al. “Generating Diverse and Discriminatory Knapsack
Instances by Searching for Novelty in Variable Dimensions of Feature-Space.” Proceedings
of the Genetic} and Evolutionary Computation Conference, Association for Computing
Machinery, 2023, pp. 312–320, doi:10.1145/3583131.3590504.
short: 'A. Marrero, E. Segredo, E. Hart, J. Bossek, A. Neumann, in: Proceedings
of the Genetic} and Evolutionary Computation Conference, Association for Computing
Machinery, New York, NY, USA, 2023, pp. 312–320.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:49:32Z
department:
- _id: '819'
doi: 10.1145/3583131.3590504
extern: '1'
keyword:
- evolutionary computation
- instance generation
- instance-space analysis
- knapsack problem
- novelty search
language:
- iso: eng
page: 312–320
place: New York, NY, USA
publication: Proceedings of the Genetic} and Evolutionary Computation Conference
publication_identifier:
isbn:
- '9798400701191'
publisher: Association for Computing Machinery
series_title: GECCO’23
status: public
title: Generating Diverse and Discriminatory Knapsack Instances by Searching for Novelty
in Variable Dimensions of Feature-Space
type: conference
user_id: '102979'
year: '2023'
...
---
_id: '48871'
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 with polynomial expected optimisation times 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 OneMax. However, for the one-dimensional Ising
model the time to reach Hamming balls of radius (1/2-{$ϵ$})n around optima does
not reduce the asymptotic expected optimisation time in the worst case. 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 Target Points Speed Up Evolutionary Algorithms?
Theoretical Computer Science. Published online 2023:113757. doi:10.1016/j.tcs.2023.113757
apa: Bossek, J., & Sudholt, D. (2023). Do Additional Target Points Speed Up
Evolutionary Algorithms? Theoretical Computer Science, 113757. https://doi.org/10.1016/j.tcs.2023.113757
bibtex: '@article{Bossek_Sudholt_2023, title={Do Additional Target Points Speed
Up Evolutionary Algorithms?}, DOI={10.1016/j.tcs.2023.113757},
journal={Theoretical Computer Science}, author={Bossek, Jakob and Sudholt, Dirk},
year={2023}, pages={113757} }'
chicago: Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up
Evolutionary Algorithms?” Theoretical Computer Science, 2023, 113757. https://doi.org/10.1016/j.tcs.2023.113757.
ieee: 'J. Bossek and D. Sudholt, “Do Additional Target Points Speed Up Evolutionary
Algorithms?,” Theoretical Computer Science, p. 113757, 2023, doi: 10.1016/j.tcs.2023.113757.'
mla: Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary
Algorithms?” Theoretical Computer Science, 2023, p. 113757, doi:10.1016/j.tcs.2023.113757.
short: J. Bossek, D. Sudholt, Theoretical Computer Science (2023) 113757.
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:51:07Z
department:
- _id: '819'
doi: 10.1016/j.tcs.2023.113757
keyword:
- Evolutionary algorithms
- pseudo-Boolean functions
- runtime analysis
language:
- iso: eng
page: '113757'
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
status: public
title: Do Additional Target Points Speed Up Evolutionary Algorithms?
type: journal_article
user_id: '102979'
year: '2023'
...
---
_id: '48859'
abstract:
- lang: eng
text: We contribute to the efficient approximation of the Pareto-set for the classical
NP-hard multi-objective minimum spanning tree problem (moMST) adopting evolutionary
computation. More precisely, by building upon preliminary work, we analyse the
neighborhood structure of Pareto-optimal spanning trees and design several highly
biased sub-graph-based mutation operators founded on the gained insights. In a
nutshell, these operators replace (un)connected sub-trees of candidate solutions
with locally optimal sub-trees. The latter (biased) step is realized by applying
Kruskal’s single-objective MST algorithm to a weighted sum scalarization of a
sub-graph.We prove runtime complexity results for the introduced operators and
investigate the desirable Pareto-beneficial property. This property states that
mutants cannot be dominated by their parent. Moreover, we perform an extensive
experimental benchmark study to showcase the operator’s practical suitability.
Our results confirm that the subgraph based operators beat baseline algorithms
from the literature even with severely restricted computational budget in terms
of function evaluations on four different classes of complete graphs with different
shapes of the Pareto-front.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
citation:
ama: Bossek J, Grimme C. On Single-Objective Sub-Graph-Based Mutation for Solving
the Bi-Objective Minimum Spanning Tree Problem. Evolutionary Computation.
Published online 2023:1–35. doi:10.1162/evco_a_00335
apa: Bossek, J., & Grimme, C. (2023). On Single-Objective Sub-Graph-Based Mutation
for Solving the Bi-Objective Minimum Spanning Tree Problem. Evolutionary Computation,
1–35. https://doi.org/10.1162/evco_a_00335
bibtex: '@article{Bossek_Grimme_2023, title={On Single-Objective Sub-Graph-Based
Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem}, DOI={10.1162/evco_a_00335}, journal={Evolutionary
Computation}, author={Bossek, Jakob and Grimme, Christian}, year={2023}, pages={1–35}
}'
chicago: Bossek, Jakob, and Christian Grimme. “On Single-Objective Sub-Graph-Based
Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.” Evolutionary
Computation, 2023, 1–35. https://doi.org/10.1162/evco_a_00335.
ieee: 'J. Bossek and C. Grimme, “On Single-Objective Sub-Graph-Based Mutation for
Solving the Bi-Objective Minimum Spanning Tree Problem,” Evolutionary Computation,
pp. 1–35, 2023, doi: 10.1162/evco_a_00335.'
mla: Bossek, Jakob, and Christian Grimme. “On Single-Objective Sub-Graph-Based Mutation
for Solving the Bi-Objective Minimum Spanning Tree Problem.” Evolutionary Computation,
2023, pp. 1–35, doi:10.1162/evco_a_00335.
short: J. Bossek, C. Grimme, Evolutionary Computation (2023) 1–35.
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:51:42Z
department:
- _id: '819'
doi: 10.1162/evco_a_00335
language:
- iso: eng
page: 1–35
publication: Evolutionary Computation
publication_identifier:
issn:
- 1063-6560
status: public
title: On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum
Spanning Tree Problem
type: journal_article
user_id: '102979'
year: '2023'
...
---
_id: '49425'
author:
- first_name: Simone
full_name: Seitz, Simone
last_name: Seitz
- first_name: Uta
full_name: Häsel-Weide, Uta
id: '60267'
last_name: Häsel-Weide
- first_name: Yannik
full_name: Wilke, Yannik
last_name: Wilke
- first_name: Melina
full_name: Wallner, Melina
id: '45445'
last_name: Wallner
citation:
ama: 'Seitz S, Häsel-Weide U, Wilke Y, Wallner M. Expertise and professionalism
for inclusive (mathematics) teaching and learning: reflections on findings from
interdisciplinary professionalisation research. Teachers and Teaching.
Published online 2023:1-16. doi:https://doi.org/10.1080/13540602.2023.2284876 '
apa: 'Seitz, S., Häsel-Weide, U., Wilke, Y., & Wallner, M. (2023). Expertise
and professionalism for inclusive (mathematics) teaching and learning: reflections
on findings from interdisciplinary professionalisation research. Teachers and
Teaching, 1–16. https://doi.org/10.1080/13540602.2023.2284876
'
bibtex: '@article{Seitz_Häsel-Weide_Wilke_Wallner_2023, title={Expertise and professionalism
for inclusive (mathematics) teaching and learning: reflections on findings from
interdisciplinary professionalisation research}, DOI={https://doi.org/10.1080/13540602.2023.2284876 }, journal={Teachers and Teaching},
author={Seitz, Simone and Häsel-Weide, Uta and Wilke, Yannik and Wallner, Melina},
year={2023}, pages={1–16} }'
chicago: 'Seitz, Simone, Uta Häsel-Weide, Yannik Wilke, and Melina Wallner. “Expertise
and Professionalism for Inclusive (Mathematics) Teaching and Learning: Reflections
on Findings from Interdisciplinary Professionalisation Research.” Teachers
and Teaching, 2023, 1–16. https://doi.org/10.1080/13540602.2023.2284876 .'
ieee: 'S. Seitz, U. Häsel-Weide, Y. Wilke, and M. Wallner, “Expertise and professionalism
for inclusive (mathematics) teaching and learning: reflections on findings from
interdisciplinary professionalisation research,” Teachers and Teaching,
pp. 1–16, 2023, doi: https://doi.org/10.1080/13540602.2023.2284876
.'
mla: 'Seitz, Simone, et al. “Expertise and Professionalism for Inclusive (Mathematics)
Teaching and Learning: Reflections on Findings from Interdisciplinary Professionalisation
Research.” Teachers and Teaching, 2023, pp. 1–16, doi:https://doi.org/10.1080/13540602.2023.2284876 .'
short: S. Seitz, U. Häsel-Weide, Y. Wilke, M. Wallner, Teachers and Teaching (2023)
1–16.
date_created: 2023-12-04T09:45:04Z
date_updated: 2023-12-13T12:51:03Z
department:
- _id: '543'
doi: 'https://doi.org/10.1080/13540602.2023.2284876 '
language:
- iso: eng
page: 1-16
publication: Teachers and Teaching
status: public
title: 'Expertise and professionalism for inclusive (mathematics) teaching and learning:
reflections on findings from interdisciplinary professionalisation research'
type: journal_article
user_id: '45445'
year: '2023'
...
---
_id: '49649'
author:
- first_name: Timour
full_name: Igamberdiev, Timour
last_name: Igamberdiev
- first_name: Doan Nam Long
full_name: Vu, Doan Nam Long
last_name: Vu
- first_name: Felix
full_name: Künnecke, Felix
last_name: Künnecke
- first_name: Zhuo
full_name: Yu, Zhuo
last_name: Yu
- first_name: Jannik
full_name: Holmer, Jannik
last_name: Holmer
- first_name: Ivan
full_name: Habernal, Ivan
id: '101881'
last_name: Habernal
citation:
ama: 'Igamberdiev T, Vu DNL, Künnecke F, Yu Z, Holmer J, Habernal I. DP-NMT: Scalable
Differentially-Private Machine Translation. Published online 2023.'
apa: 'Igamberdiev, T., Vu, D. N. L., Künnecke, F., Yu, Z., Holmer, J., & Habernal,
I. (2023). DP-NMT: Scalable Differentially-Private Machine Translation.'
bibtex: '@article{Igamberdiev_Vu_Künnecke_Yu_Holmer_Habernal_2023, title={DP-NMT:
Scalable Differentially-Private Machine Translation}, author={Igamberdiev, Timour
and Vu, Doan Nam Long and Künnecke, Felix and Yu, Zhuo and Holmer, Jannik and
Habernal, Ivan}, year={2023} }'
chicago: 'Igamberdiev, Timour, Doan Nam Long Vu, Felix Künnecke, Zhuo Yu, Jannik
Holmer, and Ivan Habernal. “DP-NMT: Scalable Differentially-Private Machine Translation,”
2023.'
ieee: 'T. Igamberdiev, D. N. L. Vu, F. Künnecke, Z. Yu, J. Holmer, and I. Habernal,
“DP-NMT: Scalable Differentially-Private Machine Translation.” 2023.'
mla: 'Igamberdiev, Timour, et al. DP-NMT: Scalable Differentially-Private Machine
Translation. 2023.'
short: T. Igamberdiev, D.N.L. Vu, F. Künnecke, Z. Yu, J. Holmer, I. Habernal, (2023).
date_created: 2023-12-15T07:00:42Z
date_updated: 2023-12-15T07:21:45Z
department:
- _id: '820'
- _id: '34'
language:
- iso: eng
status: public
title: 'DP-NMT: Scalable Differentially-Private Machine Translation'
type: preprint
user_id: '15504'
year: '2023'
...
---
_id: '49650'
author:
- first_name: Lena
full_name: Held, Lena
last_name: Held
- first_name: Ivan
full_name: Habernal, Ivan
id: '101881'
last_name: Habernal
citation:
ama: 'Held L, Habernal I. LaCour!: Enabling Research on Argumentation in Hearings
of the European Court of Human Rights. Published online 2023.'
apa: 'Held, L., & Habernal, I. (2023). LaCour!: Enabling Research on Argumentation
in Hearings of the European Court of Human Rights.'
bibtex: '@article{Held_Habernal_2023, title={LaCour!: Enabling Research on Argumentation
in Hearings of the European Court of Human Rights}, author={Held, Lena and Habernal,
Ivan}, year={2023} }'
chicago: 'Held, Lena, and Ivan Habernal. “LaCour!: Enabling Research on Argumentation
in Hearings of the European Court of Human Rights,” 2023.'
ieee: 'L. Held and I. Habernal, “LaCour!: Enabling Research on Argumentation in
Hearings of the European Court of Human Rights.” 2023.'
mla: 'Held, Lena, and Ivan Habernal. LaCour!: Enabling Research on Argumentation
in Hearings of the European Court of Human Rights. 2023.'
short: L. Held, I. Habernal, (2023).
date_created: 2023-12-15T07:18:35Z
date_updated: 2023-12-15T07:21:39Z
department:
- _id: '820'
- _id: '34'
language:
- iso: eng
status: public
title: 'LaCour!: Enabling Research on Argumentation in Hearings of the European Court
of Human Rights'
type: preprint
user_id: '15504'
year: '2023'
...
---
_id: '49760'
author:
- first_name: Darius
full_name: Jakobeit, Darius
last_name: Jakobeit
- first_name: Maximilian
full_name: Schenke, Maximilian
last_name: Schenke
- first_name: Oliver
full_name: Wallscheid, Oliver
last_name: Wallscheid
citation:
ama: Jakobeit D, Schenke M, Wallscheid O. Meta-Reinforcement-Learning-Based Current
Control of Permanent Magnet Synchronous Motor Drives for a Wide Range of Power
Classes. IEEE Transactions on Power Electronics. 2023;38(7):8062-8074.
doi:10.1109/tpel.2023.3256424
apa: Jakobeit, D., Schenke, M., & Wallscheid, O. (2023). Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes. IEEE Transactions on Power Electronics, 38(7),
8062–8074. https://doi.org/10.1109/tpel.2023.3256424
bibtex: '@article{Jakobeit_Schenke_Wallscheid_2023, title={Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes}, volume={38}, DOI={10.1109/tpel.2023.3256424},
number={7}, journal={IEEE Transactions on Power Electronics}, publisher={Institute
of Electrical and Electronics Engineers (IEEE)}, author={Jakobeit, Darius and
Schenke, Maximilian and Wallscheid, Oliver}, year={2023}, pages={8062–8074} }'
chicago: 'Jakobeit, Darius, Maximilian Schenke, and Oliver Wallscheid. “Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes.” IEEE Transactions on Power Electronics 38, no. 7 (2023):
8062–74. https://doi.org/10.1109/tpel.2023.3256424.'
ieee: 'D. Jakobeit, M. Schenke, and O. Wallscheid, “Meta-Reinforcement-Learning-Based
Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range
of Power Classes,” IEEE Transactions on Power Electronics, vol. 38, no.
7, pp. 8062–8074, 2023, doi: 10.1109/tpel.2023.3256424.'
mla: Jakobeit, Darius, et al. “Meta-Reinforcement-Learning-Based Current Control
of Permanent Magnet Synchronous Motor Drives for a Wide Range of Power Classes.”
IEEE Transactions on Power Electronics, vol. 38, no. 7, Institute of Electrical
and Electronics Engineers (IEEE), 2023, pp. 8062–74, doi:10.1109/tpel.2023.3256424.
short: D. Jakobeit, M. Schenke, O. Wallscheid, IEEE Transactions on Power Electronics
38 (2023) 8062–8074.
date_created: 2023-12-18T09:54:18Z
date_updated: 2023-12-18T09:55:19Z
department:
- _id: '52'
doi: 10.1109/tpel.2023.3256424
intvolume: ' 38'
issue: '7'
keyword:
- Electrical and Electronic Engineering
language:
- iso: eng
page: 8062-8074
publication: IEEE Transactions on Power Electronics
publication_identifier:
issn:
- 0885-8993
- 1941-0107
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Meta-Reinforcement-Learning-Based Current Control of Permanent Magnet Synchronous
Motor Drives for a Wide Range of Power Classes
type: journal_article
user_id: '52638'
volume: 38
year: '2023'
...
---
_id: '48946'
abstract:
- lang: ger
text: inhalt Der verlässliche Betrieb von technischen Produkten wird zunehmend durch
bewusste Angriffe bedroht. Vollständige Sicherheit ist dabei nicht möglich, durchschlagende
Angriffe sind unvermeidbar (Assume Breach). Dies erfordert einen Paradigmenwechsel
in der sicherheitsgerechten Entwicklung mechatronischer und cyber-physischer Systeme
hin zu Defense-in-Depth. Systeme müssen so ausgelegt werden, dass sie auch bei
gezielten Angriffen möglichst hohe Zuverlässigkeit und Sicherheit gewährleisten.
Der hier beschriebene Lösungsansatz erweitert das Systemmodell um Angriffsszenarien
und Verteidigungslinien. Diese werden am Beispiel eines industriellen Schließsystems
zur Anlagensicherheit erläutert. Entwickler werden sensibilisiert, Angriffe systematisch
zu berücksichtigen und interdisziplinär Verteidigungselemente gegenüber Bedrohungen
und Angriffen zu spezifizieren.
- lang: eng
text: The reliable operation of technical products is increasingly threatened by
deliberate attacks. Complete security is not possible, striking attacks are unavoidable
(assume breach). This requires a paradigm shift in security-oriented engineering
of mechatronic and cyber-physical systems towards Defense-in-Depth. Systems need
to be engineered in a way that full reliability and security are ensured even
in case of targeted attacks. The solution approach described here expands the
system model to include attack scenarios and lines of defence. It is applied to
an industrial locking system for plant security as an example. Developers are
sensitised to systematically consider attacks and to specify interdisciplinary
defence elements against threats and attacks.
article_type: original
author:
- first_name: Iris
full_name: Gräßler, Iris
id: '47565'
last_name: Gräßler
orcid: 0000-0001-5765-971X
- first_name: Eric
full_name: Bodden, Eric
id: '59256'
last_name: Bodden
orcid: 0000-0003-3470-3647
- first_name: Dominik
full_name: Wiechel, Dominik
id: '67161'
last_name: Wiechel
- first_name: Jens
full_name: Pottebaum, Jens
id: '405'
last_name: Pottebaum
orcid: http://orcid.org/0000-0001-8778-2989
citation:
ama: 'Gräßler I, Bodden E, Wiechel D, Pottebaum J. Defense-in-Depth als neues Paradigma
der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste
und lösungsorientierte Security. Konstruktion. 2023;75(11-12):60-65. doi:10.37544/0720-5953-2023-11-12-60'
apa: 'Gräßler, I., Bodden, E., Wiechel, D., & Pottebaum, J. (2023). Defense-in-Depth
als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security. Konstruktion, 75(11–12),
60–65. https://doi.org/10.37544/0720-5953-2023-11-12-60'
bibtex: '@article{Gräßler_Bodden_Wiechel_Pottebaum_2023, title={Defense-in-Depth
als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security}, volume={75}, DOI={10.37544/0720-5953-2023-11-12-60},
number={11–12}, journal={Konstruktion}, publisher={VDI Fachmedien GmbH and Co.
KG}, author={Gräßler, Iris and Bodden, Eric and Wiechel, Dominik and Pottebaum,
Jens}, year={2023}, pages={60–65} }'
chicago: 'Gräßler, Iris, Eric Bodden, Dominik Wiechel, and Jens Pottebaum. “Defense-in-Depth
als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security.” Konstruktion 75, no.
11–12 (2023): 60–65. https://doi.org/10.37544/0720-5953-2023-11-12-60.'
ieee: 'I. Gräßler, E. Bodden, D. Wiechel, and J. Pottebaum, “Defense-in-Depth als
neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre,
bedrohungsbewusste und lösungsorientierte Security,” Konstruktion, vol.
75, no. 11–12, pp. 60–65, 2023, doi: 10.37544/0720-5953-2023-11-12-60.'
mla: 'Gräßler, Iris, et al. “Defense-in-Depth als neues Paradigma der sicherheitsgerechten
Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte
Security.” Konstruktion, vol. 75, no. 11–12, VDI Fachmedien GmbH and Co.
KG, 2023, pp. 60–65, doi:10.37544/0720-5953-2023-11-12-60.'
short: I. Gräßler, E. Bodden, D. Wiechel, J. Pottebaum, Konstruktion 75 (2023) 60–65.
date_created: 2023-11-16T08:23:12Z
date_updated: 2023-12-20T14:10:51Z
department:
- _id: '152'
- _id: '76'
doi: 10.37544/0720-5953-2023-11-12-60
intvolume: ' 75'
issue: 11-12
keyword:
- Mechanical Engineering
- Mechanics of Materials
- General Materials Science
- Theoretical Computer Science
language:
- iso: ger
page: 60-65
publication: Konstruktion
publication_identifier:
issn:
- 0720-5953
publication_status: published
publisher: VDI Fachmedien GmbH and Co. KG
quality_controlled: '1'
status: public
title: 'Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung:
interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security'
type: journal_article
user_id: '405'
volume: 75
year: '2023'
...
---
_id: '48599'
abstract:
- lang: eng
text: AbstractThe biexciton‐exciton emission cascade
commonly used in quantum‐dot systems to generate polarization entanglement yields
photons with intrinsically limited indistinguishability. In the present work,
it focuses on the generation of pairs of photons with high degrees of polarization
entanglement and simultaneously high indistinguishability. It achieves this goal
by selectively reducing the biexciton lifetime with an optical resonator. It demonstrates
that a suitably tailored circular Bragg reflector fulfills the requirements of
sufficient selective Purcell enhancement of biexciton emission paired with spectrally
broad photon extraction and twofold degenerate optical modes. The in‐depth theoretical
study combines (i) the optimization of realistic photonic structures solving Maxwell's
equations from which model parameters are extracted as input for (ii) microscopic
simulations of quantum‐dot cavity excitation dynamics with full access to photon
properties. It reports non‐trivial dependencies on system parameters and use the
predictive power of the combined theoretical approach to determine the optimal
range of Purcell enhancement that maximizes indistinguishability and entanglement
to near unity values, here specifically for the telecom C‐band at 1550 nm.
author:
- first_name: David
full_name: Bauch, David
last_name: Bauch
- first_name: Dustin
full_name: Siebert, Dustin
last_name: Siebert
- first_name: Klaus
full_name: Jöns, Klaus
id: '85353'
last_name: Jöns
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Stefan
full_name: Schumacher, Stefan
id: '27271'
last_name: Schumacher
orcid: 0000-0003-4042-4951
citation:
ama: Bauch D, Siebert D, Jöns K, Förstner J, Schumacher S. On‐Demand Indistinguishable
and Entangled Photons Using Tailored Cavity Designs. Advanced Quantum Technologies.
Published online 2023. doi:10.1002/qute.202300142
apa: Bauch, D., Siebert, D., Jöns, K., Förstner, J., & Schumacher, S. (2023).
On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs.
Advanced Quantum Technologies. https://doi.org/10.1002/qute.202300142
bibtex: '@article{Bauch_Siebert_Jöns_Förstner_Schumacher_2023, title={On‐Demand
Indistinguishable and Entangled Photons Using Tailored Cavity Designs}, DOI={10.1002/qute.202300142}, journal={Advanced
Quantum Technologies}, publisher={Wiley}, author={Bauch, David and Siebert, Dustin
and Jöns, Klaus and Förstner, Jens and Schumacher, Stefan}, year={2023} }'
chicago: Bauch, David, Dustin Siebert, Klaus Jöns, Jens Förstner, and Stefan Schumacher.
“On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs.”
Advanced Quantum Technologies, 2023. https://doi.org/10.1002/qute.202300142.
ieee: 'D. Bauch, D. Siebert, K. Jöns, J. Förstner, and S. Schumacher, “On‐Demand
Indistinguishable and Entangled Photons Using Tailored Cavity Designs,” Advanced
Quantum Technologies, 2023, doi: 10.1002/qute.202300142.'
mla: Bauch, David, et al. “On‐Demand Indistinguishable and Entangled Photons Using
Tailored Cavity Designs.” Advanced Quantum Technologies, Wiley, 2023, doi:10.1002/qute.202300142.
short: D. Bauch, D. Siebert, K. Jöns, J. Förstner, S. Schumacher, Advanced Quantum
Technologies (2023).
date_created: 2023-11-03T10:07:38Z
date_updated: 2023-12-21T10:41:17Z
department:
- _id: '61'
- _id: '230'
- _id: '429'
- _id: '623'
doi: 10.1002/qute.202300142
keyword:
- tet_topic_qd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://onlinelibrary.wiley.com/doi/10.1002/qute.202300142
oa: '1'
project:
- _id: '173'
grant_number: '231447078'
name: 'TRR 142 - C09: TRR 142 - Ideale Erzeugung von Photonenpaaren für Verschränkungsaustausch
bei Telekom Wellenlängen (C09*)'
- _id: '167'
grant_number: '231447078'
name: 'TRR 142 - B06: TRR 142 - Ultraschnelle kohärente opto-elektronische Kontrolle
eines photonischen Quantensystems (B06*)'
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
publication: Advanced Quantum Technologies
publication_identifier:
issn:
- 2511-9044
- 2511-9044
publication_status: published
publisher: Wiley
related_material:
record:
- id: '43246'
relation: earlier_version
status: public
status: public
title: On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs
type: journal_article
user_id: '158'
year: '2023'
...
---
_id: '43246'
abstract:
- lang: eng
text: The biexciton-exciton emission cascade commonly used in quantum-dot systems
to generate polarization entanglement yields photons with intrinsically limited
indistinguishability. In the present work we focus on the generation of pairs
of photons with high degrees of polarization entanglement and simultaneously high
indistinguishibility. We achieve this goal by selectively reducing the biexciton
lifetime with an optical resonator. We demonstrate that a suitably tailored circular
Bragg reflector fulfills the requirements of sufficient selective Purcell enhancement
of biexciton emission paired with spectrally broad photon extraction and two-fold
degenerate optical modes. Our in-depth theoretical study combines (i) the optimization
of realistic photonic structures solving Maxwell's equations from which model
parameters are extracted as input for (ii) microscopic simulations of quantum-dot
cavity excitation dynamics with full access to photon properties. We report non-trivial
dependencies on system parameters and use the predictive power of our combined
theoretical approach to determine the optimal range of Purcell enhancement that
maximizes indistinguishability and entanglement to near unity values in the telecom
C-band at $1550\,\mathrm{nm}$.
author:
- first_name: David
full_name: Bauch, David
last_name: Bauch
- first_name: Dustin
full_name: Siebert, Dustin
last_name: Siebert
- first_name: Klaus
full_name: Jöns, Klaus
id: '85353'
last_name: Jöns
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
- first_name: Stefan
full_name: Schumacher, Stefan
id: '27271'
last_name: Schumacher
orcid: 0000-0003-4042-4951
citation:
ama: Bauch D, Siebert D, Jöns K, Förstner J, Schumacher S. On-demand indistinguishable
and entangled photons at telecom frequencies using tailored cavity designs. Published
online 2023.
apa: Bauch, D., Siebert, D., Jöns, K., Förstner, J., & Schumacher, S. (2023).
On-demand indistinguishable and entangled photons at telecom frequencies using
tailored cavity designs.
bibtex: '@article{Bauch_Siebert_Jöns_Förstner_Schumacher_2023, title={On-demand
indistinguishable and entangled photons at telecom frequencies using tailored
cavity designs}, author={Bauch, David and Siebert, Dustin and Jöns, Klaus and
Förstner, Jens and Schumacher, Stefan}, year={2023} }'
chicago: Bauch, David, Dustin Siebert, Klaus Jöns, Jens Förstner, and Stefan Schumacher.
“On-Demand Indistinguishable and Entangled Photons at Telecom Frequencies Using
Tailored Cavity Designs,” 2023.
ieee: D. Bauch, D. Siebert, K. Jöns, J. Förstner, and S. Schumacher, “On-demand
indistinguishable and entangled photons at telecom frequencies using tailored
cavity designs.” 2023.
mla: Bauch, David, et al. On-Demand Indistinguishable and Entangled Photons at
Telecom Frequencies Using Tailored Cavity Designs. 2023.
short: D. Bauch, D. Siebert, K. Jöns, J. Förstner, S. Schumacher, (2023).
date_created: 2023-03-31T13:22:05Z
date_updated: 2023-12-21T10:41:17Z
department:
- _id: '61'
- _id: '230'
- _id: '429'
- _id: '623'
- _id: '15'
- _id: '35'
- _id: '170'
- _id: '297'
keyword:
- tet_topic_phc
- tet_topic_qd
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/pdf/2303.13871.pdf
oa: '1'
project:
- _id: '52'
name: 'PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing'
- _id: '173'
grant_number: '231447078'
name: 'TRR 142 - C09: TRR 142 - Subproject C09'
- _id: '167'
grant_number: '231447078'
name: 'TRR 142 - B06: TRR 142 - Subproject B06'
- _id: '53'
grant_number: '231447078'
name: 'TRR 142: TRR 142'
- _id: '55'
name: 'TRR 142 - B: TRR 142 - Project Area B'
- _id: '56'
name: 'TRR 142 - C: TRR 142 - Project Area C'
related_material:
record:
- id: '48599'
relation: later_version
status: public
status: public
title: On-demand indistinguishable and entangled photons at telecom frequencies using
tailored cavity designs
type: preprint
user_id: '16199'
year: '2023'
...
---
_id: '34135'
abstract:
- lang: eng
text: By one of the most fundamental principles in physics, a dynamical system will
exhibit those motions which extremise an action functional. This leads to the
formation of the Euler-Lagrange equations, which serve as a model of how the system
will behave in time. If the dynamics exhibit additional symmetries, then the motion
fulfils additional conservation laws, such as conservation of energy (time invariance),
momentum (translation invariance), or angular momentum (rotational invariance).
To learn a system representation, one could learn the discrete Euler-Lagrange
equations, or alternatively, learn the discrete Lagrangian function Ld which defines
them. Based on ideas from Lie group theory, in this work we introduce a framework
to learn a discrete Lagrangian along with its symmetry group from discrete observations
of motions and, therefore, identify conserved quantities. The learning process
does not restrict the form of the Lagrangian, does not require velocity or momentum
observations or predictions and incorporates a cost term which safeguards against
unwanted solutions and against potential numerical issues in forward simulations.
The learnt discrete quantities are related to their continuous analogues using
variational backward error analysis and numerical results demonstrate the improvement
such models can have both qualitatively and quantitatively even in the presence
of noise.
author:
- first_name: Yana
full_name: Lishkova, Yana
last_name: Lishkova
- first_name: Paul
full_name: Scherer, Paul
last_name: Scherer
- first_name: Steffen
full_name: Ridderbusch, Steffen
last_name: Ridderbusch
- first_name: Mateja
full_name: Jamnik, Mateja
last_name: Jamnik
- first_name: Pietro
full_name: Liò, Pietro
last_name: Liò
- first_name: Sina
full_name: Ober-Blöbaum, Sina
id: '16494'
last_name: Ober-Blöbaum
- first_name: Christian
full_name: Offen, Christian
id: '85279'
last_name: Offen
orcid: 0000-0002-5940-8057
citation:
ama: 'Lishkova Y, Scherer P, Ridderbusch S, et al. Discrete Lagrangian Neural Networks
with Automatic Symmetry Discovery. In: IFAC-PapersOnLine. Vol 56. Elsevier;
2023:3203-3210. doi:10.1016/j.ifacol.2023.10.1457'
apa: Lishkova, Y., Scherer, P., Ridderbusch, S., Jamnik, M., Liò, P., Ober-Blöbaum,
S., & Offen, C. (2023). Discrete Lagrangian Neural Networks with Automatic
Symmetry Discovery. IFAC-PapersOnLine, 56(2), 3203–3210. https://doi.org/10.1016/j.ifacol.2023.10.1457
bibtex: '@inproceedings{Lishkova_Scherer_Ridderbusch_Jamnik_Liò_Ober-Blöbaum_Offen_2023,
title={Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery},
volume={56}, DOI={10.1016/j.ifacol.2023.10.1457},
number={2}, booktitle={IFAC-PapersOnLine}, publisher={Elsevier}, author={Lishkova,
Yana and Scherer, Paul and Ridderbusch, Steffen and Jamnik, Mateja and Liò, Pietro
and Ober-Blöbaum, Sina and Offen, Christian}, year={2023}, pages={3203–3210} }'
chicago: Lishkova, Yana, Paul Scherer, Steffen Ridderbusch, Mateja Jamnik, Pietro
Liò, Sina Ober-Blöbaum, and Christian Offen. “Discrete Lagrangian Neural Networks
with Automatic Symmetry Discovery.” In IFAC-PapersOnLine, 56:3203–10. Elsevier,
2023. https://doi.org/10.1016/j.ifacol.2023.10.1457.
ieee: 'Y. Lishkova et al., “Discrete Lagrangian Neural Networks with Automatic
Symmetry Discovery,” in IFAC-PapersOnLine, Yokohama, Japan, 2023, vol.
56, no. 2, pp. 3203–3210, doi: 10.1016/j.ifacol.2023.10.1457.'
mla: Lishkova, Yana, et al. “Discrete Lagrangian Neural Networks with Automatic
Symmetry Discovery.” IFAC-PapersOnLine, vol. 56, no. 2, Elsevier, 2023,
pp. 3203–10, doi:10.1016/j.ifacol.2023.10.1457.
short: 'Y. Lishkova, P. Scherer, S. Ridderbusch, M. Jamnik, P. Liò, S. Ober-Blöbaum,
C. Offen, in: IFAC-PapersOnLine, Elsevier, 2023, pp. 3203–3210.'
conference:
end_date: 2023-07-14
location: ' Yokohama, Japan'
name: The 22nd World Congress of the International Federation of Automatic Control
start_date: 2023-07-09
date_created: 2022-11-23T08:17:10Z
date_updated: 2023-12-29T14:26:00Z
ddc:
- '510'
department:
- _id: '636'
doi: 10.1016/j.ifacol.2023.10.1457
external_id:
arxiv:
- '2211.10830'
file:
- access_level: open_access
content_type: application/pdf
creator: coffen
date_created: 2023-04-17T08:05:55Z
date_updated: 2023-04-17T08:05:55Z
description: |-
By one of the most fundamental principles in physics, a dynamical system will
exhibit those motions which extremise an action functional. This leads to the formation of
the Euler-Lagrange equations, which serve as a model of how the system will behave in time.
If the dynamics exhibit additional symmetries, then the motion fulfils additional conservation
laws, such as conservation of energy (time invariance), momentum (translation invariance), or
angular momentum (rotational invariance). To learn a system representation, one could learn
the discrete Euler-Lagrange equations, or alternatively, learn the discrete Lagrangian function
Ld which defines them. Based on ideas from Lie group theory, we introduce a framework to learn
a discrete Lagrangian along with its symmetry group from discrete observations of motions and,
therefore, identify conserved quantities. The learning process does not restrict the form of the
Lagrangian, does not require velocity or momentum observations or predictions and incorporates
a cost term which safeguards against unwanted solutions and against potential numerical issues
in forward simulations. The learnt discrete quantities are related to their continuous analogues
using variational backward error analysis and numerical results demonstrate the improvement
such models can have both qualitatively and quantitatively even in the presence of noise.
file_id: '44037'
file_name: LNN_project.pdf
file_size: 576115
relation: main_file
title: Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery
file_date_updated: 2023-04-17T08:05:55Z
has_accepted_license: '1'
intvolume: ' 56'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://www.sciencedirect.com/science/article/pii/S2405896323018657
oa: '1'
page: 3203-3210
publication: IFAC-PapersOnLine
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
link:
- description: GitHub
relation: software
url: https://github.com/yanalish/SymDLNN
status: public
title: Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery
type: conference
user_id: '85279'
volume: 56
year: '2023'
...
---
_id: '46738'
author:
- first_name: Somayeh
full_name: Sadeghi-Kohan, Somayeh
id: '78614'
last_name: Sadeghi-Kohan
orcid: https://orcid.org/0000-0001-7246-0610
- first_name: Jan Dennis
full_name: Reimer, Jan Dennis
id: '36703'
last_name: Reimer
- first_name: Sybille
full_name: Hellebrand, Sybille
id: '209'
last_name: Hellebrand
orcid: 0000-0002-3717-3939
- first_name: Hans-Joachim
full_name: Wunderlich, Hans-Joachim
last_name: Wunderlich
citation:
ama: 'Sadeghi-Kohan S, Reimer JD, Hellebrand S, Wunderlich H-J. Optimizing the Streaming
of Sensor Data with Approximate Communication. In: IEEE Asian Test Symposium
(ATS’23), October 2023. ; 2023.'
apa: Sadeghi-Kohan, S., Reimer, J. D., Hellebrand, S., & Wunderlich, H.-J. (2023).
Optimizing the Streaming of Sensor Data with Approximate Communication. IEEE
Asian Test Symposium (ATS’23), October 2023. IEEE Asian Test Symposium (ATS’23).
bibtex: '@inproceedings{Sadeghi-Kohan_Reimer_Hellebrand_Wunderlich_2023, place={Beijing,
China}, title={Optimizing the Streaming of Sensor Data with Approximate Communication},
booktitle={IEEE Asian Test Symposium (ATS’23), October 2023}, author={Sadeghi-Kohan,
Somayeh and Reimer, Jan Dennis and Hellebrand, Sybille and Wunderlich, Hans-Joachim},
year={2023} }'
chicago: Sadeghi-Kohan, Somayeh, Jan Dennis Reimer, Sybille Hellebrand, and Hans-Joachim
Wunderlich. “Optimizing the Streaming of Sensor Data with Approximate Communication.”
In IEEE Asian Test Symposium (ATS’23), October 2023. Beijing, China, 2023.
ieee: S. Sadeghi-Kohan, J. D. Reimer, S. Hellebrand, and H.-J. Wunderlich, “Optimizing
the Streaming of Sensor Data with Approximate Communication,” presented at the
IEEE Asian Test Symposium (ATS’23), 2023.
mla: Sadeghi-Kohan, Somayeh, et al. “Optimizing the Streaming of Sensor Data with
Approximate Communication.” IEEE Asian Test Symposium (ATS’23), October 2023,
2023.
short: 'S. Sadeghi-Kohan, J.D. Reimer, S. Hellebrand, H.-J. Wunderlich, in: IEEE
Asian Test Symposium (ATS’23), October 2023, Beijing, China, 2023.'
conference:
end_date: 2023-10-17
name: IEEE Asian Test Symposium (ATS'23)
start_date: 2023-10-14
date_created: 2023-08-26T08:47:52Z
date_updated: 2024-01-08T08:49:08Z
department:
- _id: '48'
language:
- iso: eng
place: Beijing, China
publication: IEEE Asian Test Symposium (ATS'23), October 2023
status: public
title: Optimizing the Streaming of Sensor Data with Approximate Communication
type: conference
user_id: '36703'
year: '2023'
...
---
_id: '50298'
abstract:
- lang: eng
text: A finite classical polar space of rank $n$ consists of the totally isotropic
subspaces of a finite vector space equipped with a nondegenerate form such that
$n$ is the maximal dimension of such a subspace. A $t$-Steiner system in a finite
classical polar space of rank $n$ is a collection $Y$ of totally isotropic $n$-spaces
such that each totally isotropic $t$-space is contained in exactly one member
of $Y$. Nontrivial examples are known only for $t=1$ and $t=n-1$. We give an almost
complete classification of such $t$-Steiner systems, showing that such objects
can only exist in some corner cases. This classification result arises from a
more general result on packings in polar spaces.
author:
- first_name: Kai-Uwe
full_name: Schmidt, Kai-Uwe
last_name: Schmidt
- first_name: Charlene
full_name: Weiß, Charlene
id: '70420'
last_name: Weiß
citation:
ama: Schmidt K-U, Weiß C. Packings and Steiner systems in polar spaces. Combinatorial
Theory. 2023;3(1). doi:10.5070/c63160424
apa: Schmidt, K.-U., & Weiß, C. (2023). Packings and Steiner systems in polar
spaces. Combinatorial Theory, 3(1). https://doi.org/10.5070/c63160424
bibtex: '@article{Schmidt_Weiß_2023, title={Packings and Steiner systems in polar
spaces}, volume={3}, DOI={10.5070/c63160424},
number={1}, journal={Combinatorial Theory}, author={Schmidt, Kai-Uwe and Weiß,
Charlene}, year={2023} }'
chicago: Schmidt, Kai-Uwe, and Charlene Weiß. “Packings and Steiner Systems in Polar
Spaces.” Combinatorial Theory 3, no. 1 (2023). https://doi.org/10.5070/c63160424.
ieee: 'K.-U. Schmidt and C. Weiß, “Packings and Steiner systems in polar spaces,”
Combinatorial Theory, vol. 3, no. 1, 2023, doi: 10.5070/c63160424.'
mla: Schmidt, Kai-Uwe, and Charlene Weiß. “Packings and Steiner Systems in Polar
Spaces.” Combinatorial Theory, vol. 3, no. 1, 2023, doi:10.5070/c63160424.
short: K.-U. Schmidt, C. Weiß, Combinatorial Theory 3 (2023).
date_created: 2024-01-08T14:33:54Z
date_updated: 2024-01-08T14:39:20Z
department:
- _id: '100'
doi: 10.5070/c63160424
intvolume: ' 3'
issue: '1'
language:
- iso: eng
publication: Combinatorial Theory
publication_status: published
status: public
title: Packings and Steiner systems in polar spaces
type: journal_article
user_id: '70420'
volume: 3
year: '2023'
...
---
_id: '50297'
abstract:
- lang: eng
text: We show that there exist ordered orthogonal arrays, whose sizes deviate from
the Rao bound by a factor that is polynomial in the parameters of the ordered
orthogonal array. The proof is nonconstructive and based on a probabilistic method
due to Kuperberg, Lovett and Peled.
author:
- first_name: Kai‐Uwe
full_name: Schmidt, Kai‐Uwe
last_name: Schmidt
- first_name: Charlene
full_name: Weiß, Charlene
id: '70420'
last_name: Weiß
citation:
ama: Schmidt K, Weiß C. Existence of small ordered orthogonal arrays. Journal
of Combinatorial Designs. 2023;31(9):422-431. doi:10.1002/jcd.21903
apa: Schmidt, K., & Weiß, C. (2023). Existence of small ordered orthogonal arrays.
Journal of Combinatorial Designs, 31(9), 422–431. https://doi.org/10.1002/jcd.21903
bibtex: '@article{Schmidt_Weiß_2023, title={Existence of small ordered orthogonal
arrays}, volume={31}, DOI={10.1002/jcd.21903},
number={9}, journal={Journal of Combinatorial Designs}, publisher={Wiley}, author={Schmidt,
Kai‐Uwe and Weiß, Charlene}, year={2023}, pages={422–431} }'
chicago: 'Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal
Arrays.” Journal of Combinatorial Designs 31, no. 9 (2023): 422–31. https://doi.org/10.1002/jcd.21903.'
ieee: 'K. Schmidt and C. Weiß, “Existence of small ordered orthogonal arrays,” Journal
of Combinatorial Designs, vol. 31, no. 9, pp. 422–431, 2023, doi: 10.1002/jcd.21903.'
mla: Schmidt, Kai‐Uwe, and Charlene Weiß. “Existence of Small Ordered Orthogonal
Arrays.” Journal of Combinatorial Designs, vol. 31, no. 9, Wiley, 2023,
pp. 422–31, doi:10.1002/jcd.21903.
short: K. Schmidt, C. Weiß, Journal of Combinatorial Designs 31 (2023) 422–431.
date_created: 2024-01-08T14:25:28Z
date_updated: 2024-01-08T14:38:53Z
department:
- _id: '100'
doi: 10.1002/jcd.21903
intvolume: ' 31'
issue: '9'
language:
- iso: eng
page: 422-431
publication: Journal of Combinatorial Designs
publication_status: published
publisher: Wiley
status: public
title: Existence of small ordered orthogonal arrays
type: journal_article
user_id: '70420'
volume: 31
year: '2023'
...
---
_id: '50300'
abstract:
- lang: eng
text: Digital communications relies heavily on the usage of different types of codes.
Prominent codes nowadays are rank-metric codes and subspace codes - the q-analogs
of binary codes and binary codes with constant weight. All these codes can be
viewed as subsets of classical association schemes. A central coding-theoretic
problem is to derive upper bounds for the size of codes. This thesis investigates
Delsartes powerful linear program whose optimum is precisely such a bound for
codes in association schemes. The linear programs for binary codes and binary
constant-weight codes have been extensively studied since the 1970s, but their
optimum is still unknown. We determine in a unified way the optimum of the linear
program in several ordinary q-analogs as well as in their affine counterparts.
In particular, bounds and constructions for codes in polar spaces are established,
where the bounds are sharp up to a constant factor in many cases. Moreover, based
on these results, an almost complete classification of Steiner systems in polar
spaces is provided by showing that they could only exist in some corner cases.
author:
- first_name: Charlene
full_name: Weiß, Charlene
id: '70420'
last_name: Weiß
citation:
ama: Weiß C. Linear Programming Bounds in Classical Association Schemes.;
2023. doi:10.17619/UNIPB/1-1672
apa: Weiß, C. (2023). Linear programming bounds in classical association schemes.
https://doi.org/10.17619/UNIPB/1-1672
bibtex: '@book{Weiß_2023, title={Linear programming bounds in classical association
schemes}, DOI={10.17619/UNIPB/1-1672},
author={Weiß, Charlene}, year={2023} }'
chicago: Weiß, Charlene. Linear Programming Bounds in Classical Association Schemes,
2023. https://doi.org/10.17619/UNIPB/1-1672.
ieee: C. Weiß, Linear programming bounds in classical association schemes.
2023.
mla: Weiß, Charlene. Linear Programming Bounds in Classical Association Schemes.
2023, doi:10.17619/UNIPB/1-1672.
short: C. Weiß, Linear Programming Bounds in Classical Association Schemes, 2023.
date_created: 2024-01-08T14:42:12Z
date_updated: 2024-01-08T14:46:14Z
department:
- _id: '100'
doi: 10.17619/UNIPB/1-1672
language:
- iso: eng
status: public
title: Linear programming bounds in classical association schemes
type: dissertation
user_id: '70420'
year: '2023'
...