@article{49101,
  author       = {{Schmitz, E. and Kabst, Rüdiger}},
  journal      = {{PERSONALquartely}},
  title        = {{{Auf der Suche nach dem Sinn: Corporate Social Responsibility}}},
  volume       = {{4}},
  year         = {{2016}},
}

@book{49179,
  editor       = {{Gretz, Daniela and Pethes, Nicolas}},
  publisher    = {{Rombach}},
  title        = {{{Archiv/Fiktionen. Verfahren des Archivierens in Literatur und Kultur des langen 19. Jahrhunderts}}},
  year         = {{2016}},
}

@inbook{49217,
  author       = {{Gretz, Daniela}},
  booktitle    = {{Vergessene Konstellationen literarischer Öffentlichkeit zwischen 1840 und 1885}},
  editor       = {{Mellmann, Katja and Reiling, Jesko}},
  pages        = {{321‒344}},
  publisher    = {{de Gruyter}},
  title        = {{{Happy End im ›Kampf ums Dasein‹? Vergessene Konstellationen von Literatur und Wissen in Kellers Sinngedicht und Raabes Lar}}},
  volume       = {{142}},
  year         = {{2016}},
}

@inbook{49218,
  author       = {{Gretz, Daniela}},
  booktitle    = {{Archiv/Fiktionen. Verfahren des Archivierens in Literatur und Kultur des langen 19. Jahrhunderts}},
  editor       = {{Gretz, Daniela and Pethes, Nicolas}},
  pages        = {{279‒315}},
  publisher    = {{Rombach}},
  title        = {{{›Eine große Zeitungsthat‹: Die serielle Exploration des I/inneren Afrika/s in populären Zeitschriften des 19. Jahrhunderts}}},
  year         = {{2016}},
}

@misc{49287,
  author       = {{Praetorius, Saskia and Al-Kabbani, Daniel and Bohndick, Carla and Hilkenmeier, Johanna and T. König, Sebastian and Salome Müsche, Hanna and Sommer, Sabrina and B. Klingsieck, Katrin}},
  publisher    = {{LibreCat University}},
  title        = {{{Spielend Lehrer/in werden: problembasiertes Lernen mit virtuellen Schülerinnen/Schülern}}},
  doi          = {{10.3217/ZFHE-11-03/14}},
  year         = {{2016}},
}

@article{4237,
  abstract     = {{We report the fabrication of periodically poled domain patterns in x-cut lithium niobate thin-film.
Here, thin films on insulator have drawn particular attention due to their intrinsic waveguiding
properties offering high mode confinement and smaller devices compared to in-diffused waveguides
in bulk material. In contrast to z-cut thin film lithium niobate, the x-cut geometry does not
require back electrodes for poling. Further, the x-cut geometry grants direct access to the largest
nonlinear and electro-optical tensor element, which overall promises smaller devices. The domain
inversion was realized via electric field poling utilizing deposited aluminum top electrodes on a
stack of LN thin film/SiO2 layer/Bulk LN, which were patterned by optical lithography. The periodic
domain inversion was verified by non-invasive confocal second harmonic microscopy. Our
results show domain patterns in accordance to the electrode mask layout. The second harmonic signatures
can be interpreted in terms of spatially, overlapping domain filaments which start their
growth on the þz side.}},
  author       = {{Mackwitz, P. and Rüsing, Michael and Berth, Gerhard and Widhalm, A. and Müller, K. and Zrenner, Artur}},
  issn         = {{0003-6951}},
  journal      = {{Applied Physics Letters}},
  number       = {{15}},
  publisher    = {{AIP Publishing}},
  title        = {{{Periodic domain inversion in x-cut single-crystal lithium niobate thin film}}},
  doi          = {{10.1063/1.4946010}},
  volume       = {{108}},
  year         = {{2016}},
}

@article{4240,
  abstract     = {{Cubic gallium nitride (GaN) films are analyzed with highresolution X-ray diffraction (HRXRD) and Raman spectroscopy. Several cubic GaN layers were grown on 3C-SiC (001) substrate by radio-frequency plasma-assisted molecular beam epitaxy. The layer thickness of the cubic GaN was varied between 75 and 505 nm. The HRXRD analysis reveals a reduction of the full-width at half-maximum (FWHM) of omega scans for growing layer thicknesses, which is caused by a partial compensation of defects. The Raman characterization confirms well-formed c-GaN layers. A more detailed examination of the longitudinal optical mode hints at a correlation of the FWHM of the Raman mode with the dislocation density, which shows the possibility to determine dislocation densities by Ramanspectroscopy on a micrometer scale, which is not possible by HRXRD. Furthermore, this Raman analysis shows that normalized Raman spectra present an alternative way to determine layer thicknesses of thin GaN films.}},
  author       = {{Rüsing, Michael and Wecker, T. and Berth, Gerhard and As, Donat Josef and Zrenner, Artur}},
  issn         = {{0370-1972}},
  journal      = {{physica status solidi (b)}},
  keywords     = {{cubic gallium nitride, dislocation density, HRXRD, Raman spectroscopy}},
  number       = {{4}},
  pages        = {{778--782}},
  publisher    = {{Wiley}},
  title        = {{{Joint Raman spectroscopy and HRXRD investigation of cubic gallium nitride layers grown on 3C-SiC}}},
  doi          = {{10.1002/pssb.201552592}},
  volume       = {{253}},
  year         = {{2016}},
}

