Module Handbook

for the

Master Programme “Computer Science”

at

Rheinischen Friedrich-Wilhelms-Universität Bonn

revised version: September 23, 2022

The curriculum of the master programme is divided into four sub-curricula, each corre-
sponding to one of the four main areas of competence in research of the Bonn Institute of
Computer Science:

1. Algorithmics
2. Graphics, Vision, Audio
3. Information and Communication Management
4. Intelligent Systems

Module numbers MA-INF ASXY have been assigned according to the following key:
vergeben:

• A = number of the area of competence

• S = semester within the master curriculum
• XY = sequential number within the semester and the respective area of competence
(two digits)

According to the curriculum, all modules ought to be taken between the first and the third
semester. The fourth semester is reserved for preparing the master thesis.

Contents

1 Algorithmics 2

2 Graphics, Vision, Audio 36

3 Information and Communication Management 65

4 Intelligent Systems 90

5 Master Thesis 136

Master Computer Science — Universität Bonn 2

1 Algorithmics

MA-INF 1102 L4E2 9 CP Combinatorial Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

MA-INF 1103 L4E2 9 CP Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
MA-INF 1105 L2E2 6 CP Algorithms for Data Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
MA-INF 1106 L2 4 CP HPC modern Architectures and Trends . . . . . . . . . . . . . . . . . 6
MA-INF 1107 L2E2 6 CP Foundations of Quantum Computing . . . . . . . . . . . . . . . . . . . . 7
MA-INF 1201 L4E2 9 CP Approximation Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
MA-INF 1202 L4E2 9 CP Chip Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
MA-INF 1203 L4E2 9 CP Discrete and Computational Geometry . . . . . . . . . . . . . . . . . 10
MA-INF 1205 6 CP Graduate Seminar Discrete Optimization . . . . . . . . . . . . . . . 11
MA-INF 1206 Sem2 4 CP Seminar Randomized and Approximation Algorithms . . 12
MA-INF 1207 Lab4 9 CP Lab Combinatorial Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . 13
MA-INF 1209 Sem2 4 CP Seminar Advanced Topics in Cryptography . . . . . . . . . . . . . 14
MA-INF 1213 L4E2 9 CP Randomized Algorithms and Probabilistic Analysis . . . . . 15
MA-INF 1217 Sem2 4 CP Seminar Theoretical Foundations of Data Science . . . . . . 16
MA-INF 1218 L4E2 9 CP Algorithms and Uncertainty . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
MA-INF 1219 Sem2 4 CP Seminar Algorithmic Game Theory . . . . . . . . . . . . . . . . . . . . 18
MA-INF 1220 Sem2 4 CP Seminar Algorithms for Computational Analytics . . . . . . 19
MA-INF 1221 Lab4 9 CP Lab Computational Analytics . . . . . . . . . . . . . . . . . . . . . . . . . . 20
MA-INF 1222 Lab4 9 CP Lab High Performance Optimization . . . . . . . . . . . . . . . . . . . 21
MA-INF 1223 L4E2 9 CP Privacy Enhancing Technologies . . . . . . . . . . . . . . . . . . . . . . . 22
MA-INF 1301 L4E2 9 CP Algorithmic Game Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
MA-INF 1304 Sem2 4 CP Seminar Computational Geometry . . . . . . . . . . . . . . . . . . . . . 24
MA-INF 1305 6 CP Graduate Seminar on Applied Combinatorial
Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
MA-INF 1307 Sem2 4 CP Seminar Advanced Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . 26
MA-INF 1308 Lab4 9 CP Lab Algorithms for Chip Design . . . . . . . . . . . . . . . . . . . . . . . 27
MA-INF 1309 Lab4 9 CP Lab Efficient Algorithms: Design, Analysis and
Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
MA-INF 1314 L4E2 9 CP Online Motion Planning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
MA-INF 1315 Lab4 9 CP Lab Computational Geometry . . . . . . . . . . . . . . . . . . . . . . . . . 30
MA-INF 1316 Lab4 9 CP Lab Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
MA-INF 1320 Lab4 9 CP Lab Advanced Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
MA-INF 1321 L2E2 6 CP Binary Linear and Quadratic Optimization . . . . . . . . . . . . . 33
MA-INF 1322 Sem2 4 CP Seminar Focus Topics in High Performance Computing . 34
MA-INF 1323 L4E2 9 CP Computational Topology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Master Computer Science — Universität Bonn 3

Module Combinatorial Optimization

MA-INF 1102
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every year
Module Prof. Dr. Jens Vygen
coordinator
Lecturer(s) All lecturers of Discrete Mathematics
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills Advanced knowledge of combinatorial optimization. Modelling
and development of solution strategies for combinatorial
optimization problems
Soft skills Mathematical modelling of practical problems, abstract
thinking, presentation of solutions to exercises
Contents Matchings, b-matchings and T-joins, optimization over
matroids, submodular function minimization, travelling
salesman problem, polyhedral combinatorics, NP-hard problems
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• B. Korte, J. Vygen: Combinatorial Optimization: Theory and
Algorithms. Springer, 6th edition, 2018
• A. Schrijver: Combinatorial Optimization: Polyhedra and
Efficiency. Springer, 2003
Literature
• W. Cook, W. Cunningham, W. Pulleyblank, A. Schrijver:
Combinatorial Optimization. Wiley, 1997
• A. Frank: Connections in Combinatorial Optimization. Oxford
University Press, 2011
Master Computer Science — Universität Bonn 4

Module Cryptography
MA-INF 1103
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Dr. Michael Nüsken
coordinator
Lecturer(s) Dr. Michael Nüsken
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills Understanding of security concerns and measures, and of the
interplay between computing power and security requirements.
Mastery of the basic techniques for cryptosystems and
cryptanalysis
Soft skills Oral presentation (in tutorial groups), written presentation (of
exercise solutions), team collaboration in solving homework
problems, critical assessment
Contents Basic private-key and public-key cryptosystems: AES, RSA,
group-based. Security reductions. Key exchange, cryptographic
hash functions, signatures, identification; factoring integers and
discrete logarithms; lower bounds in structured models.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• Jonathan Katz & Yehuda Lindell (2015/2008). Introduction to
Literature Modern Cryptography, CRC Press.
• Course notes
Master Computer Science — Universität Bonn 5

Module Algorithms for Data Analysis

MA-INF 1105
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Prof. Dr. Petra Mutzel
coordinator
Lecturer(s) Prof. Dr. Petra Mutzel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills Deeper insights into selected methods and techniques of modern
algorithmics with respect to big data and/or analytics tasks
Soft skills Presentation of solutions and methods, critical discussion of
applied methods and techniques.
Contents Advanced algorithmic techniques and data structures relevant to
analytic tasks for big data, i.e., algorithms for graph similarity,
parallel algorithms, I/O-data structures, and streaming
algorithms.
Prerequisites Required:
none
Recommended:
Introductory knowledge of foundations of algorithms and data
structures is essential.
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 6

Module HPC modern Architectures and Trends

MA-INF 1106
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Estela Suarez
coordinator
Lecturer(s) Prof. Dr. Estela Suarez
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-3.
Technical skills Understanding principles of computer architecture of modern
HPC systems at component (processor, accelerators) and system
level (system architecture, network, memory hierarchy) and
their implication for application programming.
Soft skills Ability to select an specific HPC topic and present it in a clear
and comprehensive manner suitable for a lightning talk (10min)
Contents Computer architectures, system components (CPU, memory,
network) and their interrelation.
Software environment
Parallel architectures and parallel programming paradigms
(MPI, OpenMP, CUDA)
High Performance Computing
Current challenges
Prerequisites Required:
Knowledge of a modern programming language (like C, C++,
Python,?).
Interest in High Performance Computing
Recommended:
Bachelor Lecture “Computerarchitektur”
Teaching format Group size h/week Workload[h] CP
Format
Lecture 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements none (not graded)
Forms of media
- John L. Hennessy, David A. Patterson: Computer Architecture
- A Quantitative Approach. Morgan Kaufmann Publishers, 2012
- David A. Patterson, John L. Hennessy: Computer
Organization and Design - The Hardware / Software Interface.
Literature Morgan Kaufmann Publishers, 2013
- Message Passing Interface Forum: MPI: A Message-Passing
Interface Standard, Version 3.1
- OpenMP Application Programming Interface, Version 4.5,
November 2015
Master Computer Science — Universität Bonn 7

Module Foundations of Quantum Computing

MA-INF 1107
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Christian Bauckhage
coordinator
Lecturer(s) Prof. Dr. Christian Bauckhage
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 3.
Technical skills
Soft skills
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 8

Module Approximation Algorithms

MA-INF 1201
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every year
Module Prof. Dr. Jens Vygen
coordinator
Lecturer(s) All lecturers of Discrete Mathematics,
Senior Prof. Dr. Marek Karpinski
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Introduction to design and analysis of most important
approximation algorithms for NP-hard combinatorial
optimization problems, and various techniques for proving lower
and upper bounds, probabilistic methods and applications
Soft skills Presentation of solutions and methods, critical discussion of
applied methods and techniques
Contents Approximation Algorithms and Approximation Schemes. Design
and Analysis of Approximation algorithms for selected NP-hard
problems, like Set-Cover, and Vertex-Cover problems,
MAXSAT, TSP, Knapsack, Bin Packing, Network Design,
Facility Location. Introduction to various approximation
techniques (like Greedy, LP-Rounding, Primal-Dual, Local
Search, randomized techniques and Sampling, and
MCMC-Methods), and their applications. Analysis of
approximation hardness and PCP-Systems.
Prerequisites Recommended:
Introductory knowledge of foundations of algorithms and
complexity theory is essential.
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• S. Arora, C. Lund: Hardness of Approximations. In:
Approximation Algorithms for NP-Hard Problems (D. S.
Hochbaum, ed.), PWS, 1996
• M. Karpinski: Randomisierte und approximative Algorithmen
für harte Berechnungsprobleme, Lecture Notes (5th edition),
Literature Universität Bonn, 2007
• B. Korte, J. Vygen: Combinatorial Optimization: Theory and
Algorithms (6th edition), Springer, 2018
• V. V. Vazirani: Approximation Algorithms, Springer, 2001
• D. P. Williamson, D. B. Shmoys: The Design of
Approximation Algorithms, Cambridge University Press, 2011
Master Computer Science — Universität Bonn 9

Module Chip Design

MA-INF 1202
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Jens Vygen
coordinator
Lecturer(s) All lecturers of Discrete Mathematics
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills Knowledge of the central problems and algorithms in chip
design. Competence to develop and apply algorithms for solving
real-world problems, also with respect to technical constraints.
Techniques to develop and implement efficient algorithms for
very large instances.
Soft skills Mathematical modelling of problems occurring in chip design,
development of efficient algorithms, abstract thinking,
presentation of solutions to exercises
Contents Problem formulation and design flow for chip design, logic
synthesis, placement, routing, timing analysis and optimization
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• C.J. Alpert, D.P. Mehta, S.S. Sapatnekar: The Handbook of
Algorithms for VLSI Physical Design Automation. CRC Press,
New York, 2008.
• S. Held, B. Korte, D. Rautenbach, J. Vygen: Combinatorial
optimization in VLSI design. In: "Combinatorial Optimization:
Methods and Applications" (V. Chvátal, ed.), IOS Press,
Literature
Amsterdam 2011, pp. 33-96
• S. Held, J. Vygen: Chip Design. Lecture Notes (distributed
during the course)
• L. Lavagno, I.L. Markov, G. Martin, and L.K. Scheffer, eds.:
Electronic Design Automation for IC Implementation, Circuit
Design, and Process Technology. CRC Press, 2nd edition, 2016
Master Computer Science — Universität Bonn 10

Module Discrete and Computational Geometry

MA-INF 1203
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Anne Driemel
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, PD Dr. Elmar Langetepe,
Dr. Herman Haverkort
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-4.
Technical skills Knowledge of fundamental theorems and concepts in the area of
discrete and computational geometry; design and analysis of
geometric algorithms; combinatorial analysis of the complexity
of geometric configurations; to apply this knowledge
autonomously in solving new problems.
Soft skills Social competence (communication, presenting one’s own
solutions, goal-oriented discussions in teams), methodical
competence (analysis, abstraction, proofs), individual
competence (commitment and willingness to learn, creativity,
endurance).
Contents Fundamentals of convex sets, Voronoi diagrams, hyperplane
arrangements, well-separated pair decomposition, spanners,
metric space embedding, dimension reduction, VC-dimension,
epsilon-nets, visibility, point location, range searching,
randomized incremental construction, geometric distance
problems in dimension two and higher.
Prerequisites Recommended:
BA-INF 114 – Grundlagen der algorithmischen Geometrie
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• Jiri Matousek. Lectures on Discrete Geometry. Springer
Graduate Texts in Mathematics. ISBN 0-387-95374-4.
• Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark
Overmars. Computational Geometry — Algorithms and
Literature
Applications (Third Edition). Springer. ISBN
978-3-540-77973-5.
• Narasimhan/Smid, Geometric Spanner Networks
• Klein, Concrete and Abstract Voronoi Diagrams
Master Computer Science — Universität Bonn 11

Module Graduate Seminar Discrete Optimization

MA-INF 1205
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Jens Vygen
coordinator
Lecturer(s) All lecturers of Discrete Mathematics
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Competence to understand new research results based on
original literature, to put such results in a broader context and
present such results and relations.
Soft skills Ability to read and understand research papers, abstract
thinking, presentation of mathematical results in a talk
Contents A current research topic in discrete optimization will be chosen
each semester and discussed based on original literature.
Prerequisites Recommended:
MA-INF 1102 – Combinatorial Optimization
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 4 60 T / 120 S 6
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The topics and the relevant literature will be announced towards
Literature
the end of the previous semester.
Master Computer Science — Universität Bonn 12

Module Seminar Randomized and Approximation

MA-INF 1206 Algorithms
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Heiko Röglin
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, Prof. Dr. Thomas Kesselheim,
Prof. Dr. Heiko Röglin, PD Dr. Elmar Langetepe,
Dr. Herman Haverkort, Senior Prof. Dr. Marek Karpinski
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to perform individual literature search, critical reading,
understanding, and clear presentation.
Soft skills Presentation of solutions and methods, critical discussion of
applied methods and techniques
Contents Current topics in design and analysis of randomized and
approximation algorithms based on lastest research literature
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 13

Module Lab Combinatorial Algorithms

MA-INF 1207
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Jens Vygen
coordinator
Lecturer(s) All lecturers of Discrete Mathematics
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Competence to implement advanced combinatorial algorithms,
handling nontrivial data structures, testing, documentation.
Advanced software techniques.
Soft skills Efficient implementation of complex algorithms, abstract
thinking, documentation of source code
Contents Certain combinatorial algorithms will be chosen each semester.
The precise task will be explained in a meeting in the previous
semester.
Prerequisites Recommended:
MA-INF 1102 – Combinatorial Optimization
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The topics and the relevant literature will be announced towards
Literature
the end of the previous semester
Master Computer Science — Universität Bonn 14

Module Seminar Advanced Topics in Cryptography

MA-INF 1209
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every semester
Module Dr. Michael Nüsken
coordinator
Lecturer(s) Dr. Michael Nüsken
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Understanding research publications, often written tersely.
Distilling this into a presentation. Determination of relevant vs.
irrelevant material. Developing a presentation that fascinates
fellow students.
Soft skills Understanding and presenting material both orally and in visual
media. Motivating other students to participate. Critical
assessment of research results.
Contents A special topic within cryptography, changing from year to year,
is studied in depth, based on current research literature
Prerequisites Required:
MA-INF 1103 – Cryptography
and one further course in cryptography like The Art of
Cryptography or eSecurity.
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature Current cryptographic literature.
Master Computer Science — Universität Bonn 15

Module Randomized Algorithms and Probabilistic Analysis

MA-INF 1213
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Heiko Röglin
coordinator
Lecturer(s) Prof. Dr. Heiko Röglin
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 4.
Technical skills Understanding of models and techniques for the probabilistic
analysis of algorithms as well as for the design and analysis of
randomized algorithms
Soft skills Oral and written presentation of solutions and methods,
abstract thinking
Contents Design and analysis of randomized algorithms
• complexity classes
• Markov chains and random walks
• tail inequalities
• probabilistic method
smoothed and average-case analysis
• simplex algorithm
• local search algorithms
• clustering algorithms
• combinatorial optimization problems
• multi-objective optimization
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• lecture notes
• research articles
• Motwani, Raghavan, Randomized Algorithms, Cambridge
Literature
University Press, 1995
• Mitzenmacher, Upfal, Probability and Computing, Cambridge
University Press, 2nd edition, 2017
Master Computer Science — Universität Bonn 16

Module Seminar Theoretical Foundations of Data Science

MA-INF 1217
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Heiko Röglin
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, Prof. Dr. Thomas Kesselheim,
Prof. Dr. Heiko Röglin, PD Dr. Elmar Langetepe,
Dr. Herman Haverkort
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 17

Module Algorithms and Uncertainty

MA-INF 1218
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every 2 years
Module Prof. Dr. Thomas Kesselheim
coordinator
Lecturer(s) Prof. Dr. Thomas Kesselheim
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Understanding approaches for modeling uncertainty in
algorithmic theory. Designing and analyzing algorithms with
performance guarantees in the context of uncertainty.
Soft skills Oral and written presentation of solutions and methods
Contents • Advanced Online Algorithms
• Markov Decisions Processes
• Stochastic and Robust Optimization
• Online Learning Algorithms and Online Convex Optimization
Prerequisites Recommended:
Solid background in algorithms, calculus, and probability theory.
Specialized knowledge about certain algorithms is not necessary.
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature lecture notes, research articles
Master Computer Science — Universität Bonn 18

Module Seminar Algorithmic Game Theory

