@inproceedings{14026,
  author       = {{Weidmann, Nils and Anjorin, Anthony and Leblebici, Erhan and Schürr, Andy}},
  booktitle    = {{Proceedings of the 12th ACM SIGPLAN International Conference on Software Language Engineering  - SLE 2019}},
  editor       = {{Nierstrasz, Oscar and Gray, Jeff and Oliveira, Bruno }},
  isbn         = {{9781450369817}},
  location     = {{Athens, Greece}},
  publisher    = {{ACM}},
  title        = {{{Consistency management via a combination of triple graph grammars and linear programming}}},
  doi          = {{10.1145/3357766.3359544}},
  year         = {{2019}},
}

@article{14027,
  author       = {{Bengs, Viktor and Eulert, Matthias and Holzmann, Hajo}},
  issn         = {{0047-259X}},
  journal      = {{Journal of Multivariate Analysis}},
  pages        = {{291--312}},
  title        = {{{Asymptotic confidence sets for the jump curve in bivariate regression problems}}},
  doi          = {{10.1016/j.jmva.2019.02.017}},
  year         = {{2019}},
}

@article{14028,
  author       = {{Bengs, Viktor and Holzmann, Hajo}},
  issn         = {{1935-7524}},
  journal      = {{Electronic Journal of Statistics}},
  pages        = {{1523--1579}},
  title        = {{{Adaptive confidence sets for kink estimation}}},
  doi          = {{10.1214/19-ejs1555}},
  year         = {{2019}},
}

@misc{14032,
  abstract     = {{ Beschrieben ist ein verteiltes Warenwirtschaftssystem, bei dem der Kunde, Händler, und der Hersteller vernetzt sind. Dies wird bewerkstelligt durch einen Cloud-Speicher (105), der Cloud-Speicher (105) aufweisend ein Mittel zum Speichern (105a) von Daten, ein Mittel zum Empfangen von ersten Daten von einem ersten Netzwerkteilnehmer (110), wobei die ersten Daten zugehörig sind zu einem physischen Objekt, ein Mittel zum Empfangen von Anfragedaten von einem zweiten Netzwerkteilnehmer (120), ein Mittel zum Empfangen von zweiten Daten von einem dritten Netzwerkteilnehmer (130), wobei die zweiten Daten zugehörig sind zu den ersten Daten und zumindest ein Datum aufweisen, welches angepasst ist, die ersten Daten zu ändern in Abhängigkeit der empfangenen Anfragedaten, ein Mittel zum Ändern der ersten Daten basierend zumindest im Teil auf den zweiten Daten und den Anfragedaten und ein Mittel zum Senden eines geänderten Teils der ersten Daten von dem Cloud-Speicher (105) an den ersten Netzwerkteilnehmer (110).}},
  author       = {{Göllner, Thomas and Schwarz, Jan-Hendrik and Gottschalk, Sebastian and Sauer, Stefan}},
  pages        = {{25}},
  title        = {{{Verteiltes Warenwirtschaftssystem [Distributed Warehouse System]}}},
  year         = {{2019}},
}

@inproceedings{14539,
  author       = {{Castenow, Jannik and Kolb, Christina and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO)}},
  location     = {{L'Aquila, Italy}},
  pages        = {{345--348}},
  title        = {{{A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks}}},
  doi          = {{10.1007/978-3-030-24922-9\_26}},
  year         = {{2019}},
}

@misc{14546,
  author       = {{Hansmeier, Tim}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Autonomous Operation of High-Performance Compute Nodes through Self-Awareness and Learning Classifiers}}},
  year         = {{2019}},
}

@inproceedings{13123,
  abstract     = {{Given the recent development in embedded devices, wireless senor nodes are no longer limited to data collection but they can also do processing (e.g., smartphones). Accordingly, new types of applications take an advantage of the processing and flexibility provided by the wireless network. A common property between these applications is that the processing is not running on only one single node, but it is broken-down into smaller tasks that can run over multiple nodes, i.e., exploiting the in-network processing. We study a special variant of in-network processing, where the application is given by a graph; the processing tasks have predefined connections to be executed in a predefined sequence. The problem of embedding an application graph into a network is commonly known as Virtual Network Embedding (VNE). In this paper, we present a Genetic Algorithm (GA) solution to solve this wireless VNE problem, where we take into account the interference and multi-cast properties. We show that the GA has a good performance and fast execution compared to the optimization problem.}},
  author       = {{Afifi, Haitham and Horbach, Konrad and Karl, Holger}},
  booktitle    = {{2019 International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob) (WiMob 2019)}},
  title        = {{{A Genetic Algorithm Framework for Solving Wireless Virtual Network Embedding}}},
  year         = {{2019}},
}

