@inbook{34195, author = {{Hobscheidt, Daniela and Menzefricke, Jörn Steffen and Gabriel, Stefan and Kühn, Arno and Dumitrescu, Roman}}, booktitle = {{Praxishandbuch Robotic Process Automation (RPA)}}, isbn = {{9783658383787}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Soziotechnische Herausforderungen bei der Einführung von RPA managen}}}, doi = {{10.1007/978-3-658-38379-4_8}}, year = {{2022}}, } @inbook{34193, author = {{Bansmann, Michael and Dumitrescu, Roman and Fechtelpeter, Christian}}, booktitle = {{Gestaltung digitalisierter Arbeitswelten}}, isbn = {{9783662580134}}, issn = {{2523-3637}}, publisher = {{Springer Berlin Heidelberg}}, title = {{{Transfer von Arbeit 4.0-Anwendungsszenarien}}}, doi = {{10.1007/978-3-662-58014-1_3}}, year = {{2022}}, } @inbook{34194, author = {{Brock, Jonathan and von Enzberg, Sebastian and Kühn, Arno and Dumitrescu, Roman}}, booktitle = {{Praxishandbuch Robotic Process Automation (RPA)}}, isbn = {{9783658383787}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Nutzung von Process Mining in RPA-Projekten}}}, doi = {{10.1007/978-3-658-38379-4_5}}, year = {{2022}}, } @inbook{34292, author = {{Wolters, Dennis and Engels, Gregor}}, booktitle = {{Product-Focused Software Process Improvement}}, editor = {{Taibi, Davide and Kuhrmann, Marco and Mikkonen, Tommi and Klünder, Jil and Abrahamsson, Pekka}}, isbn = {{9783031213878}}, issn = {{0302-9743}}, pages = {{235--242}}, publisher = {{Springer International Publishing}}, title = {{{Towards Situational Process Management for Professional Education Programmes}}}, doi = {{10.1007/978-3-031-21388-5_16}}, volume = {{13709}}, year = {{2022}}, } @article{34533, author = {{Brosch, Anian and Wallscheid, Oliver and Böcker, Joachim}}, journal = {{IEEE Transactions on Power Electronics}}, keywords = {{Electrical and Electronic Engineering}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Model Predictive Torque Control for Permanent Magnet Synchronous Motors Using a Stator-Fixed Harmonic Flux Reference Generator in the Entire Modulation Range}}}, doi = {{10.1109/tpel.2022.3229619}}, year = {{2022}}, } @unpublished{34618, abstract = {{In this article, we show how second-order derivative information can be incorporated into gradient sampling methods for nonsmooth optimization. The second-order information we consider is essentially the set of coefficients of all second-order Taylor expansions of the objective in a closed ball around a given point. Based on this concept, we define a model of the objective as the maximum of these Taylor expansions. Iteratively minimizing this model (constrained to the closed ball) results in a simple descent method, for which we prove convergence to minimal points in case the objective is convex. To obtain an implementable method, we construct an approximation scheme for the second-order information based on sampling objective values, gradients and Hessian matrices at finitely many points. Using a set of test problems, we compare the resulting method to five other available solvers. Considering the number of function evaluations, the results suggest that the method we propose is superior to the standard gradient sampling method, and competitive compared to other methods.}}, author = {{Gebken, Bennet}}, booktitle = {{arXiv:2210.04579}}, title = {{{Using second-order information in gradient sampling methods for nonsmooth optimization}}}, year = {{2022}}, } @article{34792, author = {{Glöckner, Helge}}, issn = {{2070-0466}}, journal = {{p-Adic Numbers, Ultrametric Analysis, and Applications}}, keywords = {{20Exx, 22Exx, 32Cxx}}, number = {{2}}, pages = {{138–144}}, title = {{{Non-Lie subgroups in Lie groups over local fields of positive characteristic}}}, doi = {{10.1134/S2070046622020042}}, volume = {{14}}, year = {{2022}}, } @article{34791, author = {{Glöckner, Helge and Schmeding, Alexander}}, issn = {{0232-704X}}, journal = {{Annals of Global Analysis and Geometry}}, keywords = {{58D15, 22E65, 26E15, 26E20, 46E40, 46T20, 58A05}}, number = {{2}}, pages = {{359–398}}, title = {{{Manifolds of mappings on Cartesian products}}}, doi = {{10.1007/s10455-021-09816-y}}, volume = {{61}}, year = {{2022}}, } @article{34796, abstract = {{We prove various results in infinite-dimensional differential calculus that relate the differentiability properties of functions and associated operator-valued functions (e.g., differentials). The results are applied in two areas: (1) in the theory of infinite-dimensional vector bundles, to construct new bundles from given ones, such as dual bundles, topological tensor products, infinite direct sums, and completions (under suitable hypotheses); (2) in the theory of locally convex Poisson vector spaces, to prove continuity of the Poisson bracket and continuity of passage from a function to the associated Hamiltonian vector field. Topological properties of topological vector spaces are essential for the studies, which allow the hypocontinuity of bilinear mappings to be exploited. Notably, we encounter kR-spaces and locally convex spaces E such that E×E is a kR-space.}}, author = {{Glöckner, Helge}}, issn = {{2075-1680}}, journal = {{Axioms}}, number = {{5}}, title = {{{Aspects of differential calculus related to infinite-dimensional vector bundles and Poisson vector spaces}}}, doi = {{10.3390/axioms11050221}}, volume = {{11}}, year = {{2022}}, } @unpublished{34804, abstract = {{Starting with a finite-dimensional complex Lie algebra, we extend scalars using suitable commutative topological algebras. We study Birkhoff decompositions for the corresponding loop groups. Some results remain valid for loop groups with valued in complex Banach-Lie groups.}}, author = {{Glöckner, Helge}}, booktitle = {{arXiv:2206.11711}}, title = {{{Birkhoff decompositions for loop groups with coefficient algebras}}}, year = {{2022}}, } @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}}, }