Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 15/04/2021 Survey Lecture: Erika Ábrahám: Probabilistic Hyperproperties * 22/04/2021 Jürgen Giesl: Inferring Expected Runtimes of Probabilistic Programs * 29/04/2021 Erich Grädel: Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence * 06/05/2021 Christof Löding: Learning Automata for Infinite Words * 20/05/2021 Martin Grohe: The Logic of Graph Neural Networks * 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Ringvorlesung: Gerhard Woeginger: Bilevel optimization * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Zeige Antworten nach Diskussionsstrang
Dear all,
this is a reminder for the first UnRAVeL survey lecture that takes place this *Thursday, April 15 at 4:30pm*.*Erika Ábrahám *will speak about *Probabilistic Hyperproperties*.
Four decades ago, Lamport used the notion of trace properties as a means to specify the correctness of individual executions of concurrent programs. This notion was later formalized and classified by Alpern and Schneider to safety and liveness properties. Temporal logics like LTL and CTL were built based on these efforts to give formal syntax and semantics to requirements of trace properties. Subsequently, verification algorithms were developed to reason about individual executions of a system.
However, it turns out that many interesting requirements are not trace properties. For example, important information-flow security policies (e.g. noninterference, observational determinism) or service level agreements (e.g. mean response time, percentage uptime) cannot be expressed as properties of individual execution traces of a system. Rather, they are properties of sets of execution traces, also known as hyperproperties. Temporal logics such as HyperLTL and HyperCTL∗ have been proposed to provide a unifying framework to express and reason about hyperproperties.
This talk is devoted to special class of hyperproperties: we ask the question what are hyperproperties in the context of systems with random behavior. We will discuss what are relevant probabilistic relations between independent executions of a system, how we can formally express them in a temporal logic, and how we can decide the truth of such statements.
Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxibh?lidx=1#aaaaaaaaaamxifr and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate it if you could pass the invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 15/04/2021 Erika Ábrahám: Probabilistic Hyperproperties * 22/04/2021 Jürgen Giesl: Inferring Expected Runtimes of Probabilistic Programs * 29/04/2021 Erich Grädel: Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence * 06/05/2021 Christof Löding: Learning Automata for Infinite Words * 20/05/2021 Martin Grohe: The Logic of Graph Neural Networks * 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Ringvorlesung: Gerhard Woeginger: Bilevel optimization * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, April 22 at 4:30pm*.*Erich Grädel *will talk about *Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence*. Following the talk, a PhD student will give an informal summary of their doctoral studies within UnRAVeL.
Hidden-variable models have been proposed since the 1920s as an alternative to the dominant interpretation of quantum mechanics, with the goal to explain and remove certain counterintuitive aspects of quantum mechanics.
We show that logics of dependence and independence, based on team semantics, provide adequate frameworks for reasoning about hidden-variable models and their purely probabilistic or relational abstractions.
Common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae.
Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria.
We also discuss the famous "no-go“ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.
Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxjbw?lidx=1#aaaaaaaaaamxjik and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate it if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 15/04/2021 Erika Ábrahám: Probabilistic Hyperproperties * 22/04/2021 Jürgen Giesl: Inferring Expected Runtimes of Probabilistic Programs * 29/04/2021 Erich Grädel: Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence * 06/05/2021 Christof Löding: Learning Automata for Infinite Words * 20/05/2021 Martin Grohe: The Logic of Graph Neural Networks * 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Ringvorlesung: Gerhard Woeginger: Bilevel optimization * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
in contrary to the email that I have just sent you, the next UnRAVeL survey lecture taking place next *Thursday, April 22 at 4:30pm *will be delivered by *Jürgen Giesl* (and not by Erich Grädel). He will talk about *Inferring Expected Runtimes of Probabilistic Programs*. Please find the abstract below:
We present a novel modular approach to infer upper bounds on the expected runtimes of probabilistic integer programs automatically. To this end, it computes bounds on the runtimes of program parts and on the sizes of their variables in an alternating way. To evaluate its power, we implemented our approach in a new version of our tool KoAT.
In the talk, we will also illustrate the history how we developed this approach, mention the problems that occurred during the research, and show the solutions that we found.
The talk of Erich Grädel is scheduled for April 29. I apologize for the confusion.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: Reminder April 22: UnRAVeL "Behind the Scenes" Survey Lecture Date: Tue, 20 Apr 2021 08:07:48 +0200 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, April 22 at 4:30pm*.*Erich Grädel *will talk about *Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence*. Following the talk, a PhD student will give an informal summary of their doctoral studies within UnRAVeL.
Hidden-variable models have been proposed since the 1920s as an alternative to the dominant interpretation of quantum mechanics, with the goal to explain and remove certain counterintuitive aspects of quantum mechanics.
We show that logics of dependence and independence, based on team semantics, provide adequate frameworks for reasoning about hidden-variable models and their purely probabilistic or relational abstractions.
Common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae.
Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria.
We also discuss the famous "no-go“ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.
Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxjbw?lidx=1#aaaaaaaaaamxjik and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate it if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 15/04/2021 Erika Ábrahám: Probabilistic Hyperproperties * 22/04/2021 Jürgen Giesl: Inferring Expected Runtimes of Probabilistic Programs * 29/04/2021 Erich Grädel: Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence * 06/05/2021 Christof Löding: Learning Automata for Infinite Words * 20/05/2021 Martin Grohe: The Logic of Graph Neural Networks * 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Ringvorlesung: Gerhard Woeginger: Bilevel optimization * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, April 29 at 4:30pm*.*Erich Grädel *will talk about *Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence*. Following the talk, UnRAVeL PhD student *Richard Wilke* will give an informal summary of their doctoral studies within UnRAVeL.
Hidden-variable models have been proposed since the 1920s as an alternative to the dominant interpretation of quantum mechanics, with the goal to explain and remove certain counterintuitive aspects of quantum mechanics.
We show that logics of dependence and independence, based on team semantics, provide adequate frameworks for reasoning about hidden-variable models and their purely probabilistic or relational abstractions.
Common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae.
Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria.
We also discuss the famous "no-go“ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.
Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxjbw?lidx=1#aaaaaaaaaamxjik and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate it if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 15/04/2021 Erika Ábrahám: Probabilistic Hyperproperties * 22/04/2021 Jürgen Giesl: Inferring Expected Runtimes of Probabilistic Programs * 29/04/2021 Erich Grädel: Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence * 06/05/2021 Christof Löding: Learning Automata for Infinite Words * 20/05/2021 Martin Grohe: The Logic of Graph Neural Networks * 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Ringvorlesung: Gerhard Woeginger: Bilevel optimization * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, May 6 at 4:30pm*.*Christof Löding *will talk about *Learning Automata for Infinite Words*. Following the talk, UnRAVeL PhD student *Peter Lindner* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* Learning techniques for deterministic finite automata (DFA) have been developed starting from the 1970ies. The two main settings are the construction of DFA from examples (finite sets of words that should be accepted or rejected by the DFA), and from queries to an oracle. These problems are already well understood for DFA, and various learning algorithms for these two settings exist.
Deterministic automata on infinite words define languages of infinite words, and are syntactically very similar to DFA. However, certain key properties of DFA that are used in learning algorithms do not hold for automata on infinite words. Therefore, only few results for learning automata over infinite words have been obtained up to now.
In this talk, I will illustrate these differences and report on ongoing joint work with Leon Bohn on algorithms for the construction of deterministic automata on infinite words from examples.
Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxjjj?lidx=1#aaaaaaaaaamxjqe and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 15/04/2021 Erika Ábrahám: Probabilistic Hyperproperties * 22/04/2021 Jürgen Giesl: Inferring Expected Runtimes of Probabilistic Programs * 29/04/2021 Erich Grädel: Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence * 06/05/2021 Christof Löding: Learning Automata for Infinite Words * 20/05/2021 Martin Grohe: The Logic of Graph Neural Networks * 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Ringvorlesung: Gerhard Woeginger: Bilevel optimization * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, May 20 at 4:30pm*.*Martin Grohe *will talk about *The Logic of Graph Neural Networks*. Following the talk, UnRAVeL PhD student *Tim Seppelt* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* Graph neural networks (GNNs) are a deep learning architecture for graph structured data that has developed into a method of choice for many graph learning problems in recent years. It is therefore important that we understand their power. One aspect of this is the expressiveness: which functions on graphs can be expressed by a GNN model? Surprisingly, this question has a precise answer in terms of logic and a combinatorial algorithm known as the Weisfeiler–Leman algorithm.
In my lecture, I will introduce the basic GNN architecture and also some extensions, and I will explain the logical characterisations of their expressiveness.
Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxjrr?lidx=1#aaaaaaaaaamxjvb and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 20/05/2021 Martin Grohe: The Logic of Graph Neural Networks * 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Gerhard Woeginger: Bilevel optimization /(to be rescheduled)/ * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, June 10 at 4:30pm*.*Britta Peis *will talk about *Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory*. Following the talk, UnRAVeL PhD student *Katharina Eickhoff* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* We consider integral-splittable congestion games. Such games can be used to model situations where selfishly acting users send traffic in integral units through a transport- or communication network, and where the travel times on the links depend on the congestion or load induced by the joint strategy choices of the agents.
In 1973, Rosenthal proved that the existence of equilibria cannot be guaranteed in general for this class of games. In this lecture, we show that equilibria can be guaranteed, and even computed, if (and only if) the strategy spaces and the delay functions obey certain submodularity and discrete convexity properties.
In the first part of the lecture, we will start with a gentle introduction into the world of submodular functions, polymatroids, and discrete convexity.
In the second part, we will derive a sensitivity result for minimising a parameter-dependent separable discrete convex function over a polymatroid base polytope.
Finally, in the third part, we use this sensitivity result to show that a certain best-response dynamics converges to an equilibrium in integer-splittable polymatroid congestion games.
Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxjvt?lidx=1#aaaaaaaaaamxjzs and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Gerhard Woeginger: Bilevel optimization /(to be rescheduled)/ * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, June 17 at 4:30pm*.*Nils Nießen *will talk about *Optimised Maintenance of Railway Infrastructure*. Following the talk, UnRAVeL PhD student *Stephan Zieger* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* The effect of maintenance and renewal funds on the quality of railway infrastructure is difficult to quantify. In order to establish a direct link, a model is presented to illustrate the cause-effect relationship, which describes the influence of the resources used on the infrastructure quality and vice versa. The model was applied for the infrastructure of DB Netz AG. The infrastructure under consideration is divided into the object groups bridges, tracks, points, signal boxes and level crossings. For these object groups, algorithms were created that map the cause-effect relationship by means of forecast approaches (bridges and tracks) and risk approaches (points, signal boxes and level crossings). The presentation describes the mapping of the cause-effect relationship using the example of the forecast model for the development of the condition of bridges.
Further information can be found https://www.unravel.rwth-aachen.de/go/id/mxkab?#aaaaaaaaaamxkll and below.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Gerhard Woeginger: Bilevel optimization /(to be rescheduled)/ * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, June 24 at 4:30pm*.*Gerhard Lakemeyer *will talk about *Uncertainty in Robotics – The Wonders of the Bayes Filter*. Following the talk, UnRAVeL PhD student *Till Hofmann* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* One of the fundamental problems in mobile robotics is navigation. In particular, robots need to have a map of their environment and be able to localize themselves within a map so that they can then safely move from one location to another. The main challenge here is dealing with uncertainty, which is inherent in both sensors and actuators of a robot. In this lecture, I will demonstrate how the so-called Bayes filter lies at the heart of many approaches integrating data from sensors and actuators to arrive at a coherent view of of what the world is like.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 10/06/2021 Britta Peis: Sensitivity Analysis for Submodular Function Optimization with Applications in Algorithmic Game Theory * 17/06/2021 Nils Nießen: Optimised Maintenance of Railway Infrastructure * 24/06/2021 Gerhard Lakemeyer: Uncertainty in Robotics * 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 15/07/2021 Gerhard Woeginger: Bilevel optimization /(to be rescheduled)/ * 22/07/2021 Ulrike Meyer: Malware Detection
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, July 1 at 4:30pm*.*Joost-Pieter Katoen *will talk about *The Surprises of Probabilistic Termination*. Following the talk, UnRAVeL PhD student *Alexander Bork* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* Program termination is a key question in program verification. This talk considers the termination of probabilistic programs, programs that can describe e.g., randomized algorithms, security algorithms and Bayesian learning.
Probabilistic termination has several nuances. Diverging program runs may occur with probability zero. Such programs are almost surely terminating (AST). If the expected duration until termination is finite, they are positive AST.
This talk presents the different nuances of probabilistic termination and discusses the hardness (how undecidable are these notions?) to check these properties.
To conclude we will present a simple proof rule for deciding AST, and reports on recent approaches towards automation to check whether a program is AST, PAST, non-AST, non-PAST, or “don’t know”.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 22/07/2021 Ulrike Meyer: Malware Detection * 29/07/2021 Gerhard Woeginger: Bilevel optimization
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the next UnRAVeL survey lecture that takes place this *Thursday, July 8 at 4:30pm*.*Christina Büsing *will talk about *Robust Minimum Cost Flow Problem Under Consistent Flow Constraints*. Following the talk, UnRAVeL PhD student *Tabea Krabs* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* The minimum cost flow problem is one of the best known problems in combinatorial optimization. Next to nice structural properties, many applications can be modeled via a minimum cost flow networks. In this talk we will extend this problem to include demand and supply uncertainty. For all demand realizations, however, we require that the flow value on an arc needs to be equal if it is included in the predetermined arc set given. The objective is to find feasible flows that satisfy the equal flow requirements while minimizing the maximum occurring cost among all demand realizations. We will provide structural results and prove e.g. that the Integral Flow Theorem does not hold anymore. Furthermore, we provide several complexity results and derive some polynomial solvable cases.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 22/07/2021 Ulrike Meyer: Malware Detection * 29/07/2021 Gerhard Woeginger: Bilevel optimization
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
this is a reminder for the penultimate UnRAVeL survey lecture this semester that takes place this *Thursday, July 22 at 4:30pm*.*Ulrike Meyer *will talk about *Malware Detection*. Following the talk, UnRAVeL PhD student *Andreas Klinger* will give an informal summary of their doctoral studies within UnRAVeL.
*Abstract* The IT-Security research group at RWTH has been working on various aspects of malware detection in the past 10 years. In this talk I’m going to tell a story on how we came to work on this topic, how the topic evolved over time, and what challenges we (and other researcher working in this area of research) face. I’m going to highlight our results and their impact as well current and future directions of our research.
The event takes place on Zoom:
https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09 Meeting ID: 960 4371 5437 Passcode: 039217
Since the event is open also to master's students, who may not receive this email, we would kindly appreciate if you could pass this invitation on.
We are looking forward to seeing many of you at the survey lecture.
Best regards, Tim Seppelt for the organisation committee
-------- Forwarded Message -------- Subject: UnRAVeL "Behind the Scenes" Survey Lecture Date: Fri, 19 Mar 2021 10:43:09 +0100 From: Tim Seppelt seppelt@cs.rwth-aachen.de To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de CC: Andreas Klinger klinger@itsec.rwth-aachen.de, Birgit Willms willms@informatik.rwth-aachen.de, Dennis Fischer fischer@algo.rwth-aachen.de
Dear all,
part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.
This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:
* How did you get to this result? * How did you come up with certain key ideas? * How did you cope with obstacles on the way? Which ideas you had did not work out?
Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.
All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.
Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/%7Epzix/Ringvorlesung...
All events take place on *Thursdays from 16:30 to 18:00 on Zoom* https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
* 01/07/2021 Joost-Pieter Katoen: The Surprises of Probabilistic Termination * 08/07/2021 Christina Büsing: Robust Minimum Cost Flow Problem Under Consistent Flow Constraints * 22/07/2021 Ulrike Meyer: Malware Detection * 29/07/2021 Gerhard Woeginger: Bilevel optimization
We are looking forward to seeing you at the lectures.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
Dear all,
thank you for participating in the UnRAVeL survey lecture "Behind the Scenes". We have had many interesting talks on a wide range of topics and got some interesting insights into the life of PhD students within UnRAVeL. We would like to thank all PIs and PhD students again for their contribution.
Unfortunately, the last survey lecture by Gerhard Woeginger, which was scheduled for this week, had to be cancelled. We hope to see you all again for the next edition of the UnRAVeL survey lecture.
Best regards, Tim Seppelt for the organisation committee
https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydocz...
informatik-vortraege@lists.rwth-aachen.de
-
Tim Seppelt