@article{21092,
  abstract     = {{Automated Machine Learning (AutoML) seeks to automatically find so-called machine learning pipelines that maximize the prediction performance when being used to train a model on a given dataset. One of the main and yet open challenges in AutoML is an effective use of computational resources: An AutoML process involves the evaluation of many candidate pipelines, which   are costly but often ineffective because they are canceled due to a timeout.
In this paper, we present an approach to predict the runtime of two-step machine learning pipelines with up to one pre-processor, which can be used to anticipate whether or not a pipeline will time out. Separate runtime models are trained offline for each algorithm that may be used in a pipeline, and an overall prediction is derived from these models. We empirically show that the approach increases successful evaluations made by an AutoML tool while preserving or even improving on the previously best solutions.}},
  author       = {{Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke}},
  journal      = {{IEEE Transactions on Pattern Analysis and Machine Intelligence}},
  publisher    = {{IEEE}},
  title        = {{{Predicting Machine Learning Pipeline Runtimes in the Context of Automated Machine Learning}}},
  year         = {{2021}},
}

@misc{21197,
  author       = {{Mengshi, Ma}},
  title        = {{{Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}}},
  year         = {{2021}},
}

@article{21337,
  abstract     = {{We present a flexible trust region descend algorithm for unconstrained and
convexly constrained multiobjective optimization problems. It is targeted at
heterogeneous and expensive problems, i.e., problems that have at least one
objective function that is computationally expensive. The method is
derivative-free in the sense that neither need derivative information be
available for the expensive objectives nor are gradients approximated using
repeated function evaluations as is the case in finite-difference methods.
Instead, a multiobjective trust region approach is used that works similarly to
its well-known scalar pendants. Local surrogate models constructed from
evaluation data of the true objective functions are employed to compute
possible descent directions. In contrast to existing multiobjective trust
region algorithms, these surrogates are not polynomial but carefully
constructed radial basis function networks. This has the important advantage
that the number of data points scales linearly with the parameter space
dimension. The local models qualify as fully linear and the corresponding
general scalar framework is adapted for problems with multiple objectives.
Convergence to Pareto critical points is proven and numerical examples
illustrate our findings.}},
  author       = {{Berkemeier, Manuel Bastian and Peitz, Sebastian}},
  issn         = {{2297-8747}},
  journal      = {{Mathematical and Computational Applications}},
  number       = {{2}},
  title        = {{{Derivative-Free Multiobjective Trust Region Descent Method Using Radial  Basis Function Surrogate Models}}},
  doi          = {{10.3390/mca26020031}},
  volume       = {{26}},
  year         = {{2021}},
}

@inproceedings{21378,
  author       = {{Hartel, Rita and Dunst, Alexander}},
  booktitle    = {{MANPU 2020: The 4th International Workshop on coMics ANalysis, Processing and Understanding@Pattern Recognition. ICPR International Workshops and Challenges}},
  isbn         = {{9783030687793}},
  issn         = {{0302-9743}},
  title        = {{{An OCR Pipeline and Semantic Text Analysis for Comics}}},
  doi          = {{10.1007/978-3-030-68780-9_19}},
  year         = {{2021}},
}

@article{21535,
  author       = {{Bengs, Viktor and Busa-Fekete, Róbert and El Mesaoudi-Paul, Adil and Hüllermeier, Eyke}},
  journal      = {{Journal of Machine Learning Research}},
  number       = {{7}},
  pages        = {{1--108}},
  title        = {{{Preference-based Online Learning with Dueling Bandits: A Survey}}},
  volume       = {{22}},
  year         = {{2021}},
}

