@inproceedings{29432, author = {{Wenger, T. and Ober-Blöbaum, Sina and Leyendecker, S. }}, booktitle = {{International Conference of Numerical Analysis and Applied Mathematics (ICNAAM)}}, title = {{{Constrained Galerkin variational integrators and modified constrained symplectic Runge-Kutta methods}}}, year = {{2016}}, } @inproceedings{29433, author = {{Peitz, Sebastian and Ober-Blöbaum, Sina and Dellnitz, M.}}, booktitle = {{Proceedings of International Congress of Theoretical and Applied Mechanics}}, title = {{{Reduced order model based multiobjective optimal control of fluids}}}, year = {{2016}}, } @inproceedings{29436, author = {{Stellato, B. and Ober-Blöbaum, Sina and Goulart, P.J. }}, booktitle = {{2016 IEEE 55th Conference on Decision and Control (CDC)}}, pages = {{7228--7233}}, title = {{{Optimal control of switching times in switched linear systems}}}, year = {{2016}}, } @article{31274, author = {{Borthwick, David and Weich, Tobias}}, issn = {{1664-039X}}, journal = {{Journal of Spectral Theory}}, keywords = {{Geometry and Topology, Mathematical Physics, Statistical and Nonlinear Physics}}, number = {{2}}, pages = {{267--329}}, publisher = {{European Mathematical Society - EMS - Publishing House GmbH}}, title = {{{Symmetry reduction of holomorphic iterated function schemes and factorization of Selberg zeta functions}}}, doi = {{10.4171/jst/125}}, volume = {{6}}, year = {{2016}}, } @article{31289, author = {{Weich, Tobias}}, issn = {{1424-0637}}, journal = {{Annales Henri Poincaré}}, keywords = {{Mathematical Physics, Nuclear and High Energy Physics, Statistical and Nonlinear Physics}}, number = {{1}}, pages = {{37--52}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{On the Support of Pollicott–Ruelle Resonanant States for Anosov Flows}}}, doi = {{10.1007/s00023-016-0514-5}}, volume = {{18}}, year = {{2016}}, } @article{33343, abstract = {{Using an operator-theoretic framework in a Hilbert-space setting, we perform a detailed spectral analysis of the one-dimensional Laplacian in a bounded interval, subject to specific non-self-adjoint connected boundary conditions modelling a random jump from the boundary to a point inside the interval. In accordance with previous works, we find that all the eigenvalues are real. As the new results, we derive and analyse the adjoint operator, determine the geometric and algebraic multiplicities of the eigenvalues, write down formulae for the eigenfunctions together with the generalised eigenfunctions and study their basis properties. It turns out that the latter heavily depend on whether the distance of the interior point to the centre of the interval divided by the length of the interval is rational or irrational. Finally, we find a closed formula for the metric operator that provides a similarity transform of the problem to a self-adjoint operator.}}, author = {{Kolb, Martin and Krejčiřík, David}}, journal = {{Mathematische Zeitschrift}}, pages = {{877--900}}, publisher = {{Springer}}, title = {{{Spectral analysis of the diffusion operator with random jumps from the boundary}}}, doi = {{https://link.springer.com/content/pdf/10.1007/s00209-016-1677-y.pdf}}, volume = {{284}}, year = {{2016}}, } @article{33357, abstract = {{In this note we investigate the behaviour of Brownian motion conditioned on a growth constraint of its local time which has been previously investigated by Berestycki and Benjamini. For a class of non-decreasing positive functions f(t);t>0, we consider the Wiener measure under the condition that the Brownian local time is dominated by the function f up to time T. In the case where f(t)/t3/2 is integrable we describe the limiting process as T goes to infinity. Moreover, we prove two conjectures in [BB10] in the case for a class of functions f, for which f(t)/t3/2 just fails to be integrable. Our methodology is more general as it relies on the study of the asymptotic of the probability of subordinators to stay above a given curve. Immediately or with adaptations one can study questions like the Brownian motioned conditioned on a growth constraint of its local time at the maximum or more generally a Levy process conditioned on a growth constraint of its local time at the maximum or at zero. We discuss briefly the former. }}, author = {{Kolb, Martin and Savov, Mladen}}, journal = {{The Annals of Probability}}, number = {{6}}, publisher = {{Institute of Mathematical Statistics}}, title = {{{Transience and recurrence of a Brownian path with limited local time}}}, doi = {{http://dx.doi.org/10.1214/15-AOP1069}}, volume = {{44}}, year = {{2016}}, } @inproceedings{137, abstract = {{Wikidata is the new, large-scale knowledge base of the Wikimedia Foundation. Its knowledge is increasingly used within Wikipedia itself and various other kinds of information systems, imposing high demands on its integrity.Wikidata can be edited by anyone and, unfortunately, it frequently gets vandalized, exposing all information systems using it to the risk of spreading vandalized and falsified information. In this paper, we present a new machine learning-based approach to detect vandalism in Wikidata.We propose a set of 47 features that exploit both content and context information, and we report on 4 classifiers of increasing effectiveness tailored to this learning task. Our approach is evaluated on the recently published Wikidata Vandalism Corpus WDVC-2015 and it achieves an area under curve value of the receiver operating characteristic, ROC-AUC, of 0.991. It significantly outperforms the state of the art represented by the rule-based Wikidata Abuse Filter (0.865 ROC-AUC) and a prototypical vandalism detector recently introduced by Wikimedia within the Objective Revision Evaluation Service (0.859 ROC-AUC).}}, author = {{Heindorf, Stefan and Potthast, Matthias and Stein, Benno and Engels, Gregor}}, booktitle = {{Proceedings of the 25th International Conference on Information and Knowledge Management (CIKM 2016)}}, pages = {{327----336}}, title = {{{Vandalism Detection in Wikidata}}}, doi = {{10.1145/2983323.2983740}}, year = {{2016}}, } @inproceedings{24266, abstract = {{Recently electronic-photonic integrated circuits (EPIC) technology platforms became available [1] which allow fabrication of very compact and fast monolithic receivers. However, although the cointegration of electronics and photonics on the same chip allows for novel circuit topologies which could help to improve circuit performance quite often transmitter and receiver circuit design is using more or less conventional approaches. We propose a novel architecture that effectively utilizes the benefits of the EPIC technology such as: very short interconnects between the photodiode and the amplifier, symmetrical and compact photodiode structure with low operating voltages. Our architecture shown in Fig. 1 features fully-differential input stage, automatic biasing of the photodiode, DC coupling between diode and transimpedance amplifier (TIA) and very small footprint.}}, author = {{Gudyriev, Sergiy and Scheytt, Christoph and Meister, Stefan and Knoll, Dieter and Lischke, Stefan and Zimmermann, Lars and Meuer, Christian}}, booktitle = {{IEEE Group IV Photonics Conference}}, title = {{{ Low-Power, Ultra-compact, Fully-differential 40Gbps Direct Detection Receiver in 0.25μm Photonic BiCMOS SiGe Technology}}}, doi = {{10.1109/GROUP4.2016.7739126}}, year = {{2016}}, } @inproceedings{24267, author = {{Scheytt, Christoph}}, booktitle = {{Microelectronics Seminar}}, title = {{{Recent Advances in Millimeter-Wave-and Electronic-Photonic System-on-Chip Design}}}, year = {{2016}}, } @inbook{2978, author = {{Blömer, Johannes and Bujna, Kathrin}}, booktitle = {{Advances in Knowledge Discovery and Data Mining}}, isbn = {{9783319317496}}, issn = {{0302-9743}}, pages = {{296--308}}, publisher = {{Springer International Publishing}}, title = {{{Adaptive Seeding for Gaussian Mixture Models}}}, doi = {{10.1007/978-3-319-31750-2_24}}, year = {{2016}}, } @inproceedings{47588, author = {{Jonas-Ahrend, Gabriela and Thikomirov, Dmitri}}, booktitle = {{Digitale Vernetzung der Facharbeit}}, editor = {{Vollmer, T. and Schwenger, U.}}, location = {{Karlsruhe}}, pages = {{225--235}}, publisher = {{W. Bertelsmann Verlag GmbH & Co KG}}, title = {{{Lehrerbildung im Mechatronik Studium an der Hochschule Hamm-Lippstadt}}}, volume = {{43}}, year = {{2016}}, } @article{3888, abstract = {{We successfully developed a process to fabricate freestanding cubic aluminium nitride (c-AlN) membranes containing cubic gallium nitride (c-GaN) quantum dots (QDs). The samples were grown by plasma assisted molecular beam epitaxy (MBE). To realize the photonic crystal (PhC) membrane we have chosen a triangular array of holes. The array was fabricated by electron beam lithography and several steps of reactive ion etching (RIE) with the help of a hard mask and an undercut of the active layer. The r/a- ratio of 0.35 was deter- mined by numerical simulations to obtain a preferably wide photonic band gap. Micro-photoluminescence (μ-PL) measurements of the photonic crystals, in particular of a H1 and a L3 cavity, and the emission of the QD ensemble were performed to characterize the samples. The PhCs show high quality factors of 4400 for the H1 cavity and about 5000/3000 for two different modes of the L3 cavity, respectively. The energy of the fundamental modes is in good agreement to the numerical simulations. }}, author = {{Blumenthal, Sarah and Bürger, Matthias and Hildebrandt, Andre and Förstner, Jens and Weber, Nils and Meier, Cedrik and Reuter, Dirk and As, Donat J.}}, issn = {{1862-6351}}, journal = {{physica status solidi (c)}}, keywords = {{tet_topic_phc, tet_topic_qd}}, number = {{5-6}}, pages = {{292--296}}, publisher = {{Wiley}}, title = {{{Fabrication and characterization of two-dimensional cubic AlN photonic crystal membranes containing zincblende GaN quantum dots}}}, doi = {{10.1002/pssc.201600010}}, volume = {{13}}, year = {{2016}}, } @article{48306, abstract = {{The goal of argumentation mining, an evolving research field in computational linguistics, is to design methods capable of analyzing people's argumentation. In this article, we go beyond the state of the art in several ways. (i) We deal with actual Web data and take up the challenges given by the variety of registers, multiple domains, and unrestricted noisy user-generated Web discourse. (ii) We bridge the gap between normative argumentation theories and argumentation phenomena encountered in actual data by adapting an argumentation model tested in an extensive annotation study. (iii) We create a new gold standard corpus (90k tokens in 340 documents) and experiment with several machine learning methods to identify argument components. We offer the data, source codes, and annotation guidelines to the community under free licenses. Our findings show that argumentation mining in user-generated Web discourse is a feasible but challenging task.}}, author = {{Habernal, Ivan and Gurevych, Iryna}}, issn = {{0891-2017}}, journal = {{Computational Linguistics}}, keywords = {{Artificial Intelligence, Computer Science Applications, Linguistics and Language, Language and Linguistics}}, number = {{1}}, pages = {{125--179}}, publisher = {{MIT Press}}, title = {{{Argumentation Mining in User-Generated Web Discourse}}}, doi = {{10.1162/coli_a_00276}}, volume = {{43}}, year = {{2016}}, } @inproceedings{48308, author = {{Habernal, Ivan and Sukhareva, Maria and Raiber, Fiana and Shtok, Anna and Kurland, Oren and Ronen, Hadar and Bar-Ilan, Judit and Gurevych, Iryna}}, booktitle = {{Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval}}, publisher = {{ACM}}, title = {{{New Collection Announcement}}}, doi = {{10.1145/2911451.2914682}}, year = {{2016}}, } @inproceedings{48307, author = {{Habernal, Ivan and Gurevych, Iryna}}, booktitle = {{Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)}}, publisher = {{Association for Computational Linguistics}}, title = {{{Which argument is more convincing? Analyzing and predicting convincingness of Web arguments using bidirectional LSTM}}}, doi = {{10.18653/v1/p16-1150}}, 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}}, }