@inproceedings{11895, abstract = {{Multi-channel speech enhancement algorithms rely on a synchronous sampling of the microphone signals. This, however, cannot always be guaranteed, especially if the sensors are distributed in an environment. To avoid performance degradation the sampling rate offset needs to be estimated and compensated for. In this contribution we extend the recently proposed coherence drift based method in two important directions. First, the increasing phase shift in the short-time Fourier transform domain is estimated from the coherence drift in a Matched Filterlike fashion, where intermediate estimates are weighted by their instantaneous SNR. Second, an observed bias is removed by iterating between offset estimation and compensation by resampling a couple of times. The effectiveness of the proposed method is demonstrated by speech recognition results on the output of a beamformer with and without sampling rate offset compensation between the input channels. We compare MVDR and maximum-SNR beamformers in reverberant environments and further show that both benefit from a novel phase normalization, which we also propose in this contribution.}}, author = {{Schmalenstroeer, Joerg and Heymann, Jahn and Drude, Lukas and Boeddeker, Christoph and Haeb-Umbach, Reinhold}}, booktitle = {{IEEE 19th International Workshop on Multimedia Signal Processing (MMSP)}}, title = {{{Multi-Stage Coherence Drift Based Sampling Rate Synchronization for Acoustic Beamforming}}}, year = {{2017}}, } @inproceedings{45396, author = {{Dröse, Jennifer and Prediger, Susanne}}, booktitle = {{Beiträge zum Mathematikunterricht 2017 }}, editor = {{Kortenkamp, U. and Kuzle, A.}}, pages = {{183--186}}, publisher = {{WTM}}, title = {{{Strategieentwicklung für die Bearbeitung von Textaufgaben}}}, year = {{2017}}, } @inproceedings{11773, abstract = {{In this paper we present an algorithm for the detection of moving targets in sight of an automotive radar sensor which can handle distorted ego-velocity information. In situations where biased or none velocity information is provided from the ego-vehicle, the algorithm is able to estimate the ego-velocity based on previously detected stationary targets with high accuracy, subsequently used for the target classification. Compared to existing ego-velocity algorithms our approach provides fast and efficient inference without sacrificing the practical classification accuracy. Other than that the algorithm is characterized by simple parameterization and little but appropriate model assumptions for high accurate production automotive radar sensors.}}, author = {{Grimm, Christopher and Farhoud, Ridha and Fei, Tai and Warsitz, Ernst and Haeb-Umbach, Reinhold}}, booktitle = {{IEEE Microwaves, Radar and Remote Sensing Symposium (MRRS)}}, title = {{{Detection of Moving Targets in Automotive Radar with Distorted Ego-Velocity Information}}}, year = {{2017}}, } @inproceedings{48863, abstract = {{The novel R package ecr (version 2), short for Evolutionary Computation in R, provides a comprehensive collection of building blocks for constructing powerful evolutionary algorithms for single- and multi-objective continuous and combinatorial optimization problems. It allows to solve standard optimization tasks with few lines of code using a black-box approach. Moreover, rapid prototyping of non-standard ideas is possible via an explicit, white-box approach. This paper describes the design principles of the package and gives some introductory examples on how to use the package in practise.}}, author = {{Bossek, Jakob}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, isbn = {{978-1-4503-4939-0}}, keywords = {{evolutionary optimization, software-tools}}, pages = {{1187–1193}}, publisher = {{Association for Computing Machinery}}, title = {{{Ecr 2.0: A Modular Framework for Evolutionary Computation in R}}}, doi = {{10.1145/3067695.3082470}}, year = {{2017}}, } @inproceedings{48857, abstract = {{While finding minimum-cost spanning trees (MST) in undirected graphs is solvable in polynomial time, the multi-criteria minimum spanning tree problem (mcMST) is NP-hard. Interestingly, the mcMST problem has not been in focus of evolutionary computation research for a long period of time, although, its relevance for real world problems is easy to see. The available and most notable approaches by Zhou and Gen as well as by Knowles and Corne concentrate on solution encoding and on fairly dated selection mechanisms. In this work, we revisit the mcMST and focus on the mutation operators as exploratory components of evolutionary algorithms neglected so far. We investigate optimal solution characteristics to discuss current mutation strategies, identify shortcomings of these operators, and propose a sub-tree based operator which offers what we term Pareto-beneficial behavior: ensuring convergence and diversity at the same time. The operator is empirically evaluated inside modern standard evolutionary meta-heuristics for multi-criteria optimization and compared to hitherto applied mutation operators in the context of mcMST.}}, author = {{Bossek, Jakob and Grimme, Christian}}, booktitle = {{2017 IEEE Symposium Series on Computational Intelligence (SSCI)}}, keywords = {{Convergence, Encoding, Euclidean distance, Evolutionary computation, Heating systems, Optimization, Standards}}, pages = {{1–8}}, title = {{{A Pareto-Beneficial Sub-Tree Mutation for the Multi-Criteria Minimum Spanning Tree Problem}}}, doi = {{10.1109/SSCI.2017.8285183}}, year = {{2017}}, } @inproceedings{48856, abstract = {{There exist many optimal or heuristic priority rules for machine scheduling problems, which can easily be integrated into single-objective evolutionary algorithms via mutation operators. However, in the multi-objective case, simultaneously applying different priorities for different objectives may cause severe disruptions in the genome and may lead to inferior solutions. In this paper, we combine an existing mutation operator concept with new insights from detailed observation of the structure of solutions for multi-objective machine scheduling problems. This allows the comprehensive integration of priority rules to produce better Pareto-front approximations. We evaluate the extended operator concept compared to standard swap mutation and the stand-alone components of our hybrid scheme, which performs best in all evaluated cases.}}, author = {{Bossek, Jakob and Grimme, Christian}}, booktitle = {{2017 IEEE Symposium Series on Computational Intelligence (SSCI)}}, keywords = {{Evolutionary computation, Processor scheduling, Schedules, Scheduling, Sociology, Standards, Statistics}}, pages = {{1–8}}, title = {{{An Extended Mutation-Based Priority-Rule Integration Concept for Multi-Objective Machine Scheduling}}}, doi = {{10.1109/SSCI.2017.8285224}}, year = {{2017}}, } @article{48864, abstract = {{Bossek, (2017), mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem, Journal of Open Source Software, 2(17), 374, doi:10.21105/joss.00374}}, author = {{Bossek, Jakob}}, issn = {{2475-9066}}, journal = {{Journal of Open Source Software}}, number = {{17}}, pages = {{374}}, title = {{{mcMST: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem}}}, doi = {{10.21105/joss.00374}}, volume = {{2}}, year = {{2017}}, } @article{48865, author = {{Bossek, Jakob}}, issn = {{2073-4859}}, journal = {{The R Journal}}, number = {{1}}, pages = {{103–113}}, title = {{{Smoof: Single- and Multi-Objective Optimization Test Functions}}}, volume = {{9}}, year = {{2017}}, } @article{48837, author = {{Bischl, Bernd and Richter, Jakob and Bossek, Jakob and Horn, Daniel and Thomas, Janek and Lang, Michel}}, journal = {{CoRR}}, title = {{{mlrMBO: A Modular Framework for Model-Based Optimization of Expensive Black-Box Functions}}}, year = {{2017}}, } @article{31267, author = {{Guillarmou, Colin and Hilgert, Joachim and Weich, Tobias}}, issn = {{0025-5831}}, journal = {{Mathematische Annalen}}, keywords = {{General Mathematics}}, number = {{3-4}}, pages = {{1231--1275}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Classical and quantum resonances for hyperbolic surfaces}}}, doi = {{10.1007/s00208-017-1576-5}}, volume = {{370}}, year = {{2017}}, } @article{51390, author = {{Hilgert, Joachim and Przebinda, T. and Pasquale, A.}}, journal = {{Representation Theory}}, pages = {{416–457}}, title = {{{Resonances for the Laplacian on Riemannian symmetric spaces: the case of SL(3,R)/SO(3)}}}, doi = {{10.1090/ert/506}}, volume = {{21}}, year = {{2017}}, } @article{51392, author = {{Hilgert, Joachim and Martens, J. and Manon, Ch.}}, journal = {{Inter. Math. Research Notices}}, pages = {{6255–6309}}, title = {{{Contraction of Hamiltonian K-spaces}}}, doi = {{10.1093/imrn/rnw191}}, volume = {{20}}, year = {{2017}}, } @article{51391, author = {{Hilgert, Joachim and Przebinda, T. and Pasquale, A.}}, journal = {{J. Funct. Anal.}}, pages = {{1477--1523}}, title = {{{Resonances for the Laplacian of products of two rank one Riemannian symmetric spaces}}}, volume = {{272}}, year = {{2017}}, } @misc{51576, author = {{Hilgert, Joachim}}, booktitle = {{Mathematische Semesterberichte}}, pages = {{253--254}}, title = {{{Pitici, M. (Ed). The Best Writing on Mathematics 2016 (Princeton University Press, 2017)}}}, volume = {{64}}, year = {{2017}}, } @misc{51575, author = {{Hilgert, Joachim}}, booktitle = {{Mathematische Semesterberichte}}, pages = {{245--247}}, title = {{{Devlin, K. Finding Fibonacci. The Quest to Rediscover the Forgotten Mathematical Genius Who Changed the World (Princeton University Press, 2017)}}}, volume = {{64}}, year = {{2017}}, } @article{45941, author = {{Kovács, Balázs and Li, Buyang and Lubich, Christian and Power Guerra, Christian A.}}, issn = {{0029-599X}}, journal = {{Numerische Mathematik}}, keywords = {{Applied Mathematics, Computational Mathematics}}, number = {{3}}, pages = {{643--689}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Convergence of finite elements on an evolving surface driven by diffusion on the surface}}}, doi = {{10.1007/s00211-017-0888-4}}, volume = {{137}}, year = {{2017}}, } @article{45942, author = {{Kovács, Balázs and Lubich, Christian}}, issn = {{0029-599X}}, journal = {{Numerische Mathematik}}, keywords = {{Applied Mathematics, Computational Mathematics}}, number = {{2}}, pages = {{365--388}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Stability and convergence of time discretizations of quasi-linear evolution equations of Kato type}}}, doi = {{10.1007/s00211-017-0909-3}}, volume = {{138}}, year = {{2017}}, } @article{45940, author = {{Kovács, Balázs and Lubich, Christian}}, issn = {{0029-599X}}, journal = {{Numerische Mathematik}}, keywords = {{Applied Mathematics, Computational Mathematics}}, number = {{1}}, pages = {{91--117}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Stable and convergent fully discrete interior–exterior coupling of Maxwell’s equations}}}, doi = {{10.1007/s00211-017-0868-8}}, volume = {{137}}, year = {{2017}}, } @article{45946, 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 = {{2}}, pages = {{518--554}}, publisher = {{Wiley}}, title = {{{Maximum norm stability and error estimates for the evolving surface finite element method}}}, doi = {{10.1002/num.22212}}, volume = {{34}}, year = {{2017}}, } @article{45943, author = {{Kovács, Balázs}}, issn = {{0272-4979}}, journal = {{IMA Journal of Numerical Analysis}}, keywords = {{Applied Mathematics, Computational Mathematics, General Mathematics}}, number = {{1}}, pages = {{430--459}}, publisher = {{Oxford University Press (OUP)}}, title = {{{High-order evolving surface finite element method for parabolic problems on evolving surfaces}}}, doi = {{10.1093/imanum/drx013}}, volume = {{38}}, year = {{2017}}, }