@inbook{31356, author = {{Elit, Stefan}}, booktitle = {{Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)}}, editor = {{Bremer, Kai and Elit, Stefan}}, pages = {{39--55}}, title = {{{Typen der deutschsprachigen Versepik 1745/1848}}}, year = {{2020}}, } @inbook{31562, author = {{Egidi, Margreth}}, booktitle = {{Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) }}, editor = {{Gerok-Reiter, Annette and Lahr, Anna-Sara and Leidinger, Simone}}, pages = {{377--393}}, title = {{{„Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“}}}, year = {{2020}}, } @article{33389, abstract = {{Abstract Purpose Space flight and bed rest (BR) lead to a rapid decline in exercise capacity. Whey protein plus potassium bicarbonate diet-supplementation (NUTR) could attenuate this effect by improving oxidative metabolism. We evaluated the impact of 21-day BR and NUTR on fatigue resistance of plantar flexor muscles (PF) during repeated shortening contractions, and whether any change was related to altered energy metabolism and muscle oxygenation. Methods Ten healthy men received a standardized isocaloric diet with (n = 5) or without (n = 5) NUTR. Eight bouts of 24 concentric plantar flexions (30 s each bout) with 20 s rest between bouts were employed. PF muscle size was assessed by means of peripheral quantitative computed tomography. PF muscle volume was assessed with magnetic resonance imaging. PF muscle force, contraction velocity, power and surface electromyogram signals were recorded during each contraction, as well as energy metabolism (31P nuclear magnetic resonance spectroscopy) and oxygenation (near-infrared spectroscopy). Cardiopulmonary parameters were measured during an incremental cycle exercise test. Results BR caused 10–15% loss of PF volume that was partly recovered 3 days after re-ambulation, as a consequence of fluid redistribution. Unexpectedly, PF fatigue resistance was not affected by BR or NUTR. BR induced a shift in muscle metabolism toward glycolysis and some signs of impaired muscle oxygen extraction. NUTR did not attenuate the BR-induced-shift in energy metabolism. Conclusions Twenty-one days’ BR did not impair PF fatigue resistance, but the shift to glycolytic metabolism and indications of impaired oxygen extraction may be early signs of developing reduced muscle fatigue resistance. }}, author = {{Bosutti, Alessandra and Mulder, Edwin and Zange, Jochen and Bühlmeier, Judith and Ganse, Bergita and Degens, Hans}}, issn = {{1439-6319}}, journal = {{European Journal of Applied Physiology}}, keywords = {{Physiology (medical), Public Health, Environmental and Occupational Health, Orthopedics and Sports Medicine, General Medicine, Public Health, Environmental and Occupational Health, Physiology}}, number = {{5}}, pages = {{969--983}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Effects of 21 days of bed rest and whey protein supplementation on plantar flexor muscle fatigue resistance during repeated shortening contractions}}}, doi = {{10.1007/s00421-020-04333-5}}, volume = {{120}}, year = {{2020}}, } @inbook{32679, author = {{Steigerwald, Jörn}}, booktitle = {{Der Essay als 'neue Form' }}, editor = {{Mahler, Andreas}}, pages = {{65--82}}, publisher = {{Harrassowitz}}, title = {{{Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays ("Essais" I.20; III.5)}}}, year = {{2020}}, } @article{34092, abstract = {{Block copolymer (BCP) self-assembly is a promising tool for next generation lithography as microphase separated polymer domains in thin films can act as templates for surface nanopatterning with sub-20 nm features. The replicated patterns can, however, only be as precise as their templates. Thus, the investigation of the morphology of polymer domains is of great importance. Commonly used analytical techniques (neutron scattering, scanning force microscopy) either lack spatial information or nanoscale resolution. Using advanced analytical (scanning) transmission electron microscopy ((S)TEM), we provide real space information on polymer domain morphology and interfaces between polystyrene (PS) and polymethylmethacrylate (PMMA) in cylinder- and lamellae-forming BCPs at highest resolution. This allows us to correlate the internal structure of polymer domains with line edge roughnesses, interface widths and domain sizes. STEM is employed for high-resolution imaging, electron energy loss spectroscopy and energy filtered TEM (EFTEM) spectroscopic imaging for material identification and EFTEM thickness mapping for visualisation of material densities at defects. The volume fraction of non-phase separated polymer species can be analysed by EFTEM. These methods give new insights into the morphology of polymer domains the exact knowledge of which will allow to improve pattern quality for nanolithography.}}, author = {{Bürger, Julius and Kunnathully, Vinay and Kool, Daniel and Lindner, Jörg and Brassat, Katharina}}, issn = {{2079-4991}}, journal = {{Nanomaterials}}, keywords = {{General Materials Science, General Chemical Engineering}}, number = {{1}}, publisher = {{MDPI AG}}, title = {{{Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM}}}, doi = {{10.3390/nano10010141}}, volume = {{10}}, year = {{2020}}, } @article{23468, abstract = {{AbstractThe value of models is well recognised in product and systems engineering. Modelling languages and diagrams are used to capture mental models and to handle model complexity. Literature research indicates that there are only very few approaches to utilise the potential of virtual and augmented reality for supporting tasks in model based (systems) engineering. The paper at hand contributes a new morphology of intuitive interaction for Immersive Abstraction as a holistic approach to extend that coverage. It presents a holistic framework to categorise solutions and future research directions.}}, author = {{Gräßler, Iris and Pottebaum, Jens}}, issn = {{2633-7762}}, journal = {{Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020}}, pages = {{1295--1304}}, publisher = {{Cambridge University Press}}, title = {{{Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models}}}, doi = {{10.1017/dsd.2020.158}}, volume = {{Band 1}}, year = {{2020}}, } @inproceedings{16790, author = {{Krings, Sarah Claudia and Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor}}, booktitle = {{Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)}}, isbn = {{978-1-4503-7984-7/20/06}}, title = {{{Development Framework for Context-Aware Augmented Reality Applications}}}, doi = {{10.1145/3393672.3398640}}, year = {{2020}}, } @inproceedings{48847, abstract = {{Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite graphs more efficiently by using dynamic optimization. In our approach the graph instance is given incrementally such that the EA can reoptimize its coloring when a new edge introduces a conflict. We show that, when edges are inserted in a way that preserves graph connectivity, Randomized Local Search (RLS) efficiently finds a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS and other EAs need exponential expected time in a static optimization scenario. We investigate different ways of building up the graph by popular graph traversals such as breadth-first-search and depth-first-search and analyse the resulting runtime behavior. We further show that offspring populations (e. g. a (1 + {$\lambda$}) RLS) lead to an exponential speedup in {$\lambda$}. Finally, an island model using 3 islands succeeds in an optimal time of {$\Theta$}(m) on every m-edge bipartite graph, outperforming offspring populations. This is the first example where an island model guarantees a speedup that is not bounded in the number of islands.}}, author = {{Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-7128-5}}, keywords = {{dynamic optimization, evolutionary algorithms, running time analysis, theory}}, pages = {{1277–1285}}, publisher = {{Association for Computing Machinery}}, title = {{{More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization}}}, doi = {{10.1145/3377930.3390174}}, year = {{2020}}, } @inproceedings{48851, abstract = {{Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows to study precisely the increase in difficulty caused by weight dependence. We provide a 3.59-approximation for this weight dependent version of TSP with metric distances and bounded positive weights. Furthermore, we conduct experimental investigations for simple randomized local search with classical mutation operators and two variants of the state-of-the-art evolutionary algorithm EAX adapted to the weighted TSP. Our results show the impact of the node weights on the position of the nodes in the resulting tour.}}, author = {{Bossek, Jakob and Casel, Katrin and Kerschke, Pascal and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-7128-5}}, keywords = {{dynamic optimization, evolutionary algorithms, running time analysis, theory}}, pages = {{1286–1294}}, publisher = {{Association for Computing Machinery}}, title = {{{The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics}}}, doi = {{10.1145/3377930.3390243}}, year = {{2020}}, } @inproceedings{48845, abstract = {{In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.}}, author = {{Bossek, Jakob and Grimme, Christian and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-7128-5}}, keywords = {{decision making, dynamic optimization, evolutionary algorithms, multi-objective optimization, vehicle routing}}, pages = {{166–174}}, publisher = {{Association for Computing Machinery}}, title = {{{Dynamic Bi-Objective Routing of Multiple Vehicles}}}, doi = {{10.1145/3377930.3390146}}, year = {{2020}}, } @inproceedings{48850, abstract = {{Sequential model-based optimization (SMBO) approaches are algorithms for solving problems that require computationally or otherwise expensive function evaluations. The key design principle of SMBO is a substitution of the true objective function by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO algorithms are intrinsically modular, leaving the user with many important design choices. Significant research efforts go into understanding which settings perform best for which type of problems. Most works, however, focus on the choice of the model, the acquisition function, and the strategy used to optimize the latter. The choice of the initial sampling strategy, however, receives much less attention. Not surprisingly, quite diverging recommendations can be found in the literature. We analyze in this work how the size and the distribution of the initial sample influences the overall quality of the efficient global optimization (EGO) algorithm, a well-known SMBO approach. While, overall, small initial budgets using Halton sampling seem preferable, we also observe that the performance landscape is rather unstructured. We furthermore identify several situations in which EGO performs unfavorably against random sampling. Both observations indicate that an adaptive SMBO design could be beneficial, making SMBO an interesting test-bed for automated algorithm design.}}, author = {{Bossek, Jakob and Doerr, Carola and Kerschke, Pascal}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-7128-5}}, keywords = {{continuous black-box optimization, design of experiments, initial design, sequential model-based optimization}}, pages = {{778–786}}, publisher = {{Association for Computing Machinery}}, title = {{{Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB}}}, doi = {{10.1145/3377930.3390155}}, year = {{2020}}, } @inproceedings{48879, abstract = {{Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this area of research by examining evolutionary diversity optimisation approaches for the classical Traveling Salesperson Problem (TSP). We study the impact of using different diversity measures for a given set of tours and the ability of evolutionary algorithms to obtain a diverse set of high quality solutions when adopting these measures. Our studies show that a large variety of diverse high quality tours can be achieved by using our approaches. Furthermore, we compare our approaches in terms of theoretical properties and the final set of tours obtained by the evolutionary diversity optimisation algorithm.}}, author = {{Do, Anh Viet and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-7128-5}}, keywords = {{diversity maximisation, evolutionary algorithms, travelling salesperson problem}}, pages = {{681–689}}, publisher = {{Association for Computing Machinery}}, title = {{{Evolving Diverse Sets of Tours for the Travelling Salesperson Problem}}}, doi = {{10.1145/3377930.3389844}}, year = {{2020}}, } @inproceedings{48895, abstract = {{Evolutionary algorithms (EAs) are general-purpose problem solvers that usually perform an unbiased search. This is reasonable and desirable in a black-box scenario. For combinatorial optimization problems, often more knowledge about the structure of optimal solutions is given, which can be leveraged by means of biased search operators. We consider the Minimum Spanning Tree (MST) problem in a single- and multi-objective version, and introduce a biased mutation, which puts more emphasis on the selection of edges of low rank in terms of low domination number. We present example graphs where the biased mutation can significantly speed up the expected runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate that bias can lead to exponential runtime if "heavy" edges are necessarily part of an optimal solution. However, on general graphs in the single-objective setting, we show that a combined mutation operator which decides for unbiased or biased edge selection in each step with equal probability exhibits a polynomial upper bound - as unbiased mutation - in the worst case and benefits from bias if the circumstances are favorable.}}, author = {{Roostapour, Vahid and Bossek, Jakob and Neumann, Frank}}, booktitle = {{Proceedings of the 2020 Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-7128-5}}, keywords = {{biased mutation, evolutionary algorithms, minimum spanning tree problem, runtime analysis}}, pages = {{551–559}}, publisher = {{Association for Computing Machinery}}, title = {{{Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}}}, doi = {{10.1145/3377930.3390168}}, year = {{2020}}, } @inbook{49831, author = {{Diedrich, Alena}}, booktitle = {{Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext}}, editor = {{Bremer, Kai and Elit, Stefan and Kroucheva, Katerina}}, publisher = {{Metzler}}, title = {{{Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic}}}, year = {{2020}}, } @inproceedings{16852, author = {{Groth, Stefan and Grünewald, Daniel and Teich, Jürgen and Hannig, Frank}}, booktitle = {{Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '2020)}}, location = {{Catania, Sicily, Italy}}, publisher = {{ACM}}, title = {{{A Runtime System for Finite Element Methods in a Partitioned Global Address Space}}}, doi = {{10.1145/3387902.3392628}}, year = {{2020}}, } @misc{53670, author = {{Janus, Richard}}, booktitle = {{Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet}}, editor = {{Zimmermann, Mirjam and Lindner, Heike}}, publisher = {{Deutsche Bibelgesellschaft}}, title = {{{Populäre Kultur}}}, doi = {{10.23768/wirelex.Populre_Kultur.200213}}, year = {{2020}}, } @inbook{41076, author = {{Schroeter-Wittke, Harald and Flath, Beate and König, Bernhard and Venus, Viktoria}}, booktitle = {{Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente}}, editor = {{Helmke, Julia and Rentsch, Stefanie}}, isbn = {{9783579082134 }}, pages = {{101--106}}, publisher = {{Gütersloher Verlagshaus}}, title = {{{Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019}}}, year = {{2020}}, } @inbook{54254, author = {{Janus, Richard}}, booktitle = {{Reformation fmit Beethoven feiern. 31. Oktober 2020}}, editor = {{Janus, Richard}}, pages = {{12--13}}, title = {{{Beethoven und seine Zeit}}}, volume = {{1}}, year = {{2020}}, } @book{54253, editor = {{Janus, Richard}}, pages = {{16}}, title = {{{Reformation mit Beethoven feiern. 31. Oktober 2020}}}, volume = {{1}}, year = {{2020}}, } @inproceedings{46323, abstract = {{In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier.}}, author = {{Bossek, Jakob and Grimme, Christian and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)}}, pages = {{166–174}}, publisher = {{ACM}}, title = {{{Dynamic Bi-Objective Routing of Multiple Vehicles}}}, year = {{2020}}, }