@article{10026,
  abstract     = {{Congruent lithium niobate and lithium tantalate mixed crystals have been grown over the complete
compositional range with the Czochralski method. The structural and vibrational properties of the mixed
crystals are studied extensively by x-ray diffraction measurements, Raman spectroscopy, and density functional
theory. The measured lattice parameters and vibrational frequencies are in good agreement with our theoretical
predictions. The observed dependence of the Raman frequencies on the crystal composition is discussed on the
basis of the calculated phonon displacement patterns. The phononic contribution to the static dielectric tensor
is calculated by means of the generalized Lyddane-Sachs-Teller relation. Due to the pronounced dependence of
the optical response on the Ta concentration, lithium niobate tantalate mixed crystals represent a perfect model
system to study the properties of uniaxial mixed ferroelectric materials for application in integrated optics.}},
  author       = {{Rüsing, Michael and Sanna, Simone and Neufeld, Sergej and Berth, Gerhard and Schmidt, Wolf Gero and Zrenner, Artur and Yu, H. and Wang, Y. and Zhang, H.}},
  issn         = {{2469-9950}},
  journal      = {{Physical Review B}},
  title        = {{{Vibrational properties of LiNb1−xTaxO3 mixed crystals}}},
  doi          = {{10.1103/physrevb.93.184305}},
  year         = {{2016}},
}

@book{4639,
  abstract     = {{Bildung findet auf kommunaler Ebene statt. Dies ist der Ort, an dem ganz unterschiedliche Maßnahmen durchgeführt werden, die entweder nach Landesrecht, Bundesrecht oder nach den Vorschriften der Kammern reguliert sind oder aber aufgrund von privatrechtlichen Vereinbarungen zustande kommen. Kommunen sind dabei kein neutraler ‚Austragungsort’ von Bildung. Vielmehr ist das kommunale Bildungsangebot eine ganz wesentliche Größe, wenn es um die Entwicklung von Kommunen geht. Die Attraktivität und die Prosperität einer Stadt oder Gemeinde ist letztlich auch davon abhängig, welche Bildungsangebote sie den Bürgern, aber auch den Betrieben, Verbänden usw. machen kann. So gesehen hat kommunales Bildungsmanagement eine sehr zentrale Funktion zur Unterstützung und Koordination von Bildungsmaßnahmen vor Ort.

Von 2009 bis 2014 hat der Bund mit dem Programm ‚Lernen vor Ort’ den Aufbau eines kommunalen Bildungsmanagements in 36 Kreisen und kreisfreien Städten gefördert. Die vorliegende Studie analysiert die dabei gewonnenen Erfahrungen, verdichtet diese zu einem Konzept des kommunalen Bildungsmanagements und zeigt auf, wie ein erfolgreiches kommunales Bildungsmanagement gewinnbringend auf andere Kommunen transferiert werden kann.}},
  author       = {{Euler, Dieter and Sloane, Peter F. E. and Fäckeler, Sina and Jenert, Tobias Johannes and Losch, Simone and Meier, Christoph and Meier, Karin and Rüschen, Eva and Schröder, Helmut}},
  isbn         = {{978-3-940625-56-4}},
  pages        = {{106}},
  publisher    = {{EUSL}},
  title        = {{{Kommunales Bildungsmanagement - Kernkomponenten und Gelingensbedingungen}}},
  year         = {{2016}},
}

@inproceedings{46364,
  abstract     = {{Automated algorithm configuration procedures play an increasingly important role in the development and application of algorithms for a wide range of computationally challenging problems. Until very recently, these configuration procedures were limited to optimising a single performance objective, such as the running time or solution quality achieved by the algorithm being configured. However, in many applications there is more than one performance objective of interest. This gives rise to the multi-objective automatic algorithm configuration problem, which involves finding a Pareto set of configurations of a given target algorithm that characterises trade-offs between multiple performance objectives. In this work, we introduce MO-ParamILS, a multi-objective extension of the state-of-the-art single-objective algorithm configuration framework ParamILS, and demonstrate that it produces good results on several challenging bi-objective algorithm configuration scenarios compared to a base-line obtained from using a state-of-the-art single-objective algorithm configurator.}},
  author       = {{Blot, A and Hoos, H and Jourdan, L and Marmion, M and Trautmann, Heike}},
  booktitle    = {{LION 2016: Learning and Intelligent Optimization}},
  editor       = {{et al. Joaquin, Vanschooren}},
  pages        = {{32–47}},
  publisher    = {{Springer International Publishing}},
  title        = {{{MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework}}},
  doi          = {{10.1007/978-3-319-50349-3_3}},
  volume       = {{10079}},
  year         = {{2016}},
}

