@article{10267,
author = {Bräuning, M. and Hüllermeier, Eyke and Keller, T. and Glaum, M.},
journal = {European Journal of Operational Research},
number = {1},
pages = {295--306},
title = {{Lexicographic preferences for predictive modeling of human decision making. A new machine learning method with an application in accounting}},
volume = {258},
year = {2017},
}
@article{10692,
author = {Shen, Cong and Kaufmann, Paul and Braun, Martin},
journal = {Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)},
title = {{Three-Stage Power System Restoration Methodology Considering Renewable Energies}},
year = {2017},
}
@misc{1073,
author = {Nachtigall, Simon},
publisher = {Universität Paderborn},
title = {{Sortieren dynamischer Daten}},
year = {2017},
}
@inproceedings{10762,
author = {Kaufmann, Paul and Kalkreuth, Roman},
booktitle = {Genetic and Evolutionary Computation (GECCO), Compendium},
publisher = {ACM},
title = {{An Empirical Study on the Parametrization of Cartesian Genetic Programming}},
doi = {10.1145/3067695.3075980},
year = {2017},
}
@inproceedings{113,
abstract = {We study the computation of approximate pure Nash equilibria in Shapley value (SV) weighted congestion games, introduced in [19]. This class of games considers weighted congestion games in which Shapley values are used as an alternative (to proportional shares) for distributing the total cost of each resource among its users. We focus on the interesting subclass of such games with polynomial resource cost functions and present an algorithm that computes approximate pure Nash equilibria with a polynomial number of strategy updates. Since computing a single strategy update is hard, we apply sampling techniques which allow us to achieve polynomial running time. The algorithm builds on the algorithmic ideas of [7], however, to the best of our knowledge, this is the first algorithmic result on computation of approximate equilibria using other than proportional shares as player costs in this setting. We present a novel relation that approximates the Shapley value of a player by her proportional share and vice versa. As side results, we upper bound the approximate price of anarchy of such games and significantly improve the best known factor for computing approximate pure Nash equilibria in weighted congestion games of [7].},
author = {Feldotto, Matthias and Gairing, Martin and Kotsialou, Grammateia and Skopalik, Alexander},
booktitle = {Proceedings of the 13th International Conference on Web and Internet Economics (WINE)},
title = {{Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games}},
doi = {10.1007/978-3-319-71924-5_14},
year = {2017},
}
@misc{118,
author = {Chi Banh, Ngoc},
publisher = {Universität Paderborn},
title = {{An Asynchronous Adaptation of a Churn-resistant Overlay Network}},
year = {2017},
}
@inproceedings{11809,
abstract = {This paper presents an end-to-end training approach for a beamformer-supported multi-channel ASR system. A neural network which estimates masks for a statistically optimum beamformer is jointly trained with a network for acoustic modeling. To update its parameters, we propagate the gradients from the acoustic model all the way through feature extraction and the complex valued beamforming operation. Besides avoiding a mismatch between the front-end and the back-end, this approach also eliminates the need for stereo data, i.e., the parallel availability of clean and noisy versions of the signals. Instead, it can be trained with real noisy multichannel data only. Also, relying on the signal statistics for beamforming, the approach makes no assumptions on the configuration of the microphone array. We further observe a performance gain through joint training in terms of word error rate in an evaluation of the system on the CHiME 4 dataset.},
author = {Heymann, Jahn and Drude, Lukas and Boeddeker, Christoph and Hanebrink, Patrick and Haeb-Umbach, Reinhold},
booktitle = {Proc. IEEE Intl. Conf. on Acoustics, Speech and Signal Processing (ICASSP)},
title = {{BEAMNET: End-to-End Training of a Beamformer-Supported Multi-Channel ASR System}},
year = {2017},
}
@article{11811,
abstract = {Acoustic beamforming can greatly improve the performance of Automatic Speech Recognition (ASR) and speech enhancement systems when multiple channels are available. We recently proposed a way to support the model-based Generalized Eigenvalue beamforming operation with a powerful neural network for spectral mask estimation. The enhancement system has a number of desirable properties. In particular, neither assumptions need to be made about the nature of the acoustic transfer function (e.g., being anechonic), nor does the array configuration need to be known. While the system has been originally developed to enhance speech in noisy environments, we show in this article that it is also effective in suppressing reverberation, thus leading to a generic trainable multi-channel speech enhancement system for robust speech processing. To support this claim, we consider two distinct datasets: The CHiME 3 challenge, which features challenging real-world noise distortions, and the Reverb challenge, which focuses on distortions caused by reverberation. We evaluate the system both with respect to a speech enhancement and a recognition task. For the first task we propose a new way to cope with the distortions introduced by the Generalized Eigenvalue beamformer by renormalizing the target energy for each frequency bin, and measure its effectiveness in terms of the PESQ score. For the latter we feed the enhanced signal to a strong DNN back-end and achieve state-of-the-art ASR results on both datasets. We further experiment with different network architectures for spectral mask estimation: One small feed-forward network with only one hidden layer, one Convolutional Neural Network and one bi-directional Long Short-Term Memory network, showing that even a small network is capable of delivering significant performance improvements.},
author = {Heymann, Jahn and Drude, Lukas and Haeb-Umbach, Reinhold},
journal = {Computer Speech and Language},
title = {{A Generic Neural Acoustic Beamforming Architecture for Robust Multi-Channel Speech Processing}},
year = {2017},
}
@inproceedings{11772,
abstract = {In this paper, we present a hypothesis test for the classification of moving targets in the sight of an automotive radar sensor. For this purpose, a statistical model of the relative velocity between a stationary target and the radar sensor has been developed. With respect to the statistical properties a confidence interval is calculated and targets with relative velocity lying outside this interval are classified as moving targets. Compared to existing algorithms our approach is able to give robust classification independent of the number of observed moving targets and is characterized by an instantaneous classification, a simple parameterization of the model and an automatic calculation of the discriminating threshold.},
author = {Grimm, Christopher and Breddermann, Tobias and Farhoud, Ridha and Fei, Tai and Warsitz, Ernst and Haeb-Umbach, Reinhold},
booktitle = {IEEE International conference on microwave, communications, anthenas and electronic systems (COMCAS)},
title = {{Hypothesis Test for the Detection of Moving Targets in Automotive Radar}},
year = {2017},
}
@article{13278,
author = {Fingerhut, Robin and Chen, Wei-Lin and Schedemann, Andre and Cordes, Wilfried and Rarey, Jürgen and Hsieh, Chieh-Ming and Vrabec, Jadran and Lin, Shiang-Tai},
journal = {Industrial & Engineering Chemistry Research},
number = {35},
pages = {9868--9884},
title = {{Comprehensive Assessment of COSMO-SAC Models for Predictions of Fluid-Phase Equilibria}},
doi = {10.1021/acs.iecr.7b01360},
volume = {56},
year = {2017},
}
@article{13280,
author = {Muñoz-Muñoz, Y. Mauricio and Hsieh, Chieh-Ming and Vrabec, Jadran},
journal = {The Journal of Physical Chemistry B},
number = {21},
pages = {5374--5384},
title = {{Understanding the Differing Fluid Phase Behavior of Cyclohexane + Benzene and Their Hydroxylated or Aminated Forms}},
doi = {10.1021/acs.jpcb.7b02494},
volume = {121},
year = {2017},
}
@article{13348,
author = {Luk, Samuel M. H. and Lewandowski, P. and Kwong, N. H. and Baudin, E. and Lafont, O. and Tignon, J. and Leung, P. T. and Chan, Ch. K. P. and Babilon, M. and Schumacher, Stefan and Binder, R.},
issn = {0740-3224},
journal = {Journal of the Optical Society of America B},
number = {1},
title = {{Theory of optically controlled anisotropic polariton transport in semiconductor double microcavities}},
doi = {10.1364/josab.35.000146},
volume = {35},
year = {2017},
}
@article{13242,
abstract = {Initial state-selected reaction probabilities for the H+CH4→H2+CH3 reaction on a recently developed potential energy surface which employs neutral network fitting based on permutational invariant polynomials are reported. The quantum dynamics calculations use the quantum transition state concept and the multi-layer multi-configurational time-dependent Hartree approach and study the reaction process in full-dimensionality for vanishing total angular momentum. A detailed comparison with previous results obtained on other high-level potential energy surfaces is given. The connection between the level of quantum state resolution and the sensitivity of the results on differences in the potential energy surfaces is highlighted. Employing a decomposition of the total reactivity into contributions of the different vibrational states of the activated complex, it is found that differences between the potential energy surfaces are mainly related to the umbrella motion of the methyl group.},
author = {Ellerbrock, Roman and Manthe, Uwe},
issn = {0301-0104},
journal = {Chemical Physics},
pages = {106 -- 112},
title = {{H+CH4→H2+CH3 Initial State-Selected Reaction Probabilities on Different Potential Energy Surfaces}},
doi = {https://doi.org/10.1016/j.chemphys.2016.08.032},
volume = {482},
year = {2017},
}
@inproceedings{120,
abstract = {Within software engineering, requirements engineering starts from imprecise and vague user requirements descriptions and infers precise, formalized specifications. Techniques, such as interviewing by requirements engineers, are typically applied to identify the user’s needs. We want to partially automate even this first step of requirements elicitation by methods of evolutionary computation. The idea is to enable users to specify their desired software by listing examples of behavioral descriptions. Users initially specify two lists of operation sequences, one with desired behaviors and one with forbidden behaviors. Then, we search for the appropriate formal software specification in the form of a deterministic finite automaton. We solve this problem known as grammatical inference with an active coevolutionary approach following Bongard and Lipson [2]. The coevolutionary process alternates between two phases: (A) additional training data is actively proposed by an evolutionary process and the user is interactively asked to label it; (B) appropriate automata are then evolved to solve this extended grammatical inference problem. Our approach leverages multi-objective evolution in both phases and outperforms the state-of-the-art technique [2] for input alphabet sizes of three and more, which are relevant to our problem domain of requirements specification.},
author = {Wever, Marcel Dominik and van Rooijen, Lorijn and Hamann, Heiko},
booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference (GECCO)},
pages = {1327----1334},
title = {{Active Coevolutionary Learning of Requirements Specifications from Examples}},
doi = {10.1145/3071178.3071258},
year = {2017},
}
@inproceedings{12016,
author = {Hagenauer, Florian and Sommer, Christoph and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko},
booktitle = {Proceedings of the 2nd ACM International Workshop on Smart, Autonomous, and Connected Vehicular Systems and Services - CarSys '17},
isbn = {9781450351461},
title = {{Vehicular Micro Clouds as Virtual Edge Servers for Efficient Data Collection}},
doi = {10.1145/3131944.3133937},
year = {2017},
}
@article{13418,
author = {Sanna, Simone and Schmidt, Wolf Gero},
issn = {0953-8984},
journal = {Journal of Physics: Condensed Matter},
title = {{LiNbO3 surfaces from a microscopic perspective}},
doi = {10.1088/1361-648x/aa818d},
year = {2017},
}
@article{13420,
author = {Nozaki, Daijiro and Schmidt, Wolf Gero},
issn = {0192-8651},
journal = {Journal of Computational Chemistry},
pages = {1685--1692},
title = {{Current density analysis of electron transport through molecular wires in open quantum systems}},
doi = {10.1002/jcc.24812},
volume = {38},
year = {2017},
}
@article{13425,
author = {Rohrmüller, M. and Schmidt, Wolf Gero and Gerstmann, Uwe},
issn = {2469-9950},
journal = {Physical Review B},
number = {12},
title = {{Electron paramagnetic resonance calculations for hydrogenated Si surfaces}},
doi = {10.1103/physrevb.95.125310},
volume = {95},
year = {2017},
}
@misc{13110,
author = {Hagengruber, Ruth},
title = {{Bergès, Sandrine; Coffee, Alan (Eds.). The Social and Political Philosophy of Mary Wollstonecraft. Oxford University Press, 2017.}},
year = {2017},
}
@inproceedings{125,
abstract = {Searching for other participants is one of the most important operations in a distributed system.We are interested in topologies in which it is possible to route a packet in a fixed number of hops until it arrives at its destination.Given a constant $d$, this paper introduces a new self-stabilizing protocol for the $q$-ary $d$-dimensional de Bruijn graph ($q = \sqrt[d]{n}$) that is able to route any search request in at most $d$ hops w.h.p., while significantly lowering the node degree compared to the clique: We require nodes to have a degree of $\mathcal O(\sqrt[d]{n})$, which is asymptotically optimal for a fixed diameter $d$.The protocol keeps the expected amount of edge redirections per node in $\mathcal O(\sqrt[d]{n})$, when the number of nodes in the system increases by factor $2^d$.The number of messages that are periodically sent out by nodes is constant.},
author = {Feldmann, Michael and Scheideler, Christian},
booktitle = {Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)},
isbn = {978-3-319-69083-4},
pages = {250--264 },
publisher = {Springer, Cham},
title = {{A Self-Stabilizing General De Bruijn Graph}},
doi = {10.1007/978-3-319-69084-1_17},
volume = {10616},
year = {2017},
}