@inbook{32339, author = {{Häsel-Weide, Uta and Seitz, S. and Wallner, Melina and Wilke, Y.}}, booktitle = {{Qualifizierung für Inklusion. Sekundarstufe}}, editor = {{Lutz, D. and Becker, J. and Buchhaupt, F. and Katzenbach, D. and Strecker, A. and Urban, M.}}, pages = {{83--100}}, publisher = {{Waxmann}}, title = {{{Professionalisierung für inklusiven Mathematikunterricht. Interdisziplinäre Seminarkonzeption zur reflexiven Professionalisierung angehender Mathematiklehrkräfte in der Sekundarstufe}}}, year = {{2022}}, } @article{32338, author = {{Hähn, K. and Häsel-Weide, Uta and Scherer, P.}}, journal = {{QfI - Qualifizierung für Inklusion}}, number = {{2}}, title = {{{Diagnosegeleitete Förderung im inklusiven Mathematikunterricht der Grundschule – Professionalisierung durch reflektierte Handlungspraxis in der Lehrer*innenbildung.}}}, volume = {{3}}, year = {{2022}}, } @inproceedings{32333, abstract = {{This paper provides a hybrid energy system model created in Matlab/Simulink which is based on photovoltaics as its main energy source. The model includes a hybrid energy storage which consists of a short-term lithium-ion battery and hydrogen as long-term storage to ensure autonomy even during periods of low PV production (e.g., in winter). The sectors heat and electricity are coupled by using the waste-heat generated by production and reconversion of hydrogen through an electrolyser respectively a fuel cell. A heat pump has been considered to cover the residual heat demand (for well insulated homes). Within this paper a model of the space heating system as well as the hot water heating system is presented. The model is designed for the simulation and analysis of a whole year energy flow by using a time series of loads, weather and heat profiles as input. Moreover, results of the energy balance within the energy system by simulation of a complete year by varying the orientation (elevation and azimuth) of the PV system and the component sizing, such as the lithium-ion battery capacity, are presented. It turned out that a high amount of heating energy can be saved by using the waste heat generated by the electrolyser and the fuel cell. The model is well suited for the analysis of the effects of different component dimensionings in a hydrogen-based energy system via the overall energy balance within the residential sector.}}, author = {{Möller, Marius Claus and Krauter, Stefan}}, booktitle = {{Proceedings of the 49th IEEE Photovoltaic Specialists Conference}}, location = {{Philadelphia, PA, USA}}, title = {{{Model of a Self-Sufficient PV Home using a Hybrid Storage System based on Li-Ion Batteries and Hydrogen Storage with Waste Heat Utilization }}}, year = {{2022}}, } @article{30262, abstract = {{In this paper, a model of a hybrid, hydrogen-based energy system for a household which includes the heating sector is presended. With such an energy system it's possible to enable energy autarky over a whole year based on solar energy. The scope of this study was to present a verified hybrid energy system model created in Simulink which can be used to prospectively size future similar energy systems where hydrogen in combination with a li-ion battery shall be used as energy storage type.}}, author = {{Möller, Marius Claus and Krauter, Stefan}}, issn = {{1996-1073}}, journal = {{Energies / Special Issue "Sustainable Energy Concepts for Energy Transition"}}, publisher = {{MDPI / Basel, Switzerland}}, title = {{{Hybrid Energy System Model in Matlab/Simulink based on Solar Energy, Lithium-Ion Battery and Hydrogen}}}, doi = {{10.3390/en15062201}}, volume = {{15 (6), 2201}}, year = {{2022}}, } @article{32087, abstract = {{ Agility, a key component of team ball sports, describes an athlete´s ability to move fast in response to changing environments. While agility requires basic cognitive functions like processing speed, it also requires more complex cognitive processes like working memory and inhibition. Yet, most agility tests restrict an assessment of cognitive processes to simple reactive times that lack ecological validity. Our aim in this study was to assess agility performance by means of total time on two agility tests with matched motor demands but with both low and high cognitive demands. We tested 22 female team athletes on SpeedCourt, using a simple agility test (SAT) that measured only processing speed and a complex agility test (CAT) that required working memory and inhibition. We found excellent to good reliability for both our SAT (ICC = .79) and CAT (ICC =.70). Lower agility performance on the CAT was associated with increased agility total time and split times ( p < .05). These results demonstrated that agility performance depends on the complexity of cognitive demands. There may be interference-effects between motor and cognitive performances, reducing speed when environmental information becomes more complex. Future studies should consider agility training models that implement complex cognitive stimuli to challenge athletes according to competitive demands. This will also allow scientists and practitioners to tailor tests to talent identification, performance development and injury rehabilitation. }}, author = {{Büchel, Daniel and Gokeler, Alli and Heuvelmans, Pieter and Baumeister, Jochen}}, issn = {{0031-5125}}, journal = {{Perceptual and Motor Skills}}, keywords = {{Sensory Systems, Experimental and Cognitive Psychology}}, publisher = {{SAGE Publications}}, title = {{{Increased Cognitive Demands Affect Agility Performance in Female Athletes - Implications for Testing and Training of Agility in Team Ball Sports}}}, doi = {{10.1177/00315125221108698}}, year = {{2022}}, } @inbook{32363, author = {{zur Heiden, Philipp and Priefer, Jennifer and Beverungen, Daniel}}, booktitle = {{Forum Dienstleistungsmanagement}}, editor = {{Bruhn, Manfred and Hadwich, Karsten}}, isbn = {{9783658373436}}, issn = {{2662-3382}}, pages = {{435--457}}, publisher = {{Springer Fachmedien Wiesbaden}}, title = {{{Smart Service für die prädiktive Instandhaltung zentraler Komponenten des Mittelspannungs-Netzes}}}, doi = {{10.1007/978-3-658-37344-3_14}}, year = {{2022}}, } @inproceedings{32388, author = {{Rossel, Moritz Sebastian and Meschut, Gerson}}, booktitle = {{Proceedings of the 6th Conference on Steels in Cars and Trucks}}, location = {{Milan}}, title = {{{Method development for increasing the prediction quality of mechanical joining process simulations by friction modeling based on local joining process parameters}}}, year = {{2022}}, } @article{29673, abstract = {{Koopman operator theory has been successfully applied to problems from various research areas such as fluid dynamics, molecular dynamics, climate science, engineering, and biology. Applications include detecting metastable or coherent sets, coarse-graining, system identification, and control. There is an intricate connection between dynamical systems driven by stochastic differential equations and quantum mechanics. In this paper, we compare the ground-state transformation and Nelson's stochastic mechanics and demonstrate how data-driven methods developed for the approximation of the Koopman operator can be used to analyze quantum physics problems. Moreover, we exploit the relationship between Schrödinger operators and stochastic control problems to show that modern data-driven methods for stochastic control can be used to solve the stationary or imaginary-time Schrödinger equation. Our findings open up a new avenue towards solving Schrödinger's equation using recently developed tools from data science.}}, author = {{Klus, Stefan and Nüske, Feliks and Peitz, Sebastian}}, journal = {{Journal of Physics A: Mathematical and Theoretical}}, number = {{31}}, pages = {{314002}}, publisher = {{IOP Publishing Ltd.}}, title = {{{Koopman analysis of quantum systems}}}, doi = {{10.1088/1751-8121/ac7d22}}, volume = {{55}}, year = {{2022}}, } @misc{32409, abstract = {{Context: Cryptographic APIs are often misused in real-world applications. Therefore, many cryptographic API misuse detection tools have been introduced. However, there exists no established reference benchmark for a fair and comprehensive comparison and evaluation of these tools. While there are benchmarks, they often only address a subset of the domain or were only used to evaluate a subset of existing misuse detection tools. Objective: To fairly compare cryptographic API misuse detection tools and to drive future development in this domain, we will devise such a benchmark. Openness and transparency in the generation process are key factors to fairly generate and establish the needed benchmark. Method: We propose an approach where we derive the benchmark generation methodology from the literature which consists of general best practices in benchmarking and domain-specific benchmark generation. A part of this methodology is transparency and openness of the generation process, which is achieved by pre-registering this work. Based on our methodology we design CamBench, a fair "Cryptographic API Misuse Detection Tool Benchmark Suite". We will implement the first version of CamBench limiting the domain to Java, the JCA, and static analyses. Finally, we will use CamBench to compare current misuse detection tools and compare CamBench to related benchmarks of its domain.}}, author = {{Schlichtig, Michael and Wickert, Anna-Katharina and Krüger, Stefan and Bodden, Eric and Mezini, Mira}}, keywords = {{cryptography, benchmark, API misuse, static analysis}}, title = {{{CamBench -- Cryptographic API Misuse Detection Tool Benchmark Suite}}}, doi = {{10.48550/ARXIV.2204.06447}}, year = {{2022}}, } @inbook{32419, author = {{Tönsing, Johanna}}, booktitle = {{Rassismussensibler Literaturunterricht. Neue Perspektiven einer kulturwissenschaftlichen Literaturdidaktik}}, editor = {{Hofmann, Michael and Becker, Karina}}, title = {{{Chancen für einen rassismussensiblen Literaturunterricht - didaktische Perspektiven für das Lesen von Menschenzoogeschichten in der Grundschule am Beispiel von Rainer Maria Rilkes Gedicht "Die Aschanti. Jardin d´acclimatation" (1902)}}}, year = {{2022}}, } @inbook{32417, author = {{Tönsing, Johanna}}, booktitle = {{Interpretationsverfahruen der germanistischen Literaturdidaktik und didaktische Referenzkonzepte}}, editor = {{Bernhardt, Sebastian and Hardtke, Thomas}}, title = {{{(K)eine kinderleichte Gattung: Konsequenzen einer kulturwissenschaftlich informierten Märchendidaktik}}}, year = {{2022}}, } @phdthesis{32414, author = {{Lass, Michael}}, publisher = {{Universität Paderborn}}, title = {{{Bringing Massive Parallelism and Hardware Acceleration to Linear Scaling Density Functional Theory Through Targeted Approximations}}}, doi = {{10.17619/UNIPB/1-1281}}, year = {{2022}}, } @inbook{32418, author = {{Tönsing, Johanna}}, booktitle = {{Sammelband über den deutsch-türkischen Film}}, editor = {{Schulte-Eickholt, Swen and Hofmann, Michael}}, title = {{{Über „Gleis 11“ [Dokumentarfilm von 2021]}}}, year = {{2022}}, } @inbook{32423, author = {{Tönsing, Johanna}}, booktitle = {{Neue Perspektiven einer kulturwissenschaftlichen Literaturdidaktik}}, editor = {{Hofmann, Michael}}, title = {{{Weiblichkeitsdiskurse in der Gegenwartsliteratur und deren Thematisierung im genderorientierten Unterricht}}}, year = {{2022}}, } @inproceedings{32410, abstract = {{Static analysis tools support developers in detecting potential coding issues, such as bugs or vulnerabilities. Research on static analysis emphasizes its technical challenges but also mentions severe usability shortcomings. These shortcomings hinder the adoption of static analysis tools, and in some cases, user dissatisfaction even leads to tool abandonment. To comprehensively assess the current state of the art, this paper presents the first systematic usability evaluation in a wide range of static analysis tools. We derived a set of 36 relevant criteria from the scientific literature and gathered a collection of 46 static analysis tools complying with our inclusion and exclusion criteria - a representative set of mainly non-proprietary tools. Then, we evaluated how well these tools fulfill the aforementioned criteria. The evaluation shows that more than half of the considered tools offer poor warning messages, while about three-quarters of the tools provide hardly any fix support. Furthermore, the integration of user knowledge is strongly neglected, which could be used for improved handling of false positives and tuning the results for the corresponding developer. Finally, issues regarding workflow integration and specialized user interfaces are proved further. These findings should prove useful in guiding and focusing further research and development in the area of user experience for static code analyses.}}, author = {{Nachtigall, Marcus and Schlichtig, Michael and Bodden, Eric}}, booktitle = {{Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis}}, isbn = {{9781450393799}}, keywords = {{Automated static analysis, Software usability}}, pages = {{532 -- 543}}, publisher = {{ACM}}, title = {{{A Large-Scale Study of Usability Criteria Addressed by Static Analysis Tools}}}, doi = {{10.1145/3533767}}, year = {{2022}}, } @inproceedings{31133, abstract = {{Application Programming Interfaces (APIs) are the primary mechanism that developers use to obtain access to third-party algorithms and services. Unfortunately, APIs can be misused, which can have catastrophic consequences, especially if the APIs provide security-critical functionalities like cryptography. Understanding what API misuses are, and for what reasons they are caused, is important to prevent them, e.g., with API misuse detectors. However, definitions and nominations for API misuses and related terms in literature vary and are diverse. This paper addresses the problem of scattered knowledge and definitions of API misuses by presenting a systematic literature review on the subject and introducing FUM, a novel Framework for API Usage constraint and Misuse classification. The literature review revealed that API misuses are violations of API usage constraints. To capture this, we provide unified definitions and use them to derive FUM. To assess the extent to which FUM aids in determining and guiding the improvement of an API misuses detectors' capabilities, we performed a case study on CogniCrypt, a state-of-the-art misuse detector for cryptographic APIs. The study showed that FUM can be used to properly assess CogniCrypt's capabilities, identify weaknesses and assist in deriving mitigations and improvements. And it appears that also more generally FUM can aid the development and improvement of misuse detection tools.}}, author = {{Schlichtig, Michael and Sassalla, Steffen and Narasimhan, Krishna and Bodden, Eric}}, booktitle = {{2022 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)}}, keywords = {{API misuses, API usage constraints, classification framework, API misuse detection, static analysis}}, pages = {{673 -- 684}}, title = {{{FUM - A Framework for API Usage constraint and Misuse Classification}}}, doi = {{https://doi.org/10.1109/SANER53432.2022.00085}}, year = {{2022}}, } @misc{32399, author = {{Vahle, Ella}}, title = {{{Modelling and Proving Security for a Secure MPC Protocol for Stable Matching}}}, year = {{2022}}, } @misc{6561, author = {{Hetkämper, Tim}}, title = {{{Visualisierung von Ultraschallfeldern mittels Schlierentechnik und fraktionaler Fouriertransformation}}}, year = {{2022}}, } @misc{6592, author = {{Claes, Leander}}, title = {{{Messverfahren für die akustische Absorption zur Bestimmung der Volumenviskosität}}}, year = {{2022}}, } @inproceedings{32446, author = {{Mügge, Nils and Kronberg, Alexander and Glushenkov, Maxim and Kenig, Eugeny}}, booktitle = {{Annual Meeting on Reaction Engineering and ProcessNet Subject Division Heat and Mass Transfer}}, location = {{Würzburg, Germany}}, title = {{{Heat regeneration model for external heat engines operating with dense working fluids}}}, year = {{2022}}, } @inproceedings{31847, abstract = {{The famous $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. However, to the best of our knowledge, no research has considered the problem if the servers are not identical and requests can express which specific servers should serve them. Therefore, we present a new model generalizing the $k$-Server Problem by *preferences* of the requests and proceed to study it in a uniform metric space for deterministic online algorithms (the special case of paging). In our model, requests can either demand to be answered by any server (*general requests*) or by a specific one (*specific requests*). If only general requests appear, the instance is one of the original $k$-Server Problem, and a lower bound for the competitive ratio of $k$ applies. If only specific requests appear, a solution with a competitive ratio of $1$ becomes trivial since there is no freedom regarding the servers' movements. Perhaps counter-intuitively, we show that if both kinds of requests appear, the lower bound raises to $2k-1$. We study deterministic online algorithms in uniform metrics and present two algorithms. The first one has an adaptive competitive ratio dependent on the frequency of specific requests. It achieves a worst-case competitive ratio of $3k-2$ while it is optimal when only general or only specific requests appear (competitive ratio of $k$ and $1$, respectively). The second has a fixed close-to-optimal worst-case competitive ratio of $2k+14$. For the first algorithm, we show a lower bound of $3k-2$, while the second algorithm has a lower bound of $2k-1$ when only general requests appear. The two algorithms differ in only one behavioral rule for each server that significantly influences the competitive ratio. Each server acting according to the rule allows approaching the worst-case lower bound, while it implies an increased lower bound for $k$-Server instances. In other words, there is a trade-off between performing well against instances of the $k$-Server Problem and instances containing specific requests. We also show that no deterministic online algorithm can be optimal for both kinds of instances simultaneously.}}, author = {{Castenow, Jannik and Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, booktitle = {{Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures}}, isbn = {{9781450391467}}, keywords = {{K-Server Problem, Heterogeneity, Online Caching}}, pages = {{345--356}}, publisher = {{Association for Computing Machinery}}, title = {{{The k-Server with Preferences Problem}}}, doi = {{10.1145/3490148.3538595}}, year = {{2022}}, } @inbook{32473, author = {{Mindt, Ilka}}, booktitle = {{Künstliche Intelligenz mit offenen Lernangeboten an Hochschulen lehren. Erfahrungen und Erkenntnisse aus dem Fellowship-Programm des KI-Campus.}}, editor = {{Mah, Dana-Kristin and Cordula, Torner}}, pages = {{22--36}}, publisher = {{LibreCat University}}, title = {{{Künstliche Intelligenz fachfremd mittels Open Educational Resources unterrichten. Wie das Flipped-Classroom-Format bei der Einbettung in die Lehre der Anglistik hilft.}}}, doi = {{10.5281/ZENODO.6673692}}, year = {{2022}}, } @inproceedings{32572, author = {{Mayer, Peter and Poddebniak, Damian and Fischer, Konstantin and Brinkmann, Marcus and Somorovsky, Juraj and Sasse, Angela and Schinzel, Sebastian and Volkamer, Melanie}}, booktitle = {{Eighteenth Symposium on Usable Privacy and Security (SOUPS 2022)}}, isbn = {{978-1-939133-30-4}}, pages = {{77–96}}, publisher = {{USENIX Association}}, title = {{{"I don' know why I check this..." - Investigating Expert Users' Strategies to Detect Email Signature Spoofing Attacks}}}, year = {{2022}}, } @misc{30194, abstract = {{BloKK-Beitrag für das ZeKK, 04.02.2022}}, author = {{Lebock, Sarah}}, title = {{{Blogpost "Nahtoderfahrungen und ihre Deutungen"}}}, year = {{2022}}, } @article{32432, author = {{Yang, Yu and Huang, Jingyuan and Dornbusch, Daniel and Grundmeier, Guido and Fahmy, Karim and Keller, Adrian and Cheung, David L.}}, issn = {{0743-7463}}, journal = {{Langmuir}}, keywords = {{Electrochemistry, Spectroscopy, Surfaces and Interfaces, Condensed Matter Physics, General Materials Science}}, pages = {{9257–9265}}, publisher = {{American Chemical Society (ACS)}}, title = {{{Effect of Surface Hydrophobicity on the Adsorption of a Pilus-Derived Adhesin-like Peptide}}}, doi = {{10.1021/acs.langmuir.2c01016}}, volume = {{38}}, year = {{2022}}, } @article{32589, abstract = {{Guanidinium (Gdm) undergoes interactions with both hydrophilic and hydrophobic groups and, thus, is a highly potent denaturant of biomolecular structure. However, our molecular understanding of the interaction of Gdm with proteins and DNA is still rather limited. Here, we investigated the denaturation of DNA origami nanostructures by three Gdm salts, i.e., guanidinium chloride (GdmCl), guanidinium sulfate (Gdm2SO4), and guanidinium thiocyanate (GdmSCN), at different temperatures and in dependence of incubation time. Using DNA origami nanostructures as sensors that translate small molecular transitions into nanostructural changes, the denaturing effects of the Gdm salts were directly visualized by atomic force microscopy. GdmSCN was the most potent DNA denaturant, which caused complete DNA origami denaturation at 50 °C already at a concentration of 2 M. Under such harsh conditions, denaturation occurred within the first 15 min of Gdm exposure, whereas much slower kinetics were observed for the more weakly denaturing salt Gdm2SO4 at 25 °C. Lastly, we observed a novel non-monotonous temperature dependence of DNA origami denaturation in Gdm2SO4 with the fraction of intact nanostructures having an intermediate minimum at about 40 °C. Our results, thus, provide further insights into the highly complex Gdm–DNA interaction and underscore the importance of the counteranion species.}}, author = {{Hanke, Marcel and Hansen, Niklas and Tomm, Emilia and Grundmeier, Guido and Keller, Adrian}}, issn = {{1422-0067}}, journal = {{International Journal of Molecular Sciences}}, keywords = {{Inorganic Chemistry, Organic Chemistry, Physical and Theoretical Chemistry, Computer Science Applications, Spectroscopy, Molecular Biology, General Medicine, Catalysis}}, number = {{15}}, pages = {{8547}}, publisher = {{MDPI AG}}, title = {{{Time-Dependent DNA Origami Denaturation by Guanidinium Chloride, Guanidinium Sulfate, and Guanidinium Thiocyanate}}}, doi = {{10.3390/ijms23158547}}, volume = {{23}}, year = {{2022}}, } @article{34022, abstract = {{Background: Medical professionals working in an elite sport environment have the challenging task to balance the athlete’s readiness to return to the playing field after severe injury with other stakeholders’ (coaches, sponsors, teammates) opinions and objectives.Objectives: Our study aimed to evaluate differences in the physical profiles of elite rugby players at return to play (RTP) after a severe knee injury, compared with their pre-injury profiles and matched controls.Method: Before the injury, participants performed four performance tests during their preseason screening. These tests were repeated and compared to baseline once a player was declared fit to play.Results: Significant differences (p ≤ 0.05) were found in the injured players’ group who were slower over 10 m speed, in their decision-making time and the total time of the reactive agility tests at RTP, whilst controls were significantly faster over 10 m and 30 m speed tests. The countermovement jump outcomes showed significant improvement in the uninjured participants (p ≤ 0.05).Conclusion: Our study highlights that injured players’ running speeds and decision-making times are slower after injury. The uninjured players have a positive outcome to training and match stimulus by improving their running speed and lower body explosive power during the season.Clinical implications: Our study provides insight into the RTP profile of elite rugby players, and a novel finding was the decision-making time deficit. This highlights the importance of cognitive training during injury rehabilitation as athletes make numerous decisions in a pressured and uncontrolled environment during a match. Speed training development is recommended as the athletes were slower after severe knee injury.}}, author = {{Robyn, Aneurin D. and Louw, Quinette A. and Baumeister, Jochen}}, issn = {{2410-8219}}, journal = {{South African Journal of Physiotherapy}}, keywords = {{Physical Therapy, Sports Therapy and Rehabilitation}}, number = {{1}}, publisher = {{AOSIS}}, title = {{{Return to play in elite rugby players after severe knee injuries}}}, doi = {{10.4102/sajp.v78i1.1629}}, volume = {{78}}, year = {{2022}}, } @inbook{34023, abstract = {{Decision makers increasingly rely on decision support systems for optimal decision making. Recently, special attention has been paid to process-driven decision support systems (PD-DSS) in which a process model prescribes the invocation sequence of software-based decision support services and the data exchange between them. Thus, it is possible to quickly combine available decision support services as needed for optimally supporting the decision making process of an individual decision maker. However, process modelers may accidentally create a process model which is technically well-formed and executable, but contains functional and behavioral flaws such as redundant or missing services. These flaws may result in inefficient computations or invalid decision recommendations when the corresponding PD-DSS is utilized by a decision maker. In this paper, we therefore propose an approach to validate functionality and behavior of a process model representing a PD-DSS. Our approach is based on expressing flaws as anti-patterns for which the process model can be automatically checked via graph matching. We prototypically implemented our approach and demonstrate its applicability in the context of decision making for energy network planning.}}, author = {{Kirchhoff, Jonas and Engels, Gregor}}, booktitle = {{Software Business}}, isbn = {{9783031207051}}, issn = {{1865-1348}}, pages = {{227----243}}, publisher = {{Springer International Publishing}}, title = {{{Anti-pattern Detection in Process-Driven Decision Support Systems}}}, doi = {{10.1007/978-3-031-20706-8_16}}, volume = {{463}}, year = {{2022}}, } @article{34021, author = {{Robyn, A.D. and Louw, Q.A. and Baumeister, Jochen}}, issn = {{2411-6939}}, journal = {{African Journal for Physical Activity and Health Sciences (AJPHES)}}, keywords = {{General Medicine}}, number = {{3}}, pages = {{185--202}}, publisher = {{African Journal for Physical Activity and Health Sciences, Tshwane University of Technology}}, title = {{{Psychological readiness of elite rugby players at return to play after severe knee injury}}}, doi = {{10.37597/ajphes.2022.28.3.1}}, volume = {{28}}, year = {{2022}}, } @techreport{34020, author = {{Haase, Michael and Tasche, Frederik and Bieber, Maximilian and Zibart, Alexander}}, pages = {{64}}, publisher = {{Forschungsvereinigung Antriebstechnik e.V.}}, title = {{{Innovative Leichtbau- und Kühlungskonzepte für elektrische Maschinen durch additive Fertigung (ILuKadd3D)}}}, volume = {{Heft 1526}}, year = {{2022}}, } @misc{34025, abstract = {{Controversial topics like abortion or capital punishment inherently lack of correct answers or the right way to deal with. Thus, in order to find what is true, what is good, or what should be done, the involved parties need to debate. For the purpose of forming an opinion on a controversial topic someone needs to take in a lot of arguments on that topic to gather information which can be a time-consuming process. To increase efficiency, someone can use an argument search engine to quicken the retrieval of relevant arguments. Although the usage of such a service reduces the time to find arguments, there is still a lot of textual data that needs to be read. To this end, computational summarization approaches for arguments can limit the necessary time for information review by generating short snippets capturing the main gist of each argument. Yet, we suggest that approaches that consider one argument at a time show potential for further improvement in terms of efficiency during information review. In fact, arguments on the same topic, like those retrieved by a search engine for a certain query, partially cover the same content, e. g. arguments regarding the death penalty probably use deterrence as a point in favor of it. However, if the same aspect is central in multiple arguments, their snippets reflect this, which leads to redundancy among the snippets. Consequently, someone interested in gathering information on a controversial topic does not necessarily find new information in each snippet he or she reads. We introduce the task of Contrastive Argument Summarization (CAS) which addresses the aforementioned problem regarding existing argument summarization. An approach that addresses CAS aims to produce contrastive snippets for each argument in a set of topic-related arguments. A contrastive snippet should represent the main gist of its argument, it should account for the argumentative nature of the text, and it should be dissimilar to the other topic-related arguments in order to reduce redundancy among the snippets. We propose two approaches addressing CAS, namely an extended version of the LexRank derivation by Alshomary et al. (2020), and an advancement of the work by Bista et al. (2020). Additionally, we develop two automatic measures to assess to which extent the snippets of one set are opposed. For evaluation, we compile a corpus using the args.me search engine Wachsmuth et al. (2017b) to come close to the suggested area of application. Moreover, we conduct a manual annotation study to assess approaches’ effectiveness. We find that the graph-based approach is superior when it comes to contrastiveness (i. e. snippets being dissimilar to topic-related arguments), and that the second approach outperforms the previous one and the unmodified version of Alshomary et al. (2020) when it comes to representativeness (i. e. snippets capturing the main gist of an argument).}}, author = {{Rieskamp, Jonas}}, title = {{{Contrastive Argument Summarization Using Supervised and Unsupervised Machine Learning}}}, year = {{2022}}, } @inproceedings{34040, abstract = {{Consider the practical goal of making a desired action profile played, when the planner can only change the payoffs, bound by stringent constraints. Applications include motivating people to choose the closest school, the closest subway station, or to coordinate on a communication protocol or an investment strategy. Employing subsidies and tolls, we adjust the game so that choosing this predefined action profile becomes strictly dominant. Inspired mainly by the work of Monderer and Tennenholtz, where the promised subsidies do not materialise in the not played profiles, we provide a fair and individually rational game adjustment, such that the total outside investments sum up to zero at any profile, thereby facilitating easy and frequent usage of our adjustment without bearing costs, even if some players behave unexpectedly. The resultant action profile itself needs no adjustment. Importantly, we also prove that our adjustment minimises the general transfer among all such adjustments, counting the total subsidising and taxation.}}, author = {{Polevoy, Gleb and Dziubiński, Marcin}}, booktitle = {{Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence}}, editor = {{De Raedt, Luc}}, keywords = {{adjustment, strictly dominant, fairness, individually rational, transfer, tax, subsidy}}, location = {{Vienna}}, publisher = {{International Joint Conferences on Artificial Intelligence Organization}}, title = {{{Fair, Individually Rational and Cheap Adjustment}}}, doi = {{10.24963/ijcai.2022/64}}, year = {{2022}}, } @article{30105, abstract = {{Zusammenfassung: Der Beitrag befasst sich mit der professionellen pädagogischen Beziehung zwischen Referendar*innen und ihren Seminarlehrkräften, deren Beitrag für die Beanspruchung der Referendar*innen bisher noch nicht eingängig untersucht wurde. Das Ziel der Studie ist es, anhand einer Querschnittserhebung von 2583 Referendar*innen und ausgebildeten Lehrkräften, kompensatorische sowie verstärkende Effekte der Beziehungsdimensionen Transparenz, Fairness, Vertrauen und Ambivalenz auf die wahrgenommene Beanspruchung im Referendariat zu untersuchen. Die Analyse erfolgt mittels eines latent moderierten Strukturgleichungsansatzes. Die Ergebnisse zeigen, dass Belastungen durch die Kerntätigkeiten im Referendariat sowie Belastungen durch den Umgang mit Kolleg*innen im Lehrer*innenkollegium in signifikant positivem Zusammenhang mit resultierenden Beanspruchungsreaktionen stehen. Je transparenter, fairer und vertrauensvoller und je weniger ambivalent die Beziehung zur Seminarlehrkraft erlebt wird, desto geringer fallen die Beanspruchungsreaktionen aus. Die Ergebnisse werden hinsichtlich ihrer Relevanz für die Beziehungsarbeit im Referendariat als zentralem Ausbildungsbestandteil der zweiten Phase der Lehrer*innenausbildung diskutiert.}}, author = {{Kärner, Tobias and Goller, Michael and Bonnes, Caroline and Maué, Elisabeth}}, issn = {{1434-663X}}, journal = {{Zeitschrift für Erziehungswissenschaft}}, keywords = {{Education}}, pages = {{687--719}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Die professionelle pädagogische Beziehung zwischen Referendar*innen und ihren Seminarlehrkräften: Belastungsfaktor oder Ressource?}}}, doi = {{10.1007/s11618-022-01065-4}}, volume = {{25}}, year = {{2022}}, } @inproceedings{33085, author = {{Epstein, Leah and Lassota, Alexandra and Levin, Asaf and Maack, Marten and Rohwedder, Lars}}, booktitle = {{39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}}, editor = {{Berenbrink, Petra and Monmege, Benjamin}}, pages = {{28:1–28:15}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}}, title = {{{Cardinality Constrained Scheduling in Online Models}}}, doi = {{10.4230/LIPIcs.STACS.2022.28}}, volume = {{219}}, year = {{2022}}, } @article{34044, author = {{Hoffmann, Christin and Thommes, Kirsten}}, issn = {{0959-6526}}, journal = {{Journal of Cleaner Production}}, keywords = {{Industrial and Manufacturing Engineering, Strategy and Management, General Environmental Science, Renewable Energy, Sustainability and the Environment, Building and Construction}}, publisher = {{Elsevier BV}}, title = {{{Clear Roads and Dirty Air? Indirect effects of reduced private traffic congestion on emissions from heavy traffic}}}, doi = {{10.1016/j.jclepro.2022.135053}}, year = {{2022}}, } @article{34045, author = {{Hoffmann, Christin and Thommes, Kirsten}}, issn = {{0959-6526}}, journal = {{Journal of Cleaner Production}}, keywords = {{Industrial and Manufacturing Engineering, Strategy and Management, General Environmental Science, Renewable Energy, Sustainability and the Environment, Building and Construction}}, publisher = {{Elsevier BV}}, title = {{{Clear Roads and Dirty Air? Indirect effects of reduced private traffic congestion on emissions from heavy traffic}}}, doi = {{10.1016/j.jclepro.2022.135053}}, year = {{2022}}, } @inproceedings{30840, author = {{Alshomary, Milad and El Baff, Roxanne and Gurcke, Timon and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics}}, pages = {{8782 -- 8797}}, title = {{{The Moral Debater: A Study on the Computational Generation of Morally Framed Arguments}}}, year = {{2022}}, } @inproceedings{33004, author = {{Wachsmuth, Henning and Alshomary, Milad}}, booktitle = {{Proceedings of the 29th International Conference on Computational Linguistics}}, pages = {{344 -- 354}}, title = {{{"Mama Always Had a Way of Explaining Things So I Could Understand": A Dialogue Corpus for Learning How to Explain}}}, year = {{2022}}, } @article{34049, author = {{Lauscher, Anne and Wachsmuth, Henning and Gurevych, Iryna and Glavaš, Goran}}, journal = {{Transactions of the Association for Computational Linguistics}}, title = {{{On the Role of Knowledge in Computational Argumentation}}}, year = {{2022}}, } @inproceedings{22157, author = {{Kiesel, Johannes and Alshomary, Milad and Handke, Nicolas and Cai, Xiaoni and Wachsmuth, Henning and Stein, Benno}}, booktitle = {{Proceedings of the 60th Annual Meeting of the Association for Computational Linguistics}}, pages = {{4459 -- 4471}}, title = {{{Identifying the Human Values behind Arguments}}}, year = {{2022}}, } @inproceedings{34057, author = {{Pasic, Faruk and Becker, Matthias}}, booktitle = {{2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA)}}, publisher = {{IEEE}}, title = {{{Domain-specific Language for Condition Monitoring Software Development}}}, doi = {{10.1109/etfa52439.2022.9921730}}, year = {{2022}}, } @inbook{34027, author = {{Somogyi, Peter}}, booktitle = {{Troja bauen}}, editor = {{Federow, Anne-Katrin and Malcher, Kay}}, publisher = {{Universitätsverlag Winter}}, title = {{{"Swer siner kunst meister ist, der hat gewalt an siner list". Herborts von Fritzlar Liet von Troye als Fortsetzungstext des Eneasromans Heinrichs von Veldeke am Schnittpunkt von Aneignung und Neukonstitution}}}, year = {{2022}}, } @inproceedings{34047, abstract = {{News articles both shape and reflect public opinion across the political spectrum. Analyzing them for social bias can thus provide valuable insights, such as prevailing stereotypes in society and the media, which are often adopted by NLP models trained on respective data. Recent work has relied on word embedding bias measures, such as WEAT. However, several representation issues of embeddings can harm the measures' accuracy, including low-resource settings and token frequency differences. In this work, we study what kind of embedding algorithm serves best to accurately measure types of social bias known to exist in US online news articles. To cover the whole spectrum of political bias in the US, we collect 500k articles and review psychology literature with respect to expected social bias. We then quantify social bias using WEAT along with embedding algorithms that account for the aforementioned issues. We compare how models trained with the algorithms on news articles represent the expected social bias. Our results suggest that the standard way to quantify bias does not align well with knowledge from psychology. While the proposed algorithms reduce the~gap, they still do not fully match the literature.}}, author = {{Spliethöver, Maximilian and Keiff, Maximilian and Wachsmuth, Henning}}, booktitle = {{Proceedings of The 2022 Conference on Empirical Methods in Natural Language Processing (EMNLP 2022)}}, location = {{Abu Dhabi}}, publisher = {{Association for Computational Linguistics}}, title = {{{No Word Embedding Model Is Perfect: Evaluating the Representation Accuracy for Social Bias in the Media}}}, year = {{2022}}, } @inbook{34017, author = {{Musiol, Marie-Luise and Winst, Silke}}, booktitle = {{Spiritual Vegetation: Vegetal Nature in Religious Contexts Across Medieval and Early Modern Europe (Berliner Mittelalter- und Frühneuzeitforschung, Vol. 26)}}, editor = {{Lamsechi, Guita and Trînca, Beatrice}}, pages = {{97--129}}, title = {{{Pfirsichbaum und dunkler Wald. Pflanzliche Konfigurationen zwischen Dynamisierung und Innehalten in 'Partonopier und Meliur' Konrads von Würzburg}}}, year = {{2022}}, } @misc{34019, author = {{Musiol, Marie-Luise}}, booktitle = {{Sexuologie}}, title = {{{Bennewitz, Ingrid/Eming, Jutta/Traulsen, Johannes: Gender Studies – Queer Studies – Intersektionalität. Eine Zwischenbilanz aus mediävistischer Perspektive (Berliner Mittelalter- und Frühneuzeitforschung 25), Göttingen 2019}}}, year = {{2022}}, } @inbook{34018, author = {{Musiol, Marie-Luise}}, booktitle = {{Unverfügbar. Kulturen des Heiligen}}, editor = {{Egidi, Margreth and Peters, Ludmilla and Schmidt, Jochen}}, title = {{{Menschlicher Körper, heiliger Körper. Zur Kreuzigung Christi im Donaueschinger Passionsspiel}}}, year = {{2022}}, } @article{29049, abstract = {{This study investigates the conditions under which tax rate changes accelerate risky investments. While tax rate increases are often expected to harm investment, analytical studies find tax rate increases may foster investment under flexibility.We design a theorybased experimentwith a binomial random walk and entry–exit flexibility.We find accelerated investment upon tax rate increases irrespective of an exit option, but no corresponding response to tax cuts. This asymmetry may be due to tax salience and mechanisms from irreversible choice under uncertainty. Given this evidence of unexpected tax-reform effects, tax policymakers should carefully consider behavioral aspects.}}, author = {{Fahr, René and Janssen, Elmar A. and Sureth-Sloane, Caren}}, journal = {{FinanzArchiv / Public Finance Analysis}}, keywords = {{Economic ExperimentM, Investment Decisions, Tax Effects, Timing Flexibility, Uncertainty}}, number = {{1-2}}, pages = {{239--289}}, title = {{{Can Tax Rate Changes Accelerate Investment under Entry and Exit Flexibility? – Insights from an Economic Experiment}}}, volume = {{78}}, year = {{2022}}, } @article{29048, abstract = {{We study the bargaining behavior between auditor and auditee in a tax setting and scrutinize the effect of interpersonal trust and trust in government on both parties’ concessions. We find evidence that both kinds of trust affect the concessionary behavior, albeit in different ways. While trust in government affects concessionary behavior in line with intuitive predictions, we find that interpersonal trust only affects tax auditors. For high interpersonal trust, the alleviating effect of high trust in government on tax auditors’ concessions is less pronounced. Our findings help tax authorities to shape programs to enhance compliance in an atmosphere of trust.}}, author = {{Eberhartinger, Eva and Speitmann, Raffael and Sureth-Sloane, Caren and Wu, Yuchen}}, journal = {{FinanzArchiv / Public Finance Analysis}}, keywords = {{Behavioral Taxation, Concessionary Behavior, Interpersonal Trust, Tax Audit, Trust in Government}}, number = {{1-2}}, pages = {{112--155}}, title = {{{How Does Trust Affect Concessionary Behavior in Tax Bargaining?}}}, volume = {{78}}, year = {{2022}}, } @inproceedings{31331, author = {{Hetkämper, Tim and Claes, Leander and Henning, Bernd}}, booktitle = {{Sensoren und Messsysteme - Beiträge der 21. ITG/GMA-Fachtagung}}, isbn = {{978-3-8007-5835-7}}, location = {{Nürnberg}}, publisher = {{VDE Verlag GmbH}}, title = {{{Schlieren imaging with fractional Fourier transform to visualise ultrasonic fields}}}, year = {{2022}}, } @inproceedings{34067, author = {{Sengupta, Meghdut and Alshomary, Milad and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 2022 Workshop on Figurative Language Processing}}, title = {{{Back to the Roots: Predicting the Source Domain of Metaphors using Contrastive Learning}}}, year = {{2022}}, } @inbook{34077, author = {{Bondarenko, Alexander and Fröbe, Maik and Kiesel, Johannes and Syed, Shahbaz and Gurcke, Timon and Beloucif, Meriem and Panchenko, Alexander and Biemann, Chris and Stein, Benno and Wachsmuth, Henning and Potthast, Martin and Hagen, Matthias}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783030997380}}, issn = {{0302-9743}}, publisher = {{Springer International Publishing}}, title = {{{Overview of Touché 2022: Argument Retrieval}}}, doi = {{10.1007/978-3-030-99739-7_43}}, year = {{2022}}, } @inbook{33985, abstract = {{Der Beitrag widmet sich dem Einsatz von Augmented Reality (AR) in betrieblichen Aus- und Weiterbildungskontexten. Hierbei stehen insbesondere Fragen zu Berufsfeldern und Ausbildungsinhalten, zu verwendeten AR-Spezifikationen, zu Zusammenhängen zwischen AR-Anwendung und leistungs-, wahrnehmungs- und motivationsbezogenen Variablen sowie zur didaktischen Einbettung entsprechender Technologien im Fokus. Auf Basis einer integrierenden Sichtung bestehender Literatur konnten insgesamt 16 Studien sowie zwei bereits vorliegende Literaturreviews in die Analyse eingeschlossen werden. Die Ergebnisse verweisen u. a. auf eine heterogene Lage hinsichtlich forschungsmethodischer Zugänge und didaktischer Referenzkonzepte. Weitgehend förderliche Effekte auf leistungs-, wahrnehmungs- und motivationsbezogene Variablen stimmen insgesamt bezüglich des AR-Einsatzes positiv, machen aber auch die Notwendigkeit einer integrierten Betrachtung technologischer und pädagogisch-instruktionaler Gestaltungsparameter deutlich.}}, author = {{Kärner, Tobias and Goller, Michael and Maier, Andreas}}, booktitle = {{Digitalisierung und digitale Medien in der Berufsbildung: Konzepte, Befunde und Herausforderungen}}, editor = {{Schumann, Stephan and Seeber, Susan and Abele, Stephan}}, keywords = {{Augmented Reality, Ausbildung, Weiterbildung, Lernen mit digitalen Medien, integratives Literaturreview}}, pages = {{213--230}}, publisher = {{wbv}}, title = {{{Augmented Reality Anwendungen in der betrieblichen Aus‐ und Weiterbildung}}}, volume = {{41}}, year = {{2022}}, } @article{34080, abstract = {{Startpunkt jeglicher Professionalisierungsbemühungen ist ein Verständnis der für das professionelle Handeln notwendigen Kompetenzen. Dieser Beitrag widmet sich der literaturbasierten Identifikation von Kompetenzen des betrieblichen Ausbildungspersonals und ordnet diese den vier Kompetenzbereichen Fach-, Methoden-, Sozial- und Selbstkompetenz zu. Die Ergebnisse können sowohl als Grundlage für weitere Forschung dienen als auch in der Praxis als Orientierung für die Gestaltung von Qualifizierungsmaßnahmen verwendet werden. }}, author = {{Bonnes, Caroline and Binkert, Julia and Goller, Michael}}, journal = {{Berufsbildung in Wissenschaft und Praxis – BWP}}, number = {{4}}, title = {{{Kompetenzen des betrieblichen Ausbildungspersonals: Eine literaturbasierte Systematisierung}}}, year = {{2022}}, } @inproceedings{34051, abstract = {{An argument is a constellation of premises reasoning towards a certain conclusion. The automatic generation of conclusions is becoming a very prominent task, raising the need for automatic measures to assess the quality of these generated conclusions. The SharedTask at the 9th Workshop on Argument Mining proposes a new task to assess the novelty and validity of a conclusion given a set of premises. In this paper, we present a multitask learning approach that transfers the knowledge learned from the natural language inference task to the tasks at hand. Evaluation results indicate the importance of both knowledge transfer and joint learning, placing our approach in the fifth place with strong results compared to baselines.}}, author = {{Alshomary, Milad and Stahl, Maja}}, booktitle = {{Proceedings of the 9th Workshop on Argument Mining}}, pages = {{111–114}}, publisher = {{International Conference on Computational Linguistics}}, title = {{{Argument Novelty and Validity Assessment via Multitask and Transfer Learning}}}, year = {{2022}}, } @article{34099, abstract = {{Using a unique combination of advanced characterization techniques, we identify specific degradation mechanisms and quantify degradative species formed during fast charge cycling of lithium-ion battery pouch cells.}}, author = {{McShane, Eric J. and Paul, Partha P. and Tanim, Tanvir R. and Cao, Chuntian and Steinrück, Hans-Georg and Thampy, Vivek and Trask, Stephen E. and Dunlop, Alison R. and Jansen, Andrew N. and Dufek, Eric J. and Toney, Michael F. and Weker, Johanna Nelson and McCloskey, Bryan D.}}, issn = {{2050-7488}}, journal = {{Journal of Materials Chemistry A}}, keywords = {{General Materials Science, Renewable Energy, Sustainability and the Environment, General Chemistry}}, number = {{44}}, pages = {{23927--23939}}, publisher = {{Royal Society of Chemistry (RSC)}}, title = {{{Multimodal quantification of degradation pathways during extreme fast charging of lithium-ion batteries}}}, doi = {{10.1039/d2ta05887a}}, volume = {{10}}, year = {{2022}}, } @article{34098, author = {{Yusuf, Maha and LaManna, Jacob M. and Paul, Partha P. and Agyeman-Budu, David N. and Cao, Chuntian and Dunlop, Alison R. and Jansen, Andrew N. and Polzin, Bryant J. and Trask, Stephen E. and Tanim, Tanvir R. and Dufek, Eric J. and Thampy, Vivek and Steinrück, Hans-Georg and Toney, Michael F. and Nelson Weker, Johanna}}, issn = {{2666-3864}}, journal = {{Cell Reports Physical Science}}, keywords = {{General Physics and Astronomy, General Energy, General Engineering, General Materials Science, General Chemistry}}, number = {{11}}, pages = {{101145}}, publisher = {{Elsevier BV}}, title = {{{Simultaneous neutron and X-ray tomography for visualization of graphite electrode degradation in fast-charged lithium-ion batteries}}}, doi = {{10.1016/j.xcrp.2022.101145}}, volume = {{3}}, year = {{2022}}, } @inproceedings{34103, abstract = {{It is well known that different algorithms perform differently well on an instance of an algorithmic problem, motivating algorithm selection (AS): Given an instance of an algorithmic problem, which is the most suitable algorithm to solve it? As such, the AS problem has received considerable attention resulting in various approaches - many of which either solve a regression or ranking problem under the hood. Although both of these formulations yield very natural ways to tackle AS, they have considerable weaknesses. On the one hand, correctly predicting the performance of an algorithm on an instance is a sufficient, but not a necessary condition to produce a correct ranking over algorithms and in particular ranking the best algorithm first. On the other hand, classical ranking approaches often do not account for concrete performance values available in the training data, but only leverage rankings composed from such data. We propose HARRIS- Hybrid rAnking and RegRessIon foreSts - a new algorithm selector leveraging special forests, combining the strengths of both approaches while alleviating their weaknesses. HARRIS' decisions are based on a forest model, whose trees are created based on splits optimized on a hybrid ranking and regression loss function. As our preliminary experimental study on ASLib shows, HARRIS improves over standard algorithm selection approaches on some scenarios showing that combining ranking and regression in trees is indeed promising for AS.}}, author = {{Fehring, Lukass and Hanselle, Jonas Manuel and Tornede, Alexander}}, booktitle = {{Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022}}, location = {{Baltimore}}, title = {{{HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection}}}, year = {{2022}}, } @article{33251, author = {{Robra-Bissantz, Susanne and Lattemann, Christoph and Laue, Ralf and Leonhard-Pfleger, Raphaela and Wagner, Luisa and Gerundt, Oliver and Schlimbach, Ricarda and Baumann, Sabine and Vorbohle, Christian and Gottschalk, Sebastian and Kundisch, Dennis and Engels, Gregor and Wünderlich, Nancy and Nissen, Volker and Lohrenz, Lisa and Michalke, Simon}}, journal = {{HMD Praxis der Wirtschaftsinformatik}}, number = {{5}}, pages = {{1227 -- 1257}}, title = {{{Methoden zum Design digitaler Plattformen, Geschäftsmodelle und Service-Ökosysteme}}}, volume = {{59}}, year = {{2022}}, } @inproceedings{33502, author = {{Althaus, Maike and Poniatowski, Martin and Kundisch, Dennis}}, booktitle = {{Proceedings of the 43rd International Conference on Information Systems (ICIS)}}, location = {{Copenhagen, Denmark}}, title = {{{Tackling Crises Together? – An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic}}}, year = {{2022}}, } @inproceedings{33882, author = {{Laux, Florian and Poniatowski, Martin and Kundisch, Dennis}}, location = {{Copenhagen, Denmark}}, title = {{{May I have your attention, please? Analyzing the effects of attention screening mechanisms on crowdworking platforms}}}, year = {{2022}}, } @inproceedings{33885, author = {{Seutter, Janina}}, location = {{Copenhagen, Denmark}}, title = {{{Online Reviews in B2B Markets: A Qualitative Study on the Underlying Motives }}}, year = {{2022}}, } @inproceedings{32602, author = {{Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}}, booktitle = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}}, editor = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}}, isbn = {{978-3-95977-253-2}}, issn = {{1868-8969}}, pages = {{8:1–8:22}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{The Structural Power of Reconfigurable Circuits in the Amoebot Model}}}, doi = {{10.4230/LIPIcs.DNA.28.8}}, volume = {{238}}, year = {{2022}}, } @inproceedings{32603, author = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}}, booktitle = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}}, editor = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}}, isbn = {{978-3-95977-253-2}}, issn = {{1868-8969}}, pages = {{9:1–9:22}}, publisher = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}}, title = {{{Fault-Tolerant Shape Formation in the Amoebot Model}}}, doi = {{10.4230/LIPIcs.DNA.28.9}}, volume = {{238}}, year = {{2022}}, } @inproceedings{30916, author = {{Seutter, Janina}}, booktitle = {{Proceedings of the 30th European Conference on Information Systems (ECIS)}}, location = {{Timișoara, Romania}}, title = {{{Online Reviews in B2B Markets: A Qualitative Study of Underlying Motivations}}}, year = {{2022}}, } @inproceedings{31062, author = {{Poniatowski, Martin}}, booktitle = {{Proceedings of the 28th Americas Conference on Information Systems (AMCIS)}}, location = {{Minneapolis, USA}}, title = {{{How the Display of the Transaction Count Affects the Purchase Intention}}}, year = {{2022}}, } @article{30511, abstract = {{AbstractMany critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents VarAlyzer, a novel static analysis approach for software product lines. VarAlyzer first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. VarAlyzer ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying VarAlyzer enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.}}, author = {{Schubert, Philipp and Gazzillo, Paul and Patterson, Zach and Braha, Julian and Schiebel, Fabian and Hermann, Ben and Wei, Shiyi and Bodden, Eric}}, issn = {{0928-8910}}, journal = {{Automated Software Engineering}}, keywords = {{inter-procedural static analysis, software product lines, preprocessor, LLVM, C/C++}}, number = {{1}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Static data-flow analysis for software product lines in C}}}, doi = {{10.1007/s10515-022-00333-1}}, volume = {{29}}, year = {{2022}}, } @inproceedings{30939, author = {{Vorbohle, Christian and Kundisch, Dennis}}, booktitle = {{Proceedings of the 30th European Conference on Information Systems (ECIS)}}, location = {{Timișoara, Romania}}, title = {{{Overcoming Silos: A Review of Business Model Modeling Languages for Business Ecosystems}}}, year = {{2022}}, } @inproceedings{30734, author = {{Althaus, Maike and Poniatowski, Martin and Kundisch, Dennis}}, location = {{Madrid, Spain}}, title = {{{Tackling Crises Together? - An Econometric Analysis of Charitable Crowdfunding During the COVID-19 Pandemic}}}, year = {{2022}}, } @inproceedings{30212, author = {{Vorbohle, Christian and Kundisch, Dennis}}, title = {{{Key Properties of Sustainable Business Ecosystem Relationships}}}, year = {{2022}}, } @inproceedings{28999, author = {{Grieger, Nicole and Seutter, Janina and Kundisch, Dennis}}, booktitle = {{Tagungsband der 17. Internationalen Tagung Wirtschaftsinformatik 2022}}, location = {{Nürnberg, Germany}}, title = {{{Rollercoaster of Emotions – A Semantic Analysis of Fundraising Campaigns over the Course of the Covid-19 Pandemic}}}, year = {{2022}}, } @inproceedings{32811, abstract = {{The decentralized nature of multi-agent systems requires continuous data exchange to achieve global objectives. In such scenarios, Age of Information (AoI) has become an important metric of the freshness of exchanged data due to the error-proneness and delays of communication systems. Communication systems usually possess dependencies: the process describing the success or failure of communication is highly correlated when these attempts are ``close'' in some domain (e.g. in time, frequency, space or code as in wireless communication) and is, in general, non-stationary. To study AoI in such scenarios, we consider an abstract event-based AoI process $\Delta(n)$, expressing time since the last update: If, at time $n$, a monitoring node receives a status update from a source node (event $A(n-1)$ occurs), then $\Delta(n)$ is reset to one; otherwise, $\Delta(n)$ grows linearly in time. This AoI process can thus be viewed as a special random walk with resets. The event process $A(n)$ may be nonstationary and we merely assume that its temporal dependencies decay sufficiently, described by $\alpha$-mixing. We calculate moment bounds for the resulting AoI process as a function of the mixing rate of $A(n)$. Furthermore, we prove that the AoI process $\Delta(n)$ is itself $\alpha$-mixing from which we conclude a strong law of large numbers for $\Delta(n)$. These results are new, since AoI processes have not been studied so far in this general strongly mixing setting. This opens up future work on renewal processes with non-independent interarrival times.}}, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, booktitle = {{Proceedings of the 58th Allerton Conference on Communication, Control, and Computing}}, title = {{{Age of Information Process under Strongly Mixing Communication -- Moment Bound, Mixing Rate and Strong Law}}}, year = {{2022}}, } @inproceedings{30793, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, booktitle = {{Proceedings of the 14th International Conference on Agents and Artificial Intelligence}}, publisher = {{SCITEPRESS - Science and Technology Publications}}, title = {{{Multi-agent Policy Gradient Algorithms for Cyber-physical Systems with Lossy Communication}}}, doi = {{10.5220/0010845400003116}}, year = {{2022}}, } @inproceedings{34082, abstract = {{Gender bias may emerge from an unequal representation of agency and power, for example, by portraying women frequently as passive and powerless ("She accepted her future'') and men as proactive and powerful ("He chose his future''). When language models learn from respective texts, they may reproduce or even amplify the bias. An effective way to mitigate bias is to generate counterfactual sentences with opposite agency and power to the training. Recent work targeted agency-specific verbs from a lexicon to this end. We argue that this is insufficient, due to the interaction of agency and power and their dependence on context. In this paper, we thus develop a new rewriting model that identifies verbs with the desired agency and power in the context of the given sentence. The verbs' probability is then boosted to encourage the model to rewrite both connotations jointly. According to automatic metrics, our model effectively controls for power while being competitive in agency to the state of the art. In our evaluation, human annotators favored its counterfactuals in terms of both connotations, also deeming its meaning preservation better.}}, author = {{Stahl, Maja and Spliethöver, Maximilian and Wachsmuth, Henning}}, booktitle = {{Proceedings of the Fifth Workshop on Natural Language Processing and Computational Social Science}}, location = {{Abu Dhabi, United Arab Emirates}}, title = {{{To Prefer or to Choose? Generating Agency and Power Counterfactuals Jointly for Gender Bias Mitigation}}}, year = {{2022}}, } @unpublished{30790, abstract = {{Iterative distributed optimization algorithms involve multiple agents that communicate with each other, over time, in order to minimize/maximize a global objective. In the presence of unreliable communication networks, the Age-of-Information (AoI), which measures the freshness of data received, may be large and hence hinder algorithmic convergence. In this paper, we study the convergence of general distributed gradient-based optimization algorithms in the presence of communication that neither happens periodically nor at stochastically independent points in time. We show that convergence is guaranteed provided the random variables associated with the AoI processes are stochastically dominated by a random variable with finite first moment. This improves on previous requirements of boundedness of more than the first moment. We then introduce stochastically strongly connected (SSC) networks, a new stochastic form of strong connectedness for time-varying networks. We show: If for any $p \ge0$ the processes that describe the success of communication between agents in a SSC network are $\alpha$-mixing with $n^{p-1}\alpha(n)$ summable, then the associated AoI processes are stochastically dominated by a random variable with finite $p$-th moment. In combination with our first contribution, this implies that distributed stochastic gradient descend converges in the presence of AoI, if $\alpha(n)$ is summable.}}, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, booktitle = {{arXiv:2201.11343}}, title = {{{Distributed gradient-based optimization in the presence of dependent aperiodic communication}}}, year = {{2022}}, } @article{34109, author = {{Hagengruber, Ruth Edith}}, journal = {{La Lettre clandestine n° 30: Émilie Du Châtelet et la littérature clandestine. Moreau, P.F. & Seguin, M.S. (Eds.). Paris}}, pages = {{99 – 115}}, publisher = {{Classiques Garnier}}, title = {{{Du Châtelet et la tradition critique de la Bible. De la ‘philofolie’ aux Examens}}}, year = {{2022}}, } @inproceedings{32855, author = {{Clausing, Lennart and Platzner, Marco}}, booktitle = {{2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)}}, location = {{ Lyon, France}}, pages = {{120--127}}, publisher = {{IEEE}}, title = {{{ReconOS64: A Hardware Operating System for Modern Platform FPGAs with 64-Bit Support}}}, doi = {{10.1109/ipdpsw55747.2022.00029}}, year = {{2022}}, } @unpublished{30791, abstract = {{We present sufficient conditions that ensure convergence of the multi-agent Deep Deterministic Policy Gradient (DDPG) algorithm. It is an example of one of the most popular paradigms of Deep Reinforcement Learning (DeepRL) for tackling continuous action spaces: the actor-critic paradigm. In the setting considered herein, each agent observes a part of the global state space in order to take local actions, for which it receives local rewards. For every agent, DDPG trains a local actor (policy) and a local critic (Q-function). The analysis shows that multi-agent DDPG using neural networks to approximate the local policies and critics converge to limits with the following properties: The critic limits minimize the average squared Bellman loss; the actor limits parameterize a policy that maximizes the local critic's approximation of $Q_i^*$, where $i$ is the agent index. The averaging is with respect to a probability distribution over the global state-action space. It captures the asymptotics of all local training processes. Finally, we extend the analysis to a fully decentralized setting where agents communicate over a wireless network prone to delays and losses; a typical scenario in, e.g., robotic applications.}}, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, booktitle = {{arXiv:2201.00570}}, title = {{{Asymptotic Convergence of Deep Multi-Agent Actor-Critic Algorithms}}}, year = {{2022}}, } @inproceedings{32590, author = {{Richter, Cedric and Wehrheim, Heike}}, booktitle = {{2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}}, pages = {{162--173}}, title = {{{Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}}}, doi = {{10.1109/ICST53961.2022.00027}}, year = {{2022}}, } @inproceedings{32591, author = {{Richter, Cedric and Wehrheim, Heike}}, booktitle = {{2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}}, pages = {{418--422}}, title = {{{TSSB-3M: Mining single statement bugs at massive scale}}}, doi = {{10.1145/3524842.3528505}}, year = {{2022}}, } @misc{32398, author = {{Siek, Hanna}}, title = {{{Bringing Structure to Structure-Preserving Signatures: Overview, Implementation and Comparison of Selected SPS Schemes}}}, year = {{2022}}, } @misc{31485, author = {{Kramer, Paul}}, title = {{{On Transforming Lattice-Based Cryptography to the Ring Setting}}}, year = {{2022}}, } @inproceedings{31806, abstract = {{The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds}}, author = {{Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}}, keywords = {{2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba}}, location = {{Barcelona (Spain)}}, title = {{{ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}}}, doi = {{10.1145/3511095.3531287}}, year = {{2022}}, } @article{32854, author = {{Redder, Adrian and Ramaswamy, Arunselvan and Karl, Holger}}, journal = {{IFAC-PapersOnLine}}, number = {{13}}, pages = {{133–138}}, publisher = {{Elsevier}}, title = {{{Practical Network Conditions for the Convergence of Distributed Optimization}}}, volume = {{55}}, year = {{2022}}, } @inproceedings{33253, author = {{Hansmeier, Tim and Brede, Mathis and Platzner, Marco}}, booktitle = {{GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion}}, location = {{Boston, MA, USA}}, pages = {{2071--2079}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{XCS on Embedded Systems: An Analysis of Execution Profiles and Accelerated Classifier Deletion}}}, doi = {{10.1145/3520304.3533977}}, year = {{2022}}, } @inproceedings{33274, author = {{Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}}, booktitle = {{Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}}, pages = {{51 -- 61}}, title = {{{Analyzing Culture-Specific Argument Structures in Learner Essays}}}, year = {{2022}}, } @inproceedings{33491, author = {{Maack, Marten and Pukrop, Simon and Rasmussen, Anna Rodriguez}}, booktitle = {{30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany}}, editor = {{Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva and Herman, Grzegorz}}, pages = {{77:1–77:13}}, publisher = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}}, title = {{{(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling}}}, doi = {{10.4230/LIPIcs.ESA.2022.77}}, volume = {{244}}, year = {{2022}}, } @techreport{32106, abstract = {{We study the consequences of modeling asymmetric bargaining power in two-person bargaining problems. Comparing application of an asymmetric version of a bargaining solution to an upfront modification of the disagreement point, the resulting distortion crucially depends on the bargaining solution concept. While for the Kalai-Smorodinsky solution weaker players benefit from modifying the disagreement point, the situation is reversed for the Nash bargaining solution. There, weaker players are better off in the asymmetric bargaining solution. When comparing application of the asymmetric versions of the Nash and the Kalai-Smorodinsky solutions, we demonstrate that there is an upper bound for the weight of a player, so that she is better off with the Nash bargaining solution. This threshold is ultimately determined by the relative utilitarian bargaining solution. From a mechanism design perspective, our results provide valuable information for a social planner, when implementing a bargaining solution for unequally powerful players.}}, author = {{Haake, Claus-Jochen and Streck, Thomas}}, keywords = {{Asymmetric bargaining power, Nash bargaining solution, Kalai-Smorodinsky bargaining solution}}, pages = {{17}}, title = {{{Distortion through modeling asymmetric bargaining power}}}, volume = {{148}}, year = {{2022}}, } @inproceedings{34136, author = {{Grynko, Yevgen and Shkuratov, Yuriy and Alhaddad, Samer and Förstner, Jens}}, keywords = {{tet_topic_scattering}}, location = {{Granada, Spain}}, publisher = {{Copernicus GmbH}}, title = {{{Light backscattering from numerical analog of planetary regoliths}}}, doi = {{ 10.5194/epsc2022-151}}, year = {{2022}}, } @article{34132, abstract = {{How can Knowledge In/Equity be addressed in qualitative research by taking the idea of Open Science into account? Two projects from the Open Science Fellows Programme by Wikimedia Deutschland will be used to illustrate how Open Science practices can succeed in qualitative research, thereby reducing In/Equity. In this context, In/Equity is considered as a fair and equal representation of people, their knowledge and insights and comprehends questions about how epistemic, structural, institutional and personal biases generate and shape knowledge as guidance. Three questions guide this approach: firstly, what do we understand by In/Equity in the context of knowledge production in these projects? Secondly, who will be involved in knowledge generation and to what extent will they be valued or unvalued? Thirdly, how can data be made accessible for re-use to enable true participation and sharing?}}, author = {{Steinhardt, Isabel and Kruschick, Felicitas}}, issn = {{2367-7163}}, journal = {{Research Ideas and Outcomes}}, keywords = {{Open Science, Knowledge Equity, Qualitative Methods}}, publisher = {{Pensoft Publishers}}, title = {{{Knowledge Equity and Open Science in qualitative research – Practical research considerations}}}, doi = {{10.3897/rio.8.e86387}}, volume = {{8}}, year = {{2022}}, } @article{32088, abstract = {{Subwavelength dielectric resonators assembled into metasurfaces have become a versatile tool for miniaturizing optical components approaching the nanoscale. An important class of metasurface functionalities is associated with asymmetry in both the generation and transmission of light with respect to reversals of the positions of emitters and receivers. The nonlinear light–matter interaction in metasurfaces offers a promising pathway towards miniaturization of the asymmetric control of light. Here we demonstrate asymmetric parametric generation of light in nonlinear metasurfaces. We assemble dissimilar nonlinear dielectric resonators into translucent metasurfaces that produce images in the visible spectral range on being illuminated by infrared radiation. By design, the metasurfaces produce different and completely independent images for the reversed direction of illumination, that is, when the positions of the infrared emitter and the visible light receiver are exchanged. Nonlinearity-enabled asymmetric control of light by subwavelength resonators paves the way towards novel nanophotonic components via dense integration of large quantities of nonlinear resonators into compact metasurface designs.}}, author = {{Kruk, Sergey S. and Wang, Lei and Sain, Basudeb and Dong, Zhaogang and Yang, Joel and Zentgraf, Thomas and Kivshar, Yuri}}, issn = {{1749-4885}}, journal = {{Nature Photonics}}, keywords = {{Atomic and Molecular Physics, and Optics, Electronic, Optical and Magnetic Materials}}, pages = {{561–565}}, publisher = {{Springer Science and Business Media LLC}}, title = {{{Asymmetric parametric generation of images with nonlinear dielectric metasurfaces}}}, doi = {{10.1038/s41566-022-01018-7}}, volume = {{16}}, year = {{2022}}, } @inproceedings{34140, abstract = {{In this paper, machine learning techniques will be used to classify different PCB layouts given their electromagnetic frequency spectra. These spectra result from a simulated near-field measurement of electric field strengths at different locations. Measured values consist of real and imaginary parts (amplitude and phase) in X, Y and Z directions. Training data was obtained in the time domain by varying transmission line geometries (size, distance and signaling). It was then transformed into the frequency domain and used as deep neural network input. Principal component analysis was applied to reduce the sample dimension. The results show that classifying different designs is possible with high accuracy based on synthetic data. Future work comprises measurements of real, custom-made PCB with varying parameters to adapt the simulation model and also test the neural network. Finally, the trained model could be used to give hints about the error’s cause when overshooting EMC limits.}}, author = {{Maalouly, Jad and Hemker, Dennis and Hedayat, Christian and Rückert, Christian and Kaufmann, Ivan and Olbrich, Marcel and Lange, Sven and Mathis, Harald}}, booktitle = {{2022 Kleinheubach Conference}}, keywords = {{emc, pcb, electronic system development, machine learning, neural network}}, location = {{Miltenberg, Germany}}, publisher = {{IEEE}}, title = {{{AI Assisted Interference Classification to Improve EMC Troubleshooting in Electronic System Development}}}, year = {{2022}}, } @inbook{34108, author = {{Hagengruber, Ruth Edith}}, booktitle = {{Sitzungsberichte der Leibniz-Sozietät der Wissenschaften 150/151, Jahrgang 2022: „Cyberscience – Wissenschaftsforschung und Informatik. Digitale Medien und die Zukunft der Kultur wissenschaftlicher Tätigkeit. Arbeitskreis „Emergente Systeme/Informatik und Gesellschaft“ der Leibniz-Sozietät der Wissenschaften zu Berlin in Kooperation mit der Gesellschaft für Wissenschaftsforschung“}}, editor = {{Banse, Gerhard and Fuchs-Kittowski, Klaus}}, pages = {{253–256}}, title = {{{Die „dritte Wissensdimension“. Eine Epistemologie für eine neue Wissenswelt}}}, year = {{2022}}, } @inbook{32179, abstract = {{This work addresses the automatic resolution of software requirements. In the vision of On-The-Fly Computing, software services should be composed on demand, based solely on natural language input from human users. To enable this, we build a chatbot solution that works with human-in-the-loop support to receive, analyze, correct, and complete their software requirements. The chatbot is equipped with a natural language processing pipeline and a large knowledge base, as well as sophisticated dialogue management skills to enhance the user experience. Previous solutions have focused on analyzing software requirements to point out errors such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate with users to efficiently produce correct requirements. We developed and compared three different chatbot apps that can work with built-in knowledge. We rely on ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own knowledge base, Rasa is the best system to combine the text mining and knowledge solutions at our disposal. The evaluation shows that users accept 73% of the suggested answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot.}}, author = {{Kersting, Joschka and Ahmed, Mobeen and Geierhos, Michaela}}, booktitle = {{HCI International 2022 Posters}}, editor = {{Stephanidis, Constantine and Antona, Margherita and Ntoa, Stavroula}}, isbn = {{9783031064166}}, issn = {{1865-0929}}, keywords = {{On-The-Fly Computing, Chatbot, Knowledge Base}}, location = {{Virtual}}, pages = {{419----426}}, publisher = {{Springer International Publishing}}, title = {{{Chatbot-Enhanced Requirements Resolution for Automated Service Compositions}}}, doi = {{10.1007/978-3-031-06417-3_56}}, volume = {{1580}}, year = {{2022}}, } @inproceedings{34152, author = {{Otroshi, Mortaza and Meschut, Gerson}}, location = {{Rostock}}, publisher = {{Europäische Forschungsgesellschaft für Blechverarbeitung e.V. }}, title = {{{Methodenentwicklung zur Verbesserung der Schädigungsmodellierung in der numerischen 3D-Belastungssimulation mechanischer Fügeverfahren unter Berücksichtigung der fügeinduzierten Vorbeanspruchung}}}, year = {{2022}}, } @inproceedings{34155, author = {{Krauter, Stefan and Bendfeld, Jörg}}, booktitle = {{Proceedings of the 8th World Conference on Photovoltaik Energy Conversion}}, location = {{Milano / Italy}}, title = {{{Microinverter PV Systems: New Efficiency Rankings and Formula for Energy Yield Assessment for any PV Panel Size at different Microinverter types}}}, year = {{2022}}, } @inproceedings{34156, author = {{Kakande, Josephine Nakato and Philipo, Godiana Hagile and Krauter, Stefan}}, booktitle = {{Proceedings of the 8th World Conference on Photovoltaik Energy Conversion}}, location = {{Milano / Italy}}, title = {{{Optimal Design of a Semi Grid-Connected PV System for a Site in Lwak, Kenya Using HOMER}}}, year = {{2022}}, } @inproceedings{34153, author = {{Otroshi, Mortaza and Meschut, Gerson}}, publisher = {{Europäische Forschungsgesellschaft für Blechverarbeitung e.V.}}, title = {{{Schädigungsmodellierung von Hilfsfügeelementen beim mechanischen Fügen von Stahlwerkstoffen}}}, year = {{2022}}, } @phdthesis{29769, abstract = {{Wettstreit zwischen der Entwicklung neuer Hardwaretrojaner und entsprechender Gegenmaßnahmen beschreiten Widersacher immer raffiniertere Wege um Schaltungsentwürfe zu infizieren und dabei selbst fortgeschrittene Test- und Verifikationsmethoden zu überlisten. Abgesehen von den konventionellen Methoden um einen Trojaner in eine Schaltung für ein Field-programmable Gate Array (FPGA) einzuschleusen, können auch die Entwurfswerkzeuge heimlich kompromittiert werden um einen Angreifer dabei zu unterstützen einen erfolgreichen Angriff durchzuführen, der zum Beispiel Fehlfunktionen oder ungewollte Informationsabflüsse bewirken kann. Diese Dissertation beschäftigt sich hauptsächlich mit den beiden Blickwinkeln auf Hardwaretrojaner in rekonfigurierbaren Systemen, einerseits der Perspektive des Verteidigers mit einer Methode zur Erkennung von Trojanern auf der Bitstromebene, und andererseits derjenigen des Angreifers mit einer neuartigen Angriffsmethode für FPGA Trojaner. Für die Verteidigung gegen den Trojaner ``Heimtückische LUT'' stellen wir die allererste erfolgreiche Gegenmaßnahme vor, die durch Verifikation mittels Proof-carrying Hardware (PCH) auf der Bitstromebene direkt vor der Konfiguration der Hardware angewendet werden kann, und präsentieren ein vollständiges Schema für den Entwurf und die Verifikation von Schaltungen für iCE40 FPGAs. Für die Gegenseite führen wir einen neuen Angriff ein, welcher bösartiges Routing im eingefügten Trojaner ausnutzt um selbst im fertigen Bitstrom in einem inaktiven Zustand zu verbleiben: Hierdurch kann dieser neuartige Angriff zur Zeit weder von herkömmlichen Test- und Verifikationsmethoden, noch von unserer vorher vorgestellten Verifikation auf der Bitstromebene entdeckt werden.}}, author = {{Ahmed, Qazi Arbab}}, keywords = {{FPGA Security, Hardware Trojans, Bitstream-level Trojans, Bitstream Verification}}, publisher = {{ Paderborn University, Paderborn, Germany}}, title = {{{Hardware Trojans in Reconfigurable Computing}}}, doi = {{10.17619/UNIPB/1-1271}}, year = {{2022}}, } @inproceedings{34166, abstract = {{Within innovation management, choosing the best fitting product idea is the most important decision point. The future existence and success of the organization is depending on selected product ideas. To find the best fitting idea for an organization, it needs evaluation criteria representing the organizations mission Therefore, this study focuses on a holistic overview about evaluation criteria and on supporting organizations in the process to select its individual evaluation criteria. Based on a literature study, existing approaches regarding evaluation criteria in product idea selection are identified and a list of evaluation criteria is reworked. Using the list of evaluation criteria, a prioritization method is created. Within an interview with experts in innovation management, the method is discussed regarding usability and the level of assistance in product idea selection. The developed criteria can be used directly by innovation manager and industrial practitioners to evaluate potential product ideas.}}, author = {{Gräßler, Iris and Koch, Anna-Sophie}}, booktitle = {{XXXIII Proceedings of the ISPIM Innovation Conference}}, isbn = {{978-952-335-694-8}}, keywords = {{innovation management, evaluation criteria, idea selection, idea evaluation, meta-study}}, location = {{Copenhagen, Denmark}}, title = {{{Evaluation Criteria in Product Idea Selection Decisions}}}, year = {{2022}}, } @phdthesis{34174, abstract = {{Anforderungsänderungen sind ein wesentlicher Grund für Ineffizienzen und Projektfehlschläge in der Entwicklung komplexer technischer Systeme. Proaktives Management von Anforderungsänderungen hat das Potenzial, den Umgang mit Anforderungsänderungen effizienter zu gestalten. Dafür ist ein systematischer Ansatz erforderlich, der eine ganzheitliche Bewertung und Handhabung des Änderungsrisikos im industriellen Entwicklungskontext ermöglicht. Im Rahmen dieser Dissertation wird mit der ProMaRC-Methodik ein neuartiger Ansatz für das proaktive Management von Anforderungsänderungen vorgestellt. Die Methodik wurde in enger Zusammenarbeit mit Industrieanwender:innen aus der Automobilindustrie entwickelt und anhand von fünf Fallstudien validiert. Mittels automatisierter Abhängigkeitsanalyse auf Grundlage künstlicher Intelligenz wird der Anwendungsaufwand gegenüber bestehenden Ansätzen reduziert. Die teilautomatisierte Bewertung und Handhabung der Änderungswahrscheinlichkeit und -auswirkung erfolgt anhand eines modifizierten PageRank-Algorithmus und umfasst erstmalig alle für die Risikoanalyse relevanten Einflussfaktoren. Die Validierung belegt, dass durch die ProMaRC-Methodik eine überzeugende Kombination aus praxistauglichem Anwendungsaufwand und Vollständigkeit der Analyse erzielt wird. Damit erschließt diese Dissertation das bisher kaum beachtete Forschungsfeld des proaktiven Managements von Anforderungsänderungen und fördert eine effizientere Produktentwicklung.}}, author = {{Oleff, Christian}}, publisher = {{LibreCat University}}, title = {{{Proaktives Management von Anforderungsänderungen in der Entwicklung komplexer technischer Systeme}}}, doi = {{10.17619/UNIPB/1-1600}}, volume = {{406}}, year = {{2022}}, }