MA-INF 1219
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Thomas Kesselheim
coordinator
Lecturer(s) Prof. Dr. Thomas Kesselheim
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to perform individual literature search, critical reading,
and clear didactic presentation
Contents Advanced topics in Algorithmic Game Theory and Algorithmic
Mechanism Design based on current conference and journal
papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 19

Module Seminar Algorithms for Computational Analytics

MA-INF 1220
Workload Credit points Duration Frequency
120 h 4 CP 1 semester at least every year
Module Prof. Dr. Petra Mutzel
coordinator
Lecturer(s) Prof. Dr. Petra Mutzel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to perform individual literature search, critical reading,
understanding, and clear didactic presentation.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current topics in algorithms for computational analytics based
on recent research literature.
Prerequisites Recommended:
Interest in Algorithms
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 20

Module Lab Computational Analytics

MA-INF 1221
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Petra Mutzel
coordinator
Lecturer(s) Prof. Dr. Petra Mutzel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to design, analyze and implement efficient algorithms for
computational analytics problems. The LAB also includes
experimental evaluation and documentation of the implemented
software.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents Design of efficient exact and approximate algorithms and data
structures for computational analytics problems.
Prerequisites Recommended:
Interests in algorithms
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 21

Module Lab High Performance Optimization

MA-INF 1222
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Petra Mutzel
coordinator
Lecturer(s) Prof. Dr. Petra Mutzel, Dr. Sven Mallach
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to design, analyze and implement algorithms for
computational analytics and optimization problems. The lab
also includes experimental evaluation and documentation of the
implemented software.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 22

Module Privacy Enhancing Technologies

MA-INF 1223
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Dr. Michael Nüsken
coordinator
Lecturer(s) Dr. Michael Nüsken
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Knowledge: Cryptographic schemes for enhancing privacy,
underlying security notions, applications and restrictions.
Skills: Secure application of sophisticated cryptographic
schemes. Evaluation of their correctness, efficiency and security
in an application setting.
Soft skills Competences: Ability to assess schemes and their use in
applications. Critical assessment of applications.
Contents With more and more data available a clear separation of
sensitive data is necessary and needs to be protected. Some of
that data must stay within strict environments, for examples
hospitals must store certain highly sensitive medical information
about patients but they are not allowed to store it outside its
own facilities. Some of that data is stored or collected in a cloud
environment in encrypted form, say data from a medical device
or a smart home. But it shall still be possible to derive
important conclusions from it, for example to send immediate
help to a patient suffering a heart attack.
Innovative solutions are needed in this area of tension. The
research in cryptography provides some highly sophisticated
tools for solving the like problems.
• Fully homomorphic encryption (FHE).
• Zero-Knowledge techniques, in particular: Non-interactive
zero-knowledge proof (NIZKs).
• Secure multi-party computations (MPC).
• Anonymisation, TOR. Pseudonymization. Blinding.
• Weaker privacy notions, like differential privacy.
Prerequisites Recommended:
Basic knowledge in cryptography is highly recommended.
A profound mathematical background does help. In particular,
precise mathematical formulation and reasoning are important,
but also topics like elementary number theory and discrete
mathematics, especially lattices, are interesting.
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 23

Module Algorithmic Game Theory

MA-INF 1301
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every 2 years
Module Prof. Dr. Thomas Kesselheim
coordinator
Lecturer(s) Prof. Dr. Thomas Kesselheim,
Senior Prof. Dr. Marek Karpinski
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Knowledge of fundamental results in (algorithmic) game theory
and (algorithmic) mechanism design. Techniques and methods
related to mathematical modeling of strategic agents. Analyzing
and designing systems of strategic agents, with a focus on
computational efficiency and performance guarantees.
Soft skills Presentation of solutions and methods, critical discussion of
applied methods and techniques
Contents • basic game theory
• computability and hardness of equilibria
• convergence of dynamics of selfish agents
• (bounds on the) loss of performance due to selfish behavior
• designing incentive-compatible auctions
• maximizing revenue
• designing mechanisms for stable and fair allocations without
money
Prerequisites Recommended:
Introductory knowledge of foundations of algorithms and
complexity theory is essential.
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• N. Nisan, T. Roughgarden, E. Tardos, V.V. Vazirani (ed.):
Algorithmic Game Theory, Cambridge Univ. Press, 2007
• T. Roughgarden, Twenty Lectures on Algorithmic Game
Theory, Cambridge Univ. Press, 2016
• A. Karlin, Y. Peres, Game Theory, Alive, AMS, 2017
Literature • Y. Shoham, K. Leyton-Brown, Multiagent Systems,
Cambridge Univ. Press, 2009
• D. M. Kreps: A Course in Microeconomic Theory, Princeton
Univ. Press, 1990
• M. J. Osborne, A. Rubinstein: A Course in Game Theory,
MIT Press, 2001
Master Computer Science — Universität Bonn 24

Module Seminar Computational Geometry

MA-INF 1304
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Anne Driemel
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, PD Dr. Elmar Langetepe,
Dr. Herman Haverkort
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2-4.
Technical skills To independently study problems at research level, based on
research publications, to prepare a concise summary, to present
the summary in a scientific talk, to lead a critical discussion
with other seminar participants.
Soft skills
Contents Current topics in computational geometry.
Prerequisites Recommended:
BA-INF 114 – Grundlagen der algorithmischen Geometrie
MA-INF 1203 – Discrete and Computational Geometry
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media Multimedia projector, black board.
Literature The relevant literature will be announced.
Master Computer Science — Universität Bonn 25

Module Graduate Seminar on Applied Combinatorial

MA-INF 1305 Optimization
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Jens Vygen
coordinator
Lecturer(s) All lecturers of Discrete Mathematics
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills Competence to understand new theoretical results and practical
solutions in VLSI design and related applications, as well as
presentation of such results
Soft skills Ability to read and understand research papers, abstract
thinking, presentation of mathematical results in a talk
Contents Current topics in chip design and related applications
Prerequisites Recommended:
At least 1 of the following:
MA-INF 1102 – Combinatorial Optimization
MA-INF 1202 – Chip Design
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 4 60 T / 120 S 6
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The topics and the relevant literature will be announced towards
Literature
the end of the previous semester
Master Computer Science — Universität Bonn 26

Module Seminar Advanced Algorithms

MA-INF 1307
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Thomas Kesselheim
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, Prof. Dr. Thomas Kesselheim,
Prof. Dr. Heiko Röglin, PD Dr. Elmar Langetepe,
Dr. Herman Haverkort
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills Presentation of selected advanced topics in algorithm design and
various applications
Soft skills Ability to perform individual literature search, critical reading,
understanding, and clear didactic presentation
Contents Advanced topics in algorithm design based on newest research
literature
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 27

Module Lab Algorithms for Chip Design

MA-INF 1308
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Jens Vygen
coordinator
Lecturer(s) All lecturers of Discrete Mathematics
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills Competence to implement algorithms for VLSI design, efficient
handling of very large instances, testing, documentation.
Advanced software techniques.
Soft skills Efficient implementation of complex algorithms, abstract
thinking, modelling of optimization problem in VLSI design,
documentation of source code
Contents A currently challenging problem will be chosen each semester.
The precise task will be explained in a meeting in the previous
semester.
Prerequisites Recommended:
At least 3 of the following:
MA-INF 1102 – Combinatorial Optimization
MA-INF 1202 – Chip Design
MA-INF 1205 – Graduate Seminar Discrete Optimization
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The topics and the relevant literature will be announced towards
Literature
the end of the previous semester
Master Computer Science — Universität Bonn 28

Module Lab Efficient Algorithms: Design, Analysis and

MA-INF 1309 Implementation
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every year
Module Prof. Dr. Heiko Röglin
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, Prof. Dr. Thomas Kesselheim,
Prof. Dr. Heiko Röglin, PD Dr. Elmar Langetepe,
Dr. Herman Haverkort
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills Ability to design, analyze and implement efficient algorithms for
selected computational problems.
Soft skills ability to work on advanced algorithmic implementation
projects, to work in small teams, clear didactic presentation and
critical discussion of results
Contents Design of efficient exact and approximate algorithms and data
structures for selected computational problems.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 29

Module Online Motion Planning

MA-INF 1314
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module PD Dr. Elmar Langetepe
coordinator
Lecturer(s) Prof. Dr. Rolf Klein, PD Dr. Elmar Langetepe
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-4.
Technical skills To acquire fundamental knowledge on topics and methods in
online motion planning
Soft skills
Contents Search and exploration in unknown environments (e.g., graphs,
cellular environmwents, polygons, strets), online algorithms,
competitive analysis, competitive complexity,functional
optimization, shortest watchman route, tethered robots, marker
algorithms, spiral search, approximation of optimal search paths.
Prerequisites Recommended:
BA-INF 114 – Grundlagen der algorithmischen Geometrie
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Java applets of geometry lab
Literature Scientific research articles will be recommended in the lecture.
Master Computer Science — Universität Bonn 30

Module Lab Computational Geometry

MA-INF 1315
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Anne Driemel
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, PD Dr. Elmar Langetepe,
Dr. Herman Haverkort
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to design, analyze, implement and document efficient
algorithms for selected problems in computational geometry.
Soft skills Ability to properly present, defend and discuss design and
implementation decisions, to document software according to
given rules and to collaborate with other students in small
groups.
Contents Various problems in computational geometry.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 31

Module Lab Cryptography

MA-INF 1316
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Dr. Michael Nüsken
coordinator
Lecturer(s) Dr. Michael Nüsken
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of Cryptography, including test and documentation of
the implemented software/system.
Soft skills Ability to properly present and defend
design decisions, to prepare readable documentation of software;
skills in constructively collaborating with others in small teams
over a longer period of time; ability to classify ones own results
into the state-of-the-art of the resp. area
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 32

Module Lab Advanced Algorithms

MA-INF 1320
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every 2 years
Module Prof. Dr. Thomas Kesselheim
coordinator
Lecturer(s) Prof. Dr. Thomas Kesselheim, Prof. Dr. Heiko Röglin
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Implementation of algorithms from advanced algorithmic theory,
evaluating these algorithm on suitably chosen instances, and
discussing how theoretical results transfer to practice.
Soft skills Ability to properly present, defend and discuss design and
implementation decisions and observed conclusions, and to
collaborate with other students in small groups.
Contents Various problems from current research and courses on
algorithmic theory.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature The relevant literature will be announced in time.
Master Computer Science — Universität Bonn 33

Module Binary Linear and Quadratic Optimization

MA-INF 1321
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Dr. Sven Mallach
coordinator
Lecturer(s) Dr. Sven Mallach
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Deeper understanding of computational methods to solve
potentially large-scale mixed-integer programs in practice.
Application-specific modelling and reformulation of
combinatorial optimization problems, handling quadratic
objective functions, algorithm design.
Soft skills Social, methodological, and analytical competences via
communication, own development, presentation, and critical
assessment of problem formulations, algorithms, and solutions
covered in the course or the excercises. Learning to abstract, but
also learning the limitations of abstraction.
Contents Computational methods in (mixed-)integer programming such as
cutting plane separation and branch-and-bound along with a
short and accessible introduction into their theoretical basis.
Study of practically relevant binary linear and binary quadratic
optimization problems, e.g., Maximum Cut, Linear Ordering
and variants of the Traveling Salesman problem, along with the
particular separation problems arising there. If there is time,
linearizations of quadratic objective functions and more
sophisticated formulations of binary quadratic problems are
discussed.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 34

Module Seminar Focus Topics in High Performance

MA-INF 1322 Computing
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Estela Suarez
coordinator
Lecturer(s) Prof. Dr. Estela Suarez
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to perform individual literature search, critical reading,
understanding, prepare a concise summary, and clear didactic
presentation
Soft skills Ability to present and critically discuss these results in the
framework of the corresponding area
Contents General topics and trends in high performance computing, based
on recent review and research literature
Prerequisites Recommended:
Interest in High Performance Computing
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature and further information about this seminar will be
Literature
announced in time in the website of lecturer.
Master Computer Science — Universität Bonn 35

Module Computational Topology

MA-INF 1323
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every 2 years
Module Prof. Dr. Anne Driemel
coordinator
Lecturer(s) Prof. Dr. Anne Driemel, Dr. Benedikt Kolbe
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Knowledge of fundamental theorems and concepts in the area of
computational topology in particular, persistent homology and
topological data analysis; design and analysis of combinatorial
algorithms in topological contexts; analysis of the complexity; to
apply this knowledge autonomously to solving new problems and
analysing new data sets.
Soft skills Social competence (communication, presenting one’s own
solutions, goal-oriented discussions in teams), methodical
competence (analysis, abstraction, proofs), individual
competence (commitment and willingness to learn, creativity,
perseverance).
Contents Fundamental concepts of relative homology and cohomology
theory and persistence theory in computational settings,
category theory in this context, algorithms for the computation
of (persistent) homology, (extended) persistence modules and
their decompositions, Morse theory, duality theorems, quiver
representation theory, stability of persistence diagrams and
barcodes, algebraic stability, topological filtrations,
multiparameter persistence, invariants of persistence, topological
data analysis, applications to shape pattern recognition,
machine learning, identification of geometric objects.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
• Herbert Edelsbrunner, John Harer (2010). Computational
Topology: An Introduction. American Mathematical Society.
• Steve Oudot (2015). Persistence Theory: From Quiver
Representations to Data Analysis (Vol. 209). American
Literature Mathematical Society.
• Magnus Bakke Botnan, Michael Lesnick (2022). An
Introduction to Multiparameter Persistence.
• Allen Hatcher (2002). Algebraic Topology (Vol. 44).
Cambridge University Press.
Master Computer Science — Universität Bonn 36

2 Graphics, Vision, Audio

MA-INF 2113 L2E2 6 CP Foundations of Audio Signal Processing . . . . . . . . . . . . . . . . 37

MA-INF 2201 L4E2 9 CP Computer Vision . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
MA-INF 2203 L4E2 9 CP Selected Topics in Signal Processing . . . . . . . . . . . . . . . . . . . . 39
MA-INF 2206 Sem2 4 CP Seminar Vision . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
MA-INF 2207 Sem2 4 CP Seminar Graphics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
MA-INF 2208 Sem2 4 CP Seminar Audio . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
MA-INF 2209 L4E2 9 CP Advanced Topics in Computer Graphics I . . . . . . . . . . . . . . 43
MA-INF 2212 L2E2 6 CP Pattern Matching and Machine Learning for Audio Signal
Processing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
MA-INF 2213 L3E1 6 CP Computer Vision II . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 45
MA-INF 2214 L2E2 6 CP Computational Photography . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
MA-INF 2215 Sem2 4 CP Seminar Digital Material Appearance . . . . . . . . . . . . . . . . . . 47
MA-INF 2216 Lab4 9 CP Lab Visual Computing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 48
MA-INF 2217 L2E2 6 CP Advanced Deep Learning for Graphics . . . . . . . . . . . . . . . . . 49
MA-INF 2218 L2E2 6 CP Video Analytics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
MA-INF 2219 Sem2 4 CP Seminar Visualization and Medical Image Analysis . . . . . 51
MA-INF 2220 Lab4 9 CP Lab Visualization and Medical Image Analysis . . . . . . . . . 52
MA-INF 2221 Sem2 4 CP Seminar Visual Computing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
MA-INF 2222 L4E2 9 CP Visual Data Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
MA-INF 2307 Lab4 9 CP Lab Vision . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
MA-INF 2308 Lab4 9 CP Lab Graphics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
MA-INF 2309 Lab4 9 CP Lab Audio . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
MA-INF 2310 L4E2 9 CP Advanced Topics in Computer Graphics II . . . . . . . . . . . . . 58
MA-INF 2312 L3E1 6 CP Image Acquisition and Analysis in Neuroscience . . . . . . . . 59
MA-INF 2313 L2E2 6 CP Deep Learning for Visual Recognition . . . . . . . . . . . . . . . . . . 60
MA-INF 2314 L4E2 9 CP Image Processing, Search and Analysis I . . . . . . . . . . . . . . . 61
MA-INF 2315 L4E2 9 CP Seminar Computational Photography . . . . . . . . . . . . . . . . . . 62
MA-INF 2316 L4E2 9 CP Lab Digital Material Appearance . . . . . . . . . . . . . . . . . . . . . . 63
MA-INF 2317 L2E2 6 CP Numerical Algorithms for Visual Computing and Machine
Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
Master Computer Science — Universität Bonn 37

Module Foundations of Audio Signal Processing

MA-INF 2113
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module apl. Prof. Dr. Frank Kurth
coordinator
Lecturer(s) apl. Prof. Dr. Frank Kurth, Prof. Dr. Michael Clausen
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1.
Technical skills • Introduction to basic concepts of analog and digital signal
processing;
• Applications in the field of Audio Signal Processing;
• Signal Processing Algorithms;
• Implementing basic Signal Processing Algorithms
Soft skills Solving basic Signal Processing Problems; Implementing Signal
Processing Algorithms using state-of-the-art software
frameworks; Capability to analyze; Time management;
Presentation skills; Discussing own solutions and solutions of
others, and working in groups.
Contents Theoretical introduction to analog and digital Signal Processing;
Fourier Transforms; Analog to digital Conversion; Digital
Filters; Audio Signal Processing Applications; Filter banks;
Windowed Fourier Transform; 2D-Signal Processing
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Slides, Blackboard, Whiteboard
Literature
Master Computer Science — Universität Bonn 38

Module Computer Vision