@inbook{46363,
  abstract     = {{The averaged Hausdorff distance has been proposed as an indicator for assessing the quality of finitely sized approximations of the Pareto front of a multiobjective problem. Since many set-based, iterative optimization algorithms store their currently best approximation in an internal archive these approximations are also termed archives. In case of two objectives and continuous variables it is known that the best approximations in terms of averaged Hausdorff distance are subsets of the Pareto front if it is concave. If it is linear or circularly concave the points of the best approximation are equally spaced.

Here, it is proven that the optimal averaged Hausdorff approximation and the Pareto front have an empty intersection if the Pareto front is circularly convex. But the points of the best approximation are equally spaced and they rapidly approach the Pareto front for increasing size of the approximation.}},
  author       = {{Rudolph, G and Schütze, O and Trautmann, Heike}},
  booktitle    = {{Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II}},
  editor       = {{Squillero, G and Burelli, P}},
  isbn         = {{978-3-319-31153-1}},
  pages        = {{42–55}},
  publisher    = {{Springer International Publishing}},
  title        = {{{On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front}}},
  doi          = {{10.1007/978-3-319-31153-1_4}},
  year         = {{2016}},
}

@inproceedings{46369,
  abstract     = {{This paper formally defines multimodality in multiobjective optimization (MO). We introduce a test-bed in which multimodal MO problems with known properties can be constructed as well as numerical characteristics of the resulting landscape. Gradient- and local search based strategies are compared on exemplary problems together with specific performance indicators in the multimodal MO setting. By this means the foundation for Exploratory Landscape Analysis in MO is provided.}},
  author       = {{Kerschke, Pascal and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann, Heike and Emmerich, Michael}},
  booktitle    = {{Proceedings of the 14$^th$ International Conference on Parallel Problem Solving from Nature (PPSN XIV)}},
  pages        = {{962–972}},
  publisher    = {{Springer}},
  title        = {{{Towards Analyzing Multimodality of Multiobjective Landscapes}}},
  doi          = {{10.1007/978-3-319-45823-6_90}},
  year         = {{2016}},
}

@inproceedings{46367,
  abstract     = {{When selecting the best suited algorithm for an unknown optimization problem, it is useful to possess some a priori knowledge of the problem at hand. In the context of single-objective, continuous optimization problems such knowledge can be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically identifies properties of a landscape, e.g., the so-called funnel structures, based on an initial sample. In this paper, we extract the relevant features (for detecting funnels) out of a large set of landscape features when only given a small initial sample consisting of 50 x D observations, where D is the number of decision space dimensions. This is already in the range of the start population sizes of many evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used for training the classifier, and the approach is then very successfully validated on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching competition problems.}},
  author       = {{Kerschke, Pascal and Preuss, Mike and Wessing, Simon and Trautmann, Heike}},
  booktitle    = {{Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary Computation}},
  isbn         = {{978-1-4503-4206-3}},
  pages        = {{229–236}},
  title        = {{{Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models}}},
  doi          = {{10.1145/2908812.2908845}},
  year         = {{2016}},
}

@article{46371,
  abstract     = {{One main task in evolutionary multiobjective optimization (EMO) is to obtain a suitable finite size approximation of the Pareto front which is the image of the solution set, termed the Pareto set, of a given multiobjective optimization problem. In the technical literature, the characteristic of the desired approximation is commonly expressed by closeness to the Pareto front and a sufficient spread of the solutions obtained. In this paper, we first make an effort to show by theoretical and empirical findings that the recently proposed Averaged Hausdorff (or Δ𝑝-) indicator indeed aims at fulfilling both performance criteria for bi-objective optimization problems. In the second part of this paper, standard EMO algorithms combined with a specialized archiver and a postprocessing step based on the Δ𝑝 indicator are introduced which sufficiently approximate the Δ𝑝-optimal archives and generate solutions evenly spread along the Pareto front.}},
  author       = {{Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina, C and Trautmann, Heike}},
  journal      = {{Computational Optimization and Applications (Comput. Optim. Appl.)}},
  number       = {{2}},
  pages        = {{589–618}},
  title        = {{{Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results}}},
  doi          = {{10.1007/s10589-015-9815-8}},
  volume       = {{64}},
  year         = {{2016}},
}