@phdthesis{13124,
  author       = {{Dräxler, Sevil}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Scaling, placement, and routing for pliable virtualized composed services}}},
  year         = {{2019}},
}

@phdthesis{13125,
  author       = {{Görzen, Thomas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Essays on Crowd Based Idea Evaluation - Empirical Evidence from an Anonymous Online Crowd}}},
  year         = {{2019}},
}

@phdthesis{13126,
  author       = {{Khaluf, Lial}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Organic Programming of Dynamic Real-Time Applications}}},
  year         = {{2019}},
}

@misc{13128,
  author       = {{Bröcher, Henrik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Rational Secure Multiparty Computation}}},
  year         = {{2019}},
}

@inproceedings{13132,
  author       = {{Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke}},
  booktitle    = {{INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft}},
  location     = {{Kassel}},
  pages        = {{ 273--274 }},
  publisher    = {{Gesellschaft für Informatik e.V.}},
  title        = {{{From Automated to On-The-Fly Machine Learning}}},
  year         = {{2019}},
}

@inproceedings{13138,
  abstract     = {{Mobile app stores like Apple's AppStore or Google's PlayStore are highly competitive markets for third-party developers wanting to develop successful applications. During the development process, many developers focus on the multitude of product functions but neglect the business model as an equally important part. As a result, developers often fail to meet customer needs, leading to unnecessary development costs and poor market penetration. This, in turn, raises the question of how we intertwine the business model and product functions during the development process to ensure a better alignment between the two.
In this paper, we show this intertwined development by adapting the concept of Twin Peaks to the business model and product functions. Based on feature modeling as an abstraction layer, we introduce the concept of a Business Model Decision Line (BMDL) to structure the business model decisions and their relation to product functions structured in a Software Product Line (SPL). The basis of our feature models is the analysis of top listed applications in the app stores of Apple and Google. To create and modify both models, we provide an incremental feature structuring and iterative feature selection process. This combination of abstraction layer and development process supports third-party developers to build successful applications both from a business and a product perspective. 
}},
  author       = {{Gottschalk, Sebastian and Rittmeier, Florian and Engels, Gregor}},
  booktitle    = {{Software Business}},
  editor       = {{Hyrynsalmi, Sami and Suoranta, Mari and Nguyen-Duc, Anh and Tyrväinen, Pasi and Abrahamsson, Pekka}},
  keywords     = {{Intertwined Development, Twin Peaks, Feature Model, Business Model, Product Functions}},
  location     = {{ Jyväskylä}},
  number       = {{1}},
  pages        = {{192--207}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Intertwined Development of Business Model and Product Functions for Mobile Applications: A Twin Peak Feature Modeling Approach}}},
  doi          = {{10.1007/978-3-030-33742-1_16}},
  volume       = {{370}},
  year         = {{2019}},
}

@inproceedings{13140,
  author       = {{Weidmann, Nils and Anjorin, Anthony and Stolte, Florian and Kraus, Florian}},
  booktitle    = {{Proceedings of the 12th International Conference on Graph Transformation, ICGT 2019, Held as Part of STAF 2019}},
  editor       = {{Guerra, Esther and Orejas, Fernando}},
  location     = {{Eindhoven, The Netherlands}},
  pages        = {{195--211}},
  publisher    = {{Springer}},
  title        = {{{From Pattern Invocation Networks to Rule Preconditions}}},
  doi          = {{10.1007/978-3-030-23611-3\_12}},
  year         = {{2019}},
}

@inproceedings{13141,
  author       = {{Weidmann, Nils and Anjorin, Anthony and Robrecht, Patrick and Varró, Gergely}},
  booktitle    = {{Proceedings of the 12th International Conference on Graph Transformation, ICGT 2019, Held as Part of STAF 2019}},
  editor       = {{Guerra, Esther and Orejas, Fernando}},
  location     = {{Eindhoven, The Netherlands}},
  pages        = {{131--140}},
  publisher    = {{Springer}},
  title        = {{{Incremental (Unidirectional) Model Transformation with eMoflon::IBeX}}},
  doi          = {{10.1007/978-3-030-23611-3\_8}},
  year         = {{2019}},
}

@inproceedings{13142,
  author       = {{Weidmann, Nils and Anjorin, Anthony and Fritsche, Lars and Varró, Gergely and Schürr, Andy and Leblebici, Erhan}},
  booktitle    = {{Proceedings of the 8th International Workshop on Bidirectional Transformations co-located with the Philadelphia Logic Week, Bx@PLW 2019}},
  editor       = {{Cheney, James and Ko, Hsiang-Shang}},
  location     = {{Philadelphia, PA, USA}},
  pages        = {{45--55}},
  publisher    = {{CEUR-WS.org}},
  title        = {{{Incremental Bidirectional Model Transformation with eMoflon::IBeX}}},
  year         = {{2019}},
}

