[{"abstract":[{"text":"Reputation systems to rate companies’ performances remain largely unexplored inresearch and are scarcely used in business-to-business (B2B) practice. Such systemsare essential for businesses seeking trustworthy partners, as they help reduce infor-mation asymmetry, lower buyers’ transaction risks, and allow high-quality serviceproviders to justify premium pricing. Unlike traditional review-based systems in thebusiness-to-consumer (B2C) context, we propose a B2B reputation mechanism inwhich buyers commit to a rating payment before a transaction. Once the buyer final-izes the rating, this payment is executed and recorded on a blockchain as an immu-table, secure ledger. Our system mimics natural trust-building mechanisms with rat-ings that are (1) monetary-based, (2) stake-based, (3) non-aggregated, (4) involvecounter-ratings, (5) selectively sellable, (6) individually comparable, (7) stored ona blockchain, (8) and monitored by a third instance. This system provides a novelapproach to fostering trust in B2B transactions by reducing information asymme-try and transaction risk. We illustrate the mechanism’s application in the consultingsector. Our analysis has identified 23 institutional trust and distrust dimensions thatpromote establishing institutional trust through the proposed mechanism. Qualita-tive interviews suggest that, while complex and challenging to apply, this mecha-nism can foster trust in B2B transactions. Given the low maturity in the applicationdomain—rating professional business services with business reputation systems—and solution domain—using monetary stakes for ratings, this system stands as apotential invention.","lang":"eng"}],"doi":"https://doi.org/10.1007/s10257-025-00702-9","has_accepted_license":"1","file":[{"file_name":"Hemmrich_et_al-2025-Information_Systems_and_e-Business_Management.pdf","file_size":1440251,"creator":"hemmrich","date_created":"2025-05-28T08:05:18Z","content_type":"application/pdf","file_id":"60051","access_level":"closed","relation":"main_file","date_updated":"2025-05-28T08:05:18Z","success":1}],"title":"Blockchain‑based reputation systemsfor business‑to‑business services: designing a reputation mechanism to reduce information asymmetry in professional consulting","external_id":{"unknown":["https://doi.org/10.1007/s10257-025-00702-9"]},"main_file_link":[{"url":"https://link.springer.com/epdf/10.1007/s10257-025-00702-9?sharing_token=fOiWqZx_ScKFAKjxu5UqWPe4RwlQNchNByi7wbcMAY6mjxpZFPB3OtpVT0rAZf9eEBt3_qXIVcZ67l3R9JVYasmuCsIimzE-xfP0N5Rimun248j0jFOnL1eBu4rypKSDFnbmR3kJ5xx-HLnCXvPvQPwpm09qOkS9GSNsiG-du60%3D","open_access":"1"}],"keyword":["Information asymmetry","Trust","Reputation system","Monetary rating","Blockchain","Consulting"],"user_id":"83557","oa":"1","type":"journal_article","ddc":["000"],"quality_controlled":"1","publication":"Information Systems and e-Business Management","issue":"1","volume":23,"intvolume":"        23","author":[{"first_name":"Simon","full_name":"Hemmrich, Simon","last_name":"Hemmrich","id":"83557"},{"last_name":"Nissen","first_name":"Volker","full_name":"Nissen, Volker"},{"first_name":"Daniel","full_name":"Beverungen, Daniel","id":"59677","last_name":"Beverungen"},{"last_name":"Pauls","first_name":"Josias Daniel Miño","full_name":"Pauls, Josias Daniel Miño"}],"article_type":"original","department":[{"_id":"195"}],"jel":["D81","D82","L86","L10","M30"],"publication_status":"published","citation":{"short":"S. Hemmrich, V. Nissen, D. Beverungen, J.D.M. Pauls, Information Systems and E-Business Management 23 (2025).","mla":"Hemmrich, Simon, et al. “Blockchain‑based Reputation Systemsfor Business‑to‑business Services: Designing a Reputation Mechanism to Reduce Information Asymmetry in Professional Consulting.” <i>Information Systems and E-Business Management</i>, vol. 23, no. 1, Springer, 2025, doi:<a href=\"https://doi.org/10.1007/s10257-025-00702-9\">https://doi.org/10.1007/s10257-025-00702-9</a>.","bibtex":"@article{Hemmrich_Nissen_Beverungen_Pauls_2025, title={Blockchain‑based reputation systemsfor business‑to‑business services: designing a reputation mechanism to reduce information asymmetry in professional consulting}, volume={23}, DOI={<a href=\"https://doi.org/10.1007/s10257-025-00702-9\">https://doi.org/10.1007/s10257-025-00702-9</a>}, number={1}, journal={Information Systems and e-Business Management}, publisher={Springer}, author={Hemmrich, Simon and Nissen, Volker and Beverungen, Daniel and Pauls, Josias Daniel Miño}, year={2025} }","chicago":"Hemmrich, Simon, Volker Nissen, Daniel Beverungen, and Josias Daniel Miño Pauls. “Blockchain‑based Reputation Systemsfor Business‑to‑business Services: Designing a Reputation Mechanism to Reduce Information Asymmetry in Professional Consulting.” <i>Information Systems and E-Business Management</i> 23, no. 1 (2025). <a href=\"https://doi.org/10.1007/s10257-025-00702-9\">https://doi.org/10.1007/s10257-025-00702-9</a>.","ieee":"S. Hemmrich, V. Nissen, D. Beverungen, and J. D. M. Pauls, “Blockchain‑based reputation systemsfor business‑to‑business services: designing a reputation mechanism to reduce information asymmetry in professional consulting,” <i>Information Systems and e-Business Management</i>, vol. 23, no. 1, 2025, doi: <a href=\"https://doi.org/10.1007/s10257-025-00702-9\">https://doi.org/10.1007/s10257-025-00702-9</a>.","ama":"Hemmrich S, Nissen V, Beverungen D, Pauls JDM. Blockchain‑based reputation systemsfor business‑to‑business services: designing a reputation mechanism to reduce information asymmetry in professional consulting. <i>Information Systems and e-Business Management</i>. 2025;23(1). doi:<a href=\"https://doi.org/10.1007/s10257-025-00702-9\">https://doi.org/10.1007/s10257-025-00702-9</a>","apa":"Hemmrich, S., Nissen, V., Beverungen, D., &#38; Pauls, J. D. M. (2025). Blockchain‑based reputation systemsfor business‑to‑business services: designing a reputation mechanism to reduce information asymmetry in professional consulting. <i>Information Systems and E-Business Management</i>, <i>23</i>(1). <a href=\"https://doi.org/10.1007/s10257-025-00702-9\">https://doi.org/10.1007/s10257-025-00702-9</a>"},"status":"public","language":[{"iso":"eng"}],"year":"2025","publisher":"Springer","date_created":"2025-05-28T08:12:28Z","date_updated":"2026-04-02T04:32:13Z","_id":"60050","file_date_updated":"2025-05-28T08:05:18Z"},{"date_created":"2026-04-02T03:52:09Z","publisher":"Universität Paderborn","type":"dissertation","year":"2025","language":[{"iso":"eng"}],"status":"public","_id":"65309","page":"347","date_updated":"2026-04-02T04:31:57Z","title":"A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets","author":[{"id":"83557","last_name":"Hemmrich","first_name":"Simon","full_name":"Hemmrich, Simon"}],"place":"Paderborn","supervisor":[{"first_name":"Daniel","full_name":"Beverungen, Daniel","last_name":"Beverungen"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","first_name":"Dennis"}],"doi":"https://doi.org/10.17619/UNIPB/1-2414","citation":{"bibtex":"@book{Hemmrich_2025, place={Paderborn}, title={A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-2414\">https://doi.org/10.17619/UNIPB/1-2414</a>}, publisher={Universität Paderborn}, author={Hemmrich, Simon}, year={2025} }","mla":"Hemmrich, Simon. <i>A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets</i>. Universität Paderborn, 2025, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2414\">https://doi.org/10.17619/UNIPB/1-2414</a>.","short":"S. Hemmrich, A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets, Universität Paderborn, Paderborn, 2025.","apa":"Hemmrich, S. (2025). <i>A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-2414\">https://doi.org/10.17619/UNIPB/1-2414</a>","ama":"Hemmrich S. <i>A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets</i>. Universität Paderborn; 2025. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2414\">https://doi.org/10.17619/UNIPB/1-2414</a>","ieee":"S. Hemmrich, <i>A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets</i>. Paderborn: Universität Paderborn, 2025.","chicago":"Hemmrich, Simon. <i>A Design Theory for Blockchain-Based Reputation Systems : Trust and Coordination in B2B Markets</i>. Paderborn: Universität Paderborn, 2025. <a href=\"https://doi.org/10.17619/UNIPB/1-2414\">https://doi.org/10.17619/UNIPB/1-2414</a>."},"user_id":"83557","keyword":["Reputation Systems","Rating systems","monetary ratings","incentive mechanism","systems theory","Market coordination","advanced review system"],"publication_status":"published","jel":["D8"],"department":[{"_id":"195"}]},{"file":[{"date_created":"2026-04-02T12:46:09Z","content_type":"application/pdf","access_level":"closed","file_id":"65354","file_size":1878995,"file_name":"ICU_2025_Bornmann.pdf","creator":"hemsel","success":1,"relation":"main_file","date_updated":"2026-04-02T12:46:09Z"}],"author":[{"full_name":"Bornmann, Peter","first_name":"Peter","last_name":"Bornmann"},{"last_name":"Littmann","first_name":"Walter","full_name":"Littmann, Walter"},{"full_name":"Scheidemann, Claus","first_name":"Claus","id":"38259","last_name":"Scheidemann"},{"full_name":"Hemsel, Tobias","first_name":"Tobias","last_name":"Hemsel","id":"210"}],"conference":{"start_date":"2025-09-21","location":"Paderborn, Germany","name":"International Congress on Ultrasonics (ICU)","end_date":"2025-09-25"},"title":"Innovative lead-free ultrasonic bending transducers for low to medium power applications","abstract":[{"lang":"eng","text":"Nowadays ultrasound technology is established in various fields of application like industrial production or medical technology. Besides high power ultrasound applications like ultrasonic cleaning and ultrasonic welding, which are often not strongly restricted regarding their weight, costs, and construction space, there are many applications in the low to medium power range like handheld surgical instruments, medical inhalers, or ultrasonic cutters. For the latter there is often a strong demand for low weight and construction space and low costs to be competitive in mass production. Another challenge that arises from the RoHS-directive [1] is, that new ultrasonic devices should avoid the use of lead-containing PZT-materials. Against this background there is a demand for lead-free, small and lightweight and cost-effective ultrasonic transducers.\r\nIn many of the above-mentioned applications, pre-stressed Bolted-Langevine-Transducers (BLT) based on lead-containing PZT-materials are established to generate ultrasonic vibrations. These are quite advantageous in many ways and can be built tailored to each application and even for high power of thousands of watts. But due to the required steps during their manufacturing process (machining parts, assembly, pre-stressing, frequency tuning, …), these transducers remain expensive. Furthermore, due to the operation in resonance, the construction space of these transducers is linked to their wavelength and cannot be reduced remarkably.\r\nFor these reasons, our aim is to present an innovative lead-free ultrasonic transducer for low to medium power applications, that is based on bending vibrations instead of longitudinal vibrations. This design enables to build very small transducers. Furthermore, due to their simple construction, these transducers can be built at low manufacturing costs and are well suited for industrial mass production. The use of lead-free piezoelectric materials makes this transducer design ready for future applications.\r\nIn our contribution we will present the model-based design of a lead-free 30 kHz bending transducer for applications up to 10 W. Furthermore, the comprehensive experimental analysis of this transducer-prototype in applications like mist generation or ultrasonic drilling will be presented. The results will be compared to a PZT-based bending transducer and a classical BLT to show the potential and limits of these kind of transducers and lead-free materials.\r\n"}],"has_accepted_license":"1","user_id":"210","citation":{"bibtex":"@inproceedings{Bornmann_Littmann_Scheidemann_Hemsel_2025, title={Innovative lead-free ultrasonic bending transducers for low to medium power applications}, author={Bornmann, Peter and Littmann, Walter and Scheidemann, Claus and Hemsel, Tobias}, year={2025} }","mla":"Bornmann, Peter, et al. <i>Innovative Lead-Free Ultrasonic Bending Transducers for Low to Medium Power Applications</i>. 2025.","short":"P. Bornmann, W. Littmann, C. Scheidemann, T. Hemsel, in: 2025.","ama":"Bornmann P, Littmann W, Scheidemann C, Hemsel T. Innovative lead-free ultrasonic bending transducers for low to medium power applications. In: ; 2025.","apa":"Bornmann, P., Littmann, W., Scheidemann, C., &#38; Hemsel, T. (2025). <i>Innovative lead-free ultrasonic bending transducers for low to medium power applications</i>. International Congress on Ultrasonics (ICU), Paderborn, Germany.","ieee":"P. Bornmann, W. Littmann, C. Scheidemann, and T. Hemsel, “Innovative lead-free ultrasonic bending transducers for low to medium power applications,” presented at the International Congress on Ultrasonics (ICU), Paderborn, Germany, 2025.","chicago":"Bornmann, Peter, Walter Littmann, Claus Scheidemann, and Tobias Hemsel. “Innovative Lead-Free Ultrasonic Bending Transducers for Low to Medium Power Applications,” 2025."},"department":[{"_id":"151"}],"ddc":["620"],"date_created":"2026-03-02T11:35:33Z","status":"public","type":"conference","year":"2025","language":[{"iso":"eng"}],"file_date_updated":"2026-04-02T12:46:09Z","_id":"64803","date_updated":"2026-04-02T12:47:18Z"},{"intvolume":"         9","author":[{"id":"103813","last_name":"Kring-Ozuna","full_name":"Kring-Ozuna, Edna","first_name":"Edna"}],"citation":{"short":"E. Kring-Ozuna, Journal of Service Management Research 9 (2025) 2–18.","bibtex":"@article{Kring-Ozuna_2025, title={First impressions matter: Shaping the servicescape to address anonymity and trust in peer-to-peer sharing economy services}, volume={9}, DOI={<a href=\"https://doi.org/10.5771/2511-8676-2025-1-2\">10.5771/2511-8676-2025-1-2</a>}, number={1}, journal={Journal of Service Management Research}, publisher={Nomos Verlag}, author={Kring-Ozuna, Edna}, year={2025}, pages={2–18} }","mla":"Kring-Ozuna, Edna. “First Impressions Matter: Shaping the Servicescape to Address Anonymity and Trust in Peer-to-Peer Sharing Economy Services.” <i>Journal of Service Management Research</i>, vol. 9, no. 1, Nomos Verlag, 2025, pp. 2–18, doi:<a href=\"https://doi.org/10.5771/2511-8676-2025-1-2\">10.5771/2511-8676-2025-1-2</a>.","ieee":"E. Kring-Ozuna, “First impressions matter: Shaping the servicescape to address anonymity and trust in peer-to-peer sharing economy services,” <i>Journal of Service Management Research</i>, vol. 9, no. 1, pp. 2–18, 2025, doi: <a href=\"https://doi.org/10.5771/2511-8676-2025-1-2\">10.5771/2511-8676-2025-1-2</a>.","chicago":"Kring-Ozuna, Edna. “First Impressions Matter: Shaping the Servicescape to Address Anonymity and Trust in Peer-to-Peer Sharing Economy Services.” <i>Journal of Service Management Research</i> 9, no. 1 (2025): 2–18. <a href=\"https://doi.org/10.5771/2511-8676-2025-1-2\">https://doi.org/10.5771/2511-8676-2025-1-2</a>.","apa":"Kring-Ozuna, E. (2025). First impressions matter: Shaping the servicescape to address anonymity and trust in peer-to-peer sharing economy services. <i>Journal of Service Management Research</i>, <i>9</i>(1), 2–18. <a href=\"https://doi.org/10.5771/2511-8676-2025-1-2\">https://doi.org/10.5771/2511-8676-2025-1-2</a>","ama":"Kring-Ozuna E. First impressions matter: Shaping the servicescape to address anonymity and trust in peer-to-peer sharing economy services. <i>Journal of Service Management Research</i>. 2025;9(1):2-18. doi:<a href=\"https://doi.org/10.5771/2511-8676-2025-1-2\">10.5771/2511-8676-2025-1-2</a>"},"publication_status":"published","language":[{"iso":"eng"}],"publication_identifier":{"issn":["2511-8676"]},"year":"2025","status":"public","date_created":"2026-04-01T07:16:15Z","publisher":"Nomos Verlag","date_updated":"2026-04-07T12:43:01Z","_id":"65268","abstract":[{"lang":"eng","text":"The increasing number of multi-unit hosts in peer-to-peer platforms such as Airbnb poses a significant challenge to single-unit hosts, who compete in a highly professionalized market where host-guest interactions have become increasingly anonymous. However, anonymity may undermine trust and affect eWOM, crucial elements for the performance of peer-to-peer platforms, as they heavily rely on mutual trust and positive eWOM to succeed. This study investigated the effects of the presence of hosts’ personal decorations and a local welcome gift on eWOM. Perceived anonymity and trust emerge as mediating mechanisms, such that the presence of personal decorations reduced the guest’s perception of anonymity towards the host, which subsequently increased guest’s trust and their intention to spread positive eWOM. The local welcome gift did not show any significant effects. These insights contribute to servicescape research and offer practical implications for single-unit hosts to differentiate their service experience from that of professional hosts."}],"doi":"10.5771/2511-8676-2025-1-2","title":"First impressions matter: Shaping the servicescape to address anonymity and trust in peer-to-peer sharing economy services","user_id":"103813","type":"journal_article","publication":"Journal of Service Management Research","issue":"1","page":"2-18","volume":9},{"publisher":"LibreCat University","date_created":"2026-03-11T11:05:08Z","ddc":["620"],"status":"public","type":"research_data","year":"2025","_id":"64902","date_updated":"2026-04-20T07:46:37Z","author":[{"orcid":"0009-0004-8545-1165","last_name":"Alptekin","id":"11763","full_name":"Alptekin, Mesut","first_name":"Mesut"}],"title":"Entwicklung einer Augmented Reality basierten Anwendung als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik","doi":"10.17619/UNIPB/1-2483","abstract":[{"text":"Diese Dissertation behandelt die Entwicklung, Erprobung und Evaluation einer mobilen Augmented Reality Anwendung (mAR-App) namens PEARL (Paderborner Elektrotechnik AR Laborpraktikum), die als Vorbereitungsmaßnahme für elektrotechnische Laborpraktika konzipiert wird. Ziel ist es, Studierenden eine zeitlich und örtlich flexible Möglichkeit zu bieten, den realitätsnahen Umgang mit Laborgeräten - primär dem Oszilloskop - zu erlernen. Die methodische Grundlage bilden der Makrozyklus von Design-Based Research (DBR) als strukturierender Rahmen und das heuristische Modell des Research Pentagons, das die Durchführung auf Mikroebene bestimmt. In insgesamt vier Research Pentagons werden didaktische, technologische, motivationale und evaluative Komponenten systematisch untersucht und weiterentwickelt. Das erste Pentagon fokussiert die Entwicklung eines didaktisch fundierten Konzepts nach dem Prinzip des Constructive Alignment, das Lernziele, Lernaktivitäten und Prüfungsformen in fünf abgestufte Lernlevel überführt. Diese reichen von der initialen Orientierung bis zur eigenständigen Problemlösung in einem freien Experimentiermodus. Im zweiten Research Pentagon wird die technische Machbarkeit von Augmented - und Virtual Reality (VR) im Laborumfeld anhand mehrerer funktionaler Prototypen evaluiert. Während sich VR aufgrund technischer Einschränkungen als ungeeignet erweist, zeigt AR - insbesondere in der markerlosen Ausführung mittels der Software Development Kits (SDKs) ARCore und ARKit - ein hohes Potenzial für den praktischen Einsatz. Im dritten Pentagon entsteht ein Onboarding-Modul, das auf die erste Version der mobilen App (V0.17.01) aufsetzt und grundlegende Funktionen eines realen Oszilloskops digital abbildet. Dabei werden Nutzer:innen schrittweise an das virtuelle Oszilloskop herangeführt und lernen zugleich die zentralen Funktionen der mAR-App kennen. Die Ergebnisse zeigen eine insgesamt neutrale bis leicht positive Nutzungserfahrung, wobei technische Schwächen (z.B. Reaktionszeit oder Objektverankerung) die Effizienz und Steuerbarkeit beeinträchtigen. Im Exkurs-Kapitel erfolgt eine Eye-Tracking-Studie zur Untersuchung visueller Aufmerksamkeit und individueller Lösungsstrategien von Expert:innen und Noviz:innen bei der Arbeit am realen Oszilloskop. Heatmaps und Zeitverläufe in definierten Areas of Interest (AOI) liefern erste Hinweise auf Unterschiede im Blickverhalten zwischen den Gruppen. Die algorithmischen Scanpfadanalysen der Blickverläufe hingegen zeigen eine geringe Trennschärfe. Das Potenzial von Eye-Tracking als Evaluationsmethode wird daher kritisch reflektiert, aber angesichts technologischer Entwicklungen und verfügbarer Eye-Tracker in Mixed Reality (MR) Brillen weiterhin als zukunftsrelevant eingeordnet. Die abschließende summative Evaluation nutzt ein Prä‑Post-Test-Design mit Kontrollgruppenvergleich mit 70 Teilnehmenden, um die Lernwirksamkeit der überarbeiteten mAR-App mit klassischen Materialien wie Videos und Handbüchern zu vergleichen. In der Interventionsgruppe (IG) zeigen sich auf kognitiver und affektiver Ebene signifikant positive Veränderungen: Die Leistungen steigen deutlich, insbesondere in den Taxonomiestufen Anwendung, Verständnis und Analyse; zugleich nehmen experimentelles Selbstkonzept und experimentelles Sachinteresse zu, während Überforderung und Ängstlichkeit im Hinblick auf die Laborpraktika abnehmen. Als Einschränkung zeigt sich, dass die mAR-App keinen klaren Vorsprung gegenüber der Kontrollgruppe (KG) erreicht, was sowohl auf die sehr gut ausgearbeiteten Materialien und Videos der KG als auch auf technische Begrenzungen der mobilen Umsetzung zurückzuführen ist: Kleine Displays, 2D-Oberflächen für 3D-Geräte und unpräzise Touch-Interaktionen erschweren komplexe, feinmotorische Aufgaben. In den begleitenden User Interface (UI) und User Experience (UX) Fragebögen spiegeln sich diese Limitationen in gemischten Bewertungen der App wider. Die Arbeit verdeutlicht, dass die mobile AR-Anwendung trotz technischer Einschränkungen wertvolle Möglichkeiten für die Vorbereitung auf Laborpraktika und das Kennenlernen von Laborgeräten bieten kann. Der Fokus bei der Entwicklung liegt von Beginn an auf einer modularen und flexiblen App-Architektur, um sie mit neuen Geräten und Aufgaben zu erweitern. Der Hauptnutzen liegt perspektivisch nicht in der mobilen Anwendung selbst, sondern in der strategischen Ausrichtung auf zukunftsfähige, skalierbare Lösungen für MR-Brillen. Diese erlauben eine authentische Gestensteuerung und realitätsnahe Interaktionen.","lang":"ger"},{"text":"This thesis examines the development, testing, and evaluation of a mobile augmented reality application (mAR app), which is designed as a preparation tool for electrical engineering laboratory courses. The aim is to offer students an opportunity to work with laboratory equipment - primarily the oscilloscope - realistically without location and time constraints. The methodological basis is formed by the macrocycle of design-based research (DBR) as a structured framework and the heuristic model of the research pentagon, which specifies the implementation at the micro level. Didactic, technological, motivational, and evaluative components are systematically examined and further developed in a total of four research pentagons. The first pentagon focuses on the development of a didactically sound concept based on the principle of constructive alignment, which incorporates learning objectives, learning activities, and forms of assessment into five graduated learning levels. These range from initial orientation to independent problem-solving in a free experimentation mode. The second phase evaluates the technical feasibility of augmented and virtual reality (VR) in the laboratory environment using several prototypes. While VR turns out to be unsuitable due to technical limitations, AR - especially in the markerless version using the ARCore and ARKit software development kits (SDKs) - shows great potential for everyday use. In the third research pentagon, an onboarding module is created based on the first version of the mobile app (V0.17.01), which digitally maps the basic functions of a real oscilloscope. During this process, users are introduced to the virtual oscilloscope and become familiar with the main functions of the mAR app. The results show an overall neutral to slightly positive user experience, although technical weaknesses (e.g., reaction time and object fixing) negatively impact efficiency and controllability. In the fourth research pentagon, an eye-tracking study is carried out to investigate visual attention and individual solution strategies of expert and novice users when working with real oscilloscopes. Heatmaps and time sequences in defined areas of interest (AOI) provide first indications of differences in gaze behavior between the groups. The algorithmic scan path analysis, on the other hand, reveals a low degree of differentiation. The potential of eye tracking as an evaluation method is therefore critically reflected, but it is still considered to be relevant for future studies in light of technological advancements and the availability of eye trackers in mixed reality (MR) glasses. The final summative evaluation is carried out in the way of a pre-post test design with 70 participants and compares the usage of traditional materials such as videos and manuals with the improved mAR app. In the intervention group (IG), significant improvements emerge on both cognitive and affective levels: performance increases particularly in the areas of application, understanding, and analysis, while experimental self-concept and subject-related interest rise and feelings of overload and anxiety regarding the lab courses decline. As a limitation, the mAR app does not yield a clear advantage over the control group (CG), which can be attributed both to the highly refined materials and videos used in the CG and to technical constraints inherent to the mobile implementation: small displays, 2D interfaces on 3D devices, and imprecise touch interaction limit complex, sensitive motor tasks. These limitations are also reflected in the accompanying user interface (UI) and user experience (UX) questionnaires, which indicate mixed app ratings. Both groups show significant learning gains - particularly in the areas of application, understanding, and analysis. However, a significant advantage of the mAR App cannot be proven. Affective characteristics such as experimental self-concept and general experimental interests increase in both groups, while the feeling of fear before conducting real laboratory work decreases. The app itself achieves average ratings in user interface (UI) and user experience (UX) questionnaires. The thesis demonstrates that, despite technical limitations, the mobile AR application can provide a valuable alternative for preparing students for laboratory courses and familiarizing them with laboratory equipment. From the very beginning, the primary goal during development was a modular and flexible app architecture that can be extended with new devices, tasks, and functions. The main benefit is not in the mobile application itself, but in the strategic direction of future-oriented and scalable solutions for MR glasses, which allow immersive and realistic gesture interactions.","lang":"eng"}],"user_id":"14972","citation":{"mla":"Alptekin, Mesut. <i>Entwicklung Einer Augmented Reality Basierten Anwendung Als Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik</i>. LibreCat University, 2025, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2483\">10.17619/UNIPB/1-2483</a>.","bibtex":"@book{Alptekin_2025, title={Entwicklung einer Augmented Reality basierten Anwendung als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-2483\">10.17619/UNIPB/1-2483</a>}, publisher={LibreCat University}, author={Alptekin, Mesut}, year={2025} }","short":"M. Alptekin, Entwicklung Einer Augmented Reality Basierten Anwendung Als Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik, LibreCat University, 2025.","ama":"Alptekin M. <i>Entwicklung Einer Augmented Reality Basierten Anwendung Als Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik</i>. LibreCat University; 2025. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2483\">10.17619/UNIPB/1-2483</a>","apa":"Alptekin, M. (2025). <i>Entwicklung einer Augmented Reality basierten Anwendung als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik</i>. LibreCat University. <a href=\"https://doi.org/10.17619/UNIPB/1-2483\">https://doi.org/10.17619/UNIPB/1-2483</a>","chicago":"Alptekin, Mesut. <i>Entwicklung Einer Augmented Reality Basierten Anwendung Als Vorbereitungsmaßnahme Zum Laborpraktikum in Der Elektrotechnik</i>. LibreCat University, 2025. <a href=\"https://doi.org/10.17619/UNIPB/1-2483\">https://doi.org/10.17619/UNIPB/1-2483</a>.","ieee":"M. Alptekin, <i>Entwicklung einer Augmented Reality basierten Anwendung als Vorbereitungsmaßnahme zum Laborpraktikum in der Elektrotechnik</i>. LibreCat University, 2025."},"department":[{"_id":"34"},{"_id":"3"},{"_id":"300"}]},{"date_updated":"2026-04-20T07:42:57Z","_id":"63855","status":"public","type":"research_data","year":"2025","publisher":"Universitätsbibliothek Paderborn","date_created":"2026-02-04T06:54:14Z","department":[{"_id":"15"}],"user_id":"14972","citation":{"ieee":"C. Zietlow, <i>A novel Lagrangian-based method for the deconvolution of electron energy-loss spectra</i>. Universitätsbibliothek Paderborn, 2025.","chicago":"Zietlow, Christian. <i>A Novel Lagrangian-Based Method for the Deconvolution of Electron Energy-Loss Spectra</i>. Universitätsbibliothek Paderborn, 2025. <a href=\"https://doi.org/10.17619/UNIPB/1-2438\">https://doi.org/10.17619/UNIPB/1-2438</a>.","apa":"Zietlow, C. (2025). <i>A novel Lagrangian-based method for the deconvolution of electron energy-loss spectra</i>. Universitätsbibliothek Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-2438\">https://doi.org/10.17619/UNIPB/1-2438</a>","ama":"Zietlow C. <i>A Novel Lagrangian-Based Method for the Deconvolution of Electron Energy-Loss Spectra</i>. Universitätsbibliothek Paderborn; 2025. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2438\">10.17619/UNIPB/1-2438</a>","short":"C. Zietlow, A Novel Lagrangian-Based Method for the Deconvolution of Electron Energy-Loss Spectra, Universitätsbibliothek Paderborn, 2025.","bibtex":"@book{Zietlow_2025, title={A novel Lagrangian-based method for the deconvolution of electron energy-loss spectra}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-2438\">10.17619/UNIPB/1-2438</a>}, publisher={Universitätsbibliothek Paderborn}, author={Zietlow, Christian}, year={2025} }","mla":"Zietlow, Christian. <i>A Novel Lagrangian-Based Method for the Deconvolution of Electron Energy-Loss Spectra</i>. Universitätsbibliothek Paderborn, 2025, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2438\">10.17619/UNIPB/1-2438</a>."},"doi":"10.17619/UNIPB/1-2438","abstract":[{"lang":"ger","text":"Elektronenenergieverlustspektroskopie (engl. EELS) ist eine fortgeschrittene Analysemethode der Transmissionselektronenmikroskopie, die auf atomarer Ebene Einblicke in Materialcharakteristika wie bspw. Eigenschaften des Elektronensystems oder der Materialzusammensetzung erlaubt. Die Genauigkeit jeder EELS-Analyse ist jedoch fundamental durch Rauschen und Unschärfe begrenzt. Diese Thesis beschreibt solche Rauschphänomene im Detail. Vor allem bei strahlempfindlichen Materialien, die kurze Bestrahlzeiten erfordern, aber auch bei Elektron-Materie-Wechselwirkungen mit geringer Auftrittshäufigkeit, ist eine solche Beschreibung notwendig, da das Rauschen solche Messungen dominiert. Zusätzlich spielen Korrelationen des Rauschens eine Rolle, die durch Faltung des verrauschten Signals mit der Punktspreizfunktion des Detektors entstehen und die sowohl theoretisch als auch experimentell beschrieben werden. Methoden zur Messung der wichtigsten Rauschparameter bei typischen Detektorsystemen werden vorgestellt und erlauben es, das Rauschmodel auf jeden beliebigen EELS-Detektor anzupassen. Eine neue Entfaltungsmethode wird vorgeschlagen, die EELS-Messungen schärft und entrauscht. Die Wirksamkeit dieser Methode wird an Simulations- und Experimentaldaten dargelegt. Hierbei wird gezeigt, dass die neue Methode signifikant bessere Ergebnisse liefert, als bisherige und somit eine Analyse von Messdaten auf einem Level ermöglicht, das die Möglichkeiten der Elektronenmikroskopie deutlich erweitert."},{"text":"Electron energy-loss spectroscopy (EELS) is an advanced analytical technique in transmission electron microscopy, as it provides insights into material characteristics, such as electronic properties or elemental composition, at the atomic scale. The precision of every EELS analysis, however, is inherently limited by noises and blur. This thesis offers a comprehensive understanding of the noise, which is particularly valuable at low dwell times necessary for beam sensitive materials and for electron-matter interactions with low frequency of occurrence, where the noise dominates the measurement. Additionally, correlations encountered in the noise of an EELS measurement are described from both a theoretical and experimental perspective. These correlations are caused by a convolution of the noisy signal with the detector point spread function. Methods for characterizing key noise parameters of typical detectors are described, allowing the noise model to be tailored to any EELS detector. Ultimately, a novel deconvolution method enabling significant sharpening and denoising of EELS measurements is introduced and demonstrated. Its efficiency is further validated on both simulation and experimental data. The described advancement offered by the proposed deconvolution method enables the extension of current electron microscope capabilities, facilitating analysis that would be unfeasible with existing deconvolution techniques.","lang":"eng"}],"author":[{"orcid":"https://orcid.org/0000-0001-9696-619X","id":"77368","last_name":"Zietlow","full_name":"Zietlow, Christian","first_name":"Christian"}],"title":"A novel Lagrangian-based method for the deconvolution of electron energy-loss spectra"},{"date_created":"2025-12-18T19:03:19Z","publication":"Zeitschrift für angewandte Mathematik und Physik","publisher":"Springer Science and Business Media LLC","language":[{"iso":"eng"}],"year":"2025","publication_identifier":{"issn":["0044-2275","1420-9039"]},"type":"journal_article","status":"public","_id":"63250","volume":76,"article_number":"192","issue":"5","date_updated":"2026-04-23T12:20:44Z","title":"Large-data solutions in one-dimensional thermoviscoelasticity involving temperature-dependent viscosities","author":[{"id":"31496","last_name":"Winkler","full_name":"Winkler, Michael","first_name":"Michael"}],"project":[{"name":"FOR 5208: Modellbasierte Bestimmung nichtlinearer Eigenschaften von Piezokeramiken für Leistungsschallanwendungen (NEPTUN)","_id":"245"}],"abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n                  <jats:p>\r\n                    An initial-boundary value problem for\r\n                    <jats:disp-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\begin{aligned} \\left\\{ \\begin{array}{ll}u_{tt} = \\big (\\gamma (\\Theta ) u_{xt}\\big )_x + au_{xx} - \\big (f(\\Theta )\\big )_x, \\qquad &amp;  x\\in \\Omega , \\ t&gt;0, \\\\[1mm] \\Theta _t = \\Theta _{xx} + \\gamma (\\Theta ) u_{xt}^2 - f(\\Theta ) u_{xt}, \\qquad &amp;  x\\in \\Omega , \\ t&gt;0, \\end{array} \\right. \\end{aligned}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mtable>\r\n                              <mml:mtr>\r\n                                <mml:mtd>\r\n                                  <mml:mfenced>\r\n                                    <mml:mrow>\r\n                                      <mml:mtable>\r\n                                        <mml:mtr>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>tt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>=</mml:mo>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:mi>γ</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:msub>\r\n                                                <mml:mrow>\r\n                                                  <mml:mo>)</mml:mo>\r\n                                                </mml:mrow>\r\n                                                <mml:mi>x</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>+</mml:mo>\r\n                                              <mml:mi>a</mml:mi>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xx</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>-</mml:mo>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:mi>f</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mrow>\r\n                                                  <mml:mo>)</mml:mo>\r\n                                                </mml:mrow>\r\n                                                <mml:mi>x</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:mi>x</mml:mi>\r\n                                              <mml:mo>∈</mml:mo>\r\n                                              <mml:mi>Ω</mml:mi>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                              <mml:mi>t</mml:mi>\r\n                                              <mml:mo>&gt;</mml:mo>\r\n                                              <mml:mn>0</mml:mn>\r\n                                              <mml:mo>,</mml:mo>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                        </mml:mtr>\r\n                                        <mml:mtr>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:mrow/>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>[</mml:mo>\r\n                                                <mml:mn>1</mml:mn>\r\n                                                <mml:mi>m</mml:mi>\r\n                                                <mml:mi>m</mml:mi>\r\n                                                <mml:mo>]</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mi>t</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>=</mml:mo>\r\n                                              <mml:msub>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xx</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>+</mml:mo>\r\n                                              <mml:mi>γ</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msubsup>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xt</mml:mi>\r\n                                                </mml:mrow>\r\n                                                <mml:mn>2</mml:mn>\r\n                                              </mml:msubsup>\r\n                                              <mml:mo>-</mml:mo>\r\n                                              <mml:mi>f</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:mi>x</mml:mi>\r\n                                              <mml:mo>∈</mml:mo>\r\n                                              <mml:mi>Ω</mml:mi>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                              <mml:mi>t</mml:mi>\r\n                                              <mml:mo>&gt;</mml:mo>\r\n                                              <mml:mn>0</mml:mn>\r\n                                              <mml:mo>,</mml:mo>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                        </mml:mtr>\r\n                                      </mml:mtable>\r\n                                    </mml:mrow>\r\n                                  </mml:mfenced>\r\n                                </mml:mtd>\r\n                              </mml:mtr>\r\n                            </mml:mtable>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:disp-formula>\r\n                    is considered in an open bounded real interval\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\Omega $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mi>Ω</mml:mi>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    . Under the assumption that\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\gamma \\in C^0([0,\\infty ))$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>γ</mml:mi>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mi>C</mml:mi>\r\n                              <mml:mn>0</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mrow>\r\n                                <mml:mo>[</mml:mo>\r\n                                <mml:mn>0</mml:mn>\r\n                                <mml:mo>,</mml:mo>\r\n                                <mml:mi>∞</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f\\in C^0([0,\\infty ))$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mi>C</mml:mi>\r\n                              <mml:mn>0</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mrow>\r\n                                <mml:mo>[</mml:mo>\r\n                                <mml:mn>0</mml:mn>\r\n                                <mml:mo>,</mml:mo>\r\n                                <mml:mi>∞</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    are such that\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f(0)=0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                            <mml:mo>)</mml:mo>\r\n                            <mml:mo>=</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    , and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$k_\\gamma \\le \\gamma \\le K_\\gamma $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:msub>\r\n                              <mml:mi>k</mml:mi>\r\n                              <mml:mi>γ</mml:mi>\r\n                            </mml:msub>\r\n                            <mml:mo>≤</mml:mo>\r\n                            <mml:mi>γ</mml:mi>\r\n                            <mml:mo>≤</mml:mo>\r\n                            <mml:msub>\r\n                              <mml:mi>K</mml:mi>\r\n                              <mml:mi>γ</mml:mi>\r\n                            </mml:msub>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    as well as\r\n                    <jats:disp-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\begin{aligned} |f(\\xi )| \\le K_f \\cdot (\\xi +1)^\\alpha \\qquad \\hbox {for all } \\xi \\ge 0 \\end{aligned}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mtable>\r\n                              <mml:mtr>\r\n                                <mml:mtd>\r\n                                  <mml:mrow>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>|</mml:mo>\r\n                                      <mml:mi>f</mml:mi>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                        <mml:mi>ξ</mml:mi>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mo>|</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mo>≤</mml:mo>\r\n                                    <mml:msub>\r\n                                      <mml:mi>K</mml:mi>\r\n                                      <mml:mi>f</mml:mi>\r\n                                    </mml:msub>\r\n                                    <mml:mo>·</mml:mo>\r\n                                    <mml:msup>\r\n                                      <mml:mrow>\r\n                                        <mml:mo>(</mml:mo>\r\n                                        <mml:mi>ξ</mml:mi>\r\n                                        <mml:mo>+</mml:mo>\r\n                                        <mml:mn>1</mml:mn>\r\n                                        <mml:mo>)</mml:mo>\r\n                                      </mml:mrow>\r\n                                      <mml:mi>α</mml:mi>\r\n                                    </mml:msup>\r\n                                    <mml:mspace/>\r\n                                    <mml:mtext>for all</mml:mtext>\r\n                                    <mml:mspace/>\r\n                                    <mml:mi>ξ</mml:mi>\r\n                                    <mml:mo>≥</mml:mo>\r\n                                    <mml:mn>0</mml:mn>\r\n                                  </mml:mrow>\r\n                                </mml:mtd>\r\n                              </mml:mtr>\r\n                            </mml:mtable>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:disp-formula>\r\n                    with some\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$k_\\gamma&gt;0, K_\\gamma&gt;0, K_f&gt;0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:msub>\r\n                              <mml:mi>k</mml:mi>\r\n                              <mml:mi>γ</mml:mi>\r\n                            </mml:msub>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                            <mml:mo>,</mml:mo>\r\n                            <mml:msub>\r\n                              <mml:mi>K</mml:mi>\r\n                              <mml:mi>γ</mml:mi>\r\n                            </mml:msub>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                            <mml:mo>,</mml:mo>\r\n                            <mml:msub>\r\n                              <mml:mi>K</mml:mi>\r\n                              <mml:mi>f</mml:mi>\r\n                            </mml:msub>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\alpha &lt;\\frac{3}{2}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>α</mml:mi>\r\n                            <mml:mo>&lt;</mml:mo>\r\n                            <mml:mfrac>\r\n                              <mml:mn>3</mml:mn>\r\n                              <mml:mn>2</mml:mn>\r\n                            </mml:mfrac>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    , for all suitably regular initial data of arbitrary size a statement on global existence of a global weak solution is derived. By particularly covering the thermodynamically consistent choice\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f\\equiv id$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>≡</mml:mo>\r\n                            <mml:mi>i</mml:mi>\r\n                            <mml:mi>d</mml:mi>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    of predominant physical relevance, this appears to go beyond previous related literature which seems to either rely on independence of\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\gamma $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mi>γ</mml:mi>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    on\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\Theta $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mi>Θ</mml:mi>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    , or to operate on finite time intervals.\r\n                  </jats:p>"}],"intvolume":"        76","doi":"10.1007/s00033-025-02582-y","citation":{"bibtex":"@article{Winkler_2025, title={Large-data solutions in one-dimensional thermoviscoelasticity involving temperature-dependent viscosities}, volume={76}, DOI={<a href=\"https://doi.org/10.1007/s00033-025-02582-y\">10.1007/s00033-025-02582-y</a>}, number={5192}, journal={Zeitschrift für angewandte Mathematik und Physik}, publisher={Springer Science and Business Media LLC}, author={Winkler, Michael}, year={2025} }","mla":"Winkler, Michael. “Large-Data Solutions in One-Dimensional Thermoviscoelasticity Involving Temperature-Dependent Viscosities.” <i>Zeitschrift Für Angewandte Mathematik Und Physik</i>, vol. 76, no. 5, 192, Springer Science and Business Media LLC, 2025, doi:<a href=\"https://doi.org/10.1007/s00033-025-02582-y\">10.1007/s00033-025-02582-y</a>.","short":"M. Winkler, Zeitschrift Für Angewandte Mathematik Und Physik 76 (2025).","ama":"Winkler M. Large-data solutions in one-dimensional thermoviscoelasticity involving temperature-dependent viscosities. <i>Zeitschrift für angewandte Mathematik und Physik</i>. 2025;76(5). doi:<a href=\"https://doi.org/10.1007/s00033-025-02582-y\">10.1007/s00033-025-02582-y</a>","apa":"Winkler, M. (2025). Large-data solutions in one-dimensional thermoviscoelasticity involving temperature-dependent viscosities. <i>Zeitschrift Für Angewandte Mathematik Und Physik</i>, <i>76</i>(5), Article 192. <a href=\"https://doi.org/10.1007/s00033-025-02582-y\">https://doi.org/10.1007/s00033-025-02582-y</a>","ieee":"M. Winkler, “Large-data solutions in one-dimensional thermoviscoelasticity involving temperature-dependent viscosities,” <i>Zeitschrift für angewandte Mathematik und Physik</i>, vol. 76, no. 5, Art. no. 192, 2025, doi: <a href=\"https://doi.org/10.1007/s00033-025-02582-y\">10.1007/s00033-025-02582-y</a>.","chicago":"Winkler, Michael. “Large-Data Solutions in One-Dimensional Thermoviscoelasticity Involving Temperature-Dependent Viscosities.” <i>Zeitschrift Für Angewandte Mathematik Und Physik</i> 76, no. 5 (2025). <a href=\"https://doi.org/10.1007/s00033-025-02582-y\">https://doi.org/10.1007/s00033-025-02582-y</a>."},"publication_status":"published","user_id":"31496"},{"project":[{"name":"FOR 5208: Modellbasierte Bestimmung nichtlinearer Eigenschaften von Piezokeramiken für Leistungsschallanwendungen (NEPTUN)","_id":"245"}],"doi":"10.1007/s00028-025-01144-z","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n                  <jats:p>\r\n                    The model\r\n                    <jats:disp-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\begin{aligned} \\left\\{ \\begin{array}{l}u_{tt} = \\big (\\gamma (\\Theta ) u_{xt}\\big )_x + au_{xx} - \\big (f(\\Theta )\\big )_x, \\\\[1mm] \\Theta _t = \\Theta _{xx} + \\gamma (\\Theta ) u_{xt}^2 - f(\\Theta ) u_{xt}, \\end{array} \\right. \\end{aligned}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mtable>\r\n                              <mml:mtr>\r\n                                <mml:mtd>\r\n                                  <mml:mfenced>\r\n                                    <mml:mrow>\r\n                                      <mml:mtable>\r\n                                        <mml:mtr>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>tt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>=</mml:mo>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:mi>γ</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:msub>\r\n                                                <mml:mrow>\r\n                                                  <mml:mo>)</mml:mo>\r\n                                                </mml:mrow>\r\n                                                <mml:mi>x</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>+</mml:mo>\r\n                                              <mml:mi>a</mml:mi>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xx</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>-</mml:mo>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:mi>f</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mrow>\r\n                                                  <mml:mo>)</mml:mo>\r\n                                                </mml:mrow>\r\n                                                <mml:mi>x</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>,</mml:mo>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                        </mml:mtr>\r\n                                        <mml:mtr>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:mrow/>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>[</mml:mo>\r\n                                                <mml:mn>1</mml:mn>\r\n                                                <mml:mi>m</mml:mi>\r\n                                                <mml:mi>m</mml:mi>\r\n                                                <mml:mo>]</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mi>t</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>=</mml:mo>\r\n                                              <mml:msub>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xx</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>+</mml:mo>\r\n                                              <mml:mi>γ</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msubsup>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xt</mml:mi>\r\n                                                </mml:mrow>\r\n                                                <mml:mn>2</mml:mn>\r\n                                              </mml:msubsup>\r\n                                              <mml:mo>-</mml:mo>\r\n                                              <mml:mi>f</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>,</mml:mo>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                        </mml:mtr>\r\n                                      </mml:mtable>\r\n                                    </mml:mrow>\r\n                                  </mml:mfenced>\r\n                                </mml:mtd>\r\n                              </mml:mtr>\r\n                            </mml:mtable>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:disp-formula>\r\n                    for thermoviscoelastic evolution in one-dimensional Kelvin–Voigt materials is considered. By means of an approach based on maximal Sobolev regularity theory of scalar parabolic equations, it is shown that if\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\gamma _0&gt;0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:msub>\r\n                              <mml:mi>γ</mml:mi>\r\n                              <mml:mn>0</mml:mn>\r\n                            </mml:msub>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    is fixed, then there exists\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\delta =\\delta (\\gamma _0)&gt;0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>δ</mml:mi>\r\n                            <mml:mo>=</mml:mo>\r\n                            <mml:mi>δ</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:msub>\r\n                              <mml:mi>γ</mml:mi>\r\n                              <mml:mn>0</mml:mn>\r\n                            </mml:msub>\r\n                            <mml:mo>)</mml:mo>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    with the property that for suitably regular initial data of arbitrary size an associated initial boundary value problem posed in an open bounded interval admits a global classical solution whenever\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\gamma \\in C^2([0,\\infty ))$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>γ</mml:mi>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mi>C</mml:mi>\r\n                              <mml:mn>2</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mrow>\r\n                                <mml:mo>[</mml:mo>\r\n                                <mml:mn>0</mml:mn>\r\n                                <mml:mo>,</mml:mo>\r\n                                <mml:mi>∞</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f\\in C^2([0,\\infty ))$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mi>C</mml:mi>\r\n                              <mml:mn>2</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mrow>\r\n                                <mml:mo>[</mml:mo>\r\n                                <mml:mn>0</mml:mn>\r\n                                <mml:mo>,</mml:mo>\r\n                                <mml:mi>∞</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    are such that\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f(0)=0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                            <mml:mo>)</mml:mo>\r\n                            <mml:mo>=</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$|f(\\xi )| \\le K_f \\cdot (\\xi +1)^\\alpha $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mrow>\r\n                              <mml:mo>|</mml:mo>\r\n                              <mml:mi>f</mml:mi>\r\n                              <mml:mrow>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mi>ξ</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mo>|</mml:mo>\r\n                            </mml:mrow>\r\n                            <mml:mo>≤</mml:mo>\r\n                            <mml:msub>\r\n                              <mml:mi>K</mml:mi>\r\n                              <mml:mi>f</mml:mi>\r\n                            </mml:msub>\r\n                            <mml:mo>·</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mrow>\r\n                                <mml:mo>(</mml:mo>\r\n                                <mml:mi>ξ</mml:mi>\r\n                                <mml:mo>+</mml:mo>\r\n                                <mml:mn>1</mml:mn>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mi>α</mml:mi>\r\n                            </mml:msup>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    for all\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\xi \\ge 0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>ξ</mml:mi>\r\n                            <mml:mo>≥</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and some\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$K_f&gt;0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:msub>\r\n                              <mml:mi>K</mml:mi>\r\n                              <mml:mi>f</mml:mi>\r\n                            </mml:msub>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\alpha &lt;\\frac{3}{2}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>α</mml:mi>\r\n                            <mml:mo>&lt;</mml:mo>\r\n                            <mml:mfrac>\r\n                              <mml:mn>3</mml:mn>\r\n                              <mml:mn>2</mml:mn>\r\n                            </mml:mfrac>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    , and that\r\n                    <jats:disp-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\begin{aligned} \\gamma _0 \\le \\gamma (\\xi ) \\le \\gamma _0 + \\delta \\qquad \\hbox {for all } \\xi \\ge 0. \\end{aligned}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mtable>\r\n                              <mml:mtr>\r\n                                <mml:mtd>\r\n                                  <mml:mrow>\r\n                                    <mml:msub>\r\n                                      <mml:mi>γ</mml:mi>\r\n                                      <mml:mn>0</mml:mn>\r\n                                    </mml:msub>\r\n                                    <mml:mo>≤</mml:mo>\r\n                                    <mml:mi>γ</mml:mi>\r\n                                    <mml:mrow>\r\n                                      <mml:mo>(</mml:mo>\r\n                                      <mml:mi>ξ</mml:mi>\r\n                                      <mml:mo>)</mml:mo>\r\n                                    </mml:mrow>\r\n                                    <mml:mo>≤</mml:mo>\r\n                                    <mml:msub>\r\n                                      <mml:mi>γ</mml:mi>\r\n                                      <mml:mn>0</mml:mn>\r\n                                    </mml:msub>\r\n                                    <mml:mo>+</mml:mo>\r\n                                    <mml:mi>δ</mml:mi>\r\n                                    <mml:mspace/>\r\n                                    <mml:mtext>for all</mml:mtext>\r\n                                    <mml:mspace/>\r\n                                    <mml:mi>ξ</mml:mi>\r\n                                    <mml:mo>≥</mml:mo>\r\n                                    <mml:mn>0</mml:mn>\r\n                                    <mml:mo>.</mml:mo>\r\n                                  </mml:mrow>\r\n                                </mml:mtd>\r\n                              </mml:mtr>\r\n                            </mml:mtable>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:disp-formula>\r\n                    This is supplemented by a statement on global existence of certain strong solutions, particularly continuous in both components, under weaker conditions on the initial data.\r\n                  </jats:p>"}],"intvolume":"        25","title":"Large-data regular solutions in a one-dimensional thermoviscoelastic evolution problem involving temperature-dependent viscosities","author":[{"full_name":"Winkler, Michael","first_name":"Michael","last_name":"Winkler","id":"31496"}],"citation":{"mla":"Winkler, Michael. “Large-Data Regular Solutions in a One-Dimensional Thermoviscoelastic Evolution Problem Involving Temperature-Dependent Viscosities.” <i>Journal of Evolution Equations</i>, vol. 25, no. 4, 108, Springer Science and Business Media LLC, 2025, doi:<a href=\"https://doi.org/10.1007/s00028-025-01144-z\">10.1007/s00028-025-01144-z</a>.","bibtex":"@article{Winkler_2025, title={Large-data regular solutions in a one-dimensional thermoviscoelastic evolution problem involving temperature-dependent viscosities}, volume={25}, DOI={<a href=\"https://doi.org/10.1007/s00028-025-01144-z\">10.1007/s00028-025-01144-z</a>}, number={4108}, journal={Journal of Evolution Equations}, publisher={Springer Science and Business Media LLC}, author={Winkler, Michael}, year={2025} }","short":"M. Winkler, Journal of Evolution Equations 25 (2025).","apa":"Winkler, M. (2025). Large-data regular solutions in a one-dimensional thermoviscoelastic evolution problem involving temperature-dependent viscosities. <i>Journal of Evolution Equations</i>, <i>25</i>(4), Article 108. <a href=\"https://doi.org/10.1007/s00028-025-01144-z\">https://doi.org/10.1007/s00028-025-01144-z</a>","ama":"Winkler M. Large-data regular solutions in a one-dimensional thermoviscoelastic evolution problem involving temperature-dependent viscosities. <i>Journal of Evolution Equations</i>. 2025;25(4). doi:<a href=\"https://doi.org/10.1007/s00028-025-01144-z\">10.1007/s00028-025-01144-z</a>","chicago":"Winkler, Michael. “Large-Data Regular Solutions in a One-Dimensional Thermoviscoelastic Evolution Problem Involving Temperature-Dependent Viscosities.” <i>Journal of Evolution Equations</i> 25, no. 4 (2025). <a href=\"https://doi.org/10.1007/s00028-025-01144-z\">https://doi.org/10.1007/s00028-025-01144-z</a>.","ieee":"M. Winkler, “Large-data regular solutions in a one-dimensional thermoviscoelastic evolution problem involving temperature-dependent viscosities,” <i>Journal of Evolution Equations</i>, vol. 25, no. 4, Art. no. 108, 2025, doi: <a href=\"https://doi.org/10.1007/s00028-025-01144-z\">10.1007/s00028-025-01144-z</a>."},"publication_status":"published","user_id":"31496","language":[{"iso":"eng"}],"type":"journal_article","publication_identifier":{"issn":["1424-3199","1424-3202"]},"year":"2025","status":"public","date_created":"2025-12-18T19:02:51Z","publication":"Journal of Evolution Equations","publisher":"Springer Science and Business Media LLC","article_number":"108","issue":"4","date_updated":"2026-04-23T12:19:51Z","_id":"63249","volume":25},{"status":"public","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0944-2669","1432-0835"]},"year":"2025","type":"journal_article","publisher":"Springer Science and Business Media LLC","date_created":"2025-12-18T19:01:02Z","publication":"Calculus of Variations and Partial Differential Equations","issue":"1","date_updated":"2026-04-23T12:18:59Z","article_number":"1","volume":65,"_id":"63246","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n                  <jats:p>\r\n                    The hyperbolic-parabolic model\r\n                    <jats:disp-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\begin{aligned} \\left\\{ \\begin{array}{ll} u_{tt} = u_{xx} - \\big (f(\\Theta )\\big )_x, \\qquad &amp;  x\\in \\Omega , \\ t&gt;0, \\\\ \\Theta _t = \\Theta _{xx} - f(\\Theta ) u_{xt}, \\qquad &amp;  x\\in \\Omega , \\ t&gt;0, \\end{array} \\right. \\end{aligned}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mtable>\r\n                              <mml:mtr>\r\n                                <mml:mtd>\r\n                                  <mml:mfenced>\r\n                                    <mml:mrow>\r\n                                      <mml:mtable>\r\n                                        <mml:mtr>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>tt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>=</mml:mo>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xx</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>-</mml:mo>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:mi>f</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mrow>\r\n                                                  <mml:mo>)</mml:mo>\r\n                                                </mml:mrow>\r\n                                                <mml:mi>x</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:mi>x</mml:mi>\r\n                                              <mml:mo>∈</mml:mo>\r\n                                              <mml:mi>Ω</mml:mi>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                              <mml:mi>t</mml:mi>\r\n                                              <mml:mo>&gt;</mml:mo>\r\n                                              <mml:mn>0</mml:mn>\r\n                                              <mml:mo>,</mml:mo>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                        </mml:mtr>\r\n                                        <mml:mtr>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:mrow/>\r\n                                              <mml:msub>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mi>t</mml:mi>\r\n                                              </mml:msub>\r\n                                              <mml:mo>=</mml:mo>\r\n                                              <mml:msub>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xx</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>-</mml:mo>\r\n                                              <mml:mi>f</mml:mi>\r\n                                              <mml:mrow>\r\n                                                <mml:mo>(</mml:mo>\r\n                                                <mml:mi>Θ</mml:mi>\r\n                                                <mml:mo>)</mml:mo>\r\n                                              </mml:mrow>\r\n                                              <mml:msub>\r\n                                                <mml:mi>u</mml:mi>\r\n                                                <mml:mrow>\r\n                                                  <mml:mi>xt</mml:mi>\r\n                                                </mml:mrow>\r\n                                              </mml:msub>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                          <mml:mtd>\r\n                                            <mml:mrow>\r\n                                              <mml:mi>x</mml:mi>\r\n                                              <mml:mo>∈</mml:mo>\r\n                                              <mml:mi>Ω</mml:mi>\r\n                                              <mml:mo>,</mml:mo>\r\n                                              <mml:mspace/>\r\n                                              <mml:mi>t</mml:mi>\r\n                                              <mml:mo>&gt;</mml:mo>\r\n                                              <mml:mn>0</mml:mn>\r\n                                              <mml:mo>,</mml:mo>\r\n                                            </mml:mrow>\r\n                                          </mml:mtd>\r\n                                        </mml:mtr>\r\n                                      </mml:mtable>\r\n                                    </mml:mrow>\r\n                                  </mml:mfenced>\r\n                                </mml:mtd>\r\n                              </mml:mtr>\r\n                            </mml:mtable>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:disp-formula>\r\n                    for the evolution of the displacement variable\r\n                    <jats:italic>u</jats:italic>\r\n                    and the temperature\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\Theta \\ge 0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>Θ</mml:mi>\r\n                            <mml:mo>≥</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    during thermoelastic interaction in a one-dimensional bounded interval\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$\\Omega $$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mi>Ω</mml:mi>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    is considered. Whereas the literature has provided comprehensive results on global solutions for sufficiently regular initial data\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$(u_0,u_{0t},\\Theta _0)=(u,u_t,\\Theta )|_{t=0}$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:msub>\r\n                                <mml:mi>u</mml:mi>\r\n                                <mml:mn>0</mml:mn>\r\n                              </mml:msub>\r\n                              <mml:mo>,</mml:mo>\r\n                              <mml:msub>\r\n                                <mml:mi>u</mml:mi>\r\n                                <mml:mrow>\r\n                                  <mml:mn>0</mml:mn>\r\n                                  <mml:mi>t</mml:mi>\r\n                                </mml:mrow>\r\n                              </mml:msub>\r\n                              <mml:mo>,</mml:mo>\r\n                              <mml:msub>\r\n                                <mml:mi>Θ</mml:mi>\r\n                                <mml:mn>0</mml:mn>\r\n                              </mml:msub>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                            <mml:mo>=</mml:mo>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mi>u</mml:mi>\r\n                              <mml:mo>,</mml:mo>\r\n                              <mml:msub>\r\n                                <mml:mi>u</mml:mi>\r\n                                <mml:mi>t</mml:mi>\r\n                              </mml:msub>\r\n                              <mml:mo>,</mml:mo>\r\n                              <mml:mi>Θ</mml:mi>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                            <mml:msub>\r\n                              <mml:mrow>\r\n                                <mml:mo>|</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mrow>\r\n                                <mml:mi>t</mml:mi>\r\n                                <mml:mo>=</mml:mo>\r\n                                <mml:mn>0</mml:mn>\r\n                              </mml:mrow>\r\n                            </mml:msub>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    when\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f\\equiv id$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>≡</mml:mo>\r\n                            <mml:mi>i</mml:mi>\r\n                            <mml:mi>d</mml:mi>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    , it seems to have remained open so far how far a solution theory can be built solely on the two fundamental physical principles of energy conservation and entropy nondecrease. The present manuscript addresses this by asserting global existence of weak solutions under assumptions which are energy- and entropy-minimal in the sense of allowing for any initial data\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$u_0\\in W_0^{1,2}(\\Omega )$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:msub>\r\n                              <mml:mi>u</mml:mi>\r\n                              <mml:mn>0</mml:mn>\r\n                            </mml:msub>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msubsup>\r\n                              <mml:mi>W</mml:mi>\r\n                              <mml:mn>0</mml:mn>\r\n                              <mml:mrow>\r\n                                <mml:mn>1</mml:mn>\r\n                                <mml:mo>,</mml:mo>\r\n                                <mml:mn>2</mml:mn>\r\n                              </mml:mrow>\r\n                            </mml:msubsup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mi>Ω</mml:mi>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    ,\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$u_{0t} \\in L^2(\\Omega )$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:msub>\r\n                              <mml:mi>u</mml:mi>\r\n                              <mml:mrow>\r\n                                <mml:mn>0</mml:mn>\r\n                                <mml:mi>t</mml:mi>\r\n                              </mml:mrow>\r\n                            </mml:msub>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mi>L</mml:mi>\r\n                              <mml:mn>2</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mi>Ω</mml:mi>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$0\\le \\Theta _0\\in L^1(\\Omega )$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mn>0</mml:mn>\r\n                            <mml:mo>≤</mml:mo>\r\n                            <mml:msub>\r\n                              <mml:mi>Θ</mml:mi>\r\n                              <mml:mn>0</mml:mn>\r\n                            </mml:msub>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mi>L</mml:mi>\r\n                              <mml:mn>1</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mi>Ω</mml:mi>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    , and which apply to arbitrary\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f\\in C^1([0,\\infty ))$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>∈</mml:mo>\r\n                            <mml:msup>\r\n                              <mml:mi>C</mml:mi>\r\n                              <mml:mn>1</mml:mn>\r\n                            </mml:msup>\r\n                            <mml:mrow>\r\n                              <mml:mo>(</mml:mo>\r\n                              <mml:mrow>\r\n                                <mml:mo>[</mml:mo>\r\n                                <mml:mn>0</mml:mn>\r\n                                <mml:mo>,</mml:mo>\r\n                                <mml:mi>∞</mml:mi>\r\n                                <mml:mo>)</mml:mo>\r\n                              </mml:mrow>\r\n                              <mml:mo>)</mml:mo>\r\n                            </mml:mrow>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    with\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f(0)=0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mi>f</mml:mi>\r\n                            <mml:mo>(</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                            <mml:mo>)</mml:mo>\r\n                            <mml:mo>=</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    and\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$f'&gt;0$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:msup>\r\n                              <mml:mi>f</mml:mi>\r\n                              <mml:mo>′</mml:mo>\r\n                            </mml:msup>\r\n                            <mml:mo>&gt;</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    on\r\n                    <jats:inline-formula>\r\n                      <jats:alternatives>\r\n                        <jats:tex-math>$$[0,\\infty )$$</jats:tex-math>\r\n                        <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">\r\n                          <mml:mrow>\r\n                            <mml:mo>[</mml:mo>\r\n                            <mml:mn>0</mml:mn>\r\n                            <mml:mo>,</mml:mo>\r\n                            <mml:mi>∞</mml:mi>\r\n                            <mml:mo>)</mml:mo>\r\n                          </mml:mrow>\r\n                        </mml:math>\r\n                      </jats:alternatives>\r\n                    </jats:inline-formula>\r\n                    .\r\n                  </jats:p>"}],"intvolume":"        65","doi":"10.1007/s00526-025-03170-8","project":[{"name":"FOR 5208: Modellbasierte Bestimmung nichtlinearer Eigenschaften von Piezokeramiken für Leistungsschallanwendungen (NEPTUN)","_id":"245"}],"author":[{"id":"31496","last_name":"Winkler","first_name":"Michael","full_name":"Winkler, Michael"}],"title":"Rough solutions in one-dimensional nonlinear thermoelasticity","publication_status":"published","user_id":"31496","citation":{"chicago":"Winkler, Michael. “Rough Solutions in One-Dimensional Nonlinear Thermoelasticity.” <i>Calculus of Variations and Partial Differential Equations</i> 65, no. 1 (2025). <a href=\"https://doi.org/10.1007/s00526-025-03170-8\">https://doi.org/10.1007/s00526-025-03170-8</a>.","ieee":"M. Winkler, “Rough solutions in one-dimensional nonlinear thermoelasticity,” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 65, no. 1, Art. no. 1, 2025, doi: <a href=\"https://doi.org/10.1007/s00526-025-03170-8\">10.1007/s00526-025-03170-8</a>.","ama":"Winkler M. Rough solutions in one-dimensional nonlinear thermoelasticity. <i>Calculus of Variations and Partial Differential Equations</i>. 2025;65(1). doi:<a href=\"https://doi.org/10.1007/s00526-025-03170-8\">10.1007/s00526-025-03170-8</a>","apa":"Winkler, M. (2025). Rough solutions in one-dimensional nonlinear thermoelasticity. <i>Calculus of Variations and Partial Differential Equations</i>, <i>65</i>(1), Article 1. <a href=\"https://doi.org/10.1007/s00526-025-03170-8\">https://doi.org/10.1007/s00526-025-03170-8</a>","short":"M. Winkler, Calculus of Variations and Partial Differential Equations 65 (2025).","mla":"Winkler, Michael. “Rough Solutions in One-Dimensional Nonlinear Thermoelasticity.” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 65, no. 1, 1, Springer Science and Business Media LLC, 2025, doi:<a href=\"https://doi.org/10.1007/s00526-025-03170-8\">10.1007/s00526-025-03170-8</a>.","bibtex":"@article{Winkler_2025, title={Rough solutions in one-dimensional nonlinear thermoelasticity}, volume={65}, DOI={<a href=\"https://doi.org/10.1007/s00526-025-03170-8\">10.1007/s00526-025-03170-8</a>}, number={11}, journal={Calculus of Variations and Partial Differential Equations}, publisher={Springer Science and Business Media LLC}, author={Winkler, Michael}, year={2025} }"}},{"_id":"62717","date_updated":"2026-04-27T12:12:35Z","publisher":"LibreCat University","date_created":"2025-12-01T10:22:40Z","status":"public","language":[{"iso":"eng"}],"type":"dissertation","year":"2025","publication_status":"published","user_id":"44549","citation":{"short":"M. Protte, Behavioral Effects in Human-Machine and Human-Human Interactions, LibreCat University, 2025.","mla":"Protte, Marius. <i>Behavioral Effects in Human-Machine and Human-Human Interactions</i>. LibreCat University, 2025, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2448\">10.17619/UNIPB/1-2448</a>.","bibtex":"@book{Protte_2025, title={Behavioral effects in human-machine and human-human interactions}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-2448\">10.17619/UNIPB/1-2448</a>}, publisher={LibreCat University}, author={Protte, Marius}, year={2025} }","chicago":"Protte, Marius. <i>Behavioral Effects in Human-Machine and Human-Human Interactions</i>. LibreCat University, 2025. <a href=\"https://doi.org/10.17619/UNIPB/1-2448\">https://doi.org/10.17619/UNIPB/1-2448</a>.","ieee":"M. Protte, <i>Behavioral effects in human-machine and human-human interactions</i>. LibreCat University, 2025.","ama":"Protte M. <i>Behavioral Effects in Human-Machine and Human-Human Interactions</i>. LibreCat University; 2025. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-2448\">10.17619/UNIPB/1-2448</a>","apa":"Protte, M. (2025). <i>Behavioral effects in human-machine and human-human interactions</i>. LibreCat University. <a href=\"https://doi.org/10.17619/UNIPB/1-2448\">https://doi.org/10.17619/UNIPB/1-2448</a>"},"author":[{"first_name":"Marius","full_name":"Protte, Marius","last_name":"Protte"}],"title":"Behavioral effects in human-machine and human-human interactions","abstract":[{"text":"Diese Dissertation untersucht, wie Menschen Entscheidungen in Interaktionen sowohl mit anderen Personen als auch mit zunehmend verbreiteten algorithmischen Systemen treffen. Unter Einbezug von Erkenntnissen aus der Verhaltensökonomie und der Mensch-Maschine-Interaktion wird analysiert, wie kognitive Limitationen, soziale Präferenzen und Wahrnehmungsverzerrungen das Verhalten in Kontexten von Unehrlichkeit, Empfehlungsumsetzung, Feedbackverarbeitung und Selbsteinschätzung prägen. Vier kontrollierte ökonomische Experimente zeigen, dass algorithmische Intransparenz unehrliches Verhalten verstärken kann, die Einbindung von Nutzern in das Training von KI-Systemen zwar deren Wahrnehmung verbessert, jedoch nicht die tatsächliche Befolgung algorithmischer Ratschläge fördert, dass Echtzeit-Feedback in Human-in-the-Loop-Systemen unbeabsichtigt Verhaltensverzerrungen verstärken kann und dass gängige Messungen von Selbstüberschätzung stark von methodischen Designentscheidungen abhängen. Die Dissertation unterstreicht die Notwendigkeit, realistische Annahmen über menschliches Verhalten bei der Gestaltung von Prüfungsprozessen, Empfehlungssystemen und interaktiven Technologien zu berücksichtigen und leistet damit einen Beitrag zu einem besseren Verständnis menschlicher Entscheidungsprozesse in einer zunehmend automatisierten Welt.","lang":"eng"},{"text":"This dissertation investigates how humans make decisions in interactions with both other people and increasingly prevalent algorithmic systems. Integrating insights from behavioral economics and human-machine interaction, it examines how cognitive limitations, social preferences, and perceptual biases shape behavior in contexts involving dishonesty, advice-taking, feedback, and self-assessment. Across four controlled economic experiments, the studies show that algorithmic opacity can increase dishonest behavior, user involvement in AI training improves perceptions but not actual adherence to algorithmic advice, real-time feedback in human-in-the-loop systems can unintentionally amplify behavioral biases, and common measures of overconfidence are sensitive to methodological design. The dissertation underscores the need to incorporate realistic behavioral assumptions when designing verification processes, advisory algorithms, and interactive technologies, contributing to a deeper understanding of human decision-making in an increasingly automated world.","lang":"eng"}],"doi":"10.17619/UNIPB/1-2448"},{"volume":2025,"_id":"65537","page":"644-667","issue":"3","date_updated":"2026-04-30T09:32:27Z","publisher":"Universitatsbibliothek der Ruhr-Universitat Bochum","date_created":"2026-04-30T09:31:53Z","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","status":"public","year":"2025","publication_identifier":{"issn":["2569-2925"]},"type":"journal_article","publication_status":"published","user_id":"125442","citation":{"mla":"Arranz-Olmos, Santiago, et al. “Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2025, no. 3, Universitatsbibliothek der Ruhr-Universitat Bochum, 2025, pp. 644–67, doi:<a href=\"https://doi.org/10.46586/tches.v2025.i3.644-667\">10.46586/tches.v2025.i3.644-667</a>.","bibtex":"@article{Arranz-Olmos_Barthe_Grégoire_Jancar_Laporte_Oliveira_Schwabe_2025, title={Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code}, volume={2025}, DOI={<a href=\"https://doi.org/10.46586/tches.v2025.i3.644-667\">10.46586/tches.v2025.i3.644-667</a>}, number={3}, journal={IACR Transactions on Cryptographic Hardware and Embedded Systems}, publisher={Universitatsbibliothek der Ruhr-Universitat Bochum}, author={Arranz-Olmos, Santiago and Barthe, Gilles and Grégoire, Benjamin and Jancar, Jan and Laporte, Vincent and Oliveira, Tiago and Schwabe, Peter}, year={2025}, pages={644–667} }","short":"S. Arranz-Olmos, G. Barthe, B. Grégoire, J. Jancar, V. Laporte, T. Oliveira, P. Schwabe, IACR Transactions on Cryptographic Hardware and Embedded Systems 2025 (2025) 644–667.","apa":"Arranz-Olmos, S., Barthe, G., Grégoire, B., Jancar, J., Laporte, V., Oliveira, T., &#38; Schwabe, P. (2025). Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, <i>2025</i>(3), 644–667. <a href=\"https://doi.org/10.46586/tches.v2025.i3.644-667\">https://doi.org/10.46586/tches.v2025.i3.644-667</a>","ama":"Arranz-Olmos S, Barthe G, Grégoire B, et al. Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. 2025;2025(3):644-667. doi:<a href=\"https://doi.org/10.46586/tches.v2025.i3.644-667\">10.46586/tches.v2025.i3.644-667</a>","chicago":"Arranz-Olmos, Santiago, Gilles Barthe, Benjamin Grégoire, Jan Jancar, Vincent Laporte, Tiago Oliveira, and Peter Schwabe. “Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i> 2025, no. 3 (2025): 644–67. <a href=\"https://doi.org/10.46586/tches.v2025.i3.644-667\">https://doi.org/10.46586/tches.v2025.i3.644-667</a>.","ieee":"S. Arranz-Olmos <i>et al.</i>, “Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code,” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2025, no. 3, pp. 644–667, 2025, doi: <a href=\"https://doi.org/10.46586/tches.v2025.i3.644-667\">10.46586/tches.v2025.i3.644-667</a>."},"author":[{"first_name":"Santiago","full_name":"Arranz-Olmos, Santiago","last_name":"Arranz-Olmos"},{"last_name":"Barthe","first_name":"Gilles","full_name":"Barthe, Gilles"},{"last_name":"Grégoire","full_name":"Grégoire, Benjamin","first_name":"Benjamin"},{"last_name":"Jancar","full_name":"Jancar, Jan","first_name":"Jan"},{"full_name":"Laporte, Vincent","first_name":"Vincent","last_name":"Laporte"},{"first_name":"Tiago","full_name":"Oliveira, Tiago","last_name":"Oliveira"},{"last_name":"Schwabe","full_name":"Schwabe, Peter","first_name":"Peter"}],"title":"Let’s DOIT: Using Intel’s Extended HW/SW Contract for Secure Compilation of Crypto Code","abstract":[{"lang":"eng","text":"<jats:p>It is a widely accepted standard practice to implement cryptographic software so that secret inputs do not influence the cycle count. Software following this paradigm is often referred to as “constant-time” software and typically involves following three rules: 1) never branch on a secret-dependent condition, 2) never access memory at a secret-dependent location, and 3) avoid variable-time arithmetic operations on secret data. The third rule requires knowledge about such variable-time arithmetic instructions, or vice versa, which operations are safe to use on secret inputs. For a long time, this knowledge was based on either documentation or microbenchmarks, but critically, there were never any guarantees for future microarchitectures. This changed with the introduction of the data-operand-independent-timing (DOIT) mode on Intel CPUs and, to some extent, the data-independent-timing (DIT) mode on Arm CPUs. Both Intel and Arm document a subset of their respective instruction sets that are intended to leak no information about their inputs through timing, even on future microarchitectures if the CPU is set to run in a dedicated DOIT (or DIT) mode.In this paper, we present a principled solution that leverages DOIT to enable cryptographic software that is future-proof constant-time, in the sense that it ensures that only instructions from the DOIT subset are used to operate on secret data, even during speculative execution after a mispredicted branch or function return location. For this solution, we build on top of existing security type systems in the Jasmin framework for high-assurance cryptography.We then use our solution to evaluate the extent to which existing cryptographic software built to be “constant-time” is already secure in this stricter paradigm implied by DOIT and what the performance impact is to move from constant-time to future-proof constant-time.</jats:p>"}],"doi":"10.46586/tches.v2025.i3.644-667","intvolume":"      2025"},{"year":"2025","type":"conference","language":[{"iso":"eng"}],"status":"public","publication":"16th Innovations in Theoretical Computer Science (ITCS)","date_created":"2024-01-07T20:09:13Z","date_updated":"2026-04-30T14:10:03Z","issue":"85","page":"1-24","_id":"50272","volume":325,"abstract":[{"lang":"eng","text":"Despite the fundamental role the Quantum Satisfiability (QSAT) problem has\r\nplayed in quantum complexity theory, a central question remains open: At which\r\nlocal dimension does the complexity of QSAT transition from \"easy\" to \"hard\"?\r\nHere, we study QSAT with each constraint acting on a $k$-dimensional and\r\n$l$-dimensional qudit pair, denoted $(k,l)$-QSAT. Our first main result shows\r\nthat, surprisingly, QSAT on qubits can remain $\\mathsf{QMA}_1$-hard, in that\r\n$(2,5)$-QSAT is $\\mathsf{QMA}_1$-complete. In contrast, $2$-SAT on qubits is\r\nwell-known to be poly-time solvable [Bravyi, 2006]. Our second main result\r\nproves that $(3,d)$-QSAT on the 1D line with $d\\in O(1)$ is also\r\n$\\mathsf{QMA}_1$-hard. Finally, we initiate the study of 1D $(2,d)$-QSAT by\r\ngiving a frustration-free 1D Hamiltonian with a unique, entangled ground state.\r\n  Our first result uses a direct embedding, combining a novel clock\r\nconstruction with the 2D circuit-to-Hamiltonian construction of [Gosset, Nagaj,\r\n2013]. Of note is a new simplified and analytic proof for the latter (as\r\nopposed to a partially numeric proof in [GN13]). This exploits Unitary Labelled\r\nGraphs [Bausch, Cubitt, Ozols, 2017] together with a new \"Nullspace Connection\r\nLemma\", allowing us to break low energy analyses into small patches of\r\nprojectors, and to improve the soundness analysis of [GN13] from\r\n$\\Omega(1/T^6)$ to $\\Omega(1/T^2)$, for $T$ the number of gates. Our second\r\nresult goes via black-box reduction: Given an arbitrary 1D Hamiltonian $H$ on\r\n$d'$-dimensional qudits, we show how to embed it into an effective null-space\r\nof a 1D $(3,d)$-QSAT instance, for $d\\in O(1)$. Our approach may be viewed as a\r\nweaker notion of \"simulation\" (\\`a la [Bravyi, Hastings 2017], [Cubitt,\r\nMontanaro, Piddock 2018]). As far as we are aware, this gives the first\r\n\"black-box simulation\"-based $\\mathsf{QMA}_1$-hardness result, i.e. for\r\nfrustration-free Hamiltonians."}],"intvolume":"       325","doi":"10.4230/LIPIcs.ITCS.2025.85","title":"Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation","author":[{"id":"57863","last_name":"Rudolph","full_name":"Rudolph, Dorian","first_name":"Dorian"},{"orcid":"0000-0002-9992-3379","last_name":"Gharibian","id":"71541","first_name":"Sevag","full_name":"Gharibian, Sevag"},{"full_name":"Nagaj, Daniel","first_name":"Daniel","last_name":"Nagaj"}],"external_id":{"arxiv":["2401.02368"]},"citation":{"short":"D. Rudolph, S. Gharibian, D. Nagaj, in: 16th Innovations in Theoretical Computer Science (ITCS), 2025, pp. 1–24.","bibtex":"@inproceedings{Rudolph_Gharibian_Nagaj_2025, title={Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation}, volume={325}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>}, number={85}, booktitle={16th Innovations in Theoretical Computer Science (ITCS)}, author={Rudolph, Dorian and Gharibian, Sevag and Nagaj, Daniel}, year={2025}, pages={1–24} }","mla":"Rudolph, Dorian, et al. “Quantum 2-SAT on Low Dimensional Systems Is $\\mathsf{QMA}_1$-Complete:  Direct Embeddings and Black-Box Simulation.” <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, vol. 325, no. 85, 2025, pp. 1–24, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>.","ieee":"D. Rudolph, S. Gharibian, and D. Nagaj, “Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation,” in <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, 2025, vol. 325, no. 85, pp. 1–24, doi: <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>.","chicago":"Rudolph, Dorian, Sevag Gharibian, and Daniel Nagaj. “Quantum 2-SAT on Low Dimensional Systems Is $\\mathsf{QMA}_1$-Complete:  Direct Embeddings and Black-Box Simulation.” In <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, 325:1–24, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">https://doi.org/10.4230/LIPIcs.ITCS.2025.85</a>.","apa":"Rudolph, D., Gharibian, S., &#38; Nagaj, D. (2025). Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation. <i>16th Innovations in Theoretical Computer Science (ITCS)</i>, <i>325</i>(85), 1–24. <a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">https://doi.org/10.4230/LIPIcs.ITCS.2025.85</a>","ama":"Rudolph D, Gharibian S, Nagaj D. Quantum 2-SAT on low dimensional systems is $\\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation. In: <i>16th Innovations in Theoretical Computer Science (ITCS)</i>. Vol 325. ; 2025:1-24. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITCS.2025.85\">10.4230/LIPIcs.ITCS.2025.85</a>"},"user_id":"71541","publication_status":"published"},{"_id":"61776","date_updated":"2026-04-30T14:08:24Z","date_created":"2025-10-10T13:44:52Z","publication":"arXiv:2510.08545","language":[{"iso":"eng"}],"year":"2025","type":"preprint","status":"public","citation":{"short":"U. Chabaud, S. Gharibian, S. Mehraban, A. Motamedi, H.R. Naeij, D. Rudolph, D. Sambrani, ArXiv:2510.08545 (2025).","mla":"Chabaud, Ulysse, et al. “Energy, Bosons and Computational Complexity.” <i>ArXiv:2510.08545</i>, 2025.","bibtex":"@article{Chabaud_Gharibian_Mehraban_Motamedi_Naeij_Rudolph_Sambrani_2025, title={Energy, Bosons and Computational Complexity}, journal={arXiv:2510.08545}, author={Chabaud, Ulysse and Gharibian, Sevag and Mehraban, Saeed and Motamedi, Arsalan and Naeij, Hamid Reza and Rudolph, Dorian and Sambrani, Dhruva}, year={2025} }","chicago":"Chabaud, Ulysse, Sevag Gharibian, Saeed Mehraban, Arsalan Motamedi, Hamid Reza Naeij, Dorian Rudolph, and Dhruva Sambrani. “Energy, Bosons and Computational Complexity.” <i>ArXiv:2510.08545</i>, 2025.","ieee":"U. Chabaud <i>et al.</i>, “Energy, Bosons and Computational Complexity,” <i>arXiv:2510.08545</i>. 2025.","ama":"Chabaud U, Gharibian S, Mehraban S, et al. Energy, Bosons and Computational Complexity. <i>arXiv:251008545</i>. Published online 2025.","apa":"Chabaud, U., Gharibian, S., Mehraban, S., Motamedi, A., Naeij, H. R., Rudolph, D., &#38; Sambrani, D. (2025). Energy, Bosons and Computational Complexity. In <i>arXiv:2510.08545</i>."},"user_id":"71541","external_id":{"arxiv":["2510.08545"]},"title":"Energy, Bosons and Computational Complexity","author":[{"last_name":"Chabaud","first_name":"Ulysse","full_name":"Chabaud, Ulysse"},{"full_name":"Gharibian, Sevag","first_name":"Sevag","id":"71541","last_name":"Gharibian","orcid":"0000-0002-9992-3379"},{"last_name":"Mehraban","full_name":"Mehraban, Saeed","first_name":"Saeed"},{"last_name":"Motamedi","full_name":"Motamedi, Arsalan","first_name":"Arsalan"},{"last_name":"Naeij","full_name":"Naeij, Hamid Reza","first_name":"Hamid Reza"},{"full_name":"Rudolph, Dorian","first_name":"Dorian","last_name":"Rudolph","id":"57863"},{"full_name":"Sambrani, Dhruva","first_name":"Dhruva","last_name":"Sambrani"}],"abstract":[{"lang":"eng","text":"We investigate the role of energy, i.e. average photon number, as a resource\r\nin the computational complexity of bosonic systems. We show three sets of\r\nresults: (1. Energy growth rates) There exist bosonic gate sets which increase\r\nenergy incredibly rapidly, obtaining e.g. infinite energy in finite/constant\r\ntime. We prove these high energies can make computing properties of bosonic\r\ncomputations, such as deciding whether a given computation will attain infinite\r\nenergy, extremely difficult, formally undecidable. (2. Lower bounds on\r\ncomputational power) More energy ``='' more computational power. For example,\r\ncertain gate sets allow poly-time bosonic computations to simulate PTOWER, the\r\nset of deterministic computations whose runtime scales as a tower of\r\nexponentials with polynomial height. Even just exponential energy and $O(1)$\r\nmodes suffice to simulate NP, which, importantly, is a setup similar to that of\r\nthe recent bosonic factoring algorithm of [Brenner, Caha, Coiteux-Roy and\r\nKoenig (2024)]. For simpler gate sets, we show an energy hierarchy theorem. (3.\r\nUpper bounds on computational power) Bosonic computations with polynomial\r\nenergy can be simulated in BQP, ``physical'' bosonic computations with\r\narbitrary finite energy are decidable, and the gate set consisting of Gaussian\r\ngates and the cubic phase gate can be simulated in PP, with exponential bound\r\non energy, improving upon the previous PSPACE upper bound. Finally, combining\r\nupper and lower bounds yields no-go theorems for a continuous-variable\r\nSolovay--Kitaev theorem for gate sets such as the Gaussian and cubic phase\r\ngates."}]},{"date_created":"2025-10-10T13:45:28Z","publication":"arXiv:2510.06796","language":[{"iso":"eng"}],"type":"preprint","year":"2025","status":"public","_id":"61778","date_updated":"2026-04-30T14:08:44Z","title":"On the complexity of estimating ground state entanglement and free  energy","author":[{"orcid":"0000-0002-9992-3379","first_name":"Sevag","full_name":"Gharibian, Sevag","id":"71541","last_name":"Gharibian"},{"first_name":"Jonas","full_name":"Kamminga, Jonas","last_name":"Kamminga"}],"abstract":[{"text":"Understanding the entanglement structure of local Hamiltonian ground spaces\r\nis a physically motivated problem, with applications ranging from tensor\r\nnetwork design to quantum error-correcting codes. To this end, we study the\r\ncomplexity of estimating ground state entanglement, and more generally entropy\r\nestimation for low energy states and Gibbs states. We find, in particular, that\r\nthe classes qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum\r\nanalogue of public-coin AM) and QMA(2) (QMA with unentangled proofs) play a\r\ncrucial role for such problems, showing: (1) Detecting a high-entanglement\r\nground state is qq-QAM-complete, (2) computing an additive error approximation\r\nto the Helmholtz free energy (equivalently, a multiplicative error\r\napproximation to the partition function) is in qq-QAM, (3) detecting a\r\nlow-entanglement ground state is QMA(2)-hard, and (4) detecting low energy\r\nstates which are close to product states can range from QMA-complete to\r\nQMA(2)-complete. Our results make progress on an open question of [Bravyi,\r\nChowdhury, Gosset and Wocjan, Nature Physics 2022] on free energy, and yield\r\nthe first QMA(2)-complete Hamiltonian problem using local Hamiltonians (cf. the\r\nsparse QMA(2)-complete Hamiltonian problem of [Chailloux, Sattath, CCC 2012]).","lang":"eng"}],"citation":{"short":"S. Gharibian, J. Kamminga, ArXiv:2510.06796 (2025).","mla":"Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating Ground State Entanglement and Free  Energy.” <i>ArXiv:2510.06796</i>, 2025.","bibtex":"@article{Gharibian_Kamminga_2025, title={On the complexity of estimating ground state entanglement and free  energy}, journal={arXiv:2510.06796}, author={Gharibian, Sevag and Kamminga, Jonas}, year={2025} }","chicago":"Gharibian, Sevag, and Jonas Kamminga. “On the Complexity of Estimating Ground State Entanglement and Free  Energy.” <i>ArXiv:2510.06796</i>, 2025.","ieee":"S. Gharibian and J. Kamminga, “On the complexity of estimating ground state entanglement and free  energy,” <i>arXiv:2510.06796</i>. 2025.","ama":"Gharibian S, Kamminga J. On the complexity of estimating ground state entanglement and free  energy. <i>arXiv:251006796</i>. Published online 2025.","apa":"Gharibian, S., &#38; Kamminga, J. (2025). On the complexity of estimating ground state entanglement and free  energy. In <i>arXiv:2510.06796</i>."},"user_id":"71541","department":[{"_id":"7"},{"_id":"623"}],"external_id":{"arxiv":["2510.06796"]}},{"title":"The Swineherd’s Wife who Scolded the King","editor":[{"full_name":"Butler, Emily","first_name":"Emily","last_name":"Butler"},{"last_name":"Dumitrescu","first_name":"Irina","full_name":"Dumitrescu, Irina"}],"author":[{"full_name":"Foerster, Anne","first_name":"Anne","id":"67185","last_name":"Foerster"}],"department":[{"_id":"6"}],"series_title":"The New Middle Ages","citation":{"bibtex":"@inbook{Foerster, series={The New Middle Ages}, title={The Swineherd’s Wife who Scolded the King}, booktitle={Women in Early Medieval England}, publisher={Springer Textbook}, author={Foerster, Anne}, editor={Butler, Emily and Dumitrescu, Irina}, collection={The New Middle Ages} }","ama":"Foerster A. The Swineherd’s Wife who Scolded the King. In: Butler E, Dumitrescu I, eds. <i>Women in Early Medieval England</i>. The New Middle Ages. Springer Textbook.","apa":"Foerster, A. (n.d.). The Swineherd’s Wife who Scolded the King. In E. Butler &#38; I. Dumitrescu (Eds.), <i>Women in Early Medieval England</i>. Springer Textbook.","mla":"Foerster, Anne. “The Swineherd’s Wife Who Scolded the King.” <i>Women in Early Medieval England</i>, edited by Emily Butler and Irina Dumitrescu, Springer Textbook.","ieee":"A. Foerster, “The Swineherd’s Wife who Scolded the King,” in <i>Women in Early Medieval England</i>, E. Butler and I. Dumitrescu, Eds. Springer Textbook.","chicago":"Foerster, Anne. “The Swineherd’s Wife Who Scolded the King.” In <i>Women in Early Medieval England</i>, edited by Emily Butler and Irina Dumitrescu. The New Middle Ages. Springer Textbook, n.d.","short":"A. Foerster, in: E. Butler, I. Dumitrescu (Eds.), Women in Early Medieval England, Springer Textbook, n.d."},"user_id":"67185","publication_status":"submitted","type":"encyclopedia_article","year":"2024","language":[{"iso":"eng"}],"status":"public","publication":"Women in Early Medieval England","date_created":"2023-10-20T11:01:26Z","publisher":"Springer Textbook","date_updated":"2023-10-20T11:03:21Z","_id":"48363"},{"title":"Eadburh of Wessex","editor":[{"last_name":"Butler","first_name":"Emily","full_name":"Butler, Emily"},{"first_name":"Irina","full_name":"Dumitrescu, Irina","last_name":"Dumitrescu"}],"author":[{"first_name":"Anne","full_name":"Foerster, Anne","last_name":"Foerster","id":"67185"}],"department":[{"_id":"6"}],"citation":{"apa":"Foerster, A. (n.d.). Eadburh of Wessex. In E. Butler &#38; I. Dumitrescu (Eds.), <i>Women in Early Medieval England</i>. Springer Textbook.","ama":"Foerster A. Eadburh of Wessex. In: Butler E, Dumitrescu I, eds. <i>Women in Early Medieval England</i>. The New Middle Ages. Springer Textbook.","ieee":"A. Foerster, “Eadburh of Wessex,” in <i>Women in Early Medieval England</i>, E. Butler and I. Dumitrescu, Eds. Springer Textbook.","chicago":"Foerster, Anne. “Eadburh of Wessex.” In <i>Women in Early Medieval England</i>, edited by Emily Butler and Irina Dumitrescu. The New Middle Ages. Springer Textbook, n.d.","bibtex":"@inbook{Foerster, series={The New Middle Ages}, title={Eadburh of Wessex}, booktitle={Women in Early Medieval England}, publisher={Springer Textbook}, author={Foerster, Anne}, editor={Butler, Emily and Dumitrescu, Irina}, collection={The New Middle Ages} }","mla":"Foerster, Anne. “Eadburh of Wessex.” <i>Women in Early Medieval England</i>, edited by Emily Butler and Irina Dumitrescu, Springer Textbook.","short":"A. Foerster, in: E. Butler, I. Dumitrescu (Eds.), Women in Early Medieval England, Springer Textbook, n.d."},"series_title":"The New Middle Ages","publication_status":"submitted","user_id":"67185","language":[{"iso":"eng"}],"type":"encyclopedia_article","year":"2024","status":"public","date_created":"2023-10-20T11:00:01Z","publication":"Women in Early Medieval England","publisher":"Springer Textbook","date_updated":"2023-10-20T11:00:14Z","_id":"48362"},{"date_updated":"2023-10-20T11:03:20Z","_id":"48364","year":"2024","type":"encyclopedia_article","language":[{"iso":"eng"}],"status":"public","publication":"Women in Early Medieval England","date_created":"2023-10-20T11:03:16Z","publisher":"Springer Textbook","department":[{"_id":"6"}],"series_title":"The New Middle Ages","citation":{"apa":"Foerster, A. (n.d.). Seaxburh. In E. Butler &#38; I. Dumitrescu (Eds.), <i>Women in Early Medieval England</i>. Springer Textbook.","ama":"Foerster A. Seaxburh. In: Butler E, Dumitrescu I, eds. <i>Women in Early Medieval England</i>. The New Middle Ages. Springer Textbook.","ieee":"A. Foerster, “Seaxburh,” in <i>Women in Early Medieval England</i>, E. Butler and I. Dumitrescu, Eds. Springer Textbook.","chicago":"Foerster, Anne. “Seaxburh.” In <i>Women in Early Medieval England</i>, edited by Emily Butler and Irina Dumitrescu. The New Middle Ages. Springer Textbook, n.d.","bibtex":"@inbook{Foerster, series={The New Middle Ages}, title={Seaxburh}, booktitle={Women in Early Medieval England}, publisher={Springer Textbook}, author={Foerster, Anne}, editor={Butler, Emily and Dumitrescu, Irina}, collection={The New Middle Ages} }","mla":"Foerster, Anne. “Seaxburh.” <i>Women in Early Medieval England</i>, edited by Emily Butler and Irina Dumitrescu, Springer Textbook.","short":"A. Foerster, in: E. Butler, I. Dumitrescu (Eds.), Women in Early Medieval England, Springer Textbook, n.d."},"user_id":"67185","publication_status":"submitted","title":"Seaxburh","editor":[{"first_name":"Emily","full_name":"Butler, Emily","last_name":"Butler"},{"full_name":"Dumitrescu, Irina","first_name":"Irina","last_name":"Dumitrescu"}],"author":[{"last_name":"Foerster","id":"67185","full_name":"Foerster, Anne","first_name":"Anne"}]},{"title":"Struktur und Sonderbauten der Silberbergbaustädte des 16. Jahrhunderts. Zur Korrelation von Städtebau und Montanwesen (Potosí und das Erzgebirge)","author":[{"id":"47652","last_name":"Silvestri","full_name":"Silvestri, Marco","first_name":"Marco"}],"department":[{"_id":"443"}],"citation":{"short":"M. Silvestri, in: Bergbau und Hausbau, n.d.","bibtex":"@inbook{Silvestri, title={Struktur und Sonderbauten der Silberbergbaustädte des 16. Jahrhunderts. Zur Korrelation von Städtebau und Montanwesen (Potosí und das Erzgebirge)}, booktitle={Bergbau und Hausbau}, author={Silvestri, Marco} }","mla":"Silvestri, Marco. “Struktur und Sonderbauten der Silberbergbaustädte des 16. Jahrhunderts. Zur Korrelation von Städtebau und Montanwesen (Potosí und das Erzgebirge).” <i>Bergbau und Hausbau</i>.","ieee":"M. Silvestri, “Struktur und Sonderbauten der Silberbergbaustädte des 16. Jahrhunderts. Zur Korrelation von Städtebau und Montanwesen (Potosí und das Erzgebirge),” in <i>Bergbau und Hausbau</i>, .","chicago":"Silvestri, Marco. “Struktur und Sonderbauten der Silberbergbaustädte des 16. Jahrhunderts. Zur Korrelation von Städtebau und Montanwesen (Potosí und das Erzgebirge).” In <i>Bergbau und Hausbau</i>, n.d.","apa":"Silvestri, M. (n.d.). Struktur und Sonderbauten der Silberbergbaustädte des 16. Jahrhunderts. Zur Korrelation von Städtebau und Montanwesen (Potosí und das Erzgebirge). In <i>Bergbau und Hausbau</i>.","ama":"Silvestri M. Struktur und Sonderbauten der Silberbergbaustädte des 16. Jahrhunderts. Zur Korrelation von Städtebau und Montanwesen (Potosí und das Erzgebirge). In: <i>Bergbau und Hausbau</i>."},"user_id":"47652","publication_status":"accepted","year":"2024","type":"book_chapter","language":[{"iso":"ger"}],"status":"public","publication":"Bergbau und Hausbau","date_created":"2023-02-06T13:30:35Z","date_updated":"2023-12-20T15:00:18Z","_id":"41850"},{"department":[{"_id":"148"},{"_id":"321"},{"_id":"9"}],"series_title":"Schriftenreihe Kunststofftechnik Paderborn","citation":{"ama":"Schall CWT. <i>Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken</i>. Vol Band 2/2024. Shaker Verlag; 2024.","apa":"Schall, C. W. T. (2024). <i>Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken: Vol. Band 2/2024</i>. Shaker Verlag.","ieee":"C. W. T. Schall, <i>Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken</i>, vol. Band 2/2024. Düren: Shaker Verlag, 2024.","chicago":"Schall, Christoph Wilhelm Theodor. <i>Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken</i>. Vol. Band 2/2024. Schriftenreihe Kunststofftechnik Paderborn. Düren: Shaker Verlag, 2024.","bibtex":"@book{Schall_2024, place={Düren}, series={Schriftenreihe Kunststofftechnik Paderborn}, title={Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken}, volume={Band 2/2024}, publisher={Shaker Verlag}, author={Schall, Christoph Wilhelm Theodor}, year={2024}, collection={Schriftenreihe Kunststofftechnik Paderborn} }","mla":"Schall, Christoph Wilhelm Theodor. <i>Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken</i>. Shaker Verlag, 2024.","short":"C.W.T. Schall, Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken, Shaker Verlag, Düren, 2024."},"publication_status":"published","place":"Düren","supervisor":[{"full_name":"Schöppner, Volker","first_name":"Volker","last_name":"Schöppner","id":"20530"}],"author":[{"last_name":"Schall","id":"44224","first_name":"Christoph Wilhelm Theodor","full_name":"Schall, Christoph Wilhelm Theodor"}],"date_updated":"2024-01-16T09:49:07Z","_id":"50530","publication_identifier":{"isbn":["978-3-8440-9334-6"]},"year":"2024","language":[{"iso":"ger"}],"status":"public","date_created":"2024-01-16T09:48:27Z","publisher":"Shaker Verlag","user_id":"44224","abstract":[{"text":"Die Extrusion stellt das mengenmäßig dominante Verarbeitungsverfahren für thermoplastische Kunststoffe dar. Daher gibt es starke Bestrebungen in diesem Bereich hin zu einer höheren Wirtschaftlichkeit, welche beispielsweise durch höheren Massedurchsatz bei gleichbleibender Maschinengröße erreicht werden kann, oder aber auch im Hinblick auf eine Kreislaufwirtschaft die Bestrebung hin zu einer materialschonenden Verarbeitung. Beide Bestrebungen erfordern spezielle Schneckenkonzepte. Hierunter fallenWave- Schnecken, welche in beiden Bereichen ein vorteilhaftes Prozessverhalten aufzeigen sollen. Die Auslegung von Wave-Schnecken erfordert jedoch ein stärkeres Verständnis über das geometrieabhängige Prozessverhalten in der Extrusion. \r\nIm Rahmen der Dissertation werden zwei Themengebiete angegangen. Das erste Thema ist die Herleitung einer Methode zur Charakterisierung des Abbauverhaltens von Thermoplasten sowie die Nutzung der Charakterisierung als Vorhersagemodell. Das zweite Thema behandelt die Auslegung von Wave-Schnecken basierend auf numerischen Simulationen samt Validierung anhand von sieben Energy-Transfer-Schnecken im Vergleich zu drei konventionellen Schnecken. Hierbei werden unter anderem der Materialabbau, die thermische und die stoffliche Homogenität betrachtet, um ein umfassendes Bild über das Prozessverhalten der Schnecken zu schaffen. Die vorgestellten Untersuchungen dienen schlussendlich zu einer Bestätigung des vorteilhaften Prozessverhaltens von Wave-Schnecken.","lang":"ger"},{"lang":"eng","text":"The extrusion process is the dominant processing method for thermoplastics in terms of quantity. For this reason, there are strong efforts in this area towards greater economic efficiency, which can be achieved, for example, through higher mass throughput with the same machine size, or, with regard to a circular economy, towards material-preserving processing. Both endeavours require special screw concepts. These include wave screws, which should demonstrate advantageous process behaviour in both areas. However, the design of wave screws requires a better understanding of the geometry-dependent process behaviour in extrusion. \r\nTwo topics are addressed in the dissertation. The first topic is the derivation of a method to characterise the degradation behaviour of thermoplastics and the use of the characterisation as a predictive model. The second topic deals with the design of wave screws based on numerical simulations including validation using seven energy transfer screws in comparison to three conventional screws. Among other things, the material degradation, the thermal and the material homogeneity are considered in order to create a comprehensive picture of the process behaviour of the screws. The presented investigations ultimately serve to confirm the advantageous process behaviour of wave screws."}],"title":"Materialschonende Verarbeitung von Thermoplasten auf Wave-Schnecken","page":"224","volume":"Band 2/2024","type":"dissertation"},{"user_id":"51214","publication_status":"published","keyword":["Physical Therapy","Sports Therapy and Rehabilitation","Orthopedics and Sports Medicine"],"citation":{"mla":"Widmann, Manuel, et al. “COVID-19 in Female and Male Athletes: Symptoms, Clinical Findings, Outcome, and Prolonged Exercise Intolerance—A Prospective, Observational, Multicenter Cohort Study (CoSmo-S).” <i>Sports Medicine</i>, Springer Science and Business Media LLC, 2024, doi:<a href=\"https://doi.org/10.1007/s40279-023-01976-0\">10.1007/s40279-023-01976-0</a>.","bibtex":"@article{Widmann_Gaidai_Schubert_Grummt_Bensen_Kerling_Quermann_Zacher_Vollrath_Bizjak_et al._2024, title={COVID-19 in Female and Male Athletes: Symptoms, Clinical Findings, Outcome, and Prolonged Exercise Intolerance—A Prospective, Observational, Multicenter Cohort Study (CoSmo-S)}, DOI={<a href=\"https://doi.org/10.1007/s40279-023-01976-0\">10.1007/s40279-023-01976-0</a>}, journal={Sports Medicine}, publisher={Springer Science and Business Media LLC}, author={Widmann, Manuel and Gaidai, Roman and Schubert, Isabel and Grummt, Maximilian and Bensen, Lieselotte and Kerling, Arno and Quermann, Anne and Zacher, Jonas and Vollrath, Shirin and Bizjak, Daniel Alexander and et al.}, year={2024} }","short":"M. Widmann, R. Gaidai, I. Schubert, M. Grummt, L. Bensen, A. Kerling, A. Quermann, J. Zacher, S. Vollrath, D.A. Bizjak, C. Beckendorf, F. Egger, E. Hasler, K.-P. Mellwig, C. Fütterer, F. Wimbauer, A. Vogel, J. Schoenfeld, J.C. Wüstenfeld, T. Kastner, F. Barsch, B. Friedmann-Bette, W. Bloch, T. Meyer, F. Mayer, B. Wolfarth, K. Roecker, C. Reinsberger, B. Haller, A.M. Niess, M.P. Birnbaum, C. Burgstahler, M. Cassel, P. Deibert, K. Esefeld, G. Erz, F. Greiss, M. Halle, J. Hesse, K. Keller, C. Kopp, L. Matits, H.G. Predel, P. Rüdrich, G. Schneider, P. Stapmanns, J.M. Steinacker, S. Szekessy, A. Venhorst, S. Zapf, C. Zickwolf, Sports Medicine (2024).","apa":"Widmann, M., Gaidai, R., Schubert, I., Grummt, M., Bensen, L., Kerling, A., Quermann, A., Zacher, J., Vollrath, S., Bizjak, D. A., Beckendorf, C., Egger, F., Hasler, E., Mellwig, K.-P., Fütterer, C., Wimbauer, F., Vogel, A., Schoenfeld, J., Wüstenfeld, J. C., … Zickwolf, C. (2024). COVID-19 in Female and Male Athletes: Symptoms, Clinical Findings, Outcome, and Prolonged Exercise Intolerance—A Prospective, Observational, Multicenter Cohort Study (CoSmo-S). <i>Sports Medicine</i>. <a href=\"https://doi.org/10.1007/s40279-023-01976-0\">https://doi.org/10.1007/s40279-023-01976-0</a>","ama":"Widmann M, Gaidai R, Schubert I, et al. COVID-19 in Female and Male Athletes: Symptoms, Clinical Findings, Outcome, and Prolonged Exercise Intolerance—A Prospective, Observational, Multicenter Cohort Study (CoSmo-S). <i>Sports Medicine</i>. Published online 2024. doi:<a href=\"https://doi.org/10.1007/s40279-023-01976-0\">10.1007/s40279-023-01976-0</a>","chicago":"Widmann, Manuel, Roman Gaidai, Isabel Schubert, Maximilian Grummt, Lieselotte Bensen, Arno Kerling, Anne Quermann, et al. “COVID-19 in Female and Male Athletes: Symptoms, Clinical Findings, Outcome, and Prolonged Exercise Intolerance—A Prospective, Observational, Multicenter Cohort Study (CoSmo-S).” <i>Sports Medicine</i>, 2024. <a href=\"https://doi.org/10.1007/s40279-023-01976-0\">https://doi.org/10.1007/s40279-023-01976-0</a>.","ieee":"M. Widmann <i>et al.</i>, “COVID-19 in Female and Male Athletes: Symptoms, Clinical Findings, Outcome, and Prolonged Exercise Intolerance—A Prospective, Observational, Multicenter Cohort Study (CoSmo-S),” <i>Sports Medicine</i>, 2024, doi: <a href=\"https://doi.org/10.1007/s40279-023-01976-0\">10.1007/s40279-023-01976-0</a>."},"department":[{"_id":"176"}],"author":[{"full_name":"Widmann, Manuel","first_name":"Manuel","last_name":"Widmann"},{"id":"51214","last_name":"Gaidai","first_name":"Roman","full_name":"Gaidai, Roman"},{"last_name":"Schubert","first_name":"Isabel","full_name":"Schubert, Isabel"},{"first_name":"Maximilian","full_name":"Grummt, Maximilian","last_name":"Grummt"},{"full_name":"Bensen, Lieselotte","first_name":"Lieselotte","last_name":"Bensen"},{"full_name":"Kerling, Arno","first_name":"Arno","last_name":"Kerling"},{"full_name":"Quermann, Anne","first_name":"Anne","last_name":"Quermann"},{"full_name":"Zacher, Jonas","first_name":"Jonas","last_name":"Zacher"},{"last_name":"Vollrath","first_name":"Shirin","full_name":"Vollrath, Shirin"},{"last_name":"Bizjak","full_name":"Bizjak, Daniel Alexander","first_name":"Daniel Alexander"},{"full_name":"Beckendorf, Claudia","first_name":"Claudia","last_name":"Beckendorf"},{"last_name":"Egger","full_name":"Egger, Florian","first_name":"Florian"},{"first_name":"Erik","full_name":"Hasler, Erik","last_name":"Hasler"},{"last_name":"Mellwig","full_name":"Mellwig, Klaus-Peter","first_name":"Klaus-Peter"},{"last_name":"Fütterer","first_name":"Cornelia","full_name":"Fütterer, Cornelia"},{"first_name":"Fritz","full_name":"Wimbauer, Fritz","last_name":"Wimbauer"},{"last_name":"Vogel","first_name":"Azin","full_name":"Vogel, Azin"},{"first_name":"Julia","full_name":"Schoenfeld, Julia","last_name":"Schoenfeld"},{"last_name":"Wüstenfeld","first_name":"Jan C.","full_name":"Wüstenfeld, Jan C."},{"last_name":"Kastner","first_name":"Tom","full_name":"Kastner, Tom"},{"last_name":"Barsch","full_name":"Barsch, Friedrich","first_name":"Friedrich"},{"full_name":"Friedmann-Bette, Birgit","first_name":"Birgit","last_name":"Friedmann-Bette"},{"full_name":"Bloch, Wilhelm","first_name":"Wilhelm","last_name":"Bloch"},{"last_name":"Meyer","first_name":"Tim","full_name":"Meyer, Tim"},{"last_name":"Mayer","full_name":"Mayer, Frank","first_name":"Frank"},{"first_name":"Bernd","full_name":"Wolfarth, Bernd","last_name":"Wolfarth"},{"full_name":"Roecker, Kai","first_name":"Kai","last_name":"Roecker"},{"last_name":"Reinsberger","first_name":"Claus","full_name":"Reinsberger, Claus"},{"full_name":"Haller, Bernhard","first_name":"Bernhard","last_name":"Haller"},{"last_name":"Niess","first_name":"Andreas M.","full_name":"Niess, Andreas M."},{"first_name":"Mike Peter","full_name":"Birnbaum, Mike Peter","last_name":"Birnbaum"},{"first_name":"Christof","full_name":"Burgstahler, Christof","last_name":"Burgstahler"},{"first_name":"Michael","full_name":"Cassel, Michael","last_name":"Cassel"},{"full_name":"Deibert, Peter","first_name":"Peter","last_name":"Deibert"},{"last_name":"Esefeld","first_name":"Katrin","full_name":"Esefeld, Katrin"},{"full_name":"Erz, Gunnar","first_name":"Gunnar","last_name":"Erz"},{"full_name":"Greiss, Franziska","first_name":"Franziska","last_name":"Greiss"},{"last_name":"Halle","first_name":"Martin","full_name":"Halle, Martin"},{"first_name":"Judith","full_name":"Hesse, Judith","last_name":"Hesse"},{"first_name":"Karsten","full_name":"Keller, Karsten","last_name":"Keller"},{"first_name":"Christine","full_name":"Kopp, Christine","last_name":"Kopp"},{"last_name":"Matits","full_name":"Matits, Lynn","first_name":"Lynn"},{"full_name":"Predel, Hans Georg","first_name":"Hans Georg","last_name":"Predel"},{"first_name":"Peter","full_name":"Rüdrich, Peter","last_name":"Rüdrich"},{"last_name":"Schneider","full_name":"Schneider, Gerald","first_name":"Gerald"},{"last_name":"Stapmanns","first_name":"Philipp","full_name":"Stapmanns, Philipp"},{"last_name":"Steinacker","first_name":"Jürgen Michael","full_name":"Steinacker, Jürgen Michael"},{"full_name":"Szekessy, Sarah","first_name":"Sarah","last_name":"Szekessy"},{"first_name":"Andreas","full_name":"Venhorst, Andreas","last_name":"Venhorst"},{"last_name":"Zapf","full_name":"Zapf, Stephanie","first_name":"Stephanie"},{"last_name":"Zickwolf","first_name":"Christian","full_name":"Zickwolf, Christian"}],"title":"COVID-19 in Female and Male Athletes: Symptoms, Clinical Findings, Outcome, and Prolonged Exercise Intolerance—A Prospective, Observational, Multicenter Cohort Study (CoSmo-S)","doi":"10.1007/s40279-023-01976-0","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:sec>\r\n              <jats:title>Background</jats:title>\r\n              <jats:p>An infection with SARS-CoV-2 can lead to a variety of symptoms and complications, which can impair athletic activity.</jats:p>\r\n            </jats:sec><jats:sec>\r\n              <jats:title>Objective</jats:title>\r\n              <jats:p>We aimed to assess the clinical symptom patterns, diagnostic findings, and the extent of impairment in sport practice in a large cohort of athletes infected with SARS-CoV-2, both initially after infection and at follow-up. Additionally, we investigated whether baseline factors that may contribute to reduced exercise tolerance at follow-up can be identified.</jats:p>\r\n            </jats:sec><jats:sec>\r\n              <jats:title>Methods</jats:title>\r\n              <jats:p>In this prospective, observational, multicenter study, we recruited German COVID elite-athletes (cEAs, <jats:italic>n</jats:italic> = 444) and COVID non-elite athletes (cNEAs, <jats:italic>n</jats:italic> = 481) who tested positive for SARS-CoV-2 by PCR (polymerase chain reaction test). Athletes from the federal squad with no evidence of SARS-CoV-2 infection served as healthy controls (EAcon, <jats:italic>n</jats:italic> = 501). Questionnaires were used to assess load and duration of infectious symptoms, other complaints, exercise tolerance, and duration of training interruption at baseline and at follow-up 6 months after baseline. Diagnostic tests conducted at baseline included resting and exercise electrocardiogram (ECG), echocardiography, spirometry, and blood analyses.</jats:p>\r\n            </jats:sec><jats:sec>\r\n              <jats:title>Results</jats:title>\r\n              <jats:p>Most acute and infection-related symptoms and other complaints were more prevalent in cNEA than in cEAs. Compared to cEAs, EAcon had a low symptom load. In cNEAs, female athletes had a higher prevalence of complaints such as palpitations, dizziness, chest pain, myalgia, sleeping disturbances, mood swings, and concentration problems compared to male athletes (<jats:italic>p</jats:italic> &lt; 0.05). Until follow-up, leading symptoms were drop in performance, concentration problems, and dyspnea on exertion. Female athletes had significantly higher prevalence for symptoms until follow-up compared to male. Pathological findings in ECG, echocardiography, and spirometry, attributed to SARS-CoV-2 infection, were rare in infected athletes. Most athletes reported a training interruption between 2 and 4 weeks (cNEAs: 52.9%, cEAs: 52.4%), while more cNEAs (27.1%) compared to cEAs (5.1%) had a training interruption lasting more than 4 weeks (<jats:italic>p</jats:italic> &lt; 0.001). At follow-up, 13.8% of cNEAs and 9.9% of cEAs (<jats:italic>p</jats:italic> = 0.24) reported their current exercise tolerance to be under 70% compared to pre-infection state. A persistent loss of exercise tolerance at follow-up was associated with persistent complaints at baseline, female sex, a longer break in training, and age &gt; 38 years. Periodical dichotomization of the data set showed a higher prevalence of infectious symptoms such as cough, sore throat, and coryza in the second phase of the pandemic, while a number of neuropsychiatric symptoms as well as dyspnea on exertion were less frequent in this period.</jats:p>\r\n            </jats:sec><jats:sec>\r\n              <jats:title>Conclusions</jats:title>\r\n              <jats:p>Compared to recreational athletes, elite athletes seem to be at lower risk of being or remaining symptomatic after SARS-CoV-2 infection. It remains to be determined whether persistent complaints after SARS-CoV-2 infection without evidence of accompanying organ damage may have a negative impact on further health and career in athletes. Identifying risk factors for an extended recovery period such as female sex and ongoing neuropsychological symptoms could help to identify athletes, who may require a more cautious approach to rebuilding their training regimen.</jats:p>\r\n            </jats:sec><jats:sec>\r\n              <jats:title>Trial Registration Number</jats:title>\r\n              <jats:p>DRKS00023717; 06.15.2021—retrospectively registered.</jats:p>\r\n            </jats:sec>"}],"_id":"50798","date_updated":"2024-01-23T12:48:34Z","publisher":"Springer Science and Business Media LLC","publication":"Sports Medicine","date_created":"2024-01-23T12:47:53Z","status":"public","type":"journal_article","publication_identifier":{"issn":["0112-1642","1179-2035"]},"year":"2024","language":[{"iso":"eng"}]}]