@article{46372,
  abstract     = {{We present a new hybrid evolutionary algorithm for the effective hypervolume approximation of the Pareto front of a given differentiable multi-objective optimization problem. Starting point for the local search (LS) mechanism is a new division of the decision space as we will argue that in each of these regions a different LS strategy seems to be most promising. For the LS in two out of the three regions we will utilize and adapt the Directed Search method which is capable of steering the search into any direction given in objective space and which is thus well suited for the problem at hand. We further on integrate the resulting LS mechanism into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations. Finally, we will present some numerical results on several benchmark problems with two and three objectives indicating the strength and competitiveness of the novel hybrid.}},
  author       = {{Schütze, O and Sosa, Hernandez VA and Trautmann, Heike and Rudolph, G}},
  journal      = {{Journal of Heuristics}},
  number       = {{3}},
  pages        = {{273–300}},
  title        = {{{The Hypervolume based Directed Search Method for Multi-Objective Optimization Problems}}},
  doi          = {{10.1007/s10732-016-9310-0}},
  volume       = {{22}},
  year         = {{2016}},
}

@inproceedings{46368,
  abstract     = {{Exploratory Landscape Analysis (ELA) aims at understanding characteristics of single-objective continuous (black-box) optimization problems in an automated way. Moreover, the approach provides the basis for constructing algorithm selection models for unseen problem instances. Recently, it has gained increasing attention and numerical features have been designed by various research groups. This paper introduces the R-Package FLACCO which makes all relevant features available in a unified framework together with efficient helper functions. Moreover, a case study which gives perspectives to ELA for multi-objective optimization problems is presented.}},
  author       = {{Kerschke, Pascal and Trautmann, Heike}},
  booktitle    = {{Proceedings of the IEEE Congress on Evolutionary Computation (CEC)}},
  title        = {{{The R-Package FLACCO for Exploratory Landscape Analysis with Applications to Multi-Objective Optimization Problems}}},
  doi          = {{10.1109/CEC.2016.7748359}},
  year         = {{2016}},
}

@article{46370,
  abstract     = {{This report documents the talks and discussions at the Dagstuhl Seminar 15211 "Theory of Evolutionary Algorithms". This seminar, now in its 8th edition, is the main meeting point of the highly active theory of randomized search heuristics subcommunities in Australia, Asia, North America, and Europe. Topics intensively discussed include rigorous runtime analysis and computational complexity theory for randomised search heuristics, information geometry of randomised search, and synergies between the theory of evolutionary algorithms and theories of natural evolution.}},
  author       = {{Neumann, F and Trautmann, Heike}},
  journal      = {{Dagstuhl Reports}},
  number       = {{5}},
  pages        = {{78–79}},
  title        = {{{Working Group Report: Bridging the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}}},
  doi          = {{10.4230/DagRep.5.5.57}},
  volume       = {{5}},
  year         = {{2016}},
}

@inproceedings{48309,
  author       = {{Habernal, Ivan and Gurevych, Iryna}},
  booktitle    = {{Proceedings of the 2016 Conference on Empirical Methods in Natural          Language Processing}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{What makes a convincing argument? Empirical analysis and detecting            attributes of convincingness in Web argumentation}}},
  doi          = {{10.18653/v1/d16-1129}},
  year         = {{2016}},
}

@inbook{48339,
  author       = {{Wille, Manuel}},
  booktitle    = {{Kanzlei und Sprachkultur. Beiträge der 8. Tagung des Arbeitskreises Historische Kanzleisprachenforschung, Dresden 3. bis 5. September 2015}},
  editor       = {{Hünecke, Rainer and Aehnelt, Sandra}},
  pages        = {{277 -- 295}},
  publisher    = {{Edition Praesens}},
  title        = {{{Von der Kanzleisprache zur Pressesprache im 'Hamburgischen Correspondenten' und seinen Vorgängern (1712 - 1801)}}},
  volume       = {{Band 9}},
  year         = {{2016}},
}

@inproceedings{11890,
  abstract     = {{In this paper we study the influence of directional radio patterns of Bluetooth low energy (BLE) beacons on smartphone localization accuracy and beacon network planning. A two-dimensional model of the power emission characteristic is derived from measurements of the radiation pattern of BLE beacons carried out in an RF chamber. The Cramer-Rao lower bound (CRLB) for position estimation is then derived for this directional power emission model. With this lower bound on the RMS positioning error the coverage of different beacon network configurations can be evaluated. For near-optimal network planing an evolutionary optimization algorithm for finding the best beacon placement is presented.}},
  author       = {{Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}},
  booktitle    = {{24th European Signal Processing Conference (EUSIPCO 2016)}},
  title        = {{{Investigations into Bluetooth Low Energy Localization Precision Limits}}},
  year         = {{2016}},
}

