@article{49529, author = {{Meyer zu Hörste-Bührer, Raphaela}}, journal = {{ Gott – Welt – Mensch, Eine Auseinandersetzung mit Hans-Joachim Höhn}}, pages = {{327 – 338}}, title = {{{Ethik in Beziehungen. Im Gespräch mit Hans-Joachim Höhns „Konturen einer Tugendethik“}}}, 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}}, } @inproceedings{49305, abstract = {{Dieser Tagungsband dokumentiert die Ergebnisse der 30. Jahrestagung des Arbeitskreises Grundschule in der Gesellschaft für Didaktik der Mathematik (GDM), die dieses Mal vom 17. bis zum 19. November 2023 an der Universität Bremen stattfand. Die Tagung stand unter dem Thema ‚Grundlegende Kompetenzen sichern: Lernende und Lehrende im Blick‘. Die Tagung greift damit die immer wieder aktuelle Frage auf, wie der Mathematikunterricht der Grundschule gestaltet werden kann, so dass alle Kinder grundlegende Kompetenzen erwerben und über diese auch sicher und langfristig verfügen. Empirische Studien wie etwa der IQB-Bildungstrend zeigen, dass der Anteil an Kindern, die diese Kompetenzen, die unbestritten für das Weiterlernen in den darauffolgenden Schuljahren und im Beruf relevant sind, am Ende ihrer Grundschulzeit (noch) nicht besitzen, größer wird. Weiter setzten sich acht Arbeitsgruppen mit den Themenfeldern ‚Arithmetik‘, ‚Geometrie‘, ‚Sachrechnen‘, ‚Daten, Zufall und Wahrscheinlichkeit‘, ‚Kommunikation & Kooperation‘, ‚PriMaMedien: Lernen, Lehren und Forschen mit digitalen Medien‘, ‚Frühe mathematische Bildung‘ sowie ‚Lehrkräftebildung‘ intensiv mit aktuellen Forschungs- und Praxisfragen auseinander. Die zentralen Inhalte der Arbeitsgruppen sind in diesem Band ebenfalls dokumentiert.}}, author = {{Wallner, Melina}}, booktitle = {{Grundlegende Kompetenzen sichern: Lernende und Lehrende im Blick}}, editor = {{Steinweg, Anna Susanne}}, isbn = {{9783863099626}}, issn = {{2750-8439}}, pages = {{77--80}}, publisher = {{University of Bamberg Press}}, title = {{{Begriffliches Verständnis von Grundschüler*innen zur Achsensymmetrie}}}, doi = {{10.20378/irb-91231}}, 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}}, } @article{49595, author = {{Fastlabend-Vargas, Daniel and Meyer-Hamme, Johannes}}, journal = {{Geschichtsdidaktisch intervenieren. Beiträge zur Forschungswerkstatt „Geschichtsdidaktik Empirisch“ 2020}}, title = {{{„Fotos, die jede:r kennt“ Eine empirische Untersuchung historischer Kenntnisse anhand von Bildikonen bei Studierenden des Lehramts Geschichte}}}, year = {{2023}}, } @article{49609, abstract = {{The alignment of liquid crystals on surfaces plays a central role in optimizing their performances. In this work, a cutting-edge nano-lithography-based method to control the local orientation of a thermotropic liquid crystal is applied to easily available commercial standard materials and evaluated. Parallel nanogrooves on a substrate, created through 3D nanoprinting in a negative-tone photoresin optimized for two-photon polymerization are used for this purpose. Azimuthal anchoring energies of the order from 10−6 J/m2 to 10−5 J/m2 are found, depending on the spacing, width and depth of the grooves. In part, these values are larger than those reported previously for another photopolymer. Both uniform alignment and spatial patterns of different alignment directions can be realized. Electro-optic studies confirm the suitability of the method for electrically addressable photonic applications and indicate strong polar anchoring.}}, author = {{Zhang, Bingru and Plidschun, Malte and Schmidt, Markus A. and Kitzerow, Heinz-Siegfried}}, issn = {{2159-3930}}, journal = {{Optical Materials Express}}, keywords = {{Electronic, Optical and Magnetic Materials}}, number = {{12}}, publisher = {{Optica Publishing Group}}, title = {{{Anchoring and electro-optic switching of liquid crystals on nano-structured surfaces fabricated by two-photon based nano-printing}}}, doi = {{10.1364/ome.503100}}, volume = {{13}}, year = {{2023}}, } @article{43440, author = {{Zhang, Bingru and Nguyen, Linh and Martens, Kevin and Heuer-Jungemann, Amelie and Philipp, Julian and Kempter, Susanne and Rädler, Joachim O. and Liedl, Tim and Kitzerow, Heinz-Siegfried}}, issn = {{0267-8292}}, journal = {{Liquid Crystals}}, keywords = {{Condensed Matter Physics, General Materials Science, General Chemistry}}, number = {{7-10}}, pages = {{1243--1251}}, publisher = {{Informa UK Limited}}, title = {{{Luminescent DNA-origami nano-rods dispersed in a lyotropic chromonic liquid crystal}}}, doi = {{10.1080/02678292.2023.2188494}}, volume = {{50}}, year = {{2023}}, } @book{49620, editor = {{Schulte Eickholt, Swen and Böker, Ines}}, publisher = {{Königshausen und Neumann}}, title = {{{Interkulturelle Konstellationen in Literaturwissenschaft und Literaturdidaktik. Festschrift für Michael Hofmann.}}}, year = {{2023}}, } @book{49618, editor = {{Schulte Eickholt, Swen and Hofmann, Michael and Esau, Miriam and Patrut, Iulia Karin}}, publisher = {{Wehrhahn}}, title = {{{Der Neue Weltengarten. Jahrbuch für Literatur und Interkulturalität 2022}}}, year = {{2023}}, } @article{49636, abstract = {{Abstract Purpose Wearables serve to quantify the on-court activity in intermittent sports such as field hockey (FH). Based on objective data, benchmarks can be determined to tailor training intensity and volume. Next to average and accumulated values, the most intense periods (MIPs) during competitive FH matches are of special interest, since these quantify the peak intensities players experience throughout the intermittent matches. The aim of this study was to retrospectively compare peak intensities between training and competition sessions in a male FH team competing in the first german division. Methods Throughout an 8-week in-season period, 372 individual activity datasets (144 datasets from competitive sessions) were recorded using the Polar Team Pro sensor (Kempele, Finland). MIPs were calculated applying a rolling window approach with predefined window length (1–5 min) and calculated for Total distance, High-Intensity-Running distance (> 16 km/h), Sprinting distance (> 20 km/h) and Acceleration load. Significant differences between training and competition MIPs were analysed through non-parametric statistical tests (P < 0.05). Results Analyses revealed higher MIPs during competition for all considered outcomes (P < 0.001). Effect size estimation revealed strongest effects for sprinting distance (d = 1.89 to d = 1.22) and lowest effect sizes for acceleration load (d = 0.92 to d = 0.49). Conclusion The present findings demonstrate that peak intensities during training do not reach those experienced during competitive sessions in a male FH team. Training routines such as manipulations of court-dimensions and team sizes might contribute to this discrepancy. Coaches should compare training and competition intensities to recalibrate training routines to optimize athletes’ preparation for competition. }}, author = {{Büchel, Daniel and Döring, Michael and Baumeister, Jochen}}, issn = {{2096-6709}}, journal = {{Journal of Science in Sport and Exercise}}, keywords = {{Nutrition and Dietetics, Rehabilitation, Orthopedics and Sports Medicine, Physical Therapy, Sports Therapy and Rehabilitation, Physiology}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{A Comparison of the Most Intense Periods (MIPs) During Competitive Matches and Training Over an 8-Week Period in a Male Elite Field Hockey Team}}}, doi = {{10.1007/s42978-023-00261-w}}, year = {{2023}}, } @inproceedings{47108, author = {{Gräßler, Iris and Özcan, Deniz and Preuß, Daniel}}, booktitle = {{Design fox X - Beiträge zum 34. DfX-Symposium}}, editor = {{Krause, Dieter and Paetzold-Byhain, Kristin and Wartzack, Sandro}}, location = {{Radebeul}}, pages = {{163 -- 172}}, title = {{{KI-basierte Extrahierung von Anforderungen aus Regularien für die Automobilentwicklung}}}, doi = {{10.35199/dfx2023.17}}, volume = {{34}}, year = {{2023}}, } @article{49634, author = {{Ruiz Alvarado, Isaac Azahel and Zare Pour, Mohammad Amin and Hannappel, Thomas and Schmidt, Wolf Gero}}, issn = {{2469-9950}}, journal = {{Physical Review B}}, number = {{4}}, publisher = {{American Physical Society (APS)}}, title = {{{Structural fingerprints in the reflectance anisotropy of AlInP(001)}}}, doi = {{10.1103/physrevb.108.045410}}, volume = {{108}}, year = {{2023}}, } @inproceedings{49641, author = {{Fallahi, Matin and Arias Cabarcos, Patricia and Strufe, Thorsten}}, booktitle = {{Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security}}, publisher = {{ACM}}, title = {{{Poster: Towards Practical Brainwave-based User Authentication}}}, doi = {{10.1145/3576915.3624399}}, year = {{2023}}, } @misc{49643, author = {{Lammer, Christina}}, publisher = {{KinderJugendmedien.de}}, title = {{{Simone Atangana Bekono: Salomés Zorn (NL: Confrontaties)}}}, year = {{2023}}, } @inbook{49645, author = {{Siemoneit, Johannes Gabriel}}, booktitle = {{Leon Battista Alberti, "De pictura" (lat.). Kunsttheorie – Rhetorik – Narrative / Teoria dell'arte, retorica, narrative}}, editor = {{Wulfram, Hartmut and Schöffberger, Gregor and Baltas, Matthias and Gerhold, Katharina}}, isbn = {{9783515132527}}, pages = {{35--50}}, publisher = {{Franz Steiner Verlag}}, title = {{{Sichtbarer Euklid? Zur Geometrisierung des Bildes in "De pictura"}}}, doi = {{10.25162/9783515132527}}, volume = {{2}}, year = {{2023}}, } @inbook{49644, author = {{Siemoneit, Johannes Gabriel}}, booktitle = {{Der lateinische ›Alexanderroman‹ des Iulius Valerius}}, editor = {{Wulfram, Hartmut}}, isbn = {{9783111091679}}, pages = {{199--219}}, publisher = {{De Gruyter}}, title = {{{Die Zacher-Epitome. Änderungen, Erweiterungen, Auslassungen}}}, doi = {{10.1515/9783111091679-012}}, year = {{2023}}, }