@book{18455, editor = {{Müller, Astrid and Tophinke, Doris}}, title = {{{Grammatik entdecken (Praxis Deutsch 282)}}}, volume = {{282}}, year = {{2020}}, } @article{18147, author = {{Tophinke, Doris}}, journal = {{Praxis Deutsch }}, pages = {{53 -- 57}}, title = {{{Installationskunst beschreiben. Die Grammatik des Lokalisierens entdecken}}}, volume = {{282}}, year = {{2020}}, } @article{18149, author = {{Müller, Astrid and Tophinke, Doris}}, journal = {{Praxis Deutsch }}, pages = {{4 -- 13}}, title = {{{Grammatik entdecken (Basisartikel)}}}, volume = {{282}}, year = {{2020}}, } @article{47956, abstract = {{Optically nonlinear Pb2B5O9X (X = Cl, Br) borate halides are an important group of materials for second harmonic generation (SHG). Additionally, they also possess excellent photocatalytic activity and stability in the process of dechlorination of chlorophenols, which are typical persistent organic pollutants. It would be of great interest to conduct in situ (photo‐) catalysis investigations during the whole photocatalytic process by SHG when considering them as photocatalytic materials. In order to get superior photocatalytic efficiency and maximum surface information, small particles are highly desired. Here, a low‐cost and fast synthesis route that allows growing microcrystalline optically nonlinear Pb2B5O9X borate halides at large quantities is introduced. When applying the ionothermal growth process at temperatures between 130 and 170 °C, microcrystallites with an average size of about 1 µm precipitate with an orthorhombic hilgardite‐like borate halide structure. Thorough examinations using powder X‐ray diffraction and scanning electron microscopy, the Pb2B5O9X microcrystals are indicated to be chemically pure and single‐phased. Besides, the Pb2B5O9X borate halides' SHG efficiencies are confirmed using confocal SHG microscopy. The low‐temperature synthesis route thus makes these borate halides a highly desirable material for surface studies such as monitoring chemical reactions with picosecond time resolution and in situ (photo‐) catalysis investigations.}}, author = {{Tan, Deming and Kirbus, Benjamin and Rüsing, Michael and Pietsch, Tobias and Ruck, Michael and Eng, Lukas M.}}, issn = {{1613-6810}}, journal = {{Small}}, keywords = {{Biomaterials, Biotechnology, General Materials Science, General Chemistry}}, number = {{23}}, publisher = {{Wiley}}, title = {{{Resource‐Efficient Low‐Temperature Synthesis of Microcrystalline Pb2B5O9X (X = Cl, Br) for Surfaces Studies by Optical Second Harmonic Generation}}}, doi = {{10.1002/smll.202000857}}, volume = {{16}}, year = {{2020}}, } @article{47958, abstract = {{High-fidelity periodic poling over long lengths is required for robust, quasi-phase-matched second-harmonic generation using the fundamental, quasi-TE polarized waveguide modes in a thin-film lithium niobate (TFLN) waveguide. Here, a shallow-etched ridge waveguide is fabricated in x-cut magnesium oxide doped TFLN and is poled accurately over 5 mm. The high fidelity of the poling is demonstrated over long lengths using a non-destructive technique of confocal scanning second-harmonic microscopy. We report a second-harmonic conversion efficiency of up to 939 %/W (length-normalized conversion efficiency 3757 %/Wcm²), measured at telecommunications wavelengths. The device demonstrates a narrow spectral linewidth (1 nm) and can be tuned precisely with a tuning characteristic of 0.1 nm/°C, over at least 40 °C without measurable loss of efficiency.}}, author = {{Zhao, Jie and Rüsing, Michael and Javid, Usman A. and Ling, Jingwei and Li, Mingxiao and Lin, Qiang and Mookherjea, Shayan}}, issn = {{1094-4087}}, journal = {{Optics Express}}, keywords = {{Atomic and Molecular Physics, and Optics}}, number = {{13}}, publisher = {{Optica Publishing Group}}, title = {{{Shallow-etched thin-film lithium niobate waveguides for highly-efficient second-harmonic generation}}}, doi = {{10.1364/oe.395545}}, volume = {{28}}, year = {{2020}}, } @phdthesis{48272, abstract = {{In der Forschungsarbeit wird die Zeitungskommunikation des 18. Jahrhunderts aus sprachwissenschaftlicher Perspektive untersucht. Es wird gezeigt, wie sich das Textsortenrepertoire der Zeitung weiterentwickelte, welche sprachlichen Wandelprozesse stattfanden und wie die Zeitung übergreifend allmählich zu einem Massenmedium avancierte. Der textlinguistische Zugang auf die Zeitungssprache wird an den relevanten Stellen ergänzt durch einschlägige Erkenntnisse aus der historischen Presseforschung und der linguistischen Kulturanalyse. So wird etwa nachgezeichnet, wie sich die Zeitungsschreiber im Laufe des Jahrhunderts immer stärker von den Einflüssen der Kanzleisprachen lösten und Formulierungsstrategien etablierten, die auf die Anforderungen des journalistischen Berichtens abgestimmt waren. Mit diesen und weiteren Ergebnissen wird der Versuch angestellt, eine Forschungslücke der Sprachgeschichtsforschung zu schließen, in der die Zeitungen des 18. Jahrhunderts bisher lediglich randständig untersucht wurden.}}, author = {{Wille, Manuel}}, isbn = {{978-3-347-16354-6}}, keywords = {{text linguistics, newspaper, Hamburgischer Correspondent, Textlinguistik, Sprachgeschichte, Textsortenwandel, Korpuslinguistik}}, pages = {{450}}, publisher = {{tredition GmbH, Halenreie 40-44, 22359 Hamburg}}, title = {{{Die Tageszeitung des 18. Jahrhunderts auf dem Weg zum Massenmedium}}}, doi = {{10.17619/UNIPB/1-1079}}, volume = {{15}}, year = {{2020}}, } @inbook{30954, author = {{Schuster, Britt-Marie}}, booktitle = {{Handbuch Brief. Von der Frühen Neuzeit bis zur Gegenwart (Bd. 1: Interdisziplinarität – Systematische Perspektiven – Briefgenres)}}, editor = {{Matthews-Schlinzig, Marie Isabel and Schuster, Jörg and Steinbrink , Gesa and Strobel , Jochen }}, keywords = {{Textsortengeschichte}}, pages = {{19–39}}, publisher = {{de Gruyter}}, title = {{{Linguistik des Briefs}}}, volume = {{1}}, year = {{2020}}, } @inbook{31120, author = {{Schuster, Britt-Marie}}, booktitle = {{Science Communication (Handbooks of Communication Science)}}, editor = {{Leßmöllmann, Annette and Dascal , Marcelo and Gloning , Thomas }}, keywords = {{Fachkommunikation}}, pages = {{167--186}}, publisher = {{de Gruyter}}, title = {{{The contribution of terminology research to the understanding of science communication}}}, volume = {{17}}, year = {{2020}}, } @inbook{31129, author = {{Schuster, Britt-Marie and Markewitz, Friedrich and Wilk, Nicole M. }}, booktitle = {{Diskurs – ethisch.}}, editor = {{Kämper, Heidrun and Warnke, Ingo H}}, keywords = {{Textsemantik}}, pages = {{9–32}}, title = {{{Was bedeutet Ehre? Diskursethische Überlegungen zu den BBC-Reden Thomas Manns}}}, year = {{2020}}, } @inproceedings{20766, abstract = {{Recently, the source separation performance was greatly improved by time-domain audio source separation based on dual-path recurrent neural network (DPRNN). DPRNN is a simple but effective model for a long sequential data. While DPRNN is quite efficient in modeling a sequential data of the length of an utterance, i.e., about 5 to 10 second data, it is harder to apply it to longer sequences such as whole conversations consisting of multiple utterances. It is simply because, in such a case, the number of time steps consumed by its internal module called inter-chunk RNN becomes extremely large. To mitigate this problem, this paper proposes a multi-path RNN (MPRNN), a generalized version of DPRNN, that models the input data in a hierarchical manner. In the MPRNN framework, the input data is represented at several (>_ 3) time-resolutions, each of which is modeled by a specific RNN sub-module. For example, the RNN sub-module that deals with the finest resolution may model temporal relationship only within a phoneme, while the RNN sub-module handling the most coarse resolution may capture only the relationship between utterances such as speaker information. We perform experiments using simulated dialogue-like mixtures and show that MPRNN has greater model capacity, and it outperforms the current state-of-the-art DPRNN framework especially in online processing scenarios.}}, author = {{Kinoshita, Keisuke and von Neumann, Thilo and Delcroix, Marc and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}}, booktitle = {{Proc. Interspeech 2020}}, pages = {{2652--2656}}, title = {{{Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation}}}, doi = {{10.21437/Interspeech.2020-2388}}, year = {{2020}}, } @inproceedings{23513, author = {{Gräßler, Iris and Pottebaum, Jens and Scholle, Philipp and Thiele, Henrik}}, booktitle = {{ISPIM Conference Proceedings; 7. - 10. Jun. 2020}}, pages = {{1--9}}, publisher = {{International Society for Professional Innovation Management (ISPIM)}}, title = {{{Innovation management and strategic planning of innovative self-preparednes and self-Protection services}}}, 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}}, } @book{49915, editor = {{Autsch, Sabiene and Pickartz, Tim}}, title = {{{Impulse 5. Texte und Bilder zur Kunstvermittlung: Go West! Kunst- und Ausstellungsszene New York 2019.}}}, year = {{2020}}, } @article{33411, author = {{Kißling, Magdalena}}, journal = {{Der Deutschunterricht }}, pages = {{72--76}}, title = {{{Die weiße Frau als Kulturträgerin? Postkoloniale Perspektiven auf Geschlecht am Beispiel von Wolfgang Koeppens Tauben im Gras}}}, volume = {{1}}, year = {{2020}}, } @inbook{50313, author = {{Autsch, Sabiene}}, booktitle = {{Impulse 5. Texte und Bilder zur Kunstvermittlung: Go West! Kunst- und Ausstellungsszene New York 2019}}, editor = {{Autsch, Sabiene and Pickartz, Tim}}, title = {{{Ästhetische Forschung des Urbanen}}}, year = {{2020}}, }