@article{16303,
author = {Hannes, W.-R. and Trautmann, A. and Stein, M. and Schäfer, F. and Koch, M. and Meier, T.},
issn = {2469-9950},
journal = {Physical Review B},
pages = {075203},
title = {{Strongly nonresonant four-wave mixing in semiconductors}},
doi = {10.1103/physrevb.101.075203},
volume = {101},
year = {2020},
}
@inproceedings{16308,
author = {Schulz, Andreas and Wecker, Christian and Kenig, Eugeny},
publisher = {Jahrestreffen der ProcessNet-Fachgruppe Wärme- und Stofftransport},
title = {{Ein PLIC-basierter Ansatz zur Erfassung des Stoffübergangs an bewegten Phasengrenzflächen}},
year = {2020},
}
@article{16334,
abstract = {We analyze the actual behavior of agents in a matching mechanism, using data from a clearinghouse at the Faculty of Business Administration and Economics at a German university, where a variant of the Boston mechanism is used. We supplement this data with data generated in a survey among the students who participated in the clearinghouse. We find that under the current mechanism over 74% of students act strategically by misrepresenting at least one of their preferences. Nevertheless, not all students are able to improve their outcome by doing so. We show that this is mainly due to the incomplete information of students and naiveté. Sophisticated students actually reach significantly better outcomes than naive students. Thus, we find evidence that naive students are exploited by sophisticated students in an incomplete information setting.},
author = {Hoyer, Britta and Stroh-Maraun, Nadja},
journal = {Games and Economic Behavior},
pages = {453 -- 481},
title = {{Matching Strategies of Heterogeneous Agents under Incomplete Information in a University Clearinghouse}},
doi = {10.1016/j.geb.2020.03.006},
volume = {121},
year = {2020},
}
@inproceedings{16346,
author = {Daymude, Joshua J. and Gmyr, Robert and Hinnenthal, Kristian and Kostitsyna, Irina and Scheideler, Christian and Richa, Andréa W.},
booktitle = {Proceedings of the 21st International Conference on Distributed Computing and Networking},
isbn = {9781450377515},
title = {{Convex Hull Formation for Programmable Matter}},
doi = {10.1145/3369740.3372916},
year = {2020},
}
@inproceedings{16207,
author = {Heine, Jens and Wecker, Christian and Kenig, Eugeny and Bart, Hans-Joerg},
publisher = {Jahrestreffen der ProcessNet-Fachgruppe Extraktion},
title = {{Stofftransportmessung am ruhenden und bewegten Einzeltropfen}},
year = {2020},
}
@inproceedings{16219,
abstract = {Network function virtualization (NFV) proposes
to replace physical middleboxes with more flexible virtual
network functions (VNFs). To dynamically adjust to everchanging
traffic demands, VNFs have to be instantiated and
their allocated resources have to be adjusted on demand.
Deciding the amount of allocated resources is non-trivial.
Existing optimization approaches often assume fixed resource
requirements for each VNF instance. However, this can easily
lead to either waste of resources or bad service quality if too
many or too few resources are allocated.
To solve this problem, we train machine learning models
on real VNF data, containing measurements of performance
and resource requirements. For each VNF, the trained models
can then accurately predict the required resources to handle
a certain traffic load. We integrate these machine learning
models into an algorithm for joint VNF scaling and placement
and evaluate their impact on resulting VNF placements. Our
evaluation based on real-world data shows that using suitable
machine learning models effectively avoids over- and underallocation
of resources, leading to up to 12 times lower resource
consumption and better service quality with up to 4.5 times
lower total delay than using standard fixed resource allocation.},
author = {Schneider, Stefan Balthasar and Satheeschandran, Narayanan Puthenpurayil and Peuster, Manuel and Karl, Holger},
booktitle = {IEEE Conference on Network Softwarization (NetSoft)},
location = {Ghent, Belgium},
publisher = {IEEE},
title = {{Machine Learning for Dynamic Resource Allocation in Network Function Virtualization}},
year = {2020},
}
@article{15836,
author = {Bellman, K. and Dutt, N. and Esterle, L. and Herkersdorf, A. and Jantsch, A. and Landauer, C. and R. Lewis, P. and Platzner, Marco and TaheriNejad, N. and Tammemäe, K.},
journal = {ACM Transactions on Cyber-Physical Systems},
pages = {1--24},
title = {{Self-aware Cyber-Physical Systems}},
volume = {Accepted for Publication},
year = {2020},
}
@inproceedings{16858,
author = {Krauter, Stefan and Zhang, L.},
booktitle = {Proceedings of the 14 th International Renewable Energy Storage Conference, Düsseldorf (Deutschland), 10.–12. März 2020 (verschoben auf 16.–18. März 2021)},
location = {Düsseldorf (Deutschland)},
title = {{Probability of Correct Decision–Making at Triggering of Load-Shifting Intended for low CO 2 -intensity and low EEX trading price via simple Grid Frequency Monitoring}},
year = {2020},
}
@inproceedings{13943,
author = {Krumme, Matthias and Webersen, Manuel and Claes, Leander and Webersen, Yvonne},
booktitle = {Fortschritte der Akustik - DAGA 2020},
pages = {542--545},
title = {{Analoge Klangsynthese zur Vermittlung von Grundkenntnissen der Signalverarbeitung an Studierende nicht-technischer Fachrichtungen}},
year = {2020},
}
@inproceedings{16947,
author = {Weinzierl, Sven and Wolf, Verena and Pauli, Tobias and Beverungen, Daniel and Matzner, Martin},
booktitle = {Proceedings of the 28th European Conference on Information Systems},
location = {Marrakech, Morroco},
title = {{Detecting Workarounds in Business Processes — A Deep Learning Method for Analyzing Event Logs}},
year = {2020},
}
@article{12971,
author = {Jin, Ligang and Steffen, Eckhard},
journal = {J. of Combinatorics},
pages = {457--473},
title = {{Unions of 1-factors in r-graphs and overfull graphs}},
volume = {11},
year = {2020},
}
@article{16961,
author = {Liebendörfer, Michael and Göller, Robin and Biehler, Rolf and Hochmuth, Reinhard and Kortemeyer, Jörg and Ostsieker, Laura and Rode, Jana and Schaper, Niclas},
issn = {0173-5322},
journal = {Journal für Mathematik-Didaktik},
title = {{LimSt – Ein Fragebogen zur Erhebung von Lernstrategien im mathematikhaltigen Studium}},
doi = {10.1007/s13138-020-00167-y},
year = {2020},
}
@inbook{17058,
author = {Tönnies, Merle and Göhrmann, Matthias},
booktitle = {How to Do Cultural Studies: Ideas, Approaches, Scenarios},
editor = {Kramer, Jürgen and Lenz, Bernd},
pages = {303--339},
publisher = {Königshausen & Neumann},
title = {{British Political Rhetoric from World War II to Brexit: A Cultural Studies Approach}},
year = {2020},
}
@article{17072,
author = {Feng, Yuanhua and Gries, Thomas and Fritz, Marlon},
issn = {1048-5252},
journal = {Journal of Nonparametric Statistics},
pages = {510--533},
title = {{Data-driven local polynomial for the trend and its derivatives in economic time series}},
doi = {10.1080/10485252.2020.1759598},
year = {2020},
}
@inproceedings{17089,
author = {Dreiling, Dmitrij and Itner, Dominik Thor and Feldmann, Nadine and Gravenkamp, Hauke and Henning, Bernd},
location = {Nürnberg},
publisher = {AMA Service GmbH},
title = {{Increasing the sensitivity in the determination of material parameters by using arbitrary loads in ultrasonic transmission measurements}},
doi = {10.5162/SMSI2020/D1.3},
year = {2020},
}
@inproceedings{16790,
author = {Krings, Sarah Claudia and Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor},
booktitle = {Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)},
isbn = {978-1-4503-7984-7/20/06},
title = {{Development Framework for Context-Aware Augmented Reality Applications}},
doi = {10.1145/3393672.3398640},
year = {2020},
}
@inbook{17337,
author = {Jazayeri, Bahar and Schwichtenberg, Simon and Küster, Jochen and Zimmermann, Olaf and Engels, Gregor},
booktitle = {Advanced Information Systems Engineering},
isbn = {9783030494346},
issn = {0302-9743},
title = {{Modeling and Analyzing Architectural Diversity of Open Platforms}},
doi = {10.1007/978-3-030-49435-3_3},
year = {2020},
}
@inproceedings{17349,
author = {Grabo, Matti and Staggenborg, Christoph and Kenig, Eugeny},
location = {Frankfurt am Main},
title = {{Modellierung und Optimierung makroverkapselter Latentwärmespeicherelemente für ein luftgeführtes Wärmespeichersystem}},
year = {2020},
}
@article{17363,
author = {Hoffmann, Christin and Thommes, Kirsten},
journal = {Economics Letters},
number = {108984},
title = {{Using loss aversion to incentivize energy efficiency in a principal agent context - Evidence from a field experiment}},
volume = {189},
year = {2020},
}
@inproceedings{17370,
abstract = { 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.},
author = {Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures},
isbn = {9781450369350},
keyword = {Online Multi-Commodity Facility Location, Competitive Ratio, Online Optimization, Facility Location Problem},
title = {{The Online Multi-Commodity Facility Location Problem}},
doi = {10.1145/3350755.3400281},
year = {2020},
}