TY - JOUR
AU - Jovanovikj, Ivan
AU - Yigitbas, Enes
AU - Sauer, Stefan
AU - Engels, Gregor
ID - 15605
JF - Software Engineering 2020 Workshopband
SN - 1613-0073
TI - Test Case Co-Migration Method Patterns
ER -
TY - JOUR
AU - Elgabarty, Hossam
AU - Kühne, Thomas D.
ID - 17384
JF - Phys. Chem. Chem. Phys.
TI - Tumbling with a limp: local asymmetry in water's hydrogen bond network and its consequences
VL - 22
ER -
TY - JOUR
AB - Approximate circuits trade-off computational accuracy against improvements in hardware area, delay, or energy consumption. IP core vendors who wish to create such circuits need to convince consumers of the resulting approximation quality. As a solution we propose proof-carrying approximate circuits: The vendor creates an approximate IP core together with a certificate that proves the approximation quality. The proof certificate is bundled with the approximate IP core and sent off to the consumer. The consumer can formally verify the approximation quality of the IP core at a fraction of the typical computational cost for formal verification. In this paper, we first make the case for proof-carrying approximate circuits and then demonstrate the feasibility of the approach by a set of synthesis experiments using an exemplary approximation framework.
AU - Witschen, Linus Matthias
AU - Wiersema, Tobias
AU - Platzner, Marco
ID - 17358
JF - IEEE Transactions On Very Large Scale Integration Systems
KW - Approximate circuit synthesis
KW - approximate computing
KW - error metrics
KW - formal verification
KW - proof-carrying hardware
SN - 1063-8210
TI - Proof-carrying Approximate Circuits
ER -
TY - CONF
AU - Seutter, Janina
AU - Neumann, Jürgen
ID - 16951
T2 - Proceedings of the 28th European Conference on Information Systems (ECIS)
TI - Reviewing the Simple Things- How Ease of Evaluation Affects Online Rating Behavior
ER -
TY - CONF
AU - Bobolz, Jan
AU - Eidens, Fabian
AU - Krenn, Stephan
AU - Slamanig, Daniel
AU - Striecks, Christoph
ID - 16487
T2 - Proceedings of the 15th ACM Asia Conference on Computer and Communications Security (ASIA CCS ’20),
TI - Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection
ER -
TY - CHAP
AB - Many dynamical systems possess symmetries, e.g. rotational and translational invariances of mechanical systems. These can be beneficially exploited in the design of numerical optimal control methods. We present a model predictive control scheme which is based on a library of precomputed motion primitives. The primitives are equivalence classes w.r.t. the symmetry of the optimal control problems. Trim primitives as relative equilibria w.r.t. this symmetry, play a crucial role in the algorithm. The approach is illustrated using an academic mobile robot example.
AU - Flaßkamp, Kathrin
AU - Ober-Blöbaum, Sina
AU - Peitz, Sebastian
ED - Junge, Oliver
ED - Schütze, Oliver
ED - Froyland, Gary
ED - Ober-Blöbaum, Sina
ED - Padberg-Gehle, Kathrin
ID - 17411
SN - 2198-4182
T2 - Advances in Dynamics, Optimization and Computation
TI - Symmetry in Optimal Control: A Multiobjective Model Predictive Control Approach
ER -
TY - JOUR
AU - Geier, M.
AU - Freudenfeld, J.
AU - Silva, J. T.
AU - Umansky, V.
AU - Reuter, Dirk
AU - Wieck, A. D.
AU - Brouwer, P. W.
AU - Ludwig, S.
ID - 17435
JF - Physical Review B
SN - 2469-9950
TI - Electrostatic potential shape of gate-defined quantum point contacts
ER -
TY - GEN
AU - Bornemann, Tobias
AU - Schipp, Adrian
AU - Sureth-Sloane, Caren
ID - 17505
TI - 2018/2019 Umfrage zur Steuerkomplexität in deutschen Finanzverwaltungen
ER -
TY - GEN
AU - Hoppe, Thomas
AU - Schanz, Deborah
AU - Schipp, Adrian
AU - Siegel, Felix
AU - Sturm, Susann
AU - Sureth-Sloane, Caren
ID - 17512
TI - 2018 Global MNC Tax Complexity Survey
ER -
TY - CONF
AB - In this work, we initiate the research about the Gathering problem for robots
with limited viewing range in the three-dimensional Euclidean space. In the
Gathering problem, a set of initially scattered robots is required to gather at
the same position. The robots' capabilities are very restricted -- they do not
agree on any coordinate system or compass, have a limited viewing range, have
no memory of the past and cannot communicate. We study the problem in two
different time models, in FSYNC (fully synchronized discrete rounds) and the
continuous time model. For FSYNC, we introduce the 3D-Go-To-The-Center-strategy
and prove a runtime of $\Theta(n^2)$ that matches the currently best runtime
bound for the same model in the Euclidean plane [SPAA'11]. Our main result is
the generalization of contracting strategies (continuous time) from
[Algosensors'17] to three dimensions. In contracting strategies, every robot
that is located on the global convex hull of all robots' positions moves with
full speed towards the inside of the convex hull. We prove a runtime bound of
$O(\Delta \cdot n^{3/2})$ for any three-dimensional contracting strategy, where
$\Delta$ denotes the diameter of the initial configuration. This comes up to a
factor of $\sqrt{n}$ close to the lower bound of $\Omega (\Delta \cdot n)$
which is already true in two dimensions. In general, it might be hard for
robots with limited viewing range to decide whether they are located on the
global convex hull and which movement maintains the connectivity of the swarm,
rendering the design of concrete contracting strategies a challenging task. We
prove that the continuous variant of 3D-Go-To-The-Center is contracting and
keeps the swarm connected. Moreover, we give a simple design criterion for
three-dimensional contracting strategies that maintains the connectivity of the
swarm and introduce an exemplary strategy based on this criterion.
AU - Braun, Michael
AU - Castenow, Jannik
AU - Meyer auf der Heide, Friedhelm
ID - 16968
T2 - Proceedings of the 27th Conference on Structural Information and Communication Complexity (SIROCCO)
TI - Local Gathering of Mobile Robots in Three Dimensions
ER -