@phdthesis{15482,
author = {Löken, Nils},
title = {{Cryptography for the Crowd — A Study of Cryptographic Schemes with Applications to Crowd Work}},
doi = {10.17619/UNIPB/1-854},
year = {2020},
}
@article{15266,
author = {Yigitbas, Enes and Jovanovikj, Ivan and Biermeier, Kai and Sauer, Stefan and Engels, Gregor},
journal = {International Journal on Software and Systems Modeling (SoSyM)},
publisher = {Springer},
title = {{Integrated Model-driven Development of Self-adaptive User Interfaces (to appear)}},
year = {2020},
}
@article{16288,
abstract = {We derive a data-driven method for the approximation of the Koopman generator called gEDMD, which can be regarded as a straightforward extension of EDMD (extended dynamic mode decomposition). This approach is applicable to deterministic and stochastic dynamical systems. It can be used for computing eigenvalues, eigenfunctions, and modes of the generator and for system identification. In addition to learning the governing equations of deterministic systems, which then reduces to SINDy (sparse identification of nonlinear dynamics), it is possible to identify the drift and diffusion terms of stochastic differential equations from data. Moreover, we apply gEDMD to derive coarse-grained models of high-dimensional systems, and also to determine efficient model predictive control strategies. We highlight relationships with other methods and demonstrate the efficacy of the proposed methods using several guiding examples and prototypical molecular dynamics problems.},
author = {Klus, Stefan and Nüske, Feliks and Peitz, Sebastian and Niemann, Jan-Hendrik and Clementi, Cecilia and Schütte, Christof},
issn = {0167-2789},
journal = {Physica D: Nonlinear Phenomena},
title = {{Data-driven approximation of the Koopman generator: Model reduction, system identification, and control}},
doi = {10.1016/j.physd.2020.132416},
volume = {406},
year = {2020},
}
@article{16290,
abstract = {The control of complex systems is of critical importance in many branches of science, engineering, and industry, many of which are governed by nonlinear partial differential equations. Controlling an unsteady fluid flow is particularly important, as flow control is a key enabler for technologies in energy (e.g., wind, tidal, and combustion), transportation (e.g., planes, trains, and automobiles), security (e.g., tracking airborne contamination), and health (e.g., artificial hearts and artificial respiration). However, the high-dimensional, nonlinear, and multi-scale dynamics make real-time feedback control infeasible. Fortunately, these high- dimensional systems exhibit dominant, low-dimensional patterns of activity that can be exploited for effective control in the sense that knowledge of the entire state of a system is not required. Advances in machine learning have the potential to revolutionize flow control given its ability to extract principled, low-rank feature spaces characterizing such complex systems.We present a novel deep learning modelpredictive control framework that exploits low-rank features of the flow in order to achieve considerable improvements to control performance. Instead of predicting the entire fluid state, we use a recurrent neural network (RNN) to accurately predict the control relevant quantities of the system, which are then embedded into an MPC framework to construct a feedback loop. In order to lower the data requirements and to improve the prediction accuracy and thus the control performance, incoming sensor data are used to update the RNN online. The results are validated using varying fluid flow examples of increasing complexity.},
author = {Bieker, Katharina and Peitz, Sebastian and Brunton, Steven L. and Kutz, J. Nathan and Dellnitz, Michael},
issn = {0935-4964},
journal = {Theoretical and Computational Fluid Dynamics},
title = {{Deep model predictive flow control with limited sensor data and online learning}},
doi = {10.1007/s00162-020-00520-4},
year = {2020},
}
@inproceedings{16214,
author = {Pauck, Felix and Bodden, Eric and Wehrheim, Heike},
booktitle = {Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria},
editor = {Felderer, Michael and Hasselbring, Wilhelm and Rabiser, Rick and Jung, Reiner},
pages = {123--124},
publisher = {Gesellschaft f{\"{u}}r Informatik e.V.},
title = {{Reproducing Taint-Analysis Results with ReproDroid}},
volume = {{P-300}},
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},
}
@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},
}
@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{17084,
author = {Weidmann, Nils and Anjorin, Anthony},
booktitle = {Fundamental Approaches to Software Engineering},
isbn = {9783030452339},
issn = {0302-9743},
title = {{Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}},
doi = {10.1007/978-3-030-45234-6_16},
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{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},
}
@inproceedings{17399,
author = {Hardes, Tobias and Sommer, Christoph},
booktitle = {2019 IEEE Vehicular Networking Conference (VNC)},
isbn = {9781728145716},
title = {{Towards Heterogeneous Communication Strategies for Urban Platooning at Intersections}},
doi = {10.1109/vnc48660.2019.9062835},
year = {2020},
}
@inproceedings{16726,
author = {Razzaghi Kouchaksaraei, Hadi and Prasad Shivarpatna Venkatesh, Ashwin and Churi, Amey and Illian, Marvin and Karl, Holger},
booktitle = {European Conference on Networks and Communications (EUCNC 2020)},
title = {{Dynamic Provisioning of Network Services on Heterogeneous Resources}},
year = {2020},
}
@inproceedings{17407,
author = {Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke},
booktitle = {Discovery Science},
title = {{Extreme Algorithm Selection with Dyadic Feature Representation}},
year = {2020},
}
@unpublished{17825,
abstract = {Software verification has recently made enormous progress due to the
development of novel verification methods and the speed-up of supporting
technologies like SMT solving. To keep software verification tools up to date
with these advances, tool developers keep on integrating newly designed methods
into their tools, almost exclusively by re-implementing the method within their
own framework. While this allows for a conceptual re-use of methods, it
requires novel implementations for every new technique.
In this paper, we employ cooperative verification in order to avoid
reimplementation and enable usage of novel tools as black-box components in
verification. Specifically, cooperation is employed for the core ingredient of
software verification which is invariant generation. Finding an adequate loop
invariant is key to the success of a verification run. Our framework named
CoVerCIG allows a master verification tool to delegate the task of invariant
generation to one or several specialized helper invariant generators. Their
results are then utilized within the verification run of the master verifier,
allowing in particular for crosschecking the validity of the invariant. We
experimentally evaluate our framework on an instance with two masters and three
different invariant generators using a number of benchmarks from SV-COMP 2020.
The experiments show that the use of CoVerCIG can increase the number of
correctly verified tasks without increasing the used resources},
author = {Haltermann, Jan Frederik and Wehrheim, Heike},
booktitle = {arXiv:2008.04551},
title = {{Cooperative Verification via Collective Invariant Generation}},
year = {2020},
}
@article{10596,
abstract = {Multi-objective optimization is an active field of research that has many applications. Owing to its success and because decision-making processes are becoming more and more complex, there is a recent trend for incorporating many objectives into such problems. The challenge with such problems, however, is that the dimensions of the solution sets—the so-called Pareto sets and fronts—grow with the number of objectives. It is thus no longer possible to compute or to approximate the entire solution set of a given problem that contains many (e.g. more than three) objectives. On the other hand, the computation of single solutions (e.g. via scalarization methods) leads to unsatisfying results in many cases, even if user preferences are incorporated. In this article, the Pareto Explorer tool is presented—a global/local exploration tool for the treatment of many-objective optimization problems (MaOPs). In the first step, a solution of the problem is computed via a global search algorithm that ideally already includes user preferences. In the second step, a local search along the Pareto set/front of the given MaOP is performed in user specified directions. For this, several continuation-like procedures are proposed that can incorporate preferences defined in decision, objective, or in weight space. The applicability and usefulness of Pareto Explorer is demonstrated on benchmark problems as well as on an application from industrial laundry design.},
author = {Schütze, Oliver and Cuate, Oliver and Martín, Adanay and Peitz, Sebastian and Dellnitz, Michael},
issn = {0305-215X},
journal = {Engineering Optimization},
number = {5},
pages = {832--855},
title = {{Pareto Explorer: a global/local exploration tool for many-objective optimization problems}},
doi = {10.1080/0305215x.2019.1617286},
volume = {52},
year = {2020},
}