@inproceedings{29220,
  abstract     = {{Modern services often comprise several components, such as chained virtual network functions, microservices, or
machine learning functions. Providing such services requires to decide how often to instantiate each component, where to place these instances in the network, how to chain them and route traffic through them. 
To overcome limitations of conventional, hardwired heuristics, deep reinforcement learning (DRL) approaches for self-learning network and service management have emerged recently. These model-free DRL approaches are more flexible but typically learn tabula rasa, i.e., disregard existing understanding of networks, services, and their coordination. 

Instead, we propose FutureCoord, a novel model-based AI approach that leverages existing understanding of networks and services for more efficient and effective coordination without time-intensive training. FutureCoord combines Monte Carlo Tree Search with a stochastic traffic model. This allows FutureCoord to estimate the impact of future incoming traffic and effectively optimize long-term effects, taking fluctuating demand and Quality of Service (QoS) requirements into account. Our extensive evaluation based on real-world network topologies, services, and traffic traces indicates that FutureCoord clearly outperforms state-of-the-art model-free and model-based approaches with up to 51% higher flow success ratios.}},
  author       = {{Werner, Stefan and Schneider, Stefan Balthasar and Karl, Holger}},
  booktitle    = {{IEEE/IFIP Network Operations and Management Symposium (NOMS)}},
  keywords     = {{network management, service management, AI, Monte Carlo Tree Search, model-based, QoS}},
  location     = {{Budapest}},
  publisher    = {{IEEE}},
  title        = {{{Use What You Know: Network and Service Coordination Beyond Certainty}}},
  year         = {{2022}},
}

@inproceedings{29302,
  abstract     = {{This paper introduces the project Scale4Edge. The project is focused on enabling an effective RISC-V ecosystem for optimization of edge applications. We describe the basic components of this ecosystem and introduce the envisioned
demonstrators, which will be used in their evaluation.}},
  author       = {{Ecker, Wolfgang and Adelt, Peer and Müller, Wolfgang and Heckmann, Reinhold and Krstic, Milos and Herdt, Vladimir and Drechsler, Rolf and Angst, Gerhard and Wimmer, Ralf and Mauderer, Andreas and Stahl, Rafael and Emrich, Karsten and Mueller-Gritschneder, Daniel and Becker, Bernd and Scholl, Philipp and Jentzsch, Eyck and Schlamelcher, Jan and Grüttner, Kim and Bernardo, Paul Palomero and Brinkmann, Oliver and Damian, Mihaela and Oppermann, Julian and Koch, Andreas and Bormann, Jörg and Partzsch, Johannes and Mayr, Christian and Kunz, Wolfgang}},
  booktitle    = {{In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)}},
  title        = {{{The Scale4Edge RISC-V Ecosystem}}},
  year         = {{2022}},
}

@article{27776,
  author       = {{Koldewey, Christian and Rasor, Anja and Reinhold, Jannik and Gausemeier, Jürgen and Dumitrescu, Roman and Chohan, Nadia and Frank, Maximilian}},
  issn         = {{0040-1625}},
  journal      = {{Technological Forecasting and Social Change}},
  publisher    = {{Elsevier}},
  title        = {{{Aligning strategic position, behavior, and structure for smart service businesses in manufacturing}}},
  doi          = {{10.1016/j.techfore.2021.121329}},
  year         = {{2022}},
}

@unpublished{29541,
  author       = {{Lienen, Christian and Platzner, Marco}},
  title        = {{{ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications}}},
  year         = {{2022}},
}

@phdthesis{29763,
  abstract     = {{Modern-day communication has become more and more digital. While this comes with many advantages such as a more efficient economy, it has also created more and more opportunities for various adversaries to manipulate communication or eavesdrop on it. The Snowden revelations in 2013 further highlighted the seriousness of these threats. To protect the communication of people, companies, and states from such threats, we require cryptography with strong security guarantees.
Different applications may require different security properties from cryptographic schemes. For most applications, however, so-called adaptive security is considered a reasonable minimal requirement of security. Cryptographic schemes with adaptive security remain secure in the presence of an adversary that can corrupt communication partners to respond to messages of the adversaries choice, while the adversary may choose the messages based on previously observed interactions.
While cryptography is associated the most with encryption, this is only one of many primitives that are essential for the security of digital interactions. This thesis presents novel identity-based encryption (IBE) schemes and verifiable random functions (VRFs) that achieve adaptive security as outlined above. Moreover, the cryptographic schemes presented in this thesis are proven secure in the standard model. That is without making use of idealized models like the random oracle model.}},
  author       = {{Niehues, David}},
  keywords     = {{public-key cryptography, lattices, pairings, verifiable random functions, identity-based encryption}},
  title        = {{{More Efficient Techniques for Adaptively-Secure Cryptography}}},
  doi          = {{10.25926/rdtq-jw45}},
  year         = {{2022}},
}