MA-INF 2201
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Jürgen Gall
coordinator
Lecturer(s) Prof. Dr. Jürgen Gall
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills Students will learn about various mathematical methods and
their applications to computer vision problems.
Soft skills Productive work in small teams, development and realization of
individual approaches and solutions, critical reflection of
competing methods, discussion in groups.
Contents The class will cover a number of mathematical methods and
their applications in computer vision. For example, linear filters,
edges, derivatives, Hough transform, segmentation, graph cuts,
mean shift, active contours, level sets, MRFs, expectation
maximization, background subtraction, temporal filtering, active
appearance models, shapes, optical flow, 2d tracking, cameras,
2d/3d features, stereo, 3d reconstruction, 3d pose estimation,
articulated pose estimation, deformable meshes, RGBD vision.
Prerequisites Recommended:
Basic knowledge of linear algebra, analysis, probability theory,
C++ programming
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• R. Hartley, A. Zisserman: Multiple View Geometry in
Computer Vision
Literature
• R. Szeliski: Computer Vision: Algorithms and Applications
• S. Prince: Computer Vision: Models, Learning, and Inference
Master Computer Science — Universität Bonn 39

Module Selected Topics in Signal Processing

MA-INF 2203
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module apl. Prof. Dr. Frank Kurth
coordinator
Lecturer(s) apl. Prof. Dr. Frank Kurth, Prof. Dr. Michael Clausen
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Learning advanced as well as state of the art topics and
techniques in digital signal processing. Study examples from the
field of digital audio signal processing with a focus on music
audio. Develop skills for analysing audio signals and designing
audio features for selected application scenarios. Mathematical
modelling of signal processing problems in practical applications.
Design and implementation of corresponding algorithms and
data structures solving those problems. Efficiency issues.
Soft skills Capability to analyze. Time management. Strength of purpose.
Discussing own solutions and solutions of others.
Contents Advanced techniques for filter design, design and extraction of
features describing multimedia signals, efficient DSP algorithms,
general concepts for content-based analysis of multimedia
signals. Selected signal processing applications, for example
content-based music analysis, signal compression, denoising,
source separation.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• Lecture script and selected research publications
• Hayes: Statistical Digital Signal Processing and Modelling,
John Wiley, 1996
Literature • Proakis, Manolakis: Digital Signal Processing, Prentice Hall,
1996
• Klapuri, Davy: Signal Processing, Methods for Music
Transcription, Springer, 2006
Master Computer Science — Universität Bonn 40

Module Seminar Vision

MA-INF 2206
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every semester
Module Prof. Dr. Jürgen Gall
coordinator
Lecturer(s) Prof. Dr. Jürgen Gall
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers.
Prerequisites Required:
MA-INF 2201 – Computer Vision
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 41

Module Seminar Graphics

MA-INF 2207
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every semester
Module Prof. Dr. Reinhard Klein
coordinator
Lecturer(s) Prof. Dr. Reinhard Klein
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers.
Prerequisites Recommended:
Mathematical background (multidimensional analysis and linear
algebra, basic numerical methods)
Basic knowledge in Computer Graphics
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 42

Module Seminar Audio

MA-INF 2208
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every semester
Module apl. Prof. Dr. Frank Kurth
coordinator
Lecturer(s) apl. Prof. Dr. Frank Kurth, Dr. Michael Clausen
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 43

Module Advanced Topics in Computer Graphics I

MA-INF 2209
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Reinhard Klein
coordinator
Lecturer(s) Prof. Dr. Reinhard Klein
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Analytical formulation of problems related to rendering. Knowledge of
principles, techniques and algorithms to
• recognize and understand the physical quantities of light transport
• explain a range of surface and volumetric material models
• explain the rendering and radiative transfer equations
• design and implement methods to solve these equations, especially Monte
Carlo methods
• Assess / Evaluate the performance and conceptual limits of the
implemented simulation code
Soft skills Based on the knowledge and skills acquired students should be able to
• read and judge current scientific literature in the area of rendering
• identify the major literature concerning a given problem in rendering and
gain an overview of the current state of the art
• discuss problems concerning rendering with researchers from different
application fields
• present, propose and communicate different solutions and work in a team
to solve a rendering problem
Contents This course introduces the basic physical quantities as well as the
mathematical and algorithmic tools required to understand and simulate the
light interaction with objects and different materials in a 3D scene. We will
discuss how to solve the mathematical problem numerically in order to
create realistic images. Advanced topics include participating media,
material models for sub-surface light transport, and Markov Chain Monte
Carlo Methods. Topics among others will be
• rendering and radiative transfer equation
• methods and algorithms to solve these equations, radiosity, Monte Carlo,
photon mapping
• analytical and data driven surface and subsurface material models,
especially BRDF, BSSRDF models
• differentiable rendering
In addition, results from state-of-the-art research will be presented.
Prerequisites Recommended:
Recommended but not enforced: basic knowledge in computer graphics,
(numerical) analysis and linear algebra, C++
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• M. Pharr, W. Jakob, and G. Humphreys, Physically Based Rendering:
From Theory to Implementation (3rd edition), 2018
• L. Szirmay-Kalos: Monte-Carlo Methods in Global Illumination, Institute
of Computer Graphics, Vienna University of Technology, Vienna, 1999 URL:
Literature
https://cg.iit.bme.hu/~szirmay/script.pdf
• P. Dutre, K. Bala, P. Bekaert: Advanced Global Illumination, 2nd ed.,
B&T, 2006
• D’Eon, Eugene. A Hitchhiker’s Guide to Multiple Scattering, 2016
Master Computer Science — Universität Bonn 44

Module Pattern Matching and Machine Learning for Audio

MA-INF 2212 Signal Processing
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module apl. Prof. Dr. Frank Kurth
coordinator
Lecturer(s) apl. Prof. Dr. Frank Kurth, Prof. Dr. Michael Clausen
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills • Introduction into selected topics of digital signal processing;
• Applications in the field of Audio Signal Processing;
• Methods of Automatic Pattern Recognition
Soft skills Audio Signal Processing Applications; Extended programming
skills for signal processing applications; Capability to analyze;
Time management; Presentation skills; Discussing own solutions
and solutions of others, and working in groups.
Contents The lecture is presented in modular form, where each module is
motivated from the application side. The presented topics are:
Windowed Fourier transforms; Audio Identifications; Audio
Matching; Signal Classification; Hidden Markov Models;
Support Vector Machines
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Slides, Blackboard, Whiteboard
Literature
Master Computer Science — Universität Bonn 45

Module Computer Vision II

MA-INF 2213
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Jürgen Gall
coordinator
Lecturer(s) Prof. Dr. Jürgen Gall
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Students will learn about various learning methods and their
applications to computer vision problems.
Soft skills Productive work in small teams, development and realization of
individual approaches and solutions, critical reflection of
competing methods, discussion in groups.
Contents The class will cover a number of learning methods and their
applications in computer vision. For example, linear methods for
classification and regression, boosting, random forests, neural
networks, SVMs, prototype methods, nearest neighbors,
Gaussian processes, metric learning, structured learning, image
classification, object detection, action recognition, pose
estimation, face analysis, tracking.
Prerequisites Required:
MA-INF 2201 – Computer Vision
Teaching format Group size h/week Workload[h] CP
Format Lecture 3 45 T / 45 S 3
Exercises 1 15 T / 75 S 3
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 46

Module Computational Photography

MA-INF 2214
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Matthias Hullin
coordinator
Lecturer(s) Prof. Dr. Matthias Hullin
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Foundations in optics and image sensors. Signal processing and
inverse problems in imaging. Color spaces and perception.
Image alignment and blending. High-dimensional
representations of light transport (light fields, reflectance fields,
reflectance distributions). Computational illumination.
Soft skills • to read and understand current literature in the field
• to implement standard computational photography techniques
• to propose and implement solutions to a given problem
• to follow good scientific practice by planning, documenting
and communicating their work
Contents • Image sensors
• Optics
• Panoramas
• Light fields
• Signal processing and inverse problems
• Color, perception and HDR
• Reflectance fields and light transport matrices
Prerequisites Required:
Basic knowledge in computer graphics, data structures,
multidimensional analysis und linear algebra, numerical analysis
and numerical linear algebra, C++ or MATLAB
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 47

Module Seminar Digital Material Appearance

MA-INF 2215
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Matthias Hullin
coordinator
Lecturer(s) Prof. Dr. Matthias Hullin
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 48

Module Lab Visual Computing

MA-INF 2216
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Jun.-Prof. Dr. Florian Bernard
coordinator
Lecturer(s) Jun.-Prof. Dr. Florian Bernard
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-3.
Technical skills Students will carry out a practical task (project) in the context
of visual computing, including test and documentation of the
implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area.
Contents This lab introduces visual computing methods and applications.
You will get a chance to study the methods in depth by
implementing them and running experiments. At the end of the
semester, you will present the method, give a short
demonstration and hand in a report describing the method and
experimental outcomes.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 49

Module Advanced Deep Learning for Graphics

MA-INF 2217
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Reinhard Klein
coordinator
Lecturer(s) Dr. Michael Weinmann
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-4.
Technical skills Students will be introduced to adapt and apply deep learning
techniques to various applications in computer graphics.
Soft skills Productive work in small teams, development and realization of
individual approaches and solutions, critical reflection of
competing methods, discussion in groups.
Contents This course focuses on cutting-edge Deep Learning techniques
for computer graphics. After a brief review of CNNs the focus
will be laid on autoencoders, generative models and the
extension of these methods to graph- and manifold-structured
data. Applications discussed will include inverse problems in
computer graphics and the synthesis of models including data
completion and super-resolution.
Prerequisites Recommended:
The course will build upon the basics of machine learning as well
as fundamentals and basic architectures of neural networks.
Therefore, it is highly recommended to have taken Deep
Learning for Visual Recognition or a similar course as a
prerequisite. Exercises will be a mix of theory and practical
(Python).
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature No required text, supplemental readings will be given in class.
Master Computer Science — Universität Bonn 50

Module Video Analytics

MA-INF 2218
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Prof. Dr. Jürgen Gall
coordinator
Lecturer(s) Prof. Dr. Jürgen Gall
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2-4.
Technical skills Students will learn advanced techniques for analyzing video data.
Soft skills Productive work in small teams, development and realization of
a state-of-the-art system for video analysis.
Contents The class will discuss state-of-the-art methods for several tasks
of video analysis. For example, video clip classification, temporal
video segmentation, spatio-temporal action detection, video
context, spatio-temporal modeling of humans and objects,
anticipation, affordance, video summarization, semantic video
segmentation.
Prerequisites Required:
MA-INF 2201 – Computer Vision
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 51

Module Seminar Visualization and Medical Image Analysis

MA-INF 2219
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every semester
Module Prof. Dr. Thomas Schultz
coordinator
Lecturer(s) Prof. Dr. Thomas Schultz
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss scientific results in the
context of the current state of the art. Ability to perform an
independent search for relevant scientific literature.
Contents Current conference and journal papers
Prerequisites Recommended:
At least one of the following:
• MA-INF 2222 – Visual Data Analysis
• MA-INF 2312 – Image Acquisition and Analysis in
Neuroscience
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 52

Module Lab Visualization and Medical Image Analysis

MA-INF 2220
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Thomas Schultz
coordinator
Lecturer(s) Prof. Dr. Thomas Schultz
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills The students will carry out a practical task (project) in the
context of data visualization and visual analytics or medical
image analysis, including test and documentation of the
implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents
Prerequisites Recommended:
At least one of the following:
• MA-INF 2222 – Visual Data Analysis
• MA-INF 2312 – Image Acquisition and Analysis in
Neuroscience
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 53

Module Seminar Visual Computing

MA-INF 2221
Workload Credit points Duration Frequency
120 h 4 CP 1 semester at least every year
Module Jun.-Prof. Dr. Florian Bernard
coordinator
Lecturer(s) Jun.-Prof. Dr. Florian Bernard
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers.
Prerequisites Required:
No formal requirements. Participants are expected to have some
previous exposure to at least one of the following:
- visual computing (e.g. computer vision, computer graphics, 3D
shape analysis, image analysis, etc.),
- mathematical optimisation (e.g. combinatorial/continuous,
convex/non-convex, etc.), or
- machine learning.
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 54

Module Visual Data Analysis

MA-INF 2222
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Thomas Schultz
coordinator
Lecturer(s) Prof. Dr. Thomas Schultz
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-4.
Technical skills Ability to design, implement, and make proper use of systems
for visual data analysis. Knowledge of algorithms and
techniques for the visualization of multi-dimensional data,
graphs, as well as scalar, vector, and tensor fields.
Soft skills Productive work in small teams, self-dependent solution of
practical problems in the area of visual data analysis, critical
reflection on visualization design, presentation of solution
strategies and implementations, self management
Contents This class provides a broad overview of principles and
algorithms for data analysis via interactive visualization.
Specific topics include perceptual principles, luminance and
color, visualization analysis and design, integration of visual
with statistical data analysis and machine learning, as well as
specific algorithms and techniques for the display of
multidimensional data, dimensionality reduction, graphs, direct
and indirect volume visualization, vector field and flow
visualization, as well as tensor field visualization.
Prerequisites Recommended:
Students are recommended to have a basic knowledge in linear
algebra and calculus, as well as proficiency in programming.
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
A.C. Telea, Data Visualization: Principles and Practice. CRC
Press, Second Edition, 2015
M. Ward et al., Interactive Data Visualization: Foundations,
Literature
Techniques, and Applications. CRC Press, 2010
T. Munzner, Visualization Analysis and Design, A K Peters,
2015
Master Computer Science — Universität Bonn 55

Module Lab Vision

MA-INF 2307
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Jürgen Gall
coordinator
Lecturer(s) Prof. Dr. Jürgen Gall
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of RGB-D cameras.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents RGBD cameras: research topics and applications
Prerequisites Required:
MA-INF 2201 – Computer Vision
Good C++ programming skills
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
A. Fossati, J. Gall, H. Grabner, X. Ren, K. Konolige. Consumer
Literature Depth Cameras for Computer Vision: Research Topics and
Applications
Master Computer Science — Universität Bonn 56

Module Lab Graphics

MA-INF 2308
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Reinhard Klein
coordinator
Lecturer(s) Prof. Dr. Reinhard Klein
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills The students will carry out a practical task (project) in the
context of geometry processing, rendering, scientific visualization
or human computer interaction, including test and
documentation of the implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents Varying selected topics close to current research in the area of
geometry processing, rendering, scientific visualization or human
computer interaction.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 57

Module Lab Audio

MA-INF 2309
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module apl. Prof. Dr. Frank Kurth
coordinator
Lecturer(s) apl. Prof. Dr. Frank Kurth, Prof. Dr. Michael Clausen
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills The students will carry out a practical task (project) in the
context of audio and music processing, including test and
documentation of the implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area.
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 58

Module Advanced Topics in Computer Graphics II

MA-INF 2310
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Reinhard Klein
coordinator
Lecturer(s) Prof. Dr. Reinhard Klein
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills Analytical formulation of problems related to geometry processing:
• apply methods of geometry processing
• apply basic concepts of statistical shape analysis and shape spaces to
real world applications
• Design and implement novel application software in this area
Soft skills Based on the knowledge and skills acquired students should be able to
• read and judge current scientific literature in the area of geometry
processing and gain an overview of the current state of the art
• identify the major literature relevant for solving a given problem in
geometry processing
• present, propose and communicate different solutions and work in a
team to solve geometry processing problems
• discuss geometry processing problems with researchers from different
application fields
Contents This course will first introduce the mathematical and algorithmic tools
required to represent, model, and process 3D geometric objects. The
second part discusses the latest mathematical, algorithmic, and
statistical tools required for the analysis and modeling of 3D shape
variability, which can facilitate the creation of 3D models. Topics
among others will be
• classical and discrete differential geometry of curves and surfaces
• mesh data structures and generation of meshes from point clouds
• Laplacian operator and optimization techniques with applications to
denoising, smoothing, decimation, shape fitting, shape descriptors,
geodesic distances
• parameterization and editing of surfaces
• point cloud registration
• correspondences
• shape spaces and statistical shape analysis
In addition, results from state-of-the-art research will be presented.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• M. Botsch, L. Kobbelt, M. Pauly, P. Alliez, B. Levy, Polygon Mesh,
Processing, A K Peters, 2010
• Laga, Hamid, Yulan Guo, Hedi Tabia, Robert B. Fisher, and
Literature Mohammed Bennamoun. 3D Shape analysis: fundamentals, theory,
and applications. John Wiley & Sons, 2018.
• Solomon, Justin. Numerical Algorithms. Textbook published by AK
Peters/CRC Press, 2015
Master Computer Science — Universität Bonn 59

Module Image Acquisition and Analysis in Neuroscience

MA-INF 2312
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Prof. Dr. Thomas Schultz
coordinator
Lecturer(s) Prof. Dr. Thomas Schultz
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-4.
Technical skills Students will learn about image acquisition and analysis
pipelines which are used in neuroscience. They will understand
algorithms for image reconstruction, artifact removal, image
registration and segmentation, as well as relevant statistical and
machine learning techniques. A particular focus will be on data
from Magnetic Resonance Imaging and on mathematical models
for functional and diffusion MRI data.
Soft skills Productive work in small teams, self-dependent solution of
practical problems in the area of biomedical image processing,
presentation of solution strategies and implementations, self
management, critical reflection of conclusions drawn from
complex experimental data.
Contents This course covers the full image formation and analysis pipeline
that is typically used in biomedical studies, from image
acquisition to image processing and statistical analysis.
Prerequisites Recommended:
Mathematical background (calculus, linear algebra, statistics);
imperative programming.
Teaching format Group size h/week Workload[h] CP
Format Lecture 3 45 T / 45 S 3
Exercises 1 15 T / 75 S 3
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• B. Preim, C. Botha: Visual Computing for Medicine: Theory,
Algorithms, and Applications. Morgan Kaufmann, 2014
• R.A. Poldrack, J.A. Mumford, T.E. Nichols: Handbook of
Literature Functional MRI Data Analysis. Cambridge University Press,
2011
• D.K. Jones: Diffusion MRI: Theory, Method, and
Applications, Oxford University Press, 2011
Master Computer Science — Universität Bonn 60

