TY - JOUR
AB - In this paper, a model of a hybrid, hydrogen-based energy system for a household which includes the heating sector is presended. With such an energy system it's possible to enable energy autarky over a whole year based on solar energy. The scope of this study was to present a verified hybrid energy system model created in Simulink which can be used to prospectively size future similar energy systems where hydrogen in combination with a li-ion battery shall be used as energy storage type.
AU - Möller, Marius Claus
AU - Krauter, Stefan
ID - 30262
JF - Energies / Special Issue "Sustainable Energy Concepts for Energy Transition"
SN - 1996-1073
TI - Hybrid Energy System Model in Matlab/Simulink based on Solar Energy, Lithium-Ion Battery and Hydrogen
VL - 15 (6), 2201
ER -
TY - JOUR
AB - Koopman operator theory has been successfully applied to problems from various research areas such as fluid dynamics, molecular dynamics, climate science, engineering, and biology. Applications include detecting metastable or coherent sets, coarse-graining, system identification, and control. There is an intricate connection between dynamical systems driven by stochastic differential equations and quantum mechanics. In this paper, we compare the ground-state transformation and Nelson's stochastic mechanics and demonstrate how data-driven methods developed for the approximation of the Koopman operator can be used to analyze quantum physics problems. Moreover, we exploit the relationship between Schrödinger operators and stochastic control problems to show that modern data-driven methods for stochastic control can be used to solve the stationary or imaginary-time Schrödinger equation. Our findings open up a new avenue towards solving Schrödinger's equation using recently developed tools from data science.
AU - Klus, Stefan
AU - Nüske, Feliks
AU - Peitz, Sebastian
ID - 29673
IS - 31
JF - Journal of Physics A: Mathematical and Theoretical
TI - Koopman analysis of quantum systems
VL - 55
ER -
TY - GEN
AB - Context: Cryptographic APIs are often misused in real-world applications. Therefore, many cryptographic API misuse detection tools have been introduced. However, there exists no established reference benchmark for a fair and comprehensive comparison and evaluation of these tools. While there are benchmarks, they often only address a subset of the domain or were only used to evaluate a subset of existing misuse detection tools. Objective: To fairly compare cryptographic API misuse detection tools and to drive future development in this domain, we will devise such a benchmark. Openness and transparency in the generation process are key factors to fairly generate and establish the needed benchmark. Method: We propose an approach where we derive the benchmark generation methodology from the literature which consists of general best practices in benchmarking and domain-specific benchmark generation. A part of this methodology is transparency and openness of the generation process, which is achieved by pre-registering this work. Based on our methodology we design CamBench, a fair "Cryptographic API Misuse Detection Tool Benchmark Suite". We will implement the first version of CamBench limiting the domain to Java, the JCA, and static analyses. Finally, we will use CamBench to compare current misuse detection tools and compare CamBench to related benchmarks of its domain.
AU - Schlichtig, Michael
AU - Wickert, Anna-Katharina
AU - Krüger, Stefan
AU - Bodden, Eric
AU - Mezini, Mira
ID - 32409
KW - cryptography
KW - benchmark
KW - API misuse
KW - static analysis
TI - CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite
ER -
TY - THES
AU - Lass, Michael
ID - 32414
TI - Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations
ER -
TY - CONF
AB - Static analysis tools support developers in detecting potential coding issues, such as bugs or vulnerabilities. Research on static analysis emphasizes its technical challenges but also mentions severe usability shortcomings. These shortcomings hinder the adoption of static analysis tools, and in some cases, user dissatisfaction even leads to tool abandonment.
To comprehensively assess the current state of the art, this paper presents the first systematic usability evaluation in a wide range of static analysis tools. We derived a set of 36 relevant criteria from the scientific literature and gathered a collection of 46 static analysis tools complying with our inclusion and exclusion criteria - a representative set of mainly non-proprietary tools. Then, we evaluated how well these tools fulfill the aforementioned criteria.
The evaluation shows that more than half of the considered tools offer poor warning messages, while about three-quarters of the tools provide hardly any fix support. Furthermore, the integration of user knowledge is strongly neglected, which could be used for improved handling of false positives and tuning the results for the corresponding developer. Finally, issues regarding workflow integration and specialized user interfaces are proved further.
These findings should prove useful in guiding and focusing further research and development in the area of user experience for static code analyses.
AU - Nachtigall, Marcus
AU - Schlichtig, Michael
AU - Bodden, Eric
ID - 32410
KW - Automated static analysis
KW - Software usability
SN - 9781450393799
T2 - Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis
TI - A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools
ER -
TY - CONF
AB - Application Programming Interfaces (APIs) are the primary mechanism that developers use to obtain access to third-party algorithms and services. Unfortunately, APIs can be misused, which can have catastrophic consequences, especially if the APIs provide security-critical functionalities like cryptography. Understanding what API misuses are, and for what reasons they are caused, is important to prevent them, e.g., with API misuse detectors. However, definitions and nominations for API misuses and related terms in literature vary and are diverse. This paper addresses the problem of scattered knowledge and definitions of API misuses by presenting a systematic literature review on the subject and introducing FUM, a novel Framework for API Usage constraint and Misuse classification. The literature review revealed that API misuses are violations of API usage constraints. To capture this, we provide unified definitions and use them to derive FUM. To assess the extent to which FUM aids in determining and guiding the improvement of an API misuses detectors' capabilities, we performed a case study on CogniCrypt, a state-of-the-art misuse detector for cryptographic APIs. The study showed that FUM can be used to properly assess CogniCrypt's capabilities, identify weaknesses and assist in deriving mitigations and improvements. And it appears that also more generally FUM can aid the development and improvement of misuse detection tools.
AU - Schlichtig, Michael
AU - Sassalla, Steffen
AU - Narasimhan, Krishna
AU - Bodden, Eric
ID - 31133
KW - API misuses
KW - API usage constraints
KW - classification framework
KW - API misuse detection
KW - static analysis
T2 - 2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)
TI - FUM - A Framework for API Usage constraint and Misuse Classification
ER -
TY - GEN
AU - Vahle, Ella
ID - 32399
TI - Modelling and Proving Security for a Secure MPC Protocol for Stable Matching
ER -
TY - GEN
AU - Hetkämper, Tim
ID - 6561
TI - Visualisierung von Ultraschallfeldern mittels Schlierentechnik und fraktionaler Fouriertransformation
ER -
TY - GEN
AU - Claes, Leander
ID - 6592
TI - Messverfahren für die akustische Absorption zur Bestimmung der Volumenviskosität
ER -
TY - CONF
AB - The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging).
In our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$.
We study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear.
The two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously.
AU - Castenow, Jannik
AU - Feldkord, Björn
AU - Knollmann, Till
AU - Malatyali, Manuel
AU - Meyer auf der Heide, Friedhelm
ID - 31847
KW - K-Server Problem
KW - Heterogeneity
KW - Online Caching
SN - 9781450391467
T2 - Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
TI - The k-Server with Preferences Problem
ER -
TY - CHAP
AB - Decision makers increasingly rely on decision support systems for optimal decision making. Recently, special attention has been paid to process-driven decision support systems (PD-DSS) in which a process model prescribes the invocation sequence of software-based decision support services and the data exchange between them. Thus, it is possible to quickly combine available decision support services as needed for optimally supporting the decision making process of an individual decision maker. However, process modelers may accidentally create a process model which is technically well-formed and executable, but contains functional and behavioral flaws such as redundant or missing services. These flaws may result in inefficient computations or invalid decision recommendations when the corresponding PD-DSS is utilized by a decision maker. In this paper, we therefore propose an approach to validate functionality and behavior of a process model representing a PD-DSS. Our approach is based on expressing flaws as anti-patterns for which the process model can be automatically checked via graph matching. We prototypically implemented our approach and demonstrate its applicability in the context of decision making for energy network planning.
AU - Kirchhoff, Jonas
AU - Engels, Gregor
ID - 34023
SN - 1865-1348
T2 - Software Business
TI - Anti-pattern Detection in Process-Driven Decision Support Systems
VL - 463
ER -
TY - CONF
AB - Consider the practical goal of making a desired action profile played,
when the planner can only change the payoffs, bound by
stringent constraints.
Applications include motivating people
to choose the closest school, the closest subway station, or to coordinate
on a communication protocol or an investment strategy.
Employing subsidies and tolls, we adjust the game so that choosing this predefined action profile
becomes strictly dominant.
Inspired mainly by the work of Monderer and Tennenholtz,
where the promised subsidies do not materialise in the not played
profiles, we provide a fair and individually rational game
adjustment, such that the total outside investments sum up
to zero at any profile, thereby facilitating easy and frequent
usage of our adjustment without bearing costs, even if some
players behave unexpectedly. The resultant action profile itself needs no
adjustment. Importantly, we also prove that our adjustment minimises
the general transfer among all such adjustments, counting the total subsidising and taxation.
AU - Polevoy, Gleb
AU - Dziubiński, Marcin
ED - De Raedt, Luc
ID - 34040
KW - adjustment
KW - strictly dominant
KW - fairness
KW - individually rational
KW - transfer
KW - tax
KW - subsidy
T2 - Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
TI - Fair, Individually Rational and Cheap Adjustment
ER -
TY - CONF
AU - Epstein, Leah
AU - Lassota, Alexandra
AU - Levin, Asaf
AU - Maack, Marten
AU - Rohwedder, Lars
ED - Berenbrink, Petra
ED - Monmege, Benjamin
ID - 33085
T2 - 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)
TI - Cardinality Constrained Scheduling in Online Models
VL - 219
ER -
TY - CONF
AU - Alshomary, Milad
AU - El Baff, Roxanne
AU - Gurcke, Timon
AU - Wachsmuth, Henning
ID - 30840
T2 - Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics
TI - The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments
ER -
TY - CONF
AU - Wachsmuth, Henning
AU - Alshomary, Milad
ID - 33004
T2 - Proceedings of the 29th International Conference on Computational Linguistics
TI - "Mama Always Had a Way of Explaining Things So I Could Understand": A Dialogue Corpus for Learning How to Explain
ER -
TY - JOUR
AU - Lauscher, Anne
AU - Wachsmuth, Henning
AU - Gurevych, Iryna
AU - Glavaš, Goran
ID - 34049
JF - Transactions of the Association for Computational Linguistics
TI - On the Role of Knowledge in Computational Argumentation
ER -
TY - CONF
AU - Kiesel, Johannes
AU - Alshomary, Milad
AU - Handke, Nicolas
AU - Cai, Xiaoni
AU - Wachsmuth, Henning
AU - Stein, Benno
ID - 22157
T2 - Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics
TI - Identifying the Human Values behind Arguments
ER -
TY - CONF
AU - Pasic, Faruk
AU - Becker, Matthias
ID - 34057
T2 - 2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)
TI - Domain-specific Language for Condition Monitoring Software Development
ER -
TY - CONF
AB - News articles both shape and reflect public opinion across the political
spectrum. Analyzing them for social bias can thus provide valuable insights,
such as prevailing stereotypes in society and the media, which are often
adopted by NLP models trained on respective data. Recent work has relied on
word embedding bias measures, such as WEAT. However, several representation
issues of embeddings can harm the measures' accuracy, including low-resource
settings and token frequency differences. In this work, we study what kind of
embedding algorithm serves best to accurately measure types of social bias
known to exist in US online news articles. To cover the whole spectrum of
political bias in the US, we collect 500k articles and review psychology
literature with respect to expected social bias. We then quantify social bias
using WEAT along with embedding algorithms that account for the aforementioned
issues. We compare how models trained with the algorithms on news articles
represent the expected social bias. Our results suggest that the standard way
to quantify bias does not align well with knowledge from psychology. While the
proposed algorithms reduce the~gap, they still do not fully match the
literature.
AU - Spliethöver, Maximilian
AU - Keiff, Maximilian
AU - Wachsmuth, Henning
ID - 34047
T2 - Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)
TI - No Word Embedding Model Is Perfect: Evaluating the Representation Accuracy for Social Bias in the Media
ER -
TY - CONF
AU - Hetkämper, Tim
AU - Claes, Leander
AU - Henning, Bernd
ID - 31331
SN - 978-3-8007-5835-7
T2 - Sensoren und Messsysteme - Beiträge der 21. ITG/GMA-Fachtagung
TI - Schlieren imaging with fractional Fourier transform to visualise ultrasonic fields
ER -
TY - CONF
AU - Sengupta, Meghdut
AU - Alshomary, Milad
AU - Wachsmuth, Henning
ID - 34067
T2 - Proceedings of the 2022 Workshop on Figurative Language Processing
TI - Back to the Roots: Predicting the Source Domain of Metaphors using Contrastive Learning
ER -
TY - CHAP
AU - Bondarenko, Alexander
AU - Fröbe, Maik
AU - Kiesel, Johannes
AU - Syed, Shahbaz
AU - Gurcke, Timon
AU - Beloucif, Meriem
AU - Panchenko, Alexander
AU - Biemann, Chris
AU - Stein, Benno
AU - Wachsmuth, Henning
AU - Potthast, Martin
AU - Hagen, Matthias
ID - 34077
SN - 0302-9743
T2 - Lecture Notes in Computer Science
TI - Overview of Touché 2022: Argument Retrieval
ER -
TY - CONF
AU - Padalkin, Andreas
AU - Scheideler, Christian
AU - Warner, Daniel
ED - Ouldridge, Thomas E.
ED - Wickham, Shelley F. J.
ID - 32602
SN - 1868-8969
T2 - 28th International Conference on DNA Computing and Molecular Programming (DNA 28)
TI - The Structural Power of Reconfigurable Circuits in the Amoebot Model
VL - 238
ER -
TY - CONF
AU - Kostitsyna, Irina
AU - Scheideler, Christian
AU - Warner, Daniel
ED - Ouldridge, Thomas E.
ED - Wickham, Shelley F. J.
ID - 32603
SN - 1868-8969
T2 - 28th International Conference on DNA Computing and Molecular Programming (DNA 28)
TI - Fault-Tolerant Shape Formation in the Amoebot Model
VL - 238
ER -
TY - JOUR
AB - AbstractMany critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents VarAlyzer, a novel static analysis approach for software product lines. VarAlyzer first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. VarAlyzer ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying VarAlyzer enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.
AU - Schubert, Philipp
AU - Gazzillo, Paul
AU - Patterson, Zach
AU - Braha, Julian
AU - Schiebel, Fabian
AU - Hermann, Ben
AU - Wei, Shiyi
AU - Bodden, Eric
ID - 30511
IS - 1
JF - Automated Software Engineering
KW - inter-procedural static analysis
KW - software product lines
KW - preprocessor
KW - LLVM
KW - C/C++
SN - 0928-8910
TI - Static data-flow analysis for software product lines in C
VL - 29
ER -
TY - CONF
AB - The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\Delta(n)$ is reset to one; otherwise, $\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\Delta(n)$ is itself $\alpha$-mixing from which we conclude a strong law of large numbers for $\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times.
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 32811
T2 - Proceedings of the 58th Allerton Conference on Communication, Control, and Computing
TI - Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law
ER -
TY - CONF
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 30793
T2 - Proceedings of the 14th International Conference on Agents and Artificial Intelligence
TI - Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication
ER -
TY - GEN
AB - Iterative distributed optimization algorithms involve multiple agents that
communicate with each other, over time, in order to minimize/maximize a global
objective. In the presence of unreliable communication networks, the
Age-of-Information (AoI), which measures the freshness of data received, may be
large and hence hinder algorithmic convergence. In this paper, we study the
convergence of general distributed gradient-based optimization algorithms in
the presence of communication that neither happens periodically nor at
stochastically independent points in time. We show that convergence is
guaranteed provided the random variables associated with the AoI processes are
stochastically dominated by a random variable with finite first moment. This
improves on previous requirements of boundedness of more than the first moment.
We then introduce stochastically strongly connected (SSC) networks, a new
stochastic form of strong connectedness for time-varying networks. We show: If
for any $p \ge0$ the processes that describe the success of communication
between agents in a SSC network are $\alpha$-mixing with $n^{p-1}\alpha(n)$
summable, then the associated AoI processes are stochastically dominated by a
random variable with finite $p$-th moment. In combination with our first
contribution, this implies that distributed stochastic gradient descend
converges in the presence of AoI, if $\alpha(n)$ is summable.
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 30790
T2 - arXiv:2201.11343
TI - Distributed gradient-based optimization in the presence of dependent aperiodic communication
ER -
TY - CONF
AU - Clausing, Lennart
AU - Platzner, Marco
ID - 32855
T2 - 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
TI - ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support
ER -
TY - GEN
AB - We present sufficient conditions that ensure convergence of the multi-agent
Deep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of
the most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling
continuous action spaces: the actor-critic paradigm. In the setting considered
herein, each agent observes a part of the global state space in order to take
local actions, for which it receives local rewards. For every agent, DDPG
trains a local actor (policy) and a local critic (Q-function). The analysis
shows that multi-agent DDPG using neural networks to approximate the local
policies and critics converge to limits with the following properties: The
critic limits minimize the average squared Bellman loss; the actor limits
parameterize a policy that maximizes the local critic's approximation of
$Q_i^*$, where $i$ is the agent index. The averaging is with respect to a
probability distribution over the global state-action space. It captures the
asymptotics of all local training processes. Finally, we extend the analysis to
a fully decentralized setting where agents communicate over a wireless network
prone to delays and losses; a typical scenario in, e.g., robotic applications.
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 30791
T2 - arXiv:2201.00570
TI - Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms
ER -
TY - CONF
AU - Richter, Cedric
AU - Wehrheim, Heike
ID - 32590
T2 - 2022 IEEE Conference on Software Testing, Verification and Validation (ICST)
TI - Learning Realistic Mutations: Bug Creation for Neural Bug Detectors
ER -
TY - CONF
AU - Richter, Cedric
AU - Wehrheim, Heike
ID - 32591
T2 - 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)
TI - TSSB-3M: Mining single statement bugs at massive scale
ER -
TY - GEN
AU - Siek, Hanna
ID - 32398
TI - Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes
ER -
TY - GEN
AU - Kramer, Paul
ID - 31485
TI - On Transforming Lattice-Based Cryptography to the Ring Setting
ER -
TY - CONF
AB - The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds
AU - Dreßler, Kevin
AU - Sherif, Mohamed
AU - Ngonga Ngomo, Axel-Cyrille
ID - 31806
KW - 2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba
T2 - Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia
TI - ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning
ER -
TY - JOUR
AU - Redder, Adrian
AU - Ramaswamy, Arunselvan
AU - Karl, Holger
ID - 32854
IS - 13
JF - IFAC-PapersOnLine
TI - Practical Network Conditions for the Convergence of Distributed Optimization
VL - 55
ER -
TY - CONF
AU - Hansmeier, Tim
AU - Brede, Mathis
AU - Platzner, Marco
ID - 33253
T2 - GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion
TI - XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion
ER -
TY - CONF
AU - Chen, Wei-Fan
AU - Chen, Mei-Hua
AU - Mudgal, Garima
AU - Wachsmuth, Henning
ID - 33274
T2 - Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)
TI - Analyzing Culture-Specific Argument Structures in Learner Essays
ER -
TY - CONF
AU - Maack, Marten
AU - Pukrop, Simon
AU - Rasmussen, Anna Rodriguez
ED - Chechik, Shiri
ED - Navarro, Gonzalo
ED - Rotenberg, Eva
ED - Herman, Grzegorz
ID - 33491
T2 - 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany
TI - (In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling
VL - 244
ER -
TY - GEN
AU - Grynko, Yevgen
AU - Shkuratov, Yuriy
AU - Alhaddad, Samer
AU - Förstner, Jens
ID - 34136
KW - tet_topic_scattering
TI - Light backscattering from numerical analog of planetary regoliths
ER -
TY - CONF
AB - In this paper, machine learning techniques will be used to classify different PCB layouts given their electromagnetic frequency spectra. These spectra result from a simulated near-field measurement of electric field strengths at different locations. Measured values consist of real and imaginary parts (amplitude and phase) in X, Y and Z directions. Training data was obtained in the time domain by varying transmission line geometries (size, distance and signaling). It was then transformed into the frequency domain and used as deep neural network input. Principal component analysis was applied to reduce the sample dimension. The results show that classifying different designs is possible with high accuracy based on synthetic data. Future work comprises measurements of real, custom-made PCB with varying parameters to adapt the simulation model and also test the neural network. Finally, the trained model could be used to give hints about the error’s cause when overshooting EMC limits.
AU - Maalouly, Jad
AU - Hemker, Dennis
AU - Hedayat, Christian
AU - Rückert, Christian
AU - Kaufmann, Ivan
AU - Olbrich, Marcel
AU - Lange, Sven
AU - Mathis, Harald
ID - 34140
KW - emc
KW - pcb
KW - electronic system development
KW - machine learning
KW - neural network
T2 - 2022 Kleinheubach Conference
TI - AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development
ER -
TY - CONF
AU - Krauter, Stefan
AU - Bendfeld, Jörg
ID - 34155
T2 - Proceedings of the 8th World Conference on Photovoltaik Energy Conversion
TI - Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types
ER -
TY - CONF
AU - Kakande, Josephine Nakato
AU - Philipo, Godiana Hagile
AU - Krauter, Stefan
ID - 34156
T2 - Proceedings of the 8th World Conference on Photovoltaik Energy Conversion
TI - Optimal Design of a Semi Grid-Connected PV System for a Site in Lwak, Kenya Using HOMER
ER -
TY - THES
AB - Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen den Trojaner ``Heimtückische LUT'' stellen wir die allererste erfolgreiche Gegenmaßnahme vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.
AU - Ahmed, Qazi Arbab
ID - 29769
KW - FPGA Security
KW - Hardware Trojans
KW - Bitstream-level Trojans
KW - Bitstream Verification
TI - Hardware Trojans in Reconfigurable Computing
ER -
TY - JOUR
AB - Far-field multi-speaker automatic speech recognition (ASR) has drawn increasing attention in recent years. Most existing methods feature a signal processing frontend and an ASR backend. In realistic scenarios, these modules are usually trained separately or progressively, which suffers from either inter-module mismatch or a complicated training process. In this paper, we propose an end-to-end multi-channel model that jointly optimizes the speech enhancement (including speech dereverberation, denoising, and separation) frontend and the ASR backend as a single system. To the best of our knowledge, this is the first work that proposes to optimize dereverberation, beamforming, and multi-speaker ASR in a fully end-to-end manner. The frontend module consists of a weighted prediction error (WPE) based submodule for dereverberation and a neural beamformer for denoising and speech separation. For the backend, we adopt a widely used end-to-end (E2E) ASR architecture. It is worth noting that the entire model is differentiable and can be optimized in a fully end-to-end manner using only the ASR criterion, without the need of parallel signal-level labels. We evaluate the proposed model on several multi-speaker benchmark datasets, and experimental results show that the fully E2E ASR model can achieve competitive performance on both noisy and reverberant conditions, with over 30% relative word error rate (WER) reduction over the single-channel baseline systems.
AU - Zhang, Wangyou
AU - Chang, Xuankai
AU - Boeddeker, Christoph
AU - Nakatani, Tomohiro
AU - Watanabe, Shinji
AU - Qian, Yanmin
ID - 33669
JF - IEEE/ACM Transactions on Audio, Speech, and Language Processing
SN - Print ISSN: 2329-9290 Electronic ISSN: 2329-9304
TI - End-to-End Dereverberation, Beamforming, and Speech Recognition in A Cocktail Party
ER -
TY - JOUR
AB - AbstractComprehensive data understanding is a key success driver for data analytics projects. Knowing the characteristics of the data helps a lot in selecting the appropriate data analysis techniques. Especially in data-driven product planning, knowledge about the data is a necessary prerequisite because data of the use phase is very heterogeneous. However, companies often do not have the necessary know-how or time to build up solid data understanding in connection with data analysis. In this paper, we develop a methodology to organize and categorize and thus understand use phase data in a way that makes it accessible to general data analytics workflows, following a design science research approach. We first present a knowledge base that lists typical use phase data from a product planning view. Second, we develop a taxonomy based on standard literature and real data objects, which covers the diversity of the data considered. The taxonomy provides 8 dimensions that support classification of use phase data and allows to capture data characteristics from a data analytics view. Finally, we combine both views by clustering the objects of the knowledge base according to the taxonomy. Each of the resulting clusters covers a typical combination of analytics relevant characteristics occurring in practice. By abstracting from the diversity of use phase data into artifacts with manageable complexity, our approach provides guidance to choose appropriate data analysis and AI techniques.
AU - Panzner, Melina
AU - von Enzberg, Sebastian
AU - Meyer, Maurice
AU - Dumitrescu, Roman
ID - 34197
JF - Journal of the Knowledge Economy
KW - Economics and Econometrics
SN - 1868-7865
TI - Characterization of Usage Data with the Help of Data Classifications
ER -
TY - JOUR
AB - Mounting sensors in disk stack separators is often a major challenge due to the operating conditions. However, a process cannot be optimally monitored without sensors. Virtual sensors can be a solution to calculate the sought parameters from measurable values. We measured the vibrations of disk stack separators and applied machine learning (ML) to detect whether the separator contains only water or whether particles are also present. We combined seven ML classification algorithms with three feature engineering strategies and evaluated our model successfully on vibration data of an experimental disk stack separator. Our experimental results demonstrate that random forest in combination with manual feature engineering using domain specific knowledge about suitable features outperforms all other models with an accuracy of 91.27 %.
AU - Merkelbach, Silke
AU - Afroze, Lameya
AU - Janssen, Nils
AU - von Enzberg, Sebastian
AU - Kühn, Arno
AU - Dumitrescu, Roman
ID - 34196
JF - Vibroengineering PROCEDIA
KW - General Medicine
SN - 2345-0533
TI - Using vibration data to classify conditions in disk stack separators
VL - 46
ER -
TY - CHAP
AU - Hobscheidt, Daniela
AU - Menzefricke, Jörn Steffen
AU - Gabriel, Stefan
AU - Kühn, Arno
AU - Dumitrescu, Roman
ID - 34195
SN - 9783658383787
T2 - Praxishandbuch Robotic Process Automation (RPA)
TI - Soziotechnische Herausforderungen bei der Einführung von RPA managen
ER -
TY - CHAP
AU - Bansmann, Michael
AU - Dumitrescu, Roman
AU - Fechtelpeter, Christian
ID - 34193
SN - 2523-3637
T2 - Gestaltung digitalisierter Arbeitswelten
TI - Transfer von Arbeit 4.0-Anwendungsszenarien
ER -
TY - CHAP
AU - Brock, Jonathan
AU - von Enzberg, Sebastian
AU - Kühn, Arno
AU - Dumitrescu, Roman
ID - 34194
SN - 9783658383787
T2 - Praxishandbuch Robotic Process Automation (RPA)
TI - Nutzung von Process Mining in RPA-Projekten
ER -
TY - CONF
AU - Alshomary, Milad
AU - Rieskamp, Jonas
AU - Wachsmuth, Henning
ID - 32247
T2 - Proceedings of the 9th International Conference on Computational Models of Argument
TI - Generating Contrastive Snippets for Argument Search
ER -
TY - CHAP
AU - Wolters, Dennis
AU - Engels, Gregor
ED - Taibi, Davide
ED - Kuhrmann, Marco
ED - Mikkonen, Tommi
ED - Klünder, Jil
ED - Abrahamsson, Pekka
ID - 34292
SN - 0302-9743
T2 - Product-Focused Software Process Improvement
TI - Towards Situational Process Management for Professional Education Programmes
VL - 13709
ER -
TY - JOUR
AU - Brosch, Anian
AU - Wallscheid, Oliver
AU - Böcker, Joachim
ID - 34533
JF - IEEE Transactions on Power Electronics
KW - Electrical and Electronic Engineering
TI - Model Predictive Torque Control for Permanent Magnet Synchronous Motors Using a Stator-Fixed Harmonic Flux Reference Generator in the Entire Modulation Range
ER -
TY - GEN
AB - 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.
AU - Gebken, Bennet
ID - 34618
T2 - arXiv:2210.04579
TI - Using second-order information in gradient sampling methods for nonsmooth optimization
ER -
TY - JOUR
AU - Glöckner, Helge
ID - 34792
IS - 2
JF - p-Adic Numbers, Ultrametric Analysis, and Applications
KW - 20Exx
KW - 22Exx
KW - 32Cxx
SN - 2070-0466
TI - Non-Lie subgroups in Lie groups over local fields of positive characteristic
VL - 14
ER -
TY - JOUR
AU - Glöckner, Helge
AU - Schmeding, Alexander
ID - 34791
IS - 2
JF - Annals of Global Analysis and Geometry
KW - 58D15
KW - 22E65
KW - 26E15
KW - 26E20
KW - 46E40
KW - 46T20
KW - 58A05
SN - 0232-704X
TI - Manifolds of mappings on Cartesian products
VL - 61
ER -
TY - JOUR
AB - 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.
AU - Glöckner, Helge
ID - 34796
IS - 5
JF - Axioms
SN - 2075-1680
TI - Aspects of differential calculus related to infinite-dimensional vector bundles and Poisson vector spaces
VL - 11
ER -
TY - GEN
AB - 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.
AU - Glöckner, Helge
ID - 34804
T2 - arXiv:2206.11711
TI - Birkhoff decompositions for loop groups with coefficient algebras
ER -
TY - CONF
AB - 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.
AU - Werner, Stefan
AU - Schneider, Stefan Balthasar
AU - Karl, Holger
ID - 29220
KW - network management
KW - service management
KW - AI
KW - Monte Carlo Tree Search
KW - model-based
KW - QoS
T2 - IEEE/IFIP Network Operations and Management Symposium (NOMS)
TI - Use What You Know: Network and Service Coordination Beyond Certainty
ER -
TY - CONF
AB - 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.
AU - Ecker, Wolfgang
AU - Adelt, Peer
AU - Müller, Wolfgang
AU - Heckmann, Reinhold
AU - Krstic, Milos
AU - Herdt, Vladimir
AU - Drechsler, Rolf
AU - Angst, Gerhard
AU - Wimmer, Ralf
AU - Mauderer, Andreas
AU - Stahl, Rafael
AU - Emrich, Karsten
AU - Mueller-Gritschneder, Daniel
AU - Becker, Bernd
AU - Scholl, Philipp
AU - Jentzsch, Eyck
AU - Schlamelcher, Jan
AU - Grüttner, Kim
AU - Bernardo, Paul Palomero
AU - Brinkmann, Oliver
AU - Damian, Mihaela
AU - Oppermann, Julian
AU - Koch, Andreas
AU - Bormann, Jörg
AU - Partzsch, Johannes
AU - Mayr, Christian
AU - Kunz, Wolfgang
ID - 29302
T2 - In Proceedings of the Design Automation and Test Conference and Exhibition (DATE 2022)
TI - The Scale4Edge RISC-V Ecosystem
ER -
TY - JOUR
AU - Koldewey, Christian
AU - Rasor, Anja
AU - Reinhold, Jannik
AU - Gausemeier, Jürgen
AU - Dumitrescu, Roman
AU - Chohan, Nadia
AU - Frank, Maximilian
ID - 27776
JF - Technological Forecasting and Social Change
SN - 0040-1625
TI - Aligning strategic position, behavior, and structure for smart service businesses in manufacturing
ER -
TY - GEN
AU - Lienen, Christian
AU - Platzner, Marco
ID - 29541
TI - ReconROS Executor: Event-Driven Programming of FPGA-accelerated ROS 2 Applications
ER -
TY - THES
AB - 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.
AU - Niehues, David
ID - 29763
KW - public-key cryptography
KW - lattices
KW - pairings
KW - verifiable random functions
KW - identity-based encryption
TI - More Efficient Techniques for Adaptively-Secure Cryptography
ER -
TY - GEN
AU - Chen, Mei-Hua
AU - Mudgal, Garima
AU - Chen, Wei-Fan
AU - Wachsmuth, Henning
ID - 31068
T2 - EUROCALL
TI - Investigating the argumentation structures of EFL learners from diverse language backgrounds
ER -
TY - JOUR
AB - 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.
AU - Sadeghi-Kohan, Somayeh
AU - Hellebrand, Sybille
AU - Wunderlich, Hans-Joachim
ID - 29351
JF - Journal of Electronic Testing
KW - Electrical and Electronic Engineering
SN - 0923-8174
TI - Stress-Aware Periodic Test of Interconnects
ER -
TY - GEN
AU - Sadeghi-Kohan, Somayeh
AU - Hellebrand, Sybille
AU - Wunderlich, Hans-Joachim
ID - 29890
KW - WORKSHOP
TI - EM-Aware Interconnect BIST
ER -
TY - JOUR
AB - Highly directive antennas with the ability of shaping radiation patterns in desired directions are essential for efficient on-chip optical communication with reduced cross talk. In this paper, we design and optimize three distinct broadband traveling-wave tantalum pentoxide antennas exhibiting highly directional characteristics. Our antennas contain a director and reflector deposited on a glass substrate, which are excited by a dipole emitter placed in the feed gap between the two elements. Full-wave simulations in conjunction with global optimization provide structures with an enhanced linear directivity as high as 119 radiating in the substrate. The high directivity is a result of the interplay between two dominant TE modes and the leaky modes present in the antenna director. Furthermore, these low-loss dielectric antennas exhibit a near-unity radiation efficiency at the operational wavelength of 780 nm and maintain a broad bandwidth. Our numerical results are in good agreement with experimental measurements from the optimized antennas fabricated using a two-step electron-beam lithography, revealing the highly directive nature of our structures. We envision that our antenna designs can be conveniently adapted to other dielectric materials and prove instrumental for inter-chip optical communications and other on-chip applications.
AU - Farheen, Henna
AU - Yan, Lok-Yee
AU - Quiring, Viktor
AU - Eigner, Christof
AU - Zentgraf, Thomas
AU - Linden, Stefan
AU - Förstner, Jens
AU - Myroshnychenko, Viktor
ID - 31329
IS - 11
JF - Optics Express
KW - tet_topic_opticalantenna
SN - 1094-4087
TI - Broadband optical Ta2O5 antennas for directional emission of light
VL - 30
ER -
TY - CONF
AB - Students are not aware and have little understanding of collecting and processing personal data in their everyday contexts of interaction with data-driven digital artifacts. To be aware of where, how and why data are collected and processed is important to be self-determined. Therefore, we develop and evaluate a teaching sequence to provide reasoning about data as a fundamental aspect of statistical literacy. This teaching sequences deals with the context of interaction with a cellular network where location data are collected. Students get real location data from an unknown person which can be explored with the aim to characterize the person. Students gain different insights by using different basic filters and explain how they achieve these. The results of the exploratory study indicate that students learned to gain insights by exploring given location data and that these insights may describe the person with detailed aspects that may not necessarily be true.
AU - Höper, Lukas
AU - Podworny, Susanne
AU - Schulte, Carsten
AU - Frischemeier, Daniel
ID - 31407
T2 - Proceedings of the IASE 2021 Satellite Conference
TI - Exploration of Location Data: Real Data in the Context of Interaction with a Cellular Network
ER -
TY - JOUR
AU - Baswana, Surender
AU - Gupta, Shiv
AU - Knollmann, Till
ID - 31479
JF - Algorithmica
KW - Applied Mathematics
KW - Computer Science Applications
KW - General Computer Science
SN - 0178-4617
TI - Mincut Sensitivity Data Structures for the Insertion of an Edge
ER -
TY - THES
AB - 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.
AU - Gebken, Bennet
ID - 31556
TI - Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization
ER -
TY - JOUR
AB - 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.
AU - Grynko, Yevgen
AU - Shkuratov, Yuriy
AU - Alhaddad, Samer
AU - Förstner, Jens
ID - 31574
JF - Icarus
KW - tet_topic_scattering
SN - 0019-1035
TI - Negative polarization of light at backscattering from a numerical analog of planetary regoliths
VL - 384
ER -
TY - CHAP
AB - 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.
AU - Kirchhoff, Jonas
AU - Gottschalk, Sebastian
AU - Engels, Gregor
ID - 32792
SN - 1865-1348
T2 - Lecture Notes in Business Information Processing
TI - Detecting Data Incompatibilities in Process-Driven Decision Support Systems
ER -
TY - CONF
AU - Böcker, Joachim
ID - 32796
T2 - 2022 International Symposium on Power Electronics, Electrical Drives, Automation and Motion (SPEEDAM)
TI - Concept Study of an LLC Converter with Magnetically Resonant Inductor
ER -
TY - GEN
AU - Fehring, Lukas
ID - 33033
TI - Combined Ranking and Regression Trees for Algorithm Selection
ER -
TY - GEN
AB - 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.
AU - Tornede, Alexander
AU - Bengs, Viktor
AU - Hüllermeier, Eyke
ID - 30867
T2 - Proceedings of the 36th AAAI Conference on Artificial Intelligence
TI - Machine Learning for Online Algorithm Selection under Censored Feedback
ER -
TY - GEN
AB - 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.
AU - Tornede, Alexander
AU - Gehring, Lukas
AU - Tornede, Tanja
AU - Wever, Marcel Dominik
AU - Hüllermeier, Eyke
ID - 30865
T2 - Machine Learning
TI - Algorithm Selection on a Meta Level
ER -
TY - GEN
AB - 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.
AU - Berkemeier, Manuel Bastian
AU - Peitz, Sebastian
ID - 33150
T2 - arXiv:2208.12094
TI - Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients
ER -
TY - CONF
AU - Daymude, Joshua J.
AU - Richa, Andréa W.
AU - Scheideler, Christian
ED - Aspnes, James
ED - Michail, Othon
ID - 33230
T2 - 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference
TI - Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
VL - 221
ER -
TY - CONF
AU - Götte, Thorsten
AU - Scheideler, Christian
ED - Agrawal, Kunal
ED - Lee, I-Ting Angelina
ID - 33240
T2 - SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022
TI - Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion
ER -
TY - CONF
AU - Claes, Leander
AU - Feldmann, Nadine
AU - Schulze, Veronika
AU - Jurgelucks, Benjamin
AU - Walther, Andrea
AU - Henning, Bernd
ID - 6553
T2 - Fortschritte der Akustik - DAGA 2022
TI - Identification of piezoelectric material parameters using optimised multi-electrode specimens
ER -
TY - CHAP
AB - 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.
AU - Kirchhoff, Jonas
AU - Weskamp, Christoph
AU - Engels, Gregor
ID - 30941
T2 - Decision Support Systems XII: Decision Support Addressing Modern Industry, Business, and Societal Needs
TI - Decision Support Ecosystems: Definition and Platform Architecture
VL - 447
ER -
TY - CONF
AB - Corporate decision makers have individual requirements for decision support influenced by business goals, regulatory restrictions or access to resources such as data. Ideally, decision makers could quickly create tailored decision support systems (DSS) themselves which optimally address their individual requirements for decision support. Although service-oriented architectures have been proposed for DSS customization, they are primarily targeting trained software developers and cannot immediately be adapted by decision makers or domain experts with little to no software development knowledge. In this paper, we therefore motivate an assisted process-based service composition approach which can be used by non-developers to create tailored DSS. For assistance during service composition, we contribute a meta-model for the formalization of both decision support requirements and functionality of decision support services. Models created according to the meta-model can be used to detect mismatches between a decision maker’s requirements for decision support and services selected in the service composition representing a DSS. Furthermore, the formalizations may even be used for automated service composition given a decision maker’s decision support requirements. We demonstrate the expressiveness of our meta-model in the domain of regional energy distribution network planning.
AU - Kirchhoff, Jonas
AU - Weskamp, Christoph
AU - Engels, Gregor
ED - Bernhaupt, Regina
ED - Ardito, Carmelo
ED - Sauer, Stefan
ID - 33281
SN - 978-3-031-14785-2
T2 - Human-Centered Software Engineering
TI - Requirements-Based Composition of Tailored Decision Support Systems
VL - 13482
ER -
TY - JOUR
AB - An explicit approach using symplectic time integration in conjunction with traditional finite difference spatial derivatives to solve the wave equation in moving media is presented. A simple operator split of this second order wave equation into two coupled first order equations is performed, allowing these split equations to be solved symplectically. Orders of symplectic time integration ranging from first to fourth along with orders of spatial derivatives ranging from second to sixth are explored. The case of cylindrical acoustic spreading in air under a constant velocity in a 2D square structured domain is considered. The variation of the computed time-of-flight, frequency, and wave length are studied with varying grid resolution and the deviations from the analytical solutions are determined. It was found that symplectic time integration interferes with finite difference spatial derivatives higher than second order causing unexpected results. This is actually beneficial for unstructured finite volume tools like OpenFOAM where second order spatial operators are the state-of-the art. Cylindrical acoustic spreading is simulated on an unstructured 2D triangle mesh showing that symplectic time integration is not limited to the spatial discretization paradigm and overcomes the numerical diffusion arising with the in-built numerical methods which hinder wave propagation.
AU - Inguva, Venkatesh
AU - Feldmann, Nadine
AU - Claes, Leander
AU - Koturbash, Taras
AU - Hahn-Jose, Thomas
AU - Koutcherov, Vladimir
AU - Kenig, Eugeny
ID - 6579
JF - Engineering Reports
TI - An explicit symplectic approach to solving the wave equation in moving media
ER -
TY - JOUR
AU - Brosch, Anian
AU - Wallscheid, Oliver
AU - Böcker, Joachim
ID - 33459
JF - IEEE Transactions on Power Electronics
KW - Electrical and Electronic Engineering
SN - 0885-8993
TI - Long-Term Memory Recursive Least Squares Online Identification of Highly Utilized Permanent Magnet Synchronous Motors for Finite-Control-Set Model Predictive Control
ER -
TY - CHAP
AU - Maack, Marten
AU - Meyer auf der Heide, Friedhelm
AU - Pukrop, Simon
ID - 29872
SN - 0302-9743
T2 - Approximation and Online Algorithms
TI - Server Cloud Scheduling
ER -
TY - CONF
AU - Gabriel, Stefan
AU - Aring, Theresa
AU - Hobscheidt, Daniela
AU - Kühn, Arno
AU - Dumitrescu, Roman
ID - 33503
T2 - Tagungsband des 68. Frühjahrskongress der Gesellschaft für Arbeitswissenschaft
TI - Handlungsfelder für die KI-Einführung in der Arbeitswelt produzierender Unternehmen
ER -
TY - CONF
AU - Anacker, Harald
AU - Günther, Matthias
AU - Wyrwich, Fabian
AU - Dumitrescu, Roman
ID - 33505
T2 - 17th Annual System of Systems Engineering Conference (SOSE)
TI - Pattern based engineering of System of Systems - a systematic literature review
ER -
TY - CONF
AU - Anacker, Harald
AU - Dumitrescu, Roman
AU - Könemann, Ulf
AU - Wilke, Daria
ID - 31188
T2 - Proceedings of the 16th Annual IEEE International Systems Conference
TI - Identification of stakeholder-specific Systems Engineering competencies for industry
ER -
TY - CONF
AB - In this work, methods will be evaluated to numerically calculate the passive electrical parameters of planar coils. These parameters can then be used to optimize inductive applications such as wireless power transmission. The focus here will be on inductive localization, which uses high-frequency magnetic fields and the resulting induced voltage to provide localization through the coupling parameter mutual inductance. To achieve localization with high accuracy and best possible operation (resonance, signal strength, etc.), the coil parameters need to be well known. For this reason, some numerical methods for the calculation of these quantities are presented and validated. In addition, the physical effects are thereby considered in more detail, allowing the localization procedure to be better optimized compared to simulative black-box methods. The goal should be a dedicated simulation platform for planar coils to be able to develop training data for neural networks and to test and optimize localization algorithms.
AU - Lange, Sven
AU - Hedayat, Christian
AU - Kuhn, Harald
AU - Hilleringmann, Ulrich
ID - 33508
KW - Simulation Environment
KW - Inductive Localization
KW - Coil Parameters
KW - Inductive Applications
KW - Near-Field
T2 - 2022 Smart Systems Integration (SSI)
TI - Modeling and Characterization of a 3D Environment for the Design of an Inductively Based Locating Method by Coil Couplings
ER -
TY - CONF
AB - In the manufacture of real wood products, defects can quickly occur during the production process. To quickly sort out these defects, a system is needed that finds damage in the irregularly structured surfaces of the product. The difficulty in this task is that each surface is visually different and no standard defects can be defined. Thus, damage detection using correlation does not work, so this paper will test different machine learning methods. To evaluate different machine learning methods, a data set is needed. For this reason, the available samples were recorded manually using a static fixed camera. Subsequently, the images were divided into sub-images, which resulted in a relatively small data set. Next, a convolutional neural network (CNN) was constructed to classify the images. However, this approach did not lead to a generalized solution, so the dataset was hashed using the a- and pHash. These hash values were then trained with a fully supervised system that will later serve as a reference model, in the semi-supervised learning procedures. To improve the supervised model and not have to label every data point, semi-supervised learning methods are used in the following. For this purpose, the CEAL method (wrapper method) is considered in the first and then the Π-Model (intrinsically semi-supervised).
AU - Sander, Tom
AU - Lange, Sven
AU - Hilleringmann, Ulrich
AU - Geneiß, Volker
AU - Hedayat, Christian
AU - Kuhn, Harald
ID - 33510
KW - Machine Learning
KW - CNN
KW - Hashing
KW - semi-supervised learning
T2 - 2022 Smart Systems Integration (SSI)
TI - Detection of Defects on Irregularly Structured Surfaces using Supervised and Semi-Supervised Learning Methods
ER -
TY - BOOK
AU - Fazal-Baqaie, Masud
AU - Linssen, Oliver
AU - Volland, Alexander
AU - Yigitbas, Enes
AU - Engstler, Martin
AU - Bertram, Martin
AU - Kalenborn, Axel
ID - 33516
TI - Projektmanagement und Vorgehensmodelle 2022. Virtuelle Zusammenarbeit und verlorene Kulturen?
VL - P 327
ER -
TY - CONF
AU - Pfeifer, Stefan
AU - Akgül, Didem
AU - Röbenack, Silke
AU - Tihlarik, Amelie
AU - Albert, Bruno
AU - Anacker, Harald
AU - Dumitrescu, Roman
ED - Mortensen, N.H.
ED - Hansen, C.T.
ED - Deininger, M.
ID - 33553
SN - 9781912254170
T2 - DS 118: Proceedings of NordDesign 2022
TI - Design Decisions in the Architecture Development of Advanced Systems: Towards traceable and sustainable Documentation and Communication
ER -
TY - CONF
AU - Disselkamp, Jan-Philipp
AU - Seidenberg, Tobias
AU - Anacker, Harald
AU - Dumitrescu, Roman
ID - 33552
T2 - Proceedings of the IEEE
TI - Design of an optimised value creation network for zero emission ferries
ER -
TY - CONF
AU - Eckertz, Daniel
AU - Anacker, Harald
AU - Dumitrescu, Roman
ID - 33556
T2 - Proceedings of the 5th International Conference on Information and Computer Technologies (ICICT)
TI - Knowledge-based Interactive Configuration Tool for Industrial Augmented Reality Systems
ER -
TY - CONF
AU - Merkelbach, Silke
AU - von Enzberg, Sebastian
AU - Kuhn, Arno
AU - Dumitrescu, Roman
ID - 33554
T2 - Proceedings of the IEEE
TI - Towards a Process Model to Enable Domain Experts to Become Citizen Data Scientists for Industrial Applications
ER -
TY - CONF
AU - Eckertz, Daniel
AU - Anacker, Harald
AU - Dumitrescu, Roman
ID - 33557
T2 - Proceedings of NordDesign 2022
TI - Systematics for the individual assessment of augmented reality potentials to support product validation
ER -
TY - CONF
AU - Wilke, Daria
AU - Pfeifer, Stefan
AU - Heitmann, Rebecca
AU - Anacker, Harald
AU - Dumitrescu, Roman
AU - Franke, Volker
ID - 33558
T2 - Proceedings of the IEEE ISSE
TI - Implementation of Systems Engineering: A maturity-based approach
ER -
TY - GEN
AB - Im Rahmen dieser Studie wird der Status Quo des KI-Einsatzes in der industriellen Arbeitswelt in der Region OstWestfalenLippe erfasst und beschrieben. Dadurch wird eine Grundlage geschaffen, um eine zielführende Unterstützung der Gestaltung von durch Künstliche Intelligenz (KI) gestützter Arbeitsprozesse in Unternehmen zu ermöglichen, indem beispielsweise bedarfsbezogene Maßnahmen entwickelt und durchgeführt sowie weiterer Forschungsbedarf aufgezeigt wird. Die Befragung wurde im Jahr 2021 von dem Kompetenzzentrum Arbeitswelt.Plus sowie dem Spitzencluster it’s OWL initiiert. Dabei sind drei Zielgruppen – Unternehmensleitung, Personalabteilung (HR) sowie Arbeitnehmer*innen – adressiert worden. Insgesamt nahmen 317 Personen aus 89 verschiedenen Unternehmen bzw. Organisationen an der Befragung teil – zu 38 % Unternehmer*innen, zu 13 % Personaler*innen und zu 49 % Arbeitnehmer*innen. Die meisten der Teilnehmenden stammten aus der Elektroindustrie, dem Maschinenbau sowie dem Informations- und Kommunikationstechnologie (IKT)-Sektor. Die Befragungsergebnisse zeigen, dass sich die meisten Unternehmen in der Anfangsphase der KI-Nutzung befinden. Zwischen einzelnen Unternehmensbereichen und verschiedenen Branchen zeigen sich gewisse Unterschiede in der Nutzungsphase. Die Befragten stehen aktuell vor der Nutzung von vor allem teilautonomen KI-Systemen, die ausführende und analytische menschliche Tätigkeitenbeispielsweise durch Informationsbereitstellungen unterstützen. Wesentliche Ziele der KI-Nutzung sind die Effizienzsteigerung, Qualitätsverbesserung, Entscheidungsoptimierung sowie Unterstützung der Arbeitnehmer*innen. Allerdings werden in allen Unternehmen die fehlende Expertise sowie insgesamt die Komplexität des Themenfelds als Hinderungsgründe identifiziert. In allen Unternehmen und allen Unternehmensbereichen werden hohe Auswirkungen durch KI erwartet. Auf die Arbeitsgestaltung werden insgesamt eher positive Auswirkungen erwartet. Die Befragten schätzen die Bedeutung von KI, ihre Aufgeschlossenheit sowie ihr Vertrauen gegenüber KI als insgesamt hoch ein, ihr Verständnis von KI dagegen eher als gering. Tendenziell zeigt sich eine große Diskrepanz zwischen Selbst- und Fremdbild mit einer teils deutlich negativeren Wahrnehmung anderer. Die Befragten erwarten außerdem steigende Kompetenzanforderungen sowie einen hohen Weiterbildungsbedarf, insbesondere bezüglich des grundlegenden Verständnisses über KI. In den wenigsten Unternehmen existiert jedoch ein gezieltes Weiterbildungsangebot. Die Erkenntnisse aus der Befragung fließen im Rahmen des Kompetenzzentrums Arbeitswelt.Plus in die gezielte Gestaltung und Einführung KI-gestützter Arbeitsformen sowie bedarfsgerechter Unterstützungsangebote ein. Die hohe Komplexität der KI-Einführung sowie die sowohl technischen als auch mitarbeiterbezogenen Herausforderungen verdeutlichen den Bedarf für eine soziotechnische Perspektive und ein systematisches Vorgehen bei der Gestaltung dieses vielschichtigen Themenfelds.
AU - Papenkordt, Jörg
AU - Gabriel, Stefan
AU - Thommes, Kirsten
AU - Dumitrescu, Roman
ID - 33702
TI - Künstliche Intelligenz in der industriellen Arbeitswelt - Studie zum Status Quo in der Region OstWestfalenLippe
ER -
TY - JOUR
AB - Abstract
Künstliche Intelligenz bietet großes Potenzial im Engineering. Der Einsatz gestattet insbesondere für Wissensarbeiter eine effiziente Arbeitsteilung, in der beispielsweise fehleranfällige und repetitive Aktivitäten unterstützt werden. Eine erfolgreiche Einführung bedarf einer vorangehenden Analyse von nutzenstiftenden Einsatzpotenzialen, bei der alle Anwendenden frühzeitig einbezogen werden. Der folgende Beitrag verdeutlicht dieses Vorgehen anhand eines realen Beispiels im Sondermaschinenbau.
AU - Kharatyan, Aschot
AU - Humpert, Lynn
AU - Anacker, Harald
AU - Dumitrescu, Roman
AU - Wäschle, Moritz
AU - Albers, Albert
AU - Horstmeyer, Sarah
ID - 33701
IS - 6
JF - Zeitschrift für wirtschaftlichen Fabrikbetrieb
KW - Management Science and Operations Research
KW - Strategy and Management
KW - General Engineering
SN - 2511-0896
TI - Künstliche Intelligenz im Engineering
VL - 117
ER -
TY - JOUR
AB - AbstractThe ongoing digitalization of products offers product managers new potentials to plan future product generations based on data from the use phase instead of assumptions. However, product managers often face difficulties in identifying promising opportunities for analyzing use phase data. In this paper, we propose a method for planning the analysis of use phase data in product planning. It leads product managers from the identification of promising investigation needs to the derivation of specific use cases. The application of the method is shown using the example of a manufacturing company.
AU - Meyer, Maurice
AU - Wiederkehr, Ingrid
AU - Koldewey, Christian
AU - Dumitrescu, Roman
ID - 33705
JF - Proceedings of the Design Society
SN - 2732-527X
TI - Planning the Analysis of Use Phase Data in Product Planning
VL - 2
ER -