April 2025 - informatik-vortraege - lists.rwth-aachen.de

Einladung Informatik-Oberseminar
by Martin Bellgardt 29 Apr '25

29 Apr '25

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Mittwoch, 30. April, 13.00 Uhr Ort: Seminarraum 003, Kopernikusstraße 6 Referent: Martin Bellgardt M.Sc. Lehr- und Forschungsgebiet Informatik 12 Thema: Increasing Immersion in Machine Learning Pipelines for Mechanical Engineering Abstract: Machine learning has become a vital tool in the toolbox of any discipline that regularly interacts with data. This holds especially true for mechanical engineering, where the demand for data driven approaches to engineering challenges has recently increased drastically. While promising results have already been achieved by applying machine learning models in this field, the opaqueness of modern machine learning models, such as artificial neural networks, brings its own challenges. A lack of trust in these models often prevents their application and a lack of intuition for their inner workings prevents them from facilitating scientific discoveries about manufacturing processes. This thesis aims to approach these challenges from the unique angle of increasing the amount of immersion used when interacting with models and data throughout the whole machine learning pipeline. Immersion in virtual environments has the ability to facilitate a phenomenon called presence, which can make users perceive the presented stimuli as more real and engage with them much more directly. However, research regarding the effect of immersion on abstract data visualization is lacking. It is argued that a similar phenomenon, in this thesis called data presence, can be achieved with proper immersive visualization tools. Hence, multiple demonstrators were developed that showcase the possibility to facilitate better understanding of data, models, and the underlying processes using increased degrees of immersion. First, general considerations are presented on developing immersive applications for use in everyday work. Then, multiple immersive applications are presented for data labeling, data understanding and model visualization. Each of these applications is evaluated, showing indications that they can indeed lead to benefits for their users. Es laden ein: die Dozentinnen und Dozenten der Informatik

1 0

Survey Lecture - Highlights of UnRAVeL
by Kassing, Jan-Christoph 23 Apr '25

23 Apr '25

Dear all, We invite you to the next UnRAVeL survey lecture talk on Thursdays 12:30 to 14:00, Computer Science Center, Building E2, ground floor, B-IT room 5053.2, given by Jürgen Giesl about "Termination and Complexity Analysis: From Classical to Probabilistic Programs“! -------------------- Titel: Termination and Complexity Analysis: From Classical to Probabilistic Programs Abstract: We give an overview on our results obtained within UnRAVeL. Before the start of the research training group, we had already developed several techniques for automated termination and complexity analysis for different kinds of "classical" programs. We show how these approaches were extended to probabilistic programs due to our research within UnRAVeL. -------------------- Part of the programme of the research training group UnRAVeL is a series of lectures on the topics of UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is given by one of the researchers involved in UnRAVeL. This years topic is "Highlights of UnRAVeL!". As UnRAVeL nears its conclusion, we take this opportunity to reflect on seven years of excellent research. Through nine talks, we invite you to experience the scientific highlights of our RTG, along with its numerous successes, developments, and collaborations. All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2025 and engage in discussions with researchers and doctoral students. The overall remaining schedule is as following: 24.04.2025 - Jürgen Giesl - Termination and Complexity Analysis: From Classical to Probabilistic Programs 08.05.2025 - Nils Nießen - Uncertainty in Railways 15.05.2025 - Joost-Pieter Katoen - Verification Conquers Fault Tree Analysis: From Theory to Start-Up 22.05.2025 - Britta Peis - On Train Routing and Length-bounded Disjoint Paths 26.06.2025 - Michael Schaub - Oversmoothing in Graph Neural Networks 03.07.2025 - Sebastian Trimpe - Uncertainty in Learning and Control 10.07.2025 - Christopher Morris - Exploring the Power of Graph Neural Networks in Solving Optimization Problems 17.07.2025 - Christina Büsing - Dealing with Uncertainty Inspired by Health Care – a Robust Optimization Approach Kind regards, Jan-Christoph for the organisation committee

1 0

Survey Lecture - Highlights of UnRAVeL
by Kassing, Jan-Christoph 16 Apr '25

16 Apr '25

