@article{48986,
  author       = {{Heisler, Dietmar and Lüttke, Daniela}},
  issn         = {{0005-9536}},
  journal      = {{Berufsbildung}},
  pages        = {{47--49}},
  publisher    = {{wbv Publikation}},
  title        = {{{Ursachen vorzeitiger Vertragslösungen im Spannungsfeld von statistischer Beschreibung und Praxis}}},
  doi          = {{10.3278/bb2303w014}},
  volume       = {{77}},
  year         = {{2023}},
}

@article{47921,
  abstract     = {{<jats:p> The relationship between nonfinancial reporting and real sustainable change within and beyond organizations is fraught with complication. Furthermore, all facets of the relationship have not been examined equally. The contributions of this special issue made substantive progress in this regard and draw our focus to several remaining complications—in particular, the societal impacts of nonfinancial reporting. With this introduction, we seek to move the conversation forward by proposing a framework that disentangles the linkages between nonfinancial reporting and real sustainable change at multiple levels of analysis. We highlight the distinction between sustainability-related outputs and outcomes that typically materialize at the firm level, and eventually lead to sustainable impact at the societal level. Future research should advance this distinction and scrutinize the impact of real sustainable change beyond firm-level outputs, study the organizational change processes from antecedents to impacts, and examine the interrelationships between different instruments to foster real sustainable change. </jats:p>}},
  author       = {{Hahn, Rüdiger and Reimsbach, Daniel and Wickert, Christopher}},
  issn         = {{1086-0266}},
  journal      = {{Organization &amp; Environment}},
  keywords     = {{Organizational Behavior and Human Resource Management, General Environmental Science}},
  number       = {{1}},
  pages        = {{3--16}},
  publisher    = {{SAGE Publications}},
  title        = {{{Nonfinancial Reporting and Real Sustainable Change: Relationship Status—It’s Complicated}}},
  doi          = {{10.1177/10860266231151653}},
  volume       = {{36}},
  year         = {{2023}},
}

@article{47922,
  abstract     = {{<jats:p>This year, the 7th edition of the Dutch Accounting Research Conference (DARC) was hosted by the Nijmegen School of Management at Radboud University on Thursday, March 23. In total, over 75 accounting researchers from various Dutch universities were welcomed by Frank Hartmann, chair of the accounting group and head of the Business Economics department. During the day, four keynote speakers presented their research and in a panel discussion, the current state of accounting education was debated. In the evening, participants gathered to network over dinner. This article presents a discussion of the theme of the conference, an outline of the research papers and projects presented during the conference, and a summary of the panel discussion on Accounting Education.</jats:p>}},
  author       = {{De Meyst, Karen and Niederkofler, Thomas and Reimsbach, Daniel}},
  issn         = {{2543-1684}},
  journal      = {{Maandblad voor Accountancy en Bedrijfseconomie}},
  keywords     = {{General Arts and Humanities}},
  number       = {{5/6}},
  pages        = {{153--155}},
  publisher    = {{Amsterdam University Press}},
  title        = {{{﻿DARC 2023 at Radboud University: Societal challenges in accounting research and education}}},
  doi          = {{10.5117/mab.97.107215}},
  volume       = {{97}},
  year         = {{2023}},
}

@article{49515,
  author       = {{Güldenpenning, Iris and Jackson, Robin C. and Weigelt, Matthias}},
  issn         = {{1469-0292}},
  journal      = {{Psychology of Sport and Exercise}},
  keywords     = {{Applied Psychology}},
  publisher    = {{Elsevier BV}},
  title        = {{{Action outcome probability influences the size of the head-fake effect in basketball}}},
  doi          = {{10.1016/j.psychsport.2023.102467}},
  volume       = {{68}},
  year         = {{2023}},
}

