Die Vorlesung findet online asynchron statt.
Die Q+A und Präsenz-Übung finden im Raum RH1 B0.10 des DFKI statt.
https://lvb.informatik.uni-bremen.de/ibg/03-ibga-fi-rdl.pdf

3 SWS Seminar
Die Veranstaltung kann nach BPO'10 als BE-6 angerechnet werden und nach BPO'20 nur in Freie Wahl

Homepage des KKSB und Uni-Lageplan

Masterstudierende der Informatik können das Modul Projektmanagement und Wissenschaftskultur auch über diese Lehrveranstaltung abdecken.

Profil: SQ
Schwerpunkt: IMA-SQ, IMA-AI
https://lvb.informatik.uni-bremen.de/imat/03-imat-au.pdf


A key assumption of many powerful optimization methods is that all the data is fully accessible from the beginning.

However, from the point of view of many real-world applications (e.g., in logistics, production or project planning, cloud computing, etc.) this assumption is simply not true. Large data centers allocate resources to tasks without knowledge of exact execution times or energy requirements; transit times in networks are often uncertain; or, parameters such as bandwidth, demands or energy consumption are highly fluctuating. The current trend of data collection and data-driven applications often amplifies this phenomenon. As the amount of available data is increasing tremendously due to internet technology, cloud systems and sharing markets, modern algorithms are expected to be highly adaptive and learn and benefit from the dynamically changing mass of data.

In the above examples, our knowledge of the current data is only partial or based on historical estimates. The class ``Algorithms and Uncertainty'' will teach students about the most common models of such uncertain data and how to design and analyze efficient algorithms in these models.

Specifically, we will cover the theory of online optimization, where the input arrives without any prior information (such as network packets arriving to a router) and also needs to be processed immediately, before the next piece of input arrives. This model is best suited for analyzing critical networking and scheduling systems where devices and algorithms must perform well even in the worst-case scenario.

In the cases where previous history can be used to model the upcoming data, we often employ robust optimization or stochastic optimization. In robust optimization, the aim is to optimize the worst-case of all possible realizations of the input data. Hence, this model is rather conservative.
In stochastic optimization however, the algorithms work with the assumption that data is drawn from some probability distribution known ahead of time and typically the goal is to optimize the expected value.

Nowadays, another source of information is often available: machine learning algorithms can generate predictions which are accurate most of the time. However, there is no guarantee on the quality of the prediction, as the current instance may not be covered by the training set. This statement motivated a very recent research domain that will be covered in this course: how to use error-prone predictions in order to improve guaranteed algorithms.

Organization: The course will be taught in English in two sessions per week (4 SWS) including interactive exercise sessions.

Examination: The examination will be by individual oral exam. As admission to the oral exam it is mandatory to present solutions in the exercise session at least twice during the term.

Prerequisites: Having heard an introductory course to discrete algorithms and their mathematical analysis (e.g. Algorithmentheorie, Algorithmische Diskrete Mathematik) or graph theory is beneficial but not required.

Profil: SQ
Schwerpunkt: IMVT-SQ
https://lvb.informatik.uni-bremen.de/imat/03-imat-irq.pdf

Profil: SQ
Schwerpunkt: IMVT-SQ
https://lvb.informatik.uni-bremen.de/imat/03-imat-stmt.pdf
Set theory and model theory

Intuitively, a set is a collection of all elements that satisfy a certain property. This intuition, however, is false! The following example is known as Russell's Paradox. Consider the set S whose elements are exactly those that are not members of themselves: S = { X : X is not element of X }. Is S an element of S? If S is an element of S, then S is not an element of S. On the other hand, if S is not an element of S, then S belongs to S. In either case we have a contradiction. We must revise our intuitive notion of a set. In the first part of the lecture we develop axiomatic set theory (ZFC) in the framework of first-order logic, which forms the foundation of modern mathematics. We cover the axioms of set theory, ordinal numbers and induction and recursion over well-founded relations, cardinal numbers and the axiom of choice.

In the second part of the lecture we turn to classical topics of first-order model theory. Model theory studies classes of mathematical structures, such as groups, fields, or graphs, from the point of view of mathematical logic. Many notions, such as homomorphisms, substructures, or free structures, that are commonly studied in specific fields of mathematics are unified by the general approach of model theory. We study ways to construct models with desired properties from first-order theories and the expressive power of first-order logic.

Schwerpunkt: IMK-AI, IMA-VMC
https://lvb.informatik.uni-bremen.de/imap/03-imap-amai.pdf

Profil: KIKR
Schwerpunkt: IMAP-AI, IMA-VMC
https://lvb.informatik.uni-bremen.de/imap/03-imap-aml.pdf

