@inproceedings{2474, author = {{Afifi, Haitham and Auroux, Sébastien and Karl, Holger}}, publisher = {{Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}}, title = {{{MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops}}}, year = {{2018}}, } @inproceedings{2476, author = {{Shiferaw Heyi, Binyam and Karl, Holger}}, publisher = {{Proc. of IEEE Wireless Communications and Networking Conference (WCNC)}}, title = {{{Modelling Time-Limited Capacity of a Wireless Channel as aMarkov Reward Process}}}, year = {{2018}}, } @inproceedings{2479, author = {{Mohr, Felix and Wever, Marcel Dominik and Hüllermeier, Eyke and Faez, Amin}}, booktitle = {{SCC}}, location = {{San Francisco, CA, USA}}, publisher = {{IEEE}}, title = {{{(WIP) Towards the Automated Composition of Machine Learning Services}}}, doi = {{10.1109/SCC.2018.00039}}, year = {{2018}}, } @inproceedings{2480, abstract = {{Understanding the behavior of the components of service function chains (SFCs) in different load situations is important for efficient and automatic management and orches- tration of services. For this purpose and for practical research in network function virtualization in general, there is a great need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of virtual network functions (VNFs) and the expected performance of the SFC, considering the individual performance of the VNFs as well as the interdependencies among VNFs within the SFC. We have designed our experiments focusing on video streaming, an important application in this context. We present examples of models for predicting the interdependence between resource demands and performance characteristics of SFCs using support vector regression and polynomial regression models. We also show practical evidence from our experiments that VNFs need to be benchmarked in their final chain setup, rather than individually, to capture important interdependencies that affect their performance. The data gathered from our experiments is publicly available.}}, author = {{Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, pages = {{318----322}}, publisher = {{IEEE}}, title = {{{Generating Resource and Performance Models for Service Function Chains: The Video Streaming Case}}}, doi = {{10.1109/NETSOFT.2018.8460029}}, year = {{2018}}, } @inproceedings{2481, abstract = {{Network function virtualization requires scaling and placement, deciding the number and the location of function instances. Current approaches are limited in flexibility and practical applicability. Specifically, we study dynamic, single-step, joint scaling and placement of network services with bidirectional flows traversing Physical or Virtual Network Functions (VNFs) and returning to their sources. We develop models to support stateful components and legacy network functions with fixed locations in these network services as well as the possibility of reusing VNFs across network services. We formalize the problem of jointly scaling and placing such network services as a mixed- integer linear program (MILP). We show that this problem is NP-complete and also present a heuristic algorithm to find good solutions in short time. In an extensive evaluation with realistic scenarios, we investigate the capabilities of the two approaches.}}, author = {{Dräxler, Sevil and Schneider, Stefan Balthasar and Karl, Holger}}, booktitle = {{4th IEEE International Conference on Network Softwarization (NetSoft 2018)}}, location = {{Montreal}}, pages = {{123----131}}, publisher = {{IEEE}}, title = {{{ Scaling and Placing Bidirectional Services with Stateful Virtual and Physical Network Functions}}}, year = {{2018}}, } @inproceedings{2482, author = {{Dräxler, Sevil and Karl, Holger and Razzaghi Kouchaksaraei, Hadi and Machwe, Azahar and Dent-Young, Crispin and Katsalis, Kostas and Samdanis, Konstantinos}}, booktitle = {{27th European Conference on Networks and Communications (EUCNC 2018)}}, location = {{Ljubljana}}, title = {{{5G OS: Control and Orchestration of Services on Multi-Domain Heterogeneous 5G Infrastructures}}}, year = {{2018}}, } @techreport{2483, abstract = {{Understanding the behavior of distributed cloud service components in different load situations is important for efficient and automatic management and orchestration of these services. For this purpose and for practical research in distributed cloud computing in general, there is need for benchmarks and experimental data. In this paper, we describe our experiments for characterizing the relationship between resource demands of application components and the expected performance of applica- tions. We present initial results for predicting the interdependence between resource demands and performance characteristics using support vector regression and polynomial regression models. The data gathered from our experiments is publicly available.}}, author = {{Dräxler, Sevil and Peuster, Manuel and Illian, Marvin and Karl, Holger}}, title = {{{Towards Predicting Resource Demands and Performance of Distributed Cloud Services}}}, year = {{2018}}, } @inproceedings{2484, abstract = {{We study the classic bin packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the recourse of the algorithm. This is motivated by cloud storage applications, where fully-dynamic bin packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.}}, author = {{Feldkord, Björn and Feldotto, Matthias and Gupta, Anupam and Guruganesh, Guru and Kumar, Amit and Riechers, Sören and Wajc, David}}, booktitle = {{45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}}, editor = {{Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, Donald}}, isbn = {{978-3-95977-076-7}}, issn = {{1868-8969}}, location = {{Prag}}, pages = {{51:1--51:24}}, publisher = {{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}}, title = {{{Fully-Dynamic Bin Packing with Little Repacking}}}, doi = {{10.4230/LIPIcs.ICALP.2018.51}}, volume = {{107}}, year = {{2018}}, } @inproceedings{2485, author = {{Feldkord, Björn and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}}, location = {{Wien}}, pages = {{373 -- 381 }}, publisher = {{ACM}}, title = {{{Online Facility Location with Mobile Facilities}}}, doi = {{10.1145/3210377.3210389}}, year = {{2018}}, } @inproceedings{2490, author = {{Szopinski, Daniel and Kundisch, Dennis}}, booktitle = {{2nd Business Model Conference}}, location = {{Florence, Italy}}, title = {{{Business model idea generation: An exploratory study on changing perspectives}}}, year = {{2018}}, } @inproceedings{2491, author = {{Szopinski, Daniel}}, booktitle = {{2nd Business Model Conference}}, location = {{Florence, Italy}}, title = {{{How to teach business model innovation to 300+ students: An experience report}}}, year = {{2018}}, } @inproceedings{24928, author = {{Tolksdorf, Nils Frederik and Siebert, Scarlet}}, location = {{Berkeley, USA}}, title = {{{Raising Robotic Natives? Ethical aspects of learning with robots in kindergarten}}}, year = {{2018}}, } @inbook{24944, author = {{Elit, Stefan}}, booktitle = {{Faust-Handbuch}}, title = {{{Der sozialistische Faust}}}, doi = {{10.1007/978-3-476-05363-3_62}}, year = {{2018}}, } @article{24953, author = {{Bauer, Anna and Sacher, Marc}}, journal = {{Phydid B, Didaktik der Physik, Beiträge zur DPG-Frühjahrstagung}}, title = {{{Kompetenzorientierte, universitäre Laborpraktika - Das Paderborner Physik Praktikum (3P)}}}, year = {{2018}}, } @inbook{24960, author = {{Bauer, Anna and Reinhold, Peter and Sacher, Marc}}, booktitle = {{Qualitätsvoller Chemie- und Physikunterricht – normative und empirische Dimensionen}}, editor = {{Maurer, Christian}}, pages = {{919--922}}, publisher = {{Gesellschaft für Didaktik der Chemie und Physik}}, title = {{{Operationalisierung der experimentellen Kompetenz (Physik)Studierender}}}, year = {{2018}}, } @misc{25121, abstract = {{We consider a group of $n$ autonomous mobile robots of which $m$ are stationary thus cannot move. Robots are represented by points in the Euclidean plane. They have no memory, do not communicate or share a common coordinate system and they move solely based on the positioning of other robots within their limited viewing range of 1. The goal is to gather the robots inside of the convex hull of all stationary robots. A variant of this problem, the general gathering problem, has been studied in various different time models. In this work, we consider a continuous time model, where robots continuously observe their neighbors, compute the next target of movement and move with a speed limit of 1 at any time. Regarding the robots' local strategy, we only study contracting algorithms in which every robot that is positioned on the border of the convex hull of all robots moves into this hull. We present a time bound of $\mathcal{O}(nd)$ for any general contracting algorithms in a configuration with only a single stationary robot. For configurations with more stationary robots, we prove that robots converge against the convex hull of all stationary robots and that no upper bound on the runtime exists. For the specific contracting algorithms Go-To-The-Left, Go-On-Bisector and Go-To-The-Middle, we provide linear time bounds.}}, author = {{Liedtke, David Jan}}, title = {{{Influence of Stationary Robots on Continuous Robot Formation Problems}}}, year = {{2018}}, } @article{25304, author = {{Wolk, Andreas and Rosenthal, Marta and Neuhaus, Stephan and Huber, Klaus and Brassat, Katharina and Lindner, Jörg K. N. and Grothe, Richard and Grundmeier, Guido and Bremser, Wolfgang and Wilhelm, René}}, issn = {{2045-2322}}, journal = {{Scientific Reports}}, title = {{{A Novel Lubricant Based on Covalent Functionalized Graphene Oxide Quantum Dots}}}, doi = {{10.1038/s41598-018-24062-2}}, year = {{2018}}, } @article{25305, author = {{Rüdiger, Arne A. and Brassat, Katharina and Lindner, Jörg K. N. and Bremser, Wolfgang and Strube, Oliver I.}}, issn = {{0743-7463}}, journal = {{Langmuir}}, pages = {{4264--4270}}, title = {{{Easily Accessible Protein Nanostructures via Enzyme Mediated Addressing}}}, doi = {{10.1021/acs.langmuir.7b04089}}, year = {{2018}}, } @inproceedings{25513, author = {{Stüker, Daniel and Schöppner, Volker and Putzig, Katja and Giese, Ulrich}}, location = {{Nürnberg}}, title = {{{Investigations of High-Speed Rubber Extrusion with Consideration of Melt Homogeneity}}}, year = {{2018}}, } @inproceedings{25515, author = {{Stüker, Daniel and Schöppner, Volker}}, location = {{Kuala Lumpur}}, title = {{{Influence of Different Temperature Control Unit (TCU) Settings on Thermal Homogeneity and Throughput in Rubber Extrusion Processes}}}, year = {{2018}}, }