TY - JOUR AB - In scientific computing, the acceleration of atomistic computer simulations by means of custom hardware is finding ever-growing application. A major limitation, however, is that the high efficiency in terms of performance and low power consumption entails the massive usage of low precision computing units. Here, based on the approximate computing paradigm, we present an algorithmic method to compensate for numerical inaccuracies due to low accuracy arithmetic operations rigorously, yet still obtaining exact expectation values using a properly modified Langevin-type equation. AU - Rengaraj, Varadarajan AU - Lass, Michael AU - Plessl, Christian AU - Kühne, Thomas ID - 12878 IS - 2 JF - Computation TI - Accurate Sampling with Noisy Forces from Approximate Computing VL - 8 ER - TY - GEN AB - Die Erfindung betrifft ein Gerät mit wenigstens einem elastisch verformbaren Bauteil als Strukturteil und/oder Lagerteil, auf das im Betriebsverlauf von wechselnden Betriebszuständen abhängige, unterschiedliche Verformungskräfte einwirken, die zu einem die Bauteilnutzungsdauer begrenzenden Bauteilverschleiß führen, und mit einer Einrichtung zur Bestimmung der Bauteilnutzungsdauer und einer verschleißbedingten Bauteil-Restnutzungsdauer. Erfindungsgemäß wird ein sich zeitversetzt wiederholender, jeweils gleicher Betriebszustand vorbestimmt, dem eine jeweils gleiche Verformungskraft zugeordnet ist, durch die das elastisch verformbare Bauteilmaterial verformt wird. Ein solcher vorbestimmter Betriebszustand wird jeweils von einer Mess- und Auswerteeinheit erkannt und ein Messvorgang durch ein Startsignal selbsttätig gestartet, wobei mit wenigstens einem bauteilzugeordneten Beschleunigungssensor, die aktuelle Beschleunigung der Verformung oder daraus abgeleitete Kennwerte als Kenngröße für eine aktuelle Bauteilsteifigkeit gemessen und jeweils in einer Messkurve gespeichert und verglichen wird. AU - Reinke, Kai AU - Bender, Amelie AU - Meyer, Tobias AU - Sextro, Walter AU - Kimotho, James Kuria ID - 9981 TI - Patent EP 3 358 332 B1: Verfahren zur Bestimmung des Beginns einer verschleißbedingten Bauteil-Restnutzungsdauer eines elastisch verformbaren Bauteils, als Strukturteil und/oder Lagerteil eines Geräts. ER - TY - JOUR AU - Chiapello, Eve AU - Knoll, Lisa ID - 37021 IS - 2 JF - Journal of Comparative Policy Analysis: Research and Practice KW - Public Administration KW - Sociology and Political Science SN - 1387-6988 TI - The Welfare Conventions Approach: A Comparative Perspective on Social Impact Bonds VL - 22 ER - TY - JOUR AU - Chiapello, Eve AU - Knoll, Lisa ID - 37023 IS - 3 JF - Historical Social Research TI - Social Finance and Impact Investing: Governing Welfare in the Era of Financialization VL - 45 ER - TY - BOOK ED - Althoff, Sebastian ED - Linseisen, Elisa ED - Müller, Maja-Lisa ED - Winter, Franziska ID - 47618 SN - 978-3-7705-6495-8 TI - Re/Dissolving Mimesis ER - TY - CHAP AU - Althoff, Sebastian ED - Linseisen, Elisa ED - Müller, Maja-Lisa ED - Winter, Franziska ID - 47623 T2 - Re/Dissolving Mimesis TI - A CCTV Image that Dissolves like Smeared Data: Distinguishability versus Similarity ER - TY - CHAP AU - Althoff, Sebastian AU - Linseisen, Elisa AU - Müller, Maja-Lisa AU - Winter, Franziska ED - Linseisen, Elisa ED - Müller, Maja-Lisa ED - Winter, Franziska ID - 47622 T2 - Re/Dissolving Mimesis TI - Editorial: Re/Dissolving Mimesis ER - TY - JOUR AU - Althoff, Sebastian ID - 47624 IS - 7 JF - Performance Research TI - Seeping Out: The diminishment of the subject in Hito Steyerl’s How Not to Be Seen VL - 24 ER - TY - CONF AB - The canonical problem for the class Quantum Merlin-Arthur (QMA) is that of estimating ground state energies of local Hamiltonians. Perhaps surprisingly, [Ambainis, CCC 2014] showed that the related, but arguably more natural, problem of simulating local measurements on ground states of local Hamiltonians (APX-SIM) is likely harder than QMA. Indeed, [Ambainis, CCC 2014] showed that APX-SIM is P^QMA[log]-complete, for P^QMA[log] the class of languages decidable by a P machine making a logarithmic number of adaptive queries to a QMA oracle. In this work, we show that APX-SIM is P^QMA[log]-complete even when restricted to more physical Hamiltonians, obtaining as intermediate steps a variety of related complexity-theoretic results. We first give a sequence of results which together yield P^QMA[log]-hardness for APX-SIM on well-motivated Hamiltonians: (1) We show that for NP, StoqMA, and QMA oracles, a logarithmic number of adaptive queries is equivalent to polynomially many parallel queries. These equalities simplify the proofs of our subsequent results. (2) Next, we show that the hardness of APX-SIM is preserved under Hamiltonian simulations (a la [Cubitt, Montanaro, Piddock, 2017]). As a byproduct, we obtain a full complexity classification of APX-SIM, showing it is complete for P, P^||NP, P^||StoqMA, or P^||QMA depending on the Hamiltonians employed. (3) Leveraging the above, we show that APX-SIM is P^QMA[log]-complete for any family of Hamiltonians which can efficiently simulate spatially sparse Hamiltonians, including physically motivated models such as the 2D Heisenberg model. Our second focus considers 1D systems: We show that APX-SIM remains P^QMA[log]-complete even for local Hamiltonians on a 1D line of 8-dimensional qudits. This uses a number of ideas from above, along with replacing the "query Hamiltonian" of [Ambainis, CCC 2014] with a new "sifter" construction. AU - Gharibian, Sevag AU - Piddock, Stephen AU - Yirka, Justin ID - 13226 T2 - Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020) TI - Oracle complexity classes and local measurements on physical Hamiltonians ER - TY - JOUR AU - Spychala, K. J. AU - Mackwitz, P. AU - Rüsing, Michael AU - Widhalm, A. AU - Berth, Gerhard AU - Silberhorn, Christine AU - Zrenner, Artur ID - 22056 JF - Journal of Applied Physics SN - 0021-8979 TI - Nonlinear focal mapping of ferroelectric domain walls in LiNbO3: Analysis of the SHG microscopy contrast mechanism ER -