@inproceedings{31068,
  author       = {{Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning}},
  booktitle    = {{EUROCALL}},
  title        = {{{Investigating the argumentation structures of EFL learners from diverse language backgrounds}}},
  year         = {{2022}},
}

@article{29351,
  abstract     = {{Safety-critical systems have to follow extremely high dependability requirements as specified in the standards for automotive, air, and space applications. The required high fault coverage at runtime is usually obtained by a combination of concurrent error detection or correction and periodic tests within rather short time intervals. The concurrent scheme ensures the integrity of computed results while the periodic test has to identify potential aging problems and to prevent any fault accumulation which may invalidate the concurrent error detection mechanism. Such periodic built-in self-test (BIST) schemes are already commercialized for memories and for random logic. The paper at hand extends this approach to interconnect structures. A BIST scheme is presented which targets interconnect defects before they will actually affect the system functionality at nominal speed. A BIST schedule is developed which significantly reduces aging caused by electromigration during the lifetime application of the periodic test.}},
  author       = {{Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}},
  issn         = {{0923-8174}},
  journal      = {{Journal of Electronic Testing}},
  keywords     = {{Electrical and Electronic Engineering}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Stress-Aware Periodic Test of Interconnects}}},
  doi          = {{10.1007/s10836-021-05979-5}},
  year         = {{2022}},
}

@misc{29890,
  author       = {{Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}},
  keywords     = {{WORKSHOP}},
  pages        = {{2}},
  publisher    = {{European Workshop on Silicon Lifecycle Management, March 18, 2022}},
  title        = {{{EM-Aware Interconnect BIST}}},
  year         = {{2022}},
}

@article{31479,
  author       = {{Baswana, Surender and Gupta, Shiv and Knollmann, Till}},
  issn         = {{0178-4617}},
  journal      = {{Algorithmica}},
  keywords     = {{Applied Mathematics, Computer Science Applications, General Computer Science}},
  publisher    = {{Springer Science and Business Media LLC}},
  title        = {{{Mincut Sensitivity Data Structures for the Insertion of an Edge}}},
  doi          = {{10.1007/s00453-022-00978-0}},
  year         = {{2022}},
}

@phdthesis{31556,
  abstract     = {{Mehrzieloptimierung behandelt Probleme, bei denen mehrere skalare Zielfunktionen simultan optimiert werden sollen. Ein Punkt ist in diesem Fall optimal, wenn es keinen anderen Punkt gibt, der mindestens genauso gut ist in allen Zielfunktionen und besser in mindestens einer Zielfunktion. Ein notwendiges Optimalitätskriterium lässt sich über Ableitungsinformationen erster Ordnung der Zielfunktionen herleiten. Die Menge der Punkte, die dieses notwendige Kriterium erfüllen, wird als Pareto-kritische Menge bezeichnet. Diese Arbeit enthält neue Resultate über Pareto-kritische Mengen für glatte und nicht-glatte Mehrzieloptimierungsprobleme, sowohl was deren Berechnung betrifft als auch deren Struktur. Im glatten Fall erfolgt die Berechnung über ein Fortsetzungsverfahren, im nichtglatten Fall über ein Abstiegsverfahren. Anschließend wird die Struktur des Randes der Pareto-kritischen Menge analysiert, welcher aus Pareto-kritischen Mengen kleinerer Subprobleme besteht. Schlussendlich werden inverse Probleme betrachtet, bei denen zu einer gegebenen Datenmenge ein Zielfunktionsvektor gefunden werden soll, für den die Datenpunkte kritisch sind.}},
  author       = {{Gebken, Bennet}},
  title        = {{{Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization}}},
  doi          = {{10.17619/UNIPB/1-1327}},
  year         = {{2022}},
}