@inproceedings{21543,
  abstract     = {{Services often consist of multiple chained components such as microservices in a service mesh, or machine learning functions in a pipeline. Providing these services requires online coordination including scaling the service, placing instance of all components in the network, scheduling traffic to these instances, and routing traffic through the network. Optimized service coordination is still a hard problem due to many influencing factors such as rapidly arriving user demands and limited node and link capacity. Existing approaches to solve the problem are often built on rigid models and assumptions, tailored to specific scenarios. If the scenario changes and the assumptions no longer hold, they easily break and require manual adjustments by experts. Novel self-learning approaches using deep reinforcement learning (DRL) are promising but still have limitations as they only address simplified versions of the problem and are typically centralized and thus do not scale to practical large-scale networks.

To address these issues, we propose a distributed self-learning service coordination approach using DRL. After centralized training, we deploy a distributed DRL agent at each node in the network, making fast coordination decisions locally in parallel with the other nodes. Each agent only observes its direct neighbors and does not need global knowledge. Hence, our approach scales independently from the size of the network. In our extensive evaluation using real-world network topologies and traffic traces, we show that our proposed approach outperforms a state-of-the-art conventional heuristic as well as a centralized DRL approach (60% higher throughput on average) while requiring less time per online decision (1 ms).}},
  author       = {{Schneider, Stefan Balthasar and Qarawlus, Haydar and Karl, Holger}},
  booktitle    = {{IEEE International Conference on Distributed Computing Systems (ICDCS)}},
  keywords     = {{network management, service management, coordination, reinforcement learning, distributed}},
  location     = {{Washington, DC, USA}},
  publisher    = {{IEEE}},
  title        = {{{Distributed Online Service Coordination Using Deep Reinforcement Learning}}},
  year         = {{2021}},
}

@techreport{21569,
  abstract     = {{Die kontinuierliche Weiterentwicklung des eigenen Geschäftsmodells ist für eine Organisation von entscheidender Bedeutung, um wettbewerbsfähig und somit nachhaltig erfolgreich zu bleiben. Während für die Entwicklung neuer Geschäftsmodelle häufig Workshops und einfache Software-Tools zur Visualisierung genutzt werden, wurden in der Forschung bereits erste Ansätze von datengetriebener Geschäftsmodellentwicklung (GME) vorgestellt. Diese Ansätze nutzen dabei Daten, Informationen oder auch Wissen aus internen und externen Unternehmensquellen, um den GME-Prozess zu unterstützen. Innerhalb dieses Beitrags zeigen wir einige Ansätze aus der aktuellen Literatur und analysieren wie ihre Datennutzung den GME-Prozess unterstützt. Weiterhin stellen wir mit dem BMDL Feature Modeler ein Tool vor, welches den GME-Prozess mit Expertenwissen unterstützt.}},
  author       = {{Gottschalk, Sebastian and Yigitbas, Enes}},
  publisher    = {{Gesellschaft für Informatik}},
  title        = {{{Von datenbasierter zu datengetriebener Geschäftsmodellentwicklung: Ein Überblick über Software-Tools  und deren Datennutzung}}},
  volume       = {{1}},
  year         = {{2021}},
}

@inproceedings{21570,
  author       = {{Tornede, Tanja and Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference}},
  title        = {{{Coevolution of Remaining Useful Lifetime Estimation Pipelines for Automated Predictive Maintenance}}},
  year         = {{2021}},
}

@article{21595,
  author       = {{Stockmann, Lars and Laux, Sven and Bodden, Eric}},
  issn         = {{2589-2258}},
  journal      = {{Journal of Automotive Software Engineering}},
  title        = {{{Using Architectural Runtime Verification for Offline Data Analysis}}},
  doi          = {{10.2991/jase.d.210205.001}},
  year         = {{2021}},
}

@phdthesis{21596,
  author       = {{Fischer, Andreas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Computing on Encrypted Data using Trusted Execution Environments}}},
  year         = {{2021}},
}

