@misc{49493,
  author       = {{Telaprolu, Vipasyan}},
  title        = {{{Reconstruction of 3D Surfels from Neural Radiance Fields}}},
  year         = {{2023}},
}

@misc{49492,
  author       = {{Friemel, Jonas}},
  title        = {{{Shape Reconfiguration by Hybrid Programmable Matter}}},
  year         = {{2023}},
}

@inproceedings{49361,
  author       = {{Seidenberg, Tobias and Disselkamp, Jan-Philipp and Jürgenhake, Christoph and Wicker, Ansgar and Dumitrescu, Roman and Tolo, Edmund}},
  location     = {{Edingburgh}},
  title        = {{{TCO analysis of a modular and integral product architecture in shipbuilding}}},
  doi          = {{ 10.1109/ICE/ITMC58018.2023.10332277}},
  year         = {{2023}},
}

@inproceedings{49360,
  author       = {{Disselkamp, Jan-Philipp and Seidenberg, Tobias and Jürgenhake, Christoph and Anacker, Harald and Dumitrescu, Roman}},
  location     = {{Edingburgh}},
  title        = {{{Future production of ships – case study for modular high-speed ferries}}},
  doi          = {{ 10.1109/ICE/ITMC58018.2023.10332382}},
  year         = {{2023}},
}

@article{49372,
  author       = {{Klüners, Jürgen and Wang, Jiuya}},
  issn         = {{2730-9657}},
  journal      = {{La Matematica}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Idélic Approach in Enumerating Heisenberg Extensions}}},
  doi          = {{10.1007/s44007-023-00067-w}},
  year         = {{2023}},
}

@inproceedings{48869,
  abstract     = {{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       = {{Bossek, Jakob and Neumann, Aneta and Neumann, Frank}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{9798400701191}},
  keywords     = {{dynamic optimization, evolutionary algorithms, re-optimization, weighted traveling salesperson problem}},
  pages        = {{248–256}},
  publisher    = {{Association for Computing Machinery}},
  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}},
  year         = {{2023}},
}

