@article{28989, author = {{Bothe, Mike and Lutters, Nicole and Kenig, Eugeny}}, journal = {{Chemical Engineering Transactions}}, title = {{{Examination of hazardous situations in industrial closed-loop processes using dynamic simulations}}}, doi = {{10.3303/CET2188117}}, year = {{2021}}, } @techreport{29057, author = {{Eberbach, Jelena and Sureth-Sloane, Caren and Uhrig-Homburg, Marliese}}, publisher = {{Working Paper}}, title = {{{Option Implied Tax Rate Expectations}}}, year = {{2021}}, } @article{27045, abstract = {{Due to the lack of established real-world benchmark suites for static taint analyses of Android applications, evaluations of these analyses are often restricted and hard to compare. Even in evaluations that do use real-world apps, details about the ground truth in those apps are rarely documented, which makes it difficult to compare and reproduce the results. To push Android taint analysis research forward, this paper thus recommends criteria for constructing real-world benchmark suites for this specific domain, and presents TaintBench, the first real-world malware benchmark suite with documented taint flows. TaintBench benchmark apps include taint flows with complex structures, and addresses static challenges that are commonly agreed on by the community. Together with the TaintBench suite, we introduce the TaintBench framework, whose goal is to simplify real-world benchmarking of Android taint analyses. First, a usability test shows that the framework improves experts’ performance and perceived usability when documenting and inspecting taint flows. Second, experiments using TaintBench reveal new insights for the taint analysis tools Amandroid and FlowDroid: (i) They are less effective on real-world malware apps than on synthetic benchmark apps. (ii) Predefined lists of sources and sinks heavily impact the tools’ accuracy. (iii) Surprisingly, up-to-date versions of both tools are less accurate than their predecessors.}}, author = {{Luo, Linghui and Pauck, Felix and Piskachev, Goran and Benz, Manuel and Pashchenko, Ivan and Mory, Martin and Bodden, Eric and Hermann, Ben and Massacci, Fabio}}, issn = {{1382-3256}}, journal = {{Empirical Software Engineering}}, title = {{{TaintBench: Automatic real-world malware benchmarking of Android taint analyses}}}, doi = {{10.1007/s10664-021-10013-5}}, year = {{2021}}, } @inproceedings{27847, author = {{Lugovtsova, Yevgeniya and Zeipert, Henning and Johannesmann, Sarah and Nicolai, Marcel and Prager, Jens and Henning, Bernd}}, booktitle = {{МАТЕМАТИЧЕСКОЕ МОДЕЛИРОВАНИЕ В ЕСТЕСТВЕННЫХ НАУКАХ - XXX Всероссийская школа-конференция}}, location = {{Perm}}, title = {{{К ОПРЕДЕЛЕНИЮ ПРОЧНОСТИ КЛЕЕВОГО СОЕДИНЕНИЯ В МНОГОСЛОЙНЫХ МАТЕРИАЛАХ ПУТЕМ ИССЛЕДОВАНИЯ ОБЛАСТЕЙ РАСТАЛКИВАНИЯ БЕГУЩИХ УПРУГИХ ВОЛН}}}, year = {{2021}}, } @article{27881, abstract = {{ZusammenfassungLehrkräftekooperation wird generell eine positive Bedeutung in Bezug auf Schul- und Unterrichtsentwicklung zugeschrieben. Dabei sind empirische Belege für eine positive Wirksamkeit nach wie vor kaum vorhanden, es gibt sogar Befunde zu ‚negativen‘ Konsequenzen von Lehrkräftekooperation. Um diese Widersprüchlichkeit zu klären, wurde in der vorliegenden Arbeit Kooperation nicht als Instrument bzw. als Technik betrachtet, sondern als soziale Praxis verstanden, in der eigenlogisches, kollektiv-implizites Wissen (re)produziert wird (Community of Practice). Parallel dazu wurde ein praxeologisches Kompetenzverständnis (Praxiskompetenz) eingeführt, das wesentlich auf die Praxeologie Pierre Bourdieus zurückgeht und den Zusammenhang zwischen Lehrkräftekooperation als Community of Practice und kollektiv strukturierter, individueller Kompetenz theoretisch verdeutlicht. Die empirischen Befunde, welche mittels der Dokumentarischen Methode generiert wurden, verweisen auf die Bedeutung unterschiedlicher Relationslogiken (Nicht-Passung, Entfaltung, Herausforderung) für das ‚Lernen‘ von oder innerhalb von Praxiskompetenz(en) und damit auch auf die Wichtigkeit einer grundlegend kollektiv gerahmten Perspektive auf Lehrkräftekooperation. Vor diesem Hintergrund ist ein allzu positiver Blick auf Lehrkräftekooperationsprozesse kritisch zu betrachten.}}, author = {{Bloh, Thiemo}}, issn = {{2190-6890}}, journal = {{Zeitschrift für Bildungsforschung}}, title = {{{Entwicklung von Praxiskompetenz durch Kooperationsprozesse von Lehrkräften}}}, doi = {{10.1007/s35834-021-00328-0}}, year = {{2021}}, } @article{21065, abstract = {{The machine recognition of speech spoken at a distance from the microphones, known as far-field automatic speech recognition (ASR), has received a significant increase of attention in science and industry, which caused or was caused by an equally significant improvement in recognition accuracy. Meanwhile it has entered the consumer market with digital home assistants with a spoken language interface being its most prominent application. Speech recorded at a distance is affected by various acoustic distortions and, consequently, quite different processing pipelines have emerged compared to ASR for close-talk speech. A signal enhancement front-end for dereverberation, source separation and acoustic beamforming is employed to clean up the speech, and the back-end ASR engine is robustified by multi-condition training and adaptation. We will also describe the so-called end-to-end approach to ASR, which is a new promising architecture that has recently been extended to the far-field scenario. This tutorial article gives an account of the algorithms used to enable accurate speech recognition from a distance, and it will be seen that, although deep learning has a significant share in the technological breakthroughs, a clever combination with traditional signal processing can lead to surprisingly effective solutions.}}, author = {{Haeb-Umbach, Reinhold and Heymann, Jahn and Drude, Lukas and Watanabe, Shinji and Delcroix, Marc and Nakatani, Tomohiro}}, journal = {{Proceedings of the IEEE}}, number = {{2}}, pages = {{124--148}}, title = {{{Far-Field Automatic Speech Recognition}}}, doi = {{10.1109/JPROC.2020.3018668}}, volume = {{109}}, year = {{2021}}, } @inproceedings{21204, author = {{Kucklick, Jan-Peter and Müller, Oliver}}, booktitle = {{ The AAAI-21 Workshop on Knowledge Discovery from Unstructured Data in Financial Services}}, title = {{{A Comparison of Multi-View Learning Strategies for Satellite Image-based Real Estate Appraisal}}}, year = {{2021}}, } @article{21337, abstract = {{We present a flexible trust region descend algorithm for unconstrained and convexly constrained multiobjective optimization problems. It is targeted at heterogeneous and expensive problems, i.e., problems that have at least one objective function that is computationally expensive. The method is derivative-free in the sense that neither need derivative information be available for the expensive objectives nor are gradients approximated using repeated function evaluations as is the case in finite-difference methods. Instead, a multiobjective trust region approach is used that works similarly to its well-known scalar pendants. Local surrogate models constructed from evaluation data of the true objective functions are employed to compute possible descent directions. In contrast to existing multiobjective trust region algorithms, these surrogates are not polynomial but carefully constructed radial basis function networks. This has the important advantage that the number of data points scales linearly with the parameter space dimension. The local models qualify as fully linear and the corresponding general scalar framework is adapted for problems with multiple objectives. Convergence to Pareto critical points is proven and numerical examples illustrate our findings.}}, author = {{Berkemeier, Manuel Bastian and Peitz, Sebastian}}, issn = {{2297-8747}}, journal = {{Mathematical and Computational Applications}}, number = {{2}}, title = {{{Derivative-Free Multiobjective Trust Region Descent Method Using Radial Basis Function Surrogate Models}}}, doi = {{10.3390/mca26020031}}, volume = {{26}}, year = {{2021}}, } @article{21475, author = {{Frese, Daniel and Wei, Qunshuo and Wang, Yongtian and Cinchetti, Mirko and Huang, Lingling and Zentgraf, Thomas}}, issn = {{2330-4022}}, journal = {{ACS Photonics}}, number = {{4}}, pages = {{1013--1019}}, title = {{{Nonlinear Bicolor Holography Using Plasmonic Metasurfaces}}}, doi = {{10.1021/acsphotonics.1c00028}}, volume = {{8}}, year = {{2021}}, } @inproceedings{21543, abstract = {{Services often consist of multiple chained components such as microservices in a service mesh, or machine learning functions in a pipeline. Providing these services requires online coordination including scaling the service, placing instance of all components in the network, scheduling traffic to these instances, and routing traffic through the network. Optimized service coordination is still a hard problem due to many influencing factors such as rapidly arriving user demands and limited node and link capacity. Existing approaches to solve the problem are often built on rigid models and assumptions, tailored to specific scenarios. If the scenario changes and the assumptions no longer hold, they easily break and require manual adjustments by experts. Novel self-learning approaches using deep reinforcement learning (DRL) are promising but still have limitations as they only address simplified versions of the problem and are typically centralized and thus do not scale to practical large-scale networks. To address these issues, we propose a distributed self-learning service coordination approach using DRL. After centralized training, we deploy a distributed DRL agent at each node in the network, making fast coordination decisions locally in parallel with the other nodes. Each agent only observes its direct neighbors and does not need global knowledge. Hence, our approach scales independently from the size of the network. In our extensive evaluation using real-world network topologies and traffic traces, we show that our proposed approach outperforms a state-of-the-art conventional heuristic as well as a centralized DRL approach (60% higher throughput on average) while requiring less time per online decision (1 ms).}}, author = {{Schneider, Stefan Balthasar and Qarawlus, Haydar and Karl, Holger}}, booktitle = {{IEEE International Conference on Distributed Computing Systems (ICDCS)}}, keywords = {{network management, service management, coordination, reinforcement learning, distributed}}, location = {{Washington, DC, USA}}, publisher = {{IEEE}}, title = {{{Distributed Online Service Coordination Using Deep Reinforcement Learning}}}, year = {{2021}}, } @techreport{21569, abstract = {{Die kontinuierliche Weiterentwicklung des eigenen Geschäftsmodells ist für eine Organisation von entscheidender Bedeutung, um wettbewerbsfähig und somit nachhaltig erfolgreich zu bleiben. Während für die Entwicklung neuer Geschäftsmodelle häufig Workshops und einfache Software-Tools zur Visualisierung genutzt werden, wurden in der Forschung bereits erste Ansätze von datengetriebener Geschäftsmodellentwicklung (GME) vorgestellt. Diese Ansätze nutzen dabei Daten, Informationen oder auch Wissen aus internen und externen Unternehmensquellen, um den GME-Prozess zu unterstützen. Innerhalb dieses Beitrags zeigen wir einige Ansätze aus der aktuellen Literatur und analysieren wie ihre Datennutzung den GME-Prozess unterstützt. Weiterhin stellen wir mit dem BMDL Feature Modeler ein Tool vor, welches den GME-Prozess mit Expertenwissen unterstützt.}}, author = {{Gottschalk, Sebastian and Yigitbas, Enes}}, publisher = {{Gesellschaft für Informatik}}, title = {{{Von datenbasierter zu datengetriebener Geschäftsmodellentwicklung: Ein Überblick über Software-Tools und deren Datennutzung}}}, volume = {{1}}, year = {{2021}}, } @misc{21601, abstract = {{The invention describes a distributed merchandise management system, in which the client, retailer and the manufacturer are linked by a network. This is implemented by a cloud storage (105), the cloud storage (105) comprising a means (105 a) for storing data, a means for receiving first data from a first network node (110), the first data being associated with a physical object, a means for receiving request data from a second network node (120), a means for receiving second data from a third network node (130), the second data being associated with the first data and comprising at least one data piece adapted to change the first data depending on the received request data, a means for changing the first data based at least in part on the second data and the request data, and a means for sending a changed portion of the first data from the cloud storage (105) to the first network node (110).}}, author = {{Göllner, Thomas and Schwarz, Jan-Hendrik and Gottschalk, Sebastian and Sauer, Stefan}}, title = {{{Distributed merchandise management system}}}, year = {{2021}}, } @article{21631, abstract = {{Secret sharing is a well-established cryptographic primitive for storing highly sensitive information like encryption keys for encoded data. It describes the problem of splitting a secret into different shares, without revealing any information to its shareholders. Here, we demonstrate an all-optical solution for secret sharing based on metasurface holography. In our concept, metasurface holograms are used as spatially separable shares that carry encrypted messages in the form of holographic images. Two of these shares can be recombined by bringing them close together. Light passing through this stack of metasurfaces accumulates the phase shift of both holograms and optically reconstructs the secret with high fidelity. In addition, the hologram generated by each single metasurface can uniquely identify its shareholder. Furthermore, we demonstrate that the inherent translational alignment sensitivity between two stacked metasurface holograms can be used for spatial multiplexing, which can be further extended to realize optical rulers.}}, author = {{Georgi, Philip and Wei, Qunshuo and Sain, Basudeb and Schlickriede, Christian and Wang, Yongtian and Huang, Lingling and Zentgraf, Thomas}}, issn = {{2375-2548}}, journal = {{Science Advances}}, number = {{16}}, title = {{{Optical secret sharing with cascaded metasurface holography}}}, doi = {{10.1126/sciadv.abf9718}}, volume = {{7}}, year = {{2021}}, } @inproceedings{21637, author = {{Lienen, Julian and Hüllermeier, Eyke}}, booktitle = {{Proceedings of the 35th AAAI Conference on Artificial Intelligence, AAAI}}, location = {{Online}}, number = {{10}}, pages = {{8583--8591}}, publisher = {{AAAI Press}}, title = {{{From Label Smoothing to Label Relaxation}}}, volume = {{35}}, year = {{2021}}, } @inproceedings{21639, abstract = {{The development of effective business models is an essential task in highly competitive markets like mobile ecosystems. Existing development methods for these business models do not specifically focus that the development process profoundly depends on the situation (e.g., market size, regulations) of the mobile app developer. Here, a mismatch between method and situation can lead to poor resource management and longer development cycles. In software engineering, situational method engineering is used for software projects to configure a development method out of a method repository based on the project situation. Analogously, we support creating situation-specific business model development methods with a method base and new user roles. Here, the method engineer obtains the knowledge of the domain expert and stores it in the method base as elements, building blocks, and patterns. The expert knowledge is derived from a grey literature review on mobile development processes. After this, the method engineer constructs the development method based on the described situation of the business developer. We provide an open-source tool and evaluate it by constructing a local event platform's business model development method. }}, author = {{Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}}, booktitle = {{Enterprise, Business-Process and Information Systems Modeling}}, keywords = {{Business Model Development, Situational Method Engineering, Mobile App, Business Model Development Tools}}, publisher = {{Springer}}, title = {{{Situation-specific Business Model Development Methods for Mobile App Developers}}}, doi = {{10.1007/978-3-030-79186-5_17}}, year = {{2021}}, } @article{23526, abstract = {{Modern and flexible application-level software platforms increase the attack surface of connected vehicles and thereby require automotive engineers to adopt additional security control techniques. These techniques encompass host-based intrusion detection systems (HIDSs) that detect suspicious activities in application contexts. Such application-aware HIDSs originate in information and communications technology systems and have a great potential to deal with the flexible nature of application-level software platforms. However, the elementary characteristics of known application-aware HIDS approaches and thereby the implications for their transfer to the automotive sector are unclear. In previous work, we presented a systematic literature review (SLR) covering the state of the art of application-aware HIDS approaches. We synthesized our findings by means of a fine-grained classification for each approach specified through a feature model and corresponding variant models. These models represent the approaches’ elementary characteristics. Furthermore, we summarized key findings and inferred implications for the transfer of application-aware HIDSs to the automotive sector. In this article, we extend the previous work by several aspects. We adjust the quality evaluation process within the SLR to be able to consider high quality conference publications, which results in an extended final pool of publications. For supporting HIDS developers on the task of configuring HIDS analysis techniques based on machine learning, we report on initial results on the applicability of AutoML. Furthermore, we present lessons learned regarding the application of the feature and variant model approach for SLRs. Finally, we more thoroughly describe the SLR study design.}}, author = {{Schubert, David and Eikerling, Hendrik and Holtmann, Jörg}}, issn = {{2624-9898}}, journal = {{Frontiers in Computer Science}}, publisher = {{Frontiers Media}}, title = {{{Application-Aware Intrusion Detection: A Systematic Literature Review, Implications for Automotive Systems, and Applicability of AutoML}}}, doi = {{10.3389/fcomp.2021.567873}}, volume = {{3}}, year = {{2021}}, } @inproceedings{23708, author = {{Nouri, Zahra and Gadiraju, Ujwal and Engels, Gregor and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 32nd ACM Conference on Hypertext and Social Media}}, pages = {{165--175}}, title = {{{What Is Unclear? Computational Assessment of Task Clarity in Crowdsourcing}}}, year = {{2021}}, } @inproceedings{23760, abstract = {{The laser sintering process has been a well-established AM process for many years. Disadvantages of LS are the low material variety and the thermal damage of the unprocessed material. The low temperature laser sintering attacks at this point and processes powder material at a build chamber temperature lower than the recrystallization temperature. This drastic reduction in temperature results in significantly less thermal damage to the material. This work deals with the low temperature laser sintering of Polyamide 12 (PA12) on a commercial, unmodified laser sintering system to compare it to standard laser sintered PA12 and to create the basis for low temperature laser sintering of high temperature materials on such a system. First results by changing the exposure parameters and by fixing parts on a building platform show a processing of PA12 on an EOS P396 at a build chamber temperature less than 100 °C instead of standard approx. 175 °C.}}, author = {{Menge, Dennis and Schmid, Hans-Joachim}}, keywords = {{Low Temp LS, Low Temperature Laser Sintering, Polyamid 12}}, location = {{Austin, TX}}, title = {{{Low Temperature Laser Sintering on a Standard System: First Attempts and Results with PA12}}}, year = {{2021}}, } @article{20592, abstract = {{GaAs-(111)-nanostructures exhibiting second harmonic generation are new building blocks in nonlinear optics. Such structures can be fabricated through epitaxial lift-off using selective etching of Al-containing layers and subsequent transfer to glass substrates. Herein, the selective etching of (111)B-oriented AlxGa1−xAs sacrificial layers (10–50 nm thick) with different aluminum concentrations (x = 0.5–1.0) in 10\% hydrofluoric acid is investigated and compared with standard (100)-oriented structures. The thinner the sacrificial layer and the lower the aluminum content, the lower the lateral etch rate. For both orientations, the lateral etch rates are in the same order of magnitude, but some quantitative differences exist. Furthermore, the epitaxial lift-off, the transfer, and the nanopatterning of thin (111)B-oriented GaAs membranes are demonstrated. Atomic force microscopy and high-resolution X-ray diffraction measurements reveal the high structural quality of the transferred GaAs-(111) films.}}, author = {{Henksmeier, Tobias and Eppinger, Martin and Reineke, Bernhard and Zentgraf, Thomas and Meier, Cedrik and Reuter, Dirk}}, journal = {{physica status solidi (a)}}, keywords = {{epitaxial lift-off, GaAs/AlxGa1−xAs heterostructures, selective etching}}, number = {{3}}, pages = {{2000408}}, title = {{{Selective Etching of (111)B-Oriented AlxGa1−xAs-Layers for Epitaxial Lift-Off}}}, doi = {{https://doi.org/10.1002/pssa.202000408}}, volume = {{218}}, year = {{2021}}, } @inproceedings{20693, abstract = {{In practical, large-scale networks, services are requested by users across the globe, e.g., for video streaming. Services consist of multiple interconnected components such as microservices in a service mesh. Coordinating these services requires scaling them according to continuously changing user demand, deploying instances at the edge close to their users, and routing traffic efficiently between users and connected instances. Network and service coordination is commonly addressed through centralized approaches, where a single coordinator knows everything and coordinates the entire network globally. While such centralized approaches can reach global optima, they do not scale to large, realistic networks. In contrast, distributed approaches scale well, but sacrifice solution quality due to their limited scope of knowledge and coordination decisions. To this end, we propose a hierarchical coordination approach that combines the good solution quality of centralized approaches with the scalability of distributed approaches. In doing so, we divide the network into multiple hierarchical domains and optimize coordination in a top-down manner. We compare our hierarchical with a centralized approach in an extensive evaluation on a real-world network topology. Our results indicate that hierarchical coordination can find close-to-optimal solutions in a fraction of the runtime of centralized approaches.}}, author = {{Schneider, Stefan Balthasar and Jürgens, Mirko and Karl, Holger}}, booktitle = {{IFIP/IEEE International Symposium on Integrated Network Management (IM)}}, keywords = {{network management, service management, coordination, hierarchical, scalability, nfv}}, location = {{Bordeaux, France}}, publisher = {{IFIP/IEEE}}, title = {{{Divide and Conquer: Hierarchical Network and Service Coordination}}}, year = {{2021}}, } @inproceedings{22155, author = {{Gottschalk, Sebastian}}, booktitle = {{Advanced Software Engineering. Doctorial Consortium}}, publisher = {{CEUR}}, title = {{{Situation-specific Development of Business Models for Services in Software Ecosystems}}}, year = {{2021}}, } @inproceedings{22156, abstract = {{Word embedding models reflect bias towards genders, ethnicities, and other social groups present in the underlying training data. Metrics such as ECT, RNSB, and WEAT quantify bias in these models based on predefined word lists representing social groups and bias-conveying concepts. How suitable these lists actually are to reveal bias - let alone the bias metrics in general - remains unclear, though. In this paper, we study how to assess the quality of bias metrics for word embedding models. In particular, we present a generic method, Bias Silhouette Analysis (BSA), that quantifies the accuracy and robustness of such a metric and of the word lists used. Given a biased and an unbiased reference embedding model, BSA applies the metric systematically for several subsets of the lists to the models. The variance and rate of convergence of the bias values of each model then entail the robustness of the word lists, whereas the distance between the models' values gives indications of the general accuracy of the metric with the word lists. We demonstrate the behavior of BSA on two standard embedding models for the three mentioned metrics with several word lists from existing research.}}, author = {{Spliethöver, Maximilian and Wachsmuth, Henning}}, booktitle = {{Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI-21}}, location = {{Online}}, pages = {{552--559}}, title = {{{Bias Silhouette Analysis: Towards Assessing the Quality of Bias Metrics for Word Embedding Models}}}, doi = {{10.24963/ijcai.2021/77}}, year = {{2021}}, } @inproceedings{22158, author = {{Syed, Shahbaz and Al-Khatib, Khalid and Alshomary, Milad and Wachsmuth, Henning and Potthast, Martin}}, booktitle = {{Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021): Findings}}, pages = {{3482--3493}}, title = {{{Generating Informative Conclusions for Argumentative Texts}}}, year = {{2021}}, } @inproceedings{22159, author = {{Barrow, Joe and Jain, Rajiv and Lipka, Nedim and Dernoncourt, Franck and Morariu, Vlad and Manjunatha, Varun and Oard, Douglas and Resnik, Philip and Wachsmuth, Henning}}, booktitle = {{Proceedings of the Joint Conference of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (ACL-IJCNLP 2021)}}, pages = {{1583--1595}}, title = {{{Syntopical Graphs for Computational Argumentation Tasks}}}, year = {{2021}}, } @misc{22304, author = {{Schott, Stefan}}, title = {{{Android App Analysis Benchmark Case Generation}}}, year = {{2021}}, } @article{22450, abstract = {{We realize and investigate a nonlinear metasurface taking advantage of intersubband transitions in ultranarrow GaN/AlN multi-quantum well heterostructures. Owing to huge band offsets, the structures offer resonant transitions in the telecom window around 1.55 µm. These heterostructures are functionalized with an array of plasmonic antennas featuring cross-polarized resonances at these near-infrared wavelengths and their second harmonic. This kind of nonlinear metasurface allows for substantial second-harmonic generation at normal incidence which is completely absent for an antenna array without the multi-quantum well structure underneath. While the second harmonic is originally radiated only into the plane of the quantum wells, a proper geometrical arrangement of the plasmonic elements permits the redirection of the second-harmonic light to free-space radiation, which is emitted perpendicular to the surface.}}, author = {{Mundry, Jan and Spreyer, Florian and Jmerik, Valentin and Ivanov, Sergey and Zentgraf, Thomas and Betz, Markus}}, issn = {{2159-3930}}, journal = {{Optical Materials Express}}, number = {{7}}, publisher = {{OSA}}, title = {{{Nonlinear metasurface combining telecom-range intersubband transitions in GaN/AlN quantum wells with resonant plasmonic antenna arrays}}}, doi = {{10.1364/ome.426236}}, volume = {{11}}, year = {{2021}}, } @unpublished{22509, abstract = {{Self-training is an effective approach to semi-supervised learning. The key idea is to let the learner itself iteratively generate "pseudo-supervision" for unlabeled instances based on its current hypothesis. In combination with consistency regularization, pseudo-labeling has shown promising performance in various domains, for example in computer vision. To account for the hypothetical nature of the pseudo-labels, these are commonly provided in the form of probability distributions. Still, one may argue that even a probability distribution represents an excessive level of informedness, as it suggests that the learner precisely knows the ground-truth conditional probabilities. In our approach, we therefore allow the learner to label instances in the form of credal sets, that is, sets of (candidate) probability distributions. Thanks to this increased expressiveness, the learner is able to represent uncertainty and a lack of knowledge in a more flexible and more faithful manner. To learn from weakly labeled data of that kind, we leverage methods that have recently been proposed in the realm of so-called superset learning. In an exhaustive empirical evaluation, we compare our methodology to state-of-the-art self-supervision approaches, showing competitive to superior performance especially in low-label scenarios incorporating a high degree of uncertainty.}}, author = {{Lienen, Julian and Hüllermeier, Eyke}}, booktitle = {{arXiv:2106.11853}}, title = {{{Credal Self-Supervised Learning}}}, year = {{2021}}, } @inproceedings{22514, author = {{Kucklick, Jan-Peter and Müller, Jennifer and Beverungen, Daniel and Müller, Oliver}}, booktitle = {{European Conference on Information Systems}}, location = {{Virtual}}, title = {{{Quantifying the Impact of Location Data for Real Estate Appraisal – A GIS-based Deep Learning Approach}}}, year = {{2021}}, } @article{22518, author = {{Triebus, Marcel and Gierse, Jan and Marten, Thorsten and Tröster, Thomas}}, issn = {{1757-8981}}, journal = {{IOP Conference Series: Materials Science and Engineering}}, location = {{Virtual - Stuttgart}}, publisher = {{IOP Publishing Ltd}}, title = {{{A new Device for Determination of Forming-Limit-Curves under Hot-Forming Conditions}}}, doi = {{10.1088/1757-899x/1157/1/012052}}, year = {{2021}}, } @article{22523, abstract = {{The containment of COVID-19 critically hinges on individuals’ behavior. We investigate how individuals react to variations in COVID-19 reporting. Using a survey, we elicit individuals' perceived infection risk given various COVID-19 metrics (e.g., confirmed cases, reproduction rate, or case-fatality ratio). We proxy individuals' risk perception with their willingness to pay for the participation in everyday life and amusements events. We find that participants react to different COVID-19 metrics with varying sensitivity. We observe a saturation of sensitivity for several measures at critical limits used in the political discussion, making our results highly relevant for policy makers in their efforts to direct individuals to adhere to hygienic etiquette and social distancing guidelines.}}, author = {{Warkulat, Sonja and Krull, Sebastian and Ortmann, Regina and Klocke, Nina and Pelster, Matthias}}, journal = {{Covid Economics}}, keywords = {{COVID-19 reporting, willingness to pay, willingness to accept}}, number = {{83}}, pages = {{183--205}}, publisher = {{CEPR Press}}, title = {{{COVID-19 reporting and willingness to pay for leisure activities}}}, year = {{2021}}, } @article{21808, abstract = {{Modern services consist of interconnected components,e.g., microservices in a service mesh or machine learning functions in a pipeline. These services can scale and run across multiple network nodes on demand. To process incoming traffic, service components have to be instantiated and traffic assigned to these instances, taking capacities, changing demands, and Quality of Service (QoS) requirements into account. This challenge is usually solved with custom approaches designed by experts. While this typically works well for the considered scenario, the models often rely on unrealistic assumptions or on knowledge that is not available in practice (e.g., a priori knowledge). We propose DeepCoord, a novel deep reinforcement learning approach that learns how to best coordinate services and is geared towards realistic assumptions. It interacts with the network and relies on available, possibly delayed monitoring information. Rather than defining a complex model or an algorithm on how to achieve an objective, our model-free approach adapts to various objectives and traffic patterns. An agent is trained offline without expert knowledge and then applied online with minimal overhead. Compared to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput (up to 76%) and overall network utility (more than 2x) on realworld network topologies and traffic traces. It also supports optimizing multiple, possibly competing objectives, learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic traffic, and scales to large real-world networks. For reproducibility and reuse, our code is publicly available.}}, author = {{Schneider, Stefan Balthasar and Khalili, Ramin and Manzoor, Adnan and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Hecker, Artur}}, journal = {{Transactions on Network and Service Management}}, keywords = {{network management, service management, coordination, reinforcement learning, self-learning, self-adaptation, multi-objective}}, publisher = {{IEEE}}, title = {{{Self-Learning Multi-Objective Service Coordination Using Deep Reinforcement Learning}}}, doi = {{10.1109/TNSM.2021.3076503}}, year = {{2021}}, } @article{21815, abstract = {{Sowohl Berufsethos als auch Berufswahlmotivation tragen zu relevanten lern-, leistungs- und laufbahnbedingenden Prozessen eines Individuums bei und prägen dessen Lebensverlauf wesentlich. Während die Berufswahlmotivation bereits verstärkt im wirtschaftspädagogischen Kontext untersucht wurde, existieren zum Berufsethos von Wirtschaftspädagog*innen nur vereinzelt empirische Studien. So ist beispielsweise wenig darüber bekannt, wie das Berufsethos von Wirtschaftspädagog*innen in der Ausbildungsphase ausgeprägt ist. Auch die Erforschung des Zusammenhangs zwischen den Konstrukten des Berufsethos und der Berufswahlmotivation blieb bisher unbeachtet. In diesem Beitrag wird entsprechend dieses Forschungsdesiderats untersucht, wie das anfänglich ausgebildete Berufsethos von Wirtschaftspädagogikstudierenden in der universitären Ausbildung ausgeprägt ist, ob sich die Ausprägung nach dem angegebenen Berufswunsch der Studierenden unterscheidet und inwiefern das anfänglich ausgeprägte Berufsethos mit der Berufswahlmotivation von Studierenden zusammenhängt. Dafür wurden im Wintersemester 2019/20 an zwölf deutschen Universitäten insgesamt 879 Wirtschaftspädagogikstudierende schriftlich befragt. Die Ergebnisse zeigen, dass das anfängliche Berufsethos der Befragten bereits in der universitären Ausbildungsphase relativ stark ausgeprägt ist. Weiterhin ist zu erkennen, dass das Berufsethos bei angehenden Wirtschaftspädagog*innen, die den Berufswunsch Lehrkraft haben, ausgeprägter ist als bei Wirtschaftspädagogikstudierenden, die eine Tätigkeit außerhalb des Schuldienstes anstreben bzw. noch unentschlossen sind. Letztlich kann aufgezeigt werden, dass grundsätzlich positive Zusammenhänge zwischen dem anfänglich ausgeprägten Berufsethos und der Berufswahlmotivation von angehenden Wirtschaftspädagog*innen bestehen.}}, author = {{Goller, Michael and Ziegler, Simone}}, issn = {{1618-8543}}, journal = {{bwp@ Spezial}}, keywords = {{Berufsethos, Berufswahlmotivation, Wirtschaftspädagogik, Studierende}}, pages = {{1--28}}, title = {{{Zum Zusammenhang von Berufsethos und der Berufswahlmotivation angehender Wirtschaftspädagog*innen}}}, volume = {{18}}, year = {{2021}}, } @article{21820, abstract = {{The reduction of high-dimensional systems to effective models on a smaller set of variables is an essential task in many areas of science. For stochastic dynamics governed by diffusion processes, a general procedure to find effective equations is the conditioning approach. In this paper, we are interested in the spectrum of the generator of the resulting effective dynamics, and how it compares to the spectrum of the full generator. We prove a new relative error bound in terms of the eigenfunction approximation error for reversible systems. We also present numerical examples indicating that, if Kramers–Moyal (KM) type approximations are used to compute the spectrum of the reduced generator, it seems largely insensitive to the time window used for the KM estimators. We analyze the implications of these observations for systems driven by underdamped Langevin dynamics, and show how meaningful effective dynamics can be defined in this setting.}}, author = {{Nüske, Feliks and Koltai, Péter and Boninsegna, Lorenzo and Clementi, Cecilia}}, issn = {{1099-4300}}, journal = {{Entropy}}, title = {{{Spectral Properties of Effective Dynamics from Conditional Expectations}}}, doi = {{10.3390/e23020134}}, year = {{2021}}, } @article{21932, abstract = {{Gaussian-beam-like bundles of semi-guided waves propagating in a dielectric slab can excite modes with high-order optical angular momentum supported by a circular fiber. We consider a multimode step-index fiber with a high-index coating, where the waves in the slab are evanescently coupled to the modes of the fiber. Conditions for effective resonant interaction are identified. Based on a hybrid analytical–numerical coupled mode model, our simulations predict that substantial fractions of the input power can be focused into waves with specific orbital angular momentum, of excellent purity, with a clear distinction between degenerate modes with opposite vorticity.}}, author = {{Hammer, Manfred and Ebers, Lena and Förstner, Jens}}, issn = {{0740-3224}}, journal = {{Journal of the Optical Society of America B}}, keywords = {{tet_topic_waveguides}}, number = {{5}}, pages = {{1717}}, title = {{{Resonant evanescent excitation of guided waves with high-order optical angular momentum}}}, doi = {{10.1364/josab.422731}}, volume = {{38}}, year = {{2021}}, } @article{16867, abstract = {{In this article, we present an efficient descent method for locally Lipschitz continuous multiobjective optimization problems (MOPs). The method is realized by combining a theoretical result regarding the computation of descent directions for nonsmooth MOPs with a practical method to approximate the subdifferentials of the objective functions. We show convergence to points which satisfy a necessary condition for Pareto optimality. Using a set of test problems, we compare our method to the multiobjective proximal bundle method by M\"akel\"a. The results indicate that our method is competitive while being easier to implement. While the number of objective function evaluations is larger, the overall number of subgradient evaluations is lower. Finally, we show that our method can be combined with a subdivision algorithm to compute entire Pareto sets of nonsmooth MOPs.}}, author = {{Gebken, Bennet and Peitz, Sebastian}}, journal = {{Journal of Optimization Theory and Applications}}, pages = {{696--723}}, title = {{{An efficient descent method for locally Lipschitz multiobjective optimization problems}}}, doi = {{10.1007/s10957-020-01803-w}}, volume = {{188}}, year = {{2021}}, } @article{16295, abstract = {{It is a challenging task to identify the objectives on which a certain decision was based, in particular if several, potentially conflicting criteria are equally important and a continuous set of optimal compromise decisions exists. This task can be understood as the inverse problem of multiobjective optimization, where the goal is to find the objective function vector of a given Pareto set. To this end, we present a method to construct the objective function vector of an unconstrained multiobjective optimization problem (MOP) such that the Pareto critical set contains a given set of data points with prescribed KKT multipliers. If such an MOP can not be found, then the method instead produces an MOP whose Pareto critical set is at least close to the data points. The key idea is to consider the objective function vector in the multiobjective KKT conditions as variable and then search for the objectives that minimize the Euclidean norm of the resulting system of equations. By expressing the objectives in a finite-dimensional basis, we transform this problem into a homogeneous, linear system of equations that can be solved efficiently. Potential applications of this approach include the identification of objectives (both from clean and noisy data) and the construction of surrogate models for expensive MOPs.}}, author = {{Gebken, Bennet and Peitz, Sebastian}}, journal = {{Journal of Global Optimization}}, pages = {{3--29}}, publisher = {{Springer}}, title = {{{Inverse multiobjective optimization: Inferring decision criteria from data}}}, doi = {{10.1007/s10898-020-00983-z}}, volume = {{80}}, year = {{2021}}, } @article{28255, abstract = {{Topological photonic crystals (TPhCs) provide robust manipulation of light with built-in immunity to fabrication tolerances and disorder. Recently, it was shown that TPhCs based on weak topology with a dislocation inherit this robustness and further host topologically protected lower-dimensional localized modes. However, TPhCs with weak topology at optical frequencies have not been demonstrated so far. Here, we use scattering-type scanning near-field optical microscopy to verify mid-bandgap zero-dimensional light localization close to 100 THz in a TPhC with nontrivial Zak phase and an edge dislocation. We show that because of the weak topology, differently extended dislocation centers induce similarly strong light localization. The experimental results are supported by full-field simulations. Along with the underlying fundamental physics, our results lay a foundation for the application of TPhCs based on weak topology in active topological nanophotonics, and nonlinear and quantum optic integrated devices because of their strong and robust light localization.}}, author = {{Lu, Jinlong and Wirth, Konstantin G. and Gao, Wenlong and Heßler, Andreas and Sain, Basudeb and Taubner, Thomas and Zentgraf, Thomas}}, issn = {{2375-2548}}, journal = {{Science Advances}}, number = {{49}}, title = {{{Observing 0D subwavelength-localized modes at ~100 THz protected by weak topology}}}, doi = {{10.1126/sciadv.abl3903}}, volume = {{7}}, year = {{2021}}, } @inproceedings{21598, abstract = {{Static analysis is used to automatically detect bugs and security breaches, and aids compileroptimization. Whole-program analysis (WPA) can yield high precision, however causes long analysistimes and thus does not match common software-development workflows, making it often impracticalto use for large, real-world applications.This paper thus presents the design and implementation ofModAlyzer, a novel static-analysisapproach that aims at accelerating whole-program analysis by making the analysis modular andcompositional. It shows how to computelossless, persisted summaries for callgraph, points-to anddata-flow information, and it reports under which circumstances this function-level compositionalanalysis outperforms WPA.We implementedModAlyzeras an extension to LLVM and PhASAR, and applied it to 12 real-world C and C++ applications. At analysis time,ModAlyzermodularly and losslessly summarizesthe analysis effect of the library code those applications share, hence avoiding its repeated re-analysis.The experimental results show that the reuse of these summaries can save, on average, 72% ofanalysis time over WPA. Moreover, because it is lossless, the module-wise analysis fully retainsprecision and recall. Surprisingly, as our results show, it sometimes even yields precision superior toWPA. The initial summary generation, on average, takes about 3.67 times as long as WPA.}}, author = {{Schubert, Philipp and Hermann, Ben and Bodden, Eric}}, booktitle = {{European Conference on Object-Oriented Programming (ECOOP)}}, title = {{{Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis}}}, year = {{2021}}, } @inproceedings{20807, author = {{Bielak, Christian Roman and Böhnke, Max and Bobbert, Mathias and Meschut, Gerson}}, location = {{Lüttich}}, title = {{{Further development of a numerical method for analyzing the load capacity of clinched joints in versatile process chains}}}, doi = {{10.25518/esaform21.4298}}, year = {{2021}}, } @phdthesis{27284, author = {{Wever, Marcel Dominik}}, title = {{{Automated Machine Learning for Multi-Label Classification}}}, doi = {{10.17619/UNIPB/1-1302}}, year = {{2021}}, } @article{25476, abstract = {{This study deals with the damage behavior of metallic materials by the application of different manufacturing processes and using different optical measurement methods to identify the crack initiation in the damage specimen. The study is intended to highlight the importance of considering manufacturing processes and optical measurement methods in a numerical simulation when analyzing the damage behavior of metallic materials. To describe the damage behavior of the material in the process chain simulations, it is important to calibrate the parameters of damage model more accurately. These parameters are determined using experimental investigation of desired damage specimens. In this regard, a selected damage specimen manufactured by different cutting processes is first experimentally and then numerically investigated. It is shown that the manufacturing process and the optical measurement methods influence the stress state analyzed in the numerical simulation.}}, author = {{Otroshi, Mortaza and Meschut, Gerson and Nesakumar, Aathavan}}, journal = {{Journal of Manufacturing Engineering}}, keywords = {{Damage behaviour, Stress triaxiality, Manufacturing process and Optical measurement}}, number = {{3}}, pages = {{70--76}}, title = {{{The influence of manufacturing processes and optical measurement methods on the damage behavior of HX340LAD micro-alloyed steels}}}, doi = {{https://doi.org/10.37255/jme.v16i3pp070-076}}, volume = {{16}}, year = {{2021}}, } @inproceedings{21093, abstract = {{Requirements for energy distribution networks are changing fast due to the growing share of renewable energy, increasing electrification, and novel consumer and asset technologies. Since uncertainties about future developments increase planning difficulty, flexibility potentials such as synergies between the electricity, gas, heat, and transport sector often remain unused. In this paper, we therefore present a novel module-based concept for a decision support system that helps distribution network planners to identify cross-sectoral synergies and to select optimal network assets such as transformers, cables, pipes, energy storage systems or energy conversion technology. The concept enables long-term transformation plans and supports distribution network planners in designing reliable, sustainable and cost-efficient distribution networks for future demands.}}, author = {{Kirchhoff, Jonas and Burmeister, Sascha Christian and Weskamp, Christoph and Engels, Gregor}}, booktitle = {{Energy Informatics and Electro Mobility ICT}}, editor = {{Breitner, Michael H. and Lehnhoff, Sebastian and Nieße, Astrid and Staudt, Philipp and Weinhardt, Christof and Werth, Oliver}}, title = {{{Towards a Decision Support System for Cross-Sectoral Energy Distribution Network Planning}}}, year = {{2021}}, } @article{20212, abstract = {{Ideational impact refers to the uptake of a paper's ideas and concepts by subsequent research. It is defined in stark contrast to total citation impact, a measure predominantly used in research evaluation that assumes that all citations are equal. Understanding ideational impact is critical for evaluating research impact and understanding how scientific disciplines build a cumulative tradition. Research has only recently developed automated citation classification techniques to distinguish between different types of citations and generally does not emphasize the conceptual content of the citations and its ideational impact. To address this problem, we develop Deep Content-enriched Ideational Impact Classification (Deep-CENIC) as the first automated approach for ideational impact classification to support researchers' literature search practices. We evaluate Deep-CENIC on 1,256 papers citing 24 information systems review articles from the IT business value domain. We show that Deep-CENIC significantly outperforms state-of-the-art benchmark models. We contribute to information systems research by operationalizing the concept of ideational impact, designing a recommender system for academic papers based on deep learning techniques, and empirically exploring the ideational impact of the IT business value domain. }}, author = {{Prester, Julian and Wagner, Gerit and Schryen, Guido and Hassan, Nik Rushdi}}, journal = {{Decision Support Systems}}, keywords = {{Ideational impact, citation classification, academic recommender systems, natural language processing, deep learning, cumulative tradition}}, number = {{January}}, title = {{{Classifying the Ideational Impact of Information Systems Review Articles: A Content-Enriched Deep Learning Approach}}}, volume = {{140}}, year = {{2021}}, } @article{20844, abstract = {{Review papers are essential for knowledge development in IS. While some are cited twice a day, others accumulate single digit citations over a decade. The magnitude of these differences prompts us to analyze what distinguishes those reviews that have proven to be integral to scientific progress from those that might be considered less impactful. Our results highlight differences between reviews aimed at describing, understanding, explaining, and theory testing. Beyond the control variables, they demonstrate the importance of methodological transparency and the development of research agendas. These insights inform all stakeholders involved in the development and publication of review papers.}}, author = {{Wagner, Gerit and Prester, Julian and Roche, Maria and Schryen, Guido and Benlian, Alexander and Paré, Guy and Templier, Mathieu}}, journal = {{Information & Management}}, keywords = {{Literature review, review papers, scientometric, scientific impact, citation analysis}}, number = {{3}}, title = {{{Which Factors Affect the Scientific Impact of Review Papers in IS Research? A Scientometric Study}}}, volume = {{58}}, year = {{2021}}, } @article{23494, author = {{Stumpe, Miriam and Rößler, David and Schryen, Guido and Kliewer, Natalia}}, journal = {{EURO Journal on Transportation and Logistics}}, title = {{{Study on Sensitivity of Electric Bus Systems under Simultaneous Optimization of Charging Infrastructure and Vehicle Schedules}}}, doi = {{https://doi.org/10.1016/j.ejtl.2021.100049}}, volume = {{10}}, year = {{2021}}, } @article{17934, author = {{Wagner, Gerit and Prester, Julian and Schryen, Guido}}, journal = {{Communications of the Association for Information Systems}}, number = {{1}}, title = {{{Exploring the Scientific Impact of Information Systems Design Science Research}}}, volume = {{48}}, year = {{2021}}, } @phdthesis{32057, abstract = {{Ein zentraler Aspekt bei der Untersuchung dynamischer Systeme ist die Analyse ihrer invarianten Mengen wie des globalen Attraktors und (in)stabiler Mannigfaltigkeiten. Insbesondere wenn das zugrunde liegende System von einem Parameter abhängt, ist es entscheidend, sie im Bezug auf diesen Parameter effizient zu verfolgen. Für die Berechnung invarianter Mengen stützen wir uns für ihre Approximation auf numerische Algorithmen. Typischerweise können diese Methoden jedoch nur auf endlich-dimensionale dynamische Systeme angewendet werden. In dieser Arbeit präsentieren wir daher einen numerischen Rahmen für die globale dynamische Analyse unendlich-dimensionaler Systeme. Wir werden Einbettungstechniken verwenden, um das core dynamical system (CDS) zu definieren, welches ein dynamisch äquivalentes endlich-dimensionales System ist.Das CDS wird dann verwendet, um eingebettete invariante Mengen, also eins-zu-eins Bilder, mittels Mengen-orientierten numerischen Methoden zu approximieren. Bei der Konstruktion des CDS ist es entscheidend, eine geeignete Beobachtungsabbildung auszuwählen und die geeignete inverse Abbildung zu entwerfen. Dazu werden wir geeignete numerische Implementierungen des CDS für DDEs und PDEs vorstellen. Für eine nachfolgende geometrische Analyse der eingebetteten invarianten Menge betrachten wir eine Lerntechnik namens diffusion maps, die ihre intrinsische Geometrie enthüllt sowie ihre Dimension schätzt. Schließlich wenden wir unsere entwickelten numerischen Methoden an einigen bekannten unendlich-dimensionale dynamischen Systeme an, wie die Mackey-Glass-Gleichung, die Kuramoto-Sivashinsky-Gleichung und die Navier-Stokes-Gleichung.}}, author = {{Gerlach, Raphael}}, title = {{{The Computation and Analysis of Invariant Sets of Infinite-Dimensional Systems}}}, doi = {{10.17619/UNIPB/1-1278}}, year = {{2021}}, } @inbook{32150, author = {{Karsten, Andrea}}, booktitle = {{Schreiblehrkonzepte an Hochschulen. Fallstudien und Reflexionen zum fachspezifischen Schreibenlehren und -lernen}}, editor = {{Lahm, Swantje and Meyhöfer, Frank and Neumann, Friederike}}, pages = {{277 -- 288}}, publisher = {{wbv}}, title = {{{Einblicke in explizite und implizite Erwartungen Lehrender an Studierendentexte. Textbasierte Interviews zu Zielen und Erträgen von fachsensiblem Peer-Textfeedback}}}, doi = {{10.3278/6004807w277}}, volume = {{4}}, year = {{2021}}, } @inproceedings{24017, abstract = {{In developing complex technical systems, requirements are subject to continuous change. Systematic and holistic change impact analysis and proactive measures are required for reducing the number of requirement changes and their negative impact. There is no method to analyse the holistic impact of a requirement change in the context of developing complex technical systems. Holistic analysis requires to consider the local effects of requirement changes as well as effects from change propagation. To develop an approach for holistic change propagation and impact analysis, twelve performance goals are defined. Those are derived from a state of research analysis as well as an industry workshop. A three-step method is proposed. Firstly, requirement dependencies that cause change propagation are detected. Secondly, critical requirements are automatically identified based on a Page Rank algorithm. Thirdly, change impact of critical requirements is analysed based on a guideline. Validation proves that ten goals are fulfilled and two are partly fulfilled. The method addresses major shortcomings of preceding research and enables sound decision making for development engineers both before a change occurs and during decision process on a change request. This helps to reduce negative change impact in development projects and the risk of project failure.}}, author = {{Gräßler, Iris and Oleff, Christian and Preuß, Daniel}}, editor = {{Wagner, Beverly and Wilson, Juliette}}, location = {{Strathclyde/Glasgow}}, title = {{{Holistic change propagation and impact analysis in requirements management}}}, year = {{2021}}, } @unpublished{26645, author = {{Bobolz, Jan and Eidens, Fabian and Heitjohann, Raphael and Fell, Jeremy}}, publisher = {{IACR eprint}}, title = {{{Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes}}}, year = {{2021}}, }