@article{21597,
  author       = {{Holzinger, Philipp and Bodden, Eric}},
  journal      = {{International Symposium on Advanced Security on Software and Systems (ASSS)}},
  title        = {{{A Systematic Hardening of Java's Information Hiding}}},
  year         = {{2021}},
}

@article{21599,
  author       = {{Bonifacio, Rodrigo and Krüger, Stefan and Narasimhan, Krishna and Bodden, Eric and Mezini, Mira}},
  journal      = {{European Conference on Object-Oriented Programming (ECOOP)}},
  title        = {{{Dealing with Variability in API Misuse Specification}}},
  year         = {{2021}},
}

@misc{21601,
  abstract     = {{The invention describes a distributed merchandise management system, in which the client, retailer and the manufacturer are linked by a network. This is implemented by a cloud storage (105), the cloud storage (105) comprising a means (105 a) for storing data, a means for receiving first data from a first network node (110), the first data being associated with a physical object, a means for receiving request data from a second network node (120), a means for receiving second data from a third network node (130), the second data being associated with the first data and comprising at least one data piece adapted to change the first data depending on the received request data, a means for changing the first data based at least in part on the second data and the request data, and a means for sending a changed portion of the first data from the cloud storage (105) to the first network node (110).}},
  author       = {{Göllner, Thomas and Schwarz, Jan-Hendrik and Gottschalk, Sebastian and Sauer, Stefan}},
  title        = {{{Distributed merchandise management system}}},
  year         = {{2021}},
}

@inproceedings{21610,
  author       = {{Awais, Muhammad and Ghasemzadeh Mohammadi, Hassan and Platzner, Marco}},
  booktitle    = {{Proceedings of the ACM Great Lakes Symposium on VLSI (GLSVLSI) 2021}},
  location     = {{Virtual}},
  pages        = {{27--32}},
  publisher    = {{ACM}},
  title        = {{{LDAX: A Learning-based Fast Design Space Exploration Framework for Approximate Circuit Synthesis}}},
  doi          = {{https://doi.org/10.1145/3453688.3461506}},
  year         = {{2021}},
}

@misc{21627,
  author       = {{Liedtke, David}},
  title        = {{{Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}}},
  year         = {{2021}},
}

@phdthesis{21628,
  abstract     = {{This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.

In the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.
Our protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.
We furthermore provide a protocol that handles joining and leaving nodes.
As an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.
	
The second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.
We present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.
Each of those protocols comes with unique properties that makes it interesting for certain distributed applications.
Generalized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.
The protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.
The supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.
}},
  author       = {{Feldmann, Michael}},
  title        = {{{Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}}},
  doi          = {{10.17619/UNIPB/1-1113}},
  year         = {{2021}},
}

@inproceedings{21639,
  abstract     = {{The development of effective business models is an essential task in highly competitive markets like mobile ecosystems. Existing development methods for these business models do not specifically focus that the development process profoundly depends on the situation (e.g., market size, regulations) of the mobile app developer. Here, a mismatch between method and situation can lead to poor resource management and longer development cycles. In software engineering, situational method engineering is used for software projects to configure a development method out of a method repository based on the project situation. Analogously, we support creating situation-specific business model development methods with a method base and new user roles. Here, the method engineer obtains the knowledge of the domain expert and stores it in the method base as elements, building blocks, and patterns. The expert knowledge is derived from a grey literature review on mobile development processes. After this, the method engineer constructs the development method based on the described situation of the business developer. We provide an open-source tool and evaluate it by constructing a local event platform's business model development method.    }},
  author       = {{Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}},
  booktitle    = {{Enterprise, Business-Process and Information Systems Modeling}},
  keywords     = {{Business Model Development, Situational Method Engineering, Mobile App, Business Model Development Tools}},
  publisher    = {{Springer}},
  title        = {{{Situation-specific Business Model Development Methods for Mobile App Developers}}},
  doi          = {{10.1007/978-3-030-79186-5_17}},
  year         = {{2021}},
}

@book{23458,
  author       = {{Dumitrescu, Roman and Albers, Albert and Gausemeier, Jürgen and Riedel, Oliver and Stark, Rainer}},
  publisher    = {{Fraunhofer-Institut für Entwurfstechnik Mechatronik IEM, Paderborn}},
  title        = {{{Engineering in Deutschland – Status quo in Wirtschaft und Wissenschaft. Ein Beitrag zum Advanced Systems Engineering}}},
  year         = {{2021}},
}

@article{23466,
  abstract     = {{<jats:title>Abstract</jats:title>
               <jats:p>The term graphic novel has increasingly functioned as a catalyst for understanding comic books as an emergent literary genre. This article focuses on one specific element within this historical process: the claim, made by artists such as Alan Moore, that graphic novels are characterized by greater formal complexity, or density, than serial comics. These claims are evaluated by combining computational text and image recognition of a corpus of 131 graphic narratives with sociological metadata on production and circulation. The results show that Moore’s own book-length comics, in particular <jats:italic>Watchmen</jats:italic> and <jats:italic>V for Vendetta</jats:italic>, rank among the densest graphic narratives in the sample in both their visual and textual content. Graphic memoirs, in contrast, only show an increase in textual complexity. With Pierre Bourdieu, the article understands complexity as a social and aesthetic strategy that aims at increasing the cultural capital of comics creators. At the same time, the article contextualizes computational results against the background of a changing marketplace for comics, in particular the decline of serial comics, the shift towards digital printing, and increased access to book distribution. This analysis shows that graphic narratives pursue both literary and popular aesthetic strategies, challenging Bourdieu’s account of a clear opposition between profit and prestige in cultural production.</jats:p>}},
  author       = {{Dunst, Alexander and Hartel, Rita}},
  issn         = {{1865-8938}},
  journal      = {{Anglia}},
  number       = {{1}},
  pages        = {{195--223}},
  title        = {{{Computing Literary Surplus Value: Alan Moore and the Density of the Comic Book as Graphic Novel}}},
  doi          = {{10.1515/ang-2021-0010}},
  volume       = {{139}},
  year         = {{2021}},
}

@article{23525,
  abstract     = {{<jats:title>Abstract</jats:title><jats:p>In the field of Model-Driven Engineering, Triple Graph Grammars
(TGGs) play an important role as a rule-based means of implementing
consistency management. From a declarative specification of a
consistency relation, several operations including forward and
backward transformations, (concurrent) synchronisation, and
consistency checks can be automatically derived. For TGGs to be
applicable in realistic application scenarios, expressiveness in
terms of supported language features is very important. A TGG tool
is schema compliant if it can take domain constraints, such as
multiplicity constraints in a meta-model, into account when
performing consistency management tasks. To guarantee schema
compliance, most TGG tools allow application conditions to be
attached as necessary to relevant rules. This strategy is
problematic for at least two reasons: First, ensuring compliance to
a sufficiently expressive schema for all previously mentioned
derived operations is still an open challenge; to the best of our
knowledge, all existing TGG tools only support a very restricted
subset of application conditions. Second, it is conceptually
demanding for the user to indirectly specify domain constraints as
application conditions, especially because this has to be completely
revisited every time the TGG or domain constraint is changed. While
domain constraints can in theory be automatically transformed to
obtain the required set of application conditions, this has only
been successfully transferred to TGGs for a very limited subset of
domain constraints. To address these limitations, this paper
proposes a search-based strategy for achieving schema compliance. We
show that all correctness and completeness properties, previously
proven in a setting without domain constraints, still hold when
schema compliance is to be additionally guaranteed. An
implementation and experimental evaluation are provided to support
our claim of practical applicability.</jats:p>}},
  author       = {{Weidmann, Nils and Anjorin, Anthony}},
  issn         = {{0934-5043}},
  journal      = {{Formal Aspects of Computing}},
  publisher    = {{Springer}},
  title        = {{{Schema Compliant Consistency Management via Triple Graph Grammars and Integer Linear Programming}}},
  doi          = {{10.1007/s00165-021-00557-0}},
  year         = {{2021}},
}