@article{31574,
  abstract     = {{We model negative polarization, which is observed for planetary regoliths at backscattering, solving a full wave problem of light scattering with a numerically exact Discontinuous Galerkin Time Domain (DGTD) method. Pieces of layers with the bulk packing density of particles close to 0.5 are used. The model particles are highly absorbing and have irregular shapes and sizes larger than the wavelength of light. This represents a realistic analog of low-albedo planetary regoliths. Our simulations confirm coherent backscattering mechanism of the origin of negative polarization. We show that angular profiles of polarization are stabilized if the number of particles in a layer piece becomes larger than ten. This allows application of our approach to the negative polarization modeling for planetary regoliths.}},
  author       = {{Grynko, Yevgen and Shkuratov, Yuriy and Alhaddad, Samer and Förstner, Jens}},
  issn         = {{0019-1035}},
  journal      = {{Icarus}},
  keywords     = {{tet_topic_scattering}},
  pages        = {{115099}},
  publisher    = {{Elsevier BV}},
  title        = {{{Negative polarization of light at backscattering from a numerical analog of planetary regoliths}}},
  doi          = {{10.1016/j.icarus.2022.115099}},
  volume       = {{384}},
  year         = {{2022}},
}

@inbook{32792,
  abstract     = {{Decision makers in complex business environments have different goals and constraints and therefore require tailored decision support systems (DSS). Following a low-code approach, a tailored DSS can be created by a decision maker as a process-based composition of existing, interoperable decision support services. Data incompatibilities may be introduced during the design or execution of such a process-driven DSS, e.g., when a service always generates or a decision maker selects data which violates a data constraint of a subsequent service. These incompatibilities cause interrupted or erroneous decision processes. In this paper, we contribute an approach which enables the detection of data incompatibilities in process-driven DSS during process design and execution. Our approach utilizes the JSON Schema specification to define service interfaces and associated type constraints which data produced by services or decision makers can be validated against. We demonstrate our approach in the context of decision support for energy network planning using a prototypical open-source implementation.}},
  author       = {{Kirchhoff, Jonas and Gottschalk, Sebastian and Engels, Gregor}},
  booktitle    = {{Lecture Notes in Business Information Processing}},
  isbn         = {{9783031115097}},
  issn         = {{1865-1348}},
  publisher    = {{Springer International Publishing}},
  title        = {{{Detecting Data Incompatibilities in Process-Driven Decision Support Systems}}},
  doi          = {{10.1007/978-3-031-11510-3_6}},
  year         = {{2022}},
}

@inproceedings{32796,
  author       = {{Böcker, Joachim}},
  booktitle    = {{2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)}},
  location     = {{Sorrento, Italy}},
  publisher    = {{IEEE}},
  title        = {{{Concept Study of an LLC Converter with Magnetically Resonant Inductor}}},
  doi          = {{10.1109/speedam53979.2022.9842047}},
  year         = {{2022}},
}

@misc{33033,
  author       = {{Fehring, Lukas}},
  title        = {{{Combined Ranking and Regression Trees for Algorithm Selection}}},
  year         = {{2022}},
}

@unpublished{30867,
  abstract     = {{In online algorithm selection (OAS), instances of an algorithmic problem
class are presented to an agent one after another, and the agent has to quickly
select a presumably best algorithm from a fixed set of candidate algorithms.
For decision problems such as satisfiability (SAT), quality typically refers to
the algorithm's runtime. As the latter is known to exhibit a heavy-tail
distribution, an algorithm is normally stopped when exceeding a predefined
upper time limit. As a consequence, machine learning methods used to optimize
an algorithm selection strategy in a data-driven manner need to deal with
right-censored samples, a problem that has received little attention in the
literature so far. In this work, we revisit multi-armed bandit algorithms for
OAS and discuss their capability of dealing with the problem. Moreover, we
adapt them towards runtime-oriented losses, allowing for partially censored
data while keeping a space- and time-complexity independent of the time
horizon. In an extensive experimental evaluation on an adapted version of the
ASlib benchmark, we demonstrate that theoretically well-founded methods based
on Thompson sampling perform specifically strong and improve in comparison to
existing methods.}},
  author       = {{Tornede, Alexander and Bengs, Viktor and Hüllermeier, Eyke}},
  booktitle    = {{Proceedings of the 36th AAAI Conference on Artificial Intelligence}},
  publisher    = {{AAAI}},
  title        = {{{Machine Learning for Online Algorithm Selection under Censored Feedback}}},
  year         = {{2022}},
}

