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

Einladung Informatik Oberseminar Lubna Ali
by Bombelka, Angelika 08 Jul '25

08 Jul '25

+********************************************************************** * * * Einladung * * * * Informatik-Oberseminar * * * +********************************************************************** Zeit: Dienstag, 30. Januar 2024, 14.00 Uhr Ort: 9222, E3, Ahornstr. 55 und hybrid via Zoom (https://rwth.zoom-x.de/j/64937773189?pwd=eGttNUMzSElnQUVkc3FrYzBqK2F4UT09) Referent: Lubna Ali M.Sc. RWTH Lehr- und Forschungsgebiet Informatik 9 (Lerntechnologien) Thema: convOERter: A Technical Assistance Tool to Support Semi-Automatic Conversion of Images in Educational Materials as OER Abstract: Open Educational Resources (OER) are seen as an important element in the process of digitizing higher education teaching and as essential building blocks for openness in education. They can be defined as teaching, learning, and research materials that have been made openly available, shareable, and modifiable. OER include different types of resources such as full courses, textbooks, videos, presentations, tests, and images, which are usually published under the open Creative Commons licences. OER can play an important role in improving education by facilitating access to high quality digital educational materials. Accordingly, there is a steady increase among higher education institutions to participate in the so-called "open movement" in general and in utilizing OER in particular. Nevertheless, there are many challenges that still face the deployment of OER in the educational context. One of the main challenges is the production of new OER materials and converting already existing materials into OER, which could be viable by qualifying educators through training courses and/or supporting them with specific tools. There are many platforms and tools that support the creation of new OER content. However, to our knowledge, there are no tools that perform fully- or semi-automatic conversion of already existing educational materials. This identified gap was the basis for the design and implementation of the OER conversion tool (convOERter). The tool supports the user by semi-automatically converting educational materials containing images into OER-compliant materials. The main functionality of the tool is based on reading a file, extracting all images as well as all possible metadata, and substituting the extracted images with OER elements in a semi-automated way. The retrieved OER images are referenced and licenced properly according to the known TASLL rule. Finally, the entire file is automatically licenced under Creative Commons excluding specific elements from the entire licence such as logos. In order to evaluate the effectiveness of the tool in promoting the use of OER, a comprehensive user study was conducted with educators and OER enthusiastic at different universities. The study was accomplished by offering a series of OER evaluation workshops to compare the conversion efficiency of the tool with manual conversion. The results show that using the conversion tool improves the conversion process in terms of speed, license quality, and total efficiency. These results highlight that the tool can be a valuable addition to the community, especially for users less experienced with OER. As a future work, it is intended to further develop the tool and improve its functionality. Additionally, a long-term study can be conducted to assess the impact of the tool in facilitating and enhancing the production of OER on a larger scale. Es laden ein: die Dozentinnen und Dozenten der Informatik

3 5

Survey Lecture - Highlights of UnRAVeL
by Kassing, Jan-Christoph 22 May '25

22 May '25

Dear all, This is a quick reminder on the next UnRAVeL survey lecture talk Today 12:30 to 14:00, Computer Science Center, Building E2, ground floor, B-IT room 5053.2, given by Britta Peis about "On Train Routing and Length-bounded Disjoint Paths“! -------------------- Titel: On Train Routing and Length-bounded Disjoint Paths Abstract: In train routing, the headway is the minimum distance that must be maintained between successive trains for safety and robustness. We introduce a model for train routing that requires a fixed headway to be maintained between trains, and study the problem of minimizing the makespan, i.e., the arrival time of the last train, in a single-source single-sink network. For this problem, we first show that there exists an optimal solution where trains move in convoys---that is, the optimal paths for any two trains are either the same or are arc-disjoint. Via this insight, we are able to reduce the approximability of our train routing problem to that of the min-max disjoint paths problem, which asks for a collection of disjoint paths where the maximum length of any path in the collection is as small as possible. While min-max disjoint paths inherits a strong inapproximability result on directed acyclic graphs from the multi-level bottleneck assignment problem, we show that a natural greedy composition approach yields a logarithmic approximation in the number of disjoint paths for series-parallel graphs. We also present an alternative analysis of this approach that yields a guarantee depending on how often the decomposition tree of the series-parallel graph alternates between series and parallel compositions on any root-leaf path. (Joint work with Umang Bhaskar, Katharina Eickhoff, Lennart Kauther, Jannik Matuschke, and Laura Vargas Koch) -------------------- 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: 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 15 May '25

15 May '25

Dear all, We invite you to the next UnRAVeL survey lecture talk Today 12:30 to 14:00, Computer Science Center, Building E2, ground floor, B-IT room 5053.2, given by Joost-Pieter Katoen about "Verification Conquers Fault Tree Analysis: From Theory to Start-Up“! -------------------- Titel: Verification Conquers Fault Tree Analysis: From Theory to Start-Up Abstract: Fault trees are a key element in reliability engineering. The notion of static fault trees goes back to the 1950s. Various extensions have been developed since then such as dynamic fault trees by Joanne Dugan. We will present their formal semantics and will provide some techniques to generate succinct (and partial) state spaces. We will then present the elementary model-checking techniques for the reliability analysis of dynamic fault trees, provide some case studies (a.o. from railway engineering conducted within UnRAVeL) that illustrate the feasibility of the approach. We finally report on how the developed (partially UnRAVeL) techniques have culminated in a state-of-the-art reliability analysis tool that is currently maintained and further developed by a spin-off company. -------------------- 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: 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 08 May '25

08 May '25

Dear all, We invite you to the next UnRAVeL survey lecture talk Today 12:30 to 14:00, Computer Science Center, Building E2, ground floor, B-IT room 5053.2, given by Nils Nießen about "Uncertainty in Railways“! -------------------- Titel: Uncertainty in Railways Abstract: Uncertainties and randomness play a major role on the railway and contribute to the operational performance. We provide an overview of where uncertainties occur in the railway system and how they can be modelled. Subsequently, we present methods and algorithms that were developed within the framework of UnRAVeL. Finally, we explain why the railways are still delayed. -------------------- 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: 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