@inproceedings{13144,
  author       = {{El Baff, Roxanne and Wachsmuth, Henning and Al-Khatib, Khalid and Stede, Manfred and Stein, Benno}},
  booktitle    = {{Proceedings of the 12th International Conference on Natural Language Generation}},
  location     = {{Tokyo, Japan}},
  pages        = {{54--64}},
  publisher    = {{Association for Computational Linguistics}},
  title        = {{{Computational Argumentation Synthesis as a Language Modeling Task}}},
  year         = {{2019}},
}

@inproceedings{13182,
  abstract     = {{We consider congestion control in peer-to-peer distributed systems. 
The problem can be reduced to the following scenario: Consider a set $V$ of $n$ peers (called \emph{clients} in this paper) that want to send messages to a fixed common peer (called \emph{server} in this paper).
We assume that each client $v \in V$ sends a message with probability $p(v) \in [0,1)$ and the server has a capacity of $\sigma \in \mathbb{N}$, i.e., it can recieve at most $\sigma$ messages per round and excess messages are dropped.
The server can modify these probabilities when clients send messages.
Ideally, we wish to converge to a state with $\sum p(v) = \sigma$ and $p(v) = p(w)$ for all $v,w \in V$.	

We propose a \emph{loosely} self-stabilizing protocol with a slightly relaxed legitimate state.   
Our protocol lets the system converge from \emph{any} initial state to a state where $\sum p(v) \in \left[\sigma \pm \epsilon\right]$ and $|p(v)-p(w)| \in O(\frac{1}{n})$. 
This property is then maintained for $\Omega(n^{\mathfrak{c}})$ rounds in expectation.
In particular, the initial client probabilities and server variables are not necessarily well-defined, i.e., they may have arbitrary values.

Our protocol uses only $O(W + \log n)$ bits of memory where $W$ is length of node identifiers, making it very lightweight.
Finally we state a lower bound on the convergence time an see that our protocol performs asymptotically optimal (up to some polylogarithmic factor).
}},
  author       = {{Feldmann, Michael and Götte, Thorsten and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
  pages        = {{149--164}},
  publisher    = {{Springer, Cham}},
  title        = {{{A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory}}},
  doi          = {{https://doi.org/10.1007/978-3-030-34992-9_13}},
  year         = {{2019}},
}

@inproceedings{13261,
  author       = {{Wolters, Dennis and Kirchhoff, Jonas and Engels, Gregor}},
  booktitle    = {{Service-Oriented Computing – ICSOC 2019 Workshops}},
  editor       = {{Yangui, Sami and Bouguettaya, Athman and Xue, Xiao and Faci, Noura and Gaaloul, Walid and Yu, Qi and Zhou, Zhangbing and Hernandez, Nathalie and Nakagawa, Elisa Y.}},
  pages        = {{30--41}},
  publisher    = {{Springer}},
  title        = {{{Specifying Web Interfaces for Command-line Applications Based on OpenAPI}}},
  doi          = {{10.1007/978-3-030-45989-5\_3}},
  volume       = {{12019}},
  year         = {{2019}},
}

@inproceedings{13292,
  abstract     = {{Building on 5G and network function virtualization (NFV), smart manufacturing has the potential to drastically increase productivity, reduce cost, and introduce novel, flexible manufacturing services. Current work mostly focuses on high-level scenarios or emulation-based prototype deployments. 

Extending our previous work, we showcase one of the first cloud-native 5G verticals focusing on the deployment of smart manufacturing use cases on production infrastructure. In particular, we use the 5GTANGO service platform to deploy our developed network services on Kubernetes. For this demo, we implemented a series of cloud-native virtualized network functions (VNFs) and created suitable service descriptors. Their light-weight, stateless deployment on Kubernetes enables quick instantiation, scalability, and robustness.}},
  author       = {{Schneider, Stefan Balthasar and Peuster, Manuel and Hannemann, Kai and Behnke, Daniel and Müller, Marcel and Bök, Patrick-Benjamin and Karl, Holger}},
  booktitle    = {{IEEE Conference on Network Function Virtualization and Software Defined Networks (NFV-SDN) Demo Track}},
  keywords     = {{5G, NFV, Smart Manufacturing, Cloud-Native, Kubernetes}},
  location     = {{Dallas, TX, USA}},
  publisher    = {{IEEE}},
  title        = {{{"Producing Cloud-Native": Smart Manufacturing Use Cases on Kubernetes}}},
  year         = {{2019}},
}