@article{48053, author = {{Hetkämper, Tim and Claes, Leander and Henning, Bernd}}, issn = {{2196-7113}}, journal = {{tm - Technisches Messen}}, keywords = {{Electrical and Electronic Engineering, Instrumentation}}, number = {{s1}}, pages = {{49--54}}, publisher = {{Walter de Gruyter GmbH}}, title = {{{Vorzeichenrichtige tomographische Rekonstruktion von Ultraschallfeldern mit Hilfe der Schlierentechnik}}}, doi = {{10.1515/teme-2023-0069}}, volume = {{90}}, year = {{2023}}, } @article{48052, author = {{Schäfer, Louis and Günther, Matthias and Martin, Alex and Lüpfert, Mariella and Mandel, Constantin and Rapp, Simon and Lanza, Gisela and Anacker, Harald and Albers, Albert and Köchling, Daniel}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{104--109}}, publisher = {{Elsevier BV}}, title = {{{Systematics for an Integrative Modelling of Product and Production System}}}, doi = {{10.1016/j.procir.2023.06.019}}, volume = {{118}}, year = {{2023}}, } @article{47817, author = {{Dyck, Florian and Anacker, Harald and Dumitrescu, Roman}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{912--917}}, publisher = {{Elsevier BV}}, title = {{{Virtual Assembly for Engineering – A Systematic Literature Review}}}, doi = {{10.1016/j.procir.2023.06.157}}, volume = {{118}}, year = {{2023}}, } @article{48092, author = {{Pena, Mario and Meyer, Michael and Wallscheid, Oliver and Böcker, Joachim}}, issn = {{0885-8993}}, journal = {{IEEE Transactions on Power Electronics}}, keywords = {{Electrical and Electronic Engineering}}, number = {{10}}, pages = {{12416--12429}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Model Predictive Direct Self-Control for Six-Step Operation of Permanent-Magnet Synchronous Machines}}}, doi = {{10.1109/tpel.2023.3286713}}, volume = {{38}}, year = {{2023}}, } @article{48294, abstract = {{Clinical NLP tasks such as mental health assessment from text, must take social constraints into account - the performance maximization must be constrained by the utmost importance of guaranteeing privacy of user data. Consumer protection regulations, such as GDPR, generally handle privacy by restricting data availability, such as requiring to limit user data to 'what is necessary' for a given purpose. In this work, we reason that providing stricter formal privacy guarantees, while increasing the volume of user data in the model, in most cases increases benefit for all parties involved, especially for the user. We demonstrate our arguments on two existing suicide risk assessment datasets of Twitter and Reddit posts. We present the first analysis juxtaposing user history length and differential privacy budgets and elaborate how modeling additional user context enables utility preservation while maintaining acceptable user privacy guarantees.}}, author = {{Sawhney, Ramit and Neerkaje, Atula and Habernal, Ivan and Flek, Lucie}}, issn = {{2334-0770}}, journal = {{Proceedings of the International AAAI Conference on Web and Social Media}}, pages = {{766--776}}, publisher = {{Association for the Advancement of Artificial Intelligence (AAAI)}}, title = {{{How Much User Context Do We Need? Privacy by Design in Mental Health NLP Applications}}}, doi = {{10.1609/icwsm.v17i1.22186}}, volume = {{17}}, year = {{2023}}, } @inproceedings{48297, author = {{Senge, Manuel and Igamberdiev, Timour and Habernal, Ivan}}, booktitle = {{Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing}}, publisher = {{Association for Computational Linguistics}}, title = {{{One size does not fit all: Investigating strategies for differentially-private learning across NLP tasks}}}, doi = {{10.18653/v1/2022.emnlp-main.496}}, year = {{2023}}, } @inproceedings{48292, author = {{Igamberdiev, Timour and Habernal, Ivan}}, booktitle = {{Findings of the Association for Computational Linguistics: ACL 2023}}, publisher = {{Association for Computational Linguistics}}, title = {{{DP-BART for Privatized Text Rewriting under Local Differential Privacy}}}, doi = {{10.18653/v1/2023.findings-acl.874}}, year = {{2023}}, } @inproceedings{48295, author = {{Bongard, Leonard and Held, Lena and Habernal, Ivan}}, booktitle = {{Proceedings of the Natural Legal Language Processing Workshop 2022}}, publisher = {{Association for Computational Linguistics}}, title = {{{The Legal Argument Reasoning Task in Civil Procedure}}}, doi = {{10.18653/v1/2022.nllp-1.17}}, year = {{2023}}, } @article{48290, abstract = {{AbstractIdentifying, classifying, and analyzing arguments in legal discourse has been a prominent area of research since the inception of the argument mining field. However, there has been a major discrepancy between the way natural language processing (NLP) researchers model and annotate arguments in court decisions and the way legal experts understand and analyze legal argumentation. While computational approaches typically simplify arguments into generic premises and claims, arguments in legal research usually exhibit a rich typology that is important for gaining insights into the particular case and applications of law in general. We address this problem and make several substantial contributions to move the field forward. First, we design a new annotation scheme for legal arguments in proceedings of the European Court of Human Rights (ECHR) that is deeply rooted in the theory and practice of legal argumentation research. Second, we compile and annotate a large corpus of 373 court decisions (2.3M tokens and 15k annotated argument spans). Finally, we train an argument mining model that outperforms state-of-the-art models in the legal NLP domain and provide a thorough expert-based evaluation. All datasets and source codes are available under open lincenses at https://github.com/trusthlt/mining-legal-arguments.}}, author = {{Habernal, Ivan and Faber, Daniel and Recchia, Nicola and Bretthauer, Sebastian and Gurevych, Iryna and Spiecker genannt Döhmann, Indra and Burchard, Christoph}}, issn = {{0924-8463}}, journal = {{Artificial Intelligence and Law}}, keywords = {{Law, Artificial Intelligence}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Mining legal arguments in court decisions}}}, doi = {{10.1007/s10506-023-09361-y}}, year = {{2023}}, } @inproceedings{48391, author = {{Aralikatti, Rohith and Boeddeker, Christoph and Wichern, Gordon and Subramanian, Aswin and Le Roux, Jonathan}}, booktitle = {{ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}}, publisher = {{IEEE}}, title = {{{Reverberation as Supervision For Speech Separation}}}, doi = {{10.1109/icassp49357.2023.10095022}}, year = {{2023}}, } @inproceedings{48390, author = {{Berger, Simon and Vieting, Peter and Boeddeker, Christoph and Schlüter, Ralf and Haeb-Umbach, Reinhold}}, booktitle = {{INTERSPEECH 2023}}, publisher = {{ISCA}}, title = {{{Mixture Encoder for Joint Speech Separation and Recognition}}}, doi = {{10.21437/interspeech.2023-1815}}, year = {{2023}}, } @inproceedings{48422, author = {{Humpert, Lynn and Tihlarik, Amelie and Wäschle, Moritz and Anacker, Harald and Dumitrescu, Roman and Albers, Albert and Röbenack, Silke and Pfeifer, Sabine}}, booktitle = {{IEEE International Conference on Technology Management, Operations and Decisions (IEEE ICTMOD)}}, location = {{Rabat, Marokko}}, title = {{{Investigating the potential of artificial intelligence for the employee from the perspective of AI-experts}}}, year = {{2023}}, } @inproceedings{48421, author = {{Humpert, Lynn and Zagatta, Kristin and Anacker, Harald and Dumitrescu, Roman}}, booktitle = {{IEEE International Conference on Technology Management, Operations and Decisions (IEEE ICTMOD)}}, location = {{Rabat, Marokko}}, title = {{{Identification of fields of action for validation in Systems Engineering}}}, year = {{2023}}, } @inproceedings{48423, author = {{Humpert, Lynn and Mundt, Enrik and Bretz, Lukas and Bernz, Vanessa and Anacker, Harald and Dumitrescu, Roman}}, booktitle = {{8th International Conference on Information Systems Engineering}}, location = {{Bangkok, Thailand}}, title = {{{Criteria-based comparison of Systems Engineering and agile methods}}}, year = {{2023}}, } @inproceedings{48427, author = {{Gabriel, Stefan and Kühn, Arno and Dumitrescu, Roman}}, booktitle = {{Procedia CIRP}}, location = {{Dublin, Ireland}}, title = {{{Strategic planning of the collaboration between humans and artificial intelligence in production}}}, year = {{2023}}, } @inproceedings{48425, author = {{Mundt, Enrik and Wilke, Daria and Anacker, Harald and Dumitrescu, Roman}}, location = {{Maui, Hawaii}}, title = {{{Principles for the effective application of Systems Engineering: A systematic literature review and application use case}}}, year = {{2023}}, } @inproceedings{48426, author = {{Tekaat, Julian and Wilke, Daria and Anacker, Harald and Dumitrescu, Roman}}, location = {{Würzburg}}, title = {{{Integration von Design Thinking in Systems Engineering mit Hilfe des Systemdenkens}}}, year = {{2023}}, } @inproceedings{46069, author = {{Seebauer, Fritz and Kuhlmann, Michael and Haeb-Umbach, Reinhold and Wagner, Petra}}, booktitle = {{12th Speech Synthesis Workshop (SSW) 2023}}, title = {{{Re-examining the quality dimensions of synthetic speech}}}, year = {{2023}}, } @unpublished{48502, abstract = {{The prediction of photon echoes is an important technique for gaining an understanding of optical quantum systems. However, this requires a large number of simulations with varying parameters and/or input pulses, which renders numerical studies expensive. This article investigates how we can use data-driven surrogate models based on the Koopman operator to accelerate this process. In order to be successful, we require a model that is accurate over a large number of time steps. To this end, we employ a bilinear Koopman model using extended dynamic mode decomposition and simulate the optical Bloch equations for an ensemble of inhomogeneously broadened two-level systems. Such systems are well suited to describe the excitation of excitonic resonances in semiconductor nanostructures, for example, ensembles of semiconductor quantum dots. We perform a detailed study on the required number of system simulations such that the resulting data-driven Koopman model is sufficiently accurate for a wide range of parameter settings. We analyze the L2 error and the relative error of the photon echo peak and investigate how the control positions relate to the stabilization. After proper training, the dynamics of the quantum ensemble can be predicted accurately and numerically very efficiently by our methods.}}, author = {{Peitz, Sebastian and Hunstig, Anna and Rose, Hendrik and Meier, Torsten}}, title = {{{Accelerating the analysis of optical quantum systems using the Koopman operator}}}, year = {{2023}}, } @inproceedings{48532, author = {{Philipo, Godiana Hagile and Kakande, Josephine Nakato and Krauter, Stefan}}, booktitle = {{Proceedings of the 2023 IEEE PES/IAS PowerAfrica Conference}}, location = {{Marrakech, Morocco}}, title = {{{Combined Economic and Emission Dispatch of a Microgrid Considering Multiple Generators}}}, year = {{2023}}, } @inproceedings{48533, author = {{Kakande, Josephine Nakato and Philipo, Godiana Hagile and Krauter, Stefan}}, booktitle = {{Proceedings of the 2023 IEEE PES/IAS PowerAfrica Conference}}, location = {{Marrakech, Morocco}}, title = {{{Demand side management potential of refrigeration appliances}}}, year = {{2023}}, } @inproceedings{48531, author = {{Philipo, Godiana Hagile and Kakande, Josephine Nakato and Krauter, Stefan}}, booktitle = {{Proceedings of the 2023 IEEE AFRICON, Nairobi, Kenya}}, location = {{ Nairobi, Kenya}}, title = {{{Demand-Side-Management for Optimal dispatch of an Isolated Solar Microgrid}}}, year = {{2023}}, } @article{35602, abstract = {{Continuous Speech Separation (CSS) has been proposed to address speech overlaps during the analysis of realistic meeting-like conversations by eliminating any overlaps before further processing. CSS separates a recording of arbitrarily many speakers into a small number of overlap-free output channels, where each output channel may contain speech of multiple speakers. This is often done by applying a conventional separation model trained with Utterance-level Permutation Invariant Training (uPIT), which exclusively maps a speaker to an output channel, in sliding window approach called stitching. Recently, we introduced an alternative training scheme called Graph-PIT that teaches the separation network to directly produce output streams in the required format without stitching. It can handle an arbitrary number of speakers as long as never more of them overlap at the same time than the separator has output channels. In this contribution, we further investigate the Graph-PIT training scheme. We show in extended experiments that models trained with Graph-PIT also work in challenging reverberant conditions. Models trained in this way are able to perform segment-less CSS, i.e., without stitching, and achieve comparable and often better separation quality than the conventional CSS with uPIT and stitching. We simplify the training schedule for Graph-PIT with the recently proposed Source Aggregated Signal-to-Distortion Ratio (SA-SDR) loss. It eliminates unfavorable properties of the previously used A-SDR loss and thus enables training with Graph-PIT from scratch. Graph-PIT training relaxes the constraints w.r.t. the allowed numbers of speakers and speaking patterns which allows using a larger variety of training data. Furthermore, we introduce novel signal-level evaluation metrics for meeting scenarios, namely the source-aggregated scale- and convolution-invariant Signal-to-Distortion Ratio (SA-SI-SDR and SA-CI-SDR), which are generalizations of the commonly used SDR-based metrics for the CSS case.}}, author = {{von Neumann, Thilo and Kinoshita, Keisuke and Boeddeker, Christoph and Delcroix, Marc and Haeb-Umbach, Reinhold}}, issn = {{2329-9290}}, journal = {{IEEE/ACM Transactions on Audio, Speech, and Language Processing}}, keywords = {{Continuous Speech Separation, Source Separation, Graph-PIT, Dynamic Programming, Permutation Invariant Training}}, pages = {{576--589}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Segment-Less Continuous Speech Separation of Meetings: Training and Evaluation Criteria}}}, doi = {{10.1109/taslp.2022.3228629}}, volume = {{31}}, year = {{2023}}, } @inproceedings{48281, abstract = {{ We propose a general framework to compute the word error rate (WER) of ASR systems that process recordings containing multiple speakers at their input and that produce multiple output word sequences (MIMO). Such ASR systems are typically required, e.g., for meeting transcription. We provide an efficient implementation based on a dynamic programming search in a multi-dimensional Levenshtein distance tensor under the constraint that a reference utterance must be matched consistently with one hypothesis output. This also results in an efficient implementation of the ORC WER which previously suffered from exponential complexity. We give an overview of commonly used WER definitions for multi-speaker scenarios and show that they are specializations of the above MIMO WER tuned to particular application scenarios. We conclude with a discussion of the pros and cons of the various WER definitions and a recommendation when to use which.}}, author = {{von Neumann, Thilo and Boeddeker, Christoph and Kinoshita, Keisuke and Delcroix, Marc and Haeb-Umbach, Reinhold}}, booktitle = {{ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}}, keywords = {{Word Error Rate, Meeting Recognition, Levenshtein Distance}}, publisher = {{IEEE}}, title = {{{On Word Error Rate Definitions and Their Efficient Computation for Multi-Speaker Speech Recognition Systems}}}, doi = {{10.1109/icassp49357.2023.10094784}}, year = {{2023}}, } @inproceedings{48275, abstract = {{MeetEval is an open-source toolkit to evaluate all kinds of meeting transcription systems. It provides a unified interface for the computation of commonly used Word Error Rates (WERs), specifically cpWER, ORC WER and MIMO WER along other WER definitions. We extend the cpWER computation by a temporal constraint to ensure that only words are identified as correct when the temporal alignment is plausible. This leads to a better quality of the matching of the hypothesis string to the reference string that more closely resembles the actual transcription quality, and a system is penalized if it provides poor time annotations. Since word-level timing information is often not available, we present a way to approximate exact word-level timings from segment-level timings (e.g., a sentence) and show that the approximation leads to a similar WER as a matching with exact word-level annotations. At the same time, the time constraint leads to a speedup of the matching algorithm, which outweighs the additional overhead caused by processing the time stamps.}}, author = {{von Neumann, Thilo and Boeddeker, Christoph and Delcroix, Marc and Haeb-Umbach, Reinhold}}, booktitle = {{Proc. CHiME 2023 Workshop on Speech Processing in Everyday Environments}}, keywords = {{Speech Recognition, Word Error Rate, Meeting Transcription}}, location = {{Dublin}}, title = {{{MeetEval: A Toolkit for Computation of Word Error Rates for Meeting Transcription Systems}}}, year = {{2023}}, } @inproceedings{48961, author = {{Iftekhar, Mohammed and Gowda, Harshan and Kneuper, Pascal and Sadiye, Babak and Müller, Wolfgang and Scheytt, Christoph}}, booktitle = {{2023 IEEE BiCMOS and Compound Semiconductor Integrated Circuits and Technology Symposium (BCICTS)}}, location = {{Monterey, CA, USA}}, title = {{{A 28-Gb/s 27.2mW NRZ Full-Rate Bang-Bang Clock and Data Recovery in 22 nm FD-SOI CMOS Technology}}}, doi = {{10.1109/BCICTS54660.2023.10310954}}, year = {{2023}}, } @inbook{47421, abstract = {{Class expression learning in description logics has long been regarded as an iterative search problem in an infinite conceptual space. Each iteration of the search process invokes a reasoner and a heuristic function. The reasoner finds the instances of the current expression, and the heuristic function computes the information gain and decides on the next step to be taken. As the size of the background knowledge base grows, search-based approaches for class expression learning become prohibitively slow. Current neural class expression synthesis (NCES) approaches investigate the use of neural networks for class expression learning in the attributive language with complement (ALC). While they show significant improvements over search-based approaches in runtime and quality of the computed solutions, they rely on the availability of pretrained embeddings for the input knowledge base. Moreover, they are not applicable to ontologies in more expressive description logics. In this paper, we propose a novel NCES approach which extends the state of the art to the description logic ALCHIQ(D). Our extension, dubbed NCES2, comes with an improved training data generator and does not require pretrained embeddings for the input knowledge base as both the embedding model and the class expression synthesizer are trained jointly. Empirical results on benchmark datasets suggest that our approach inherits the scalability capability of current NCES instances with the additional advantage that it supports more complex learning problems. NCES2 achieves the highest performance overall when compared to search-based approaches and to its predecessor NCES. We provide our source code, datasets, and pretrained models at https://github.com/dice-group/NCES2.}}, author = {{Kouagou, N'Dah Jean and Heindorf, Stefan and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Machine Learning and Knowledge Discovery in Databases: Research Track}}, isbn = {{9783031434204}}, issn = {{0302-9743}}, location = {{Turin}}, publisher = {{Springer Nature Switzerland}}, title = {{{Neural Class Expression Synthesis in ALCHIQ(D)}}}, doi = {{10.1007/978-3-031-43421-1_12}}, year = {{2023}}, } @inbook{46460, author = {{Ngonga Ngomo, Axel-Cyrille and Demir, Caglar and Kouagou, N'Dah Jean and Heindorf, Stefan and Karalis, Nikoloas and Bigerl, Alexander}}, booktitle = {{Compendium of Neurosymbolic Artificial Intelligence}}, pages = {{272–286}}, publisher = {{IOS Press}}, title = {{{Class Expression Learning with Multiple Representations}}}, year = {{2023}}, } @inproceedings{49109, abstract = {{We propose a diarization system, that estimates “who spoke when” based on spatial information, to be used as a front-end of a meeting transcription system running on the signals gathered from an acoustic sensor network (ASN). Although the spatial distribution of the microphones is advantageous, exploiting the spatial diversity for diarization and signal enhancement is challenging, because the microphones’ positions are typically unknown, and the recorded signals are initially unsynchronized in general. Here, we approach these issues by first blindly synchronizing the signals and then estimating time differences of arrival (TDOAs). The TDOA information is exploited to estimate the speakers’ activity, even in the presence of multiple speakers being simultaneously active. This speaker activity information serves as a guide for a spatial mixture model, on which basis the individual speaker’s signals are extracted via beamforming. Finally, the extracted signals are forwarded to a speech recognizer. Additionally, a novel initialization scheme for spatial mixture models based on the TDOA estimates is proposed. Experiments conducted on real recordings from the LibriWASN data set have shown that our proposed system is advantageous compared to a system using a spatial mixture model, which does not make use of external diarization information.}}, author = {{Gburrek, Tobias and Schmalenstroeer, Joerg and Haeb-Umbach, Reinhold}}, booktitle = {{Proc. Asilomar Conference on Signals, Systems, and Computers}}, keywords = {{Diarization, time difference of arrival, ad-hoc acoustic sensor network, meeting transcription}}, title = {{{Spatial Diarization for Meeting Transcription with Ad-Hoc Acoustic Sensor Networks}}}, year = {{2023}}, } @inproceedings{49111, abstract = {{Due to the high variation in the application requirements of sound event detection (SED) systems, it is not sufficient to evaluate systems only in a single operating mode. Therefore, the community recently adopted the polyphonic sound detection score (PSDS) as an evaluation metric, which is the normalized area under the PSD receiver operating characteristic (PSD-ROC). It summarizes the system performance over a range of operating modes resulting from varying the decision threshold that is used to translate the system output scores into a binary detection output. Hence, it provides a more complete picture of the overall system behavior and is less biased by specific threshold tuning. However, besides the decision threshold there is also the post-processing that can be changed to enter another operating mode. In this paper we propose the post-processing independent PSDS (piPSDS) as a generalization of the PSDS. Here, the post-processing independent PSD-ROC includes operating points from varying post-processings with varying decision thresholds. Thus, it summarizes even more operating modes of an SED system and allows for system comparison without the need of implementing a post-processing and without a bias due to different post-processings. While piPSDS can in principle combine different types of post-processing, we here, as a first step, present median filter independent PSDS (miPSDS) results for this year’s DCASE Challenge Task4a systems. Source code is publicly available in our sed_scores_eval package (https://github.com/fgnt/sed_scores_eval).}}, author = {{Ebbers, Janek and Haeb-Umbach, Reinhold and Serizel, Romain}}, booktitle = {{Proceedings of the 8th Detection and Classification of Acoustic Scenes and Events 2023 Workshop (DCASE2023)}}, pages = {{36–40}}, title = {{{Post-Processing Independent Evaluation of Sound Event Detection Systems}}}, year = {{2023}}, } @inproceedings{47305, author = {{Amft, Sabrina and Höltervennhoff, Sandra and Huaman, Nicolas and Acar, Yasemin and Fahl, Sascha}}, booktitle = {{Nineteenth Symposium on Usable Privacy and Security, SOUPS 2023, Anaheim, CA, USA, August 5-7, 2023}}, editor = {{Kelley, Patrick Gage and Kapadia, Apu}}, pages = {{171–190}}, publisher = {{USENIX Association}}, title = {{{"Would You Give the Same Priority to the Bank and a Game? I Do Not!" Exploring Credential Management Strategies and Obstacles during Password Manager Setup}}}, year = {{2023}}, } @inproceedings{47301, author = {{Höltervennhoff, Sandra and Klostermeyer, Philip and Wöhler, Noah and Acar, Yasemin and Fahl, Sascha}}, booktitle = {{32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9-11, 2023}}, editor = {{Calandrino, Joseph A. and Troncoso, Carmela}}, publisher = {{USENIX Association}}, title = {{{"I wouldn’t want my unsafe code to run my pacemaker": An Interview Study on the Use, Comprehension, and Perceived Risks of Unsafe Rust}}}, year = {{2023}}, } @inproceedings{47300, author = {{Kohno, Tadayoshi and Acar, Yasemin and Loh, Wulf}}, booktitle = {{32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9-11, 2023}}, editor = {{Calandrino, Joseph A. and Troncoso, Carmela}}, publisher = {{USENIX Association}}, title = {{{Ethical Frameworks and Computer Security Trolley Problems: Foundations for Conversations}}}, year = {{2023}}, } @inproceedings{47312, author = {{Neil, Lorenzo and Sri Ramulu, Harshini and Acar, Yasemin and Reaves, Bradley}}, booktitle = {{Nineteenth Symposium on Usable Privacy and Security, SOUPS 2023, Anaheim, CA, USA, August 5-7, 2023}}, pages = {{283–299}}, publisher = {{USENIX Association}}, title = {{{Who Comes Up with this Stuff? Interviewing Authors to Understand How They Produce Security Advice}}}, year = {{2023}}, } @article{46801, author = {{Bouma-Sims, Elijah and Acar, Yasemin}}, journal = {{Proc. ACM Hum. Comput. Interact.}}, number = {{CSCW1}}, pages = {{1–31}}, title = {{{Beyond the Boolean: How Programmers Ask About, Use, and Discuss Gender}}}, doi = {{10.1145/3579461}}, volume = {{7}}, year = {{2023}}, } @article{47297, author = {{Bouma-Sims, Elijah and Acar, Yasemin}}, journal = {{CoRR}}, title = {{{Beyond the Boolean: How Programmers Ask About, Use, and Discuss Gender}}}, doi = {{10.48550/arXiv.2302.05351}}, volume = {{abs/2302.05351}}, year = {{2023}}, } @article{47291, author = {{Klemmer, Jan H. and Gutfleisch, Marco and Stransky, Christian and Acar, Yasemin and Sasse, M. Angela and Fahl, Sascha}}, journal = {{CoRR}}, title = {{{"Make Them Change it Every Week!": A Qualitative Exploration of Online Developer Advice on Usable and Secure Authentication}}}, doi = {{10.48550/arXiv.2309.00744}}, volume = {{abs/2309.00744}}, year = {{2023}}, } @article{47854, author = {{Scholtysik, Michel and Koldewey, Christian and Rohde, Malte and Dumitrescu, Roman}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{841--846}}, publisher = {{Elsevier BV}}, title = {{{Integrative conceptualization of products and business models for the circular economy: A systematic literature review}}}, doi = {{10.1016/j.procir.2023.03.129}}, volume = {{119}}, year = {{2023}}, } @techreport{47855, author = {{Scholtysik, Michel and Koldewey, Christian and Dumitrescu, Roman and Rasor, Anja and Ködding, Patrick and Wegel, Arthur and Fischer, Lena}}, title = {{{Die Transformation zum Smart Service-Anbieter}}}, year = {{2023}}, } @inproceedings{49349, author = {{Scholtysik, Michel and Koldewey, Christian and Dumitrescu, Roman and Pierenkemper, Christoph and Hensen, Christian}}, title = {{{Einstieg in die Kreislaufwirtschaft: Integrative Planung von Produkten und Geschäftsmodellen}}}, year = {{2023}}, } @inproceedings{49322, author = {{Ködding, Patrick and Tissen, Denis and Koldewey, Christian}}, booktitle = {{Proceedings of the 56th CIRP Conference on Manufacturing Systems, CIRP CMS ‘23}}, location = {{Capetown, South Africa}}, publisher = {{Elsevier Ltd.}}, title = {{{A Data Map for Product Creation: Tasks, Data Flows, and IT-Systems from the Initial Idea to the Start of Production}}}, year = {{2023}}, } @inproceedings{49365, author = {{Brock, Jonathan and Rempe, Niclas and von Enzberg, Sebastian and Kühn, Arno and Dumitrescu, Roman}}, booktitle = {{5th Conference on Production Systems and Logistics }}, location = {{STELLENBOSCH, SOUTH AFRICA}}, title = {{{A Framework For The Domain-Driven Utilization Of Manufacturing Sensor Data In Process Mining: An Action Design Approach}}}, year = {{2023}}, } @inproceedings{49362, author = {{Weller, Julian and Migenda, Nico and Wegel, Arthur and Kohlhase, Martin and Schenk, Wolfram and Dumitrescu, Roman}}, booktitle = {{IEEE ADACIS 2023}}, location = {{Marrakesh, Marokko}}, title = {{{Conceptual Framework for Prescriptive Analytics based on decision Theory}}}, year = {{2023}}, } @article{47835, author = {{Ködding, Patrick and Ellermann, Kai and Koldewey, Christian and Dumitrescu, Roman}}, issn = {{2212-8271}}, journal = {{Procedia CIRP}}, keywords = {{General Medicine}}, pages = {{740--745}}, publisher = {{Elsevier BV}}, title = {{{Scenario-based Foresight in the Age of Digitalization and Artificial Intelligence – Identification and Analysis of Existing Use Cases}}}, doi = {{10.1016/j.procir.2023.01.015}}, volume = {{119}}, year = {{2023}}, } @inproceedings{47836, author = {{Ködding, Patrick and Koldewey, Christian and Dumitrescu, Roman}}, booktitle = {{Proceedings of the XXXII ISPIM Innovation Conference}}, title = {{{A Reference Process Model for Scenario-based Foresight}}}, year = {{2023}}, } @inproceedings{47834, author = {{Ködding, Patrick}}, editor = {{Shajek, Alexandra and Hartmann, Ernst A.}}, title = {{{Scenario-Based Foresight in the Age of Digital Technologies and AI}}}, year = {{2023}}, } @inbook{49368, author = {{Menzefricke, Jörn Steffen and Koldewey, Christian and Dumitrescu, Roman}}, booktitle = {{The Digital Twin of Humans}}, isbn = {{9783031261039}}, publisher = {{Springer International Publishing}}, title = {{{Enhancing Risk Management for Digitalisation Projects in the Context of Socio-Technical Systems}}}, doi = {{10.1007/978-3-031-26104-6_3}}, year = {{2023}}, } @inproceedings{48601, abstract = {{AbstractIn global competition, companies are continuously searching for a competitive advantage. A growing number of companies have identified the design of their products as a major success factor. The promises for companies associated with outstanding design are extremely attractive, ranging from better customer experience to higher sales growth. But even though the advantages of design seem to be compelling, companies are still having difficulties in leveraging the benefits of design.In this paper, we want to identify the underlying challenges that explain this gap. We are especially interested in the role and challenges of design in interdisciplinary product development. Therefore, we perform a literature review that clarifies terminology, analyses research approaches and identifies challenges. We determine seven key challenges for design in interdisciplinary product development. Furthermore, we observe a limited scope of research approaches in the reviewed literature. Based on these findings, we propose three further research directions to strengthen the role of design in interdisciplinary product development in the future.}}, author = {{Stöhr, Bernd and Koldewey, Christian and Dumitrescu, Roman}}, booktitle = {{Proceedings of the Design Society}}, issn = {{2732-527X}}, pages = {{3473--3482}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{The Role of Design in interdisciplinary Product Development – Challenges, Research Approaches and Further Research needs}}}, doi = {{10.1017/pds.2023.348}}, volume = {{3}}, year = {{2023}}, } @article{47850, abstract = {{AbstractThe megatrend sustainability will significantly change the future value creation of manufacturing companies. Their current linear value creation models need to change to conform to the requirements of sustainability. To face the challenges the circular economy has emerged as a promising economic model. With the shift from a linear to a circular economy, companies have to adjust their current business models. However, they still lack knowledge and adequate methods to develop circular business models. Hence, the aim of the paper is a circular business model canvas (CBMC) for designing circular businesses. A systematic literature review was conducted to identify significant criteria for circular business models. The criteria were analyzed utilizing a qualitative content analysis to derive the business model elements required for the circular economy. Existing elements from the Business Model Canvas were enriched and five new elements, e.g., reverse logistics, were found. Then, the business model elements were logically arranged resulting in the CBMC. It guides companies to systematically develop business models for the circular economy. The CBMC was evaluated by applying it within a mediumsized company in the electronics sector.}}, author = {{Scholtysik, Michel and Rohde, Malte and Koldewey, Christian and Dumitrescu, Roman}}, issn = {{2732-527X}}, journal = {{Proceedings of the Design Society}}, pages = {{1347--1356}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{Designing Business Models for a Circular Economy}}}, doi = {{10.1017/pds.2023.135}}, volume = {{3}}, year = {{2023}}, } @article{47813, abstract = {{AbstractThe development of modern vehicles is complex, especially regarding compliance with security and safety. ISO/SAE 21434 considers security and safety along the entire product life cycle. According to the standard, a system architecture, a risk analysis, and the application of countermeasures are carried out in the early system design. Design patterns are solutions to known design problems. Security Design Patterns (SDP) describe countermeasures and are used to reduce risk. After our literature review, we did not find a suitable approach that presents SDPs that would be applicable in early system design. In this paper, we present 10 SDPs for early system design, which we evaluated during an 11-week student project with 28 teams. We present the results of the quantitative analysis and the evaluation of the feedback.}}, author = {{Japs, Sergej and Faheem, Faizan and Anacker, Harald and Husung, Stephan and Dumitrescu, Roman}}, issn = {{2732-527X}}, journal = {{Proceedings of the Design Society}}, pages = {{2675--2684}}, publisher = {{Cambridge University Press (CUP)}}, title = {{{Model-based Systems Engineering using Security Design Patterns in the Context of ISO/SAE 21434}}}, doi = {{10.1017/pds.2023.268}}, volume = {{3}}, year = {{2023}}, } @unpublished{49371, abstract = {{To model dynamical systems on networks with higher order (non-pairwise) interactions, we recently introduced a new class of ODEs on hypernetworks. Here we consider one-parameter synchrony breaking bifurcations in such ODEs. We call a synchrony breaking steady state branch "reluctant" if it is tangent to a synchrony space, but does not lie inside it. We prove that reluctant synchrony breaking is ubiquitous in hypernetwork systems, by constructing a large class of examples that support it. We also give an explicit formula for the order of tangency to the synchrony space of a reluctant steady state branch.}}, author = {{von der Gracht, Sören and Nijholt, Eddie and Rink, Bob}}, booktitle = {{arXiv:2311.17186}}, title = {{{Higher order interactions lead to "reluctant" synchrony breaking}}}, year = {{2023}}, } @inproceedings{49373, author = {{Kablo, Emiram and Arias Cabarcos, Patricia}}, booktitle = {{Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security}}, publisher = {{ACM}}, title = {{{Privacy in the Age of Neurotechnology: Investigating Public Attitudes towards Brain Data Collection and Use}}}, doi = {{10.1145/3576915.3623164}}, year = {{2023}}, } @article{46816, author = {{Torres, Adriano and Costa, Pedro and Amaral, Luis and Pastro, Jonata and Bonifácio, Rodrigo and d'Amorim, Marcelo and Legunsen, Owolabi and Bodden, Eric and Dias Canedo, Edna}}, issn = {{0098-5589}}, journal = {{IEEE Transactions on Software Engineering}}, keywords = {{Software}}, number = {{10}}, pages = {{4510 -- 4525}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Runtime Verification of Crypto APIs: An Empirical Study}}}, doi = {{10.1109/tse.2023.3301660}}, volume = {{49}}, year = {{2023}}, } @article{49439, abstract = {{AbstractThe use of static analysis security testing (SAST) tools has been increasing in recent years. However, previous studies have shown that, when shipped to end users such as development or security teams, the findings of these tools are often unsatisfying. Users report high numbers of false positives or long analysis times, making the tools unusable in the daily workflow. To address this, SAST tool creators provide a wide range of configuration options, such as customization of rules through domain-specific languages or specification of the application-specific analysis scope. In this paper, we study the configuration space of selected existing SAST tools when used within the integrated development environment (IDE). We focus on the configuration options that impact three dimensions, for which a trade-off is unavoidable, i.e., precision, recall, and analysis runtime. We perform a between-subjects user study with 40 users from multiple development and security teams - to our knowledge, the largest population for this kind of user study in the software engineering community. The results show that users who configure SAST tools are more effective in resolving security vulnerabilities detected by the tools than those using the default configuration. Based on post-study interviews, we identify common strategies that users have while configuring the SAST tools to provide further insights for tool creators. Finally, an evaluation of the configuration options of two commercial SAST tools, Fortify and CheckMarx, reveals that a quarter of the users do not understand the configuration options provided. The configuration options that are found most useful relate to the analysis scope.}}, author = {{Piskachev, Goran and Becker, Matthias and Bodden, Eric}}, issn = {{1382-3256}}, journal = {{Empirical Software Engineering}}, keywords = {{Software}}, number = {{5}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Can the configuration of static analyses make resolving security vulnerabilities more effective? - A user study}}}, doi = {{10.1007/s10664-023-10354-3}}, volume = {{28}}, year = {{2023}}, } @inproceedings{49438, author = {{Krüger, Stefan and Reif, Michael and Wickert, Anna-Katharina and Nadi, Sarah and Ali, Karim and Bodden, Eric and Acar, Yasemin and Mezini, Mira and Fahl, Sascha}}, booktitle = {{2023 IEEE Secure Development Conference (SecDev)}}, publisher = {{IEEE}}, title = {{{Securing Your Crypto-API Usage Through Tool Support - A Usability Study}}}, doi = {{10.1109/secdev56634.2023.00015}}, year = {{2023}}, } @misc{49494, author = {{Nickel, Alexander}}, title = {{{Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames}}}, year = {{2023}}, } @misc{49493, author = {{Telaprolu, Vipasyan}}, title = {{{Reconstruction of 3D Surfels from Neural Radiance Fields}}}, year = {{2023}}, } @misc{49492, author = {{Friemel, Jonas}}, title = {{{Shape Reconfiguration by Hybrid Programmable Matter}}}, year = {{2023}}, } @inproceedings{49361, author = {{Seidenberg, Tobias and Disselkamp, Jan-Philipp and Jürgenhake, Christoph and Wicker, Ansgar and Dumitrescu, Roman and Tolo, Edmund}}, location = {{Edingburgh}}, title = {{{TCO analysis of a modular and integral product architecture in shipbuilding}}}, doi = {{ 10.1109/ICE/ITMC58018.2023.10332277}}, year = {{2023}}, } @inproceedings{49360, author = {{Disselkamp, Jan-Philipp and Seidenberg, Tobias and Jürgenhake, Christoph and Anacker, Harald and Dumitrescu, Roman}}, location = {{Edingburgh}}, title = {{{Future production of ships – case study for modular high-speed ferries}}}, doi = {{ 10.1109/ICE/ITMC58018.2023.10332382}}, year = {{2023}}, } @article{49372, author = {{Klüners, Jürgen and Wang, Jiuya}}, issn = {{2730-9657}}, journal = {{La Matematica}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Idélic Approach in Enumerating Heisenberg Extensions}}}, doi = {{10.1007/s44007-023-00067-w}}, year = {{2023}}, } @inproceedings{48869, abstract = {{Evolutionary algorithms have been shown to obtain good solutions for complex optimization problems in static and dynamic environments. It is important to understand the behaviour of evolutionary algorithms for complex optimization problems that also involve dynamic and/or stochastic components in a systematic way in order to further increase their applicability to real-world problems. We investigate the node weighted traveling salesperson problem (W-TSP), which provides an abstraction of a wide range of weighted TSP problems, in dynamic settings. In the dynamic setting of the problem, items that have to be collected as part of a TSP tour change over time. We first present a dynamic setup for the dynamic W-TSP parameterized by different types of changes that are applied to the set of items to be collected when traversing the tour. Our first experimental investigations study the impact of such changes on resulting optimized tours in order to provide structural insights of optimization solutions. Afterwards, we investigate simple mutation-based evolutionary algorithms and study the impact of the mutation operators and the use of populations with dealing with the dynamic changes to the node weights of the problem.}}, author = {{Bossek, Jakob and Neumann, Aneta and Neumann, Frank}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{9798400701191}}, keywords = {{dynamic optimization, evolutionary algorithms, re-optimization, weighted traveling salesperson problem}}, pages = {{248–256}}, publisher = {{Association for Computing Machinery}}, title = {{{On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem}}}, doi = {{10.1145/3583131.3590384}}, year = {{2023}}, } @inproceedings{48872, abstract = {{Quality diversity (QD) is a branch of evolutionary computation that gained increasing interest in recent years. The Map-Elites QD approach defines a feature space, i.e., a partition of the search space, and stores the best solution for each cell of this space. We study a simple QD algorithm in the context of pseudo-Boolean optimisation on the "number of ones" feature space, where the ith cell stores the best solution amongst those with a number of ones in [(i - 1)k, ik - 1]. Here k is a granularity parameter 1 {$\leq$} k {$\leq$} n+1. We give a tight bound on the expected time until all cells are covered for arbitrary fitness functions and for all k and analyse the expected optimisation time of QD on OneMax and other problems whose structure aligns favourably with the feature space. On combinatorial problems we show that QD finds a (1 - 1/e)-approximation when maximising any monotone sub-modular function with a single uniform cardinality constraint efficiently. Defining the feature space as the number of connected components of a connected graph, we show that QD finds a minimum spanning tree in expected polynomial time.}}, author = {{Bossek, Jakob and Sudholt, Dirk}}, booktitle = {{Proceedings of the Genetic and Evolutionary Computation Conference}}, isbn = {{9798400701191}}, keywords = {{quality diversity, runtime analysis}}, pages = {{1546–1554}}, publisher = {{Association for Computing Machinery}}, title = {{{Runtime Analysis of Quality Diversity Algorithms}}}, doi = {{10.1145/3583131.3590383}}, year = {{2023}}, } @inproceedings{48886, abstract = {{Generating new instances via evolutionary methods is commonly used to create new benchmarking data-sets, with a focus on attempting to cover an instance-space as completely as possible. Recent approaches have exploited Quality-Diversity methods to evolve sets of instances that are both diverse and discriminatory with respect to a portfolio of solvers, but these methods can be challenging when attempting to find diversity in a high-dimensional feature-space. We address this issue by training a model based on Principal Component Analysis on existing instances to create a low-dimension projection of the high-dimension feature-vectors, and then apply Novelty Search directly in the new low-dimension space. We conduct experiments to evolve diverse and discriminatory instances of Knapsack Problems, comparing the use of Novelty Search in the original feature-space to using Novelty Search in a low-dimensional projection, and repeat over a given set of dimensions. We find that the methods are complementary: if treated as an ensemble, they collectively provide increased coverage of the space. Specifically, searching for novelty in a low-dimension space contributes 56% of the filled regions of the space, while searching directly in the feature-space covers the remaining 44%.}}, author = {{Marrero, Alejandro and Segredo, Eduardo and Hart, Emma and Bossek, Jakob and Neumann, Aneta}}, booktitle = {{Proceedings of the Genetic} and Evolutionary Computation Conference}}, isbn = {{9798400701191}}, keywords = {{evolutionary computation, instance generation, instance-space analysis, knapsack problem, novelty search}}, pages = {{312–320}}, publisher = {{Association for Computing Machinery}}, title = {{{Generating Diverse and Discriminatory Knapsack Instances by Searching for Novelty in Variable Dimensions of Feature-Space}}}, doi = {{10.1145/3583131.3590504}}, year = {{2023}}, } @article{48871, abstract = {{Most runtime analyses of randomised search heuristics focus on the expected number of function evaluations to find a unique global optimum. We ask a fundamental question: if additional search points are declared optimal, or declared as desirable target points, do these additional optima speed up evolutionary algorithms? More formally, we analyse the expected hitting time of a target set OPT{$\cup$}S where S is a set of non-optimal search points and OPT is the set of optima and compare it to the expected hitting time of OPT. We show that the answer to our question depends on the number and placement of search points in S. For all black-box algorithms and all fitness functions with polynomial expected optimisation times we show that, if additional optima are placed randomly, even an exponential number of optima has a negligible effect on the expected optimisation time. Considering Hamming balls around all global optima gives an easier target for some algorithms and functions and can shift the phase transition with respect to offspring population sizes in the (1,{$\lambda$}) EA on OneMax. However, for the one-dimensional Ising model the time to reach Hamming balls of radius (1/2-{$ϵ$})n around optima does not reduce the asymptotic expected optimisation time in the worst case. Finally, on functions where search trajectories typically join in a single search point, turning one search point into an optimum drastically reduces the expected optimisation time.}}, author = {{Bossek, Jakob and Sudholt, Dirk}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, keywords = {{Evolutionary algorithms, pseudo-Boolean functions, runtime analysis}}, pages = {{113757}}, title = {{{Do Additional Target Points Speed Up Evolutionary Algorithms?}}}, doi = {{10.1016/j.tcs.2023.113757}}, year = {{2023}}, } @article{48859, abstract = {{We contribute to the efficient approximation of the Pareto-set for the classical NP-hard multi-objective minimum spanning tree problem (moMST) adopting evolutionary computation. More precisely, by building upon preliminary work, we analyse the neighborhood structure of Pareto-optimal spanning trees and design several highly biased sub-graph-based mutation operators founded on the gained insights. In a nutshell, these operators replace (un)connected sub-trees of candidate solutions with locally optimal sub-trees. The latter (biased) step is realized by applying Kruskal’s single-objective MST algorithm to a weighted sum scalarization of a sub-graph.We prove runtime complexity results for the introduced operators and investigate the desirable Pareto-beneficial property. This property states that mutants cannot be dominated by their parent. Moreover, we perform an extensive experimental benchmark study to showcase the operator’s practical suitability. Our results confirm that the subgraph based operators beat baseline algorithms from the literature even with severely restricted computational budget in terms of function evaluations on four different classes of complete graphs with different shapes of the Pareto-front.}}, author = {{Bossek, Jakob and Grimme, Christian}}, issn = {{1063-6560}}, journal = {{Evolutionary Computation}}, pages = {{1–35}}, title = {{{On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem}}}, doi = {{10.1162/evco_a_00335}}, year = {{2023}}, } @article{49425, author = {{Seitz, Simone and Häsel-Weide, Uta and Wilke, Yannik and Wallner, Melina}}, journal = {{Teachers and Teaching}}, pages = {{1--16}}, title = {{{Expertise and professionalism for inclusive (mathematics) teaching and learning: reflections on findings from interdisciplinary professionalisation research}}}, doi = {{https://doi.org/10.1080/13540602.2023.2284876 }}, year = {{2023}}, } @unpublished{49649, author = {{Igamberdiev, Timour and Vu, Doan Nam Long and Künnecke, Felix and Yu, Zhuo and Holmer, Jannik and Habernal, Ivan}}, title = {{{DP-NMT: Scalable Differentially-Private Machine Translation}}}, year = {{2023}}, } @unpublished{49650, author = {{Held, Lena and Habernal, Ivan}}, title = {{{LaCour!: Enabling Research on Argumentation in Hearings of the European Court of Human Rights}}}, year = {{2023}}, } @article{46310, abstract = {{Classic automated algorithm selection (AS) for (combinatorial) optimization problems heavily relies on so-called instance features, i.e., numerical characteristics of the problem at hand ideally extracted with computationally low-demanding routines. For the traveling salesperson problem (TSP) a plethora of features have been suggested. Most of these features are, if at all, only normalized imprecisely raising the issue of feature values being strongly affected by the instance size. Such artifacts may have detrimental effects on algorithm selection models. We propose a normalization for two feature groups which stood out in multiple AS studies on the TSP: (a) features based on a minimum spanning tree (MST) and (b) nearest neighbor relationships of the input instance. To this end we theoretically derive minimum and maximum values for properties of MSTs and k-nearest neighbor graphs (NNG) of Euclidean graphs. We analyze the differences in feature space between normalized versions of these features and their unnormalized counterparts. Our empirical investigations on various TSP benchmark sets point out that the feature scaling succeeds in eliminating the effect of the instance size. A proof-of-concept AS-study shows promising results: models trained with normalized features tend to outperform those trained with the respective vanilla features.}}, author = {{Heins, Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal}}, issn = {{0304-3975}}, journal = {{Theoretical Computer Science}}, keywords = {{Feature normalization, Algorithm selection, Traveling salesperson problem}}, pages = {{123--145}}, title = {{{A study on the effects of normalized TSP features for automated algorithm selection}}}, doi = {{https://doi.org/10.1016/j.tcs.2022.10.019}}, volume = {{940}}, year = {{2023}}, } @article{49760, author = {{Jakobeit, Darius and Schenke, Maximilian and Wallscheid, Oliver}}, issn = {{0885-8993}}, journal = {{IEEE Transactions on Power Electronics}}, keywords = {{Electrical and Electronic Engineering}}, number = {{7}}, pages = {{8062--8074}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Meta-Reinforcement-Learning-Based Current Control of Permanent Magnet Synchronous Motor Drives for a Wide Range of Power Classes}}}, doi = {{10.1109/tpel.2023.3256424}}, volume = {{38}}, year = {{2023}}, } @article{49655, abstract = {{In today's digital world, data-driven digital artefacts pose challenges for education, as many students lack an understanding of data and feel powerless when interacting with them. This article addresses these challenges and introduces the data awareness framework. It focuses on understanding data-driven technologies and reflecting on the role of data in everyday life. The paper also presents an empirical study on young school students' data awareness. The study involves a teaching unit on data awareness framed by a pretest-posttest design using a questionnaire on students' awareness and understanding of and reflection on data practices of data-driven digital artefacts. The study's findings indicate that the data awareness framework supports students in understanding data practices of data-driven digital artefacts. The findings also suggest that the framework encourages students to reflect on these data practices and think about their daily behaviour. Students learn a model about interactions with data-driven digital artefacts and use it to analyse data-driven applications. This approach appears to enable students to understand these artefacts from everyday life and reflect on these interactions. The work contributes to research on data and AI literacies and suggests a way to support students in developing self-determination and agency during interactions with data-driven digital artefacts.}}, author = {{Höper, Lukas and Schulte, Carsten}}, issn = {{2398-5348}}, journal = {{Information and Learning Sciences}}, keywords = {{Library and Information Sciences, Computer Science Applications, Education}}, publisher = {{Emerald}}, title = {{{The data awareness framework as part of data literacies in K-12 education}}}, doi = {{10.1108/ils-06-2023-0075}}, year = {{2023}}, } @inproceedings{47448, abstract = {{In XAI it is important to consider that, in contrast to explanations for professional audiences, one cannot assume common expertise when explaining for laypeople. But such explanations between humans vary greatly, making it difficult to research commonalities across explanations. We used the dual nature theory, a techno-philosophical approach, to cope with these challenges. According to it, one can explain, for example, an XAI's decision by addressing its dual nature: by focusing on the Architecture (e.g., the logic of its algorithms) or the Relevance (e.g., the severity of a decision, the implications of a recommendation). We investigated 20 game explanations using the theory as an analytical framework. We elaborate how we used the theory to quickly structure and compare explanations of technological artifacts. We supplemented results from analyzing the explanation contents with results from a video recall to explore how explainers justified their explanation. We found that explainers were focusing on the physical aspects of the game first (Architecture) and only later on aspects of the Relevance. Reasoning in the video recalls indicated that EX regarded the focus on the Architecture as important for structuring the explanation initially by explaining the basic components before focusing on more complex, intangible aspects. Shifting between addressing the two sides was justified by explanation goals, emerging misunderstandings, and the knowledge needs of the explainee. We discovered several commonalities that inspire future research questions which, if further generalizable, provide first ideas for the construction of synthetic explanations.}}, author = {{Terfloth, Lutz and Schaffer, Michael and Buhl, Heike M. and Schulte, Carsten}}, isbn = {{978-3-031-44069-4}}, location = {{Lisboa}}, publisher = {{Springer, Cham}}, title = {{{Adding Why to What? Analyses of an Everyday Explanation}}}, doi = {{10.1007/978-3-031-44070-0_13}}, year = {{2023}}, } @article{48946, abstract = {{inhalt Der verlässliche Betrieb von technischen Produkten wird zunehmend durch bewusste Angriffe bedroht. Vollständige Sicherheit ist dabei nicht möglich, durchschlagende Angriffe sind unvermeidbar (Assume Breach). Dies erfordert einen Paradigmenwechsel in der sicherheitsgerechten Entwicklung mechatronischer und cyber-physischer Systeme hin zu Defense-in-Depth. Systeme müssen so ausgelegt werden, dass sie auch bei gezielten Angriffen möglichst hohe Zuverlässigkeit und Sicherheit gewährleisten. Der hier beschriebene Lösungsansatz erweitert das Systemmodell um Angriffsszenarien und Verteidigungslinien. Diese werden am Beispiel eines industriellen Schließsystems zur Anlagensicherheit erläutert. Entwickler werden sensibilisiert, Angriffe systematisch zu berücksichtigen und interdisziplinär Verteidigungselemente gegenüber Bedrohungen und Angriffen zu spezifizieren.}}, author = {{Gräßler, Iris and Bodden, Eric and Wiechel, Dominik and Pottebaum, Jens}}, issn = {{0720-5953}}, journal = {{Konstruktion}}, keywords = {{Mechanical Engineering, Mechanics of Materials, General Materials Science, Theoretical Computer Science}}, number = {{11-12}}, pages = {{60--65}}, publisher = {{VDI Fachmedien GmbH and Co. KG}}, title = {{{Defense-in-Depth als neues Paradigma der sicherheitsgerechten Produktentwicklung: interdisziplinäre, bedrohungsbewusste und lösungsorientierte Security}}}, doi = {{10.37544/0720-5953-2023-11-12-60}}, volume = {{75}}, year = {{2023}}, } @inproceedings{46500, abstract = {{The security of Industrial Control Systems is relevant both for reliable production system operations and for high-quality throughput in terms of manufactured products. Security measures are designed, operated and maintained by different roles along product and production system lifecycles. Defense-in-Depth as a paradigm builds upon the assumption that breaches are unavoidable. The paper at hand provides an analysis of roles, corresponding Human Factors and their relevance for data theft and sabotage attacks. The resulting taxonomy is reflected by an example related to Additive Manufacturing. The results assist in both designing and redesigning Industrial Control System as part of an entire production system so that Defense-in-Depth with regard to Human Factors is built in by design.}}, author = {{Pottebaum, Jens and Rossel, Jost and Somorovsky, Juraj and Acar, Yasemin and Fahr, René and Arias Cabarcos, Patricia and Bodden, Eric and Gräßler, Iris}}, booktitle = {{2023 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW)}}, keywords = {{Defense-in-Depth, Human Factors, Production Engineering, Product Design, Systems Engineering}}, location = {{Delft, Netherlands}}, pages = {{379--385}}, publisher = {{IEEE}}, title = {{{Re-Envisioning Industrial Control Systems Security by Considering Human Factors as a Core Element of Defense-in-Depth}}}, doi = {{10.1109/eurospw59978.2023.00048}}, year = {{2023}}, } @article{50012, abstract = {{Silicon photonics, in conjunction with complementary metal-oxide-semiconductor (CMOS) fabrication, has greatly enhanced the development of integrated optical phased arrays. This facilitates a dynamic control of light in a compact form factor that enables the synthesis of arbitrary complex wavefronts in the infrared spectrum. We numerically demonstrate a large-scale two-dimensional silicon-based optical phased array (OPA) composed of nanoantennas with circular gratings that are balanced in power and aligned in phase, required for producing elegant radiation patterns in the far-field. For a wavelength of 1.55 μm, we optimize two antennas for the OPA exhibiting an upward radiation efficiency as high as 90%, with almost 6.8% of optical power concentrated in the field of view. Additionally, we believe that the proposed OPAs can be easily fabricated and would have the ability to generate complex holographic images, rendering them an attractive candidate for a wide range of applications like LiDAR sensors, optical trapping, optogenetic stimulation, and augmented-reality displays.}}, author = {{Farheen, Henna and Strauch, Andreas and Scheytt, J. Christoph and Myroshnychenko, Viktor and Förstner, Jens}}, issn = {{1569-4410}}, journal = {{Photonics and Nanostructures - Fundamentals and Applications}}, keywords = {{tet_topic_opticalantenna}}, pages = {{101207}}, publisher = {{Elsevier BV}}, title = {{{Optimized, Highly Efficient Silicon Antennas for Optical Phased Arrays}}}, doi = {{10.1016/j.photonics.2023.101207}}, volume = {{58}}, year = {{2023}}, } @inproceedings{49890, abstract = {{In this paper, the influence of the environment on an inductive location system is analyzed. In the inductive location method, high frequency magnetic fields generated by planar coils lead to induction in other coils, which is used for localization analysis. Magnetic fields are not affected by changes in the dielectric properties of the environment, which is an advantage over other localization methods. However, electrical material parameters can still affect the localization results by indirect effects. For this reason, in this publication the influence will be investigated using real material parameters and their effects on the localization will be considered, so that the robustness and the limits of the inductive localization can be evaluated.}}, author = {{Lange, Sven and Hilleringmann, Ulrich and Hedayat, Christian and Kuhn, Harald and Förstner, Jens}}, booktitle = {{2023 IEEE Conference on Antenna Measurements and Applications (CAMA)}}, keywords = {{Planar coils, inductive locating, magnetic fields, environmental influences, eddy currents, tet_topic_hf}}, location = {{Genoa, Italy }}, publisher = {{IEEE}}, title = {{{Characterization of Various Environmental Influences on the Inductive Localization}}}, doi = {{10.1109/cama57522.2023.10352780}}, year = {{2023}}, } @article{48599, abstract = {{AbstractThe biexciton‐exciton emission cascade commonly used in quantum‐dot systems to generate polarization entanglement yields photons with intrinsically limited indistinguishability. In the present work, it focuses on the generation of pairs of photons with high degrees of polarization entanglement and simultaneously high indistinguishability. It achieves this goal by selectively reducing the biexciton lifetime with an optical resonator. It demonstrates that a suitably tailored circular Bragg reflector fulfills the requirements of sufficient selective Purcell enhancement of biexciton emission paired with spectrally broad photon extraction and twofold degenerate optical modes. The in‐depth theoretical study combines (i) the optimization of realistic photonic structures solving Maxwell's equations from which model parameters are extracted as input for (ii) microscopic simulations of quantum‐dot cavity excitation dynamics with full access to photon properties. It reports non‐trivial dependencies on system parameters and use the predictive power of the combined theoretical approach to determine the optimal range of Purcell enhancement that maximizes indistinguishability and entanglement to near unity values, here specifically for the telecom C‐band at 1550 nm.}}, author = {{Bauch, David and Siebert, Dustin and Jöns, Klaus and Förstner, Jens and Schumacher, Stefan}}, issn = {{2511-9044}}, journal = {{Advanced Quantum Technologies}}, keywords = {{tet_topic_qd}}, publisher = {{Wiley}}, title = {{{On‐Demand Indistinguishable and Entangled Photons Using Tailored Cavity Designs}}}, doi = {{10.1002/qute.202300142}}, year = {{2023}}, } @unpublished{43246, abstract = {{The biexciton-exciton emission cascade commonly used in quantum-dot systems to generate polarization entanglement yields photons with intrinsically limited indistinguishability. In the present work we focus on the generation of pairs of photons with high degrees of polarization entanglement and simultaneously high indistinguishibility. We achieve this goal by selectively reducing the biexciton lifetime with an optical resonator. We demonstrate that a suitably tailored circular Bragg reflector fulfills the requirements of sufficient selective Purcell enhancement of biexciton emission paired with spectrally broad photon extraction and two-fold degenerate optical modes. Our in-depth theoretical study combines (i) the optimization of realistic photonic structures solving Maxwell's equations from which model parameters are extracted as input for (ii) microscopic simulations of quantum-dot cavity excitation dynamics with full access to photon properties. We report non-trivial dependencies on system parameters and use the predictive power of our combined theoretical approach to determine the optimal range of Purcell enhancement that maximizes indistinguishability and entanglement to near unity values in the telecom C-band at $1550\,\mathrm{nm}$.}}, author = {{Bauch, David and Siebert, Dustin and Jöns, Klaus and Förstner, Jens and Schumacher, Stefan}}, keywords = {{tet_topic_phc, tet_topic_qd}}, title = {{{On-demand indistinguishable and entangled photons at telecom frequencies using tailored cavity designs}}}, year = {{2023}}, } @inproceedings{34135, abstract = {{By one of the most fundamental principles in physics, a dynamical system will exhibit those motions which extremise an action functional. This leads to the formation of the Euler-Lagrange equations, which serve as a model of how the system will behave in time. If the dynamics exhibit additional symmetries, then the motion fulfils additional conservation laws, such as conservation of energy (time invariance), momentum (translation invariance), or angular momentum (rotational invariance). To learn a system representation, one could learn the discrete Euler-Lagrange equations, or alternatively, learn the discrete Lagrangian function Ld which defines them. Based on ideas from Lie group theory, in this work we introduce a framework to learn a discrete Lagrangian along with its symmetry group from discrete observations of motions and, therefore, identify conserved quantities. The learning process does not restrict the form of the Lagrangian, does not require velocity or momentum observations or predictions and incorporates a cost term which safeguards against unwanted solutions and against potential numerical issues in forward simulations. The learnt discrete quantities are related to their continuous analogues using variational backward error analysis and numerical results demonstrate the improvement such models can have both qualitatively and quantitatively even in the presence of noise.}}, author = {{Lishkova, Yana and Scherer, Paul and Ridderbusch, Steffen and Jamnik, Mateja and Liò, Pietro and Ober-Blöbaum, Sina and Offen, Christian}}, booktitle = {{IFAC-PapersOnLine}}, location = {{ Yokohama, Japan}}, number = {{2}}, pages = {{3203--3210}}, publisher = {{Elsevier}}, title = {{{Discrete Lagrangian Neural Networks with Automatic Symmetry Discovery}}}, doi = {{10.1016/j.ifacol.2023.10.1457}}, volume = {{56}}, year = {{2023}}, } @unpublished{44840, abstract = {{In this article we investigate the convergence behavior of gathering protocols with fixed circulant topologies using tools form dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we model a gathering protocol as a system of ordinary differential equations whose equilibria are exactly all possible gathering points. Then, we find necessary and sufficient conditions for the structure of the underlying interaction graph such that the protocol is stable and converging, i.e., gathering, in the distributive computing sense by using tools from dynamical systems. Moreover, these tools allow for a more fine grained analysis in terms of speed of convergence in the dynamical systems sense. In fact, we derive a decomposition of the state space into stable invariant subspaces with different convergence rates. In particular, this decomposition is identical for every (linear) circulant gathering protocol, whereas only the convergence rates depend on the weights in interaction graph itself.}}, author = {{Gerlach, Raphael and von der Gracht, Sören and Dellnitz, Michael}}, booktitle = {{arXiv:2305.06632}}, keywords = {{Dynamical Systems, Coupled Systems, Distributed Computing, Robot Swarms, Autonomous Mobile Robots, Gathering}}, pages = {{38}}, title = {{{On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies}}}, year = {{2023}}, } @inproceedings{46738, author = {{Sadeghi-Kohan, Somayeh and Reimer, Jan Dennis and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, booktitle = {{IEEE Asian Test Symposium (ATS'23), October 2023}}, title = {{{Optimizing the Streaming of Sensor Data with Approximate Communication}}}, year = {{2023}}, } @article{50298, abstract = {{A finite classical polar space of rank $n$ consists of the totally isotropic subspaces of a finite vector space equipped with a nondegenerate form such that $n$ is the maximal dimension of such a subspace. A $t$-Steiner system in a finite classical polar space of rank $n$ is a collection $Y$ of totally isotropic $n$-spaces such that each totally isotropic $t$-space is contained in exactly one member of $Y$. Nontrivial examples are known only for $t=1$ and $t=n-1$. We give an almost complete classification of such $t$-Steiner systems, showing that such objects can only exist in some corner cases. This classification result arises from a more general result on packings in polar spaces.}}, author = {{Schmidt, Kai-Uwe and Weiß, Charlene}}, journal = {{Combinatorial Theory}}, number = {{1}}, title = {{{Packings and Steiner systems in polar spaces}}}, doi = {{10.5070/c63160424}}, volume = {{3}}, year = {{2023}}, } @article{50297, abstract = {{We show that there exist ordered orthogonal arrays, whose sizes deviate from the Rao bound by a factor that is polynomial in the parameters of the ordered orthogonal array. The proof is nonconstructive and based on a probabilistic method due to Kuperberg, Lovett and Peled.}}, author = {{Schmidt, Kai‐Uwe and Weiß, Charlene}}, journal = {{Journal of Combinatorial Designs}}, number = {{9}}, pages = {{422--431}}, publisher = {{Wiley}}, title = {{{Existence of small ordered orthogonal arrays}}}, doi = {{10.1002/jcd.21903}}, volume = {{31}}, year = {{2023}}, } @phdthesis{50300, abstract = {{Digital communications relies heavily on the usage of different types of codes. Prominent codes nowadays are rank-metric codes and subspace codes - the q-analogs of binary codes and binary codes with constant weight. All these codes can be viewed as subsets of classical association schemes. A central coding-theoretic problem is to derive upper bounds for the size of codes. This thesis investigates Delsartes powerful linear program whose optimum is precisely such a bound for codes in association schemes. The linear programs for binary codes and binary constant-weight codes have been extensively studied since the 1970s, but their optimum is still unknown. We determine in a unified way the optimum of the linear program in several ordinary q-analogs as well as in their affine counterparts. In particular, bounds and constructions for codes in polar spaces are established, where the bounds are sharp up to a constant factor in many cases. Moreover, based on these results, an almost complete classification of Steiner systems in polar spaces is provided by showing that they could only exist in some corner cases.}}, author = {{Weiß, Charlene}}, title = {{{Linear programming bounds in classical association schemes}}}, doi = {{10.17619/UNIPB/1-1672}}, year = {{2023}}, } @unpublished{50299, abstract = {{A finite classical polar space of rank $n$ consists of the totally isotropic subspaces of a finite vector space over $\mathbb{F}_p$ equipped with a nondegenerate form such that $n$ is the maximal dimension of such a subspace. A $t$-$(n,k,\lambda)$ design in a finite classical polar space of rank $n$ is a collection $Y$ of totally isotropic $k$-spaces such that each totally isotropic $t$-space is contained in exactly $\lambda$ members of $Y$. Nontrivial examples are currently only known for $t\leq 2$. We show that $t$-$(n,k,\lambda)$ designs in polar spaces exist for all $t$ and $p$ provided that $k>\frac{21}{2}t$ and $n$ is sufficiently large enough. The proof is based on a probabilistic method by Kuperberg, Lovett, and Peled, and it is thus nonconstructive.}}, author = {{Weiß, Charlene}}, booktitle = {{arXiv:2311.08288}}, title = {{{Nontrivial $t$-designs in polar spaces exist for all $t$}}}, year = {{2023}}, } @inproceedings{47064, author = {{Iftekhar, Mohammed and Nagaraju, Harshan and Kneuper, Pascal and Sadiye, Babak and Müller, Wolfgang and Scheytt, J. Christoph}}, booktitle = {{BCICTS 2023 IEEE BiCMOS and Compound Semiconductor Integrated Circuits and Technology Symposium}}, location = {{MONTEREY, CALIFORNIA, USA}}, title = {{{A 28-Gb/s 27.2 mW NRZ Full-Rate Bang-Bang Clock and Data Recovery in 22 nm FD-SOI CMOS Technology }}}, year = {{2023}}, } @misc{48335, author = {{Knorr, Lukas and Jungeilges, André and Pfeifer, Florian and Burmeister, Sascha Christian and Meschede, Henning}}, publisher = {{4. Aachener Ofenbau- und Thermoprozess-Kolloquium}}, title = {{{Regenerative Energien für einen effizienten Betrieb von Presshärtelinien}}}, year = {{2023}}, } @article{50458, abstract = {{AbstractConsider a set of jobs connected to a directed acyclic task graph with a fixed source and sink. The edges of this graph model precedence constraints and the jobs have to be scheduled with respect to those. We introduce the server cloud scheduling problem, in which the jobs have to be processed either on a single local machine or on one of infinitely many cloud machines. For each job, processing times both on the server and in the cloud are given. Furthermore, for each edge in the task graph, a communication delay is included in the input and has to be taken into account if one of the two jobs is scheduled on the server and the other in the cloud. The server processes jobs sequentially, whereas the cloud can serve as many as needed in parallel, but induces costs. We consider both makespan and cost minimization. The main results are an FPTAS for the makespan objective for graphs with a constant source and sink dividing cut and strong hardness for the case with unit processing times and delays.}}, author = {{Maack, Marten and Meyer auf der Heide, Friedhelm and Pukrop, Simon}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, keywords = {{Applied Mathematics, Computer Science Applications, General Computer Science}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Server Cloud Scheduling}}}, doi = {{10.1007/s00453-023-01189-x}}, year = {{2023}}, } @inproceedings{50460, author = {{Deppert, Max A. and Jansen, Klaus and Maack, Marten and Pukrop, Simon and Rau, Malin}}, booktitle = {{2023 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}}, publisher = {{IEEE}}, title = {{{Scheduling with Many Shared Resources}}}, doi = {{10.1109/ipdps54959.2023.00049}}, year = {{2023}}, } @article{48596, author = {{Häsel-Weide, Uta and Schmidt, R. and Büker, Petra}}, journal = {{Zeitschrift für Schul- Und Professionsentwicklung. (PFLB)}}, number = {{1}}, pages = {{215--229}}, title = {{{„FInDig“: Fach – Inklusion – Digitalisierung vernetzen. Ein Planungs- und Reflexionsmodell für die Lehrkräftebildung}}}, volume = {{5}}, year = {{2023}}, } @inproceedings{50479, abstract = {{Verifying assertions is an essential part of creating and maintaining knowledge graphs. Most often, this task cannot be carried out manually due to the sheer size of modern knowledge graphs. Hence, automatic fact-checking approaches have been proposed over the last decade. These approaches aim to compute automatically whether a given assertion is correct or incorrect. However, most fact-checking approaches are binary classifiers that fail to consider the volatility of some assertions, i.e., the fact that such assertions are only valid at certain times or for specific time intervals. Moreover, the few approaches able to predict when an assertion was valid (i.e., time-point prediction approaches) rely on manual feature engineering. This paper presents TEMPORALFC, a temporal fact-checking approach that uses multiple sources of background knowledge to assess the veracity and temporal validity of a given assertion. We evaluate TEMPORALFC on two datasets and compare it to the state of the art in fact-checking and time-point prediction. Our results suggest that TEMPORALFC outperforms the state of the art on the fact-checking task by 0.13 to 0.15 in terms of Area Under the Receiver Operating Characteristic curve and on the time-point prediction task by 0.25 to 0.27 in terms of Mean Reciprocal Rank. Our code is open-source and can be found at https://github.com/dice-group/TemporalFC.}}, author = {{Qudus, Umair and Röder, Michael and Kirrane, Sabrina and Ngomo, Axel-Cyrille Ngonga}}, booktitle = {{The Semantic Web – ISWC 2023}}, editor = {{R. Payne, Terry and Presutti, Valentina and Qi, Guilin and Poveda-Villalón, María and Stoilos, Giorgos and Hollink, Laura and Kaoudi, Zoi and Cheng, Gong and Li, Juanzi}}, isbn = {{9783031472398}}, issn = {{0302-9743}}, keywords = {{temporal fact checking · ensemble learning · transfer learning · time-point prediction · temporal knowledge graphs}}, location = {{Athens, Greece}}, pages = {{465–483}}, publisher = {{Springer, Cham}}, title = {{{TemporalFC: A Temporal Fact Checking Approach over Knowledge Graphs}}}, doi = {{10.1007/978-3-031-47240-4_25}}, volume = {{14265}}, year = {{2023}}, } @inbook{46191, author = {{Alt, Christoph and Kenter, Tobias and Faghih-Naini, Sara and Faj, Jennifer and Opdenhövel, Jan-Oliver and Plessl, Christian and Aizinger, Vadym and Hönig, Jan and Köstler, Harald}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783031320408}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Shallow Water DG Simulations on FPGAs: Design and Comparison of a Novel Code Generation Pipeline}}}, doi = {{10.1007/978-3-031-32041-5_5}}, year = {{2023}}, } @unpublished{43439, abstract = {{This preprint makes the claim of having computed the $9^{th}$ Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. The resulting value is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value.}}, author = {{Van Hirtum, Lennart and De Causmaecker, Patrick and Goemaere, Jens and Kenter, Tobias and Riebler, Heinrich and Lass, Michael and Plessl, Christian}}, booktitle = {{arXiv:2304.03039}}, title = {{{A computation of D(9) using FPGA Supercomputing}}}, year = {{2023}}, } @inproceedings{48012, author = {{Rossel, Jost and Mladenov, Vladislav and Somorovsky, Juraj}}, booktitle = {{Proceedings of the 26th International Symposium on Research in Attacks, Intrusions and Defenses}}, location = {{Hongkong}}, publisher = {{ACM}}, title = {{{Security Analysis of the 3MF Data Format}}}, doi = {{10.1145/3607199.3607216}}, year = {{2023}}, } @inproceedings{51117, author = {{Scheidemann, Claus and Hemsel, Tobias and Friesen, Olga and Claes, Leander and Sextro, Walter}}, location = {{Jeju, Korea}}, title = {{{Influence of Temperature and Pre-Stress on the Piezoelectric Material Behavior of Ring-Shaped Ceramics}}}, year = {{2023}}, } @inproceedings{51118, author = {{Scheidemann, Claus and Hemsel, Tobias and Friesen, Olga and Claes, Leander and Sextro, Walter}}, location = {{Incheon, Korea}}, title = {{{Influence of Temperature and Pre-Stress on the Piezoelectric Material Behavior of Ring-Shaped Ceramics}}}, year = {{2023}}, } @inproceedings{51131, author = {{Graf, Lara Marie and Häsel-Weide, Uta and Höveler, K. and Nührenbörger, M.}}, booktitle = {{Proceedings of the Thirteenth Congress of the European Society for Research in Mathematics Education (CERME13)}}, editor = {{Drijvers, P. and Csapodi, C. and Palmér, H. and Gosztonyi, K. and Kónya, E.}}, pages = {{3203--3210}}, title = {{{Insights into out-of-field teachers’ self-reports: Fostering the understanding of addition and subtraction as a basis for children to overcome difficulties in mathematics}}}, year = {{2023}}, } @unpublished{51159, abstract = {{Sparsity is a highly desired feature in deep neural networks (DNNs) since it ensures numerical efficiency, improves the interpretability of models (due to the smaller number of relevant features), and robustness. In machine learning approaches based on linear models, it is well known that there exists a connecting path between the sparsest solution in terms of the $\ell^1$ norm,i.e., zero weights and the non-regularized solution, which is called the regularization path. Very recently, there was a first attempt to extend the concept of regularization paths to DNNs by means of treating the empirical loss and sparsity ($\ell^1$ norm) as two conflicting criteria and solving the resulting multiobjective optimization problem. However, due to the non-smoothness of the $\ell^1$ norm and the high number of parameters, this approach is not very efficient from a computational perspective. To overcome this limitation, we present an algorithm that allows for the approximation of the entire Pareto front for the above-mentioned objectives in a very efficient manner. We present numerical examples using both deterministic and stochastic gradients. We furthermore demonstrate that knowledge of the regularization path allows for a well-generalizing network parametrization.}}, author = {{Amakor, Augustina Chidinma and Sonntag, Konstantin and Peitz, Sebastian}}, booktitle = {{arXiv}}, title = {{{A multiobjective continuation method to compute the regularization path of deep neural networks}}}, year = {{2023}}, } @unpublished{51158, abstract = {{Extended Dynamic Mode Decomposition (EDMD) is a popular data-driven method to approximate the Koopman operator for deterministic and stochastic (control) systems. This operator is linear and encompasses full information on the (expected stochastic) dynamics. In this paper, we analyze a kernel-based EDMD algorithm, known as kEDMD, where the dictionary consists of the canonical kernel features at the data points. The latter are acquired by i.i.d. samples from a user-defined and application-driven distribution on a compact set. We prove bounds on the prediction error of the kEDMD estimator when sampling from this (not necessarily ergodic) distribution. The error analysis is further extended to control-affine systems, where the considered invariance of the Reproducing Kernel Hilbert Space is significantly less restrictive in comparison to invariance assumptions on an a-priori chosen dictionary.}}, author = {{Philipp, Friedrich and Schaller, Manuel and Worthmann, Karl and Peitz, Sebastian and Nüske, Feliks}}, booktitle = {{arXiv:2312.10460}}, title = {{{Error analysis of kernel EDMD for prediction and control in the Koopman framework}}}, year = {{2023}}, }