|
|
|
|
|
|
1 |
2
- Seminar "Informatische Bildung"
Seminar "Informatische Bildung" 2nd May 2022 10:15 am - 11:45 am Das MoDiSaar-Zertifikat ist dieses Wintersemester gestartet. Die Bildung der Lehrkräfte für die digitale Welt soll verbessert werden. Das Seminar "Informatische Bildung" ist Pflicht im Zertifikat und wurde von den Studierenden auch schon belegt. Das Seminar findet jeden Montag 10:15 - 11:45 Uhr im InfoLab statt. Im Rahmen des Projekts "GELBDING" gibt es eine Zusammenarbeit mit den Universitäten in Mainz und Köln. Teile des Seminars "Informatische Bildung" finden zusammen mit Studierenden aus Mainz statt. Einige Termine finden in Mainz und Saarbrücken getrennt statt, manche sind reine Online-Veranstaltungen für alle, manche finden hybrid statt. Dafür wird das InfoLab mit passender Videokonferenzhardware ausgestattet. https://infolab.cs.uni-saarland.de/ See more details
• |
3 |
4
- Talk on "Towards Resilient and Sustainable Software Security" by Thorsten Holz
Talk on "Towards Resilient and Sustainable Software Security" by Thorsten Holz 4th May 2022 12:15 pm - 1:15 pm Join Zoom Meeting https://zoom.us/j/99715655535?pwd=L2F1MVVvcmJBakpyK1N3NHNyeG03UT09 Meeting ID: 997 1565 5535 Passcode: jls-22 --------------------------------------------------------------- Abstract: In parallel with the ongoing digitization, computer security has become an increasingly important and urgent challenge. In particular, the sound and robust implementation of complex software systems is still not well understood in practice, as evidenced by the steady stream of successful attacks observed in the wild. The current state of the art in software security consists of solutions that are often technically sound, but do not provide operational security in practice. In this talk, I will give an overview of our recent work towards resilient and sustainable software security, which is also the focus of my upcoming ERC Consolidator project. On the one hand, the system must be resilient against entire classes of attack vectors. On the other hand, the system must be sustainable, i.e., it must be able to maintain its security at least over its design lifetime and possibly even adapt over time. In the talk, I will discuss some of the methods we have developed to achieve this goal, with a specific focus on novel software testing strategies that enable accurate and efficient vulnerability discovery. I will conclude the talk with a brief overview of future research directions. Presenter: Thorsten Holz: https://cispa.de/de/people/c01thho See more details
• |
5 |
6
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 6th May 2022 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
• |
7
- Schülerlabor: Workshop zum Arduino-Wettbewerb auf der make-it Messe
Schülerlabor: Workshop zum Arduino-Wettbewerb auf der make-it Messe 7th May 2022 10:00 am - 1:00 pm https://infolab.cs.uni-saarland.de/2022/03/20/schuelerwettbewerb-zur-make-it-saarland/ See more details
• |
8 |
9
- Seminar "Informatische Bildung"
Seminar "Informatische Bildung" 9th May 2022 10:15 am - 11:45 am Das MoDiSaar-Zertifikat ist dieses Wintersemester gestartet. Die Bildung der Lehrkräfte für die digitale Welt soll verbessert werden. Das Seminar "Informatische Bildung" ist Pflicht im Zertifikat und wurde von den Studierenden auch schon belegt. Das Seminar findet jeden Montag 10:15 - 11:45 Uhr im InfoLab statt. Im Rahmen des Projekts "GELBDING" gibt es eine Zusammenarbeit mit den Universitäten in Mainz und Köln. Teile des Seminars "Informatische Bildung" finden zusammen mit Studierenden aus Mainz statt. Einige Termine finden in Mainz und Saarbrücken getrennt statt, manche sind reine Online-Veranstaltungen für alle, manche finden hybrid statt. Dafür wird das InfoLab mit passender Videokonferenzhardware ausgestattet. https://infolab.cs.uni-saarland.de/ See more details
• |
10 |
11
- ZF AI Lab Saarbrücken: Einsatz künstlicher Intelligenz bei ZF - Machine Learning - Entwickler geben Einblick aus ihren laufenden AI Projekten -
ZF AI Lab Saarbrücken: Einsatz künstlicher Intelligenz bei ZF - Machine Learning - Entwickler geben Einblick aus ihren laufenden AI Projekten - 11th May 2022 4:15 pm - 5:15 pm Universität des Saarlandes, Informatik, Geb E1 3, HS 001 ZF ist ein weltweit aktiver Technologiekonzern und liefert Systeme für die Mobilität von Pkw, Nutzfahrzeugen und Industrietechnik. ZF lässt Fahrzeuge sehen, denken und handeln: In den vier Technologiefeldern Vehicle Motion Control, integrierte Sicherheit, automatisiertes Fahren und Elektromobilität bietet ZF umfassende Produkt- und Software-Lösungen für etablierte Fahrzeughersteller sowie für neu entstehende Anbieter von Transport- und Mobilitäts-dienstleistungen. Das ZF AI Lab Saarbrücken, als Teil des AI & Cyber Security Tech Centers wurde 2019 als ZF Corporate Funktion auf dem Campus der Universität des Saarlandes gegründet. Hier arbeitet ein hochmotiviertes AI Expertenteam an Themen wie „Automatisiertes Fahren & Fahrerassistenz (AD/ADAS)“ und „Industrie 4.0 (I4.0)“. Zusammen mit ehemaligen Absolventen der Saarbrücker Informatik wird Dr. Georg Schneider, Leiter des ZF AI Labs, anhand von Beispielen darüber berichten, wie Künstliche Intelligenz bei ZF eingesetzt wird. Dr. Georg Schneider beendete 1999 sein Studium der Physik an der TU Darmstadt. Er verfügt über mehr als 20 Jahre Erfahrung im Bereich Künstliche Intelligenz, Computer Vision und ADAS-Funktionsentwicklung in der Automobilindustrie, von der Forschung über die Vorentwicklung bis zur Serienentwicklung. Seine gegenwärtigen Themenschwerpunkte sind AD/ADAS und Industrie 4.0. See more details
• |
12 |
13
- Fachschafts-Brunch
Fachschafts-Brunch 13th May 2022 10:00 am - 12:00 pm E1 3, R. 109 See more details
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 13th May 2022 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
- PhD Defense André Nusser
PhD Defense André Nusser 13th May 2022 4:00 pm - 5:00 pm Abstract Point sets and sequences are fundamental geometric objects that arise in any application that considers movement data, geometric shapes, and many more. A crucial task on these objects is to measure their similarity. Therefore, this thesis presents results on algorithms, complexity lower bounds, and algorithm engineering of the most important point set and sequence similarity measures like the Fréchet distance, the Fréchet distance under translation, and the Hausdorff distance under translation. As an extension to the mere computation of similarity, also the approximate near neighbor problem for the continuous Fréchet distance on time series is considered and matching upper and lower bounds are shown. The zoom link will be distributed via the mailing list. You can also write the speaker to obtain it. http://domino.mpi-inf.mpg.de/internet/events.nsf/0/237B85B47B3D74DFC12588380031B256 See more details
• • • |
|
|
16
- Seminar "Informatische Bildung"
Seminar "Informatische Bildung" 16th May 2022 10:15 am - 11:45 am Das MoDiSaar-Zertifikat ist dieses Wintersemester gestartet. Die Bildung der Lehrkräfte für die digitale Welt soll verbessert werden. Das Seminar "Informatische Bildung" ist Pflicht im Zertifikat und wurde von den Studierenden auch schon belegt. Das Seminar findet jeden Montag 10:15 - 11:45 Uhr im InfoLab statt. Im Rahmen des Projekts "GELBDING" gibt es eine Zusammenarbeit mit den Universitäten in Mainz und Köln. Teile des Seminars "Informatische Bildung" finden zusammen mit Studierenden aus Mainz statt. Einige Termine finden in Mainz und Saarbrücken getrennt statt, manche sind reine Online-Veranstaltungen für alle, manche finden hybrid statt. Dafür wird das InfoLab mit passender Videokonferenzhardware ausgestattet. https://infolab.cs.uni-saarland.de/ See more details
• |
17 |
18 |
19
- Talk on "Quantum algorithms for search and optimization" by Speaker Andris Ambainis (University of Latvia)
Talk on "Quantum algorithms for search and optimization" by Speaker Andris Ambainis (University of Latvia) 19th May 2022 4:00 pm - 5:00 pm Abstract: Quantum algorithms are useful for a variety of problems in search and optimization. This line of work started with Grover's quantum search algorithm which achieved a quadratic speedup over naive exhaustive search but has now developed far beyond it. In this talk, we describe three recent results in this area: 1. We show that, for any classical algorithm that uses a random walk to find an object with some property (by walking until the random walker reaches such an object), there is an almost quadratically faster quantum algorithm (https://arxiv.org/abs/1903.07493). 2. We show that the best known exponential time algorithms for solving several NP-complete problems (such as Travelling Salesman Problem or TSP) can be improved quantumly (https://arxiv.org/abs/1807.05209). For example, for the TSP, the best known classical algorithm needs time O(2^n) but our quantum algorithm solves the problem in time O(1.728...^n). 3. We show a almost quadratic quantum speedup for a number of geometric problems such as finding three points that are on the same line (https://arxiv.org/abs/2004.08949). Location https://zoom.us/j/94577321297?pwd=N3l5K1ZtZ3E1aytnWlBkL1FUazNXZz09 Meeting ID 945 7732 1297 Passcode 205903 Information about the series and recordings of previous talks can be found at https://www.mpi-inf.mpg.de/departments/algorithms-complexity/quantum-lecture-series Hosts: Ignacio Ciraq (MPIQ) and Kurt Mehlhorn (MPI-INF). See more details
- PhD Thesis Defense: "Inductive Verification of Cryptographic Protocols Based on Message Algebras – Trace and Indistinguishability Properties" by Lassaad CHEIKHROUHOU
PhD Thesis Defense: "Inductive Verification of Cryptographic Protocols Based on Message Algebras – Trace and Indistinguishability Properties" by Lassaad CHEIKHROUHOU 19th May 2022 4:30 pm - 5:30 pm Building E1 4, room 0.24 Abstract: Seit 1981 wurden zahlreiche formale Methoden zur Analyse kryptographischer Protokolle entwickelt und erfolgreich angewendet. Trotz vieler Verbesserungen, beschränkt sich der Anwendungsbereich gerade induktiver Verfahren auf das einfache enc-dec Szenario (Entschlüsseln hebt Verschlüsseln ab) und auf Standardeigenschaften (Vertraulichkeit und Authentifizierung). In dieser Arbeit erweitern wir den Anwendungsbereich der werkzeugunterstützten induktiven Methode auf Protokolle mit algebraisch spezifizierten kryptografischen Primitiven und auf Ununterscheidbarkeitseigenschaften wie die Resistenz gegen Offline-Testen. Eine Axiomatisierung von Nachrichtenstrukturen, abgeleitet aus einem konstruktiven Modell (Termersetzung), liefert die Basis für die Definition rekursiver Funktionen und induktives Schließen (partielle Ordnungen, Fallunterscheidungen). Eine neue Beweistechnik für Vertraulichkeitseigenschaften verwendet rekursive Testfunktionen, die beweisbar korrekt bzgl. eines induktiv definierten Angreifermodells sind. Die Formalisierung von Ununterscheidbarkeitseigenschaften durch generische Ableitungen und ein zentrales Theorem erlauben eine Reduktion auf Trace-Eigenschaften. Die allgemeinen Aspekte unserer Techniken werden zusammen mit zwei vollständig ausgearbeiteten realen Fallstudien, PACE und TC-AMP, diskutiert, die für den deutschen Personalausweis entwickelt wurden. TC-AMP gehört sicher zu den komplexesten algebraisch spezifizierten Protokollen, die formal verifiziert wurden. Insbesondere, sind uns keine Ansätze bekannt, die vergleichbare Fälle behandeln. https://www.graduateschool-computerscience.de/doctoral-students/314-2/ See more details
- Lecture series Explainable AI and Society: "The Invisible Hand of Prediction" by Moritz Hardt (Max Planck Institute for Intelligent Systems)
Lecture series Explainable AI and Society: "The Invisible Hand of Prediction" by Moritz Hardt (Max Planck Institute for Intelligent Systems) 19th May 2022 6:15 pm - 7:30 pm https://explainable-intelligent.systems/lectures/ See more details
• • • |
20
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 20th May 2022 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
- Talk on "Operationalizing Fairness for Responsible Machine Learning" by Preethi Lahoti
Talk on "Operationalizing Fairness for Responsible Machine Learning" by Preethi Lahoti 20th May 2022 4:15 pm - 5:15 pm Abstract As machine learning (ML) is increasingly used for decision making in scenarios that impact humans, there is a growing awareness of its potential for unfairness. A large body of recent work has focused on proposing formal notions of fairness in ML, as well as approaches to mitigate unfairness. However, there is a disconnect between the ML fairness literature and the needs to operationalize fairness in practice. This dissertation brings ML fairness closer to real-world applications by developing new models and methods that address key challenges in operationalizing fairness in practice. *First, we tackle a key assumption in the group fairness literature that sensitive demographic attributes such as race and gender are known upfront, and can be readily used in model training to mitigate unfairness. In practice, factors like privacy and regulation often prohibit ML models from collecting or using protected attributes in decision making. To address this challenge we introduce the novel notion of computationally-identifiable errors and propose Adversarially Reweighted Learning (ARL), an optimization method that seeks to improve the worst-case performance over unobserved groups, without requiring access to the protected attributes in the dataset. *Second, we argue that while group fairness notions are a desirable fairness criterion, they are fundamentally limited as they reduce fairness to an average statistic over pre-identified protected groups. In practice, automated decisions are made at an individual level, and can adversely impact individual people irrespective of the group statistic. We advance the paradigm of individual fairness by proposing iFair (individually fair representations), an optimization approach for learning a low dimensional latent representation of the data with two goals: to encode the data as well as possible, while removing any information about protected attributes in the transformed representation. *Third, we advance the individual fairness paradigm, which requires that similar individuals receive similar outcomes. However, similarity metrics computed over observed feature space can be brittle, and inherently limited in their ability to accurately capture similarity between individuals. To address this, we introduce a novel notion of fairness graphs to capture nuanced expert knowledge on which individuals should be treated similarly with respect to the ML objective. We cast the problem of individual fairness into graph embedding, and propose PFR (pairwise fair representations), a method to learn a unified pairwise fair representation of the data. *Fourth, we tackle the challenge that production data after model deployment is constantly evolving. As a consequence, in spite of the best efforts in training a fair model, ML systems can be prone to failure risks due to a variety of unforeseen failure risks. We propose Risk Advisor, a model-agnostic meta-learner to predict potential failure risks and to give guidance on the sources of uncertainty inducing the risks, by leveraging information theoretic notions of aleatoric and epistemic uncertainty. Extensive experiments on a variety of real-world and synthetic datasets show that our proposed methods are viable in practice. http://domino.mpi-inf.mpg.de/internet/events.nsf/0/E739258AF6B96B47C125883F004D4670 See more details
• • |
21
- Tag der offenen Tür
Tag der offenen Tür 21st May 2022 10:00 am - 4:00 pm https://www.uni-saarland.de/page/tdot.html See more details
• |
22 |
23
- Seminar "Informatische Bildung"
Seminar "Informatische Bildung" 23rd May 2022 10:15 am - 11:45 am Das MoDiSaar-Zertifikat ist dieses Wintersemester gestartet. Die Bildung der Lehrkräfte für die digitale Welt soll verbessert werden. Das Seminar "Informatische Bildung" ist Pflicht im Zertifikat und wurde von den Studierenden auch schon belegt. Das Seminar findet jeden Montag 10:15 - 11:45 Uhr im InfoLab statt. Im Rahmen des Projekts "GELBDING" gibt es eine Zusammenarbeit mit den Universitäten in Mainz und Köln. Teile des Seminars "Informatische Bildung" finden zusammen mit Studierenden aus Mainz statt. Einige Termine finden in Mainz und Saarbrücken getrennt statt, manche sind reine Online-Veranstaltungen für alle, manche finden hybrid statt. Dafür wird das InfoLab mit passender Videokonferenzhardware ausgestattet. https://infolab.cs.uni-saarland.de/ See more details
• |
24
- Talk on "Orderrr! A tale of money, intrigue, and specifications" by Lorenzo Alvisi, Cornell University
Talk on "Orderrr! A tale of money, intrigue, and specifications" by Lorenzo Alvisi, Cornell University 24th May 2022 9:30 am - 10:30 am or via Zoom: https://zoom.us/j/99457028566?pwd=bGllck5vS05iYnhtMGVCUzFGS1JqUT09 Meeting ID: 994 5702 8566 Passcode: 780865 Abstract: Mistrust over traditional financial institutions is motivating the development of decentralized financial infrastructures based on blockchains. In particular, Consortium blockchains (such as the Linux Foundation Hyperledger and Facebook’s diem) are emerging as the approach preferred by businesses. These systems allow only a well-known set of mutually distrustful parties to add blocks to the blockchain; in this way, they aim to retain the benefits of decentralization without embracing the cyberpunk philosophy that informed Nakamoto’s disruptive vision. At the core of consortium blockchains is State Machine Replication, a classic technique borrowed from fault tolerant distributed computing; to ensure the robustness of their infrastructure, consortium blockchains actually borrow the Byzantine-tolerant version of this technique, which guarantees that the blockchain will operate correctly even if as many as about a third of the contributing parties are bent on cheating. But, sometimes, “a borrowing is a sorrowing”. I will discuss why Byzantine-tolerant state machine replication is fundamentally incapable of recognizing, never mind preventing, an ever present scourge of financial exchanges: the fraudulent manipulation of the order in which transactions are processed — and how its specification needs to be expanded to give it a fighting chance. But is it possible to completely eliminate the ability of Byzantine parties to engage in order manipulation? What meaningful ordering guarantees can be enforced? And at what cost? Bio: Lorenzo Alvisi is the Tisch University Professor of Computer Science at Cornell University. Prior to joining Cornell, he held an endowed professorship at UT Austin, where he is now a Distinguished Professor Emeritus. Lorenzo received his Ph.D. in 1996 from Cornell, after earning a Laurea cum Laude in Physics from the University of Bologna. His research interests span theory and practice of distributed computing, with a focus on scaling strong consistency and dependability guarantees. He is a Fellow of the ACM and IEEE , an Alfred P. Sloan Foundation Fellow, and the recipient of a Humboldt Research Award, an NSF Career Award, and several teaching awards. He serves on the editorial boards of ACM TOCS and Springer’s Distributed Computing, and on the steering committee of Eurosys and SOSP . Besides distributed computing, he is passionate about classical music and red Italian motorcycles. See more details
• |
25 |
26 |
27
- Talk on "The Skolem Landscape" by Joël Ouaknine, Max Planck Institute for Software Systems
Talk on "The Skolem Landscape" by Joël Ouaknine, Max Planck Institute for Software Systems 27th May 2022 2:00 pm - 3:00 pm Either at MPI-SWS Saarbrücken, E1 5, room 002 or videocast to MPI-SWS Kaiserslautern, G26, room 111 or via Zoom: https://zoom.us/j/99457028566?pwd=bGllck5vS05iYnhtMGVCUzFGS1JqUT09 Meeting ID: 994 5702 8566 Passcode: 780865 Abstract: The Skolem Problem asks how to determine algorithmically whether a given linear recurrence sequence (such as the Fibonacci numbers) has a zero. It is a central question in dynamical systems and number theory, and has many connections to other branches of mathematics and computer science. Unfortunately, its decidability has been open for nearly a century! In this talk, I will present a brief survey of what is known on the Skolem Problem and related questions, including recent and ongoing developments. Bio: Joël Ouaknine is a Scientific Director at the Max Planck Institute for Software Systems in Saarbruecken, Germany. His research interests straddle theoretical computer science and mathematics, and lie mainly at the intersection of dynamical systems and computation, making use of tools from number theory, Diophantine geometry, algebraic geometry, and mathematical logic. Joel studied mathematics at McGill University, and received a PhD in Computer Science from Oxford in 2001. He subsequently held postdoc positions at Tulane University and Carnegie Mellon University, and became Full Professor of Computer Science at Oxford in 2010. He received the Roger Needham Award in 2010, an ERC grant in 2015, and was elected member of Academia Europaea in 2020; the same year he also received the Arto Salomaa Prize (jointly with James Worrell), for "outstanding contributions to Theoretical Computer Science, in particular to the theory of timed automata and to the analysis of dynamical systems". He was elected Fellow of the ACM in 2021 for "contributions to algorithmic analysis of dynamical systems". See more details
- Informatik-AG Gymnasium am Schloss
Informatik-AG Gymnasium am Schloss 27th May 2022 2:30 pm - 3:30 pm Organisator: infolab.saar@gmail.com See more details
• • |
28 |
29 |
30
- Hannover Messe 2022
Hannover Messe 2022 30th May 2022 - 2nd June 2022 https://www.hannovermesse.de/en/ See more details
- Seminar "Informatische Bildung"
Seminar "Informatische Bildung" 30th May 2022 10:15 am - 11:45 am Das MoDiSaar-Zertifikat ist dieses Wintersemester gestartet. Die Bildung der Lehrkräfte für die digitale Welt soll verbessert werden. Das Seminar "Informatische Bildung" ist Pflicht im Zertifikat und wurde von den Studierenden auch schon belegt. Das Seminar findet jeden Montag 10:15 - 11:45 Uhr im InfoLab statt. Im Rahmen des Projekts "GELBDING" gibt es eine Zusammenarbeit mit den Universitäten in Mainz und Köln. Teile des Seminars "Informatische Bildung" finden zusammen mit Studierenden aus Mainz statt. Einige Termine finden in Mainz und Saarbrücken getrennt statt, manche sind reine Online-Veranstaltungen für alle, manche finden hybrid statt. Dafür wird das InfoLab mit passender Videokonferenzhardware ausgestattet. https://infolab.cs.uni-saarland.de/ See more details
• • |
31
- Hannover Messe 2022
Hannover Messe 2022 30th May 2022 - 2nd June 2022 https://www.hannovermesse.de/en/ See more details
• |
|
|
|
|
|