Module Deep Learning for Visual Recognition

MA-INF 2313
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Reinhard Klein
coordinator
Lecturer(s) Dr. Michael Weinmann
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-4.
Technical skills Students will be introduced to the theory of neural networks and
study various applications in computer vision and other topics in
AI.
Soft skills Productive work in small teams, development and realization of
individual approaches and solutions, critical reflection of
competing methods, discussion in groups.
Contents Deep learning has taken over the machine learning community
by storm, with success both in research and commercially. Deep
learning is applicable over a range of fields such as computer
vision, speech recognition, natural language processing, robotics,
etc. This course will introduce the fundamentals of neural
networks and then progress to state-of-the-art convolutional and
recurrent neural networks as well as their use in applications for
visual recognition. Students will get a chance to learn how to
implement and train their own network for visual recognition
tasks such as object recognition, image segmentation and
caption generation.
Prerequisites Recommended:
Students are recommended to have a basic knowledge in
probability and statistics and linear algebra as well as
proficiency in programming (python or Matlab or C++).
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
No required text. Supplemental readings will be provided in the
Literature
lecture.
Master Computer Science — Universität Bonn 61

Module Image Processing, Search and Analysis I

MA-INF 2314
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Christian Bauckhage
coordinator
Lecturer(s) Prof. Dr. Christian Bauckhage
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Upon completion, students should be able to
• implement basic and advanced methods for digital image
processing
• implement simple and advanced algorithms for image filtering
• implement algorithms for creating artistic image effects
• implement algorithms for image warping
• implement algorithms for image morphing
• implement algorithms for color and intensity manipulation
• design and implement their own algorithms for image
processing
Soft skills Students will learn about the mathematical and algorithmic
foundations of digital image processing and raster graphics
editing. They will learn about the basic concepts and procedures
in this area and to implement them on their own.
Contents • technical foundations / hardware aspects of digital
photography
• mathematical representations of digital images
• coordinate systems and coordinate transformations
• Fourier transforms and convolutions
• low- band-, and high pass filtering
• mean- and Gaussian filtering
• median filtering and morphological operations
• efficient implementations of various kinds of filters
• interpolation methods
• artistic image effects
• image warping
• image morphing
• physiological foundations of color perception
• color spaces
• color manipulation
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media • lecture slides are made available online
• lecture notes with programming examples are made available
online
• Gonzales and Woods, "Digital Image Processing"
Literature
• Jähne, "Digital Image Processing"
Master Computer Science — Universität Bonn 62

Module Seminar Computational Photography

MA-INF 2315
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Matthias Hullin
coordinator
Lecturer(s) Prof. Dr. Matthias Hullin
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills
Soft skills
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 63

Module Lab Digital Material Appearance

MA-INF 2316
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Matthias Hullin
coordinator
Lecturer(s) Prof. Dr. Matthias Hullin
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills
Soft skills
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 64

Module Numerical Algorithms for Visual Computing and

MA-INF 2317 Machine Learning
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Jun.-Prof. Dr. Florian Bernard
coordinator
Lecturer(s) Jun.-Prof. Dr. Florian Bernard
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills • ability to implement basic numerical algorithms,
understanding their strengths and shortcomings
• mathematical modelling of computational problems in visual
computing and machine learning
• gain an intuition which algorithm is best applied for which
problem in visual computing and machine learning, so that
practical problems in these areas can be solved
Soft skills • problem solving skills: ability to identify and utilise analogies
between new problems and previously seen ones
• analytical and abstract thinking: develop a general intuition of
computational problems, being able to adopt different
perspectives of particular concepts
Contents This module focuses on numerical methods that frequently occur
in the fields visual computing (VC) and machine learning (ML).
In addition to algorithms, this module will also cover modelling
aspects that are relevant for solving practical problems in VC
and ML. The contents include:
• Error analysis and conditioning of problems
• Linear systems (solvability, algorithms, stability,
regularisation), and applications and modelling in VC and ML
(e.g. linear regression, image alignment, deconvolution)
• Spectral methods (eigenvalue decomposition, singular value
decomposition, respective algorithms), and their applications
and modelling in VC and ML (e.g. clustering, Procrustes
analysis, point-cloud alignment, principal components analysis)
• Numerical optimisation (gradient-based methods, second-order
methods, large-scale optimisation) and applications and
modelling in VC and ML.
Prerequisites Required:
No formal prerequisites.
Recommended:
Participants are expected to have a high level of mathematical
maturity (in particular, a good working knowledge of linear
algebra and calculus is essential). A basic understanding of
mathematical optimisation is advantageous.
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 65

3 Information and Communication Management

MA-INF 3108 L2E2 6 CP Secure Software Engineering . . . . . . . . . . . . . . . . . . . . . . . . . . . 66

MA-INF 3109 L2E2 6 CP Quantum Algorithms: Introduction and Data Fusion
Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
MA-INF 3202 L2E2 6 CP Mobile Communication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
MA-INF 3209 Sem2 4 CP Seminar Selected Topics in Communication
Management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
MA-INF 3215 Sem2 4 CP Seminar Selected Topics in Malware Analysis and
Computer/Network Security . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
MA-INF 3216 Sem2 4 CP Seminar Sensor Data Fusion . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
MA-INF 3229 Lab4 9 CP Lab IT-Security . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72
MA-INF 3233 L2E2 6 CP Advanced Sensor Data Fusion in Distributed Systems . . 73
MA-INF 3235 L2E2 6 CP Usable Security and Privacy . . . . . . . . . . . . . . . . . . . . . . . . . . . 74
MA-INF 3236 L2E2 6 CP IT Security . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
MA-INF 3237 L2E2 6 CP Array Signal and Multi-channel Processing . . . . . . . . . . . . . 76
MA-INF 3238 L2E2 6 CP Side Channel Attacks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
MA-INF 3239 L2E2 6 CP Malware Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 78
MA-INF 3304 Lab4 9 CP Lab Communication and Communicating Devices . . . . . . 79
MA-INF 3305 Lab4 9 CP Lab Information Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
MA-INF 3309 Lab4 9 CP Lab Malware Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 81
MA-INF 3310 L2E2 6 CP Introduction to Sensor Data Fusion - Methods and
Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 82
MA-INF 3312 Lab4 9 CP Lab Sensor Data Fusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
MA-INF 3317 Sem2 4 CP Seminar Selected Topics in IT Security . . . . . . . . . . . . . . . . . 84
MA-INF 3319 Lab4 9 CP Lab Usable Security and Privacy . . . . . . . . . . . . . . . . . . . . . . . 85
MA-INF 3320 Lab4 9 CP Lab Security in Distributed Systems . . . . . . . . . . . . . . . . . . . 86
MA-INF 3321 Sem2 4 CP Seminar Usable Security and Privacy . . . . . . . . . . . . . . . . . . . 87
MA-INF 3323 Lab4 9 CP Lab Fuzzing Bootcamp . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
MA-INF 3324 Lab4 9 CP Lab Design of Usable Security Mechanisms . . . . . . . . . . . . . 89
Master Computer Science — Universität Bonn 66

Module Secure Software Engineering

MA-INF 3108
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Dr. Christian Tiefenau
coordinator
Lecturer(s) Dr. Christian Tiefenau, Mischa Meier
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students are introduced to the security-relevant aspects of a
software-engineering lifecycle. Therefore, the main ideas of
including security throughout the development process will be
presented and explained by examples.
By showing common vulnerabilities throughout this course, the
students will get an understanding of common vulnerabilities
and attacks and how to prevent them.
Soft skills In groups, the students will conduct practical exercises to
strengthen the understanding of vulnerabilities and attack
vectors. Through this, the abilities teamwork, time
management, organization and critical discussion of their own
and others’ results are strengthened.
Contents • Threat modeling
• Risk analysis
• Architectural security
• Secure coding
• Applied Cryptography
• Secure configuration and deployment
• Updates and maintenance
Prerequisites Recommended:
Fundamental knowledge in software-engineering and IT-security
concepts.
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature Software Security: Building Security In by Gary McGraw
Master Computer Science — Universität Bonn 67

Module Quantum Algorithms: Introduction and Data

MA-INF 3109 Fusion Examples
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Wolfgang Koch
coordinator
Lecturer(s) Prof. Dr. Wolfgang Koch
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills
Soft skills
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 68

Module Mobile Communication