@article{49516,
  abstract     = {{<jats:p>In this article, we present RISE—a <jats:bold>R</jats:bold>obotics <jats:bold>I</jats:bold>ntegration and <jats:bold>S</jats:bold>cenario-Management <jats:bold>E</jats:bold>xtensible-Architecture—for designing human–robot dialogs and conducting <jats:italic>Human–Robot Interaction</jats:italic> (HRI) studies. In current HRI research, interdisciplinarity in the creation and implementation of interaction studies is becoming increasingly important. In addition, there is a lack of reproducibility of the research results. With the presented open-source architecture, we aim to address these two topics. Therefore, we discuss the advantages and disadvantages of various existing tools from different sub-fields within robotics. Requirements for an architecture can be derived from this overview of the literature, which 1) supports interdisciplinary research, 2) allows reproducibility of the research, and 3) is accessible to other researchers in the field of HRI. With our architecture, we tackle these requirements by providing a <jats:italic>Graphical User Interface</jats:italic> which explains the robot behavior and allows introspection into the current state of the dialog. Additionally, it offers controlling possibilities to easily conduct <jats:italic>Wizard of Oz</jats:italic> studies. To achieve transparency, the dialog is modeled explicitly, and the robot behavior can be configured. Furthermore, the modular architecture offers an interface for external features and sensors and is expandable to new robots and modalities.</jats:p>}},
  author       = {{Groß, André and Schütze, Christian and Brandt, Mara and Wrede, Britta and Richter, Birte}},
  issn         = {{2296-9144}},
  journal      = {{Frontiers in Robotics and AI}},
  keywords     = {{Artificial Intelligence, Computer Science Applications}},
  publisher    = {{Frontiers Media SA}},
  title        = {{{RISE: an open-source architecture for interdisciplinary and reproducible human–robot interaction research}}},
  doi          = {{10.3389/frobt.2023.1245501}},
  volume       = {{10}},
  year         = {{2023}},
}

@inbook{49547,
  author       = {{Hansen, Christin}},
  booktitle    = {{Sieh dir die Menschen an! Das neusachliche Typenporträt in der Weimarer Zeit}},
  pages        = {{43--49}},
  title        = {{{Bilder vor unseren Augen – Bilder in unseren Köpfen. Stereotype und Geschichte}}},
  year         = {{2023}},
}

@article{49559,
  author       = {{Schlieper, Hendrik}},
  issn         = {{2628-9849}},
  journal      = {{Literaturwissenschaftliches Jahrbuch}},
  keywords     = {{Literature and Literary Theory}},
  number       = {{1}},
  pages        = {{167--190}},
  publisher    = {{Duncker & Humblot GmbH}},
  title        = {{{Pazifizierende Toleranz. Wolmar und die Domestizierung der Affekte in Rousseaus Nouvelle Héloïse}}},
  doi          = {{10.3790/ljb.64.1.167}},
  volume       = {{64}},
  year         = {{2023}},
}

@inproceedings{47812,
  author       = {{Hagemann, Philipp and Wagner, Alexander}},
  location     = {{Vienna}},
  pages        = {{58--68}},
  title        = {{{Lunchables. Über den Zusammenhang von Essen und Klasse}}},
  doi          = {{10.60531/insightout.2023.1.7}},
  volume       = {{insightOut. Feminist and Queer Perspectives on Food, 1}},
  year         = {{2023}},
}

@article{47999,
  author       = {{Hagemann, Philipp}},
  journal      = {{Zeitschrift für Didaktik der Philosophie und Ethik }},
  pages        = {{98--106}},
  title        = {{{Zum Stellenwert von Leibniz in Schulbüchern des Philosophie- und Ethikunterrichts}}},
  volume       = {{3}},
  year         = {{2023}},
}

@article{49565,
  author       = {{Ebersold, Felix and Hechelmann, Ron-Hendrik and Holzapfel, Peter and Meschede, Henning}},
  issn         = {{2590-1745}},
  journal      = {{Energy Conversion and Management: X}},
  keywords     = {{Energy Engineering and Power Technology, Fuel Technology, Nuclear Energy and Engineering, Renewable Energy, Sustainability and the Environment}},
  publisher    = {{Elsevier BV}},
  title        = {{{Carbon insetting as a measure to raise supply chain energy efficiency potentials: Opportunities and challenges}}},
  doi          = {{10.1016/j.ecmx.2023.100504}},
  volume       = {{20}},
  year         = {{2023}},
}

@inproceedings{49560,
  author       = {{Stieren, Stephan and Wichtrup, Moritz and Henke, Christian and Trächtler, Ansgar}},
  booktitle    = {{NEIS - Conference on Sustainable Energy Supply and Energy Storage Systems}},
  location     = {{Hamburg}},
  title        = {{{Concept for a cloud-based holistic energy management of domestic appliances to stabilize the energy supply and the power grid}}},
  year         = {{2023}},
}

@misc{49543,
  author       = {{Meyer zu Hörste-Bührer, Raphaela}},
  booktitle    = {{Theologische Literaturzeitschrift 2023/1}},
  pages        = {{83--85}},
  title        = {{{Rezension zu Gunther Wenz: Im Werden begriffen. Zur Lehre vom Menschen bei Pannenberg und Hegel. Pannenberg Studien 7, Göttingen: Vandenhoeck & Ruprecht 2021}}},
  year         = {{2023}},
}

@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     = {{<jats:p>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 &amp; 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.</jats:p>}},
  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}},
}