@unpublished{30865,
  abstract     = {{The problem of selecting an algorithm that appears most suitable for a
specific instance of an algorithmic problem class, such as the Boolean
satisfiability problem, is called instance-specific algorithm selection. Over
the past decade, the problem has received considerable attention, resulting in
a number of different methods for algorithm selection. Although most of these
methods are based on machine learning, surprisingly little work has been done
on meta learning, that is, on taking advantage of the complementarity of
existing algorithm selection methods in order to combine them into a single
superior algorithm selector. In this paper, we introduce the problem of meta
algorithm selection, which essentially asks for the best way to combine a given
set of algorithm selectors. We present a general methodological framework for
meta algorithm selection as well as several concrete learning methods as
instantiations of this framework, essentially combining ideas of meta learning
and ensemble learning. In an extensive experimental evaluation, we demonstrate
that ensembles of algorithm selectors can significantly outperform single
algorithm selectors and have the potential to form the new state of the art in
algorithm selection.}},
  author       = {{Tornede, Alexander and Gehring, Lukas and Tornede, Tanja and Wever, Marcel Dominik and Hüllermeier, Eyke}},
  booktitle    = {{Machine Learning}},
  title        = {{{Algorithm Selection on a Meta Level}}},
  year         = {{2022}},
}

@unpublished{33150,
  abstract     = {{In this article, we build on previous work to present an optimization algorithm for nonlinearly constrained multi-objective optimization problems. The algorithm combines a surrogate-assisted derivative-free trust-region approach with the filter method known from single-objective optimization. Instead of the true objective and constraint functions, so-called fully linear models are employed and we show how to deal with the gradient inexactness in the composite step setting, adapted from single-objective optimization as well. Under standard assumptions, we prove convergence of a subset of iterates to a quasi-stationary point and if constraint qualifications hold, then the limit point is also a KKT-point of the multi-objective problem.}},
  author       = {{Berkemeier, Manuel Bastian and Peitz, Sebastian}},
  booktitle    = {{arXiv:2208.12094}},
  title        = {{{Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients}}},
  year         = {{2022}},
}

@inproceedings{33230,
  author       = {{Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}},
  booktitle    = {{1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}},
  editor       = {{Aspnes, James and Michail, Othon}},
  pages        = {{12:1–12:19}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}}},
  doi          = {{10.4230/LIPIcs.SAND.2022.12}},
  volume       = {{221}},
  year         = {{2022}},
}

@inproceedings{33240,
  author       = {{Götte, Thorsten and Scheideler, Christian}},
  booktitle    = {{SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}},
  editor       = {{Agrawal, Kunal and Lee, I-Ting Angelina}},
  pages        = {{99–101}},
  publisher    = {{ACM}},
  title        = {{{Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}}},
  doi          = {{10.1145/3490148.3538556}},
  year         = {{2022}},
}

@inbook{30941,
  abstract     = {{Decision support systems are crucial in helping decision makers to quickly identify optimal business decisions in increasingly volatile and complex business environments. However, the ideal DSS for one decision maker may not optimally address the requirements for decision support of another decision maker. This is due to differences between
decision makers in business goals, regulatory restrictions or availability of resources such as data. By using a suboptimal DSS, decision makers risk implementing suboptimal decision recommendations which endanger the success of their business. This presents DSS developers with the challenge to implement a customizable DSS which can be tailored to the individual requirements for decision support of a single decision maker. In order to address this challenge, we suggest a decision support ecosystem in which DSS developers, decision makers and other domain experts collaborate using a shared platform to provide and combine reusable decision support services into a tailored DSS. The contribution of our paper is twofold: First, we define the concept of a decision support ecosystem with respect to existing digital business ecosystems and discuss expected benefits and challenges. Second, we present a reference architecture for a shared platform supporting the realization of a decision support ecosystem. We demonstrate our contributions in the example application domain of regional energy distribution network planning.}},
  author       = {{Kirchhoff, Jonas and Weskamp, Christoph and Engels, Gregor}},
  booktitle    = {{Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs}},
  publisher    = {{Springer}},
  title        = {{{Decision Support Ecosystems: Definition and Platform Architecture}}},
  doi          = {{10.1007/978-3-031-06530-9_8}},
  volume       = {{447}},
  year         = {{2022}},
}