@article{31071, abstract = {{Distributed, software-intensive systems (e.g., in the automotive sector) must fulfill communication requirements under hard real-time constraints. The requirements have to be documented and validated carefully using a systematic requirements engineering (RE) approach, for example, by applying scenario-based requirements notations. The resources of the execution platforms and their properties (e.g., CPU frequency or bus throughput) induce effects on the timing behavior, which may lead to violations of the real-time requirements. Nowadays, the platform properties and their induced timing effects are verified against the real-time requirements by means of timing analysis techniques mostly implemented in commercial-off-the-shelf tools. However, such timing analyses are conducted in late development phases since they rely on artifacts produced during these phases (e.g., the platform-specific code). In order to enable early timing analyses already during RE, we extend a scenario-based requirements notation with allocation means to platform models and define operational semantics for the purpose of simulation-based, platform-aware timing analyses. We illustrate and evaluate the approach with an automotive software-intensive system.}}, author = {{Holtmann, Jörg and Deantoni, Julien and Fockel, Markus}}, issn = {{1619-1366}}, journal = {{Software and Systems Modeling}}, keywords = {{Modeling and Simulation, Software}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Early timing analysis based on scenario requirements and platform models}}}, doi = {{10.1007/s10270-022-01002-3}}, year = {{2022}}, } @article{30739, author = {{Ring, Julia and Tadic, Jelena and Ristic, Selena and Poglitsch, Michael and Bergmann, Martina and Radic, Nemanja and Mossmann, Dirk and Liang, YongTian and Maglione, Marta and Jerkovic, Andrea and Hajiraissi, Roozbeh and Hanke, Marcel and Küttner, Victoria and Wolinski, Heimo and Zimmermann, Andreas and Domuz Trifunović, Lana and Mikolasch, Leonie and Moretti, Daiana N and Broeskamp, Filomena and Westermayer, Julia and Abraham, Claudia and Schauer, Simon and Dammbrueck, Christopher and Hofer, Sebastian J and Abdellatif, Mahmoud and Grundmeier, Guido and Kroemer, Guido and Braun, Ralf J and Hansen, Niklas and Sommer, Cornelia and Ninkovic, Mirjana and Seba, Sandra and Rockenfeller, Patrick and Vögtle, Friederike‐Nora and Dengjel, Jörn and Meisinger, Chris and Keller, Adrian and Sigrist, Stephan J and Eisenberg, Tobias and Madeo, Frank}}, issn = {{1757-4676}}, journal = {{EMBO Molecular Medicine}}, keywords = {{Molecular Medicine}}, pages = {{e13952}}, publisher = {{EMBO}}, title = {{{The HSP40 chaperone Ydj1 drives amyloid beta 42 toxicity}}}, doi = {{10.15252/emmm.202113952}}, volume = {{14}}, year = {{2022}}, } @inproceedings{31150, author = {{Heyser, Per and Meschut, Gerson and Nehls, Thomas and Scharr, Christian and Froitzheim, Pascal and Flügge, Wilko and Wiesenmayer, Sebastian and Merklein, Marion}}, booktitle = {{Pressen, Systeme, Prozesse der Zukunft Effizienz + Digitalisierung}}, isbn = {{978-3-86776-586-2}}, publisher = {{Europäische Forschungsgesellschaft für Blechverarbeitung e.V.}}, title = {{{Metamodellbasierte Prozesskette - Umformen-Schneiden-Spannen-Fügen}}}, volume = {{T 50}}, year = {{2022}}, } @book{31149, author = {{Meschut, Gerson and Heyser, Per and Merklein, Marion and Wiesenmayer, Sebastian and Flügge, Wilko and Scharr, Christian and Nehls, Thomas}}, isbn = {{978-3-86776-636-4}}, publisher = {{Europäische Forschungsgesellschaft für Blechverarbeitung e.V}}, title = {{{Konzeption einer adaptiven Prozesskette für das mechanische Fügen}}}, volume = {{578}}, year = {{2022}}, } @inproceedings{31151, author = {{Heyser, Per and Wiesenmayer, Sebastian and Nehls, Thomas and Scharr, Christian and Flügge, Wilko and Merklein, Marion and Meschut, Gerson}}, booktitle = {{SMART PRODUCTION 2022: DIGITALIZING AUTOMOTIVE MANUFACTURING}}, location = {{Bad Nauheim}}, publisher = {{Automotive Circle}}, title = {{{Smart process chain – data analysis in sheet metal processing for joinability prediction}}}, year = {{2022}}, } @inproceedings{31068, author = {{Chen, Mei-Hua and Mudgal, Garima and Chen, Wei-Fan and Wachsmuth, Henning}}, booktitle = {{EUROCALL}}, title = {{{Investigating the argumentation structures of EFL learners from diverse language backgrounds}}}, year = {{2022}}, } @inproceedings{31171, author = {{Bernemann, Sören Antonius and Maćkowiak, Jan and Maćkowiak, Jerzy and Bertling, René and Lutters, Nicole and Kenig, Eugeny}}, location = {{Frankfurt am Main}}, title = {{{Entwicklung eines innovativen Trennapparates zur Stickstoffrückgewinnung aus landwirtschaftlichen Abfällen}}}, year = {{2022}}, } @article{29351, abstract = {{Safety-critical systems have to follow extremely high dependability requirements as specified in the standards for automotive, air, and space applications. The required high fault coverage at runtime is usually obtained by a combination of concurrent error detection or correction and periodic tests within rather short time intervals. The concurrent scheme ensures the integrity of computed results while the periodic test has to identify potential aging problems and to prevent any fault accumulation which may invalidate the concurrent error detection mechanism. Such periodic built-in self-test (BIST) schemes are already commercialized for memories and for random logic. The paper at hand extends this approach to interconnect structures. A BIST scheme is presented which targets interconnect defects before they will actually affect the system functionality at nominal speed. A BIST schedule is developed which significantly reduces aging caused by electromigration during the lifetime application of the periodic test.}}, author = {{Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, issn = {{0923-8174}}, journal = {{Journal of Electronic Testing}}, keywords = {{Electrical and Electronic Engineering}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Stress-Aware Periodic Test of Interconnects}}}, doi = {{10.1007/s10836-021-05979-5}}, year = {{2022}}, } @misc{29890, author = {{Sadeghi-Kohan, Somayeh and Hellebrand, Sybille and Wunderlich, Hans-Joachim}}, keywords = {{WORKSHOP}}, pages = {{2}}, publisher = {{European Workshop on Silicon Lifecycle Management, March 18, 2022}}, title = {{{EM-Aware Interconnect BIST}}}, year = {{2022}}, } @article{31241, author = {{Verma, A.K. and Bopp, F. and Finley, J.J. and Jonas, B. and Zrenner, A. and Reuter, Dirk}}, issn = {{0022-0248}}, journal = {{Journal of Crystal Growth}}, keywords = {{Materials Chemistry, Inorganic Chemistry, Condensed Matter Physics}}, publisher = {{Elsevier BV}}, title = {{{Low Areal Densities of InAs Quantum Dots on GaAs(100) Prepared by Molecular Beam Epitaxy}}}, doi = {{10.1016/j.jcrysgro.2022.126715}}, year = {{2022}}, } @article{31023, author = {{Subban, Pearl K. and Bradford, Brent and Sharma, Umesh and Loreman, Tim and Avramidis, Elias and Kullmann, Harry and Sahli Lozano, Caroline and Romano, Alessandra and Woodcock, Stuart}}, journal = {{European Journal of Special Needs Education}}, pages = {{1–12}}, title = {{{Does it really take a village to raise a child? Reflections on the need for collective responsibility in inclusive education}}}, doi = {{10.1080/08856257.2022.2059632}}, volume = {{37}}, year = {{2022}}, } @inbook{31391, author = {{Elit, Stefan}}, booktitle = {{Aufbruch und Krise. Ästhetische/Narrative Auseinandersetzungen mit der spanischen Transición und der deutschen ‚Wende‘ (Germanisch-Romanische Monatsschrift. Beiheft) }}, editor = {{Schreckenberg, Stefan and Schumann, Daniel Verdú}}, pages = {{183--196}}, title = {{{Dekonstruktionen des Staatssozialismus (und mehr). Komische Helden der Wende- und Nachwendezeit in deutschsprachiger Literatur}}}, year = {{2022}}, } @article{31480, abstract = {{Optical geometric phase encoded by in-plane spatial orientation of microstructures has promoted the rapid development of numerous functional meta-devices. However, pushing the concept of the geometric phase toward the acoustic community still faces challenges. In this work, we utilize two acoustic nonlocal metagratings that could support a direct conversion between an acoustic plane wave and a designated vortex mode to obtain the acoustic geometric phase, in which an orbital angular momentum conversion process plays a vital role. In addition, we realize the acoustic geometric phases of different orders by merely varying the orientation angle of the acoustic nonlocal metagratings. Intriguingly, according to our developed theory, we reveal that the reflective acoustic geometric phase, which is twice the transmissive one, can be readily realized by transferring the transmitted configuration to a reflected one. Both the theoretical study and experimental measurements verify the announced transmissive and reflective acoustic geometric phases. Moreover, the reconfigurability and continuous phase modulation that covers the 2π range shown by the acoustic geometric phases provide us with the alternatives in advanced acoustic wavefront control.}}, author = {{Liu, Bingyi and Zhou, Zhiling and Wang, Yongtian and Zentgraf, Thomas and Li, Yong and Huang, Lingling}}, issn = {{0003-6951}}, journal = {{Applied Physics Letters}}, keywords = {{Physics and Astronomy (miscellaneous)}}, number = {{21}}, publisher = {{AIP Publishing}}, title = {{{Experimental verification of the acoustic geometric phase}}}, doi = {{10.1063/5.0091474}}, volume = {{120}}, year = {{2022}}, } @article{31479, author = {{Baswana, Surender and Gupta, Shiv and Knollmann, Till}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, keywords = {{Applied Mathematics, Computer Science Applications, General Computer Science}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Mincut Sensitivity Data Structures for the Insertion of an Edge}}}, doi = {{10.1007/s00453-022-00978-0}}, year = {{2022}}, } @article{31541, author = {{Kobecki, Michal and Scherbakov, Alexey V. and Kukhtaruk, Serhii M. and Yaremkevich, Dmytro D. and Henksmeier, Tobias and Trapp, Alexander and Reuter, Dirk and Gusev, Vitalyi E. and Akimov, Andrey V. and Bayer, Manfred}}, issn = {{0031-9007}}, journal = {{Physical Review Letters}}, keywords = {{General Physics and Astronomy}}, number = {{15}}, publisher = {{American Physical Society (APS)}}, title = {{{Giant Photoelasticity of Polaritons for Detection of Coherent Phonons in a Superlattice with Quantum Sensitivity}}}, doi = {{10.1103/physrevlett.128.157401}}, volume = {{128}}, year = {{2022}}, } @unpublished{31545, abstract = {{Knowledge graph embedding research has mainly focused on learning continuous representations of entities and relations tailored towards the link prediction problem. Recent results indicate an ever increasing predictive ability of current approaches on benchmark datasets. However, this effectiveness often comes with the cost of over-parameterization and increased computationally complexity. The former induces extensive hyperparameter optimization to mitigate malicious overfitting. The latter magnifies the importance of winning the hardware lottery. Here, we investigate a remedy for the first problem. We propose a technique based on Kronecker decomposition to reduce the number of parameters in a knowledge graph embedding model, while retaining its expressiveness. Through Kronecker decomposition, large embedding matrices are split into smaller embedding matrices during the training process. Hence, embeddings of knowledge graphs are not plainly retrieved but reconstructed on the fly. The decomposition ensures that elementwise interactions between three embedding vectors are extended with interactions within each embedding vector. This implicitly reduces redundancy in embedding vectors and encourages feature reuse. To quantify the impact of applying Kronecker decomposition on embedding matrices, we conduct a series of experiments on benchmark datasets. Our experiments suggest that applying Kronecker decomposition on embedding matrices leads to an improved parameter efficiency on all benchmark datasets. Moreover, empirical evidence suggests that reconstructed embeddings entail robustness against noise in the input knowledge graph. To foster reproducible research, we provide an open-source implementation of our approach, including training and evaluation scripts as well as pre-trained models in our knowledge graph embedding framework.}}, author = {{Demir, Caglar and Lienen, Julian and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{arXiv:2205.06560}}, title = {{{Kronecker Decomposition for Knowledge Graph Embeddings}}}, year = {{2022}}, } @article{31547, author = {{Hanke, Marcel and Dornbusch, Daniel and Hadlich, Christoph and Rossberg, Andre and Hansen, Niklas and Grundmeier, Guido and Tsushima, Satoru and Keller, Adrian and Fahmy, Karim}}, issn = {{2001-0370}}, journal = {{Computational and Structural Biotechnology Journal}}, keywords = {{Computer Science Applications, Genetics, Biochemistry, Structural Biology, Biophysics, Biotechnology}}, pages = {{2611--2623}}, publisher = {{Elsevier BV}}, title = {{{Anion-specific structure and stability of guanidinium-bound DNA origami}}}, doi = {{10.1016/j.csbj.2022.05.037}}, volume = {{20}}, year = {{2022}}, } @unpublished{31546, abstract = {{In semi-supervised learning, the paradigm of self-training refers to the idea of learning from pseudo-labels suggested by the learner itself. Across various domains, corresponding methods have proven effective and achieve state-of-the-art performance. However, pseudo-labels typically stem from ad-hoc heuristics, relying on the quality of the predictions though without guaranteeing their validity. One such method, so-called credal self-supervised learning, maintains pseudo-supervision in the form of sets of (instead of single) probability distributions over labels, thereby allowing for a flexible yet uncertainty-aware labeling. Again, however, there is no justification beyond empirical effectiveness. To address this deficiency, we make use of conformal prediction, an approach that comes with guarantees on the validity of set-valued predictions. As a result, the construction of credal sets of labels is supported by a rigorous theoretical foundation, leading to better calibrated and less error-prone supervision for unlabeled data. Along with this, we present effective algorithms for learning from credal self-supervision. An empirical study demonstrates excellent calibration properties of the pseudo-supervision, as well as the competitiveness of our method on several benchmark datasets.}}, author = {{Lienen, Julian and Demir, Caglar and Hüllermeier, Eyke}}, booktitle = {{arXiv:2205.15239}}, title = {{{Conformal Credal Self-Supervised Learning}}}, year = {{2022}}, } @inproceedings{31540, author = {{Çavdar, Serkan and Meschut, Gerson}}, booktitle = {{45th Annual Meeting of The Adhesion Society}}, location = {{San Diego, California, USA}}, title = {{{Stress-based fatigue lifetime prediction of adhesively bonded joints with hyperelastic deformation behavior}}}, year = {{2022}}, } @phdthesis{31556, abstract = {{Mehrzieloptimierung behandelt Probleme, bei denen mehrere skalare Zielfunktionen simultan optimiert werden sollen. Ein Punkt ist in diesem Fall optimal, wenn es keinen anderen Punkt gibt, der mindestens genauso gut ist in allen Zielfunktionen und besser in mindestens einer Zielfunktion. Ein notwendiges Optimalitätskriterium lässt sich über Ableitungsinformationen erster Ordnung der Zielfunktionen herleiten. Die Menge der Punkte, die dieses notwendige Kriterium erfüllen, wird als Pareto-kritische Menge bezeichnet. Diese Arbeit enthält neue Resultate über Pareto-kritische Mengen für glatte und nicht-glatte Mehrzieloptimierungsprobleme, sowohl was deren Berechnung betrifft als auch deren Struktur. Im glatten Fall erfolgt die Berechnung über ein Fortsetzungsverfahren, im nichtglatten Fall über ein Abstiegsverfahren. Anschließend wird die Struktur des Randes der Pareto-kritischen Menge analysiert, welcher aus Pareto-kritischen Mengen kleinerer Subprobleme besteht. Schlussendlich werden inverse Probleme betrachtet, bei denen zu einer gegebenen Datenmenge ein Zielfunktionsvektor gefunden werden soll, für den die Datenpunkte kritisch sind.}}, author = {{Gebken, Bennet}}, title = {{{Computation and analysis of Pareto critical sets in smooth and nonsmooth multiobjective optimization}}}, doi = {{10.17619/UNIPB/1-1327}}, year = {{2022}}, }