@inproceedings{48872,
  abstract     = {{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       = {{Bossek, Jakob and Sudholt, Dirk}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  isbn         = {{9798400701191}},
  keywords     = {{quality diversity, runtime analysis}},
  pages        = {{1546–1554}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Runtime Analysis of Quality Diversity Algorithms}}},
  doi          = {{10.1145/3583131.3590383}},
  year         = {{2023}},
}

@inproceedings{48886,
  abstract     = {{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       = {{Marrero, Alejandro and Segredo, Eduardo and Hart, Emma and Bossek, Jakob and Neumann, Aneta}},
  booktitle    = {{Proceedings of the Genetic} and Evolutionary Computation Conference}},
  isbn         = {{9798400701191}},
  keywords     = {{evolutionary computation, instance generation, instance-space analysis, knapsack problem, novelty search}},
  pages        = {{312–320}},
  publisher    = {{Association for Computing Machinery}},
  title        = {{{Generating Diverse and Discriminatory Knapsack Instances by Searching for Novelty in Variable Dimensions of Feature-Space}}},
  doi          = {{10.1145/3583131.3590504}},
  year         = {{2023}},
}

@article{48871,
  abstract     = {{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       = {{Bossek, Jakob and Sudholt, Dirk}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  keywords     = {{Evolutionary algorithms, pseudo-Boolean functions, runtime analysis}},
  pages        = {{113757}},
  title        = {{{Do Additional Target Points Speed Up Evolutionary Algorithms?}}},
  doi          = {{10.1016/j.tcs.2023.113757}},
  year         = {{2023}},
}

@article{48859,
  abstract     = {{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       = {{Bossek, Jakob and Grimme, Christian}},
  issn         = {{1063-6560}},
  journal      = {{Evolutionary Computation}},
  pages        = {{1–35}},
  title        = {{{On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem}}},
  doi          = {{10.1162/evco_a_00335}},
  year         = {{2023}},
}

@article{49425,
  author       = {{Seitz, Simone and Häsel-Weide, Uta and Wilke, Yannik and Wallner, Melina}},
  journal      = {{Teachers and Teaching}},
  pages        = {{1--16}},
  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 }},
  year         = {{2023}},
}

@unpublished{49649,
  author       = {{Igamberdiev, Timour and Vu, Doan Nam Long and Künnecke, Felix and Yu, Zhuo and Holmer, Jannik and Habernal, Ivan}},
  title        = {{{DP-NMT: Scalable Differentially-Private Machine Translation}}},
  year         = {{2023}},
}

@unpublished{49650,
  author       = {{Held, Lena and Habernal, Ivan}},
  title        = {{{LaCour!: Enabling Research on Argumentation in Hearings of the European Court of Human Rights}}},
  year         = {{2023}},
}

@article{49760,
  author       = {{Jakobeit, Darius and Schenke, Maximilian and Wallscheid, Oliver}},
  issn         = {{0885-8993}},
  journal      = {{IEEE Transactions on Power Electronics}},
  keywords     = {{Electrical and Electronic Engineering}},
  number       = {{7}},
  pages        = {{8062--8074}},
  publisher    = {{Institute of Electrical and Electronics Engineers (IEEE)}},
  title        = {{{Meta-Reinforcement-Learning-Based Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range of Power Classes}}},
  doi          = {{10.1109/tpel.2023.3256424}},
  volume       = {{38}},
  year         = {{2023}},
}

@article{48946,
  abstract     = {{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.}},
  author       = {{Gräßler, Iris and Bodden, Eric and Wiechel, Dominik and Pottebaum, Jens}},
  issn         = {{0720-5953}},
  journal      = {{Konstruktion}},
  keywords     = {{Mechanical Engineering, Mechanics of Materials, General Materials Science, Theoretical Computer Science}},
  number       = {{11-12}},
  pages        = {{60--65}},
  publisher    = {{VDI Fachmedien GmbH and Co. KG}},
  title        = {{{Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security}}},
  doi          = {{10.37544/0720-5953-2023-11-12-60}},
  volume       = {{75}},
  year         = {{2023}},
}

@article{48599,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>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, 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.</jats:p>}},
  author       = {{Bauch, David and Siebert, Dustin and Jöns, Klaus and Förstner, Jens and Schumacher, Stefan}},
  issn         = {{2511-9044}},
  journal      = {{Advanced Quantum Technologies}},
  keywords     = {{tet_topic_qd}},
  publisher    = {{Wiley}},
  title        = {{{On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs}}},
  doi          = {{10.1002/qute.202300142}},
  year         = {{2023}},
}

@unpublished{43246,
  abstract     = {{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       = {{Bauch, David and Siebert, Dustin and Jöns, Klaus and Förstner, Jens and Schumacher, Stefan}},
  keywords     = {{tet_topic_phc, tet_topic_qd}},
  title        = {{{On-demand indistinguishable and entangled photons at telecom frequencies using tailored cavity designs}}},
  year         = {{2023}},
}

@inproceedings{34135,
  abstract     = {{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       = {{Lishkova, Yana and Scherer, Paul and Ridderbusch, Steffen and Jamnik, Mateja and Liò, Pietro and Ober-Blöbaum, Sina and Offen, Christian}},
  booktitle    = {{IFAC-PapersOnLine}},
  location     = {{ Yokohama, Japan}},
  number       = {{2}},
  pages        = {{3203--3210}},
  publisher    = {{Elsevier}},
  title        = {{{Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery}}},
  doi          = {{10.1016/j.ifacol.2023.10.1457}},
  volume       = {{56}},
  year         = {{2023}},
}

@inproceedings{46738,
  author       = {{Sadeghi-Kohan, Somayeh and Reimer, Jan Dennis and Hellebrand, Sybille and Wunderlich, Hans-Joachim}},
  booktitle    = {{IEEE Asian Test Symposium (ATS'23), October 2023}},
  title        = {{{Optimizing the Streaming of Sensor Data with Approximate Communication}}},
  year         = {{2023}},
}

@article{50298,
  abstract     = {{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       = {{Schmidt, Kai-Uwe and Weiß, Charlene}},
  journal      = {{Combinatorial Theory}},
  number       = {{1}},
  title        = {{{Packings and Steiner systems in polar spaces}}},
  doi          = {{10.5070/c63160424}},
  volume       = {{3}},
  year         = {{2023}},
}