TY - JOUR
AU - Hoppe, Julia Amelie
AU - Johansson-Pajala, Rose-Marie
AU - Gustafsson, Christine
AU - Melkas, Helinä
AU - Tusku, Outi
AU - Pekkarinen, Satu
AU - Hennala, Lea
ID - 17366
JF - Industrie 4.0 Management
SN - 2364-9208
TI - Technologieorientierung zu Assistenzrobotik – Welche Akzeptanz besteht bei der Einführung von Assistenzrobotik für die Pflege älterer Menschen?
VL - 2
ER -
TY - JOUR
AU - Hasso, Tim
AU - Pelster, Matthias
AU - Breitmayer, Bastian
ID - 19043
JF - Journal of Behavioral and Experimental Finance
SN - 2214-6350
TI - Terror attacks and individual investor behavior: Evidence from the 2015–2017 European terror attacks
VL - 28
ER -
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 - Niederhausen, Jens
AU - MacQueen, Rowan W.
AU - Lips, Klaus
AU - Aldahhak, Hazem
AU - Schmidt, Wolf Gero
AU - Gerstmann, Uwe
ID - 19193
JF - Langmuir
SN - 0743-7463
TI - Tetracene Ultrathin Film Growth on Hydrogen-Passivated Silicon
ER -
TY - CHAP
AB - In this work we review the novel framework for the computation of finite dimensional invariant sets of infinite dimensional dynamical systems developed in [6] and [36]. By utilizing results on embedding techniques for infinite dimensional systems we extend a classical subdivision scheme [8] as well as a continuation algorithm [7] for the computation of attractors and invariant manifolds of finite dimensional systems to the infinite dimensional case. We show how to implement this approach for the analysis of delay differential equations and partial differential equations and illustrate the feasibility of our implementation by computing the attractor of the Mackey-Glass equation and the unstable manifold of the one-dimensional Kuramoto-Sivashinsky equation.
AU - Gerlach, Raphael
AU - Ziessler, Adrian
ED - Junge, Oliver
ED - Schütze, Oliver
ED - Ober-Blöbaum, Sina
ED - Padberg-Gehle, Kathrin
ID - 17994
SN - 2198-4182
T2 - Advances in Dynamics, Optimization and Computation
TI - The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems
VL - 304
ER -
TY - JOUR
AU - Liêu, Minh-Lý
AU - Pelster, Matthias
ID - 17051
JF - Data in Brief
SN - 2352-3409
TI - The disposition effect in a scopic regime: Data from a laboratory experiment
ER -
TY - JOUR
AU - Goldbach, Carina
AU - Hoffmann, Christin
AU - Hoppe, Julia Amelie
AU - Pitz, Thomas
AU - Thommes, Kirsten
ID - 17854
IS - 7
JF - PloS ONE
TI - The fast and the furious—An experimental investigation of the pace of life and risky speed choice in traffic
VL - 15
ER -
TY - JOUR
AU - Pelster, Matthias
ID - 15306
JF - Economics Letters
SN - 0165-1765
TI - The gambler’s and hot-hand fallacies: Empirical evidence from trading data
VL - 187
ER -
TY - CHAP
AU - Moritzer, Elmar
AU - Hüttner, Matthias
AU - Henning, Bernd
AU - Webersen, Manuel
ED - Hopmann, Christian
ED - Dahlmann, Rainer
ID - 17352
SN - 9783662608081
T2 - Advances in Polymer Processing 2020
TI - The Influence of Hydrothermal Aging on the Material Properties of Continuous Fiber-Reinforced Thermoplastics and its Non-Destructive Characterization
ER -
TY - CONF
AB - We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set \( S \) of commodities.
Ravi and Sinha (SODA 2004) introduced the model as the \emph{Multi-Commodity Facility Location Problem} (MFLP) and considered it an offline optimization problem.
The model itself is similar to the FLP: i.e., requests are located at points of a finite metric space and the task of an algorithm is to construct facilities and assign requests to facilities while minimizing the construction cost and the sum over all assignment distances.
In addition, requests and facilities are heterogeneous; they request or offer multiple commodities out of $S$.
A request has to be connected to a set of facilities jointly offering the commodities demanded by it.
In comparison to the FLP, an algorithm has to decide not only if and where to place facilities, but also which commodities to offer at each.
To the best of our knowledge we are the first to study the problem in its online variant in which requests, their positions and their commodities are not known beforehand but revealed over time.
We present results regarding the competitive ratio.
On the one hand, we show that heterogeneity influences the competitive ratio by developing a lower bound on the competitive ratio for any randomized online algorithm of \( \Omega ( \sqrt{|S|} + \frac{\log n}{\log \log n} ) \) that already holds for simple line metrics.
Here, \( n \) is the number of requests.
On the other side, we establish a deterministic \( \mathcal{O}(\sqrt{|S|} \cdot \log n) \)-competitive algorithm and a randomized \( \mathcal{O}(\sqrt{|S|} \cdot \frac{\log n}{\log \log n} ) \)-competitive algorithm.
Further, we show that when considering a more special class of cost functions for the construction cost of a facility, the competitive ratio decreases given by our deterministic algorithm depending on the function.
AU - Castenow, Jannik
AU - Feldkord, Björn
AU - Knollmann, Till
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
ID - 17370
KW - Online Multi-Commodity Facility Location
KW - Competitive Ratio
KW - Online Optimization
KW - Facility Location Problem
SN - 9781450369350
T2 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
TI - The Online Multi-Commodity Facility Location Problem
ER -