Profil: KIKR
Schwerpunkt: IMA-AI
https://lvb.informatik.uni-bremen.de/imap/03-imap-iis.pdf
Die Vorlesung findet asynchron und die Übung online statt.

Profil: KIKR, DMI
Schwerpunkt: IMAP-DMI, IMAP-VMC
https://lvb.informatik.uni-bremen.de/imap/03-imap-vrsim.pdf
English or German.
Over the past two decades, VR has established itself as an important tool in several industries, such as manufacturing (e.g., automotive, airspace, ship building), architecture, and pharmaceutical industries. During the past few years, we have been witnessing the second "wave" of VR, this time in the consumer, in particular, in the entertainment markets.

Some of the topics to be covered (tentatively):
• Introduction, basic notions of VR, several example applications
• VR technologies: displays, tracking, input devices, scene graphs, game engines
• The human visual system and Stereo rendering
• Techniques for real-time rendering
• Fundamental immersive interaction techniques: fundamentals and principles, 3D navigation, user models, 3D selection, redirected walking, system control
• Complex immersive interaction techniques: world-in-miniature, action-at-a-distance, magic lens, etc.
• Particle systems
• Spring-mass systems
• Haptics and force feedback
• Collision detection
• Acoustic rendering
The assignments will be mostly practical ones, based on the cross-platform game engine Unreal. Participants will start developing with "visual programming", and later use C++ to solve the assignments.
You are encouraged to work on assignments in small teams.
https://cgvr.cs.uni-bremen.de/teaching/

Profil: SQ, DMI
Schwerpunkt: IMA-SQ, IMA-AI, IMVP-DMI
https://lvb.informatik.uni-bremen.de/imaa/03-imaa-itmds.pdf

Profil: DMI
Schwerpunkt: IMA- DMI
https://lvb.informatik.uni-bremen.de/imva/03-imva-mad.pdf
Die Veranstaltung richtet sich an Student*innen der Informatik und Digitalen Medien. In Gruppenarbeit sollen die Studierenden semesterbegleitend ein App-Projekt umsetzen. In der Vorlesung werden alle relevanten Informationen der modernen Softwareentwicklung, mit Fokus auf die mobile App-Entwickung, vermittelt. Dazu gehören Themen wie mobiles Testing, Scrum, UX Design, Evaluation & Nutzertests, Design Patterns und Cross-Plattform-Entwicklung. Das Ziel dabei ist die Vermittlung von praxisrelevantem Wissen aus dem Alltag eines erfolgreichen Unternehmens.

Profil: KIKR, DMI
Schwerpunkt: IMVA-DMI, IMVA-AI
https://lvb.informatik.uni-bremen.de/imaa/03-imaa-stmw.pdf

Profil: SQ
Schwerpunkt: IMVP-SQ
https://lvb.informatik.uni-bremen.de/imvp/03-imvp-dls.pdf

Profil: KIKR
Schwerpunkt: IMVP-AI
https://lvb.informatik.uni-bremen.de/imvp/03-imvp-hcir.pdf
Die Veranstaltung findet im DFKI statt.

Profil: KIKR
Schwerpunkt:IMVP- AI
https://lvb.informatik.uni-bremen.de/imvp/03-imvp-mlar.pdf
Die Veranstaltung findet in den Räumen des DFKI statt.

Frequency: The seminar is planned as a block seminar, meaning that all talks will be at up to three days, most likely in the middle of December. We will discuss this in the first meeting. The first (organizational) meeting is planned as follows: Wednesday, October 16, at 14:00 pm in the room MZH 3150.

Learning Outcome:
Students learn how recent advances in algorithm theory can be used to improve state-of-the-art algorithms to obtain faster, better or new types of algorithms. They learn about relevant problems that are important and used in many applications. The main goals are to understand, design, and analyze algorithms for solving such problems.
Furthermore, the students will learn how to read and thoroughly understand original research papers. They learn how to prepare slides for these papers and give an oral presentation to other students who have no prior knowledge about the paper.

Contents: This seminar focuses on recent advances in algorithm theory. Most topics considered include important problems on graphs, typically related to optimization problems. These advances include faster running times of the algorithms, solutions with improved performance guarantees or new concepts in algorithm design, such as algorithms with machine-learned predictions.

Schwerpunkt: DMI, VMC, Ai

Schwerpunkt: DMI

Schwerpunkt: AI
Das Plenum am Freitag findet im DFKI statt.

Schwerpunkt: DMI

Schwerpunkt: AI

Veranstaltung für Doktoranten, jeden 1. Montag im Monat von 14-16h in Raum 5300.