TY - JOUR
AU - Maack, Marten
ID - 44077
IS - 3
JF - Operations Research Letters
KW - Applied Mathematics
KW - Industrial and Manufacturing Engineering
KW - Management Science and Operations Research
KW - Software
SN - 0167-6377
TI - Online load balancing on uniform machines with limited migration
VL - 51
ER -
TY - GEN
AU - Schürmann, Patrick
ID - 43374
TI - A Formal Comparison of Advanced Digital Signature Primitives
ER -
TY - CONF
AU - Gharibian, Sevag
AU - Watson, James
AU - Bausch, Johannes
ID - 20841
T2 - Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS)
TI - The Complexity of Translationally Invariant Problems beyond Ground State Energies
VL - 254
ER -
TY - GEN
AB - Extending the notion of maxcut, the study of the frustration index of signed graphs is one of the basic questions in the theory of signed graphs. Recently two of the authors initiated the study of critically frustrated signed graphs. That is a signed graph whose frustration index decreases with the removal of any edge. The main focus of this study is on critical signed graphs which are not edge-disjoint unions of critically frustrated signed graphs (namely non-decomposable signed graphs) and which are not built from other critically frustrated signed graphs by subdivision. We conjecture that for any given k there are only finitely many critically k-frustrated signed graphs of this kind.
Providing support for this conjecture we show that there are only two of such critically 3-frustrated signed graphs where there is no pair of edge-disjoint negative cycles. Similarly, we show that there are exactly ten critically 3-frustrated signed planar graphs that are neither decomposable nor subdivisions of other critically frustrated signed graphs. We present a method for building non-decomposable critically frustrated signed graphs based on two given such signed graphs. We also show that the condition of being non-decomposable is necessary for our conjecture.
AU - Cappello, Chiara
AU - Naserasr, Reza
AU - Steffen, Eckhard
AU - Wang, Zhouningxin
ID - 44501
T2 - arXiv:2304.10243
TI - Critically 3-frustrated signed graphs
ER -
TY - CONF
AU - Ahmed, Qazi Arbab
AU - Awais, Muhammad
AU - Platzner, Marco
ID - 44194
T2 - The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA
TI - MAAS: Hiding Trojans in Approximate Circuits
ER -
TY - GEN
AU - Schweichhart, Jonas
ID - 44735
TI - Minimum Edge Cuts in Overlay Networks
ER -
TY - CHAP
AU - Castenow, Jannik
AU - Harbig, Jonas
AU - Meyer auf der Heide, Friedhelm
ID - 44769
SN - 0302-9743
T2 - Lecture Notes in Computer Science
TI - Unifying Gathering Protocols for Swarms of Mobile Robots
ER -
TY - JOUR
AB - Ancestral reconstruction is a classic task in comparative genomics. Here, we study the genome median problem, a related computational problem which, given a set of three or more genomes, asks to find a new genome that minimizes the sum of pairwise distances between it and the given genomes. The distance stands for the amount of evolution observed at the genome level, for which we determine the minimum number of rearrangement operations necessary to transform one genome into the other. For almost all rearrangement operations the median problem is NP-hard, with the exception of the breakpoint median that can be constructed efficiently for multichromosomal circular and mixed genomes. In this work, we study the median problem under a restricted rearrangement measure called c4-distance, which is closely related to the breakpoint and the DCJ distance. We identify tight bounds and decomposers of the c4-median and develop algorithms for its construction, one exact ILP-based and three combinatorial heuristics. Subsequently, we perform experiments on simulated data sets. Our results suggest that the c4-distance is useful for the study the genome median problem, from theoretical and practical perspectives.
AU - Silva, Helmuth O.M.
AU - Rubert, Diego P.
AU - Araujo, Eloi
AU - Steffen, Eckhard
AU - Doerr, Daniel
AU - Martinez, Fábio V.
ID - 44857
IS - 3
JF - RAIRO - Operations Research
KW - Management Science and Operations Research
KW - Computer Science Applications
KW - Theoretical Computer Science
SN - 0399-0559
TI - Algorithms for the genome median under a restricted measure of rearrangement
VL - 57
ER -
TY - GEN
AU - Ma, Yulai
AU - Mattiolo, Davide
AU - Steffen, Eckhard
AU - Wolf, Isaak Hieronymus
ID - 44859
T2 - arXiv:2305.08619
TI - Sets of r-graphs that color all r-graphs
ER -
TY - CONF
AU - Wolters, Dennis
AU - Engels, Gregor
ID - 34294
SN - 2184-4348
T2 - MODELSWARD'23
TI - Model-driven Collaborative Design of Professional Education Programmes With Extended Online Whiteboards
ER -
TY - THES
AU - Pauck, Felix
ID - 43108
TI - Cooperative Android App Analysis
ER -
TY - CONF
AU - Werthmann, Julian
AU - Scheideler, Christian
AU - Coy, Sam
AU - Czumaj, Artur
AU - Schneider, Philipp
ID - 45188
TI - Routing Schemes for Hybrid Communication Networks
ER -
TY - CONF
AB - Market transactions are subject to information asymmetry about the delivered value proposition, causing transaction costs and adverse market effects among buyers and sellers. Information systems research has investigated how review systems can reduce information asymmetry in business-to-consumer markets. However, these systems cannot be readily applied to business-to-business markets, are vulnerable to manipulation, and suffer from conceptual weak spots since they use textual data or star ratings. Building on design science research, we conceptualize a new class of reputation systems based on monetary-based payments as quantitative ratings for each transaction stored on a blockchain. Using cryptography, we show that our system assures content confidentiality so that buyers can share and sell their ratings selectively, establishing a reputation ecosystem. Our prescriptive insights advance the design of reputation systems and offer new paths to understanding the antecedents, dynamics, and consequences to reduce information asymmetry in B2B transactions.
AU - Hemmrich, Simon
AU - Bobolz, Jan
AU - Beverungen, Daniel
AU - Blömer, Johannes
ID - 44855
T2 - ECIS 2023 Research Papers
TI - Designing Business Reputation Ecosystems — A Method for Issuing and Trading Monetary Ratings on a Blockchain
ER -
TY - CONF
AU - Dreiling, Dmitrij
AU - Itner, Dominik
AU - Hetkämper, Tim
AU - Birk, Carolin
AU - Gravenkamp, Hauke
AU - Henning, Bernd
ID - 45205
SN - 978-3-9819376-8-8
T2 - SMSI 2023 Conference
TI - Improved determination of viscoelastic material parameters using a pulse-echo measurement setup
ER -
TY - GEN
AU - N., N.
ID - 45243
TI - Development and Evaluation of a Model-Based UI Prototyping Experimentation Approach
ER -
TY - JOUR
AU - Hanusch, Maximilian
ID - 34833
IS - 4
JF - Indagationes Mathematicae.
KW - Lie group actions and analytic 1-submanifolds
TI - Decompositions of Analytic 1-Manifolds
VL - 34
ER -
TY - CONF
AU - Karakaya, Kadiray
AU - Bodden, Eric
ID - 45312
T2 - 2023 IEEE Conference on Software Testing, Verification and Validation (ICST)
TI - Two Sparsification Strategies for Accelerating Demand-Driven Pointer Analysis
ER -
TY - GEN
AU - Koch, Angelina
ID - 43375
TI - Privacy-Preserving Collection and Evaluation of Log Files
ER -
TY - JOUR
AU - Claes, Leander
AU - Feldmann, Nadine
AU - Schulze, Veronika
AU - Meihost, Lars
AU - Kuhlmann, Henrik
AU - Jurgelucks, Benjamin
AU - Walther, Andrea
AU - Henning, Bernd
ID - 45445
IS - 1
JF - Journal of Sensors and Sensor Systems
TI - Inverse procedure for measuring piezoelectric material parameters using a single multi-electrode sample
VL - 12
ER -
TY - GEN
AU - Claes, Leander
AU - Meihost, Lars
AU - Jurgelucks, Benjamin
ID - 45455
TI - Inverse procedure for the identification of piezoelectric material parameters supported by dense neural networks
ER -
TY - JOUR
AB - AbstractGraffiti is an urban phenomenon that is increasingly attracting the interest of the sciences. To the best of our knowledge, no suitable data corpora are available for systematic research until now. The Information System Graffiti in Germany project (Ingrid) closes this gap by dealing with graffiti image collections that have been made available to the project for public use. Within Ingrid, the graffiti images are collected, digitized and annotated. With this work, we aim to support the rapid access to a comprehensive data source on Ingrid targeted especially by researchers. In particular, we present IngridKG, an RDF knowledge graph of annotated graffiti, abides by the Linked Data and FAIR principles. We weekly update IngridKG by augmenting the new annotated graffiti to our knowledge graph. Our generation pipeline applies RDF data conversion, link discovery and data fusion approaches to the original data. The current version of IngridKG contains 460,640,154 triples and is linked to 3 other knowledge graphs by over 200,000 links. In our use case studies, we demonstrate the usefulness of our knowledge graph for different applications.
AU - Sherif, Mohamed Ahmed
AU - da Silva, Ana Alexandra Morim
AU - Pestryakova, Svetlana
AU - Ahmed, Abdullah Fathi
AU - Niemann, Sven
AU - Ngomo, Axel-Cyrille Ngonga
ID - 45484
IS - 1
JF - Scientific Data
KW - Library and Information Sciences
KW - Statistics
KW - Probability and Uncertainty
KW - Computer Science Applications
KW - Education
KW - Information Systems
KW - Statistics and Probability
SN - 2052-4463
TI - IngridKG: A FAIR Knowledge Graph of Graffiti
VL - 10
ER -
TY - JOUR
AU - Kruse, Stephan
AU - Serino, Laura
AU - Folge, Patrick Fabian
AU - Echeverria Oviedo, Dana
AU - Bhattacharjee, Abhinandan
AU - Stefszky, Michael
AU - Scheytt, J. Christoph
AU - Brecht, Benjamin
AU - Silberhorn, Christine
ID - 45485
IS - 14
JF - IEEE Photonics Technology Letters
KW - Electrical and Electronic Engineering
KW - Atomic and Molecular Physics
KW - and Optics
KW - Electronic
KW - Optical and Magnetic Materials
SN - 1041-1135
TI - A Pulsed Lidar System With Ultimate Quantum Range Accuracy
VL - 35
ER -
TY - GEN
AB - We present a novel method for high-order phase reduction in networks of
weakly coupled oscillators and, more generally, perturbations of reducible
normally hyperbolic (quasi-)periodic tori. Our method works by computing an
asymptotic expansion for an embedding of the perturbed invariant torus, as well
as for the reduced phase dynamics in local coordinates. Both can be determined
to arbitrary degrees of accuracy, and we show that the phase dynamics may
directly be obtained in normal form. We apply the method to predict remote
synchronisation in a chain of coupled Stuart-Landau oscillators.
AU - von der Gracht, Sören
AU - Nijholt, Eddie
AU - Rink, Bob
ID - 45498
T2 - arXiv:2306.03320
TI - A parametrisation method for high-order phase reduction in coupled oscillator networks
ER -
TY - THES
AU - Castenow, Jannik
ID - 45580
TI - Local Protocols for Contracting and Expanding Robot Formation Problems
ER -
TY - THES
AU - Knollmann, Till
ID - 45579
TI - Online Algorithms for Allocating Heterogeneous Resources
ER -
TY - JOUR
AB - Dielectric metasurfaces provide a unique platform for efficient harmonic generation and optical wavefront manipulation at the nanoscale. Tailoring phase and amplitude of a nonlinearly generated wave with a high emission efficiency using resonance-based metasurfaces is a challenging task that often requires state-of-the-art numerical methods. Here, we propose a simple yet effective approach combining a sampling method with a Monte Carlo approach to design the third-harmonic wavefront generated by all-dielectric metasurfaces composed of elliptical silicon nanodisks. Using this approach, we theoretically demonstrate the full nonlinear 2π phase control with a uniform and highest possible amplitude in the considered parameter space, allowing us to design metasurfaces operating as third harmonic beam deflectors capable of steering light into a desired direction with high emission efficiency. The TH beam deflection with a record calculated average conversion efficiency of 1.2 × 10–1 W–2 is achieved. We anticipate that the proposed approach will be widely applied as alternative to commonly used optimization algorithms with higher complexity and implementation effort for the design of metasurfaces with other holographic functionalities.
AU - Hähnel, David
AU - Förstner, Jens
AU - Myroshnychenko, Viktor
ID - 45596
JF - ACS Photonics
KW - tet_topic_meta
SN - 2330-4022
TI - Efficient Modeling and Tailoring of Nonlinear Wavefronts in Dielectric Metasurfaces
ER -
TY - CONF
AU - Hotegni, Sedjro Salomon
AU - Mahabadi, Sepideh
AU - Vakilian, Ali
ID - 45695
KW - Fair range clustering
T2 - Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, USA. PMLR 202, 2023.
TI - Approximation Algorithms for Fair Range Clustering
ER -
TY - CONF
AU - Hebrok, Sven Niclas
AU - Nachtigall, Simon
AU - Maehren, Marcel
AU - Erinola, Nurullah
AU - Merget, Robert
AU - Somorovsky, Juraj
AU - Schwenk, Jörg
ID - 43060
T2 - 32nd USENIX Security Symposium
TI - We Really Need to Talk About Session Tickets: A Large-Scale Analysis of Cryptographic Dangers with TLS Session Tickets
ER -
TY - CHAP
AB - The field of teaching technologies is in constant interplay between educational and industrial advances. Since the beginning of the twenty-first century, digitalization and automatization have become increasingly important. In industrial and social life, we see similar fast-moving developments. These factors challenge education, specifically vocational education, greatly, and raise two very different, yet very much connected questions: how to prepare students for their vocational lives and how to prepare teachers to communicate the necessary competencies to their students? This chapter provides an overview of advances, challenges, and possible solutions, focusing on the three key fields of vocational education in Germany: Industry 4.0, Education 4.0, and innovative teacher education. Most importantly, however, the text examines the continuous interplay between and among these fields. The beginning of the chapter is dedicated to vocational teacher education, in accordance with industrial and educational advances. Specifying this, characteristics of Industry 4.0, as well as students' and teachers' perceptions of Industry 4.0, are discussed. This is followed by an introduction to the concept of so-called learning factories as a possible way of integrating aspects of Industry 4.0 in German vocational schools. The end of the chapter is dedicated to the required changes in educational settings today and in the future. Though Industry 4.0, Education 4.0, and innovative teacher education are each widely discussed in the current literature, the interplay of all three fields reveals a research gap. This chapter tries to close this gap and provide an important contribution to the research field.
AU - Jonas-Ahrend, Gabriela
AU - Vernholz, Mats
AU - Temmen, Katrin
ED - Craig, Cheryl J.
ED - Mena, Juanjo
ED - Kane, Ruth G.
ID - 45552
SN - 1479-3687
T2 - Teacher Education in the Wake of Covid-19
TI - Teaching Technologies: Continuous Interplay Between Educational and Industrial Advances
VL - 41
ER -
TY - JOUR
AU - Häsel-Weide, Uta
ID - 45712
IS - 339
JF - Die Grundschulzeitschrift
TI - Inklusiver Mathematikunterricht. Mathematiklernen in Vielfalt von Kompetenzen, Wegen und Lernsituationen
ER -
TY - JOUR
AU - Graf, Lara Marie
AU - Wienhues, Inga
AU - Häsel-Weide, Uta
ID - 45713
IS - 339
JF - Die Grundschulzeitschrift
TI - Addition und Subtraktion verstehen
ER -
TY - GEN
AU - Simon-Mertens, Florian
ID - 45762
TI - Effizienzanalyse leichtgewichtiger Neuronaler Netze für FPGA-basierte Modulationsklassifikation
ER -
TY - CONF
AB - RISC-V has received worldwide acceptance in the industry and by the academic community. As of today, multiple
RISC-V applications and variants are under investigation for embedded IoT systems, from resource-limited single-core
processors up to multi-core systems for High-Performance Computing (HPC). Recently, the Grid of Processing Cells
(GPC) platform has been proposed as a scalable parallel grid-oriented network of processor cores with local memories.
This paper describes a prototype design of the GPC platform for hardware implementation at Register-Transfer Level
(RTL) based on modified RISC-V Rocket processors with scratchpad memories. It introduces a scalable Chisel-based
implementation of the modified Rocket cores with RTL generation and a functional test using Verilator simulation. This
work also includes the adaptation of the Chipyard software toolchain to extend the compiler to multi-core grids with
different local address spaces.
AU - Luchterhandt, Lars
AU - Nellius, Tom
AU - Beck, Robert
AU - Dömer, Rainer
AU - Kneuper, Pascal
AU - Müller, Wolfgang
AU - Sadiye, Babak
ID - 45778
T2 - MBMV 2023 - 26. Workshop "Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen“
TI - Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen
ER -
TY - CONF
AU - Ecker, Wolfgang
AU - Krstic, Milos
AU - Ulbricht, Markus
AU - Mauderer, Andreas
AU - Jentzsch, Eyck
AU - Koch, Andreas
AU - Koppelmann, Bastian
AU - Müller, Wolfgang
AU - Sadiye, Babak
AU - Bruns, Niklas
AU - Drechsler, Rolf
AU - Müller-Gritschneder, Daniel
AU - Schlamelcher, Jan
AU - Grüttner, Kim
AU - Bormann, Jörg
AU - Kunz, Wolfgang
AU - Heckmann, Reinhold
AU - Angst, Gerhard
AU - Wimmer, Ralf
AU - Becker, Bernd
AU - Faller, Tobias
AU - Palomero Bernardo, Paul
AU - Brinkmann, Oliver
AU - Partzsch, Johannes
AU - Mayr, Christian
ID - 45776
T2 - Scale4Edge – Scaling RISC-V for Edge Applications
TI - Scale4Edge – Scaling RISC-V for Edge Applications
ER -
TY - CONF
AB - The global megatrends of digitization and sustainability lead to new challenges for the design and management of technical products in industrial companies. Product management - as the bridge between market and company - has the task to absorb and combine the manifold requirements and make the right product-related decisions. In the process, product management is confronted with heterogeneous information, rapidly changing portfolio components, as well as increasing product, and organizational complexity. Combining and utilizing data from different sources, e.g., product usage data and social media data leads to promising potentials to improve the quality of product-related decisions. In this paper, we reinforce the need for data-driven product management as an interdisciplinary field of action. The state of data-driven product management in practice was analyzed by conducting workshops with six manufacturing companies and hosting a focus group meeting with experts from different industries. We investigate the expectations and derive requirements leading us to open research questions, a vision for data-driven product management, and a research agenda to shape future research efforts.
AU - Grigoryan, Khoren
AU - Fichtler, Timm
AU - Schreiner, Nick
AU - Rabe, Martin
AU - Panzner, Melina
AU - Kühn, Arno
AU - Dumitrescu, Roman
AU - Koldewey, Christian
ID - 45793
KW - Product Management
KW - Data Analytics
KW - Data-Driven Design
KW - Product-related data
KW - Lifecycle Data
KW - Tool-support
T2 - Procedia CIRP 33
TI - Data-Driven Product Management: A Practitioner-Driven Research Agenda
ER -
TY - CONF
AU - Özcan, Leon
AU - Fichtler, Timm
AU - Kasten, Benjamin
AU - Koldewey, Christian
AU - Dumitrescu, Roman
ID - 45812
KW - Digital Platform
KW - Platform Strategy
KW - Strategic Management
KW - Platform Life Cycle
KW - Interview Study
KW - Business Model
KW - Business-to-Business
KW - Two-sided Market
KW - Multi-sided Market
TI - Interview Study on Strategy Options for Platform Operation in B2B Markets
ER -
TY - CONF
AB - Many applications require explainable node classification in knowledge graphs. Towards this end, a popular ``white-box'' approach is class expression learning: Given sets of positive and negative nodes, class expressions in description logics are learned that separate positive from negative nodes. Most existing approaches are search-based approaches generating many candidate class expressions and selecting the best one. However, they often take a long time to find suitable class expressions. In this paper, we cast class expression learning as a translation problem and propose a new family of class expression learning approaches which we dub neural class expression synthesizers. Training examples are ``translated'' into class expressions in a fashion akin to machine translation. Consequently, our synthesizers are not subject to the runtime limitations of search-based approaches. We study three instances of this novel family of approaches based on LSTMs, GRUs, and set transformers, respectively. An evaluation of our approach on four benchmark datasets suggests that it can effectively synthesize high-quality class expressions with respect to the input examples in approximately one second on average. Moreover, a comparison to state-of-the-art approaches suggests that we achieve better F-measures on large datasets. For reproducibility purposes, we provide our implementation as well as pretrained models in our public GitHub repository at https://github.com/dice-group/NeuralClassExpressionSynthesis
AU - KOUAGOU, N'Dah Jean
AU - Heindorf, Stefan
AU - Demir, Caglar
AU - Ngonga Ngomo, Axel-Cyrille
ED - Pesquita, Catia
ED - Jimenez-Ruiz, Ernesto
ED - McCusker, Jamie
ED - Faria, Daniel
ED - Dragoni, Mauro
ED - Dimou, Anastasia
ED - Troncy, Raphael
ED - Hertling, Sven
ID - 33734
KW - Neural network
KW - Concept learning
KW - Description logics
T2 - The Semantic Web - 20th Extended Semantic Web Conference (ESWC 2023)
TI - Neural Class Expression Synthesis
VL - 13870
ER -
TY - GEN
AB - Knowledge bases are widely used for information management on the web,
enabling high-impact applications such as web search, question answering, and
natural language processing. They also serve as the backbone for automatic
decision systems, e.g. for medical diagnostics and credit scoring. As
stakeholders affected by these decisions would like to understand their
situation and verify fair decisions, a number of explanation approaches have
been proposed using concepts in description logics. However, the learned
concepts can become long and difficult to fathom for non-experts, even when
verbalized. Moreover, long concepts do not immediately provide a clear path of
action to change one's situation. Counterfactuals answering the question "How
must feature values be changed to obtain a different classification?" have been
proposed as short, human-friendly explanations for tabular data. In this paper,
we transfer the notion of counterfactuals to description logics and propose the
first algorithm for generating counterfactual explanations in the description
logic $\mathcal{ELH}$. Counterfactual candidates are generated from concepts
and the candidates with fewest feature changes are selected as counterfactuals.
In case of multiple counterfactuals, we rank them according to the likeliness
of their feature combinations. For evaluation, we conduct a user survey to
investigate which of the generated counterfactual candidates are preferred for
explanation by participants. In a second study, we explore possible use cases
for counterfactual explanations.
AU - Sieger, Leonie Nora
AU - Heindorf, Stefan
AU - Blübaum, Lukas
AU - Ngonga Ngomo, Axel-Cyrille
ID - 37937
T2 - arXiv:2301.05109
TI - Counterfactual Explanations for Concepts in ELH
ER -
TY - THES
AB - Reading between the lines has so far been reserved for humans. The present dissertation addresses this research gap using machine learning methods.
Implicit expressions are not comprehensible by computers and cannot be localized in the text. However, many texts arise on interpersonal topics that, unlike commercial evaluation texts, often imply information only by means of longer phrases. Examples are the kindness and the attentiveness of a doctor, which are only paraphrased (“he didn’t even look me in the eye”). The analysis of such data, especially the identification and localization of implicit statements, is a research gap (1). This work uses so-called Aspect-based Sentiment Analysis as a method for this purpose. It remains open how the aspect categories to be extracted can be discovered and thematically delineated based on the data (2). Furthermore, it is not yet explored how a collection of tools should look like, with which implicit phrases can be identified and thus made explicit
(3). Last, it is an open question how to correlate the identified phrases from the text data with other data, including the investigation of the relationship between quantitative scores (e.g., school grades) and the thematically related text (4). Based on these research gaps, the research question is posed as follows: Using text mining methods, how can implicit rating content be properly interpreted and thus made explicit before it is automatically categorized and quantified?
The uniqueness of this dissertation is based on the automated recognition of implicit linguistic statements alongside explicit statements. These are identified in unstructured text data so that features expressed only in the text can later be compared across data sources, even though they were not included in rating categories such as stars or school grades. German-language physician ratings from websites in three countries serve as the sample domain. The solution approach consists of data creation, a pipeline for text processing and analyses based on this. In the data creation, aspect classes are identified and delineated across platforms and marked in text data. This results in six datasets with over 70,000 annotated sentences and detailed guidelines. The models that were created based on the training data extract and categorize the aspects. In addition, the sentiment polarity and the evaluation weight, i. e., the importance of each phrase, are determined. The models, which are combined in a pipeline, are used in a prototype in the form of a web application. The analyses built on the pipeline quantify the rating contents by linking the obtained information with further data, thus allowing new insights.
As a result, a toolbox is provided to identify quantifiable rating content and categories using text mining for a sample domain. This is used to evaluate the approach, which in principle can also be adapted to any other domain.
AU - Kersting, Joschka
ID - 44323
TI - Identifizierung quantifizierbarer Bewertungsinhalte und -kategorien mittels Text Mining
ER -
TY - CHAP
AU - Götte, Thorsten
AU - Knollmann, Till
AU - Meyer auf der Heide, Friedhelm
AU - Scheideler, Christian
AU - Werthmann, Julian
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45875
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Capabilities and Limitations of Local Strategies in Dynamic Networks
VL - 412
ER -
TY - CHAP
AU - Karl, Holger
AU - Maack, Marten
AU - Meyer auf der Heide, Friedhelm
AU - Pukrop, Simon
AU - Redder, Adrian
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45895
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - On-The-Fly Compute Centers II: Execution of Composed Services in Configurable Compute Centers
VL - 412
ER -
TY - CHAP
AU - Blömer, Johannes
AU - Bobolz, Jan
AU - Eidens, Fabian
AU - Jager, Tibor
AU - Kramer, Paul
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45901
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Practical Cryptograhic Techniques for Secure and Privacy-Preserving Customer Loyalty Systems
VL - 412
ER -
TY - CHAP
AU - Boschmann, Alexander
AU - Clausing, Lennart
AU - Jentzsch, Felix
AU - Ghasemzadeh Mohammadi, Hassan
AU - Platzner, Marco
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45899
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Flexible Industrial Analytics on Reconfigurable Systems-On-Chip
VL - 412
ER -
TY - CHAP
AU - Wehrheim, Heike
AU - Platzner, Marco
AU - Bodden, Eric
AU - Schubert, Philipp
AU - Pauck, Felix
AU - Jakobs, Marie-Christine
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45888
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Verifying Software and Reconfigurable Hardware Services
VL - 412
ER -
TY - CHAP
AU - Gottschalk, Sebastian
AU - Vorbohle, Christian
AU - Kundisch, Dennis
AU - Engels, Gregor
AU - Wünderlich, Nacy V.
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45897
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Architectural Management of OTF Computing Markets
VL - 412
ER -
TY - CHAP
AU - Blömer, Johannes
AU - Eidens, Fabian
AU - Jager, Tibor
AU - Niehues, David
AU - Scheideler, Christian
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45891
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Robustness and Security
VL - 412
ER -
TY - CHAP
AU - Bäumer, Frederik Simon
AU - Chen, Wei-Fan
AU - Geierhos, Michaela
AU - Kersting, Joschka
AU - Wachsmuth, Henning
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45882
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation
VL - 412
ER -
TY - CHAP
AU - Hanselle, Jonas Manuel
AU - Hüllermeier, Eyke
AU - Mohr, Felix
AU - Ngonga Ngomo, Axel-Cyrille
AU - Sherif, Mohamed
AU - Tornede, Alexander
AU - Wever, Marcel Dominik
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45884
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Configuration and Evaluation
VL - 412
ER -
TY - CHAP
AU - Haake, Claus-Jochen
AU - Hehenkamp, Burkhard
AU - Polevoy, Gleb
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45878
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - The Market for Services: Incentives, Algorithms, Implementation
VL - 412
ER -
TY - CHAP
AU - Wehrheim, Heike
AU - Hüllermeier, Eyke
AU - Becker, Steffen
AU - Becker, Matthias
AU - Richter, Cedric
AU - Sharma, Arnab
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45886
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Composition Analysis in Unknown Contexts
VL - 412
ER -
TY - GEN
AU - Raeisi Nafchi, Masood
ID - 45917
TI - Reconfigurable Random Forest Implementation on FPGA
ER -
TY - GEN
AU - Yadalam Murali Kumar, Nihal
ID - 45916
TI - Data Analytics for Predictive Maintenance of Time Series Data
ER -
TY - CONF
AB - Variational Quantum Algorithms (VQAs), such as the Quantum Approximate
Optimization Algorithm (QAOA) of [Farhi, Goldstone, Gutmann, 2014], have seen
intense study towards near-term applications on quantum hardware. A crucial
parameter for VQAs is the depth of the variational ansatz used - the smaller
the depth, the more amenable the ansatz is to near-term quantum hardware in
that it gives the circuit a chance to be fully executed before the system
decoheres. This potential for depth reduction has made VQAs a staple of Noisy
Intermediate-Scale Quantum (NISQ)-era research.
In this work, we show that approximating the optimal depth for a given VQA
ansatz is intractable. Formally, we show that for any constant $\epsilon>0$, it
is QCMA-hard to approximate the optimal depth of a VQA ansatz within
multiplicative factor $N^{1-\epsilon}$, for $N$ denoting the encoding size of
the VQA instance. (Here, Quantum Classical Merlin-Arthur (QCMA) is a quantum
generalization of NP.) We then show that this hardness persists even in the
"simpler" setting of QAOAs. To our knowledge, this yields the first natural
QCMA-hard-to-approximate problems. To achieve these results, we bypass the need
for a PCP theorem for QCMA by appealing to the disperser-based NP-hardness of
approximation construction of [Umans, FOCS 1999].
AU - Bittel, Lennart
AU - Gharibian, Sevag
AU - Kliesch, Martin
ID - 34138
IS - 34
T2 - Proceedings of the 38th Computational Complexity Conference (CCC)
TI - The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate
VL - 264
ER -
TY - JOUR
AB - Intending to counteract Klein’s second discontinuity in teacher education, we explored and applied the innovation of “interface ePortfolio” in the context of a geometry course for preservice teachers (PSTs). The tool offers the possibility of implementing the design principle of profession orientation. In the article, we theoretically clarify what we understand by this principle and locate our innovative concept against this theoretical background. We empirically investigate the extent to which counteraction against the second discontinuity is successful by analyzing reflection texts created in the interface ePortfolio, focusing on PSTs’ perspectives. Our qualitative content analysis shows that most of them perceive the innovation as helpful in the intended sense and indicates that the course concept, in general, and the interface ePortfolio, in particular, have helped establish relevant links between the course content and their later work as teachers.
AU - Hoffmann, Max
AU - Biehler, Rolf
ID - 45786
JF - ZDM – Mathematics Education
KW - General Mathematics
KW - Education
SN - 1863-9690
TI - Implementing profession orientation as a design principle for overcoming Klein’s second discontinuity – preservice teacher’s perspectives on interface activities in the context of a geometry course
ER -
TY - THES
AU - Pukrop, Simon
ID - 45781
TI - On Cloud Assisted, Restricted, and Reosurce Constrained Scheduling
ER -
TY - GEN
AU - Schneider, Fabian
ID - 46053
TI - Utilizing Redundancy in Distributed Heterogeneous Storage
ER -
TY - GEN
AU - Raeisi Nafchi, Masood
ID - 46075
TI - Reconfigurable Random Forest Implementation on FPGA
ER -
TY - GEN
AU - Ranade, Amruta
ID - 46087
TI - Graph Neural Network-based Anomaly Detection in Smart Grid Energy Consumption
ER -
TY - GEN
AU - Ali, Osama
ID - 46086
TI - Highly accurate deep compressed facial recognition
ER -
TY - JOUR
AU - Hinrichs, Benjamin
AU - Janssen, Daan W.
AU - Ziebell, Jobst
ID - 46100
IS - 1
JF - Journal of Mathematical Analysis and Applications
KW - Applied Mathematics
KW - Analysis
SN - 0022-247X
TI - Super-Gaussian decay of exponentials: A sufficient condition
VL - 528
ER -
TY - GEN
AU - Ashri, Nivedita
ID - 46110
TI - Virtual On-Demand Volunteer System Based on Delaunay Triangulation
ER -
TY - GEN
AB - Let $X=X_1\times X_2$ be a product of two rank one symmetric spaces of
non-compact type and $\Gamma$ a torsion-free discrete subgroup in $G_1\times
G_2$. We show that the spectrum of $\Gamma \backslash X$ is related to the
asymptotic growth of $\Gamma$ in the two direction defined by the two factors.
We obtain that $L^2(\Gamma \backslash G)$ is tempered for large class of
$\Gamma$.
AU - Weich, Tobias
AU - Wolf, Lasse L.
ID - 46117
T2 - arXiv:2304.09573
TI - Temperedness of locally symmetric spaces: The product case
ER -
TY - JOUR
AU - Brosch, Anian
AU - Tinazzi, Fabio
AU - Wallscheid, Oliver
AU - Zigliotto, Mauro
AU - Böcker, Joachim
ID - 46147
JF - IEEE Transactions on Power Electronics
KW - Electrical and Electronic Engineering
SN - 0885-8993
TI - Finite Set Sensorless Control With Minimum a Priori Knowledge and Tuning Effort for Interior Permanent Magnet Synchronous Motors
ER -
TY - JOUR
AU - Bruns, Julia
AU - Hagena, Maike
AU - Gasteiger, Hedwig
ID - 46155
JF - Teaching and Teacher Education
KW - Education
SN - 0742-051X
TI - Professional Development Enacted by Facilitators in the Context of Early Mathematics Education: Scaling up or Dilution of Effects?
VL - 132
ER -
TY - BOOK
ED - Biehler, Rolf
ED - Liebendörfer, Michael
ED - Gueudet, Ghislaine
ED - Rasmussen, Chris
ED - Winsløw, Carl
ID - 46157
SN - 1869-4918
TI - Practice-Oriented Research in Tertiary Mathematics Education
ER -
TY - JOUR
AB - While FPGA accelerator boards and their respective high-level design tools are maturing, there is still a lack of multi-FPGA applications, libraries, and not least, benchmarks and reference implementations towards sustained HPC usage of these devices. As in the early days of GPUs in HPC, for workloads that can reasonably be decoupled into loosely coupled working sets, multi-accelerator support can be achieved by using standard communication interfaces like MPI on the host side. However, for performance and productivity, some applications can profit from a tighter coupling of the accelerators. FPGAs offer unique opportunities here when extending the dataflow characteristics to their communication interfaces.
In this work, we extend the HPCC FPGA benchmark suite by multi-FPGA support and three missing benchmarks that particularly characterize or stress inter-device communication: b_eff, PTRANS, and LINPACK. With all benchmarks implemented for current boards with Intel and Xilinx FPGAs, we established a baseline for multi-FPGA performance. Additionally, for the communication-centric benchmarks, we explored the potential of direct FPGA-to-FPGA communication with a circuit-switched inter-FPGA network that is currently only available for one of the boards. The evaluation with parallel execution on up to 26 FPGA boards makes use of one of the largest academic FPGA installations.
AU - Meyer, Marius
AU - Kenter, Tobias
AU - Plessl, Christian
ID - 38041
JF - ACM Transactions on Reconfigurable Technology and Systems
KW - General Computer Science
SN - 1936-7406
TI - Multi-FPGA Designs and Scaling of HPC Challenge Benchmarks via MPI and Circuit-Switched Inter-FPGA Networks
ER -
TY - CHAP
AU - Hansmeier, Tim
AU - Kenter, Tobias
AU - Meyer, Marius
AU - Riebler, Heinrich
AU - Platzner, Marco
AU - Plessl, Christian
ED - Haake, Claus-Jochen
ED - Meyer auf der Heide, Friedhelm
ED - Platzner, Marco
ED - Wachsmuth, Henning
ED - Wehrheim, Heike
ID - 45893
T2 - On-The-Fly Computing -- Individualized IT-services in dynamic markets
TI - Compute Centers I: Heterogeneous Execution Environments
VL - 412
ER -
TY - CONF
AU - Opdenhövel, Jan-Oliver
AU - Plessl, Christian
AU - Kenter, Tobias
ID - 46190
T2 - Proceedings of the 13th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies
TI - Mutation Tree Reconstruction of Tumor Cells on FPGAs Using a Bit-Level Matrix Representation
ER -
TY - CONF
AU - Faj, Jennifer
AU - Kenter, Tobias
AU - Faghih-Naini, Sara
AU - Plessl, Christian
AU - Aizinger, Vadym
ID - 46188
T2 - Proceedings of the Platform for Advanced Scientific Computing Conference
TI - Scalable Multi-FPGA Design of a Discontinuous Galerkin Shallow-Water Model on Unstructured Meshes
ER -
TY - CONF
AU - Prouveur, Charles
AU - Haefele, Matthieu
AU - Kenter, Tobias
AU - Voss, Nils
ID - 46189
T2 - Proceedings of the Platform for Advanced Scientific Computing Conference
TI - FPGA Acceleration for HPC Supercapacitor Simulations
ER -
TY - JOUR
AU - Weber, Daniel
AU - Schenke, Maximilian
AU - Wallscheid, Oliver
ID - 46213
JF - IEEE Access
KW - General Engineering
KW - General Materials Science
KW - General Computer Science
KW - Electrical and Electronic Engineering
SN - 2169-3536
TI - Steady-State Error Compensation for Reinforcement Learning-Based Control of Power Electronic Systems
VL - 11
ER -
TY - CONF
AU - Weber, Daniel
AU - Schenke, Maximilian
AU - Wallscheid, Oliver
ID - 46212
T2 - 2023 International Conference on Future Energy Solutions (FES)
TI - Safe Reinforcement Learning-Based Control in Power Electronic Systems
ER -
TY - GEN
AU - Lienen, Christian
AU - Nowosad, Alexander Philipp
AU - Platzner, Marco
ID - 46229
TI - Mapping and Optimizing Communication in ROS 2-based Applications on Configurable System-on-Chip Platforms
ER -
TY - GEN
AU - N., N.
ID - 46221
TI - Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks
ER -
TY - JOUR
AU - Demir, Caglar
AU - Ngonga Ngomo, Axel-Cyrille
ID - 46251
JF - International Joint Conference on Artificial Intelligence
TI - Neuro-Symbolic Class Expression Learning
ER -
TY - JOUR
AU - Ma, Yulai
AU - Mattiolo, Davide
AU - Steffen, Eckhard
AU - Wolf, Isaak Hieronymus
ID - 46256
IS - 3
JF - SIAM Journal on Discrete Mathematics
KW - General Mathematics
SN - 0895-4801
TI - Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
VL - 37
ER -
TY - CONF
AB - The computation of electron repulsion integrals (ERIs) over Gaussian-type orbitals (GTOs) is a challenging problem in quantum-mechanics-based atomistic simulations. In practical simulations, several trillions of ERIs may have to be
computed for every time step.
In this work, we investigate FPGAs as accelerators for the ERI computation. We use template parameters, here within the Intel oneAPI tool flow, to create customized designs for 256 different ERI quartet classes, based on their orbitals. To maximize data reuse, all intermediates are buffered in FPGA on-chip memory with customized layout. The pre-calculation of intermediates also helps to overcome data dependencies caused by multi-dimensional recurrence
relations. The involved loop structures are partially or even fully unrolled for high throughput of FPGA kernels. Furthermore, a lossy compression algorithm utilizing arbitrary bitwidth integers is integrated in the FPGA kernels. To our
best knowledge, this is the first work on ERI computation on FPGAs that supports more than just the single most basic quartet class. Also, the integration of ERI computation and compression it a novelty that is not even covered by CPU or GPU libraries so far.
Our evaluation shows that using 16-bit integer for the ERI compression, the fastest FPGA kernels exceed the performance of 10 GERIS ($10 \times 10^9$ ERIs per second) on one Intel Stratix 10 GX 2800 FPGA, with maximum absolute errors around $10^{-7}$ - $10^{-5}$ Hartree. The measured throughput can be accurately explained by a performance model. The FPGA kernels deployed on 2 FPGAs outperform similar computations using the widely used libint reference on a two-socket server with 40 Xeon Gold 6148 CPU cores of the same process technology by factors up to 6.0x and on a new two-socket server with 128 EPYC 7713 CPU cores by up to 1.9x.
AU - Wu, Xin
AU - Kenter, Tobias
AU - Schade, Robert
AU - Kühne, Thomas
AU - Plessl, Christian
ID - 43228
T2 - 2023 IEEE 31st Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)
TI - Computing and Compressing Electron Repulsion Integrals on FPGAs
ER -
TY - JOUR
AB - The non-orthogonal local submatrix method applied to electronic structure–based molecular dynamics simulations is shown to exceed 1.1 EFLOP/s in FP16/FP32-mixed floating-point arithmetic when using 4400 NVIDIA A100 GPUs of the Perlmutter system. This is enabled by a modification of the original method that pushes the sustained fraction of the peak performance to about 80%. Example calculations are performed for SARS-CoV-2 spike proteins with up to 83 million atoms.
AU - Schade, Robert
AU - Kenter, Tobias
AU - Elgabarty, Hossam
AU - Lass, Michael
AU - Kühne, Thomas
AU - Plessl, Christian
ID - 45361
JF - The International Journal of High Performance Computing Applications
KW - Hardware and Architecture
KW - Theoretical Computer Science
KW - Software
SN - 1094-3420
TI - Breaking the exascale barrier for the electronic structure problem in ab-initio molecular dynamics
ER -
TY - CONF
AU - Clausing, Lennart
AU - Guetattfi, Zakarya
AU - Kaufmann, Paul
AU - Lienen, Christian
AU - Platzner, Marco
ID - 45913
T2 - Proceedings of the 19th International Symposium on Applied Reconfigurable Computing (ARC)
TI - On Guaranteeing Schedulability of Periodic Real-time Hardware Tasks under ReconOS64
ER -
TY - THES
AU - Tornede, Alexander
ID - 45780
TI - Advanced Algorithm Selection with Machine Learning: Handling Large Algorithm Sets, Learning From Censored Data, and Simplyfing Meta Level Decisions
ER -
TY - CONF
AB - A frequency-flexible Nyquist pulse synthesizer is presented with optical pulse bandwidths up to fopt=100 GHz and repetition rates equal to fopt/9, fabricated in an electronic-photonic co-integrated platform utilizing linear on-chip drivers.
AU - Kress, Christian
AU - Schwabe, Tobias
AU - Silberhorn, Christine
AU - Scheytt, J. Christoph
ID - 45578
T2 - Conference on Lasers and Electro-Optics (CLEO) 2023
TI - Generation of 100 GHz Periodic Nyquist Pulses using Cascaded Mach-Zehnder Modulators in a Silicon Electronic-Photonic Platform
ER -
TY - CONF
AB - The article shows how to learn models of dynamical systems from data which are governed by an unknown variational PDE. Rather than employing reduction techniques, we learn a discrete field theory governed by a discrete Lagrangian density $L_d$ that is modelled as a neural network. Careful regularisation of the loss function for training $L_d$ is necessary to obtain a field theory that is suitable for numerical computations: we derive a regularisation term which optimises the solvability of the discrete Euler--Lagrange equations. Secondly, we develop a method to find solutions to machine learned discrete field theories which constitute travelling waves of the underlying continuous PDE.
AU - Offen, Christian
AU - Ober-Blöbaum, Sina
ED - Nielsen, F
ED - Barbaresco, F
ID - 42163
KW - System identification
KW - discrete Lagrangians
KW - travelling waves
T2 - Geometric Science of Information
TI - Learning discrete Lagrangians for variational PDEs from data and detection of travelling waves
VL - 14071
ER -
TY - JOUR
AB - The principle of least action is one of the most fundamental physical principle. It says that among all possible motions connecting two points in a phase space, the system will exhibit those motions which extremise an action functional. Many qualitative features of dynamical systems, such as the presence of conservation laws and energy balance equations, are related to the existence of an action functional. Incorporating variational structure into learning algorithms for dynamical systems is, therefore, crucial in order to make sure that the learned model shares important features with the exact physical system. In this paper we show how to incorporate variational principles into trajectory predictions of learned dynamical systems. The novelty of this work is that (1) our technique relies only on discrete position data of observed trajectories. Velocities or conjugate momenta do not need to be observed or approximated and no prior knowledge about the form of the variational principle is assumed. Instead, they are recovered using backward error analysis. (2) Moreover, our technique compensates discretisation errors when trajectories are computed from the learned system. This is important when moderate to large step-sizes are used and high accuracy is required. For this,
we introduce and rigorously analyse the concept of inverse modified Lagrangians by developing an inverse version of variational backward error analysis. (3) Finally, we introduce a method to perform system identification from position observations only, based on variational backward error analysis.
AU - Ober-Blöbaum, Sina
AU - Offen, Christian
ID - 29240
JF - Journal of Computational and Applied Mathematics
KW - Lagrangian learning
KW - variational backward error analysis
KW - modified Lagrangian
KW - variational integrators
KW - physics informed learning
SN - 0377-0427
TI - Variational Learning of Euler–Lagrange Dynamics from Data
VL - 421
ER -
TY - JOUR
AB - The numerical solution of an ordinary differential equation can be interpreted as the exact solution of a nearby modified equation. Investigating the behaviour of numerical solutions by analysing the modified equation is known as backward error analysis. If the original and modified equation share structural properties, then the exact and approximate solution share geometric features such as the existence of conserved quantities. Conjugate symplectic methods preserve a modified symplectic form and a modified Hamiltonian when applied to a Hamiltonian system. We show how a blended version of variational and symplectic techniques can be used to compute modified symplectic and Hamiltonian structures. In contrast to other approaches, our backward error analysis method does not rely on an ansatz but computes the structures systematically, provided that a variational formulation of the method is known. The technique is illustrated on the example of symmetric linear multistep methods with matrix coefficients.
AU - McLachlan, Robert
AU - Offen, Christian
ID - 29236
IS - 1
JF - Journal of Geometric Mechanics
KW - variational integrators
KW - backward error analysis
KW - Euler--Lagrange equations
KW - multistep methods
KW - conjugate symplectic methods
TI - Backward error analysis for conjugate symplectic methods
VL - 15
ER -
TY - JOUR
AB - Recently, Hamiltonian neural networks (HNN) have been introduced to incorporate prior physical knowledge when
learning the dynamical equations of Hamiltonian systems. Hereby, the symplectic system structure is preserved despite
the data-driven modeling approach. However, preserving symmetries requires additional attention. In this research, we
enhance the HNN with a Lie algebra framework to detect and embed symmetries in the neural network. This approach
allows to simultaneously learn the symmetry group action and the total energy of the system. As illustrating examples,
a pendulum on a cart and a two-body problem from astrodynamics are considered.
AU - Dierkes, Eva
AU - Offen, Christian
AU - Ober-Blöbaum, Sina
AU - Flaßkamp, Kathrin
ID - 37654
IS - 6
JF - Chaos
SN - 1054-1500
TI - Hamiltonian Neural Networks with Automatic Symmetry Detection
VL - 33
ER -
TY - THES
AB - Ever increasing demands on the performance of microchips are leading to ever more complex semiconductor technologies with ever shrinking feature sizes. Complex applications with high demands on safety and reliability, such as autonomous driving, are simultaneously driving the requirements for test and diagnosis of VLSI circuits. Throughout the life cycle of a microchip, uncertainties occur that affect its timing behavior. For example, weak circuit structures, aging effects, or process variations can lead to a change in the timing behavior of the circuit. While these uncertainties do not necessarily lead to a change of the functional behavior, they can lead to a reliability problem.
With modular and hybrid compaction two test instruments are presented in this work that can be used for X-tolerant test response compaction in the built-in Faster-than-At-Speed Test (FAST) which is used to detect uncertainties in VLSI circuits. One challenge for test response compaction during FAST is the high and varying X-rate at the outputs of the circuit under test. By dividing the circuit outputs into test groups and separately compacting these test groups using stochastic compactors, the modular compaction is able to handle these high and varying X-rates.
To deal with uncertainties on logic interconnects, a method for distinguishing crosstalk and process variation is presented. In current semiconductor technologies, the number of parasitic coupling capacitances between logic interconnects is growing. These coupling capacitances can lead to crosstalk, which causes increased current flow in the logic interconnects, which in turn can lead to increased electromigration. In the presented method, delay maps describing the timing behavior of the circuit outputs at different operating points are used to train artificial neural networks which classify the tested circuits into fault-free and faulty.
AU - Sprenger, Alexander
ID - 46482
KW - Testantwortkompaktierung
KW - Prozessvariation
KW - Silicon Lifecycle Management
TI - Testinstrumente und Testdatenanalyse zur Verarbeitung von Unsicherheiten in Logikblöcken hochintegrierter Schaltungen
ER -
TY - CHAP
AB - Linked knowledge graphs build the backbone of many data-driven applications such as search engines, conversational agents and e-commerce solutions. Declarative link discovery frameworks use complex link specifications to express the conditions under which a link between two resources can be deemed to exist. However, understanding such complex link specifications is a challenging task for non-expert users of link discovery frameworks. In this paper, we address this drawback by devising NMV-LS, a language model-based verbalization approach for translating complex link specifications into natural language. NMV-LS relies on the results of rule-based link specification verbalization to apply continuous training on T5, a large language model based on the Transformerarchitecture. We evaluated NMV-LS on English and German datasets using well-known machine translation metrics such as BLUE, METEOR, ChrF++ and TER. Our results suggest that our approach achieves a verbalization performance close to that of humans and outperforms state of the art approaches. Our source code and datasets are publicly available at https://github.com/dice-group/NMV-LS.
AU - Ahmed, Abdullah Fathi Ahmed
AU - Firmansyah, Asep Fajar
AU - Sherif, Mohamed
AU - Moussallem, Diego
AU - Ngonga Ngomo, Axel-Cyrille
ID - 46516
SN - 0302-9743
T2 - Natural Language Processing and Information Systems
TI - Explainable Integration of Knowledge Graphs Using Large Language Models
ER -
TY - DATA
AB - Graffiti is an urban phenomenon that is increasingly attracting the interest of the sciences. To the best of our knowledge, no suitable data corpora are available for systematic research until now. The Information System Graffiti in Germany project (Ingrid) closes this gap by dealing with graffiti image collections that have been made available to the project for public use. Within Ingrid, the graffiti images are collected, digitized and annotated. With this work, we aim to support the rapid access to a comprehensive data source on Ingrid targeted especially by researchers. In particular, we present IngridKG, an RDF knowledge graph of annotated graffiti, abides by the Linked Data and FAIR principles. We weekly update IngridKG by augmenting the new annotated graffiti to our knowledge graph. Our generation pipeline applies RDF data conversion, link discovery and data fusion approaches to the original data. The current version of IngridKG contains 460,640,154 triples and is linked to 3 other knowledge graphs by over 200,000 links. In our use case studies, we demonstrate the usefulness of our knowledge graph for different applications.
AU - Sherif, Mohamed
AU - Morim da Silva, Ana Alexandra
AU - Pestryakova, Svetlana
AU - Ahmed, Abdullah Fathi Ahmed
AU - Niemann, Sven
AU - Ngonga Ngomo, Axel-Cyrille
ID - 45558
TI - IngridKG: A FAIR Knowledge Graph of Graffiti
ER -
TY - CHAP
AB - Indonesian is classified as underrepresented in the Natural Language Processing (NLP) field, despite being the tenth most spoken language in the world with 198 million speakers. The paucity of datasets is recognized as the main reason for the slow advancements in NLP research for underrepresented languages. Significant attempts were made in 2020 to address this drawback for Indonesian. The Indonesian Natural Language Understanding (IndoNLU) benchmark was introduced alongside IndoBERT pre-trained language model. The second benchmark, Indonesian Language Evaluation Montage (IndoLEM), was presented in the same year. These benchmarks support several tasks, including Named Entity Recognition (NER). However, all NER datasets are in the public domain and do not contain domain-specific datasets. To alleviate this drawback, we introduce IndQNER, a manually annotated NER benchmark dataset in the religious domain that adheres to a meticulously designed annotation guideline. Since Indonesia has the world’s largest Muslim population, we build the dataset from the Indonesian translation of the Quran. The dataset includes 2475 named entities representing 18 different classes. To assess the annotation quality of IndQNER, we perform experiments with BiLSTM and CRF-based NER, as well as IndoBERT fine-tuning. The results reveal that the first model outperforms the second model achieving 0.98 F1 points. This outcome indicates that IndQNER may be an acceptable evaluation metric for Indonesian NER tasks in the aforementioned domain, widening the research’s domain range.
AU - Gusmita, Ria Hari
AU - Firmansyah, Asep Fajar
AU - Moussallem, Diego
AU - Ngonga Ngomo, Axel-Cyrille
ID - 46572
SN - 0302-9743
T2 - Natural Language Processing and Information Systems
TI - IndQNER: Named Entity Recognition Benchmark Dataset from the Indonesian Translation of the Quran
ER -
TY - CONF
AU - Baci, Alkid
AU - Heindorf, Stefan
ID - 46575
T2 - CIKM
TI - Accelerating Concept Learning via Sampling
ER -
TY - GEN
AB - The Koopman operator has become an essential tool for data-driven analysis, prediction and control of complex systems, the main reason being the enormous potential of identifying linear function space representations of nonlinear
dynamics from measurements. Until now, the situation where for large-scale systems, we (i) only have access to partial observations (i.e., measurements, as is very common for experimental data) or (ii) deliberately perform coarse
graining (for efficiency reasons) has not been treated to its full extent. In this paper, we address the pitfall associated with this situation, that the classical EDMD algorithm does not automatically provide a Koopman operator approximation for the underlying system if we do not carefully select the number of observables. Moreover, we show that symmetries in the system dynamics can be carried over to the Koopman operator, which allows us to massively increase the model efficiency. We also briefly draw a connection to domain decomposition techniques for partial differential equations and present numerical evidence using the Kuramoto--Sivashinsky equation.
AU - Peitz, Sebastian
AU - Harder, Hans
AU - Nüske, Feliks
AU - Philipp, Friedrich
AU - Schaller, Manuel
AU - Worthmann, Karl
ID - 46579
T2 - arXiv:2307.15325
TI - Partial observations, coarse graining and equivariance in Koopman operator theory for large-scale dynamical systems
ER -
TY - CONF
AB - One of the main challenges for next generation automotive radars is the improvement of angular resolution to a sub-degree level. In this context, wide aperture automotive radars of 1m length or more and resolution close to 0.1° in azimuth and 0.5° in elevation could be beneficial. To enable coherent processing of arrays with such large aperture, prior (i.e offline) and online calibration are necessary: channel imbalances (gains and phases) and three dimensional coordinates of transmit and receive elements need to be determined. We propose a calibration strategy based on alternating steps between the two subtasks of i) channel imbalance estimation with ‘known’ array positions, by applying a singular value decomposition to the resulting tensor calculus problem; and ii) antenna position estimation with ’known’ channel imbalances, by numerically maximizing the Bayesian posterior probability; in both cases operating on range/Doppler snapshots of disjoint targets (with potentially unknown locations). Simulation studies based on the parameters of a MIMO 8x6 linear sparse array show promising results as long as the initial position errors do not exceed half a wavelength (2mm), beyond which we observe strong effects of ambiguity. Experimental results with real measurements show that after calibration in laboratory conditions, our MIMO 8x6 demonstrator with 50cm aperture is able to resolve two targets at the same range with angular separation at least as close as 0.4°.
AU - Greiff, Christian
AU - Mateos-Núñez, David
AU - Simoni, Renato
AU - González-Huici, Maria
AU - Kruse, Stephan
AU - Scheytt, J. Christoph
AU - Kolk, Karl
AU - Höller, Christian
AU - Kurz, Heiko Gustav
AU - Meinecke, Marc-Michael
AU - Gisder, Thomas
ID - 46426
T2 - 2023 24th International Radar Symposium (IRS)
TI - Calibration of Large Coherent MIMO Radar Arrays: Channel Imbalances and 3D Antenna Positions
ER -
TY - JOUR
AB - The Koopman operator has become an essential tool for data-driven approximation of dynamical (control) systems in recent years, e.g., via extended dynamic mode decomposition. Despite its popularity, convergence results and, in particular, error bounds are still quite scarce. In this paper, we derive probabilistic bounds for the approximation error and the prediction error depending on the number of training data points; for both ordinary and stochastic differential equations. Moreover, we extend our analysis to nonlinear control-affine systems using either ergodic trajectories or i.i.d.
samples. Here, we exploit the linearity of the Koopman generator to obtain a bilinear system and, thus, circumvent the curse of dimensionality since we do not autonomize the system by augmenting the state by the control inputs. To the
best of our knowledge, this is the first finite-data error analysis in the stochastic and/or control setting. Finally, we demonstrate the effectiveness of the proposed approach by comparing it with state-of-the-art techniques showing its superiority whenever state and control are coupled.
AU - Nüske, Feliks
AU - Peitz, Sebastian
AU - Philipp, Friedrich
AU - Schaller, Manuel
AU - Worthmann, Karl
ID - 23428
JF - Journal of Nonlinear Science
TI - Finite-data error bounds for Koopman-based prediction and control
VL - 33
ER -
TY - GEN
AB - Different conflicting optimization criteria arise naturally in various Deep
Learning scenarios. These can address different main tasks (i.e., in the
setting of Multi-Task Learning), but also main and secondary tasks such as loss
minimization versus sparsity. The usual approach is a simple weighting of the
criteria, which formally only works in the convex setting. In this paper, we
present a Multi-Objective Optimization algorithm using a modified Weighted
Chebyshev scalarization for training Deep Neural Networks (DNNs) with respect
to several tasks. By employing this scalarization technique, the algorithm can
identify all optimal solutions of the original problem while reducing its
complexity to a sequence of single-objective problems. The simplified problems
are then solved using an Augmented Lagrangian method, enabling the use of
popular optimization techniques such as Adam and Stochastic Gradient Descent,
while efficaciously handling constraints. Our work aims to address the
(economical and also ecological) sustainability issue of DNN models, with a
particular focus on Deep Multi-Task models, which are typically designed with a
very large number of weights to perform equally well on multiple tasks. Through
experiments conducted on two Machine Learning datasets, we demonstrate the
possibility of adaptively sparsifying the model during training without
significantly impacting its performance, if we are willing to apply
task-specific adaptations to the network weights. Code is available at
https://github.com/salomonhotegni/MDMTN.
AU - Hotegni, Sedjro Salomon
AU - Peitz, Sebastian
AU - Berkemeier, Manuel Bastian
ID - 46649
T2 - arXiv:2308.12243
TI - Multi-Objective Optimization for Sparse Deep Neural Network Training
ER -
TY - JOUR
AB - Many problems in science and engineering require an efficient numerical approximation of integrals or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant discretization is often inadvisable as it results in prohibitively large errors or computational effort. To this end, adaptive schemes, such as solvers based on Runge–Kutta pairs, have been developed which adapt the step size based on local error estimations at each step. While the classical schemes apply very generally and are highly efficient on regular systems, they can behave suboptimally when an inefficient step rejection mechanism is triggered by structurally complex systems such as chaotic systems. To overcome these issues, we propose a method to tailor numerical schemes to the problem class at hand. This is achieved by combining simple, classical quadrature rules or ODE solvers with data-driven time-stepping controllers. Compared with learning solution operators to ODEs directly, it generalizes better to unseen initial data as our approach employs classical numerical schemes as base methods. At the same time it can make use of identified structures of a problem class and, therefore, outperforms state-of-the-art adaptive schemes. Several examples demonstrate superior efficiency. Source code is available at https://github.com/lueckem/quadrature-ML.
AU - Dellnitz, Michael
AU - Hüllermeier, Eyke
AU - Lücke, Marvin
AU - Ober-Blöbaum, Sina
AU - Offen, Christian
AU - Peitz, Sebastian
AU - Pfannschmidt, Karlson
ID - 21600
IS - 2
JF - SIAM Journal on Scientific Computing
TI - Efficient time stepping for numerical integration using reinforcement learning
VL - 45
ER -
TY - CONF
AU - Sadeghi-Kohan, Somayeh
AU - Hellebrand, Sybille
AU - Wunderlich, Hans-Joachim
ID - 46739
T2 - 2023 53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN-W)
TI - Low Power Streaming of Sensor Data Using Gray Code-Based Approximate Communication
ER -
TY - BOOK
AB - In the proposal for our CRC in 2011, we formulated a vision of markets for
IT services that describes an approach to the provision of such services
that was novel at that time and, to a large extent, remains so today:
„Our vision of on-the-fly computing is that of IT services individually and
automatically configured and brought to execution from flexibly combinable
services traded on markets. At the same time, we aim at organizing
markets whose participants maintain a lively market of services through
appropriate entrepreneurial actions.“
Over the last 12 years, we have developed methods and techniques to
address problems critical to the convenient, efficient, and secure use of
on-the-fly computing. Among other things, we have made the description
of services more convenient by allowing natural language input,
increased the quality of configured services through (natural language)
interaction and more efficient configuration processes and analysis
procedures, made the quality of (the products of) providers in the
marketplace transparent through reputation systems, and increased the
resource efficiency of execution through reconfigurable heterogeneous
computing nodes and an integrated treatment of service description and
configuration. We have also developed network infrastructures that have
a high degree of adaptivity, scalability, efficiency, and reliability, and
provide cryptographic guarantees of anonymity and security for market
participants and their products and services.
To demonstrate the pervasiveness of the OTF computing approach, we
have implemented a proof-of-concept for OTF computing that can run
typical scenarios of an OTF market. We illustrated the approach using
a cutting-edge application scenario – automated machine learning (AutoML).
Finally, we have been pushing our work for the perpetuation of
On-The-Fly Computing beyond the SFB and sharing the expertise gained
in the SFB in events with industry partners as well as transfer projects.
This work required a broad spectrum of expertise. Computer scientists
and economists with research interests such as computer networks and
distributed algorithms, security and cryptography, software engineering
and verification, configuration and machine learning, computer engineering
and HPC, microeconomics and game theory, business informatics
and management have successfully collaborated here.
AU - Haake, Claus-Jochen
AU - Meyer auf der Heide, Friedhelm
AU - Platzner, Marco
AU - Wachsmuth, Henning
AU - Wehrheim, Heike
ID - 45863
TI - On-The-Fly Computing -- Individualized IT-services in dynamic markets
VL - 412
ER -
TY - CONF
AU - Schwerin, Imke
AU - Häsel-Weide, Uta
ED - Novotna, J.
ED - Moraova, H.
ID - 46757
T2 - International Symposium in Elementary Mathematics Teaching. Proceedings: New Directions in Elementary Mathematics Education
TI - Second grader´s understanding of doubling and halfing in various representations
ER -
TY - CHAP
AU - Schmidt, Rebekka
AU - Tenberge, Claudia
AU - Häsel-Weide, Uta
ED - Vöing, N.
ED - Schmidt, R.
ED - Neiske, I.
ID - 46758
T2 - Aktive Teilhabe fördern – ICM und Student Engagement in der Hochschullehre
TI - Lehre in Zeiten von Digitalisierung und Inklusion - Beispiele aus drei Fächern
ER -
TY - BOOK
AB - „Lerne deinen Körper besser kennen“, „Das Beste für deine Gesundheit“ und „Ihre Transformation beginnt jetzt“ - mit Versprechen wie diesen vermitteln die Produkttexte von Wearables wie Fitnesstracker und Smartwatches ein ganz bestimmtes Bild ihrer vorgesehenen Nutzer*innen und deren Nutzung. Verbunden mit den kleinen, am Handgelenk getragenen Geräten sind Fragen nach Erkenntnisgewinn und Kontrollverlust, Selbstoptimierung und Quantifizierungslogiken, Eigenverantwortung und Fremdsteuerung. Die vorliegende Arbeit widmet sich diesem komplexen Spannungsfeld und verfolgt dabei einen multiperspektivischen Ansatz: im Rahmen einer Dispositivanalyse werden die einzelnen Elemente des Wearable-Dispositivs als eigenständige, empirisch zu untersuchende Analysegegenstände betrachtet, um so das Zusammenwirken und die komplexe Beziehung von Diskursen, Gegenständen, Nutzung, Subjekten und Gesellschaft zu erforschen. Ein besonderes Erkenntnisinteresse liegt dabei auf dem Wissen, was sich über Wearables etabliert hat und sich in den Alltagspraktiken der Nutzer*innen widerspiegelt sowie bei der Frage nach den möglichen Funktionen und Auswirkungen des Wearable-Dispositivs.
AU - Schloots, Franziska Margarete
ID - 44719
KW - Selbstvermessung
KW - Dispositivanalyse
KW - Gesundheitsdiskurs
KW - Quantifizierungsgesellschaft
KW - Wearables
KW - Selbstoptimierung
SN - 2512-112X
TI - Mit dem Leben Schritt halten - Eine Analyse des Wearable-Dispositivs
ER -