@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}}, } @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}}, } @inproceedings{48873, abstract = {{Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP) heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful in generating satisfactory or even optimal solutions. However, the reasons for their success are not yet fully understood. Recent approaches take an analytical viewpoint and try to identify instance features, which make an instance hard or easy to solve. We contribute to this area by generating instance sets for couples of TSP algorithms A and B by maximizing/minimizing their performance difference in order to generate instances which are easier to solve for one solver and much harder to solve for the other. This instance set offers the potential to identify key features which allow to distinguish between the problem hardness classes of both algorithms.}}, author = {{Bossek, Jakob and Trautmann, Heike}}, booktitle = {{Learning and Intelligent Optimization}}, editor = {{Festa, Paola and Sellmann, Meinolf and Vanschoren, Joaquin}}, isbn = {{978-3-319-50349-3}}, keywords = {{Algorithm selection, Feature selection, Instance hardness, TSP}}, pages = {{48–59}}, publisher = {{Springer International Publishing}}, title = {{{Evolving Instances for Maximizing Performance Differences of State-of-the-Art Inexact TSP Solvers}}}, doi = {{10.1007/978-3-319-50349-3_4}}, year = {{2016}}, } @inbook{51464, author = {{Hilgert, Joachim}}, booktitle = {{Lehren und Lernen von Mathematik in der Studieneingangsphase}}, editor = {{Hoppenbrock, A.}}, publisher = {{Springer Spektrum}}, title = {{{Schwierigkeiten beim Übergang von Schule zu Hochschule im zeitlichen Vergleich - Ein Blick auf Defizite beim Erwerb von Schlüsselkompetenzen}}}, year = {{2016}}, } @inbook{51463, author = {{Hilgert, Joachim and Pasquale, A. and Przebinda, T.}}, booktitle = {{Geometric Methods in Physics}}, editor = {{Kielanowski, P.}}, publisher = {{Birkhäuser}}, title = {{{Resonances for the Laplacian: the cases BC2 and C2 (except SO(p,2) with p>2 odd)}}}, year = {{2016}}, } @article{52803, author = {{Borgwardt, Stefan and Mailis, Theofilos and Peñaloza, Rafael and Turhan, Anni-Yasmin}}, issn = {{1861-2032}}, journal = {{Journal on Data Semantics}}, keywords = {{Artificial Intelligence, Computer Networks and Communications, Information Systems}}, number = {{2}}, pages = {{55--75}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies}}}, doi = {{10.1007/s13740-015-0055-y}}, volume = {{5}}, year = {{2016}}, } @article{45944, author = {{Kovács, Balázs and Power Guerra, Christian Andreas}}, issn = {{0272-4979}}, journal = {{IMA Journal of Numerical Analysis}}, keywords = {{Applied Mathematics, Computational Mathematics, General Mathematics}}, number = {{1}}, pages = {{460--494}}, publisher = {{Oxford University Press (OUP)}}, title = {{{Higher order time discretizations with ALE finite elements for parabolic problems on evolving surfaces}}}, doi = {{10.1093/imanum/drw074}}, volume = {{38}}, year = {{2016}}, } @article{45936, author = {{Kovács, Balázs and Power Guerra, Christian Andreas}}, issn = {{0749-159X}}, journal = {{Numerical Methods for Partial Differential Equations}}, keywords = {{Applied Mathematics, Computational Mathematics, Numerical Analysis, Analysis}}, number = {{4}}, pages = {{1200--1231}}, publisher = {{Wiley}}, title = {{{Error analysis for full discretizations of quasilinear parabolic problems on evolving surfaces}}}, doi = {{10.1002/num.22047}}, volume = {{32}}, year = {{2016}}, } @article{45939, author = {{Kovács, Balázs and Li, Buyang and Lubich, Christian}}, issn = {{0036-1429}}, journal = {{SIAM Journal on Numerical Analysis}}, keywords = {{Numerical Analysis, Applied Mathematics, Computational Mathematics}}, number = {{6}}, pages = {{3600--3624}}, publisher = {{Society for Industrial & Applied Mathematics (SIAM)}}, title = {{{A-Stable Time Discretizations Preserve Maximal Parabolic Regularity}}}, doi = {{10.1137/15m1040918}}, volume = {{54}}, year = {{2016}}, } @article{45937, author = {{Kovács, Balázs and Lubich, Christian}}, issn = {{0272-4979}}, journal = {{IMA Journal of Numerical Analysis}}, keywords = {{Applied Mathematics, Computational Mathematics, General Mathematics}}, number = {{1}}, pages = {{1--39}}, publisher = {{Oxford University Press (OUP)}}, title = {{{Numerical analysis of parabolic problems with dynamic boundary conditions}}}, doi = {{10.1093/imanum/drw015}}, volume = {{37}}, year = {{2016}}, } @inproceedings{45938, author = {{Karátson, J. and Kovács, Balázs}}, booktitle = {{Mathematical Problems in Meteorological Modelling}}, pages = {{57–70}}, title = {{{A Parallel Numerical Solution Approach for Nonlinear Parabolic Systems Arising in Air Pollution Transport Problems}}}, year = {{2016}}, } @inproceedings{53279, author = {{Soleymani, Mohammad and Maham, Behrouz and Ashtiani, Farid}}, booktitle = {{2016 IEEE International Conference on Communications (ICC)}}, publisher = {{IEEE}}, title = {{{Analysis of the downlink saturation throughput of an asymmetric IEEE 802.11n-based WLAN}}}, doi = {{10.1109/icc.2016.7511453}}, year = {{2016}}, } @inproceedings{52575, author = {{Werth, Gerda}}, booktitle = {{Beiträge zum Mathematikunterricht}}, location = {{Heidelberg}}, publisher = {{WTM}}, title = {{{Ziehen und Beweisen mit DGS - Welche Beweiskraft haben für Studierende die Erkenntnisse, die sie im Zugmodus gewinnen?}}}, year = {{2016}}, } @inbook{48396, author = {{Wessel, Lena and Wilhelm, Nadine}}, booktitle = {{Beiträge zum Mathematikunterricht 2016}}, pages = {{1059--1062}}, publisher = {{WTM-Verlag}}, title = {{{Zusammenhänge zwischen Sprachkompetenz und verstehensorientierter Leistung beim Umgang mit Brüchen}}}, year = {{2016}}, } @inproceedings{48417, author = {{Wessel, Lena and Prediger, Susanne and Schüler-Meyer, Alexander and Kuzu, Taha}}, booktitle = {{TSG 32 at 13th International Congress on Mathematical Education, Hamburg, July 2016}}, title = {{{Is grade 7 too late to start with bilingual mathematics courses? An intervention study}}}, year = {{2016}}, } @inproceedings{54340, author = {{Hesse, Kerstin}}, booktitle = {{Hanse-Kolloquium zur Hochschuldidaktik der Mathematik 2015: Beiträge zum gleichnamigen Symposium am 13. & 14. November 2015 an der Universität zu Lübeck (Hochschulschriften zur Mathematik-Didaktik) }}, editor = {{Paravicini, Walther and Schnieder, Jörn}}, pages = {{86--102}}, publisher = {{WTM-Verlag}}, title = {{{Neugestaltung der "Höheren Mathematik A, B und C für Elektrotechniker" -- Nutzung der Lehrmaterialien durch Studierende}}}, year = {{2016}}, }