Dear all, part of the programme of the research training group UnRAVeL is a series of lectures on the topics of UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is given by one of the researchers involved in UnRAVeL. This years topic is "Highlights of UnRAVeL!". As UnRAVeL nears its conclusion, we take this opportunity to reflect on seven years of excellent research. Through nine talks, we invite you to experience the scientific highlights of our RTG, along with its numerous successes, developments, and collaborations. All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2025 and engage in discussions with researchers and doctoral students. All events take place on Thursdays 12:30 to 14:00, Computer Science Center, Building E2, ground floor, B-IT room 5053.2. The first lecture (tomorrow) is given by Erika Ábrahám about "SMT: Something You Must Try“! -------------------- SMT (Satisfiability Modulo Theories) solving is a technology for the fully automated solution of logical formulas. SMT solvers are general-purpose off-the-shelf solvers, which can be integrated in diverse systems. Due to their impressive efficiency, SMT solvers are nowadays frequently used in a wide variety of applications, including the analysis of probabilistic systems. A typical application encodes real-world problems as logical formulas, whose solutions can be decoded to solutions of the real-world problem. In this talk we give some insights into the mechanisms of SMT solving, discuss some applications in the context of probabilistic systems, and review our own research activities in this area. -------------------- The overall schedule is as following: 17.04.2025 - Erika Ábrahám - SMT: Something You Must Try 24.04.2025 - Jürgen Giesl - Termination and Complexity Analysis: From Classical to Probabilistic Programs 08.05.2025 - Nils Nießen - Uncertainty in Railways 15.05.2025 - Joost-Pieter Katoen - Verification Conquers Fault Tree Analysis: From Theory to Start-Up 22.05.2025 - Britta Peis - On Train Routing and Length-bounded Disjoint Paths 26.06.2025 - Michael Schaub - Oversmoothing in Graph Neural Networks 03.07.2025 - Sebastian Trimpe - Uncertainty in Learning and Control 10.07.2025 - Christopher Morris - Exploring the Power of Graph Neural Networks in Solving Optimization Problems 17.07.2025 - Christina Büsing - Dealing with Uncertainty Inspired by Health Care – a Robust Optimization Approach Kind regards, Jan-Christoph for the organisation committee

1 0

Einladung: Informatik-Oberseminar Lovro Mrkonjić
by Lovro Mrkonjić 03 Apr '25

03 Apr '25

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Montag, 14. April 2025, 15:00 Uhr Ort: Raum 9222 (Informatikzentrum E3, Ahornstraße 55) Referent: Lovro Mrkonjić, M.Sc. LuFG Mathematische Grundlagen der Informatik Thema: Semiring Semantics: Algebraic Foundations, Model Theory, and Strategy Analysis Abstract: Classically, a logical formula is either true or false in a given structure. In the semiring framework, which was originally developed by Green, Karvounarakis and Tannen for databases in 2007, Boolean truth values are replaced with values from an arbitrary commutative semiring, which may carry additional information. For example, evaluating a formula under semiring semantics in a suitable semiring may not only tell us if the formula is true, but also which of the facts in the input structure contribute to the truth of the formula. Classical models are replaced with semiring interpretations, which assign a semiring element to each literal of a model. This prompts the introduction of model theory to the semiring setting. In this talk, we address the following questions from semiring model theory: How does elementary equivalence behave in the semiring setting? Does the compactness theorem still hold under semiring semantics? It turns out that the answers heavily depend on the algebraic properties of the semiring in question. For example, while it is well-known that first-order logic can axiomatize finite structures up to isomorphism in classical semantics, we find that this is not the case under semiring semantics: Over fully idempotent semirings with at least three elements, there are finite interpretations which are elementarily equivalent, but not isomorphic. We also find that some classical results survive in the semiring setting, for example, the compactness theorem holds on most finite, absorptive semirings. The final part of this talk is dedicated to the semiring framework for games, which was introduced by Grädel and Tannen (2020). We present an extension of the semiring framework to imperfect information games and discuss some computational challenges in this setting. Es laden ein: die Dozentinnen und Dozenten der Informatik

1 0