@article{61139, author = {{Pfeffer, Nina and Kaiser, Maximilian Alexander and Feix, Werner and Kälble, Nils and Merten, Mathias and Stark, Andreas and Haufe, Andre and Meyer, Thomas and Tröster, Thomas and Höppel, Heinz Werner}}, issn = {{0921-5093}}, journal = {{Materials Science and Engineering: A}}, publisher = {{Elsevier BV}}, title = {{{Energy- and material-efficient Ti-6Al-4V sheet part fabrication by the novel TISTRAQ-process, including resistance heating and tool-based quenching: Insights into test stand design and material potential}}}, doi = {{10.1016/j.msea.2025.149015}}, volume = {{945}}, year = {{2025}}, } @article{61140, author = {{Nicolai, Marcel and Bulling, Jannis and Narayanan, M.M. and Zeipert, Henning and Prager, Jens and Henning, Bernd}}, issn = {{0041-624X}}, journal = {{Ultrasonics}}, publisher = {{Elsevier BV}}, title = {{{Dynamic interface behavior in coupled plates: Investigating Lamb wave mode repulsion with a spring-based model}}}, doi = {{10.1016/j.ultras.2025.107799}}, volume = {{158}}, year = {{2025}}, } @inproceedings{61144, author = {{Kablo, Emiram and Kleber, Melina and Arias Cabarcos, Patricia}}, booktitle = {{34th USENIX Security Symposium (USENIX Security 25)}}, pages = {{1531–1548}}, title = {{{PrivaCI in VR: Exploring Perceptions and Acceptability of Data Sharing in Virtual Reality Through Contextual Integrity}}}, year = {{2025}}, } @unpublished{61152, abstract = {{While neural network quantization effectively reduces the cost of matrix multiplications, aggressive quantization can expose non-matrix-multiply operations as significant performance and resource bottlenecks on embedded systems. Addressing such bottlenecks requires a comprehensive approach to tailoring the precision across operations in the inference computation. To this end, we introduce scaled-integer range analysis (SIRA), a static analysis technique employing interval arithmetic to determine the range, scale, and bias for tensors in quantized neural networks. We show how this information can be exploited to reduce the resource footprint of FPGA dataflow neural network accelerators via tailored bitwidth adaptation for accumulators and downstream operations, aggregation of scales and biases, and conversion of consecutive elementwise operations to thresholding operations. We integrate SIRA-driven optimizations into the open-source FINN framework, then evaluate their effectiveness across a range of quantized neural network workloads and compare implementation alternatives for non-matrix-multiply operations. We demonstrate an average reduction of 17% for LUTs, 66% for DSPs, and 22% for accumulator bitwidths with SIRA optimizations, providing detailed benchmark analysis and analytical models to guide the implementation style for non-matrix layers. Finally, we open-source SIRA to facilitate community exploration of its benefits across various applications and hardware platforms.}}, author = {{Umuroglu, Yaman and Berganski, Christoph and Jentzsch, Felix and Danilowicz, Michal and Kryjak, Tomasz and Bezaitis, Charalampos and Sjalander, Magnus and Colbert, Ian and Preusser, Thomas and Petri-Koenig, Jakoba and Blott, Michaela}}, title = {{{SIRA: Scaled-Integer Range Analysis for Optimizing FPGA Dataflow Neural Network Accelerators}}}, year = {{2025}}, } @unpublished{61119, abstract = {{

The present article offers an assessment of intra-individual variability in visualattention using the Theory of Visual Attention, which provides a formal framework forquantifying attentional components. We specifically investigated overall attentionalcapacity – that is, the available processing speed – and its distribution, the relativeattentional weight.By reanalyzing a large existing dataset from Tünnermann and Scharlau (2021),we found that across multiple testing days, participants either remained stable within a20 Hz margin or showed consistent improvements in capacity – in some cases triplingtheir initial capacity. The weights in response to salient stimuli were remarkablyconsistent.To determine whether increases in capacity reflect pure test-retest effects or arefacilitated by consolidation between days, and to quantify within-day variability, weconducted a second study in which participants completed five self-administeredsessions within a single day. Capacities remained within the same magnitude and didnot show a consistent directional trend. The relative weights exhibited comparativelylittle variation in most participants, akin to the previously analyzed dataset. Further,estimation uncertainty increased with higher capacity values.These results suggest that capacity may be subject to training effects, but thatsuch improvements appear to depend on longer breaks between sessions. This hasimportant implications for individualized assessment: A personal prior could beestimated from a single session to accelerate future estimations, as long as subsequentsessions occur on the same day. Participants with higher capacities may require tailoredexperimentation methods when small to medium effects are of interest, due to increaseduncertainty.

}}, author = {{Banh, Ngoc Chi and Scharlau, Ingrid}}, publisher = {{Center for Open Science}}, title = {{{Intra-individual variability in TVA attentional capacity and weight distribution: A reanalysis across days and an experiment within-day}}}, year = {{2025}}, } @misc{61157, author = {{Schroeter-Wittke, Harald}}, booktitle = {{Jahrbuch für Evangelische Kirchengeschichte des Rheinlandes}}, pages = {{232--237}}, title = {{{Bernd Schröder: Religionspädagogische Ökumenik. Weltweites polyzentrisch-plurales Christentum als Bildungsreligion, Tübingen 2025}}}, volume = {{74}}, year = {{2025}}, } @article{61158, author = {{Schroeter-Wittke, Harald}}, journal = {{Pastoraltheologie}}, number = {{9}}, pages = {{432--443}}, title = {{{"Seine besondere Chance ist, dass er sterben kann." (Helmut Simon) Verausgabung, Popkulur und Erneuerung als grundlegende Dimensionen des Kirchentags}}}, volume = {{114}}, year = {{2025}}, } @article{59226, author = {{Herzig, Bardo}}, issn = {{0937-7239}}, journal = {{SchulVerwaltung NRW}}, number = {{1/25}}, pages = {{18--20}}, publisher = {{Carl Link}}, title = {{{Künstliche Intelligenz und professionsbezogene Aufgaben von Lehrkräften}}}, year = {{2025}}, } @article{60949, author = {{Giese, Henning and Holtmann, Svea and Koch, Reinald and Langenmayr, Dominika}}, journal = {{ifo Schnelldienst}}, number = {{8}}, pages = {{34--40}}, title = {{{Steuerliches Investitionssofortprogramm: Ausreichender Schritt zur Stärkung des Wirtschaftsstandorts Deutschland?}}}, volume = {{78}}, year = {{2025}}, } @article{61123, abstract = {{Knowledge graphs are used by a growing number of applications to represent structured data. Hence, evaluating the veracity of assertions in knowledge graphs—dubbed fact checking—is currently a challenge of growing importance. However, manual fact checking is commonly impractical due to the sheer size of knowledge graphs. This paper is a systematic survey of recent works on automatic fact checking with a focus on knowledge graphs. We present recent fact-checking approaches, the varied sources they use as background knowledge, and the features they rely upon. Finally, we draw conclusions pertaining to possible future research directions in fact checking knowledge graphs.}}, author = {{Qudus, Umair and Röder, Michael and Saleem, Muhammad and Ngonga Ngomo, Axel-Cyrille}}, issn = {{0360-0300}}, journal = {{ACM Computing Surveys}}, keywords = {{fact checking, knowledge graphs, fact-checkers, check worthiness, evidence retrieval, trust, veracity.}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{{Fact Checking Knowledge Graphs -- A Survey}}}, doi = {{10.1145/3749838}}, volume = {{58}}, year = {{2025}}, } @article{59912, abstract = {{Abstract We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced logic first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics with the most studied logics in probabilistic team semantics setting, as well as relating their expressivity to a numerical variant of second-order logic. In addition, we introduce novel entropy atoms and show that the extension of first-order logic by entropy atoms subsumes probabilistic independence logic. Finally, we obtain some results on the complexity of model checking, validity and satisfiability of our logics.}}, author = {{Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni}}, issn = {{0955-792X}}, journal = {{Journal of Logic and Computation}}, number = {{3}}, publisher = {{Oxford University Press (OUP)}}, title = {{{Logics with probabilistic team semantics and the Boolean negation}}}, doi = {{10.1093/logcom/exaf021}}, volume = {{35}}, year = {{2025}}, } @inproceedings{59054, author = {{Firmansyah, Asep Fajar and Zahera, Hamada Mohamed Abdelsamee and Sherif, Mohamed and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}}, booktitle = {{ESWC2025}}, isbn = {{978-3-031-94575-5}}, keywords = {{firmansyah mousallem ngonga sherif zahera}}, pages = {{133----151}}, publisher = {{pringer Nature Switzerland}}, title = {{{ANTS: Abstractive Entity Summarization in Knowledge Graphs}}}, doi = {{10.1007/978-3-031-94575-5_8}}, year = {{2025}}, } @unpublished{61066, abstract = {{Argumentation is a central subarea of Artificial Intelligence (AI) for modeling and reasoning about arguments. The semantics of abstract argumentation frameworks (AFs) is given by sets of arguments (extensions) and conditions on the relationship between them, such as stable or admissible. Today's solvers implement tasks such as finding extensions, deciding credulous or skeptical acceptance, counting, or enumerating extensions. While these tasks are well charted, the area between decision, counting/enumeration and fine-grained reasoning requires expensive reasoning so far. We introduce a novel concept (facets) for reasoning between decision and enumeration. Facets are arguments that belong to some extensions (credulous) but not to all extensions (skeptical). They are most natural when a user aims to navigate, filter, or comprehend the significance of specific arguments, according to their needs. We study the complexity and show that tasks involving facets are much easier than counting extensions. Finally, we provide an implementation, and conduct experiments to demonstrate feasibility.}}, author = {{Fichte, Johannes and Fröhlich, Nicolas and Hecher, Markus and Lagerkvist, Victor and Mahmood, Yasir and Meier, Arne and Persson, Jonathan}}, booktitle = {{arXiv:2505.10982}}, title = {{{Facets in Argumentation: A Formal Approach to Argument Significance}}}, year = {{2025}}, } @article{61198, author = {{Rogge, Tim and Herzig, Bardo}}, journal = {{education sciences}}, number = {{15}}, publisher = {{MDPI}}, title = {{{Enhancing Pre-Service Teachers' Reflective Competence Through Structured Video Annotation}}}, year = {{2025}}, } @inproceedings{61202, abstract = {{The number of datasets on the web of data increases continuously. However, the knowledge contained therein cannot be fully utilized without finding links between the entities contained in these datasets. Equivalent entities can not be identified solely by checking the equivalence of IRIs because of the different origins and naming schemes of different data providers. Yet, such equivalences can be discovered by computing the similarity of their attributes. In this paper we propose GLIDE, an approach that links entities from two different datasets by embedding a joint model of these datasets enriched by additional relations describing the similarity of literals. The joint model is embedded into a latent vector space while paying attention to juxtaposing similar literals. We evaluate our approach against state-of-the-art algorithms using real-world datasets commonly used in link discovery literature. The results show that GLIDE outperforms all baselines on 5 of 7 datasets with perfect or near-perfect accuracy. Our approach achieves its best performance on datasets that feature several literals with similarities. Our experiments indicate that researchers should not only pay attention to equal literals in knowledge graph embedding but should also be aware of the distance between similar literals.}}, author = {{Becker, Alexander and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed }}, booktitle = {{The Semantic Web – ISWC 2025}}, keywords = {{becker sherif enexa sailproject dice simba ngonga whale}}, title = {{{GLIDE: Knowledge Graph Linking using Distance-Aware Embeddings}}}, year = {{2025}}, } @article{61134, author = {{Manzoor, Ali and Speck, René and Zahera, Hamada Mohamed Abdelsamee and Saleem, Muhammad and Moussallem, Diego and Ngonga Ngomo, Axel-Cyrille}}, issn = {{2169-3536}}, journal = {{IEEE Access}}, pages = {{1--1}}, publisher = {{Institute of Electrical and Electronics Engineers (IEEE)}}, title = {{{Multilingual Relation Extraction - A Survey}}}, doi = {{10.1109/access.2025.3604258}}, year = {{2025}}, } @inbook{61222, author = {{Lenke, Michael and Klowait, Nils and Biere, Lea and Schulte, Carsten}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783032012210}}, issn = {{0302-9743}}, publisher = {{Springer Nature Switzerland}}, title = {{{Assessing AI Literacy: A Systematic Review of Questionnaires with Emphasis on Affective, Behavioral, Cognitive, and Ethical Aspects}}}, doi = {{10.1007/978-3-032-01222-7_8}}, year = {{2025}}, } @article{61223, abstract = {{Contemporary debates about artificial intelligence (AI) still treat automation as a straightforward substitution of human labor by machines. Drawing on Goffman’s dramaturgical sociology, this paper reframes AI in the workplace as supplementary rather than substitutive automation. We argue that the central—but routinely overlooked—terrain of struggle is symbolic-interactional: workers continuously stage, conceal, and re-negotiate what counts as “real” work and professional competence. Large language models (LLMs) such as ChatGPT exemplify this dynamic. They quietly take over the invisible, routinised tasks that underpin cognitive occupations (editing, summarizing, first-draft production) while leaving humans to enact the highly visible or relational facets that sustain occupational prestige. Drawing on diverse sources to illustrate our theoretical argument, we show how individual workers, dramaturgical teams, and entire professional fields manage impressions of expertise in order to counter status threats, renegotiate fees, or obscure the extent of AI assistance. The paper itself, having been intentionally written with the ‘aid’ of all presently available frontier AI models, serves as a meta-reflexive performance of professional self-staging. The dramaturgical framework clarifies why utopian tales of friction-free augmentation and dystopian narratives of total displacement both misread how automation is actually unfolding. By foregrounding visibility, obfuscation, and impression management, the article presents a differentiated case for AI’s impact on the performative structure of work, outlines diagnostic tools for assessing real-world AI exposure beyond hype-driven headlines, and argues for a more human-centered basis for evaluating policy responses to the ‘fourth industrial revolution.’ In short, AI enters the labor process not as an autonomous actor, but as a prop within an ongoing social performance—one whose scripts, stages, and audiences remain irreducibly human.}}, author = {{Klowait, Nils and Erofeeva, Maria}}, issn = {{2297-7775}}, journal = {{Frontiers in Sociology}}, publisher = {{Frontiers Media SA}}, title = {{{The presentation of self in the age of ChatGPT}}}, doi = {{10.3389/fsoc.2025.1614473}}, volume = {{10}}, year = {{2025}}, } @inbook{61226, author = {{Erofeeva, Maria and Klowait, Nils and Belov, Mikael and Soulié, Yoann}}, booktitle = {{Communications in Computer and Information Science}}, isbn = {{9783031980794}}, issn = {{1865-0929}}, publisher = {{Springer Nature Switzerland}}, title = {{{Leveraging VR Tools for Inclusive Education: Implications from Sign Language Learning in VRChat}}}, doi = {{10.1007/978-3-031-98080-0_10}}, year = {{2025}}, } @article{61241, abstract = {{Abstract Given the presence of fake news and pseudoscience (often disguised as physics), the importance of inoculating citizens against this type of misinformation has gained increasing attention in education. This is a goal that all subjects should pursue equally from their respective disciplinary perspectives. 
The paper presents a teaching approach to protect physics students from misinformation and pseudoscience by combining these three common strategies: First, understanding the fundamental principles of the Nature of Science. Second, identifying techniques of Science Denial. And third, applying heuristics for evaluating (supposedly) scientific information. Finally, the paper offers practical suggestions for applying these strategies in a master's-level physics course, using examples from the field of physics.}}, author = {{Webersen, Yvonne and Riese, Josef}}, issn = {{0143-0807}}, journal = {{European Journal of Physics}}, publisher = {{IOP Publishing}}, title = {{{Protecting physics students from pseudoscience - combining strategies for a comprehensive teaching approach}}}, doi = {{10.1088/1361-6404/ae03f6}}, year = {{2025}}, }