@inproceedings{35570, author = {{Tjell, Katrine and Schluter, Nils and Binfet, Philipp and Schulze Darup, Moritz }}, booktitle = {{2021 60th IEEE Conference on Decision and Control (CDC)}}, publisher = {{IEEE}}, title = {{{Secure learning-based MPC via garbled circuit}}}, doi = {{10.1109/cdc45484.2021.9683540}}, year = {{2022}}, } @inproceedings{35573, author = {{Schluter, Nils and Neuhaus, Matthias and Schulze Darup, Moritz}}, booktitle = {{2021 European Control Conference (ECC)}}, publisher = {{IEEE}}, title = {{{Encrypted dynamic control with unlimited operating time via FIR filters}}}, doi = {{10.23919/ecc54610.2021.9655161}}, year = {{2022}}, } @inproceedings{35569, author = {{Teichrib, Dieter and Schulze Darup, Moritz}}, booktitle = {{2021 60th IEEE Conference on Decision and Control (CDC)}}, publisher = {{IEEE}}, title = {{{Tailored neural networks for learning optimal value functions in MPC}}}, doi = {{10.1109/cdc45484.2021.9683528}}, year = {{2022}}, } @article{35586, author = {{Protte, Marius and Fahr, Rene and Quevedo, Daniel E.}}, issn = {{1066-033X}}, journal = {{IEEE Control Systems}}, keywords = {{Electrical and Electronic Engineering, Modeling and Simulation, Control and Systems Engineering, Electrical and Electronic Engineering, Modeling and Simulation, Control and Systems Engineering}}, number = {{6}}, pages = {{57--76}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy}}}, doi = {{10.1109/mcs.2020.3019723}}, volume = {{40}}, year = {{2022}}, } @article{34817, author = {{Hanusch, Maximilian}}, issn = {{1019-8385}}, journal = {{Communications in Analysis and Geometry}}, keywords = {{regularity of Lie groups}}, number = {{1}}, pages = {{53--152}}, publisher = {{International Press of Boston}}, title = {{{Regularity of Lie groups}}}, doi = {{10.4310/cag.2022.v30.n1.a2}}, volume = {{30}}, year = {{2022}}, } @techreport{34856, author = {{Hanusch, Maximilian}}, pages = {{385}}, publisher = {{https://maximilianhanusch.wixsite.com/my-site/lehre-teaching}}, title = {{{Analysis 1 und 2 Skript/Buch}}}, year = {{2022}}, } @article{35644, author = {{Kolb, Martin and Klump, Alexander}}, journal = {{Theory of Probability and its Applications}}, number = {{4}}, pages = {{717--744}}, publisher = {{Society for Industrial and Applied Mathematics}}, title = {{{Uniqueness of the Inverse First Passage Time Problem and the Shape of the Shiryaev boundary}}}, volume = {{67}}, year = {{2022}}, } @article{35649, abstract = {{Motivated by the work [6] of Mariusz Bieniek, Krzysztof Burdzy and Soumik Pal we study a Fleming-Viot-type particle system consisting of independently moving particles each driven by generalized Bessel processes on the positive real line. Upon hitting the boundary {0} this particle is killed and an uniformly chosen different one branches into two particles. Using the symmetry of the model and the self similarity property of Bessel processes, we obtain a criterion to decide whether the particles converge to the origin at a finite time. This addresses open problem 1.4 in [6]. Specifically, inspired by [6, Open Problem 1.5], we investigate the case of three moving particles and refine the general result of [6, Theorem 1.1(ii)] extending the regime of drift parameters, where convergence does not occur – even to values, where it does occur when considering the case of only two particles.}}, author = {{Kolb, Martin and Liesenfeld, Matthias}}, journal = {{Electronic Journal of Probability}}, number = {{27}}, pages = {{1--28}}, publisher = {{Institute of Mathematical Statistics}}, title = {{{On non-extinction in a Fleming-Viot-type particle model with Bessel drift}}}, doi = {{https://doi.org/10.1214/22-EJP866}}, year = {{2022}}, } @article{35650, abstract = {{We consider autoregressive sequences Xn = aXn−1 + ξn and Mn = max{aMn−1 , ξn} with a constant a ∈ (0, 1) and with positive, in- dependent and identically distributed innovations {ξk }. It is known that if P(ξ1 > x) ∼ d log x with some d ∈ (0, − log a) then the chains {Xn} and {Mn} are null recurrent. We investigate the tail behaviour of recurrence times in this case of logarithmically decaying tails. More precisely, we show that the tails of recurrence times are regularly varying of index −1 − d/ log a. We also prove limit theorems for {Xn} and {Mn} conditioned to stay over a fixed level x0. Furthermore, we study tail asymptotics for recurrence times of {Xn} and {Mn} in the case when these chains are positive recurrent and the tail of log ξ1 is subexponential.}}, author = {{Denisov, Denis and Hinrichs, Günter and Kolb, Martin and Wachtel, Vitali}}, journal = {{Electronic Journal of Probability}}, pages = {{1--43}}, publisher = {{Institute of Mathematical Statistics}}, title = {{{Persistence of autoregressive sequences with logarithmic tails}}}, doi = {{https://doi.org/10.48550/arXiv.2203.14772}}, volume = {{27}}, year = {{2022}}, } @misc{34962, author = {{Anonymous, A}}, title = {{{Evaluating database systems relying on secure multiparty computation}}}, year = {{2022}}, } @misc{34963, author = {{Anonymous, A}}, title = {{{Cost of Privacy-preserving SMPC Protocols for NN-Based Inference}}}, year = {{2022}}, } @misc{35772, author = {{Lohse, Jan}}, title = {{{Lattice Revocation Mechanisms}}}, year = {{2022}}, } @techreport{36227, author = {{Hammer, Barbara and Hüllermeier, Eyke and Lohweg, Volker and Schneider, Alexander and Schenck, Wolfram and Kuhl, Ulrike and Braun, Marco and Pfeifer, Anton and Holst, Christoph-Alexander and Schmidt, Malte and Schomaker, Gunnar and Tornede, Tanja}}, title = {{{Schlussbericht ITS.ML: Intelligente Technische Systeme der nächsten Generation durch Maschinelles Lernen. Forschungsvorhaben zur automatisierten Analyse von Daten mittels Maschinellen Lernens}}}, doi = {{10.4119/unibi/2965622}}, year = {{2022}}, } @inbook{33466, abstract = {{We review our results of numerical simulations of light scattering from different systems of densely packed irregular particles. We consider spherical clusters, thick layers and monolayers with realistic topologies and dimensions much larger than the wavelength of light. The maximum bulk packing density of clusters is 0.5. A numerically exact solution of the electromagnetic problem is obtained using the Discontinuous Galerkin Time Domain method and with application of high- performance computing. We show that high packing density causes light localization in such structures which makes an impact on the opposition phenomena: backscattering intensity surge and negative linear polarization feature. Diffuse multiple scattering is significantly reduced in the case of non-absorbing particles and near-field interaction results in a percolation-like light transport determined by the topology of the medium. With this the negative polarization feature caused by single scattering gets enhanced if compared to lower density samples. We also confirm coherent double scattering mechanism of negative polarization for light scattered from dense absorbing slabs. In this case convergent result for the scattering angle polarization dependency at backscattering can be obtained for a layer of just a few tens of particles if they are larger than the wavelength.}}, author = {{Grynko, Yevgen and Shkuratov, Yuriy and Alhaddad, Samer and Förstner, Jens}}, booktitle = {{Springer Series in Light Scattering - Volume 8: Light Polarization and Multiple Scattering in Turbid Media}}, editor = {{Kokhanovsky, Alexander}}, isbn = {{9783031102974}}, issn = {{2509-2790}}, keywords = {{tet_topic_scattering}}, publisher = {{Springer International Publishing}}, title = {{{Light Scattering by Large Densely Packed Clusters of Particles}}}, doi = {{10.1007/978-3-031-10298-1_4}}, volume = {{8}}, year = {{2022}}, } @inproceedings{31367, author = {{Hoffmann, Max and Biehler, Rolf}}, booktitle = {{ Bedarfsgerechte fachmathematische Lehramtsausbildung. Analyse, Zielsetzungen und Konzepte unter heterogenen Voraussetzungen }}, editor = {{Halverscheid, Stefan and Kersten, Ina and Schmidt-Thieme, Barbara}}, pages = {{351--368}}, publisher = {{Springer Spektrum}}, title = {{{Schnittstellenaufgaben in der Analysis I zur Verknüpfung von Schul- und Hochschulmathematik - Aufgabenbeispiele und Ergebnisse einer Evaluationsstudie.}}}, year = {{2022}}, } @inproceedings{31365, author = {{Biehler, Rolf and Hoffmann, Max}}, booktitle = {{ Professionsorientierte Fachwissenschaft. Kohärenzstiftende Lerngelegenheiten für das Lehramtsstudium Mathematik}}, editor = {{Isaev, Viktor and Eichler, Andreas and Loose, Frank}}, isbn = {{9783662639474}}, issn = {{2197-8751}}, pages = {{ 49–72}}, publisher = {{Springer}}, title = {{{Fachwissen als Grundlage fachdidaktischer Urteilskompetenz – Beispiele für die Herstellung konzeptueller Bezüge zwischen fachwissenschaftlicher und fachdidaktischer Lehre im gymnasialen Lehramtsstudium}}}, doi = {{10.1007/978-3-662-63948-1_4}}, year = {{2022}}, } @misc{36109, author = {{Knorr, Lukas and Schlosser, Florian and Meschede, Henning}}, publisher = {{17th sdewes conference}}, title = {{{Assessment of Energy Efficiency and Flexibility Measures in Electrified Process Heat Generation Based on Simulations in the Animal Feed Industry}}}, year = {{2022}}, } @inproceedings{27531, abstract = {{The Quantum Singular Value Transformation (QSVT) is a recent technique that gives a unified framework to describe most quantum algorithms discovered so far, and may lead to the development of novel quantum algorithms. In this paper we investigate the hardness of classically simulating the QSVT. A recent result by Chia, Gily\'en, Li, Lin, Tang and Wang (STOC 2020) showed that the QSVT can be efficiently "dequantized" for low-rank matrices, and discussed its implication to quantum machine learning. In this work, motivated by establishing the superiority of quantum algorithms for quantum chemistry and making progress on the quantum PCP conjecture, we focus on the other main class of matrices considered in applications of the QSVT, sparse matrices. We first show how to efficiently "dequantize", with arbitrarily small constant precision, the QSVT associated with a low-degree polynomial. We apply this technique to design classical algorithms that estimate, with constant precision, the singular values of a sparse matrix. We show in particular that a central computational problem considered by quantum algorithms for quantum chemistry (estimating the ground state energy of a local Hamiltonian when given, as an additional input, a state sufficiently close to the ground state) can be solved efficiently with constant precision on a classical computer. As a complementary result, we prove that with inverse-polynomial precision, the same problem becomes BQP-complete. This gives theoretical evidence for the superiority of quantum algorithms for chemistry, and strongly suggests that said superiority stems from the improved precision achievable in the quantum setting. We also discuss how this dequantization technique may help make progress on the central quantum PCP conjecture.}}, author = {{Gharibian, Sevag and Gall, François Le}}, booktitle = {{Proceedings of the 54th ACM Symposium on Theory of Computing (STOC)}}, pages = {{19--32}}, title = {{{Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture}}}, year = {{2022}}, } @inbook{46300, author = {{Niemann, Marco and Assenmacher, Dennis and Brunk, Jens and Riehle, Dennis Maximilian and Becker, Jörg and Trautmann, Heike}}, booktitle = {{Hate Speech — Definitionen, Ausprägungen, Lösungen}}, editor = {{Weitzel, Gerrit and Mündges, Stephan}}, isbn = {{978-3-658-35658-3}}, pages = {{249–274}}, publisher = {{VS Verlag für Sozialwissenschaften}}, title = {{{(Semi-)Automatische Kommentarmoderation zur Erhaltung Konstruktiver Diskurse}}}, doi = {{10.1007/978-3-658-35658-3_13}}, year = {{2022}}, } @inproceedings{46301, author = {{Assenmacher, D and Trautmann, Heike}}, booktitle = {{Intelligent Information and Database Systems}}, editor = {{et al. Tran, T}}, pages = {{3–16}}, publisher = {{Springer International Publishing}}, title = {{{Textual One-Pass Stream Clustering with Automated Distance Threshold Adaption}}}, doi = {{10.1007/978-3-031-21743-2_1}}, year = {{2022}}, }