MA-INF 3202
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Peter Martini
coordinator
Lecturer(s) Prof. Dr. Peter Martini, Dr. Matthias Frank
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Knowledge about key concepts of mobile communication
including mobility management (both technology independent
and technology dependent), knowledge about wireless
technologies and their interaction with other protocol layers
and/or other network technologies, ability to evaluate and assess
scenarios with communication of mobile devices. In-depth
understanding of communication paradigms of wireless/mobile
systems and network elements, productive work in small groups,
strengthening skills on presentation and discussion of solutions
to current challenges
Soft skills Theoretical exercises to support in-depth understanding of
lecture topics and to stimulate discussions, practical exercises in
teamwork to support time management, targeted organisation of
practical work and critical discussion of own and others’ results
Contents Mobility Management in the Internet, Wireless Communication
Basics, Wireless Networking Technologies, Cellular/Mobile
Communication Networks (voice and data communication),
Ad-hoc and Sensor Networks.
Prerequisites Recommended:
Bachelor level knowledge of basics of communication systems
(e.g. BA-INF 101 "Kommunikation in Verteilten Systemen"
(German Bachelor Programme Informatik, English lecture slides
available) and/or MA-INF 3105 – Principles of Distributed
Systems
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• Jochen Schiller: Mobile Communications, Addison-Wesley,
2003
• William Stallings: Wireless Communications and Networking,
Literature
Prentice Hall, 2002
• Further up-to-date literature will be announced in due course
before the beginning of the lecture
Master Computer Science — Universität Bonn 69

Module Seminar Selected Topics in Communication

MA-INF 3209 Management
Workload Credit points Duration Frequency
120 h 4 CP 1 semester at least every year
Module Prof. Dr. Peter Martini
coordinator
Lecturer(s) Prof. Dr. Peter Martini, Prof. Dr. Michael Meier
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers, current standardization
drafts
Prerequisites Required:
Successful completion of at least one of the following lectures:
Principles of Distributed Systems (MA-INF3105), Network
Security (MA-INF3201), Mobile Communication (MA-INF3202),
IT Security (MA-INF3236)
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The relevant literature will be announced towards the end of the
Literature
previous semester
Master Computer Science — Universität Bonn 70

Module Seminar Selected Topics in Malware Analysis and

MA-INF 3215 Computer/Network Security
Workload Credit points Duration Frequency
120 h 4 CP 1 semester at least every year
Module Prof. Dr. Peter Martini
coordinator
Lecturer(s) Prof. Dr. Peter Martini, Prof. Dr. Michael Meier
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers, current standardization
drafts - with a specific topic focus on Malware Analysis,
Computer and Network Security
Prerequisites Required:
Successful completion of at least one of the following lectures:
Principles of Distributed Systems (MA-INF3105), Network
Security (MA-INF3201), Mobile Communication (MA-INF3202),
IT Security (MA-INF3236)
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 71

Module Seminar Sensor Data Fusion

MA-INF 3216
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module P.D. Dr. Wolfgang Koch
coordinator
Lecturer(s) P.D. Dr. Wolfgang Koch
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The relevant literature will be announced at the beginning of the
Literature
seminar.
Master Computer Science — Universität Bonn 72

Module Lab IT-Security

MA-INF 3229
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Michael Meier
coordinator
Lecturer(s) Prof. Dr. Michael Meier
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of IT Security, including test and documentation of the
implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 73

Module Advanced Sensor Data Fusion in Distributed

MA-INF 3233 Systems
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module PD Dr. Wolfgang Koch
coordinator
Lecturer(s) Dr. Felix Govaers
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills For challenging state estimation tasks, algorithms which enhance
the situational awareness by fusing sensor information are
inevitable. Nowadays it has become very popular to improve the
performance of systems by linking multiple sensors. This implies
some challenges to the sensor data fusion methodologies such as
sensor registration, communication delays, and correlations of
estimation errors. In particular, if the communication links have
limited bandwidth, data reduction techniques have to be applied
at the sensor sites, that is local tracks have to be computed.
Once recieved at a fusion center (FC), the tracks then are fused
to reconstruct a global estimate. In this lecture, methodologies
to a achieve a distributed state estimation are considered.
Among these are tracklet fusion, the Bar-Shalom-Campo
formula, the Federated Kalman Filter, naive fusion, the
distributed Kalman filter and the least squares estimate.
Soft skills Mathematical derivation of algorithms, application of
mathematical results on estimation theory.
Contents tracklet fusion, the Bar-Shalom-Campo formula, the Federated
Kalman Filter, naive fusion, the distributed Kalman filter and
the least squares estimate, Accumulated State Densities,
Decorrlated fusion, product representation
Prerequisites Recommended:
At least 1 of the following:
BA-INF 137 – Einführung in die Sensordatenfusion
MA-INF 3310 – Introduction to Sensor Data Fusion - Methods
and Applications
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Power Point
W. Koch: "Tracking and Sensor Data Fusion: Methodological
Framework and Selected Applications", Springer, 2014.
Literature
D. Hall, C.-Y. Chong, J. Llinas, and M. L. II: "Distributed Data
Fusion for Network-Centric Operations", CRC Press, 2014.
Master Computer Science — Universität Bonn 74

Module Usable Security and Privacy

MA-INF 3235
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Matthew Smith
coordinator
Lecturer(s) Prof. Dr. Matthew Smith
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1.
Technical skills Students will be familiar with usability problems of IT security
and privacy mechanisms, understand methods for exploring
usability of IT security and privacy mechanisms as well being
able to design and execute usability studies.
Soft skills • Working with scientific literature
• Communication skills
• Team working skills
Contents The lecture on Usable Security and Privacy deals with many
aspects of human factors and usability in the context of security
and privacy. The lecture includes both the foundations of usable
security and privacy as well as a selection of cutting edge
international research in this area. Topics include:
• Evaluation of usability issues of existing security & privacy
models or technology
• Design and evaluation of new usable security & privacy
technology
• Impact of organizational policy on security and privacy
interaction
• Lessons learned from designing, deploying, managing or
evaluating security & privacy technologies
• Foundations of usable security & privacy
• Methodology for usable security & privacy research
• Ethical, psychological, sociological and economic aspects of
security & privacy technologies
Prerequisites Required:
Knowledge about IT Security is advantageous but not
mandatory.
Recommended:
At least 1 of the following:
BA-INF 138 – IT-Sicherheit
BA-INF 136 – Reaktive Sicherheit
MA-INF 1103 – Cryptography
MA-INF 3229 – Lab IT-Security
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 75

Module IT Security
MA-INF 3236
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Michael Meier
coordinator
Lecturer(s) Prof. Dr. Michael Meier
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills Students are introduced to selected active research fields of IT
security and gain deep knowledge of the research literature.
Students learn selected aspects of IT security. This includes
risks and vulnerabilities of today’s information technology as
well as concepts to increase the level of IT security, their
applications and their weaknesses.
Soft skills Theoretical exercises to support in-depth understanding of
lecture topics and to stimulate discussions, practical exercises in
teamwork to support time management, targeted organization of
practical work and critical discussion of own and others’ results.
Contents • security threats
• advanced network security: internet routing security, network
attack detection, network information hiding
• cryptographic key management
• building automation security
• advanced host security
• security patterns
• privacy and pseudonymization
Prerequisites Required:
Fundamental knowledge in the following areas: operating
systems, networks, security
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 76

Module Array Signal and Multi-channel Processing

MA-INF 3237
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Wolfgang Koch
coordinator
Lecturer(s) Dr. Marc Oispuu
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Localization of multiple sources using passive sensors is a
fundamental task encountered in various fields like wireless
communication, radar, sonar, and seismology. In this lecture, a
unified framework for electromagnetic and acoustic signals and
signal processing techniques are presented. Furthermore, the
sensor calibration, direction finding, and bearings-only
localization problem are considered. Special applications are
emphasized, like small airborne arrays for unmanned aerial
vehicles (UAVs).
Soft skills Mathematical derivation of algorithms, applications of
mathematical results on estimation theory
Contents Estimation theory, Sensor model, Cramér-Rao analysis,
conventional beamforming, Multiple Signal Classification
(MUSIC), sensor calibration, Bearings-only localization, Direct
Position Determination (DPD), Applications
Prerequisites Recommended:
Recommended: F. Kurth: “Foundations of Audio Signal
Processing” (MA-INF 2113)
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral Exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Power Point
H. L. van Trees, Optimum Array Processing. Part IV of
Literature Detection, Estimation, and Modulation Theory. New York:
Wiley-Interscience, 2002.
Master Computer Science — Universität Bonn 77

Module Side Channel Attacks

MA-INF 3238
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Dr. Felix Boes
coordinator
Lecturer(s) Dr. Felix Boes
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills • Students are introduced to theoretical and practical side
channel effects of modern hardware.
• Students learn techniques to utilize these effects to circumvent
security mechanisms.
• This includes covert channels as well as side channel attacks
and microarchitectural attacks on modern CPUs.
Soft skills Theoretical exercises to support in-depth understanding of
lecture topics and to stimulate discussions, practical exercises in
teamwork to support time management, targeted organization of
practical work and critical discussion of own and others’ results.
Contents • Theoretical foundations of side channel effects and attacks as
well as
• covert channels,
• differential power analysis,
• padding oracle,
• RSA timing attacks,
• cache based side channel effects,
• microarchitectural attacks (Spectre)
Prerequisites Recommended:
Fundamental knowledge about IT Security, operating systems
and statistics is advantageous but not mandatory.
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written Exam (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 78

Module Malware Analysis

MA-INF 3239
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every semester
Module Prof. Dr. Peter Martini
coordinator
Lecturer(s) Prof. Dr. Elmar Padilla
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students should be able to analyze the functional scope of a
binary file independently and to describe its damage potential. In
addition, the students should be able to carry out detailed analyzes of
given aspects and to partially automate these with the help of scripts.
Soft skills Presentation of solutions and methods, critical discussion of applied
methods and techniques.
Contents In the course, the skills acquired so far in binary analysis will first be
deepened and adapted to the peculiarities of malware analysis.
Different malware samples are used to explain the techniques used by
malware authors. These priorities include:
• Characteristics of malware
• Persistence
• Network communication
• Encryption
• Dynamic malware analysis
• Debugging
• Behavioral obfuscation
• Virtual analysis environments
• Static malware analysis
• Control flow obfuscation
• Automation of common analysis steps
• Reconstruction of binary algorithms
The event begins with several lectures that provide the basics for the
students to work independently later. In the course of this, the
students will work on practical topics from the field of malware
analysis during the semester. Since these subject areas can turn out to
be very specific, it is necessary to be willing to deal with the subject
outside of the lecture and exercise times.
Prerequisites Required:
none
Recommended:
Basic knowledge of operating systems (kernel, threads, virtual
memory), network communication (protocols, architectures), binary
analysis (assembler, endianness, semantic gap, coding), software
development (programming, semantics, scripting in Python)
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
The relevant literature will be announced at the beginning of the
Literature
lecture
Master Computer Science — Universität Bonn 79

Module Lab Communication and Communicating Devices

MA-INF 3304
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Peter Martini
coordinator
Lecturer(s) Prof. Dr. Peter Martini, Prof. Dr. Michael Meier
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of communication systems, including test and
documentation of the implemented software/system.
Soft skills Work in small teams and cooperate with other teams in a group;
ability to make design decisions in a practical task; present and
discuss (interim and final) results in the team/group and to
other students; prepare written documentation of the work
carried out
Contents Selected topics close to current research in the area of
communication systems, network security, mobile
communication and communicating devices.
Prerequisites Required:
Successful completion of at least one of the following lectures:
Principles of Distributed Systems (MA-INF3105), Network
Security (MA-INF3201), Mobile Communication (MA-INF3202),
IT Security (MA-INF3236)
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The relevant literature will be announced towards the end of the
Literature
previous semester.
Master Computer Science — Universität Bonn 80

Module Lab Information Systems

MA-INF 3305
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every year
Module Dr. Thomas Bode
coordinator
Lecturer(s) Dr. Thomas Bode
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of information systems, including test and
documentation of the implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents Varying selected topics close to current research in the area of
database- and information systems.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The relevant literature will be announced towards the end of the
Literature
previous semester.
Master Computer Science — Universität Bonn 81

Module Lab Malware Analysis

MA-INF 3309
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Peter Martini
coordinator
Lecturer(s) Prof. Dr. Peter Martini, Prof. Dr. Michael Meier
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills The students will carry out a practical task (project) in the
context of communication systems with a specific topic focus on
Malware Analysis and Computer/Network Security, including
test and documentation of the implemented software/system.
Soft skills Work in small teams and cooperate with other teams in a group;
ability to make design decisions in a practical task; present and
discuss (interim and final) results in the team/group and to
other students; prepare written documentation of the work
carried out
Contents Selected topics close to current research in the area of
communication systems, malware analysis, computer and
network security.
Prerequisites Required:
Successful completion of at least one of the following lectures:
Principles of Distributed Systems (MA-INF3105), Network
Security (MA-INF3201), Mobile Communication (MA-INF3202),
IT Security (MA-INF3236)
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 82

Module Introduction to Sensor Data Fusion - Methods and

MA-INF 3310 Applications
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module P.D. Dr. Wolfgang Koch
coordinator
Lecturer(s) P.D. Dr. Wolfgang Koch
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills All participants shall get known to the basic theory of sensor
data fusion. The lecture starts with preliminaries on how to
handle uncertain data and knowledge within analytical calculus.
Then, the fundamental and well-known Kalman filter is derived.
Based on this tracking scheme, further approaches to a wide
spectrum of applications will be shown. All algorithms will be
motivated by examples from ongoing research projects,
industrial cooperations, and impressions of current
demonstration hardware.
Because of inherent practical issues, every sensor measures
certain properties up to an error. This lecture shows how to
model and overcome this error by an application of theoretical
tools such as Bayes’ rule and further derivations. Moreover,
solutions to possible false-alarms, miss-detections, maneuvering
phases, and much more will be presented.
Soft skills Mathematical derivation of algorithms, application of
mathematical results on estimation theory.
Contents Gaussian probability density functions, Kalman filter,
Multi-Hypothesis-Trackier, Interacting Multiple Model Filter,
Retrodiction, Smoothing, Maneuver Modeling
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
W. Koch: "Tracking and Sensor Data Fusion: Methodological
Framework and Selected Applications", Springer, 2014.
Literature
Y. Bar-Shalom: "Estimation with Applications to Tracking and
Navigation", Wiley-Interscience, 2001.
Master Computer Science — Universität Bonn 83

Module Lab Sensor Data Fusion

MA-INF 3312
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module P.D. Dr. Wolfgang Koch
coordinator
Lecturer(s) P.D. Dr. Wolfgang Koch
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills The students will work together on a data fusion project using
various sensor hardware. Latest algorithms for fusing
information from several nodes will be implemented.
Soft skills The students shall work together in a team. Everyone is
responsible for a specific part in the context of a main goal.
Results will be exchanged and integrated via software interfaces.
Contents Varying selected topics on sensor data fusion.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
The relevant literature will be announced at the beginning of the
Literature
lab.
Master Computer Science — Universität Bonn 84

Module Seminar Selected Topics in IT Security

MA-INF 3317
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Michael Meier
coordinator
Lecturer(s) Prof. Dr. Michael Meier, Prof. Dr. Peter Martini
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 85

Module Lab Usable Security and Privacy

MA-INF 3319
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Matthew Smith
coordinator
Lecturer(s) Prof. Dr. Matthew Smith
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills The students will carry out a practical task (project) in the
context of usable security and privacy, including user studies.
Soft skills Ability to create and defend a scientific user study
Contents Students have a great degree of freedom to chose their own
topics within the context of human aspects of security and
privacy.
Prerequisites Required:
MA-INF 3235 – Usable Security and Privacy
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 86

Module Lab Security in Distributed Systems

MA-INF 3320
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Matthew Smith
coordinator
Lecturer(s) Prof. Dr. Matthew Smith
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills The students will carry out a practical task (project) in the
context of distributed security, including documentation of the
implemented software/system.
Strong programming skills required.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents Security in distributed systems, including amongst others:
• Secure Messaging
• App Security
• SSL/HTTPS
• API Security
• Machine Learning for Security
• Passwords
• Intrusion Detection Systems
• Anomaly Detection
• Security Visualisation
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 87

Module Seminar Usable Security and Privacy

MA-INF 3321
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Matthew Smith
coordinator
Lecturer(s) Prof. Dr. Matthew Smith
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 88

Module Lab Fuzzing Bootcamp

MA-INF 3323
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Matthew Smith
coordinator
Lecturer(s) Prof. Dr. Matthew Smith
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of fuzz testing, including test and documentation of the
implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 89

Module Lab Design of Usable Security Mechanisms

MA-INF 3324
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Matthew Smith
coordinator
Lecturer(s) Dr. Emmanuel von Zezschwitz
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of usable security mechanisms, including test and
documentation of the implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 90

4 Intelligent Systems

MA-INF 4111 L2E2 6 CP Intelligent Learning and Analysis Systems: Machine Learning . . . 91
MA-INF 4112 L2E2 6 CP Intelligent Learning and Analysis Systems: Data Mining and
Knowledge Discovery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 92
MA-INF 4113 L2E2 6 CP Cognitive Robotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
MA-INF 4114 L2E2 6 CP Robot Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94
MA-INF 4201 L2E2 6 CP Artificial Life . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
MA-INF 4203 L2E2 6 CP Autonomous Mobile Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
MA-INF 4204 L2E2 6 CP Technical Neural Nets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
MA-INF 4207 L2E2 6 CP Dynamically Reconfigurable Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . 98
MA-INF 4208 Sem2 4 CP Seminar Vision Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
MA-INF 4209 Sem2 4 CP Seminar Principles of Data Mining and Learning Algorithms . . 100
MA-INF 4210 Sem2 4 CP Seminar Advanced Topics in Technical Informatics . . . . . . . . . . . . 101
MA-INF 4211 Sem2 4 CP Seminar Cognitive Robotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
MA-INF 4215 L2E2 6 CP Humanoid Robotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
MA-INF 4216 L2E2 6 CP Data Mining and Machine Learning Methods in Bioinformatics 104
MA-INF 4217 Sem2 4 CP Seminar Machine Learning Methods in the Life Sciences . . . . . . . 105
MA-INF 4226 Lab4 9 CP Lab Parallel Computing for Mobile Robotics . . . . . . . . . . . . . . . . . . 106
MA-INF 4228 L4E2 9 CP Foundations of Data Science . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
MA-INF 4229 L4E2 9 CP Pattern Recognition (1) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108
MA-INF 4230 L2E2 6 CP Advanced Methods of Information Retrieval . . . . . . . . . . . . . . . . . . . 109
MA-INF 4231 Sem2 4 CP Seminar Advanced Topics in Information Retrieval . . . . . . . . . . . . 110
MA-INF 4232 Lab4 9 CP Lab Information Retrieval in Practice . . . . . . . . . . . . . . . . . . . . . . . . . 111
MA-INF 4302 L2E2 6 CP Advanced Learning Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112
MA-INF 4303 L2E2 6 CP Learning from Non-Standard Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
MA-INF 4304 Lab4 9 CP Lab Cognitive Robotics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
MA-INF 4306 Lab4 9 CP Lab Development and Application of Data Mining and Learning
Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
MA-INF 4307 Lab4 9 CP Lab Field Programmable Gate Arrays . . . . . . . . . . . . . . . . . . . . . . . . . 116
MA-INF 4308 Lab4 9 CP Lab Vision Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
MA-INF 4309 Lab4 9 CP Lab Sensor Data Interpretation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
MA-INF 4310 Lab4 9 CP Lab Mobile Robots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
MA-INF 4312 L2E2 6 CP Semantic Data Web Technologies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
MA-INF 4313 Sem2 4 CP Seminar Semantic Data Web Technologies . . . . . . . . . . . . . . . . . . . . . 121
MA-INF 4314 Lab4 9 CP Lab Semantic Data Web Technologies . . . . . . . . . . . . . . . . . . . . . . . . . 122
MA-INF 4316 L2E2 6 CP Graph Representation Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
MA-INF 4318 Sem2 4 CP Seminar Representation Learning for Big Data Analytics . . . . . . 124
MA-INF 4319 L4E2 9 CP Game AI . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
MA-INF 4320 Lab4 9 CP Lab Representation Learning on Graphs . . . . . . . . . . . . . . . . . . . . . . . 126
MA-INF 4321 Sem2 4 CP Seminar Learning from Time Series . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
MA-INF 4322 L4E2 9 CP Lab Machine Learning on Encrypted Data . . . . . . . . . . . . . . . . . . . . 128
MA-INF 4323 L4E2 9 CP Pattern Recognition (2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
MA-INF 4324 Sem2 4 CP Seminar Advanced Topics in Data Science . . . . . . . . . . . . . . . . . . . . . 130
MA-INF 4325 Lab4 9 CP Lab Data Science in Practice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131
MA-INF 4326 L2E2 6 CP Explainable AI and Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132
MA-INF 4327 Lab4 9 CP Lab Biomedical Data Science . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133
MA-INF 4328 L2E2 6 CP Spatio-Temporal Data Analytics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134
MA-INF 4329 Sem2 4 CP Seminar Biological Intelligence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
Master Computer Science — Universität Bonn 91

Module Intelligent Learning and Analysis Systems: Machine

MA-INF 4111 Learning
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Stefan Wrobel
coordinator
Lecturer(s) Prof. Dr. Stefan Wrobel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills This module is one of two complementary modules in which
students gain an understanding of the most important
paradigms and methods of intelligent learning systems as they
are used in data analysis and/or for implementing adaptive
behaviour (machine learning, data mining, knowledge discovery
in databases). This module concentrates on the core task of
predictive learning from examples and on agent learning, and
teaches the main classes of algorithms for these tasks. At the
end of the module, students will be capable of choosing
appropriate methods and systems for particular predictive
learning applications and use them to arrive at convincing
results, and will know where to start whenever adaptation or
further development of algorithms and systems is necessary.
This module complements MA-INF 4112 and can be taken
before or after that module.
Soft skills Communicative skills (oral and written presentation of solutions,
discussions in small teams), self competences (ability to accept
and formulate criticism, ability to analyze problems)
Contents Types of learning and analysis tasks, most important
non-parametric and parametric methods for supervised learning
(e.g., decision trees, rules, linear methods, neural networks,
neighbourhood methods, kernel methods, probabilistic
approaches), reinforcement learning, evaluation and learning
theory.
Prerequisites Required:
MA-INF 4102 - Intelligent Learning and Analysis Systems has
not been passed.
Recommended:
Prior knowledge of probability theory, linear algebra, artificial
intelligence, information systems and data bases
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Lectures, exercises, software packages
- Tom Mitchell, Machine Learning, McGraw-Hill, 1997
Literature - Ian Witten, Eibe Frank, Data Mining, Morgan Kauffmann,
2000
Master Computer Science — Universität Bonn 92

Module Intelligent Learning and Analysis Systems: Data

MA-INF 4112 Mining and Knowledge Discovery
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Stefan Wrobel
coordinator
Lecturer(s) Prof. Dr. Wrobel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills This module is one of two complementary modules in which
students gain an understanding of the most important
paradigms and methods of intelligent learning systems as they
are used in data analysis and/or for implementing adaptive
behaviour (machine learning, data mining, knowledge discovery
in databases). This module concentrates on the core tasks of
pattern discovery in databases and teaches the main classes of
algorithms for this task (subgroups discovery. At the end of the
module, students will be capable of choosing appropriate
methods and systems for particular pattern discovery
applications and use them to arrive at convincing results, and
will know where to start whenever adaptation or further
development of algorithms and systems is necessary. This
module complements MA-INF 4111 and can be taken before or
after that module.
Soft skills Communicative skills (oral and written presentation of solutions,
discussions in small teams), self competences (ability to accept
and formulate criticism, ability to analyze problems)
Contents Types of learning and analysis tasks, scalability techniques,
descriptive data mining methods, association rules, subgroups,
clustering, pre- and postprocessing, data storage (data
warehouses, OLAP), special data types (spatial, network, text,
multimedia data), interactive and visual systems.
Prerequisites Required:
MA-INF 4102 - Intelligent Learning and Analysis Systems has
not been passed.
Recommended:
Prior knowledge of probability theory, linear algebra, artificial
intelligence, information systems and data bases
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Lectures, exercises, software packages
- Ian Witten, Eibe Frank, Data Mining, Morgan Kauffmann,
2000
Literature
- Jiawei Han, Micheline Kamber, Data Mining: Concepts and
Techniques, Morgan Kaufmann, 2000
Master Computer Science — Universität Bonn 93

Module Cognitive Robotics

MA-INF 4113
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Prof. Dr. Sven Behnke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills This lecture is one of two introductory lectures of the intelligent
systems track. The lecture covers cognitive capabilities of
robots, like self-localization, mapping, object perception, and
action-planning in complex environments.
This module complements MA-INF 4114 and can be taken
before or after that module.
Soft skills Communicative skills (oral and written presentation of solutions,
discussions in small teams), self competences (ability to accept
and formulate criticism, ability to analyze problems)
Contents Probabilistic approaches to state estimation (Bayes Filters,
Kalman Filter, Particle Filter), motion models, sensor models,
self-localization, mapping with known poses, simultaneous
mapping and localization (SLAM), iterated closest-point
matching, path planning, place- and person recognition, object
recognition.
Prerequisites Required:
MA-INF 4101 - Theory of Sensorimotor Systems has not been
passed.
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• S. Thrun, W. Burgard and D. Fox: Probabilistic Robotics.
MIT Press, 2005.
• B. Siciliano, O. Khatib (Eds.): Springer Handbook of
Literature
Robotics, 2008.
• R. Szeliski: Computer Vision: Algorithms and Applications,
Springer 2010.
Master Computer Science — Universität Bonn 94

Module Robot Learning

MA-INF 4114
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Prof. Dr. Sven Behnke, Dr. Nils Goerke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1. or 2.
Technical skills This lecture is one of two introductory lectures of the intelligent
systems track. Creating autonomous robots that can learn to
assist humans in situations of daily life is a fascinating challenge
for machine learning. The lecture covers key ingredients for a
general robot learning approach to get closer towards human-like
performance in robotics, such as reinforcement learning, learning
models for control, learning motor primitives, learning from
demonstrations and imitation learning, and interactive learning.
This module complements MA-INF 4113 and can be taken
before or after that module.
Soft skills Communicative skills (oral and written presentation of solutions,
discussions in small teams), self competences (ability to accept
and formulate criticism, ability to analyze problems)
Contents Reinforcement learning, Markov decision processes, dynamic
programming, Monte Carlo methods, temporal-difference
methods, function approximation, liear quadratic regulation,
differential dynamic programming, partially observable MDPs,
policy gradient methods, inverse reinforcement learning,
imitation learning, learning kinematic models, perceiving and
handling of objects.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• R. Sutton and A. Barto: Reinforcement Learning, MIT-Press,
1998.
Literature
• O. Sigaud and J. Peters (Eds.): From Motor Learning to
Interaction Learning in Robots. Springer, 2010.
Master Computer Science — Universität Bonn 95

Module Artificial Life

MA-INF 4201
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Prof. Dr. Sven Behnke, Dr. Nils Goerke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-3.
Technical skills Detailed understanding of the most important approaches and
principles of artificial life. Knowledge and understanding of the
current state of research in the field of artificial life
Soft skills Capability to identify the state of the art in artificial life, and to
present and defend the found solutions within the exercises in
front of a group of students. Critical discussion of the results of
the homework.
Contents Foundations of artificial life, cellular automata, Conway’s “Game
of Life”; mechanisms for structural development; foundations of
nonlinear dynamical systems, Lindenmeyer-systems,
evolutionary methods and genetic algorithms, reinforcement
learning, artificial immune systems, adaptive behaviour,
self-organising criticality, multi-agent systems, and swarm
intelligence, particle swarm optimization.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media Pencil and paper work, explain solutions in front of athe exercise
group, implementation of small programs, use of simple
simulation tools.
• Christoph Adami: Introduction to Artificial Life, The
Electronic Library of Science, TELOS, Springer-Verlag
• Eric Bonabeau, Marco Dorigo, Guy Theraulaz: Swarm
Intelligence: From Natural to Artificial Systems, Oxford
University Press, Santa Fe Institute Studies in the Science of
Literature
Complexity.
• Andrzej Osyczka: Evolutionary Algorithms for Single and
Multicriteria Design Optimization, Studies in Fuzzyness and
Soft Computing, Physica-Verlag, A Springer-Verlag Company,
Heidelberg
Master Computer Science — Universität Bonn 96

Module Autonomous Mobile Systems

MA-INF 4203
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Dr. Dirk Schulz, Prof. Dr. Sven Behnke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Profound knowledge of development and test regarding structure
and function of learning, autonomous, mobile systems;
Knowledge of the computational, mathematical, and technical
requirements for the design of autonomous systems for specific
applications and for specific functional environments
Soft skills The students will be capable to assess applications for
autonomous mobile systems. They will be capable to identify
what part of the applications might be improved by using state
of the art developments. The student will learn how to plan and
implement a software project in small working groups.
Contents Requirements for the implementation of autonomous mobile
systems, e.g. for: map making, dead reckoning, localisation,
SLAM-methods, various principles of robot path planning;
methods for action planning. Comparison of different learning
paradigms for specific applications.
Prerequisites Recommended:
all of the following:
MA-INF 4101 – Theory of Sensorimotor Systems
MA-INF 4113 – Cognitive Robotics
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• J. Buchli: Mobile Robots: Moving Intelligence, Published by
Advanced Robotic Systems and Pro Literatur Verlag
• Sebastian Thrun, Wolfram Burgard, Dieter Fox: Probabilistic
Literature
Robotics, MIT Press, 2005
• Howie Choset et al.: Principles of Robot Motion, MIT-Press,
2005
Master Computer Science — Universität Bonn 97

Module Technical Neural Nets

MA-INF 4204
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Joachim K. Anlauf
coordinator
Lecturer(s) Prof. Dr. Joachim K. Anlauf, Dr. Nils Goerke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1-3.
Technical skills Detailed knowledge of the most important neural network
approaches and learning algorithms and its fields of application.
Knowledge and understanding of technical neural networks as
Non-Von Neumann computer architectures similar to concepts of
brain functions at different stages of development
Soft skills The students will be capable to propose several paradigms from
neural networks that are capable to solve a given task. They can
discuss the pro and cons with respect to efficency and risk. The
will be capable to plan and implement a small project with state
of the art neural network solutions.
Contents Multi-layer perceptron, radial-basis function nets, Hopfield nets,
self organizing maps (Kohonen), adaptive resonance theory,
learning vector quantization, recurrent networks,
back-propagation of error, reinforcement learning, Q-learning,
support vector machines, pulse processing neural networks.
Exemplary applications of neural nets: function approximation,
prediction, quality control, image processing, speech processing,
action planning, control of technical processes and robots.
Implementation of neural networks in hardware and software:
tools, simulators, analog and digital neural hardware.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• Christopher M. Bishop: Neural Networks for Pattern
Recognition, Oxford University Press, ISBN-10: 0198538642,
Literature ISBN-13: 978-0198538646
• Ian T. Nabney: NETLAB. Algoriths for Pattern Recognition,
Springer, ISBN-10: 1852334401, ISBN-13: 978-1852334406
Master Computer Science — Universität Bonn 98

Module Dynamically Reconfigurable Systems

MA-INF 4207
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Prof. Dr. Joachim K. Anlauf
coordinator
Lecturer(s) Prof. Dr. Joachim K. Anlauf
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Knowledge of the most important FPGA architectures, ability
to select appropriate FPGAs for a given application, overview of
programming tools
Soft skills Communicative skills (oral and written presentation of
solutions), social skills (ability to solve problems in small teams,
discussions of solution concepts) self competences (ability to
accept and formulate criticism, ability to analyze problems)
Contents Architecture of FPGAs, Configurable Logic Blocks, Wiring
Ressources, Special Blocks, Hardware Description Languages,
Synthesis, Technology Mapping, Place and Route, FPGA
Computing, Partial Reconfigurability
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature Current research papers and technical documentation
Master Computer Science — Universität Bonn 99

Module Seminar Vision Systems

MA-INF 4208
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every semester
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Prof. Dr. Sven Behnke, Prof. Dr. Joachim K. Anlauf,
Dr. Nils Goerke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills • Knowledge in advanced topics in the area of technical vision
systems, such as image segmentation, feature extraction, and
object recognition.
• Ability to understand new research results presented in
original scientific papers and to present them in a research talk
as well as in a seminar report.
Soft skills Self-competences (time management, literature search,
self-study), communication skills (preparation and clear didactic
presentation of research talk, scientific discussion, structured
writing of seminar report), social skills (ability to formulate and
accept criticism, critical examination of research results).
Contents Current research papers from conferences and journals in the
field of vision systems covering fundamental techniques and
applications.
Prerequisites Recommended:
At least 1 of the following:
MA-INF 4111 – Intelligent Learning and Analysis Systems:
Machine Learning
MA-INF 4204 – Technical Neural Nets
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
• R. Szeliski: Computer Vision: Algorithms and Applications,
Springer 2010.
• C. M. Bishop: Pattern Recognition and Machine Learning,
Literature
Springer 2006.
• D. A. Forsyth and J. Ponce: Computer Vision: A Modern
Approach, Prentice Hall, 2003.
Master Computer Science — Universität Bonn 100

Module Seminar Principles of Data Mining and Learning

MA-INF 4209 Algorithms
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Stefan Wrobel
coordinator
Lecturer(s) Prof. Dr. Stefan Wrobel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Enhanced and in-depth knowledge in specialized topics in the
area of machine learning and data mining, acquiring the
competence to independently study scientific literature, present
it to others and discuss it with a knowledgeable scientific
auditorium. Learn how to scientifically present prior work by
others, in writing and in presentations.
Soft skills Communicative skills (preparing and presenting talks, written
presentation of contents in a longer document), self competences
(time management with long-ranging deadlines, ability to accept
and formulate criticism, ability to analyse, creativity).
Contents Theoretical, statistical and algorithmical principles of data
mining and learning algorithms. Search and optimization
algorithms. Specialized learning algorithms from the frontier of
research. Fundamental results from neighbouring areas.
Prerequisites Recommended:
At least 1 of the following:
MA-INF 4111 – Intelligent Learning and Analysis Systems:
Machine Learning
MA-INF 4112 – Intelligent Learning and Analysis Systems:
Data Mining and Knowledge Discovery
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media Scientific papers and websites, interactive presentations.
The relevant literature will be announced towards the end of the
Literature
previous semester.
Master Computer Science — Universität Bonn 101

Module Seminar Advanced Topics in Technical Informatics

MA-INF 4210
Workload Credit points Duration Frequency
120 h 4 CP 1 semester at least every 2 years
Module Prof. Dr. Joachim K. Anlauf
coordinator
Lecturer(s) Prof. Dr. Joachim K. Anlauf
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Current Topics in Technical Informatics
Soft skills Communicative skills (preparing and presenting talks, preparing
a structured written document), social skills (ability to accept
and formulate criticism, discussions of current content) self
competences (time management with long-ranging deadlines,
understanding of research topics from original literature)
Contents Current topics such as: new architectures of computers or
FPGAs (field programmable gate arrays) or new applications of
dynamically reconfigurable systems
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature Current research papers
Master Computer Science — Universität Bonn 102

Module Seminar Cognitive Robotics

MA-INF 4211
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every semester
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Prof. Dr. Sven Behnke, Dr. Nils Goerke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Knowledge in advanced topics in the area of cognitive robotics,
such as robot perception, action planning, and robot learning.
Ability to understand new research results presented in original
scientific papers and to present them in a research talk as well as
in a seminar report.
Soft skills Self-competences (time management, literature search,
self-study), communication skills (preparation and clear didactic
presentation of research talk, scientific discussion, structured
writing of seminar report), social skills (ability to formulate and
accept criticism, critical examination of research results).
Contents Current research papers from conferences and journals in the
field of cognitive robotics covering fundamental techniques and
applications.
Prerequisites Recommended:
At least 1 of the following:
MA-INF 4113 – Cognitive Robotics
MA-INF 4114 – Robot Learning
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
• S. Thrun, W. Burgard and D. Fox: Probabilistic Robotics.
MIT Press, 2005.
Literature • B. Siciliano, O. Khatib (Eds.): Springer Handbook of
Robotics, 2008.
• Selected papers.
Master Computer Science — Universität Bonn 103

Module Humanoid Robotics

MA-INF 4215
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Prof. Dr. Maren Bennewitz
coordinator
Lecturer(s) Prof. Dr. Maren Bennewitz
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2-4.
Technical skills This lecture covers techniques for humanoid robots such as
perception, navigation, and motion planning.
Soft skills Communicative skills (oral and written presentation of solutions,
discussions in small teams), ability to analyze problems.
Contents Self-calibration with least squares, 3D environment
representations, self-localization with particle filters, footstep
planning, inverse kinematics, whole-body motion planning with
rapidly exploring random trees, statistical testing.
Prerequisites Recommended:
MA-INF 4113 – Cognitive Robotics
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• S. Thrun, W. Burgard and D. Fox: Probabilistic Robotics.
MIT Press, 2005.
• B. Siciliano, O. Khatib (Eds.): Springer Handbook of Robotics
Literature
• K. Harada, E. Yoshida, K. Yokoi (Eds.), Motion Planning for
Humanoid Robots, Springer
• Selected research papers.
Master Computer Science — Universität Bonn 104

Module Data Mining and Machine Learning Methods in

MA-INF 4216 Bioinformatics
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Dr. Holger Fröhlich
coordinator
Lecturer(s) Dr. Holger Fröhlich
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills - understanding and knowledge of fundamental data mining and
machine learning methods
- understanding of their application in bioinformatics
Soft skills - communication: oral and written presentation of solutions to
exercises
- self-competences: ability to analyze application problems and
to formulate possible solutions
- practical skills: ability to practically implement solutions
- social skills: working in a small team with other students
Contents This lecture gives a broad overview about frequently used
statistical techniques as well as data mining and machine
learning algorithms. The use of the respective methods to solve
problems in bioinformatics is explained. The goal is to
understand the explained methods, being able to apply them
correctly and partially implement them. More detailed, the
following topics are covered in the context of their application in
bioinformatics:
- Short introduction to Bioinformatics and Biomedicine
- Statistical Basics: Probability distributions and Bayesian
inference, statistical hypothesis testing, linear models, logistic
regression, Principal Component Analysis
- Clustering
- Hidden Markov Models
- Principles of Supervised Machine Learning
- Elastic Net
- Basics of deep learning
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
T. Hastie, R. Tibshirani, J. Friedman, The Elements of
Statistical Learning, Springer, 2008
Literature S.Boslaugh, P. Watters, Statistics in a Nutshell, O’Reilly, 2008
N. Jones, P. Pevzner, An Introduction to Bioinformatics
Algorithms, MIT Press, 2004
Master Computer Science — Universität Bonn 105

Module Seminar Machine Learning Methods in the Life

MA-INF 4217 Sciences
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Dr. Holger Fröhlich
coordinator
Lecturer(s) Dr. Holger Fröhlich
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 4.
Technical skills - understanding and knowledge of machine learning methods
and their application in modern life sciences, e.g. biomedicine
Soft skills - communication: oral scientific presentation of a defined topic
- self-competences: ability to identify relevant literature for a
given topic; ability to read, understand and analyze scientific
publications
- social skills: ability to discuss a scientific topic with other
students and the staff
Contents Machine learning techniques play a crucial role in modern life
sciences, including biomedicine. The goal of this seminar is to
discuss a variety of machine learning techniques in the context of
their application to solve real-world problems in biomedicine.
Topics will be selected from the following areas:
- Ensemble learning
- Survival and disease progression models
- Bayesian Networks
- Stochastic processes, e.g. Gaussian Proceses, Dirichlet Process
Mixture Models
- MCMC methods
- Deep learning methods, e.g. DNNs, CNNs, Deep Belief
Networks
- feature selection and non-linear embedding methods
- multi-modal data fusion techniques
Attendees will be asked to perform research about their topic in
a self-responsible manner.
Prerequisites Recommended:
MA-INF 4216 – Data Mining and Machine Learning Methods in
Bioinformatics
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media powerpoint
Literature selected journal and conference papers
Master Computer Science — Universität Bonn 106

Module Lab Parallel Computing for Mobile Robotics

MA-INF 4226
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every 2 years
Module Prof. Dr. Maren Bennewitz
coordinator
Lecturer(s) Prof. Dr. Maren Bennewitz
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Students will make practical experience with the design and
implementation of parallelized algorithms in the context of
motion planning and navigation.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents Parallel programming on the GPU, CUDA, shortest path
planning, collision checking, visibility graph, A* algorithm
Prerequisites Recommended:
C++, Linux.
Since the exercises revolve around path planning, one of those
courses might be helpful:
MA-INF 4203: Autonomous Mobile Systems
MA-INF 4113: Cognitive Robotics
MA-INF 4310: Lab Mobile Robots
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 107

Module Foundations of Data Science

MA-INF 4228
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Dr. Michael Nüsken
coordinator
Lecturer(s) Dr. Michael Nüsken
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Knowledge: Peculiarities of high dimensional spaces in geometry
and probabilities. Singular vector decomposition. Basics in
machine learning and clustering.
Skills: Understanding of mathematical tools.
Soft skills Competences: Application to data science problems and ability
to assess similar methods.
Contents Data science aims at making sense of big data. To that end,
various tools have to be understood for helping in analyzing the
arising structures.
Often data comes as a collection of vectors with a large number
of components. To understand their common structure is the
first main objective of understanding the data. The geometry
and the linear algebra behind them becomes relevant and
enlightning. Yet, the intuition from low-dimensional space turns
out to be often misleading. We need to be aware of the
particular properties of high-dimensional spaces when working
with such data. Fruitful methods for the analysis include
singular vector decomposition from linear algebra and
supervised and unsupervised machine learning. If time permits,
we also consider random graphs, which are the second most used
model for real world phenomena.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Avrim Blum, John Hopcroft, and Ravindran Kannan (2018+).
Literature
Foundations of Data Science.
Master Computer Science — Universität Bonn 108

Module Pattern Recognition (1)

MA-INF 4229
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Christian Bauckhage
coordinator
Lecturer(s) Prof. Dr. Christian Bauckhage
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Upon completion, students should be able to
• devise mathematical models for problems in data analysis,
clustering, and classification
• implement basic and advanced algorithms for model fitting and
optimization
• implement basic and advanced algorithms for data clustering and
classification
• implement basic and advanced algorithms for pattern recognition
Soft skills Students will learn about the mathematical and algorithmic
foundations of machine learning for pattern recognition. They will
learn about basic and advanced mathematical models in this area, how
to implement them on their own, and how to put them into practice.
Contents • fundamental concepts, prerequisites, and procedures in pattern
recognition
• basic and advanced concepts in linear algebra
• basic and advanced concepts in probability theory and statistics
• least squares techniques for model fitting
• maximum likelihood techniques
• maximum a-posteriori techniques
• Bayesian inference methods
• fundamental aspects of learning theory and the VC dimension
• the curse of dimensionality
• methods and algorithms for data clustering
• Gaussian mixture models
• the method of Lagrange multipliers and the KKT conditions
• quadratic and linear discriminant analysis
• algorithms for constrained optimization
• support vector machines
• the kernel trick
• neural networks
• Hebbian learning
Prerequisites Recommended:
Students should good working knowledge in linear algebra, probability
theory, and statistics as well as programming experience.
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media • lecture slides are made available online
• lecture notes with programming examples are made available online
Bishop, "Pattern Recognition and Machine Learning"
Literature Duda, Stork, Hart, "Pattern Classification"
MacKay, "Information Theory, Inference, and Learning Algorithms"
Master Computer Science — Universität Bonn 109

Module Advanced Methods of Information Retrieval

MA-INF 4230
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Elena Demidova
coordinator
Lecturer(s) Prof. Dr. Elena Demidova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills This module introduces the students to the advanced methods,
data structures, and algorithms of information retrieval for
structured and semi-structured data (including, for example,
knowledge graphs, relational data, and tabular data).
At the end of the module, the students will be capable of
choosing appropriate data structures and retrieval algorithms for
specific applications and correctly apply relevant statistical and
machine learning-based information retrieval procedures.
Soft skills Communication skills: oral and written presentation and
discussion of solutions.
Self-competences: ability to analyse and solve problems.
Contents The module topics include data structures, ranking methods,
and efficient algorithms that enable end-users to effectively
obtain the most relevant search results from structured,
heterogeneous, and distributed data sources. Furthermore, we
will study the corresponding evaluation techniques as well as
novel applications.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Selected chapters from:
• Christopher D. Manning, Prabhakar Raghavan and Hinrich
Schütze, Introduction to Information Retrieval, Cambridge
University Press. 2008.
• Bhaskar Mitra and Nick Craswell (2018), "An Introduction to
Neural Information Retrieval ", Foundations and Trendső in
Information Retrieval: Vol. 13: No. 1, pp 1-126.
- Ridho Reinanda, Edgar Meij and Maarten de Rijke (2020),
Literature
"Knowledge Graphs: An Information Retrieval Perspective",
Foundations and Trendső in Information Retrieval: Vol. 14: No.
4, pp 289-444.
- Jeffrey Xu Yu, Lu Qin, Lijun Chang. Keyword Search in
Databases. Synthesis Lectures on Data Management. Morgan &
Claypool Publishers. 2009.
Further references to relevant material will be provided during
the lecture.
Master Computer Science — Universität Bonn 110

Module Seminar Advanced Topics in Information Retrieval

MA-INF 4231
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Elena Demidova
coordinator
Lecturer(s) Prof. Dr. Elena Demidova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills This module concentrates on specialized topics in information
retrieval. The students obtain skills in the independent, in-depth
study of state-of-the-art scientific literature on specific topics,
discussion with their peers and presentation to the scientific
audience.
Soft skills Communication skills: oral and written presentation of scientific
content. Self-competences: the ability to analyze problems, time
management, creativity.
Contents Statistical and machine learning-based information retrieval
methods, including typical steps of the information retrieval
process: data collection, feature extraction, indexing, retrieval,
ranking, and evaluation. Specialized data representation and
retrieval methods for selected data types and applications in
specific domains.
Prerequisites Recommended:
MA-INF 4230 - Advanced Methods of Information Retrieval
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements None (not graded)
Forms of media
Selected chapters from:
• Christopher D. Manning, Prabhakar Raghavan and Hinrich
Schütze, Introduction to Information Retrieval, Cambridge
University Press. 2008.
Literature • Bhaskar Mitra and Nick Craswell (2018), "An Introduction to
Neural Information Retrieval ", Foundations and Trendső in
Information Retrieval: Vol. 13: No. 1, pp 1-126.
Further relevant literature will be announced at the beginning of
the seminar.
Master Computer Science — Universität Bonn 111

Module Lab Information Retrieval in Practice

MA-INF 4232
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Elena Demidova
coordinator
Lecturer(s) Prof. Dr. Elena Demidova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills This module concentrates on practical experience in information
retrieval. Participants acquire basic knowledge and practical
experience in designing and implementing information retrieval
systems for specific data types and applications.
Soft skills Communication skills: the ability to work in teams.
Self-competences: the ability to analyse problems and find
practical solutions. Time management, creativity, presentation
of results.
Contents Practical application of information retrieval methods to solve
retrieval problems on real-world data and evaluate proposed
solutions.
Prerequisites Recommended:
MA-INF 4230 - Advanced Methods of Information Retrieval
MA-INF 4231 - Seminar Advanced Topics in Information
Retrieval
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements None (not graded)
Forms of media
Selected chapters from:
• Christopher D. Manning, Prabhakar Raghavan and Hinrich
Schütze, Introduction to Information Retrieval, Cambridge
University Press. 2008.
Literature • Bhaskar Mitra and Nick Craswell (2018), "An Introduction to
Neural Information Retrieval ", Foundations and Trendső in
Information Retrieval: Vol. 13: No. 1, pp 1-126.
Further references to relevant material will be provided during
the lab.
Master Computer Science — Universität Bonn 112

Module Advanced Learning Systems

MA-INF 4302
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every 2 years
Module Prof. Dr. Stefan Wrobel
coordinator
Lecturer(s) Prof. Dr. Stefan Wrobel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Participants specialize and require in-depth knowledge of one
particular class of learning algorithms, they acquire the
necessary knowledge to improve existing algorithms and
construct their own within the given class, all the way up to the
research frontier on the topic.
Soft skills In group work, students acquire the necessary social and
communication skills for effective team work and project
planning, and learn how to present software projects to others.
Contents The module each time concentrates on one or more specific
algorithm classes, e.g.
• kernel machines
• neural networks
• probabilistic and statistical learning approaches
• logic-based learning approaches
• reinforcement learning
Prerequisites Recommended:
all of the following:
MA-INF 4111 – Intelligent Learning and Analysis Systems:
Machine Learning
MA-INF 4112 – Intelligent Learning and Analysis Systems:
Data Mining and Knowledge Discovery
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media lectures, exercises, software systems
• B. Schoelkopf, A.J. Smola, Learning with Kernels, The MIT
Press, 2002, Cambridge, MA
• John Shawe-Taylor, Nello Christianini, Kernel Methods for
Pattern Analysis, CUP, 2004
• Christopher Bishop, Pattern Recognition and Machine
Literature
Learning, The University of Edinburgh, 2006
• David MacKay, Information Theory, Inference, and Learning
Algorithms, 2003
• Richard Duda, Peter Hart, David Stork, Pattern
Classification, John Wiley and Sons, 2001
Master Computer Science — Universität Bonn 113

Module Learning from Non-Standard Data

MA-INF 4303
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Stefan Wrobel
coordinator
Lecturer(s) Prof. Dr. Stefan Wrobel, Dr. Tamas Horvath
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Participants deepen their knowledge of learning systems with
respect to one particular non-standard data type, i.e.,
non-tabular data, as they are becoming increasingly important
in many applications. Each type of data not only requires
specialized algorithms but also knowledge of the surrounding
pre- and postprocessing operations which is acquired by the
participants in the module. In group work, students acquire the
necessary social and communication skills for effective team
work and project planning, and learn how to present software
projects to others.
Soft skills Communicative skills (oral and written presentation of solutions,
discussions in teams), self-competences (ability to accept and
formulate criticism, ability to analyse, creativity in the context
of an "open end" task)
Contents The module will offered every year, concentrating on one
particular non-standard data type each time, including: Text
Mining, Multimedia Mining, Graph Mining. Learning from
structured data, Spatial Data Mining
Prerequisites Recommended:
all of the following:
MA-INF 4111 – Intelligent Learning and Analysis Systems:
Machine Learning
MA-INF 4112 – Intelligent Learning and Analysis Systems:
Data Mining and Knowledge Discovery
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media lectures, exercises, software systems.
• Gennady Andrienko, Natalia Andrienko, Exploratory Analysis
of Spatial and Temporal Data, Springer, 2006
• Diane J. Cook, Lawrence B. Holder, Mining Graph Data,
Wiley & Sons, 2006
Literature • Saso Dzeroski, Nada Lavrac, Relational Data Mining,
Springer, 2001
• Sholom M. Weiss, Nitin Indurkhya, Tong Zhang, Fred J.
Damerau, Text Mining. Predictive Methods for Analyzing
Unstructured Information, Springer, 2004
Master Computer Science — Universität Bonn 114

Module Lab Cognitive Robotics

MA-INF 4304
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Prof. Dr. Sven Behnke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Participants acquire practical experience and in-depth
knowledge in the design and implementation of perception and
control algorithms for complex robotic systems. In a small
group, they analyze a problem, realize a state-of-the-art
solution, and evaluate its performance.
Soft skills Self-competences (time management, goal-oriented work, ability
to analyze problems and to find practical solutions),
communication skills (Work together in small teams, oral and
written presentation of solutions, critical examination of
implementations)
Contents Robot middleware (ROS), simultaneous localization and
mapping (SLAM), 3D representations of objects and
environments, object detection and recognition, person detection
and tracking, action recognition, action planning and control,
mobile manipulation, human-robot interaction.
Prerequisites Recommended:
At least 1 of the following:
MA-INF 4113 – Cognitive Robotics
MA-INF 4114 – Robot Learning
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
• S. Thrun, W. Burgard and D. Fox: Probabilistic Robotics.
MIT Press, 2005.
Literature • B. Siciliano, O. Khatib (Eds.): Springer Handbook of
Robotics, 2008.
• Selected research papers.
Master Computer Science — Universität Bonn 115

Module Lab Development and Application of Data Mining

MA-INF 4306 and Learning Systems
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Stefan Wrobel
coordinator
Lecturer(s) Prof. Dr. Stefan Wrobel
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills Students will acquire in-depth knowledge in the construction
and development of intelligent learning systems for machine
learning and data mining. They learn how to work with existing
state-of-the-art systems and apply them to application
problems, usually extending them for the requirements of their
particular task.
Soft skills Communicative skills (appropriate oral presentation and written
documentation of project results), social skills (ability to work in
teams), self-competences (time management, aiming at
long-range goals under limited ressources, ability to work under
pressure, ability to accept/formulate ciriticsm)
Contents Data storage and process models of data analysis. Common
open source frameworks for the construction of data analysis
systems, specialized statistical packages. Pre-processing tools.
Mathematical libraries for numerical computation. Search and
optimization methods. User interfaces and visualization for
analysis systems. Data analysis algorithms for embedded and
distributed systems. Ubiquitous discovery systems.
Prerequisites Recommended:
At least 1 of the following:
MA-INF 4111 – Intelligent Learning and Analysis Systems:
Machine Learning
MA-INF 4112 – Intelligent Learning and Analysis Systems:
Data Mining and Knowledge Discovery
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media Computer Software, Documentation, Research Papers.
The relevant literature will be announced towards the end of the
Literature
previous semester.
Master Computer Science — Universität Bonn 116

Module Lab Field Programmable Gate Arrays

MA-INF 4307
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every 2 years
Module Prof. Dr. Joachim K. Anlauf
coordinator
Lecturer(s) Prof. Dr. Joachim K. Anlauf
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Development and simulation of digital circuits in VHDL and
SystemC, experience with synthesizable subsets, knowledge of
the design path from the idea to a realized circuit implemented
in an FPGA (field programmable gate array)
Soft skills Communicative skills (oral and written presentation of results),
social skills (ability to cooperate in small teams, discussions of
solution concepts) self competences (ability to accept and
formulate criticism, ability to analyze and find practical
solutions to problems)
Contents VHDL for Hardware Description, Simulation, and Synthesis,
SystemC for Hardware Description, Simulation, and Synthesis,
Synthesizable Subsets, Test of Implementations on FPGA
Evaluation Boards
Prerequisites Recommended:
MA-INF 4207 - Dynamically Reconfigurable Systems
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature Technical documentation
Master Computer Science — Universität Bonn 117

Module Lab Vision Systems

MA-INF 4308
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every semester
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Dr. Nils Goerke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills Students will acquire knowledge of the design and
implementation of parallel algorithms on GPUs. They will apply
these techniques to accelerate standard machine learning
algorithms for data-intensive computer vision tasks.
Soft skills Self-competences (time management, goal-oriented work, ability
to analyze problems and to find practical solutions),
communication skills (Work together in small teams, oral and
written presentation of solutions, critical examination of
implementations)
Contents Basic matrix and vector computations with GPUs (CUDA).
Classification algorithms, such as multi-layer perceptrons,
support-vector machines, k-nearest neighbors,
linear-discriminant analysis. Image preprocessing and data
handling. Quantitative performance evaluation of learning
algorithms for segmentation and categorization.
Prerequisites Recommended:
At least 1 of the following:
MA-INF 4111 – Intelligent Learning and Analysis Systems:
Machine Learning
MA-INF 4204 – Technical Neural Nets
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
• R. Szeliski: Computer Vision: Algorithms and Applications,
Springer 2010.
Literature • C. M. Bishop: Pattern Recognition and Machine Learning,
Springer 2006.
• NVidia CUDA Programming Guide, Version 4.0, 2011.
Master Computer Science — Universität Bonn 118

Module Lab Sensor Data Interpretation

MA-INF 4309
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every 2 years
Module PD. Dr. Volker Steinhage
coordinator
Lecturer(s) PD. Dr. Volker Steinhage
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Competence to implement algorithms for sensor data
interpretation, efficient handling and testing, documentation.
Soft skills Efficient implementation of complex algorithms, abstract
thinking, documentation of source code.
Contents Varying selected up-to-date topics on sensor data interpretation
Prerequisites Required:
All of the following:
MA-INF 2201 – Computer Vision
MA-INF 4206 – Selected Topics in Sensor Data Interpretation
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature Relevant literature will be announced at start of the lab.
Master Computer Science — Universität Bonn 119

Module Lab Mobile Robots

MA-INF 4310
Workload Credit points Duration Frequency
270 h 9 CP 1 semester at least every year
Module Prof. Dr. Sven Behnke
coordinator
Lecturer(s) Prof. Dr. Sven Behnke, Dr. Nils Goerke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Participants acquire basic knowledge and practical experience in
the design and implementation of control algorithms for simple
structured robotic systems using real mobile robots.
Fundamental paradigms for mobile robots will be identified and
implemented in 2 person groups.
Soft skills Self-competences (time management, goal-oriented work, ability
to analyze problems and to find practical solutions),
communication skills (Work together in small teams, oral and
written presentation of solutions, critical examination of
implementations)
Contents Robot middleware (e.g. ROS), robot simulation tools, basic
capabilities for mobile robots: reactive control, SMPA
architecture, navigation, path planning, localisation,
simultaneous localization and mapping (SLAM), visual based
object detection, learning robot control.
Prerequisites Recommended:
At least 1 of the following:
BA-INF 132 – Grundlagen der Robotik
BA-INF 131 – Intelligente Sehsysteme
MA-INF 1314 – Online Motion Planning
MA-INF 2201 – Computer Vision
MA-INF 4113 – Cognitive Robotics
MA-INF 4114 – Robot Learning
MA-INF 4203 – Autonomous Mobile Systems
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media Robots simulation environments, robot control middleware,
computer vision libraries, programming, demonstration of robot
capabilities (real robotic systems), presentation and written
report of approach and results.
• S. Thrun, W. Burgard and D. Fox: Probabilistic Robotics.
MIT Press, 2005.
• J. Buchli: Mobile Robots: Moving Intelligence, Published by
Literature Advanced Robotic Systems and Pro Literatur Verlag
• B. Siciliano, O. Khatib (Eds.): Springer Handbook of
Robotics, 2008.
• Additional State-of-the-art publications.
Master Computer Science — Universität Bonn 120

Module Semantic Data Web Technologies

MA-INF 4312
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Jens Lehmann
coordinator
Lecturer(s) Prof. Dr. Jens Lehmann, Dr. Christoph Lange,
Dr. Maria Maleschkova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1.
Technical skills The goal of this lecture is to impart knowledge on the
fundamentals, technologies and applications of the Semantic
Web and information retrieval. As part of the lecture the basic
concepts and standards for semantic technologies are explained.
Soft skills
Contents As part of the W3C Semantic Web initiative standards and
technologies have been developed for machine-readable exchange
of data, information and knowledge on the Web. These
standards and technologies are increasingly being used in
applications and have already led to a number of exciting
projects (e.g. DBpedia, semantic wiki or commercial
applications such as schema.org, OpenCalais, or Google’s
Freebase). The module provides a theoretically grounded and
practically oriented introduction to this area. The topics
discussed within the lecture include:
• RDF syntax and data model
• RDF Schema and formal semantics of RDF (S)
• ontologies in OWL and formal semantics of OWL
• RDF databases, triple and knowledge stores, query languages
• Linked Data Web and Semantic Web applications
• Semantic text analysis and information retrieval systems
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 121

Module Seminar Semantic Data Web Technologies

MA-INF 4313
Workload Credit points Duration Frequency
120 h 4 CP 1 semester at least every year
Module Prof. Dr. Jens Lehmann
coordinator
Lecturer(s) Dr. Christoph Lange, Dr. Maria Maleshkova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills Through the seminar, students will learn to work with tools and
technologies of the Semantic Web as well as assess their
capabilities for given problems. They will gain the ability to
understand new research results presented in original scientific
papers.
Soft skills Ability to present and to critically discuss technologies and
research results in the framework of Semantic Web technologies.
Contents • technologies such as triple stores, link discovery frameworks,
NLP pipelines.
• recent conference and journal papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 122

Module Lab Semantic Data Web Technologies

MA-INF 4314
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Jens Lehmann
coordinator
Lecturer(s) Prof. Dr. Jens Lehmann, Dr. Maria Maleschkova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2.
Technical skills The students will carry out a practical task (project) in the
context of Semantic Web technologies, including test and
documentation of the implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify own results with regard
to the state-of-the-art
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 123

Module Graph Representation Learning

MA-INF 4316
Workload Credit points Duration Frequency
180 h 6 CP 1 semester at least every 2 years
Module Dr. Pascal Welke
coordinator
Lecturer(s) Dr. Pascal Welke
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 1.
Technical skills • Deep understanding of the trade-off between expressiveness of graph
representation and computational complexity, as well as practical
runtime of algorithms in the context of machine learning applications.
- Ability to implement, practically apply, and theoretically analyze
graph representation, graph kernels, and graph mining algorithms.
Soft skills • Social, methodological, and analytical competences via
communication, own development, and presentation of problem
formulations, algorithms, and solutions.
• Learning to solve project tasks in a group.
• Learning to evaluate the trade-offs and limitations of existing
methods.
Contents We will discuss general approaches for machine learning (ML) on
graph structured data. In particular, computational methods for graph
representation learning such as graph neural networks (GNNs), graph
kernels, as well as graph mining techniques will be discussed, analyzed,
and applied. Regarding GNNs and graph kernels, we will discuss the
expressive power and how these concepts are related, as well as several
specific examples. In the area of graph mining, we will likely
investigate fast (approximate) algorithms to count small patterns, such
as triangles, or trees.
If time permits, we might venture into the realm of ranking on
large-scale graphs, with applications such as recommender systems.
The exercises will focus on practical implementations and the
application of these methods to real world examples.
Prerequisites Recommended:
Helpful: one or more of the following
• MA-INF 4111 – Intelligent Learning and Analysis Systems: Machine
Learning
• MA-INF 4112 – Intelligent Learning and Analysis Systems: Data
Mining and Knowledge Discovery
• MA-INF 4212 – Data Science and Big Data
• MA-INF 1105 - Algorithms for Data Analysis
• MA-INF 1102 - Combinatorial Optimization
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam or written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media • Lecture slides
• Jupyter notebooks
• William L. Hamilton: Graph Representation Learning, Synthesis
Lectures on Artificial Intelligence and Machine Learning, Morgan and
Claypool.
• Nils M. Kriege, Fredrik D. Johansson, Christopher Morris: A survey
on
Literature
graph kernels, Applied Network Science 5(1):6.
• Karsten M. Borgwardt, M. Elisabetta Ghisu et al.: Graph Kernels:
State-of-the-Art and Future Challenges, Foundations and Trends in
Machine Learning 13(5-6).
Master Computer Science — Universität Bonn 124

Module Seminar Representation Learning for Big Data

MA-INF 4318 Analytics
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Emmanuel Müller
coordinator
Lecturer(s) Prof. Dr. Emmanuel Müller
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Smart representations (such as embeddings, kernels, and
dimensionality reduction methods) are useful models that allow the
abstraction of data within a well-defined mathematical formalism. The
representations we aim at are conceptual abstractions of real world
phenomena (such as social interactions, chemical reactions and
biological processes) into the world of statistics and discrete
mathematics in such a way that the powerful tools developed in those
areas are available for complex analyses in a simple and elegant
manner.
The focus will be the understanding and comparison of smart
representations and their explicit/implicit data transformation models.
We will study limitations and advantages of different techniques, and
how the data representation changes the problem setup, reduces
complexity, introduces robustness, or other valuable properties for big
data analytics.
Prerequisites Recommended:
Open-minded for new problem settings, Programming in different
languages (C++, Python, Java), Critical approach to existing
solutions, Research curiosity
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
[1] Sergey Ivanov, Evgeny Burnaev. "Anonymous Walk Embeddings"
ICML, 2018.
[2] Tsitsulin, Anton, Davide Mottin, Panagiotis Karras, and Emmanuel
Müller "VERSE: Versatile Graph Embeddings from Similarity
Measures." WWW, 2018.
[3] Yanardag, Pinar, and S. V. N. Vishwanathan. "Deep graph
kernels." KDD, 2015.
[4] Holger Dell, Martin Grohe, Gaurav Rattan "Lovász Meets
Literature Weisfeiler and Leman". ICALP, 2018
[5] Anton Tsitsulin, Davide Mottin, Panagiotis Karras, Alexander M.
Bronstein, Emmanuel Müller "NetLSD: Hearing the Shape of a
Graph". KDD, 2018
[6] Nino Shervashidze, Pascal Schweitzer, Erik Jan van Leeuwen, Kurt
Mehlhorn, Karsten M. Borgwardt "Weisfeiler-Lehman Graph Kernels".
JMLR, 2011
[7] Haochen Chen, Bryan Perozzi, Yifan Hu, Steven Skiena "HARP:
Hierarchical Representation Learning for Networks". AAAI, 2018.
Master Computer Science — Universität Bonn 125

Module Game AI
MA-INF 4319
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Christian Bauckhage
coordinator
Lecturer(s) Prof. Dr. Christian Bauckhage
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Upon completion, students should be able to
• know about fundamental concepts of artificial intelligence and how
they apply to computer games
• know about basic and advanced methods for planning, problem
solving, and behavior modelling
• implement basic and advanced algorithms for planning, problem
solving, and behavior modelling
• implement numerically robust data clustering and classification
Soft skills Students will learn about mathematical and algorithmic foundations of
artificial intelligence. They will learn about basic and more advanced
techniques for planning, problem solving, and behavior modelling, how
to implement them on their own, and how to put them into practice
especially in the context of artificial computer game agents.
Contents • historical overview of game AI
• basic terms and definitions for AI in games
• backward induction and the minmax algorithm
• alpha-beta pruning, depth restircted searches, features, and
evaluation functions
• (traditional, uninformed) tree search algorithms
• Monte Carlo tree search
• algorithms for path- and motion planning, A* search
• mathematical models and computer algorithms for data clustering
• self organizing maps
• finite state machines for behavior modeling / programming
• fuzzy logic / fuzzy control for behavior modeling / programming
• probability theory and Bayesian networks
• Markov chains / Markov models
• hidden Markov models for behavior modeling and analysis
• Markov decision processes and reinforcement learning
• the Bellman equations for reinforcement learning
• temporal difference learning
• Q learning
• genetic algorithms and genetic programming
Prerequisites Recommended:
Students should good working knowledge in linear algebra, probability
theory, and statistics as well as programming experience.
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Oral exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media • lecture slides are made available online
• lecture notes with programming examples are made available online
Russell and Norvig, "Artificial Intelligence: A Modern Approach"
Literature Millington, "Artificial Intelligence For Games"
MacKay, "Information Theory, Inference, and Learning Algorithms"
Master Computer Science — Universität Bonn 126

Module Lab Representation Learning on Graphs

MA-INF 4320
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Emmanuel Müller
coordinator
Lecturer(s) Prof. Dr. Emmanuel Müller
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of representation learning on graphs, including test and
documentation of the implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 127

Module Seminar Learning from Time Series

MA-INF 4321
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Emmanuel Müller
coordinator
Lecturer(s) Prof. Dr. Emmanuel Müller
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 128

Module Lab Machine Learning on Encrypted Data

MA-INF 4322
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Dr. Michael Nüsken
coordinator
Lecturer(s) Dr. Michael Nüsken
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills The students will carry out a practical task (project) in the
context of Cryptography, including test and documentation of
the implemented software/system.
Soft skills Ability to properly present and defend
design decisions, to prepare readable documentation of software;
skills in constructively collaborating with others in small teams
over a longer period of time; ability to classify ones own results
into the state-of-the-art of the resp. area
Contents With the rise of more and more mechanisms and installations of
data science methodology to automatically analyze large
amounts of possibly privacy infringing data we have to carefully
understand how to protect our data. Also more and more fake
data shows up and we have to find ways to distinguish faked
from trustable data. At the same time we want to allow
insightful research and life-easing analyzes to be possible. This
seeming contradiction has lead to various efforts for unifying
both: protecting data and allowing analyzes, at least to some
extent and possibly under some restrictions. See Munn et al.
(2019) for a review on challenges and options.
The target of the lab is to understand how computations on
encrypted data may work in one particular application that we
are chosing together. Ideally, we can come up with a novel
solution for performing an unconsidered algorithm. We study
the tasks and tools, select algorithms, find a protocol, prototype
an implemention, perform a security analysis, present an
evaluation, ...
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 129

Module Pattern Recognition (2)

MA-INF 4323
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Christian Bauckhage
coordinator
Lecturer(s) Prof. Dr. Christian Bauckhage
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Upon completion, students should be able to
• know about aspects of numerical computing and how these may affect
practical implementations of machine learning / pattern recognition
algorithms
• know about iterative algorithms for machine learning / pattern recognition
with large data sets
• implement numerically robust algorithms for data dimensionality reduction
• implement numerically robust data clustering and classification
Soft skills Students will learn about mathematical and algorithmic foundations of
robust implementations of machine learning algorithms for data analysis and
pattern recognition. They will learn about iterative algorithms and
dynamical systems approaches in this area, how to implement them on their
own, and how to put them into practice.
Contents • advanced concepts from linear algebra
• QR-, spectral-, and singular value decompositions
• iterative algorithms for least squares optimization
• iterative algorithms for principal component analysis
• Hebbian learning and Oja’s rule for principal compoentn analysis
• auto-encoder networks
• associative memory networks
• Hopfield networks
• Hopfield networks for pattern recognition
• Hopfield networks for problem solving
• energy minimization methods in machine learning and pattern recognition
• latent factor models for data analysis
• data matrix factorization techniques
• multidimensional scaling
• manifold learning
• basic graph theory
• graph cuts and graph clustering
• graph diffusion processes
• radial basis functions for interpolation
• radial basis functions for classification
• radial basis functions for density estimation
Prerequisites Recommended:
Students should good working knowledge in linear algebra, probability
theory, and statistics. Ideally, they will have attended the lecture Pattern
Recognition (1).
Teaching format Group size h/week Workload[h] CP
Format Lecture 4 60 T / 105 S 5.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media • lecture slides are made available online
• lecture notes with programming examples are made available online
• MacKay, "Information Theory, Inference, and Learning Algorithms"
• Haykin, "Neural Networks and Learning Machines"
• Bishop, "Neural Networks for Pattern Recognition"
Literature
• Elden, "Matrix Methods in Data Mining and Pattern Recognition"
• Skillicorn, "Understanding Complex Datasets"
• Kirby, "Geometric Data Analysis"
Master Computer Science — Universität Bonn 130

Module Seminar Advanced Topics in Data Science

MA-INF 4324
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Elena Demidova
coordinator
Lecturer(s) Prof. Dr. Elena Demidova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills This module concentrates on specialized topics in data science.
The students obtain skills in the independent, in-depth study of
state-of-the-art scientific literature on specific topics, discussion
with their peers and presentation to the scientific audience.
Soft skills • Communication skills: oral and written presentation of
scientific content.
• Self-competences: the ability to analyze problems, time
management, creativity.
Contents Statistical and machine learning-based methods of data
analytics, including typical steps of the data science process:
data generation, integration, cleaning, exploration, modelling
and evaluation. Specialized data representation and analytics
methods for selected data types and applications in specific
domains.
Prerequisites Recommended:
BA-INF 150 - Einführung in die Data Science
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements None (not graded)
Forms of media
Relevant literature will be announced at the beginning of the
Literature
seminar
Master Computer Science — Universität Bonn 131

Module Lab Data Science in Practice

MA-INF 4325
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Elena Demidova
coordinator
Lecturer(s) Prof. Dr. Elena Demidova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills This module concentrates on practical experience in data
analytics. Participants acquire basic knowledge and practical
experience in the design and implementation of data science
workflows for specific data types and applications.
Soft skills • Communication skills: the ability to work in teams.
• Self-competences: the ability to analyse problems and find
practical solutions. Time management, creativity, presentation
of results.
Contents Practical application of statistical and machine learning-based
methods to solve data analytics problems on real-world datasets
and evaluate proposed solutions.
Prerequisites Recommended:
BA-INF 150 - Einführung in die Data Science
MA-INF 4230 - Advanced Methods of Information Retrieval
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements None (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 132

Module Explainable AI and Applications

MA-INF 4326
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Dr. Tiansi Dong
coordinator
Lecturer(s) Dr. Tiansi Dong
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills • Know the dual-model functioning of the human mind, and two main AI
paradigms
• Develop white-box neural AI systems
• Understand the problems and limitations of Blackbox Deep-Learning
systems, and Know the state-of-the-art Methods for Interpreting
Deep-Learning systems (XAI)
Soft skills • Know System 1 and 2 of the mind, prons and cons of symbolic AI and
connectionist AI
• Develop neural-geometric systems that have both good features of
symbolic AI and connectionist AI
• Know the limitation of famous Deep-Learning systems, such as GPT3,
self-driving. Know standard methods to explore the explainability of
Deep-Learning systems
Contents 1. Introduction: fates of large Deep-Learning systems, e.g. Watson, GPT,
self-driving cars
2. Dual-system theories (System 1 and 2), nine laws of cognition, criteria of
semantic models
3. The target and the state-of-art methods of XAI
4. Neural-symbolic AI
5. Cognitive maps, Collages, Mental Spatial Representation, Events
6. Qualitative Spatial Representation and Reasoning
7. Rotating Sphere Embedding: A New Wheel for Neural-Symbolic
Unification
8. Neural Syllogistic Reasoning
9. Recognizing Variable Environments
10. Humor Understanding
11. Rotating Spheres as building-block semantic components for Language,
Vision, and Action
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Written exam (graded)
Study achievements Successful exercise participation (not graded)
Forms of media
• Kahneman, D. (2011). Thinking fast and slow. Farrar, Straus and Giroux.
• Gaedenfors, P. (2017). The Geometry of Meaning. MIT Press.
• Attardo, Hempelmann, Maio (2003). Script Oppositions and Logical
Mechanisms: Modeling Incongruities and their Resolutions, HUMOR
15(1)3–46
• Tversky, B. (2019). Mind in Motion. Basic Books, New York.
• Dong, et al. (2020). Learning Syllogism with Euler Neural-Networks.
arXiv:2007.07320
Literature
• Dong, T. (2021). A Geometric Approach to the Unification of Symbolic
Structure and Neural Networks. Springer.
• Knauff and Spohn (2021). Handbook of Rationality. MIT Press,
Cambridge, MA, USA.
• Samek et.al. (2019), Explainable AI: Interpreting, Explaining and
Visualizing Deep Learning. Springer.
• Greg Dean (2019). Step by Step to Stand-Up Comedy (Revised Edition).
ISBN: 978-0-9897351-7-9
Master Computer Science — Universität Bonn 133

Module Lab Biomedical Data Science

MA-INF 4327
Workload Credit points Duration Frequency
270 h 9 CP 1 semester every year
Module Prof. Dr. Holger Fröhlich
coordinator
Lecturer(s) Prof. Dr. Holger Fröhlich
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 3.
Technical skills The students will carry out a practical task (project) in the
context of biomedical data science, including test and
documentation of the implemented software/system.
Soft skills Ability to properly present and defend design decisions, to
prepare readable documentation of software; skills in
constructively collaborating with others in small teams over a
longer period of time; ability to classify ones own results into the
state-of-the-art of the resp. area
Contents Varying selected topics close to current research in the area of
biomedical data science.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Lab 8 4 60 T / 210 S 9
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 134

Module Spatio-Temporal Data Analytics

MA-INF 4328
Workload Credit points Duration Frequency
180 h 6 CP 1 semester every year
Module Prof. Dr. Elena Demidova
coordinator
Lecturer(s) Prof. Dr. Elena Demidova
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills This module introduces the students to the advanced methods,
data structures, and data analytics algorithms for
spatio-temporal data. At the end of the module, the students
will be capable of choosing appropriate data representations,
data structures and algorithms for specific applications and
correctly applying relevant statistical and machine
learning-based data analytics procedures.
Soft skills Communication skills: oral and written presentation and
discussion of solutions. Self-competences: the ability to analyze
and solve problems.
Contents The module topics include data structures, data representation
and analysis methods, and algorithms that enable analyzing
spatio-temporal data and building predictive models effectively
and effectively. Furthermore, we will study the corresponding
evaluation techniques and novel applications.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format Lecture 2 30 T / 45 S 2.5
Exercises 2 30 T / 75 S 3.5
T = face-to-face teaching; S = independent study
Exam achievements Schriftliche Prüfung (graded)
Study achievements Erfolgreiche Übungsteilnahme (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 135

Module Seminar Biological Intelligence

MA-INF 4329
Workload Credit points Duration Frequency
120 h 4 CP 1 semester every year
Module Prof. Dr. Dr. Dominik Bach
coordinator
Lecturer(s) Prof. Dr. Dr. Dominik Bach
Programme Mode Semester
Classification
M. Sc. Computer Science Optional 2. or 3.
Technical skills Ability to understand new research results presented in original
scientific papers.
Soft skills Ability to present and to critically discuss these results in the
framework of the corresponding area.
Contents Current conference and journal papers.
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 10 2 30 T / 90 S 4
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation, written report (graded)
Study achievements (not graded)
Forms of media
Literature
Master Computer Science — Universität Bonn 136

5 Master Thesis
MA-INF 0401 30 CP Master Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
MA-INF 0402 2 CP Master Seminar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
Master Computer Science — Universität Bonn 137

Module Master Thesis

MA-INF 0401
Workload Credit points Duration Frequency
900 h 30 CP 1 semester every semester
Module
coordinator
Lecturer(s) All lecturers of computer science
Programme Mode Semester
Classification
M. Sc. Computer Science Compulsory 4.
Technical skills Ability to solve a well-defined, significant research problem
under supervision, but in principle independently
Soft skills Ability to write a scientific documentation of considerable length
according to established scientific principles of form and style, in
particular reflecting solid knowledge about the state-of-the-art in
the field
Contents Topics of the thesis may be chosen from any of the areas of
computer science represented in the curriculum
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Independent 0 900 S 30
Format preparation of a
scientific thesis with
individual coaching
T = face-to-face teaching; S = independent study
Exam achievements Master Thesis (graded)
Study achievements (not graded)
Forms of media
Individual bibliographic research required for identifying
Literature
relevant literature (depending on the topic of the thesis)
Master Computer Science — Universität Bonn 138

Module Master Seminar

MA-INF 0402
Workload Credit points Duration Frequency
60 h 2 CP 1 semester every semester
Module
coordinator
Lecturer(s) All lecturers of computer science
Programme Mode Semester
Classification
M. Sc. Computer Science Compulsory 4.
Technical skills Ability to document and defend the results of the thesis work in
a scientifically appropriate style, taking into consideration the
state-of-the-art in research in the resp. area
Soft skills
Contents Topic, scientific context, and results of the master thesis
Prerequisites none
Teaching format Group size h/week Workload[h] CP
Format
Seminar 2 30 T / 30 S 2
T = face-to-face teaching; S = independent study
Exam achievements Oral presentation of final results (graded)
Study achievements (not graded)
Forms of media
Individual bibliographic research required for identifying
Literature
relevant literature (depending on the topic of the thesis)