@article{59051,
  abstract     = {{Model‐based state observers require high‐quality models to deliver accurate state estimates. However, due to time or cost shortage, modeling simplifications or numerical issues, models often have severe inaccuracies that may lead to insufficient and deficient control. Instead of attempting to iteratively model these deviations, we address the challenge by the concept of joint estimation. Thus, we assume a linear combination of suitable functions to approximate the inaccuracies. The parameters of the linear combination are supposed to be time invariant and augment the model's state. Subsequently, the parameters can be identified simultaneously to the states within the observer. Referring to the principle of Occam's razor, the parameters are claimed to be sparse. Our former work shows that estimating states and model inaccuracies simultaneously by a sparsity promoting unscented Kalman filter yields not only high accuracy but also provides interpretable representations of underlying inaccuracies. Based on this work, our contribution is twofold: First, we apply our approach finally on a real‐world test bench, namely a golf robot. Within the experimental setting, we investigate closed loop behavior as well as how suitable functions need to be chosen to approximate the inaccuracies in a physically interpretable way. Results do not only provide high state estimation accuracy but also meaningful insights into the system's inaccuracies. Second, we discuss and establish a method to automatically adapt and update the model based on collected data of the linear combination during operation. Examining past parameter estimates by principal component analysis, a moving window is utilized to extract the most dominant functions. These are kept characterizing the model inaccuracies, while nondominant functions are automatically neglected and refilled with novel function candidates. After analysis and rebuilding, this updated function set is subsequently fed back into the joint estimation loop and deployed for further estimation. Hence, we give a holistic paradigm of how to analyze and combat model inaccuracies while ensuring high state estimation accuracy. Within this setting, we once more investigate closed loop behavior and yield promising results. In conclusion, we show that the proposed observer provides a helpful tool to guarantee high estimation accuracy for models with severe inaccuracies or for situations with occurring deviations during operation, for example, due to mechanical wear or temperature changes.</jats:p>}},
  author       = {{Götte, Ricarda-Samantha and Timmermann, Julia}},
  issn         = {{1617-7061}},
  journal      = {{PAMM}},
  number       = {{1}},
  publisher    = {{Wiley}},
  title        = {{{Online Learning With Joint State and Model Estimation}}},
  doi          = {{10.1002/pamm.202400080}},
  volume       = {{25}},
  year         = {{2024}},
}

@misc{61115,
  author       = {{Peckhaus, Volker}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Fotografie: „Aristoteles am Apothekenerker des Rathauses in Lemgo“, in: Volker Peckhaus und Sebastian Luft: Philosophische Übergänge. Die Abschiedsvorlesung von Volker Peckhaus und die Antrittsvorlesung von Sebastian Luft im Oktober 2023, hg. v. Vanessa Albus, Universität Paderborn: Paderborn (PUR #163), 39}}},
  year         = {{2024}},
}

@article{54459,
  author       = {{Knorr, Lukas and Schlosser, Florian and Horstmann, Nils and Divkovic, Denis and Meschede, Henning}},
  issn         = {{0306-2619}},
  journal      = {{Applied Energy}},
  publisher    = {{Elsevier BV}},
  title        = {{{Flexible operation and integration of high-temperature heat pumps using large temperature glides}}},
  doi          = {{10.1016/j.apenergy.2024.123417}},
  volume       = {{368}},
  year         = {{2024}},
}

@misc{61114,
  author       = {{Peckhaus, Volker}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Fotografie: „Ratio an der Lateinschule in Alfeld“, in: Volker Peckhaus und Sebastian Luft: Philosophische Übergänge. Die Abschiedsvorlesung von Volker Peckhaus und die Antrittsvorlesung von Sebastian Luft im Oktober 2023, hg. v. Vanessa Albus, Universität Paderborn: Paderborn (PUR #163), 34–35}}},
  year         = {{2024}},
}

@misc{17752,
  author       = {{Peckhaus, Volker}},
  booktitle    = {{Neue Deutsche Biographie, Bd. 28: Wettstein - Zwoch}},
  pages        = {{659--660}},
  publisher    = {{Duncker & Humblot}},
  title        = {{{Zermelo }}},
  year         = {{2024}},
}

@misc{58263,
  author       = {{Peckhaus, Volker}},
  booktitle    = {{zbMATH Open, Zbl. 07782971}},
  title        = {{{Schmidt, Gunther, Mathematik als Wissenschaft in der Gesellschaft. Historische Äußerungen und aktuelle Anregungen, Springer Spektrum: Berlin 2023, xiii, 263 S. }}},
  year         = {{2024}},
}

@inproceedings{58552,
  author       = {{Berndt, Axel and Vollmer, F. and Münzmay, Andreas}},
  booktitle    = {{{Diskografentag: International Conference on Recorded Music}}},
  title        = {{{Multi-Modal Data Networks in Music: Thoughts on a Digital Performance Edition and its Potential for Ethnomusicology}}},
  year         = {{2024}},
}

@inproceedings{55637,
  author       = {{Kostan, Anastassija and Olschar, Sara and Simko, Lucy and Acar, Yasemin}},
  booktitle    = {{33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024}},
  editor       = {{Balzarotti, Davide and Xu, Wenyuan}},
  publisher    = {{USENIX Association}},
  title        = {{{Exploring digital security and privacy in relative poverty in Germany through qualitative interviews}}},
  year         = {{2024}},
}

@inbook{59581,
  author       = {{Häsel-Weide, Uta and Nührenbörger, M.}},
  booktitle    = {{Beiträge zum Mathematikuntericht 2024. 57. Jahrestagung der Gesellschaft für Didaktik der Mathematik}},
  editor       = {{Ebers, P. and Rösken, F. and Barzel, B. and Büchter, A. and Schacht, F. and Scherer, P.}},
  pages        = {{207--210}},
  title        = {{{ Praktiken der Förderung im inklusiven Mathematikunterricht}}},
  doi          = {{https://doi.ohttps://doi.org/10.37626/GA9783959872782.0 rg/10.37626/GA9783959872782.0}},
  year         = {{2024}},
}

@article{50009,
  abstract     = {{<jats:p> In the past decades, the notion of voice in the theorizing and teaching of academic writing has been the subject of much debate and conceptual change, especially concerning its relation to writer identity. Many newer accounts of voice and identity in academic writing draw on the dialogical concept of voice by Bakhtin. However, some theoretical and methodological inconsistencies have surfaced in the adaptions of the concept. Working from a refinement of the dialogical notion of voice based on the concepts of polyphony and interiorization, this article presents a methodological approach for analyzing voice(s) in writing. The article presents material around the evolution of an early-career researcher’s dissertation synopsis. The material is multilayered, including the writer’s text, transcripts from an interdisciplinary peer-feedback conversation with two colleagues, and a video-stimulated interview with the writer. Excerpts of the material were analyzed to trace the polyphony of interiorized voices that influenced the writing. This focus revealed the multivoicedness of academic texts as an effect of their history of coming into being. This article contributes to the question of voice and identity in academic writing from a dialogical psycholinguistic perspective by presenting a de-reifying notion of voice grounded in an understanding of writing as a polyphonic activity, which also feeds into the formation of a writer’s self. </jats:p>}},
  author       = {{Karsten, Andrea}},
  issn         = {{0741-0883}},
  journal      = {{Written Communication}},
  keywords     = {{Literature and Literary Theory, Communication}},
  number       = {{1}},
  pages        = {{6--36}},
  publisher    = {{SAGE Publications}},
  title        = {{{Voices in Dialogue: Taking Polyphony in Academic Writing Seriously}}},
  doi          = {{10.1177/07410883231207104}},
  volume       = {{41}},
  year         = {{2024}},
}

@inbook{61166,
  author       = {{Dahl, Stefanie and Aschebrock, Kathrin}},
  booktitle    = {{Wissenstransfer in der Sportpädagogik}},
  editor       = {{Neuber, Nils}},
  isbn         = {{9783658436216}},
  issn         = {{2512-0697}},
  pages        = {{153--170}},
  publisher    = {{Springer Fachmedien Wiesbaden}},
  title        = {{{Forschungsverbund Kinder- und Jugendsport NRW – Transferformate für den Dialog zwischen Wissenschaft und Gesellschaft}}},
  doi          = {{10.1007/978-3-658-43622-3_10}},
  volume       = {{34}},
  year         = {{2024}},
}

@article{61172,
  author       = {{Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp and Werthmann, Julian}},
  issn         = {{0304-3975}},
  journal      = {{Theoretical Computer Science}},
  publisher    = {{Elsevier BV}},
  title        = {{{Routing Schemes for Hybrid Communication Networks}}},
  doi          = {{10.1016/j.tcs.2023.114352}},
  volume       = {{985}},
  year         = {{2024}},
}

@inbook{61163,
  author       = {{Herzig, Bardo and Losch, Daniel}},
  booktitle    = {{Fragmentierung in der Lehrkräftebildung - Das Lehramtsstudium im Spannungsfeld von Professionsorientierung, Bildungstheorie und (Fach-)Wissenschaft}},
  editor       = {{Gräf, Anne and Helling, Simon and Losch, Daniel  and Polcik, Thassilo and Rojahn, Pia and Wendland, Sebastian}},
  isbn         = {{978-3-7560-1473-6}},
  pages        = {{289--316}},
  publisher    = {{Nomos Verlagsgesellschaft mbH & Co.KG}},
  title        = {{{ Informatische Literalität und Medienbildung im Handeln von Lehrkräften}}},
  volume       = {{1}},
  year         = {{2024}},
}

@inbook{61188,
  author       = {{Schulze, Johanna and Herzig, Bardo and Lehberger, Regine}},
  booktitle    = {{Lehrkräftebildung in der digitalen Welt. Zukunftsorientierte Forschungs- und Praxisperspektiven }},
  editor       = {{Herzig, Bardo and Eickelmann, Birgit and Schwabl, Franziska and Schulze, Johanna and Niemann, Jan}},
  isbn         = {{978-3-8309-4837-7}},
  issn         = {{2944-6791}},
  pages        = {{75--83}},
  publisher    = {{Waxmann}},
  title        = {{{Agile Gestaltung digitalisierungsbezogener Schulentwicklung in der Lehrkräftebildung }}},
  doi          = {{10.31244/9783830998372}},
  volume       = {{1}},
  year         = {{2024}},
}

@inproceedings{56983,
  abstract     = {{Detecting the veracity of a statement automatically is a challenge the world is grappling with due to the vast amount of data spread across the web. Verifying a given claim typically entails validating it within the framework of supporting evidence like a retrieved piece of text. Classifying the stance of the text with respect to the claim is called stance classification. Despite advancements in automated fact-checking, most systems still rely on a substantial quantity of labeled training data, which can be costly. In this work, we avoid the costly training or fine-tuning of models by reusing pre-trained large language models together with few-shot in-context learning. Since we do not train any model, our approach ExPrompt is lightweight, demands fewer resources than other stance classification methods and can serve as a modern baseline for future developments. At the same time, our evaluation shows that our approach is able to outperform former state-of-the-art stance classification approaches regarding accuracy by at least 2 percent. Our scripts and data used in this paper are available at https://github.com/dice-group/ExPrompt.}},
  author       = {{Qudus, Umair and Röder, Michael and Vollmers, Daniel and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{Proceedings of the 33rd ACM International Conference on Information and Knowledge Management}},
  isbn         = {{79-8-4007-0436-9/24/10}},
  keywords     = {{Stance Classification, Few-shot in-context learning, Pre-trained large language models}},
  location     = {{Boise, ID, USA}},
  pages        = {{3994 -- 3999}},
  publisher    = {{ACM}},
  title        = {{{ExPrompt: Augmenting Prompts Using Examples as Modern Baseline for Stance Classification}}},
  doi          = {{10.1145/3627673.3679923}},
  volume       = {{9}},
  year         = {{2024}},
}

@inproceedings{57240,
  abstract     = {{Validating assertions before adding them to a knowledge graph is an essential part of its creation and maintenance. Due to the sheer size of knowledge graphs, automatic fact-checking approaches have been developed. These approaches rely on reference knowledge to decide whether a given assertion is correct. Recent hybrid approaches achieve good results by including several knowledge sources. However, it is often impractical to provide a sheer quantity of textual knowledge or generate embedding models to leverage these hybrid approaches. We present FaVEL, an approach that uses algorithm selection and ensemble learning to amalgamate several existing fact-checking approaches that rely solely on a reference knowledge graph and, hence, use fewer resources than current hybrid approaches. For our evaluation, we create updated versions of two existing datasets and a new dataset dubbed FaVEL-DS. Our evaluation compares our approach to 15 fact-checking approaches—including the state-of-the-art approach HybridFC—on 3 datasets. Our results demonstrate that FaVEL outperforms all other approaches significantly by at least 0.04 in terms of the area under the ROC curve. Our source code, datasets, and evaluation results are open-source and can be found at https://github.com/dice-group/favel.}},
  author       = {{Qudus, Umair and Röder, Michael and Tatkeu Pekarou, Franck Lionel and Morim da Silva, Ana Alexandra and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{EKAW 2024}},
  editor       = {{Rospocher, Marco}},
  keywords     = {{fact checking, ensemble learning, transfer learning, knowledge management.}},
  location     = {{Amsterdam, Netherlands}},
  title        = {{{FaVEL: Fact Validation Ensemble Learning}}},
  year         = {{2024}},
}

@article{61197,
  author       = {{Herzig, Bardo}},
  journal      = {{Plan BD. Online-Magazin für Schule in der Kultur der Digitalität}},
  publisher    = {{https://magazin.forumbd.de/lehren-und-lernen/ki-bezogene-kompetenzen-von-lehrkraeften/}},
  title        = {{{KI-bezogene Kompetenzen von Lehrkräften }}},
  year         = {{2024}},
}

@inproceedings{58377,
  abstract     = {{The connection between inconsistent databases and Dung's abstract
argumentation framework has recently drawn growing interest. Specifically, an
inconsistent database, involving certain types of integrity constraints such as
functional and inclusion dependencies, can be viewed as an argumentation
framework in Dung's setting. Nevertheless, no prior work has explored the exact
expressive power of Dung's theory of argumentation when compared to
inconsistent databases and integrity constraints. In this paper, we close this
gap by arguing that an argumentation framework can also be viewed as an
inconsistent database. We first establish a connection between subset-repairs
for databases and extensions for AFs, considering conflict-free, naive,
admissible, and preferred semantics. Further, we define a new family of
attribute-based repairs based on the principle of maximal content preservation.
The effectiveness of these repairs is then highlighted by connecting them to
stable, semi-stable, and stage semantics. Our main contributions include
translating an argumentation framework into a database together with integrity
constraints. Moreover, this translation can be achieved in polynomial time,
which is essential in transferring complexity results between the two
formalisms.}},
  author       = {{Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}},
  title        = {{{Dung's Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases}}},
  doi          = {{10.1609/AAAI.V39I14.33651}},
  year         = {{2024}},
}

@inproceedings{61179,
  abstract     = {{We examine how users perceive the limitations of an AI system when it encounters a task that it cannot perform perfectly and whether providing explanations alongside its answers aids users in constructing an appropriate mental model of the system's capabilities and limitations. We employ a visual question answer and explanation task where we control the AI system's limitations by manipulating the visual inputs: during inference, the system either processes full-color or grayscale images. Our goal is to determine whether participants can perceive the limitations of the system. We hypothesize that explanations will make limited AI capabilities more transparent to users. However, our results show that explanations do not have this effect. Instead of allowing users to more accurately assess the limitations of the AI system, explanations generally increase users' perceptions of the system's competence – regardless of its actual performance.}},
  author       = {{Sieker, Judith and Junker, Simeon and Utescher, Ronja and Attari, Nazia and Wersing, Heiko and Buschmeier, Hendrik and Zarrieß, Sina}},
  booktitle    = {{Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing}},
  location     = {{Miami, FL, USA}},
  pages        = {{19459–19475}},
  publisher    = {{ACL}},
  title        = {{{The illusion of competence: Evaluating the effect of explanations on users’ mental models of visual question answering systems}}},
  doi          = {{10.18653/v1/2024.emnlp-main.1084}},
  year         = {{2024}},
}

@inbook{57238,
  abstract     = {{<jats:p>Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extensions) of arguments that allow AFs to be evaluated. For more expressiveness, AFs are augmented with acceptance conditions on directly interacting arguments or a constraint on the admissible sets of arguments, resulting in dialectic frameworks or constrained argumentation frameworks. In this paper, we consider flexible conditions for rejecting an argument from an extension, which we call rejection conditions (RCs). On the technical level, we associate each argument with a specific logic program. We analyze the resulting complexity, including the structural parameter treewidth. Rejection AFs are highly expressive, giving rise to natural problems on higher levels of the polynomial hierarchy.</jats:p>}},
  author       = {{Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}},
  booktitle    = {{Frontiers in Artificial Intelligence and Applications}},
  isbn         = {{9781643685489}},
  issn         = {{0922-6389}},
  location     = {{Santiago de Compostela, Spain}},
  publisher    = {{IOS Press}},
  title        = {{{Rejection in Abstract Argumentation: Harder Than Acceptance?}}},
  doi          = {{10.3233/faia240867}},
  year         = {{2024}},
}

