@inproceedings{48838, abstract = {{The majority of algorithms can be controlled or adjusted by parameters. Their values can substantially affect the algorithms’ performance. Since the manual exploration of the parameter space is tedious – even for few parameters – several automatic procedures for parameter tuning have been proposed. Recent approaches also take into account some characteristic properties of the problem instances, frequently termed instance features. Our contribution is the proposal of a novel concept for feature-based algorithm parameter tuning, which applies an approximating surrogate model for learning the continuous feature-parameter mapping. To accomplish this, we learn a joint model of the algorithm performance based on both the algorithm parameters and the instance features. The required data is gathered using a recently proposed acquisition function for model refinement in surrogate-based optimization: the profile expected improvement. This function provides an avenue for maximizing the information required for the feature-parameter mapping, i.e., the mapping from instance features to the corresponding optimal algorithm parameters. The approach is validated by applying the tuner to exemplary evolutionary algorithms and problems, for which theoretically grounded or heuristically determined feature-parameter mappings are available.}}, author = {{Bossek, Jakob and Bischl, Bernd and Wagner, Tobias and Rudolph, Günter}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{978-1-4503-3472-3}}, keywords = {{evolutionary algorithms, model-based optimization, parameter tuning}}, pages = {{1319–1326}}, publisher = {{Association for Computing Machinery}}, title = {{{Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement}}}, doi = {{10.1145/2739480.2754673}}, year = {{2015}}, } @inproceedings{48887, abstract = {{We evaluate the performance of a multi-objective evolutionary algorithm on a class of dynamic routing problems with a single vehicle. In particular we focus on relating algorithmic performance to the most prominent characteristics of problem instances. The routing problem considers two types of customers: mandatory customers must be visited whereas optional customers do not necessarily have to be visited. Moreover, mandatory customers are known prior to the start of the tour whereas optional customers request for service at later points in time with the vehicle already being on its way. The multi-objective optimization problem then results as maximizing the number of visited customers while simultaneously minimizing total travel time. As an a-posteriori evaluation tool, the evolutionary algorithm aims at approximating the related Pareto set for specifically designed benchmarking instances differing in terms of number of customers, geographical layout, fraction of mandatory customers, and request times of optional customers. Conceptional and experimental comparisons to online heuristic procedures are provided.}}, author = {{Meisel, Stephan and Grimme, Christian and Bossek, Jakob and Wölck, Martin and Rudolph, Günter and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference }}, isbn = {{978-1-4503-3472-3}}, keywords = {{combinatorial optimization, metaheuristics, multi-objective optimization, online algorithms, transportation}}, pages = {{425–432}}, publisher = {{Association for Computing Machinery}}, title = {{{Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle}}}, doi = {{10.1145/2739480.2754705}}, year = {{2015}}, } @inproceedings{29608, author = {{Peters, Wilhelm and Wallscheid, Oliver and Böcker, Joachim}}, booktitle = {{European Conference on Power Electronics and Applications (EPE)}}, title = {{{Optimum Efficiency Control of Interior Permanent Magnet Synchronous Motors in Drive Trains of Electric and Hybrid Vehicles}}}, doi = {{10.1109/EPE.2015.7311680}}, year = {{2015}}, } @inproceedings{31368, author = {{Hilgert, Joachim and Hoffmann, Max and Panse, Anja}}, booktitle = {{Tagungsband zum Hansekolloquium zur Hochschuldidaktik der Mathematik.}}, editor = {{Paravicini, Walther and Schnieder, Jörn}}, pages = {{23–26}}, publisher = {{WTM-Verlag}}, title = {{{Kann professorale Lehre tutoriell sein? Ein Modellversuch zur Einführung in mathematisches Denken und Arbeiten}}}, year = {{2015}}, } @book{31373, author = {{Hilgert, Joachim and Hoffmann, Max and Panse, Anja}}, isbn = {{9783662455111}}, publisher = {{Springer}}, title = {{{Einführung in mathematisches Denken und Arbeiten: tutoriell und transparent}}}, doi = {{10.1007/978-3-662-45512-8}}, year = {{2015}}, } @phdthesis{45973, author = {{Kovács, Balázs}}, title = {{{Efficient numerical methods for elliptic and parabolic partial differential equations}}}, doi = {{10.15476/ELTE.2015.076}}, year = {{2015}}, } @inproceedings{33620, author = {{Rezat, Sara and Rezat, Sebastian and Janzen, Sabrina}}, booktitle = {{Beiträge zum Mathematikunterricht 2015. Vorträge auf der 49. Tagung für Didaktik der Mathematik vom 09.02.2015 bis 13.02.2015 in Basel. Band 2}}, editor = {{Caluori, F. and Linneweber-Lammerskitten, H. and Streit, Chr.}}, pages = {{736--739}}, publisher = {{WTM}}, title = {{{Sprachsensibler Umgang mit Textmustern im Mathematikunterricht am Beispiel von Konstruktionsbeschreibungen}}}, year = {{2015}}, } @book{53590, editor = {{Müller-Gridschneder, Daniel and Müller, Wolfgang and Mitra, Subhasish}}, title = {{{Proceedings of the 1st International Workshop on Resiliency in Embedded Electronic Systems}}}, year = {{2015}}, } @inproceedings{54341, author = {{Hesse, Kerstin}}, booktitle = {{Extended Abstract der khdm Conference 2015, 8 Seiten. (Dieser Extended Abstract ist online publiziert als khdm-Report zur khdm Conference 2015.)}}, title = {{{Online Tests for Evaluating Learning Success}}}, year = {{2015}}, } @inproceedings{47233, author = {{Perl, Henning and Dechand, Sergej and Smith, Matthew and Arp, Daniel and Yamaguchi, Fabian and Rieck, Konrad and Fahl, Sascha and Acar, Yasemin}}, booktitle = {{Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security}}, publisher = {{ACM}}, title = {{{VCCFinder: Finding Potential Vulnerabilities in Open-Source Projects to Assist Code Audits}}}, doi = {{10.1145/2810103.2813604}}, year = {{2015}}, } @inproceedings{47232, author = {{Oltrogge, Marten and Acar, Yasemin and Dechand, Sergej and Smith, Matthew and Fahl, Sascha}}, booktitle = {{24th USENIX Security Symposium, USENIX Security 15, Washington, D.C., USA, August 12-14, 2015}}, editor = {{Jung, Jaeyeon and Holz, Thorsten}}, pages = {{239–254}}, publisher = {{USENIX Association}}, title = {{{To Pin or Not to Pin-Helping App Developers Bullet Proof Their TLS Connections}}}, year = {{2015}}, } @inproceedings{46377, abstract = {{We evaluate the performance of a multi-objective evolutionary algorithm on a class of dynamic routing problems with a single vehicle. In particular we focus on relating algorithmic performance to the most prominent characteristics of problem instances. The routing problem considers two types of customers: mandatory customers must be visited whereas optional customers do not necessarily have to be visited. Moreover, mandatory customers are known prior to the start of the tour whereas optional customers request for service at later points in time with the vehicle already being on its way. The multi-objective optimization problem then results as maximizing the number of visited customers while simultaneously minimizing total travel time. As an a-posteriori evaluation tool, the evolutionary algorithm aims at approximating the related Pareto set for specifically designed benchmarking instances differing in terms of number of customers, geographical layout, fraction of mandatory customers, and request times of optional customers. Conceptional and experimental comparisons to online heuristic procedures are provided.}}, author = {{Meisel, Stephan and Grimme, Christian and Bossek, Jakob and Wölck, Martin and Rudolph, Guenter and Trautmann, Heike}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’15)}}, isbn = {{978-1-4503-3472-3}}, pages = {{425–432}}, title = {{{Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle}}}, doi = {{10.1145/2739480.2754705}}, year = {{2015}}, } @inproceedings{35711, author = {{Nofen, Barbara and Temmen, Katrin}}, booktitle = {{2015 IEEE Global Engineering Education Conference (EDUCON)}}, publisher = {{IEEE}}, title = {{{Lecture meets laboratory experimental experiences for large audiences: Results of a first implementation and recommendation}}}, doi = {{10.1109/educon.2015.7095963}}, year = {{2015}}, } @inproceedings{33028, author = {{Solanki, J. and Fröhleke, N. and Böcker, Joachim}}, title = {{{Implementation of Hybrid Filter for 12-Pulse Thyristor Rectifier Supplying High-Current Variable-Voltage DC Load}}}, doi = {{10.1109/TIE.2015.2393833}}, year = {{2015}}, } @article{38437, author = {{Noé, Reinhold and Koch, Benjamin and Sandel, David and Mirvoda, Vitali}}, issn = {{0733-8724}}, journal = {{JOURNAL OF LIGHTWAVE TECHNOLOGY}}, number = {{10}}, pages = {{2127--2138}}, title = {{{Polarization-Dependent Loss: New Definition and Measurement Techniques}}}, doi = {{10.1109/JLT.2014.2386651}}, volume = {{33}}, year = {{2015}}, } @article{38275, author = {{Noé, Reinhold and Koch, Benjamin and Sandel, David and Mirvoda, Vitali}}, journal = {{Journal of Lightwave Technology}}, number = {{10}}, pages = {{2127--2138}}, title = {{{Polarization-Dependent Loss: New Definition and Measurement Techniques}}}, doi = {{10.1109/JLT.2014.2386651}}, volume = {{33}}, year = {{2015}}, } @article{38037, author = {{Rösler, Margit and Voit, Michael}}, issn = {{1815-0659}}, journal = {{Symmetry, Integrability and Geometry: Methods and Applications}}, keywords = {{Geometry and Topology, Mathematical Physics, Analysis}}, number = {{013}}, pages = {{18pp}}, publisher = {{SIGMA (Symmetry, Integrability and Geometry: Methods and Application)}}, title = {{{A Central Limit Theorem for Random Walks on the Dual of a Compact Grassmannian}}}, doi = {{10.3842/sigma.2015.013}}, volume = {{11}}, year = {{2015}}, } @article{40735, author = {{Qian, C. and Huang, L. and Xiao, Y-.H. and So, H. C.}}, journal = {{Signal Processing}}, pages = {{170–178}}, title = {{{Localization of coherent signals without source number knowledge in unknown spatially correlated Gaussian noise}}}, volume = {{111}}, year = {{2015}}, } @article{40736, author = {{Qian, C. and Huang, L. and Xiao, Y-.H. and So, H. C.}}, journal = {{Digital Signal Processing}}, pages = {{68–75}}, title = {{{Two-step reliability test based unitary root-MUSIC for direction-of-arrival estimation}}}, volume = {{44}}, year = {{2015}}, } @inproceedings{40741, author = {{Marrinan, Tim and Beveridge, J. Ross and Draper, Bruce and Kirby, Michael and Peterson, Chris}}, booktitle = {{Numerical Mathematics and Advanced Applications-ENUMATH 2013}}, pages = {{457–465}}, publisher = {{Springer}}, title = {{{Flag Manifolds for the Characterization of Geometric Structure in Large Data Sets}}}, doi = {{10.1007/978-3-319-10705-9_45}}, year = {{2015}}, }