Module English

Module Handbook for Master of Science Software Systems Engineering
(Index of Contents)
2 Revision: 13.06.2013 02:26:16
Degree Course Information: Master of Science Software Systems Engineering [MSSSE/11]

Title Short Title Link to Further Information Master of Science Software Systems Engineering SSE (M.Sc.) http://dbis.rwth-aachen.de/SSE/
Module: Network Algorithms [MSSSE-1101101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Routing algorithms for interconnected parallel computers Sorting networks Randomized methods for contention resolution and congestion avoidance Algorithms for wireless networks Data management in networks Theory of peer-to-peer networks Network Algorithms Network Algorithms 1 1 0
Aims and Learning Outcomes
Knowledge about the theory of algorithms for computer networks Ability to model and analyze algorithmic problems arising in computer networks Knowledge about fundamental algorithmic design principles like randomized contention resolution and congestion avoidance
Prerequisites Course Texts
Basic knowledge about algorithms, discrete structures and probability theory
Zur Vorlesung gibt es ein Skript. Empfohlene Bcher F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
Computer Networking: A Top-Down Approach Featuring the Internet. Addison Wesley Longman, 1999.
Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
Englisch Berthold Vcking 6 4 120 Degree elective
Assessment and Qualifications

Title Lecture Network Algorithms Exercise Network Algorithms Revision: 13.06.2013 02:26:16 Ref. Code MSSSE-11011 01.a/11 MSSSE-11011 01.b/11 Credits 0 0 4 Credits Workload 4 2 Contact hours (h) 3 1 Self-Study Time (h) 75 45
Masterexam Network Algorithms
MSSSE-11011 01.c/11
Assessment: Lecture Network Algorithms [MSSSE-1101101.a/11]

Title Short Title Semester of Study Content Lecture Network Algorithms Lecture Network Algorithms 1 see module description Degree elective
Relevance to Degree Programme
Assessment: Exercise Network Algorithms [MSSSE-1101101.b/11]

Title Short Title Semester of Study Content Exercise Network Algorithms Exercise Network Algorithms 1 see module description Degree elective
Assessment: Masterexam Network Algorithms [MSSSE-1101101.c/11]

Title Short Title Semester of Study Content Masterexam Network Algorithms Masterexam Network Algorithms 1 see module description Degree elective
Module: Algorithmic Game Theory [MSSSE-1101102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Introduction to game theory Complexity of game theoretic solution concepts Congestion and potential games Price of anarchy Algorithmic aspects of mechanism design Algorithmic Game Theory Algorithmic Game Theory 1 1 0 Variable
Knowledge of basic game theoretic solution concepts and their complexity Critical understanding of the basic game theoretical assumptions Ability to model problems using game theoretic approaches for the design and analysis of algorithms and networks
Basic knowledge about algorithms, discrete structures, probability theory (stochastic)
N. Nisan, T. Roughgarden, E. Tardos, V. Vazirani. Algorithmic Game Theory, Cambridge University Press, 2007. T. Roughgarden. Selfish Routing and the Price of Anarchy. MIT Press, 2005. A. Mas-Colell, M.D. Whinston, and J.R. Green. Microeconomic Theory. Oxford University Press, 1995. M.J. Osborne. An Introduction to Game Theory. Oxford University Press. 2004.
Englisch Berthold Vcking 6 4 120 Degree elective

Title Lecture Algorithmic Game Theory Exercise Algorithmic Game Theory Ref. Code MSSSE-11011 02.a/11 MSSSE-11011 02.b/11 Credits 0 0 Credits Workload 4 2 Contact hours (h) 3 1 Self-Study Time (h) 75 45
6 Revision: 13.06.2013 02:26:16
Masterexam Algorithmic Game Theory
MSSSE-11011 02.c/11
Assessment: Lecture Algorithmic Game Theory [MSSSE-1101102.a/11]

Title Short Title Semester of Study Content Lecture Algorithmic Game Theory Lecture Algorithmic Game Theory 1 see module description Degree elective
Assessment: Exercise Algorithmic Game Theory [MSSSE-1101102.b/11]

Title Short Title Semester of Study Content Exercise Algorithmic Game Theory Exercise Algorithmic Game Theory 1 see module description Degree elective
Assessment: Masterexam Algorithmic Game Theory [MSSSE-1101102.c/11]

Title Short Title Semester of Study Content Masterexam Algorithmic Game Theory Masterexam Algorithmic Game Theory 1 see module description Degree elective
Module: Algorithmic Cryptography [MSSSE-1101103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Algorithmic Cryptography Algorithmic Cryptography 1 1 0 Zur Vorlesung wird ein Skript erstellt und folgende Literatur empfohlen: H. Delfs, H. Knebl: Introduction to Cryptography. Springer 2002 A. Salomaa: Public-Key Cryptography. Springer 1996. F.L. Bauer: Entzifferte Geheimnisse. Springer 2000.
Englisch Walter Unger 6 5 105 Degree elective

Title Lecure Algorithmic Cryptography Exercise Algorithmic Cryptography Masterexam Algorithmic Cryptography Ref. Code MSSSE-11011 03.a/11 MSSSE-11011 03.b/11 MSSSE-11011 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecure Algorithmic Cryptography [MSSSE-1101103.a/11]

Title Short Title Semester of Study Content Lecure Algorithmic Cryptography Lecture Algorithmic Cryptography 1 see module description Degree elective
Assessment: Exercise Algorithmic Cryptography [MSSSE-1101103.b/11]

Title Short Title Semester of Study Content Exercise Algorithmic Cryptography Exercise Algorithmic Cryptography 1 see module description 8 Revision: 13.06.2013 02:26:16
Degree elective
Assessment: Masterexam Algorithmic Cryptography [MSSSE-1101103.c/11]

Title Short Title Semester of Study Content Masterexam Algorithmic Cryptography Masterexam Algorithmic Cryptography 1 see module description Degree elective
Module: Graph Algorithms [MSSSE-1101104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Graph Algorithms Graph Algorithms 1 1 0 Zur Vorlesung wird ein Skript erstellt und folgende Literatur empfohlen: Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs Harary F.: Graphentheorie, 1974. Wilson R.J.: Einfhrung in die Graphentheorie, 1972
Englisch Walter Unger 6 5 105 Degree elective

Title Lecture Graph Algorithms Exercise Graph Algorithms Masterexam Graph Algorithms Ref. Code MSSSE-11011 04.a/11 MSSSE-11011 04.b/11 MSSSE-11011 04.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Graph Algorithms [MSSSE-1101104.a/11]

Title Short Title Semester of Study Content Lecture Graph Algorithms Lecture Graph Algorithms 1 see module decsription Degree elective
Assessment: Exercise Graph Algorithms [MSSSE-1101104.b/11]

Title Short Title Semester of Study Content Exercise Graph Algorithms Exercise Graph Algorithms 1 see module description 10 Revision: 13.06.2013 02:26:16
Degree elective
Assessment: Masterexam Graph Algorithms [MSSSE-1101104.c/11]

Title Short Title Semester of Study Content Masterexam Graph Algorithms Masterexam Graph Algorithms 1 see module description Degree elective
11
Module: Theoretical Foundations of Distributed Systems [MSSSE-1101106/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Routing in networks: centralized and distributed approaches Randomized methods for contention resolution and congestion avoidance Queueing Theory (stochastic and adversarial) Game theoretic models (esp. congestion games) Distributed Hash Tables Peer-2-Peer Networks (Chord) Wireless networks (Yao graph, broadcasting, SINR model) Theoretical Foundations of Distributed Systems Theoretical Foundations of Distributed Systems 1 1 2
Knowledge about the theoretical foundations of distributed systems with a focus on algorithmic problems and solutions Ability to model algorithmic problems arising in distributed systems Knowledge about fundamental algorithmic design principles like randomized contention resolution and congestion avoidance
Basic knowledge about algorithms, discrete structures, and probability theory
Folien und Skripte Empfohlene Bcher Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes Kurose, Ross: Computer Networking: A Top-Down Approach Featuring the Internet. Addison Wesley Longman, 1999. Kleinberg, Tardos: Algorithm Design, Addison Wesley Pearson, 2005
English Berthold Vcking 6 5 105 Degree elective

Title Lecture Theory of Distributed Systems Ref. Code MSSSE-11011 06.a/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
12 Revision: 13.06.2013 02:26:16
Exercise Theory of Distributed Systems Masterexam Theory of Distributed Systems
MSSSE-11011 06.b/11 MSSSE-11011 06.c/11
0 6
2 0
2 0
30 0
Assessment: Lecture Theory of Distributed Systems [MSSSE-1101106.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Lecture Theory of Distributed Systems Lecture Theory of Distributed Systems 1 Degree elective
Assessment: Exercise Theory of Distributed Systems [MSSSE-1101106.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercise Theory of Distributed Systems Exercise Theory of Distributed Systems 1 Degree elective
Assessment: Masterexam Theory of Distributed Systems [MSSSE-1101106.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Masterexam Theory of Distributed Systems Masterexam Theory of Distributed Systems 1 Degree elective
13
Module: Analysis of Algorithms [MSSSE-1101201/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Analysis of Algorithms Analysis of Algorithms 1 1 0 In this lecture, you learn about basic techniques for the analysis of algorithms and apply them on numerous examples. On one hand, some algorithms will be analyzed in great detail -- culminating in the exact number of machine instructions executed on average --, on the other hand you learn how to get asymptotic estimates of the running time with very little effort. Decomposing algorithms into their basic blocks and findingvrecurrence relations for the number of times they are executed Elementary methods for the solution of these recurrence relations Mathematical techniques for the analysis of algorithms, in particular generating functions, singularity analysis, and saddle point method Gaining experience in the analysis of algorithms by applying all these methods on numerous practical examples
Prerequisites Knowledge of probability theory and basic calculus Knowledge in the field of efficient algorithms
Course Texts
Lecture Notes on Analysis of Algorithms and the books
R. Sedgewick and P. Flajolet. An Introduction to the Analysis of Algorithms. R. Sedgewick and P. Flajolet. Analytic Combinatorics.
Englisch Peter Rossmanith 8 6 150 Degree elective

Title Lecture Analysis of Algorithms Exercise Analysis of Algorithms Masterexam Analysis of Algorithms Revision: 13.06.2013 02:26:16 Ref. Code MSSSE-11012 01.a/11 MSSSE-11012 01.b/11 MSSSE-11012 01.c/11 Credits 0 0 8 14 Credits Workload 6 2 0 Contact hours (h) 4 2 0 Self-Study Time (h) 120 30 0
Assessment: Lecture Analysis of Algorithms [MSSSE-1101201.a/11]

Title Short Title Semester of Study Content Lecture Analysis of Algorithms Lecture Analysis of Algorithms 1 see module description Degree elective
Assessment: Exercise Analysis of Algorithms [MSSSE-1101201.b/11]

Title Short Title Semester of Study Content Exercise Analysis of Algorithms Exercise Analysis of Algorithms 1 see module description Degree elective
Assessment: Masterexam Analysis of Algorithms [MSSSE-1101201.c/11]

Title Short Title Semester of Study Content Masterexam Analysis of Algorithms Masterexam Analysis of Algorithms 1 see module description Degree elective
15
Module: Parameterized Algorithms [MSSSE-1101202/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Parameterized Algorithms Parameterized Algorithms 1 1 0 Many practical problems turned out to be NP-hard and in the classical view they are therefore ``intractable.'' Parameterized algorithms aim at exploiting that practical instances are not as hard as worst case instances. In this lecture, you will learn about such parameterized algorithms and general techniques for their design. We emphasize those techniques that lead to algorithms that are useful in practice. There are also some techniques that easily show that some problems can indeed be solved by a parameterized algorithm, but the running times will be very high. Finally, there are techniques that show that certain problems probably cannot have parameterized algorithms at all based on a complexity theory for parameterized problems. Aims and Learning Outcomes Knowledge of the most important parameterized algorithms and techniques for their design Ability to design efficient parameterized algorithms for decision and optimization problems Basic knowledge of parameterized complexity theory and the ability to show that certain problems probably cannot be solved by parameterized algorithms
Knowledge in Efficient Algorithms
R. Downey and M. Fellows. Parameterized Algorithms. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. J. Flum and M. Grohe. Parameterized Complexity Theory.
Englisch Peter Rossmanith 8 6 150 Degree elective

Title Lecture Parameterized Algorithms Exercise Parameterized Algorithms Masterexam Parameterized Algorithms Ref. Code MSSSE-11012 02.a/11 MSSSE-11012 02.b/11 MSSSE-11012 02.c/11 Credits 0 0 8 Credits Workload 6 2 0 Contact hours (h) 4 2 0 Self-Study Time (h) 120 30 0
16 Revision: 13.06.2013 02:26:16
Assessment: Lecture Parameterized Algorithms [MSSSE-1101202.a/11]

Title Short Title Semester of Study Content Lecture Parameterized Algorithms Lecture Parameterized Algorithms 1 see module description Degree elective
Assessment: Exercise Parameterized Algorithms [MSSSE-1101202.b/11]

Title Short Title Semester of Study Content Exercise Parameterized Algorithms Exercise Parameterized Algorithms 1 see module description Degree elective
Assessment: Masterexam Parameterized Algorithms [MSSSE-1101202.c/11]

Title Short Title Semester of Study Content Masterexam Parameterized Algorithms Masterexam Parameterized Algorithms 1 see module description Degree elective
17
Module: Exact Algorithms [MSSSE-1101203/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content An introduction into exact algorithms fr NP-hard problems, e.g., Branching Dynamic Programming Inclusion-exclusion Measure & Conquer Subset Convolution Exact Algorithms Exact Algorithms 1 1 0 Variable
Aims and Learning Outcomes Prerequisites Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
Ability to develop fast exact algorithms for hard problems Suggested: Efficient Algorithms Aktuelle Verffentlichungen Englisch Peter Rossmanith 8 6 150 Degree elective

Title Lecture Exact Algorithms Exercise Exact Algorithms Masterexam Exact Algorithms Ref. Code MSSSE-11012 03.a/11 MSSSE-11012 03.b/11 MSSSE-11012 03.c/11 Credits 0 0 8 Credits Workload 6 2 0 Contact hours (h) 4 2 0 Self-Study Time (h) 120 30 0
Assessment: Lecture Exact Algorithms [MSSSE-1101203.a/11]

Title Short Title Semester of Study Content Lecture Exact Algorithms Lecture Exact Algorithms 1 see module description
18 Revision: 13.06.2013 02:26:16
Degree elective
Assessment: Exercise Exact Algorithms [MSSSE-1101203.b/11]

Title Short Title Semester of Study Content Exercise Exact Algorithms Exercise Exact Algorithms 1 see module description Degree elective
Assessment: Masterexam Exact Algorithms [MSSSE-1101203.c/11]

Title Short Title Semester of Study Content Masterexam Exact Algorithms Masterexam Exact Algorithms 1 see module description Degree elective
19
Module: Methods in Network Analysis [MSSSE-1101301/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Introduction to the analysis of social networks Computational aspects of centrality measures Random graph models, power laws Computational aspects of clustering measures Cascading Behavior, diffusion of information Viral dynamics and viral marketing Rumor spreading Methods in Network Analysis Methods in Network Analysis 1 1 0
Critical understanding of fundamental modeling assumptions in the networks Knowledge of basic measures for clustering and centrality and aspects
anaylsis of social
their computational
Knowledge of simple models for random graphs and their properties Ability to mathematically model and analyze problems arising in algorithms for social and information networks the design of
Basic knowledge of algorithms, discrete structures
and probability theory
D. Easley, J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010 U. Brandes, T. Erlebach. Network Analysis. Springer Verlag, 2005 D. Wasserman, K. Faust. Social Network Analysis. Cambridge University Press, 1994
Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h)
Englisch Martin Hoefer 6 5 105 20
Revision: 13.06.2013 02:26:16
Degree elective

Title Ref. Code MSSSE-11013 01.a/11 MSSSE-11013 01.b/11 MSSSE-11013 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: [MSSSE-1101301.a/11]
Semester of Study Relevance to Degree Programme 1 Degree elective
Assessment: [MSSSE-1101301.b/11]
Assessment: [MSSSE-1101301.c/11]
21
Module: Model Cecking [MSSSE-1102101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Model Cecking Model Checking 1 1 3 Main topics: Transition systems Concurrent and channel systems Property classes: safety, liveness, invariants, and fairness Linear Temporal Logic (LTL) Computation Tree Logic (CTL) Model Checking algorithms for LTL and (fair) CTL Abstraction: (Bi)simulation
Acquisition of the following proficiencies: Modeling of (concurrent) programs Knowledge of property classes Understanding the construction and functioning of model-checking algorithms for LTL and CTL Understanding of elementary abstraction mechanisms Capability of employing Model Checkers (Spin)
Prerequisites Knowledge of fundamental automata models and regular languages Knowledge of propositional logic Knowledge of basic data structures such as stacks, trees, and graphs and related algorithms Basic knowledge of complexity theory
Course Texts
Folien zur Vorlesung sowie folgende Lehrbcher: C. Baier, J.-P. Katoen: Principles of Model Checking, MIT Press, 2008. M. Huth and M.D. Ryan: Logic in Computer Science, Modelling and Reasoning about Systems, Cambridge Univ. Press, 2004. E.M. Clarke, O. Grumberg, D. Peled: Model Checking, MIT Press, 1999.
Englisch Joost-Pieter Katoen Wolfgang Thomas 6 5 105 22
Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Model Checking Exercise Model Checking Masterexam Model Checking Ref. Code MSSSE-11021 01.a/11 MSSSE-11021 01.b/11 MSSSE-11021 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Model Checking [MSSSE-1102101.a/11]

Title Short Title Semester of Study Content Lecture Model Checking Lecture Model Checking 1 see moduledescription Degree elective
Assessment: Exercise Model Checking [MSSSE-1102101.b/11]

Title Short Title Semester of Study Content Exercise Model Checking Exercise Model Checking 1 see moduledescription Degree elective
Assessment: Masterexam Model Checking [MSSSE-1102101.c/11]

Title Short Title Semester of Study Content Masterexam Model Checking Masterexam Model Checking 1 see moduledescription Degree elective
23
Module: Compiler Construction [MSSSE-1102102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Compiler Construction Compiler Construction 1 1 3 Main topics: Lexical analysis of programs (scanner) Syntactic analysis of programs (parser) Semantic analysis of programs (attribute grammars) Generation of optimization of intermediate code Tools for compiler construction (lex, yacc)
Acquisition of the following proficiencies: Understanding the construction and functioning of compilers for higher-level programming languages Knowledge of using formal methods for syntax specification (regular expressions, context-free and attribute grammars, EBNF) Capability of implementing simple compiler components (scanner, parser) Knowledge of using compiler-generating tools
Prerequisites Understanding essential concepts of imperative and object-oriented programming languages and elementary programming techniques Knowledge of basic data structures such as lists, stacks, queues, and trees Knowledge of fundamental automata models such as finite and pushdown automata
Course Texts
Folien und Skripte zur Vorlesung sowie folgende Lehrbcher: A. Aho, R. Sethi, J. Ullman: Compilers -- Principles, Techniques, and Tools. Addison-Wesley, 1988. A.W. Appel, J. Palsberg: Modern Compiler Implementation in Java. Cambridge University Press, 2002. D. Grune, H.E. Bal, C.J.H. Jacobs, K.G. Langendoen: Modern Compiler Design. Wiley & Sons, 2000.
Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Revision: 13.06.2013 02:26:16
Deutsch Thomas Noll Uwe Naumann 6 5 105 Degree elective 24

Title Lecture Compiler Construction Exercise Compiler Construction Masterexam Compiler Construction Ref. Code MSSSE-11021 02.a/11 MSSSE-11021 02.b/11 MSSSE-11021 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Compiler Construction [MSSSE-1102102.a/11]

Title Short Title Semester of Study Content Lecture Compiler Construction Lecture Compiler Construction 1 see moduledescription Degree elective
Assessment: Exercise Compiler Construction [MSSSE-1102102.b/11]

Title Short Title Semester of Study Content Exercise Compiler Construction Exercise Compiler Construction 1 see moduledescription Degree elective
Assessment: Masterexam Compiler Construction [MSSSE-1102102.c/11]

Title Short Title Semester of Study Content Masterexam Compiler Construction Masterexam Compiler Construction 1 see moduledescription Degree elective
25
Module: Advanced Model Checking [MSSSE-1102103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Advanced Model Checking Advanced Model Checking 1 1 4 Main topics: Abstraction: stutter (bi)simulation Partial-order reduction Binary Decision Diagrams Timed Automata Markov Chains and Decision Processes Timed and Probabilistic CTL Model Checking Probabilistic Processes
Acquisition of the following proficiencies: Fundamental knowledge of formal models for real-time systems Fundamental knowledge of quantitative extensions of CTL Understanding the functioning of Model Checking algorithms for Timed and Probabilistic CTL
Prerequisites Knowledge of elementary probability theory Fundamental knowledge of Model Checking techniques
Course Texts
Folien zur Vorlesung sowie folgende Lehrbcher: C. Baier, J.-P. Katoen: Principles of Model Checking, MIT Press, 2008. J. Rutten, M. Kwiatkowska, G. Norman and D. Parker: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, Volume 23 of CRM Monograph Series. American Mathematical Society, P. Panangaden and F. van Breugel (eds.), March 2004. M. Huth and M.D. Ryan: Logic in Computer Science -- Modelling and Reasoning about Systems, Cambridge University Press, 2nd edition, 2004 E.M. Clarke, O. Grumberg, D.A. Peled: Model Checking, MIT Press, 1999 K.L. McMillan: Symbolic Model Checking, Kluwer Academic, 1993
Englisch Joost-Pieter Katoen 6 5 105
26 Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Advanced Model Checking Exercise Advanced Model Checking Masterexam Advanced Model Checking Ref. Code MSSSE-11021 03.a/11 MSSSE-11021 03.b/11 MSSSE-11021 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Advanced Model Checking [MSSSE-1102103.a/11]

Title Short Title Semester of Study Content Lecture Advanced Model Checking Lecture Advanced Model Checking 1 see moduledescription Degree elective
Assessment: Exercise Advanced Model Checking [MSSSE-1102103.b/11]

Title Short Title Semester of Study Content Exercise Advanced Model Checking Exercise Advanced Model Checking 1 see moduledescription Degree elective
Assessment: Masterexam Advanced Model Checking [MSSSE-1102103.c/11]

Title Short Title Semester of Study Content Masterexam Advanced Model Checking Masterexam Advanced Model Checking 1 see moduledescription Degree elective
27
Module: Semantics and Verification of Software [MSSSE-1102104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Introduction of WHILE model language Operational, denotational, and axiomatic semantics of WHILE Equivalence of operational and denotational semantics Dataflow analysis and abstract interpretation Abstraction and refinement Semantics and Verification of Software Semantics and Verification of Software 1 1 0
Acquisition of the following proficiencies: Understanding the fundamental concepts of formal semantics for imperative programming languages Capability of reasoning using formal derivation and proof systems Knowledge of basic techniques for program analysis Capability of applying formal concepts for proving compiler correctness Knowledge of using program analysis tools
Prerequisites Understanding essential concepts of imperative and object-oriented programming languages and elementary programming techniques Knowledge of foundations of formal systems and automata theory Fundamental knowledge of mathematical logic
Course Texts
Folien und Skripte zur Vorlesung sowie folgende Lehrbcher: G. Winskel: The Formal Semantics of Programming Languages. MIT Press, 1993. F. Nielson, H.R. Nielson, C. Hankin: Principles of Program Analysis, 2nd ed., Springer, 2005. H.R. Nielson, F. Nielson: Semantics with Applications: A Formal Introduction, Wiley, 1992.
Deutsch/Englisch Thomas Noll 6 5 105 Degree elective

28 Revision: 13.06.2013 02:26:16
Title Lecture Semantics and Verification of Software Exercise Semantics and Verification of Software Masterexam Semantics and Verification of Software
Ref. Code MSSSE-11021 04.a/11 MSSSE-11021 04.b/11 MSSSE-11021 04.c/11
Credits 0 0 6
Credits Workload 4 2 0
Contact hours (h) 3 2 0
Self-Study Time (h) 75 30 0
Assessment: Lecture Semantics and Verification of Software [MSSSE-1102104.a/11]

Title Short Title Semester of Study Content Lecture Semantics and Verification of Software Lecture Semantics and Verification of Software 1 see moduledescription Degree elective
Assessment: Exercise Semantics and Verification of Software [MSSSE-1102104.b/11]

Title Short Title Semester of Study Content Exercise Semantics and Verification of Software Exercise Semantics and Verification of Software 1 see moduledescription Degree elective
Assessment: Masterexam Semantics and Verification of Software [MSSSE-1102104.c/11]

Title Short Title Semester of Study Content Masterexam Semantics and Verification of Software Masterexam Semantics and Verification of Software 1 see moduledescription Degree elective
29
Module: Modeling Concurrent and Probabilistic Systems [MSSSE-1102105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Modeling Concurrent and Probabilistic Systems Modeling Concurrent and Probabilistic Systems 1 1 0 Main topics: Milner's Calculus of Communicating Systems (CCS) and its Semantics Equivalence of CCS Processes Case Study: the Alternating-Bit Protocol Stochastic Processes Probabilistic Process Algebra and its Semantics Equivalence of Probabilistic Processes Probabilities and Nondeterminism Markovian Process Algebra
Acquisition of the following proficiencies: Formal methods for modeling concurrent systems Fundamentals of Markov Chains Fundamentals of process algebras Understanding of probabilistiv process algebras Knowledge of definition and applications of equivalences for reducing state spaces
Prerequisites Knowledge of fundamental automata models such as finite and pushdown automata Knowledge of elementary probability theory
Course Texts
Folien und Skripte zur Vorlesung sowie folgende Lehrbcher: R. Milner: Communicating and Mobile Systems: the pi-Calculus. Cambridge University Press, 1999 R. Milner: Communication and Concurrency. Prentice Hall, 1989 H.C. Tijms: A first course in stochastic models. Wiley, 2003 J. Bergstra, A. Ponse, S.A. Smolka: Handbook of Process Algebra. Elsevier, 2001 (Chapters 6 and 11) J. Hillston: A Compositional Approach to Performance Modelling. Cambridge University Press, 1996 H. Hermanns: Interactive Markov Chains: The Quest for Quantified Quality. LNCS 2428, Springer 2002 E. Brinksma, H. Hermanns, J.-P. Katoen: Lectures on Formal Methods and Performance Analysis. LNCS 2090, Springer 2001
Language of Instruction Module Coordinator
Deutsch/Englisch Joost-Pieter Katoen 30
Revision: 13.06.2013 02:26:16
Thomas Noll Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme 6 5 105 Degree elective

Title Lecture Modeling Concurrent and Probabilistic Systems Exercise Modeling Concurrent and Probabilistic Systems Masterexam Modeling Concurrent and Probabilistic Systems Ref. Code MSSSE-11021 05.a/11 MSSSE-11021 05.b/11 MSSSE-11021 05.c/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
30
Assessment: Lecture Modeling Concurrent and Probabilistic Systems [MSSSE-1102105.a/11]

Title Short Title Semester of Study Content Lecture Modeling Concurrent and Probabilistic Systems Lecture Modeling Concurrent, Probabilistic Systems 1 see moduledescription Degree elective
Assessment: Exercise Modeling Concurrent and Probabilistic Systems [MSSSE-1102105.b/11]

Title Short Title Semester of Study Content Exercise Modeling Concurrent and Probabilistic Systems Exercise Modeling Concurrent , Probabilistic Syst. 1 see moduledescription Degree elective
Assessment: Masterexam Modeling Concurrent and Probabilistic Systems [MSSSE-1102105.c/11]

Title Short Title Semester of Study Content Masterexam Modeling Concurrent and Probabilistic Systems Masteream Modeling Concurrent, Probabilistic Syst. 1 see moduledescription Degree elective
31
Module: Foundations of the UML [MSSSE-1102106/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Foundations of the UML Foundations of the UML 1 1 0 Main topics: Sequence diagrams and their semantics Elementary properties of sequence diagrams High-level sequence graphs Communicating finite automata Realizability Statecharts and their semantics Object Constraint Language (OCL) and its semantics
Acquisition of the following proficiencies: Fundamental knowledge of UML diagrams Understanding of formal semantics of sequence diagrams and Statecharts Knowledge of the Object Constraint Language Capability of applying formal modelling techniques to software systems
Prerequisites Knowledge of fundamental automata models such as finite and pushdown automata Fundamental knowledge of mathematical logic Knowledge of discrete mathematics Basic knowledge of complexity theory
Course Texts
Folien und Skripte zur Vorlesung sowie folgende Lehrbcher: Jos Warmer and Anneke Kleppe, Object Constraint Language, The: Precise Modeling with UML. Addison Wesley, 2001. D. Harel and M. Politi, Modeling Reactive Systems with Statecharts: The STATEMATE Approach, McGraw-Hill, 1998.
Deutsch/Englisch Joost-Pieter Katoen 6 5 105 Degree elective
32 Revision: 13.06.2013 02:26:16

Title Lecture Foundations of the UML Exercie Foundations of the UML Masterexam Foundations of the UML Ref. Code MSSSE-11021 06.a/11 MSSSE-11021 06.b/11 MSSSE-11021 06.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Foundations of the UML [MSSSE-1102106.a/11]

Title Short Title Semester of Study Content Lecture Foundations of the UML Lecture Foundations of the UML 1 see moduledecsription Degree elective
Assessment: Exercie Foundations of the UML [MSSSE-1102106.b/11]

Title Short Title Semester of Study Content Exercie Foundations of the UML Exercise Foundations of the UML 1 see moduledescription Degree elective
Assessment: Masterexam Foundations of the UML [MSSSE-1102106.c/11]

Title Short Title Semester of Study Content Masterexam Foundations of the UML Masterexam Foundations of the UML 1 see moduledescription Degree elective
33
Module: Testing of Reactive Systems [MSSSE-1102107/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Testing of Reactive Systems Testing of Reactive Systems 1 1 0 Main topics: Groundwork: automata, labelled transitions systems, specification of processes Observation of processes Conformance of processes Derivation of test cases from transition systems Incorporating the quantitative notion of time into test cases Symbolic testing
Acquisition of the following proficiencies: Basic knowledge of how to describe behaviour, and how to distinguish it by observation In-depth knowledge of the prevalent theories for specification-based testing, in particular for functional and timed testing Proficiency in proving simple theorems in the context of the lecture
Basic knowledge of finite automata theory Skript Testing of Reactive Systems---Course Notes, on-line erhltlich. Folgende Lehrbcher als ergnzende Literatur: Manfred Broy, Bengt Jonsson, Joost-Pieter Katoen, Martin Leucker, Alexander Pretschner: Model-Based Testing of Reactive Systems (Advanced Lectures), Volume 3472 of Lecture Notes in Computer Science. Springer-Verlag, 2005
Englisch Henrik Bohnenkamp Joost-Pieter Katoen 6 4 120 Degree elective

Title Lecture Testing of Reactive Systems Exercise Testing of Reactive Systems Ref. Code MSSSE-11021 07.a/11 MSSSE-11021 07.b/11 Credits 0 0 Credits Workload 4 2 Contact hours (h) 3 1 Self-Study Time (h) 75 45
34 Revision: 13.06.2013 02:26:16
Masterexam Testing of Reactive Systems
MSSSE-11021 07.c/11
Assessment: Lecture Testing of Reactive Systems [MSSSE-1102107.a/11]

Title Short Title Semester of Study Content Lecture Testing of Reactive Systems Lecture Testing of Reactive Systems 1 see moduledescription Degree elective
Assessment: Exercise Testing of Reactive Systems [MSSSE-1102107.b/11]

Title Short Title Semester of Study Content Exercise Testing of Reactive Systems Exercise Testing of Reactive Systems 1 see moduledescription Degree elective
Assessment: Masterexam Testing of Reactive Systems [MSSSE-1102107.c/11]

Title Short Title Semester of Study Content Masterexam Testing of Reactive Systems Masterexam Testing of Reactive Systems 1 see moduledescription Degree elective
35
Module: Static Program Analysis [MSSSE-1102109/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Flemming Nielson, Hanne R. Nielson, Chris Hankin: Principles of Program Analysis. 2. Ausgabe, Springer, 2005 Helmut Seidl, Reinhard Wilhelm, Sebastian Hack: Ubersetzerbau 3: Analyse und Transformation. Springer, 2009 Steven S. Muchnick, Neil D. Jones: Program Flow Analysis: Theory and Applications. Prentice Hall, 1981 Static Program Analysis Static Program Analysis 1 1 0
Deutsch/Englisch Thomas Noll 6 5 105 Degree elective

Title Lecture Static Program Analysis Exercise Static Program Analysis Masterexam Static Program Analysis Ref. Code MSSSE-11021 09.a/11 MSSSE-11021 09.b/11 MSSSE-11021 09.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Static Program Analysis [MSSSE-1102109.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Lecture Static Program Analysis Lecture Static Program Analysis 1 Degree elective
Assessment: Exercise Static Program Analysis [MSSSE-1102109.b/11]

Title Semester of Study Relevance to Degree Programme Exercise Static Program Analysis 1 Degree elective
36 Revision: 13.06.2013 02:26:16
Assessment: Masterexam Static Program Analysis [MSSSE-1102109.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Masterexam Static Program Analysis Masterexam Static Program Analysis 1 Degree elective
37
Module: Concurrency Theory [MSSSE-1102110/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Concurrency Theory Concurrency Theory 1 1 4 Main topics: 1. 2. 3. 4. 5. 6. Introduction The Interleaving Approach The True Concurrency Approach Refinement and Compositionality Case Studies and Tools Extensions
Acquire the knowledge and competences to: understand the foundations of concurrent systems model (and compare) concurrent systems in a rigorous manner understand the main semantical underpinnings of concurrency
Prerequisites Knowledge of fundamental automata models (Course Formale Systeme, Automaten und Prozesse) Understanding of the working principles of parallel and distributed systems (Courses Betriebssysteme und Systemsoftware and Systemprogrammierung)
Course Texts
Folien und Skripte zur Vorlesung sowie folgende Lehrbcher: Luca Aceto, Anna Inglfsdttir, Kim Guldstrand Larsen and Jiri Srba: Reactive Systems: Modelling, Specification and Verification. Cambridge University Press, 2007. Maurice Herlihy and Nir Shavit: The Art of Multiprocessor Programming. Elsevier, 2008. Jan Bergstra, Alban Ponse and Scott Smolka (Eds.): Handbook of Process Algebra. Elsevier, 2001. Wolfgang Reisig: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer Verlag, 2012.
Deutsch/Englisch Joost-Pieter Katoen Thomas Noll 6 5 105 Degree elective
38 Revision: 13.06.2013 02:26:16

Title Lecture Concurrency Theory Exercise Concurrency Theory Exam Concurrency Theory Ref. Code MSSSE-11021 10.a/11 MSSSE-11021 10.b/11 MSSSE-11021 10.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Concurrency Theory [MSSSE-1102110.a/11]

Title Short Title Semester of Study Content Lecture Concurrency Theory Lecture Concurrency Theory 1 see module description Degree elective
Assessment: Exercise Concurrency Theory [MSSSE-1102110.b/11]

Title Short Title Semester of Study Content Exercise Concurrency Theory Exercise Concurrency Theory 1 see module description Degree elective
Assessment: Exam Concurrency Theory [MSSSE-1102110.c/11]

Title Short Title Semester of Study Content Exam Concurrency Theory Exam Concurrency Theory 1 see module description Degree elective
39
Module: Term Rewrite Systems [MSSSE-1102201/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Term Rewrite Systems Term Rewrite Systems 1 1 0 basics syntax of equations semantics of equations term rewriting equational reasoning congruence closure term rewrite systems termination of term rewriting decidability results reduction relations simplification orders and recursive path orders confluence of term rewriting local confluence critical pairs completion of term rewrite systems Knuth-Bendix completion implicit induction
learning how to use term rewrite techniques in all areas that require symbolic computation with equations learning how to use term rewrite techniques for the specification, analysis, and verification of programs. In particular, term rewrite techniques can be used to analyze whether programs are deterministic analyze whether programs terminate analyze whether programs are correct complete programs and specifications that are incomplete
Prerequisites first basic knowledge on functional programming would be advantageous, but is not required (lecture Programming Concepts) first basic knowledge on predicate logic would beadvantageous, but is not required (lecture Mathematical Logic)
40 Revision: 13.06.2013 02:26:16
Course Texts
Skript und Folien zur Vorlesung sowie z.B. folgende Bcher: J. Avenhaus: Reduktionssysteme, Springer, 1995. F. Baader, T. Nipkow: Term Rewriting and All That, Cambridge University Press, 1998. R. Bndgen: Termersetzungssysteme, Vieweg, 1998. E. Ohlebusch: Advanced Topics in Term Rewriting, Springer, 2002 Terese: Term Rewriting Systems, Cambridge University Press, 2003.
Deutsch/Englisch Jrgen Giesl 6 5 105 Degree elective

Title Lecture Term Rewrite Systems Exercise Term Rewrite Systems Masterexam Term Rewrite Systems Ref. Code MSSSE-11022 01.a/11 MSSSE-11022 01.b/11 MSSSE-11022 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Term Rewrite Systems [MSSSE-1102201.a/11]

Title Short Title Semester of Study Content Lecture Term Rewrite Systems Lecture 1 see module description Degree elective
Assessment: Exercise Term Rewrite Systems [MSSSE-1102201.b/11]

Title Short Title Semester of Study Content Exercise Term Rewrite Systems Exercise Term Rewrite Systems 1 see module description Degree elective
Assessment: Masterexam Term Rewrite Systems [MSSSE-1102201.c/11]

Title Short Title Masterexam Term Rewrite Systems Masterexam Term Rewrite Systems 41
Semester of Study Content
1 see module description Degree elective
42 Revision: 13.06.2013 02:26:16
Module: Logic Programming [MSSSE-1102202/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Logic Programming Logic Programming 1 1 0 basics of predicate logic unification resolution Horn clauses and SLD-resolution logic programs operational and denotational semantics evaluation strategies the programming language Prolog negation-as-failure non-logical components of Prolog programming techniques applications and extensions of logic programming Aims and Learning Outcomes learning the programming techniques in logic languages knowledge of the concepts and the logical foundations of logic languages learning how to formally define the semantics of logic programming languages learning how to implement logic languages learning how to use logic languages in different application areas
Prerequisites basic programming concepts (lecture Programming Concepts) first basic knowledge on logic programming would be advantageous, but is not required (lecture Programming Concepts) first basic knowledge on predicate logic would be advantageous, but is not required (lecture Mathematical Logic)
Course Texts
Skript und Folien zur Vorlesung sowie z.B. folgende Bcher: I. Bratko: Prolog Programming for Artificial Intelligence, Addison-Wesley, 2001. W. F. Clocksin, C. S. Mellish: Programming in Prolog, Springer, 2003. T. Frwirth, S. Abdennadher: Essentials of Constraint Programming, Springer, 2003. M. Hanus: Problemlsen mit Prolog, Teubner, 1987. J. W. Lloyd: Foundations of Logic Programming, Springer, 1987. P. H. Schmitt: Theorie der logischen Programmierung, Springer, 1992. L. Sterling, E. Shapiro: The art of Prolog, MIT Press, 2000.
43

Title Lecture Logic Programming Exercise Logic Programming Masterexam Logic Programming Ref. Code MSSSE-11022 02.a/11 MSSSE-11022 02.b/11 MSSSE-11022 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Logic Programming [MSSSE-1102202.a/11]

Title Short Title Semester of Study Content Lecture Logic Programming Lecture Logic Programming 1 see module description Degree elective
Assessment: Exercise Logic Programming [MSSSE-1102202.b/11]

Title Short Title Semester of Study Content Exercise Logic Programming Exercise Logic Programming 1 see module description Degree elective
Assessment: Masterexam Logic Programming [MSSSE-1102202.c/11]

Title Short Title Semester of Study Content Masterexam Logic Programming Masterexam Logic Programming 1 see module description Degree elective
44 Revision: 13.06.2013 02:26:16
Module: Functional Programming [MSSSE-1102203/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Functional Programming Functional Programming 1 1 0 introduction to the programming language Haskell syntax of the different language constructs higher-order functions programming with lazy evaluation monads denotational semantics of functional programs complete partial orders and fixpoints denotational semantics of Haskell lambda calculus syntax and operational semantics of the lambda calculus reducing Haskell to the lambda calculus type checking and inference Aims and Learning Outcomes learning the programming techniques in functional languages knowledge of the foundational concepts behind functional languages learning how to formally define the semantics of functional programming languages learning how to implement functional languages learning how to develop type checking techniques for functional languages
Prerequisites basic programming concepts (lecture Programming Concepts) first basic knowledge on functional programming would be advantageous, but is not required (lecture Programming Concepts)
Course Texts
Skript und Folien zur Vorlesung sowie z.B. folgende Bcher: R. Bird: Introduction to Functional Programming Using Haskell, Prentice Hall, 1998. G. Hutton: Programming in Haskell, Cambridge University Press, 2007. B. O'Sullivan, D. Stewart, J. Goerzen: Real World Haskell, O'Reilly, 2008. P. Pepper: Funktionale Programmierung, Springer, 2002. C. Reade: Elements of Functional Programming, Addison-Wesley, 1989. P. Thiemann: Grundlagen der Funktionalen Programmierung, Teubner, 1994.
Deutsch/Englisch Jrgen Giesl 45
Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
6 5 105 Degree elective

Title Lecture Functional Programming Exercise Functional Programming Masterexam Functional Programming Ref. Code MSSSE-11022 03.a/11 MSSSE-11022 03.b/11 MSSSE-11022 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Functional Programming [MSSSE-1102203.a/11]

Title Short Title Semester of Study Content Lecture Functional Programming Lecture Functional Programming 1 see module description Degree elective
Assessment: Exercise Functional Programming [MSSSE-1102203.b/11]

Title Short Title Semester of Study Content Exercise Functional Programming Exercise Functional Programming 1 see module description Degree elective
Assessment: Masterexam Functional Programming [MSSSE-1102203.c/11]

Title Short Title Semester of Study Content Masterexam Functional Programming Masterexam Functional Programming 1 see module description Degree elective
46 Revision: 13.06.2013 02:26:16
Module: Deductive Program Verification [MSSSE-1102204/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Deductive Program Verification Deductive Program Verification 1 1 0 basics many-sorted predicate logic relations syntax and semantics of functional programs partial correctness specifications proving correctness by induction verification techniques for partial correctness symbolic evaluation automation of induction proofs heuristics applying lemmata verification techniques for termination analysis termination proofs with reduction orders termination proofs with dependency pairs
learning how to use automated reasoning techniques for program verification knowledge about automated techniques for automated induction proofs in order to verify partial correctness of programs knowledge about methods for automated termination analysis of programs learning how to implement and optimize automated program verification techniques learning how to develop heuristics in order to improve the automation of verification techniques
Prerequisites first basic knowledge on functional programming would be advantageous, but is not required (lecture Programming Concepts) first basic knowledge on predicate logic would be advantageous, but is not required (lecture Mathematical Logic)
Course Texts
Skript und Folien zur Vorlesung sowie z.B. folgende Literatur: T. Arts, J. Giesl: Termination of Term Rewriting Using Dependency Pairs, Theoretical Computer Science, 236:133-178, 2000. K. H. Blsius, H.-J. Brckert: Deduktionssysteme, Oldenbourg, 1992. 47
A. Bundy: The Automation of Proof by Mathematical Induction, Handbook of Automated Reasoning, pages 845-911, Elsevier & MIT Press, 2001. C. Walther: Mathematical Induction, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 2, pages 127-227, Oxford University Press, 1994. C. Walther: Semantik und Programmverifikation, Teubner-Wiley, 2001.

Title Lecture Deductive Program Verification Exercise Deductive Program Verification Masterexam Deductive Program Verification Ref. Code MSSSE-11022 04.a/11 MSSSE-11022 04.b/11 MSSSE-11022 04.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Deductive Program Verification [MSSSE-1102204.a/11]

Title Short Title Semester of Study Content Lecture Deductive Program Verification Lecture Deductive Program Verification 1 see module description Degree elective
Assessment: Exercise Deductive Program Verification [MSSSE-1102204.b/11]

Title Short Title Semester of Study Content Exercise Deductive Program Verification Exercise Deductive Program Verification 2 see module description Degree elective
Assessment: Masterexam Deductive Program Verification [MSSSE-1102204.c/11]

Title Short Title Semester of Study Content Masterexam Deductive Program Verification Masterexam Deductive Program Verification 1 see module description 48 Revision: 13.06.2013 02:26:16
Degree elective
49
Module: Modeling and analysis of hybrid systems [MSSSE-1102301/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Modeling and analysis of hybrid systems Modeling and analysis of hybrid systems 1 1 2 Hybrid systems are systems with mixed discrete-continuous behaviour. They are everywhere. Physical systems with a discrete part in their control, like automobiles, aircrafts, and other transport systems, robots etc. are hybrid systems. But also software whose real-time behaviour is relevant can be seen as a hybrid system. Such systems play an important role in, e.g., CAD (Computer Aided Design), real-time software, robotics, process control, and computer-aided verification. In the last years we can observe an intensive development in this area. New methodologies were developed to model such kind of systems and to analyse their behaviour. In this lecture we follow this development and deal with different aspects of hybrid systems, from their modeling to their verification. Contents: Discrete, continuous, and dynamic systems, hybrid systems, examples Zeno-behaviour, stability non-linear
Modeling: Hybrid Automata Some important features: Determinism, blocking systems, etc.
Interesting classes of hybrid systems: Timed Automata, linear systems, systems Analysis: Model Checking, deduction, abstraktion, simulation, testing Controller synthesis
The lecture should teach the students how to model, specify, implement, and analyse real-time software systems or discrete controller for continuous systems. None Wird in der Vorlesung bekannt gegeben. Deutsch/Englisch Erika Abraham 6 4 120 Degree elective

Title Lecture Modeling and analysis of hybrid systems Exercise Modeling and analysis of hybrid systems Ref. Code MSSSE-11023 01.a/11 MSSSE-11023 01.b/11 Credits 0 0 Credits Workload 4 2 Contact hours (h) 3 1 Self-Study Time (h) 75 45
50 Revision: 13.06.2013 02:26:16
Masterexam Modeling and analysis of hybrid systems
MSSSE-11023 01.c/11
Assessment: Lecture Modeling and analysis of hybrid systems [MSSSE-1102301.a/11]

Title Semester of Study Content Lecture Modeling and analysis of hybrid systems 1 see moduledescription Degree elective
Assessment: Exercise Modeling and analysis of hybrid systems [MSSSE-1102301.b/11]

Title Short Title Semester of Study Content Exercise Modeling and analysis of hybrid systems Exercise Modeling and analysis of hybrid systems 1 see moduledescription Degree elective
Assessment: Masterexam Modeling and analysis of hybrid systems [MSSSE-1102301.c/11]

Title Short Title Semester of Study Content Masterexam Modeling and analysis of hybrid systems Masterexam Modeling and analysis of hybrid systems 1 see moduledescription Degree elective
51
Module: Satisfiability Checking [MSSSE-1102302/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Propositional logic, the satisfiability problem, satisfiability check (SAT-solving) Propositional logic with quantifiers (QBF-solving) First-order logic, theories Theory of equalities and uninterpreted functions, satisfiability check Theory of the reals with addition, satisfiability check (the Simplex method, the Branch and Bound method, Fourier-Motzkin variable elimination) SAT-solving + Theory-solving: Satisfiability modulo theories (SMT-solving) Deduction, theorem proving Approximative methods Application: Bounded model checking (transition systems, expressing bounded reachability, expressing safety and lifeness properties) Satisfiability Checking Satisfiability Checking 1 1 2
The students should be able to formalize certain problems in an adequate logic/theory, and check the satisfiability of the resulting formula with the help of adequate algorithms. This way they can decide if the problem is solvable, and eventually determine a satisfying solution. The following skills are attained: Problem formalization, application of satisfiability checking algorithms, especially for verification purposes.
Prerequisites
As regarding contents, the following moduls are needed: Mathematical logic, as well as Algorithms and data structures.
Course Texts
Folien der Vorlesung und die folgenden Bcher: Daniel Kroening, Ofer Strichman: Decision Procedures: An Algorithmic Point of View. Springer Berlin, 2008 Aaron R. Bradley, Zohar Manna: The Calculus of Computation: Decision Procedures with Applications to Verification. Springer, Berlin. 2007
Deutsch oder Englisch Erika Abraham 6 5 105
52 Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Satisfiability Checking Exercises Satisfiability Checking Masterexam Satisfiability Checking Ref. Code MSSSE-11023 02.a/11 MSSSE-11023 02.b/11 MSSSE-11023 02.c/11 Credits 0 0 6 Credits Workload 4.5 1.5 0 Contact hours (h) 3 1 0 Self-Study Time (h) 90 30 0
Assessment: Lecture Satisfiability Checking [MSSSE-1102302.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Lecture Satisfiability Checking Lecture Satisfiability Checking 5 Degree elective
Assessment: Exercises Satisfiability Checking [MSSSE-1102302.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercises Satisfiability Checking Exercises Satisfiability Checking 5 Degree elective
Assessment: Masterexam Satisfiability Checking [MSSSE-1102302.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Masterexam Satisfiability Checking Masterexam Satisfiability Checking 5 Degree elective
53
Module: Applied Automata Theory [MSSSE-1107101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Miminization of automata and bisimulation Learning of regular languages Weighted automata, including probabilistic automata Automata und logic Pushdown systems Undecidable problems in automata theory Petri nets Applied Automata Theory AAT 1 1 2
Clear conception of basic state-based models in computer science Ability to assess models with respect to the fundamental properties of expressiveness and algorithmic complexity
Prerequisites Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
Courses 'Formal Systems, Automata, Processes', 'Computability and Complexity', 'Logic' of Bachelor Curriculum W. Thomas, Applied Automata Theory, Lecture Notes, RWTH Aachen Englisch Wolfgang Thomas 6 5 105 Degree elective

Title Lecture Applied Automata Theory Exercise Applied Automata Theory Masterexam Applied Automata Theory Ref. Code MSSSE-11071 01.a/11 MSSSE-11071 01.b/11 MSSSE-11071 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Applied Automata Theory [MSSSE-1107101.a/11]

Title Short Title Lecture Applied Automata Theory Lecture Applied Automata Theory
54 Revision: 13.06.2013 02:26:16
Assessment: Exercise Applied Automata Theory [MSSSE-1107101.b/11]

Title Short Title Semester of Study Content Exercise Applied Automata Theory Exercise Applied Automata Theory 1 see module description Degree elective
Assessment: Masterexam Applied Automata Theory [MSSSE-1107101.c/11]

Title Short Title Semester of Study Content Masterexam Applied Automata Theory Mastereaxm Applied Automata Theory 1 see module description Degree elective
55
Module: Infinite Games [MSSSE-1107102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Graph-based games and the associated problem of solution Regular winning conditions for infinite games Solution of reachability games and Bchi games Solution of Muller games and parity games Application to automata on infinite trees Decidability of MSO-logic and other logics over infinite trees Outlook 1: Mean pay-off games Outlook 2: Games on infinite graphs, the Borel hierarchy Infinite Games Infinite Games 1 1 2
Knowledge of infinite games as a model for reactive systems Understanding of the algorithmic content of the theory of infinite games Ability to apply game theoretic concepts and algorithms in logic as well as in the verification and synthesis of systems
Courses of Theoretical Computer Science of Bachelor Curriculum Course 'Infinite Computations' W. Thomas, Automata and Reactive Systems, Lecture Notes, RWTH Aachen 2003 Englisch Wolfgang Thomas 6 5 105 Degree elective

Title Lecture Infinite Games Exercise Infinite Games Masterexam Infinite Games Ref. Code MSSSE-11071 02.a/11 MSSSE-11071 02.b/11 MSSSE-11071 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Infinite Games [MSSSE-1107102.a/11]

Title Lecture Infinite Games 56 Revision: 13.06.2013 02:26:16
Short Title Semester of Study Content
Lecture Infinite Games 1 see module description Degree elective
Assessment: Exercise Infinite Games [MSSSE-1107102.b/11]

Title Short Title Semester of Study Content Exercise Infinite Games Exercise Infinite Games 1 see module description Degree elective
Assessment: Masterexam Infinite Games [MSSSE-1107102.c/11]

Title Short Title Semester of Study Content Masterexam Infinite Games Masterexam Infinite Games 1 see module description Degree elective
57
Module: Tree Automaton [MSSSE-1107103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Finite automata on ranked trees: bottom-up und top-down tree automata, closure properties and algorithms, regular expressions and grammars, connection to logic Finite automata on unranked trees: coding by ranked trees, connection to XML schema languages Sequential automaton models: tree walking automata, XPath Tree transformations Tree Automaton Tree Automaton 1 1 4 Variable
Understanding of the concept of finite automata on branching structures and their applications Ability to apply the automata theoretic view on schema languages for XML documents
Prerequisites
Courses 'Formale Systeme, Automaten, Prozesse', 'Berechenbarkeit und Komplexitt', 'Mathematische Logik' of Bachelor Curriculum; Knowledge from the course 'Applied Automata Theory' is helpful but not required. Tree Automata: Techniques and Applications. Comon, Hubert; Dauchet, Max; Gilleron, Remi; Jacquemard, Florent; Lding, Christof and Lugiez, Denis; Tison, Sophie; Tommasi, Marc Deutsch/Englisch Wolfgang Thomas 4 3 75 Degree elective
Course Texts

Title Lecture Tree Automaton Exercise Tree Automaton Masterexam Tree Automaton Ref. Code MSSSE-11071 03.a/11 MSSSE-11071 03.b/11 MSSSE-11071 03.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Tree Automaton [MSSSE-1107103.a/11]

Title Lecture Tree Automaton
58 Revision: 13.06.2013 02:26:16
Lecture Tree Automaton 1 see module description Degree elective
Assessment: Exercise Tree Automaton [MSSSE-1107103.b/11]

Title Short Title Semester of Study Content Exercise Tree Automaton Exercise Tree Automaton 1 see module description Degree elective
Assessment: Masterexam Tree Automaton [MSSSE-1107103.c/11]

Title Short Title Semester of Study Content Masterexam Tree Automaton Masterexam Tree Automaton 1 see module description Degree elective
59
Module: Recursion Theory [MSSSE-1107104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts W. Thomas, Rekursionstheorie, Skript, RWTH Aachen 2004. N. Cutland, An Introduction to Recursive Function Theory, Cambridge Univ. Press 1980 H. Rogers, Theory of Recursive Functions and Effective Computability, McGrwa Hill 1967 Recursion Theory Recursion Theory 1 1 0
Deutsch Wolfgang Thomas 4 3 75 Degree elective

Title Lecture Recursion Theory Exercise Recursion Theory Masterexam Recursion Theory Ref. Code MSSSE-11071 04.a/11 MSSSE-11071 04.b/11 MSSSE-11071 04.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Recursion Theory [MSSSE-1107104.a/11]

Title Short Title Semester of Study Content Lecture Recursion Theory Lecture Recursion Theory 1 see module description Degree elective
Assessment: Exercise Recursion Theory [MSSSE-1107104.b/11]

Title Short Title Semester of Study Content Exercise Recursion Theory Exercise Recursion Theory 1 see module description
60 Revision: 13.06.2013 02:26:16
Degree elective
Assessment: Masterexam Recursion Theory [MSSSE-1107104.c/11]

Title Short Title Semester of Study Content Masterexam Recursion Theory Masterexam Recursion Theory 1 see module description Degree elective
61
Module: Infinite Computations [MSSSE-1107105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Infinite Computations Infinite Computations 1 1 2 Part I: Automata on infinite words 1. Bchi automata and regular omega-languages 2. Deterministic automata on infinite words 3. Classification of sequence properties (safety, recurrence, etc.) Part II: Applications 4. Decidability results on logical systems 5. Automata theoretic approach to model-checking 6. Algorithmic results on linear constraints for real numbers Part III: Outlook 7. Context-free omega-languages 8. The Borel hierarchy Aims and Learning Outcomes Clear conception of infinite objects in computer science and how algorithmic problems on them can be solved Acquaintance with the fundamentals of automata over infinite objects
Course Texts W. Thomas, Automata and Reactive Systems, Lecture Notes, RWTH Aachen. D. Perrin, J.E. Pin, Infinite Words, Elsevier 2000. Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Englisch Wolfgang Thomas 6 5 105 Degree elective

Title Lecture Infinite Computations Exercise Infinite Computations Masterexam Infinite Computations Ref. Code MSSSE-11071 05.a/11 MSSSE-11071 05.b/11 MSSSE-11071 05.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Infinite Computations [MSSSE-1107105.a/11]

Title Short Title Lecture Infinite Computations Lecture Infinite Computations
62 Revision: 13.06.2013 02:26:16
Assessment: Exercise Infinite Computations [MSSSE-1107105.b/11]

Title Short Title Semester of Study Content Exercise Infinite Computations Exercise Infinite Computations 1 see module description Degree elective
Assessment: Masterexam Infinite Computations [MSSSE-1107105.c/11]

Title Short Title Semester of Study Content Masterexam Infinite Computations Masterexam Infinite Computations 1 see module description Degree elective
63
Module: Regular and Context-Free Languages: Advanced Results [MSSSE-1107106/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Regular and Context-Free Languages: Advanced Results RCL: Advanced Results 1 1 3 Part I: Regular Languages 1. Star-height and the star-height problem 2. Star-free languages, first-order logic and Schtzenberger's Theorem 3. Regular languages and circuit complexity Part II: Context-Free Languages 4. Chomsky-Schtzenberger Theorem 5. Generators of context-free, linear, and one counter-languages 6. Deterministic context-free languages Aims and Learning Outcomes Insight into the wide applicability of regular and context-free languages classification
Knowledge of different viewpoints on these language classes, their and algorithmic results.
Course Texts H. Straubing, Finite Boston 1994. J. Berstel, M.A. Harrison, Mass. 1978. W. Automata, Formal Logic, and Circuit Complexity, Birkhuser,
Transductions and Context-Free Languages, Teubner, Stuttgart Introduction to Formal Language Theory, Addison-Wesley, Reading, Aachen
Thomas, Lecture Notes on regular and context-free languages, RWTH
Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
Wolfgang Thomas 4 3 75 Degree elective

Title Lecture Regular and context-free languages: Advanced results Exercise Regular and context-free languages: Advanced results Masterexam Regular and context-free languages: Advanced results Ref. Code MSSSE-11071 06.a/11 MSSSE-11071 06.b/11 MSSSE-11071 06.c/11 Credits 0 Credits Workload 2.5 Contact hours (h) 2 Self-Study Time (h) 45
1.5
30
Assessment: Lecture Regular and context-free languages: Advanced results [MSSSE-1107106.a/11]

64 Revision: 13.06.2013 02:26:16
Title Short Title Semester of Study Content
Lecture Regular and context-free languages: Advanced results Lecture RCL: Advanced Results 1 see module description Degree elective
Assessment: Exercise Regular and context-free languages: Advanced results [MSSSE-1107106.b/11]

Title Short Title Semester of Study Content Relevance to Degree Programme Exercise Regular and context-free languages: Advanced results Exercise RCL: Advanced Results 1 see module description Degree elective
Assessment: Masterexam Regular and context-free languages: Advanced results [MSSSE-1107106.c/11]

Title Short Title Semester of Study Content Masterexam Regular and context-free languages: Advanced results Masterexam RCL: Advanced Results 1 see module description Degree elective
65
Module: [MSSSE-1107201/11]
Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Folien zur Vorlesung sowie folgende Lehrbcher: Kearns, Vazirani: An Introduction to Computational Learning Theory, MIT Press, 1994 Fischer: Algorithmisches Lernen, Teubner, 1999 1 1 0
Deutsch/Englisch Christof Lding 4 3 75 Degree elective

66 Revision: 13.06.2013 02:26:16
Module: Complexity theory and quantum computing [MSSSE-1107301/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Complexity theory and quantum computing Complexity theory and quantum computing 1 1 0 Variable Deterministic, non-deterministic, parallel and probabilistic models of computations and associated complexity classes, complete problems, introduction to the mathematical and physical foundations of quantum computing, quantum bits and quantum registers, quantum gate arrays, important quantum algorithms, especially Shor's factorisation algorithm The students shall be enabled to classify problems according to their complexity. They shall become acquainted with the most important complexity classes for deterministic, non-deterministic, parallel and probabilistic models of computation and their relationship. Furthermore, the students shall become proficient in the foundations and important algorithms in quantum computing. Successful completion of modules Mathematical Foundations, Linear Algebra I and basic knowledge of the modules algebra, predictability and complexity Skript zur Vorlesung; C. Papadimitriou, Computational Complexity, Addison Wesley 1994; M. Hirvensalo, Quantum Computing, Springer, 2001; M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000 Deutsch oder Englisch Erich Grdel 8 6 150 Degree elective

67
Semester of Study Relevance to Degree Programme
1 Degree elective
68 Revision: 13.06.2013 02:26:16
Module: Mathematical Logic II [MSSSE-1107302/11]

Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Skript zur Vorlesung; A. Levy, Basic Set Theory, Springer 1979; W. Hodges, Model Theory, Cambridge University Press, 1994 Mathematical Logic II 1 1 0 Variable
Deutsch oder Englisch Erich Grdel 8 6 150 Degree elective

Title Lecture Mathematical Logic II Exercise Mathematical Logic II Masterexam Mathematical Logic II Ref. Code MSSSE-11073 02.a/11 MSSSE-11073 02.b/11 MSSSE-11073 02.c/11 Credits 0 0 8 Credits Workload 6 2 0 Contact hours (h) 4 2 0 Self-Study Time (h) 120 30 0
Assessment: Lecture Mathematical Logic II [MSSSE-1107302.a/11]

Title Short Title Semester of Study Content Lecture Mathematical Logic II Lecture Mathematical Logic II 1 see module description Degree elective
Assessment: Exercise Mathematical Logic II [MSSSE-1107302.b/11]

Title Short Title Semester of Study Content Exercise Mathematical Logic II Exercise Mathematical Logic II 1 see module description 69
Degree elective
Assessment: Masterexam Mathematical Logic II [MSSSE-1107302.c/11]

Title Short Title Semester of Study Content Masterexam Mathematical Logic II Masterexam Mathematical Logic II 1 see module description Degree elective
70 Revision: 13.06.2013 02:26:16
Module: Algorithmic Model Theory [MSSSE-1107303/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Skript zur Vorlesung; H.-D. Ebbinghaus, J. Flum, Finite Model Theory, Springer 1995; E. Grdel et al., Finite Model Theory and its Applications, Springer 2006; N. Immerman, Descriptive Complexity, Springer 1999; L. Libkin, Elements of Finite Model Theory, Springer 2004 Algorithmic Model Theory Algorithmic Model Theory 1 1 0 Variable

Title Lecture Algorithmic Model Theory Exercise Algorithmic Model Theory Masterexam Algorithmic Model Theory Ref. Code MSSSE-11073 03.a/11 MSSSE-11073 03.b/11 MSSSE-11073 03.c/11 Credits 0 0 8 Credits Workload 6 2 0 Contact hours (h) 4 2 0 Self-Study Time (h) 120 30 0
Assessment: Lecture Algorithmic Model Theory [MSSSE-1107303.a/11]

Title Short Title Semester of Study Content Lecture Algorithmic Model Theory Lecture Algorithmic Model Theory 1 see module description Degree elective
Assessment: Exercise Algorithmic Model Theory [MSSSE-1107303.b/11]

Title Exercise Algorithmic Model Theory 71
Exercise Algorithmic Model Theory 1 see module description Degree elective
Assessment: Masterexam Algorithmic Model Theory [MSSSE-1107303.c/11]

Title Short Title Semester of Study Content Masterexam Algorithmic Model Theory Masterexam Algorithmic Model Theory 1 see modle description Degree elective
72 Revision: 13.06.2013 02:26:16
Module: Logic and Games [MSSSE-1107304/11]

Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Skript zur Vorlesung; E. Grdel, W. Thomas, Th. Wilke (Eds.), Automata, Logics and Infinite Games, Springer 2002; M. Osborne, A. Rubinstein, A Course in Game Theory, The MIT Press, Cambridge, MA 1994 Logic and Games 1 1 0 Variable

Title Lecture Logic and Games Exercise Logic and Games Masterexam Logic and Games Ref. Code MSSSE-11073 04.a/11 MSSSE-11073 04.b/11 MSSSE-11073 04.c/11 Credits 0 0 8 Credits Workload 6 2 0 Contact hours (h) 4 2 0 Self-Study Time (h) 120 30 0
Assessment: Lecture Logic and Games [MSSSE-1107304.a/11]

Title Short Title Semester of Study Content Lecture Logic and Games Lecture Logic and Games 1 see module description Degree elective
Assessment: Exercise Logic and Games [MSSSE-1107304.b/11]

Title Short Title Semester of Study Exercise Logic and Games Exercise Logic and Games 1 73
Content
see module description Degree elective
Assessment: Masterexam Logic and Games [MSSSE-1107304.c/11]

Title Short Title Semester of Study Content Masterexam Logic and Games Masterexam Logic and Games 1 see module description Degree elective
74 Revision: 13.06.2013 02:26:16
Module: Distributed Applications and Middleware [MSSSE-1204101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Distributed Applications and Middleware Distributed Applications and Middleware 1 1 2 Communication in distributed systems Client/Server model RPC and RMI Message-based systems Name services Basic functionality of name services, Domain Name System (DNS) Directory services Discovery services Location services Synchronization in distributed systems Synchronization with reference clock, Network Time Protocol (NTP) Logical synchronization: Lamport timestamps, vector timestamps Coordination in distributed systems Algorithms for mutual exclusion Algorithms for voting and election Distributed transactions Replication in distributed systems Data and object replication Replication algorithms for performance increasment Replication algorithms for fault tolerance Replication and transactions Middleware The Common Object Request Broker Architecture (CORBA) CORBA Component Model WebServices Service composition
Acquisition of the following Knowledge and practical skills: Knowledge about basic concepts of communication in distributed systems Knowledge about common algorithms and protocols for synchronization, coordination, and replication of distributed application objects Knowledge about common middleware concepts Ability to choose suitable synchronization and coordination algorithms for given problems Ability to develop distributed applications using the presented middleware technologies
Prerequisites Basic Knowledge in computer networks and communication protocols (e.g., lecture Sichere Verteilte Systeme) Basic Knowledge in operating systems (e.g., lecture Betriebssysteme und Systemsoftware) 75
Course Texts Tanenbaum, A.S.; van Steen, M.: Distributed Systems - Principles and Paradigms. Prentice-Hall, 2nd Edition, 2007. Coulouris, G.; Dollimore, J.; Kindberg, T.: Distributed Systems - Concepts and Design. Addison-Wesley, 4th Edition, 2005.
Englisch Otto Spaniol 6 4 120 Degree elective

Title Lecture Distributed Applications and Middleware Exercise Distributed Applications and Middleware Masterexam Distributed Applications and Middleware Ref. Code MSSSE-12041 01.a/11 MSSSE-12041 01.b/11 MSSSE-12041 01.c/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
45
Assessment: Lecture Distributed Applications and Middleware [MSSSE-1204101.a/11]

Title Short Title Semester of Study Content Lecture Distributed Applications and Middleware Lecture Distributed Applications and Middleware 1 see module description Degree elective
Assessment: Exercise Distributed Applications and Middleware [MSSSE-1204101.b/11]

Title Short Title Semester of Study Content Exercise Distributed Applications and Middleware Exercise Distributed Applications and Middleware 1 see module descrition Degree elective
Assessment: Masterexam Distributed Applications and Middleware [MSSSE-1204101.c/11]

Title Masterexam Distributed Applications and Middleware
76 Revision: 13.06.2013 02:26:16
Masterexam Distributed Applications and Middleware 1 see module description Degree elective
77
Module: Mobile Communications [MSSSE-1204102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Mobile Communications Mobile Communications 1 1 2 Basic technologies for wireless communications Modulation and antenna characteristics Multipath propagation Multiplexing of data streams (FDMA, TDMA, CDMA) Overview on medium access control for wireless networks Wireless networks for data transmission Personal Area Networks: Bluetooth, Ultra-Wideband, Zigbee Local Area Networks: WLAN Metropoliaton/Wide Area networks: WiMAX Wireless networks for voice transmission DECT for cordless telephony GSM and GPRS for mobile telephony and data transmission UMTS and current enhancements Internet protocols and mobility Mobile IP as an enhancement of IP for mobile devices Routing in ad-hoc networks Influence of mobility on TCP Influence of mobility on application protocols
Acquisition of the following Knowledge and practical skills: Knowledge on current technologies for wireless transmissions Knowledge on current developments in wireless network technologies Knowledge on the effect of mobility on the Internet protocols Ability to set up wireless networks
Basic knowledge in computer networks and communication protocols (e.g., lecture Sichere Verteilte Systeme) Schiller, J.: Mobile Communications. Addison Wesley, 2nd Edition, 2003. Sauter, M.: Grundkurs Mobile Kommunikationssysteme. Vieweg, 2nd Edition, 2006.
Englisch Otto Spaniol 6 4 120
78 Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Mobile Communications Exercise Mobile Communications Masterexam Mobile Communications Ref. Code MSSSE-12041 02.a/11 MSSSE-12041 02.b/11 MSSSE-12041 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Mobile Communications [MSSSE-1204102.a/11]

Title Short Title Semester of Study Content Lecture Mobile Communications Lecture Mobile Communications 1 see module description Degree elective
Assessment: Exercise Mobile Communications [MSSSE-1204102.b/11]

Title Short Title Semester of Study Content Exercise Mobile Communications Exercise Mobile Communications 1 see module description Degree elective
Assessment: Masterexam Mobile Communications [MSSSE-1204102.c/11]

Title Short Title Semester of Study Content Masterexam Mobile Communications Masterexam Mobile Communications 1 see module description Degree elective
79
Module: Modelling and Evaluation of Communication Systems [MSSSE-1204103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Modelling and Evaluation of Communication Systems Modelling and Evaluation of Communication Systems 1 1 0 Use of stochastics in performance evaluation Discrete random variables and distributions Continuous random variables and distributions The memoryless property Poisson processes Markov processes and Markov chains Example analysis: ALOHA Queueing systems Description of queueing systems M/M/1 systems, Little's result M/G/1 systems, Pollazcek formula Birth and death processes Application examples Queueing networks Product form of queueing networks Jackson networks Gordon-Newell networks BCMP networks Performance analysis Performance analysis of Client/Server systems Techniques for performance evaluation Simulation techniques Trace-Driven simulations Event-Driven simulations Generation of random numbers Analysis of simulation results
Acquisition of the following Knowledge and practical skills: Knowledge about simple queueing systems for modelling single processes knowledge about queueing networks for combining simple queueing systems Knowledge about techniques for performance analysis of communication systems based on queueing networks Knowledge about simulation techniques Capability to apply queueing networks and simulation techniques for evaluation of communication systems before their implementation
Prerequisites Basic knowledge in computer networks and communication protocols (e.g., lecture Sichere Verteilte Systeme) Basic Knowledge in stochastics (e.g., lecture Stochastik fr Informatiker) 80 Revision: 13.06.2013 02:26:16
Course Texts Bolch, G.; Greiner, S.; Trevedi, K.; de Meer, H.: Queueing networks and Markov Chains. Wiley VCH, 1998. Haverkort, B.: Performance of Computer Communication Systems. Wiley VCH, 1998. Otto Spaniol, Mesut Gnes: Skript zur Vorlesung - Modellierung und Bewertung von Kommunikationssystemen, Lehrstuhl fr Informatik 4, RWTH-Aachen, 2001 (in German).
Englisch Otto Spaniol 6 4 120 Degree elective

Title Lecture Modelling and Evaluation of Communication Systems Exercise Modelling and Evaluation of Communication Systems Masterexam Modelling and Evaluation of Communication Systems Ref. Code MSSSE-12041 03.a/11 MSSSE-12041 03.b/11 MSSSE-12041 03.c/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
45
Assessment: Lecture Modelling and Evaluation of Communication Systems [MSSSE-1204103.a/11]

Title Short Title Semester of Study Content Lecture Modelling and Evaluation of Communication Systems Lecture Modelling Evaluation of Comm.Systems 1 see module description Degree elective
Assessment: Exercise Modelling and Evaluation of Communication Systems [MSSSE-1204103.b/11]

Title Short Title Semester of Study Content Exercise Modelling and Evaluation of Communication Systems Exercise Modelling Evaluation of Comm.Systems 1 see module description Degree elective
Assessment: Masterexam Modelling and Evaluation of Communication Systems [MSSSE-1204103.c/11]

81
Masterexam Modelling and Evaluation of Communication Systems Masterexam Modelling Evaluation of Comm.Systems 1 see module description Degree elective
82 Revision: 13.06.2013 02:26:16
Module: Multimedia Systems [MSSSE-1204104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Multimedia Systems Multimedia Systems 1 1 0 Multimedia formats Representation and coding of audio data, especially PCM Representation and coding of pictures, especially JPEG and JPEG2000 Representation and coding of videodata, especially MPEG Internet technology and protocols for multimedia communication Group communication, video conferences, and Voice over IP Quality of Service in the Internet (Diffserv, Intserv, MPLS) Streaming and real-time transmission protocols (e.g. RTP) Router enhancements Control protocols for session management (e.g. SIP) Synchronisation of data streams Operating system aspects Real-time CPU scheduling Storage of multimedia data Optical media (CD and DVD) Multimedia file systems Selected topics of current research Aims and Learning Outcomes Acquisition of the following Knowledge and practical skills: Knowledge of basic concepts for working with audio, video, and picture files Knowledge abaout common data formats, especially PCM (Audio), JPEG (pictures) and MPEG (Video) Knowledge of current Internet technologies and protocols for efficient transmission and control of mulimedia transmissions Knowledge about operating system enhamncements for real-time applications Capability to use the gained knowledge, e.g. for implementing multimedia applicaitons which make use of the above techniques
Prerequisites Basic knowledge in computer networks and communication protocols (e.g., lecture Sichere Verteilte Systeme) Basic knowledge in operating systems (e.g., lecture Betriebssysteme und Systemsoftware)
Course Texts Steinmetz, R.; Nahrstedt, K.: Media Coding and Content Processing. Prentice Hall, 2002. Steinmetz, R.; Nahrstedt, K.: Multimedia Systems. Springer, 2004. Steinmetz, R.; Nahrstedt, K.: Multimedia Applications. Springer, 2004.
Englisch Otto Spaniol
83
6 4 120 Degree elective

Title Lecture Multimedia-Systems Exercise Multimedia-Systems Masterexam Multimedia-Systems Ref. Code MSSSE-12041 04.a/11 MSSSE-12041 04.b/11 MSSSE-12041 04.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Multimedia-Systems [MSSSE-1204104.a/11]

Title Short Title Semester of Study Content Lecture Multimedia-Systems Lecture Multimedia-Systems 1 see module description Degree elective
Assessment: Exercise Multimedia-Systems [MSSSE-1204104.b/11]

Title Short Title Semester of Study Content Exercise Multimedia-Systems Exercise Multimedia-Systems 1 see module decsription Degree elective
Assessment: Masterexam Multimedia-Systems [MSSSE-1204104.c/11]

Title Short Title Semester of Study Content Masterexam Multimedia-Systems Masterexam Multimedia-Systems 1 see module description Degree elective
84 Revision: 13.06.2013 02:26:16
Module: Security in Communication Systems [MSSSE-1204105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Security in Communication Systems Security in Communication Systems 1 1 0 Cryptography Symmetric Cryptography: stream ciphers and block ciphers, Data Encryption Standard (DES) and Advanced Encryption Standard (AES) Public key cryptography: RSA algorithm, Diffie-Hellman for key exchange, Digital Signature Standard (DSS) Cryptographic hash functions: MD2, MD4, MD5, Secure Hash Standard (SHS) Cryptographic authentication, Key Distribution Center Secure Internet protocols IPSec, Security Associations and Internet Key Exchange Secure Socket Layer (SSL) and Transport Layer Security (TLS) Secure Shell (SSH), Privacy Enhanced Mail (PEM) and Pretty Good Privacy (PGP) Security concepts in networks Kerberos for authentication Firewalls Intrusion Detection Selected topics on current developments in security Aims and Learning Outcomes Acquisition of the following Knowledge and practical skills: Knowledge about basic concepts about symmetric and asymmetric cryptography Knowledge about common authentication techniques and systems Knowledge about known security problems and solutions developed for the Internet Capability to apply the learned techniques to certian problems
Prerequisites Basic knowledge in computer networks and communication protocols (e.g., lecture Sichere Verteilte Systeme) Basic knowledge in cryptography (e.g., lecture Sichere Verteilte Systeme) Basic knowledge in modular arithemtics (e.g., lecture Diskrete Strukturen)
Course Texts Schneier, B.: Applied Cryptography. Wiley, 2nd Edition, 1996. Kaufman, C.; Perlman, R.; Speciner, M.: Network Security. Prentice Hall, 2002. Mao, W.: Modern Cryptography. Prentice Hall, 2004. Spaniol, O.; Gnes, M.: Sicherheit in Kommunikationsnetzen (in German). Skript zur Vorgngerversion der Vorlesung, Wissenschaftsverlag Mainz, 2000.
Language of Instruction Module Coordinator Credits Contact Hours per week
Englisch Otto Spaniol 6 4 85
Self-Study Time (h) Relevance to Degree Programme
120 Degree elective

Title Lecture Security in Communication Systems Exercise Security in Communication Systems Masterexam Security in Communication Systems Ref. Code MSSSE-12041 05.a/11 MSSSE-12041 05.b/11 MSSSE-12041 05.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Security in Communication Systems [MSSSE-1204105.a/11]

Title Short Title Semester of Study Content Lecture Security in Communication Systems Lecture Security in Communication Systems 1 see module description Degree elective
Assessment: Exercise Security in Communication Systems [MSSSE-1204105.b/11]

Title Short Title Semester of Study Content Exercise Security in Communication Systems Esercise Security in Communication Systems 1 see module description Degree elective
Assessment: Masterexam Security in Communication Systems [MSSSE-1204105.c/11]

Title Short Title Semester of Study Content Masterexam Security in Communication Systems Masterexam Security in Communication Systems 1 see module description Degree elective
86 Revision: 13.06.2013 02:26:16
Module: Advanced Internet Technology (Massively Distributed Systems I) [MSSSE-1204106/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Advanced Internet Technology (Massively Distributed Systems I) Advanced Internet Technology 1 1 2 This lecture builds upon the contents of the lecture Datenkommunikation und Sicherheit. It presents alternate communication paradigms that build upon the existing Internet technology: - Peer-to-Peer systems - Wireless Sensor Networks - Communication Systems Engineering - New trends in Internet technology - An understanding how overlay systems can help to overcome existing limitations in communication systems - Knowledge structured and unstructured Peer-to-Peer approaches - Applications of Peer-to-Peer systems - Challenges and application scenarios of Wireless Sensor Networks - Specialized protocols for Wireless Sensor Networks - Cross-Layer techniques, modular protocol stacks and how they can help to solve problems of layered network architectures - Knowledge of new trends in Internet technology Contents of the lecture Data Communication and Security (formerly Secure Distributed Systems) Steinmetz, Wehrle (Eds.): Peer-to-Peer Systems and Applications, Springer, 2005. Zustzlich: Folien zur Vorlesung
Language of Instruction Grading Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
Englisch The grade is based 100% on a final examination (written exam with 90 minutes duration). Klaus Wehrle 6 4 120 Degree elective

Title Lecture Advanced Internet Technology (Massiv Verteilte Systeme I) Exercise Advanced Internet Technology (Massiv Verteilte Systeme I) Masterexam Advanced Internet Technology (Massiv Verteilte Systeme I) Ref. Code MSSSE-12041 06.a/11 MSSSE-12041 06.b/11 MSSSE-12041 06.c/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
45
87
Assessment: Lecture Advanced Internet Technology (Massiv Verteilte Systeme I) [MSSSE-1204106.a/11]

Title Short Title Semester of Study Content Lecture Advanced Internet Technology (Massiv Verteilte Systeme I) Lecture Advanced Internet Technology 5 see module description Degree elective
Assessment: Exercise Advanced Internet Technology (Massiv Verteilte Systeme I) [MSSSE-1204106.b/11]

Title Short Title Semester of Study Content Exercise Advanced Internet Technology (Massiv Verteilte Systeme I) Exercise Advanced Internet Technology 5 see module description Degree elective
Assessment: Masterexam Advanced Internet Technology (Massiv Verteilte Systeme I) [MSSSE-1204106.c/11]

Title Short Title Semester of Study Content Masterexam Advanced Internet Technology (Massiv Verteilte Systeme I) Masterexam Advanced Internet Technology 5 see module description Degree elective
88 Revision: 13.06.2013 02:26:16
Module: Multimedia Internet Technology [MSSSE-1204107/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content This lecture discusses the formats and characteristics of multimedia data, as well as the resulting requirements for Internet protocols for transmitting such data in streaming- and interactive applications: Compression and coding Data formats: images, video and audio (JPEG, MPEG, mp3), container formats HTTP as transmission protocol Content delivery networks Streaming applications: admission control and buffering, RTP/RTCP and RTSP Interactive applications: SIP Quality of Service in the Internet Multimedia frameworks, e.g. Flash, HTML5 Multimedia Internet Technology Multimedia Internet Technology 1 1 2
Acquisition of the following Knowledge and Practical Skills: Knowledge of basic concepts for working with audio, video, and image data Knowledge about common data formats and their characteristics Knowledge of current Internet technologies and protocols for efficient transmission and control of mulimedia information Capability to use the gained knowledge, e.g. for implementing multimedia applicaitons which make use of the above techniques
Contents of the lecture Secure Distributed Systems resp. Data Communication and Security
Lecture slides References to single chapters will be given during the lecture
English Klaus Wehrle 6 4 89
120 Degree elective

Title Lecture Multimedia Internet Technology Exercise Multimedia Internet Technology Masterexam Multimedia Internet Technology Ref. Code MSSSE-12041 07.a/11 MSSSE-12041 07.b/11 MSSSE-12041 07.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Multimedia Internet Technology [MSSSE-1204107.a/11]

Title Semester of Study Relevance to Degree Programme Lecture Multimedia Internet Technology 1 Degree elective
Assessment: Exercise Multimedia Internet Technology [MSSSE-1204107.b/11]

Title Semester of Study Relevance to Degree Programme Exercise Multimedia Internet Technology 1 Degree elective
Assessment: Masterexam Multimedia Internet Technology [MSSSE-1204107.c/11]

Title Semester of Study Relevance to Degree Programme Masterexam Multimedia Internet Technology 1 Degree elective
90 Revision: 13.06.2013 02:26:16
Module: Security in the Internet of Things [MSSSE-1204108/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content This lecture addresses security issues and solutions for the Internet of Things Topics: Security fundamentals: security goals, cryptography, block ciphers, hash functions, and public-key cryptography Internet of Things (IoT) and security IoT: definition, features, and applications Levels: device, network, and system Security features and functionalities at each level Security in the Internet of Things SecIoT 1 1 2
Special techniques for: pairwise key agreement broadcast authentication Group key management Access control
Security protocols in the IoT: ZigBee & Bluetooth IP protocols Designing a security architecture for the IoT
Acquisition of the following Knowledge and Practical Skills: Knowledge: On successful completion of this module, students should be able to understand the meaning of IoT and its security challenges describe security functionalities, protocols, and architectures for the IoT
Skills: They should be able to analyze security requirements of an IoT application propose security solutions for given applications
Competences: Based on the knowledge and skills acquired they should be able to 91
identify security problems and apply security solutions to other areas as well.
Knowledge of security and protocols.
A.J. Menezes, P.C.v. Oorschot und SA Vanstone: Handbook of Applied Cryptography, online verfgbar unter http://cacr.uwaterloo.ca/hac/
Zustzlich wird whrend der Vorlesung auf einige relevante Paper verwiesen, die in Eigenstudium durchzuarbeiten sind.
Englisch Klaus Wehrle 2 1 45 Degree elective

Title Lecture Security in the Internet of Things Masterexam Security in the Internet of Things Ref. Code MSSSE-12041 08.a/11 MSSSE-12041 08.c/11 Credits 0 2 Credits Workload 2 0 Contact hours (h) 1 0 Self-Study Time (h) 45 0
Assessment: Lecture Security in the Internet of Things [MSSSE-1204108.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Lecture Security in the Internet of Things Lecture SecIoT 1 Degree elective
Assessment: Masterexam Security in the Internet of Things [MSSSE-1204108.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Masterexam Security in the Internet of Things Masterexam SecIoT 1 Degree elective
92 Revision: 13.06.2013 02:26:16
Module: Mobile Communication & Sensor Networks (Massively Distributed Systems II) [MSSSE-1204202/11]
Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Basics of mobile Internet and Sensor-based systems: characteristics, challenges and goals Examples and design principles of mobile Internet and sensor-based systems Sensor-based systems * Application scenarios * Design of sensor nodes * Architecture of sensor networks * Challenges in sensor networks - Energy-aware MAC & link layer - Naming & addressing - Clock synchronization - Localization and positioning - Topology control & Routing protocols Mobility in the Internet (approaches and protocols) Mobile communication technologies (GSM, UMTS, ...) Mobile communication for the Internet (802.11, WiMAX, Wireless Mesh Networks) Mobile Communication & Sensor Networks (Massively Distributed Systems II) Mobile Communication & Sensor Networks 1 1 2
Acquisition of fundamental knowledge about mobile Internet and sensor-based systems Ability to systematically analyse and realise mobile Internet/sensor-based systems for given applications
Lecture Sichere Verteilte Systeme
Karl, Willig: Protocols and Architectures for Wireless Sensor Networks, Wiley, 2004 Jochen Schiller: Mobile Communications, 2. Auflage, Addison Wesley, 2004

Title Lecture Mobile Communication & Sensor Ref. Code MSSSE-12042 Credits 0 93 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
Networks (Massively Distributed Systems II) Exercise Mobile Communication & Sensor Networks (Massively Distributed Systems II) Masterexam Mobile Communication & Sensor Networks (Massively Distributed Systems II)
02.a/11 MSSSE-12042 02.b/11 0 2 1 45
MSSSE-12042 02.c/11
Assessment: Lecture Mobile Communication & Sensor Networks (Massively Distributed Systems II) [MSSSE-1204202.a/11]
Title Short Title Semester of Study Content Lecture Mobile Communication & Sensor Networks (Massively Distributed Systems II) Lecture Mobile Communication & Sensor Networks 1 see module description Degree elective
Assessment: Exercise Mobile Communication & Sensor Networks (Massively Distributed Systems II) [MSSSE-1204202.b/11]
Title Short Title Semester of Study Content Exercise Mobile Communication & Sensor Networks (Massively Distributed Systems II) Exercise Mobile Communication & Sensor Networks 1 see module description Degree elective
Assessment: Masterexam Mobile Communication & Sensor Networks (Massively Distributed Systems II) [MSSSE-1204202.c/11]
Title Short Title Semester of Study Content Masterexam Mobile Communication & Sensor Networks (Massively Distributed Systems II) Masterexam Mobile Communication & Sensor Networks 1 see module description Degree elective
94 Revision: 13.06.2013 02:26:16
Module: Communication Systems Engineering 2 - Simulation, Evaluation and Analysis [MSSSE-1204203/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Communication Systems Engineering 2 - Simulation, Evaluation and Analysis Communication Systems Engineering 2 1 1 2 The lecture bases on two parts: Lecture Discrete Event Simulation given by Prof. Dr. James Gross (2 SWS) Compact course and practical exercises on Modeling and Simulation of Networks by Prof. Dr. Klaus Wehrle (1+1 SWS) The first part of the course will give an introduction to simulation techniques. The focus of the course will be on discrete event simulation. Simulation is widely used to evaluate systems in generally and computer communication networks in particular. In this course we will emphasize the simulation of communicaton networks. Some topics of the course are: Simulation model design Scalability of network simulations Advanced evaluation techniques: network emulation The block course (2nd part) will focus on the Engineering of Communication Systems, especially on the analysis of communication systems by modeling and simulating networking protocols and the environment they are embedded (e.g., modeling and simulation of user behavior, network topologies, user mobility, signal propagation in wireless networks, etc.). Aims and Learning Outcomes Acquisition of fundamental knowledge about modeling and discrete simulation techniques Ability to systematically analyse and model communication systems for given application scenarios
Folien zur Vorlesung Rai Jain: The art of computer systems performance analysis, ISBN 0-471-50336-3. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol: Discrete-Event System Simulation, Fourth Edition, Prentice Hall, 2005. Averill M. Law, W. David Kelton: Simulation Modeling and Analysis, Third Edition, McGrawHill, 2000. Otto Spaniol, Simon Hoff: Ereignisorientierte Simulation - Konzepte und Systemrealisierung, International Thomson Publishing, 1995. Documentation of OMNeT++ Simulator, API, Models etc. (cf. OMNeT++Website -> Documentation)
Language of Instruction Module Coordinator Credits
Englisch Klaus Wehrle 6 95
Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
4 120 Degree elective

Title Lecture Communication Systems Engineering 2 Exercise Communication Systems Engineering 2 Masterexam Communication Systems Engineering 2 Ref. Code MSSSE-12042 03.a/11 MSSSE-12042 03.b/11 MSSSE-12042 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Communication Systems Engineering 2 [MSSSE-1204203.a/11]

Title Short Title Semester of Study Content Lecture Communication Systems Engineering 2 Lecture Communication Systems Engineering 2 1 see module description Degree elective
Assessment: Exercise Communication Systems Engineering 2 [MSSSE-1204203.b/11]

Title Short Title Semester of Study Content Exercise Communication Systems Engineering 2 Exercise Communication Systems Engineering 2 1 see module description Degree elective
Assessment: Masterexam Communication Systems Engineering 2 [MSSSE-1204203.c/11]

Title Short Title Semester of Study Content Masterexam Communication Systems Engineering 2 Masterexam Communication Systems Engineering 2 1 see module description Degree elective
96 Revision: 13.06.2013 02:26:16
Module: Mobile Internet Technology [MSSSE-1204204/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Mobile Internet Technology MIT 2 1 2 This lecture adresses architectures, protocols, and algorithms for mobile systems and sensor-based systems. Topics: Fundamentals of mobile systems and sensor-based systems: characteristics, challenges, goals, and mobility artefacts Examples and design principles of mobile and sensor-based systems Signal representation and medium access Sensor-based systems: application scenarios, design of sensor nodes, architecture of sensor networks, challenges in sensor-based systems Mobile data networks: 802.11, WiMAX, mesh networks Mobile telecommunication networks: GSM, GPRS, UMTS, ... Mobility and Internet protocols: network layer (roaming, security) Mobility and Internet protocols: transport layer (TCP) Performance in mobile Internet-based systems
Acquisition of the following Knowledge and Practical Skills: The goal of this course is to impart fundamental knowledge about technologies and structures of mobile communications and sensor networks, and about the resulting requirements to our Internet protocols. Accompanying, current approaches of these fields are presented to not only give an overview about established technologies, but also show current trends and modern developments. Knowledge about the fundamental charachteristics of mobile and sensor-based systems Ability to methodically analyse mobile and sensor-based systems for given application scenarios
Prerequisites
Contents of the lecture Secure Distributed Systems resp. Data Communication and Security
Course Texts Holger Karl, Andreas Willig: Protocols and Architectures for Wireless Sensor Networks, Wiley, 2005 Jochen Schiller: Mobile Communications, 2. Auflage, Addison Wesley, 2004 Zustzlich: Folien zur Vorlesung
Language of Instruction Additional Information
Englisch
97
Literature: Holger Karl, Andreas Willig: Protocols and Architectures for Wireless Sensor Networks, Wiley, 2005 Jochen Schiller: Mobile Communications, 2. Auflage, Addison Wesley, 2004 Zustzlich: Folien zur Vorlesung
Klaus Wehrle 6 4 120 Degree elective

Title Lecture Mobile Internet Technology Exercise Mobile Internet Technology Masterexam Mobile Internet Technology Ref. Code MSSSE-12042 04.a/11 MSSSE-12042 04.b/11 MSSSE-12042 04.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Mobile Internet Technology [MSSSE-1204204.a/11]

Title Short Title Semester of Study Content Lecture Mobile Internet Technology Lecture Mobile Internet Technology 2 see module description Degree elective
Assessment: Exercise Mobile Internet Technology [MSSSE-1204204.b/11]

Title Short Title Semester of Study Content Exercise Mobile Internet Technology Exercise Mobile Internet Technology 2 see module description Degree elective
Assessment: Masterexam Mobile Internet Technology [MSSSE-1204204.c/11]

Title Short Title Semester of Study Content Revision: 13.06.2013 02:26:16 Masterexam Mobile Internet Technology Masterexam Mobile Internet Technology 2 see module description 98
Degree elective
99
Module: Network Simulation [MSSSE-1204301/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Network Simulation Network Simulation 1 1 2 Simulation is an important and wide-spread tool for performance evaluation in computer networking but also in other disciplines. This course gives an introduction to the principles, the architectures, the methods and the models used in discrete-event based simulation. Apart from presenting the discrete-event simulation principle, we cover several tools, parallelization issues, methodology issues (especially related to statistics) and finally common modeling approaches for simulating different parts of a network stack (from wireless transmission up to application traffic and network topologies). While the course addresses mainly examples from networking (and the fourth part of it is devoted to network simulation), most content of the course has a broader application range and presents rigor methods in performance evaluation. Course material is additionally presented in an exercise session. After visiting this course, students should have acquired knowledge in how to model systems, when to apply the technique of discrete-event simulations, how to conduct a performance evaluation study, how to analyze statistical data from a simulation, and how to model and simulate aspects of wired and wireless networks. In addition, students will have used various tools that are common in research and development. Students should have basic knowledge in the following fields : Programming with C++, statistics, data networks (ISO/OSI layer model and protocols). 1. 2. Wehrle/Guenes/Gross: Modeling and Tools for Network Simulation Rai Jain: The Art of Computer Systems Performance Analysis
Englisch James Richard Gross 6 4 120 Degree elective

Title Lecture Network Simulation Exercise Network Simulation Masterexam Network Simulation Ref. Code MSSSE-12043 01.a/11 MSSSE-12043 01.b/11 MSSSE-12043 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Network Simulation [MSSSE-1204301.a/11]

Title Short Title Semester of Study Revision: 13.06.2013 02:26:16 Lecture Network Simulation Lecture Network Simulation 1 100
Content
Assessment: Exercise Network Simulation [MSSSE-1204301.b/11]

Title Short Title Semester of Study Content Exercise Network Simulation Exercise Network Simulation 1 see module description Degree elective
Assessment: Masterexam Network Simulation [MSSSE-1204301.c/11]

Title Short Title Semester of Study Content Masterexam Network Simulation Masterexam Network Simulation 1 see module description Degree elective
101
Module: Network Calculus [MSSSE-1204302/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Network Calculus Network Calculus 1 1 2 Network calculus is a relatively new theory on the performance of data networks. It extends queueing theory in a sense that queueing theory only provides statistical performance predictions for single tasks (i.e. packets in a networking context) while network calculus provides performance prediction for information flows (which is much more relevant in the context of streaming applications). Network calculus contains a deterministic part (for wired networks like the internet) as well as a stochastic part (for example for wireless networks). In this lecture we only cover the deterministic part. The lecture contains the section: Mathematical foundations, arrival curves, service curves, networking results and applications. The goal of this lecture is to provide a framework of the many components required in networking to provide quality of service. The lecture is not so much building practical knowledge, instead it highlights basic concepts described in an elegant mathematical way. These concepts are the base of many research approches today and are therefore important. Networks (network layer, transport layer, applications (multimedia, real-time), Algebra, Calculus Online book by Prof. LeBoudec, http://ica1www.epfl.ch/PS_files/NetCal.htm Deutsch/Englisch James Richard Gross 4 3 75 Degree elective

Title Lecture Network Calculus Exercise Network Calculus Masterexam Network Calculus Ref. Code MSSSE-12043 02.a/11 MSSSE-12043 02.b/11 MSSSE-12043 02.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Network Calculus [MSSSE-1204302.a/11]

Title Short Title Semester of Study Content Lecture Network Calculus Lecture Network Calculus 1 see module description Degree elective 102 Revision: 13.06.2013 02:26:16
Relevance to Degree
Programme
Assessment: Exercise Network Calculus [MSSSE-1204302.b/11]

Title Short Title Semester of Study Content Exercise Network Calculus Exercise Network Calculus 1 see module description Degree elective
Assessment: Masterexam Network Calculus [MSSSE-1204302.c/11]

Title Short Title Semester of Study Content Masterexam Network Calculus Masterexam Network Calculus 1 see module description Degree elective
103
Module: Web Technologies [MSSSE-1209202/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Web Technologies Web Technologies 1 1 2 The World Wide Web has a tremendous effect on our everyday life. We have learned to use the Web for many different tasks ranging from the simple gathering of information to complex workflows. Thus, interactive Web applications are a new and important paradigm for software development. Essentially, the course focuses on the combination of different methods and web technologies. These will not be discussed in great detail, but will rather be presented and practiced using examples. A more detailed theoretical understanding of the underlying technologies (i.e. distributed systems, data communication, software engineering, eCommerce systems, information systems, hypermedia, human computer interaction and eLearning) can be obtained in other more specialized courses. In this course the methods and technologies are combined and discussed in the context of Web projects. In our lectures we will introduce some of the technologies and topics that are relevant for the development of Web applications. Based on a short presentation of basic technologies (Internet, TCP/IP, www etc.) client- and server-side technologies (amongst others CSS, JavaScript, Java Server Pages and Servlets) as well as some XML related technologies will be discussed. Moreover, several of these technologies will be taken up again and tested in the context of Ajax. The students will work with various tools on practical exercises and a course project that develops with the course lectures. Fundamentals of Web Technologies Introduction, motivation, overview (Web Engineering) Client/Server model, HTTP, HTTPS Markup Languages, (X)HTML, CSS, DOM XML, DTD/XSD, XSLT, XML programming Client-side Technologies Scripting, JavaScript Server-side Technologies CGI, PHP, Database Access Java EE, Java Servlets and Java Server Pages (JSP) Web Application Development Ajax Further topics such as legal issues, web accessibility, usability, security etc. will be incorporated in the course lectures. The course includes regular assignments and project exercises in which the discussed technologies are put into practice to consolidate understanding.
Understanding and utilizing current Web technologies Client-side programming with JavaScript and DOM 104
Revision: 13.06.2013 02:26:16
Server-side programming with Java, Servlets and JSPs Combining Web technologies with Ajax After completing the class, students will know the relevant Web technologies know the process of Web development be able to evaluate and choose adequate technologies and tools for Web applications be capable of developing small and medium-sized Web applications
Prerequisites Good knowledge of the concepts of imperative and object-oriented programming languages and techniques; in particular good knowledge of OO programming with Java Good knowledge of software engineering The ability to develop small and medium-sized programs The necessary verve and commitment to work on course exercises that involve continuously changing technologies and languages, knowledge of which must in part be acquired and expanded independently parallel to the course
Course Texts
Folien und Codebeispiele zur Vorlesung, Vorlesungsaufzeichnung, sowie z.B. folgende Bcher: Sebesta, Robert W. ; Programming the World Wide Web, 4th ed; Addison-Wesley: Harlow, 2007. Whr; Web Technologien, dpunkt, 2004 Kappel, Reich, Retschitzegger; Web Engineering - Systematische Entwicklung von Web-Anwendungen, dpunkt.verlag, 2004 Basham, Sierra, Bates: Head First Servlets und JSPs, O'Reilly 2004 McLaughlin; Head Rush Ajax, O'Reilly 2006 Meinel, Sack; WWW, Springer 2004 Weitere ausgewhlte Kapitel aus diversen Bchern und vor allem Internetquellen zu den jeweils vorgestellten Technologien werden in der Vorlesung bekannt gegeben.
Englisch Ulrik Schroeder 6 5 105 Degree elective

Title Web Technologies Exercise Web Technologies Masterexam Web Technologies Ref. Code MSSSE-12092 02.a/11 MSSSE-12092 02.b/11 MSSSE-12092 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
105
Assessment: Web Technologies [MSSSE-1209202.a/11]

Title Short Title Semester of Study Content Web Technologies Web Technologies 1 see module description Degree elective
Assessment: Exercise Web Technologies [MSSSE-1209202.b/11]

Title Short Title Semester of Study Content Exercise Web Technologies Exercise Web Technologies 1 see module description Degree elective
Assessment: Masterexam Web Technologies [MSSSE-1209202.c/11]

Title Short Title Semester of Study Content Masterexam Web Technologies Masterexam Web Technologies 1 see module description Degree elective
106 Revision: 13.06.2013 02:26:16
Module: Advanced Learning Technologies [MSSSE-1209203/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Advanced Learning Technologies Advanced Learning Technologies 1 1 3 The master lecture course Advanced Learning Technologies (V3+2) is a follow up to the courses eLearning and Web Technologies. The course addresses advanced topics in eLearning (e.g. mobile learning, educational data mining, and learning analytics). It focuses on the engineering of innovative learning systems and environments based on emerging mobile technologies and advanced Web technologies (e.g. Web mining, recommender systems, and cloud computing). These technologies are further investigated and applied in small student projects carried out throughout the course. Knowledge: Upon successful completion of this module, students should be able to give an overview about current topics and research issues in learning technologies describe the requirements for learning technologies and state particular technologies and tools for the development of eLearning systems
Skills: They should be able to leverage emerging mobile and web technologies to develop effective eLearning systems and environments design, implement, evaluate, and present small to medium sized eLearning projects in teams
Competences: Based on the knowledge and skills acquired in this module, students will be able to scientifically communicate and discuss current trends in advanced learning technologies adopt to new technologies in the context of eLearning projects and eLearning research discuss and compare emerging Web technologies for the purpose of implementing advanced learning systems work in teams to design and implement innovative learning technologies propose creative solutions in eLearning projects take responsibility in project work as a reliable project partner identify problems in project work and come up with creative solutions
Skills and competences in Web Technologies and Learning Technologies as can be acquired in the modules Web Technologies and/or eLearning. Lecture slides, code examples and audio streams from lectures. Further articles from various books and internet sources. 107
Language of Instruction Grading
Englisch
Active participation in lecture and exercises Oral or written exam at the end
Ulrik Schroeder 6 5 105 Degree elective

Title Lecture Advanced Learning Technologies Exercise Advanced Learning Technologies Masterexam Advanced Learning Technologies Ref. Code MSSSE-12092 03.a/11 MSSSE-12092 03.b/11 MSSSE-12092 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Advanced Learning Technologies [MSSSE-1209203.a/11]

Title Semester of Study Relevance to Degree Programme Lecture Advanced Learning Technologies 1 Degree elective
Assessment: Exercise Advanced Learning Technologies [MSSSE-1209203.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercise Advanced Learning Technologies Exercise Advanced Learning Technologies 1 Degree elective
Assessment: Masterexam Advanced Learning Technologies [MSSSE-1209203.c/11]

Title Semester of Study Relevance to Degree Programme Masterexam Advanced Learning Technologies 1 Degree elective
108 Revision: 13.06.2013 02:26:16
Module: Implementation of Databases [MSSSE-1305101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Implementation of Databases Implementation of Databases 1 1 0 Variable The module discusses the key aspects of the implementation of databasesystems. This includes the introduction of basic architectures (e.g.layered architecture) as well the procedures necessary for solvingindividual tasks (especially query analysis and transactionmanagement). The concepts of implementation will be applied toclassical (relational model, network model) as well as to more recentdata models (distributed, object-oriented, deductive). In addition tothe necessary theoretical background practical concepts will beintroduced that allow database administrators the efficient tuning ofdatabases. General / Related to the modul: The course offers an introductionto database architectures, query processing and optimization,transaction management, recovery, and administration of databases Subject-/Methodical-/Learning Competence/Soft Skills: Studentslearn to analyse and optimize database structures and functionalities.In the exercises the students have to present their handed-in solutionin front of the class. Exercises can be done in small groups. Benefits for future professional life: Professionalknowledge about evaluating, administrating and tuning existingdatabases as well as a solid understanding of information systemarchitectures in modern businesses is provided Prerequisites Introduction to Databases (Bachelor or Master Level) Working knowledge in data structures
Course Texts D.E. Shasha: Database Tuning - A Principled Approach. Prentice Hall, 1992. R. Elmasri, S. Navathe: Fundamentals of Database Systems, Addison-Wesley, 4. Aufl. 2003 T. Hrder, E. Rahm: Datenbanksysteme - Konzepte und Techniken der Implementierung. Springer 1999. G. Vossen: Datenmodelle, Datenbanksprachen und Datenbank-Management-Systeme. Addison-Wesley, 4. Aufl. 2004.
Englisch Matthias Jarke 6 4 120 Degree elective
109

Title Lecture Implementation of Databases Exercise Implementation of Databases Masterexam Implementation of Databases Ref. Code MSSSE-13051 01.a/11 MSSSE-13051 01.b/11 MSSSE-13051 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Implementation of Databases [MSSSE-1305101.a/11]

Title Short Title Semester of Study Content Lecture Implementation of Databases Lecture Implementation of Databases 1 see module description Degree elective
Assessment: Exercise Implementation of Databases [MSSSE-1305101.b/11]

Title Short Title Semester of Study Content Exercise Implementation of Databases Exercise Implementation of Databases 1 see module description Degree elective
Assessment: Masterexam Implementation of Databases [MSSSE-1305101.c/11]

Title Short Title Semester of Study Content Masterexam Implementation of Databases Masterexam Implementation of Databases 1 see module description Degree elective
110 Revision: 13.06.2013 02:26:16
Module: Advanced Data Models [MSSSE-1305102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Advanced Data Models Advanced Data Models 1 1 0 Matthias Jarke 4 3 75 Degree elective

Title Lecture Advanced Data Models Exercise Advanced Data Models Masterexam Advanced Data Models Ref. Code MSSSE-13051 02.a/11 MSSSE-13051 02.b/11 MSSSE-13051 02.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Advanced Data Models [MSSSE-1305102.a/11]

Title Short Title Semester of Study Content Lecture Advanced Data Models Lecture Advanced Data Models 1 see module description Degree elective
Assessment: Exercise Advanced Data Models [MSSSE-1305102.b/11]

Title Short Title Semester of Study Content Exercise Advanced Data Models Exercise Advanced Data Models 1 see module description Degree elective
Assessment: Masterexam Advanced Data Models [MSSSE-1305102.c/11]

Title Short Title Semester of Study Masterexam Advanced Data Models Masterexam Advanced Data Models 1 111
Content
112 Revision: 13.06.2013 02:26:16
Module: Entrepreneurship and New Media [MSSSE-1305103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Entrepreneurship and New Media Entrepreneurship and New Media 1 1 0 Variable This module covers special aspects of the development of complex information products (personalised web sites, electronic marketplaces, mobile information services, virtual communities). This will be combined with insights from practical experience into how to found an IT start-up company. New design and implementation approaches, e.g. group-oriented and participative approaches such as Extreme Programming (XP) will also be introduced providing relevant software engineering knowledge. General / Related to the module: Students learn to apply general project management, group work, presentation techniques and special software engineering methods like Extreme Programming on real world computer science development problems of local start-up companies Subject-/Methodical-/Learning Competence/Soft Skills: Software Engineering methods, Presentation techniques, Team work, Project Management, Communication skills, Entrepreneurial skills Benefits for future professional life: Students gain real world project management & software engineering knowledge, professional knowledge in presentation techniques and team work experience. Prerequisites Course Texts Language of Instruction Grading Lectures Two day tutorial 4 formal reviews of joint project work In-class exercises Presentation Management of Software Development Processes, Basic knowledge in databases, software engineering and programming Lecture slides, Reading list Englisch
Matthias Jarke 5 6 60 Degree elective

Title Lecture Entrepreneurship and New Media Ref. Code MSSSE-13051 03.a/11 Credits 0 Credits Workload 2 Contact hours (h) 2 Self-Study Time (h) 30
113
Lab Entrepreneurship and New Media
MSSSE-13051 03.b/11
30
Assessment: Lecture Entrepreneurship and New Media [MSSSE-1305103.a/11]

Title Short Title Semester of Study Content Lecture Entrepreneurship and New Media Lecture Entrepreneurship and New Media 1 see module description Degree elective
Assessment: Lab Entrepreneurship and New Media [MSSSE-1305103.b/11]

Title Short Title Semester of Study Content Lab Entrepreneurship and New Media Lab Entrepreneurship and New Media 1 see module description Degree elective
114 Revision: 13.06.2013 02:26:16
Module: Web Science [MSSSE-1305105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Web Science Web Science 1 1 0 With the emerging development and impacts of World Wide Web, Web Science having information and social dimensions has been becoming a new study field in Computer Science. This course repeats fundamental concepts (web centralities & algorithms, network models and web engineering principles) of Web Science I. We then give an overview on regular and random network models, influence, economic, and biological networks. In the following we study dynamic processes on complex networks (emergence, percolation, epidemics, synchrony, walking and searching, net gain and repeated games). In the engineering part we dig into emerging cloud & grid computing approaches like GoogleApp, Google Wave (XMPP) and Bittorrent. With the knowledge gained in the preceding chapter we can analyse and engineer advanced web applications like the Wikipedia, personal learning environments and massive 3D multimedia environments. To provide the competences in understanding of the Web, its structure and dynamics. To acquire knowledge required in implementing web-based systems. To introduce new features of web technologies that contribute to future start-ups in WWW. To exercise how to deal analytically with Web data. Students who know basics of linear algebra and graph theory as well as foundations of Web programming will benefit however the material will be presented in clear form so that the others can get the point quickly. Englisch Matthias Jarke 4 3 75 Degree elective
Prerequisites

Title Lecture Web Science Exercise Web Science Masterexam Web Science Ref. Code MSSSE-13051 05.a/11 MSSSE-13051 05.b/11 MSSSE-13051 05.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Web Science [MSSSE-1305105.a/11]

Title Short Title Semester of Study Content Lecture Web Science Lecture Web Science 1 see module description Degree elective 115
Assessment: Exercise Web Science [MSSSE-1305105.b/11]

Title Short Title Semester of Study Content Exercise Web Science Exercise Web Science 1 see module description Degree elective
Assessment: Masterexam Web Science [MSSSE-1305105.c/11]

Title Short Title Semester of Study Content Masterexam Web Science Masterexam Web Science 1 see module description Degree elective
116 Revision: 13.06.2013 02:26:16
Module: Artificial Intelligence [MSSSE-1305201/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Agent Architecture Heuristic Search Games Knowledge Representation Baysian Networks Machine Learning Robotics Artificial Intelligence Artificial Intelligence 1 1 2
Aims and Learning Outcomes Course Texts
Students will gain knowledge in some of the major techniques developed in Artificial Intelligence. At the end of the course they will understand many of the basic ingredients that make up an intelligent agent enabling them to build such agents themselves. Lecture Notes (Transparencies) Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach (2nd Edition), Addison Wesley, 2002.
Englisch Gerhard Lakemeyer 6 5 105 Degree elective

Title Lecture Artificial Intelligence Exercise Artificial Intelligence Masterexam Artificial Intelligence Ref. Code MSSSE-13052 01.a/11 MSSSE-13052 01.b/11 MSSSE-13052 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Artificial Intelligence [MSSSE-1305201.a/11]

Title Short Title Lecture Artificial Intelligence Lecture Artificial Intelligence
117
Assessment: Exercise Artificial Intelligence [MSSSE-1305201.b/11]

Title Short Title Semester of Study Content Exercise Artificial Intelligence Exercise Artificial Intelligence 1 see module description Degree elective
Assessment: Masterexam Artificial Intelligence [MSSSE-1305201.c/11]

Title Short Title Semester of Study Content Masterexam Artificial Intelligence Masterexam Artificial Intelligence 1 see module description Degree elective
118 Revision: 13.06.2013 02:26:16
Module: Knowledge Representation [MSSSE-1305202/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content First-Order Logic Resolution Horn Logic Procedural Representations Description Logics Inheritance Networks Nonmonotonic Reasononing Reasoning about Action and Planning Knowledge Representation Knowledge Representation 1 1 4
Students will gain knowledge in some of the major techniques developed in Knowledge Representation. At the end of the course they will understand what distinguishes a knowledge-based system from others and they will be familiar with some of the main representation formalisms and reasoning techniques. Mathematical Logic
Prerequisites
Course Texts Lecture Notes (Transparencies) Ron Brachman and Hector J. Levesque, Knowledge Representation and Reasoning, Morgan Kaufmann, 2004.

Title Lecture Knowledge Representation Exercise Knowledge Representation Masterexam Knowledge Representation Ref. Code MSSSE-13052 02.a/11 MSSSE-13052 02.b/11 MSSSE-13052 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
119
Assessment: Lecture Knowledge Representation [MSSSE-1305202.a/11]

Title Short Title Semester of Study Content Lecture Knowledge Representation Lecture Knowledge Representation 1 see module description Degree elective
Assessment: Exercise Knowledge Representation [MSSSE-1305202.b/11]

Title Short Title Semester of Study Content Exercise Knowledge Representation Exercise Knowledge Representation 1 see module description Degree elective
Assessment: Masterexam Knowledge Representation [MSSSE-1305202.c/11]

Title Short Title Semester of Study Content Masterexam Knowledge Representation Maeterexam Knowledge Representation 1 see module description Degree elective
120 Revision: 13.06.2013 02:26:16
Module: The Logic of Knowledge Bases [MSSSE-1305203/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content First-Order Logic The Modal Logic KL Finite vs. Infinite representability A Representation Theorem Only Knowing Autoepistemic Reasonining Tractable Reasosoning Situation Calculus The Logic of Knowledge Bases The Logic of Knowledge Bases 1 1 0
Students will gain knowledge in the logical foundations of knowledge bases. By the end of the course they will appreciate the difference between the knowledge level and the symbolic level of a knowledge base. They will understand why first-order logic alone is often not sufficient as a query language. Computatoinal aspects of reasoning will also be addressed. Mathematical Logic and/or Introduction to Knowledge Representation
Lecture Notes (Transparencies) Hector J. Levesque and Gerhard Lakemeyer, The Logic of Knowledge Bases, MIT Press, 2001.

Title Lecture The Logic of Knowledge Bases Exercise The Logic of Knowledge Bases Masterexam The Logic of Knowledge Bases Ref. Code MSSSE-13052 03.a/11 MSSSE-13052 03.b/11 MSSSE-13052 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture The Logic of Knowledge Bases [MSSSE-1305203.a/11]

Title Lecture The Logic of Knowledge Bases 121
Lecture The Logic of Knowledge Bases 1 see module description Degree elective
Assessment: Exercise The Logic of Knowledge Bases [MSSSE-1305203.b/11]

Title Short Title Semester of Study Content Exercise The Logic of Knowledge Bases Exercise The Logic of Knowledge Bases 1 see module description Degree elective
Assessment: Masterexam The Logic of Knowledge Bases [MSSSE-1305203.c/11]

Title Short Title Semester of Study Content Masterexam The Logic of Knowledge Bases Masterexam The Logic of Knowledge Bases 1 see module description Degree elective
122 Revision: 13.06.2013 02:26:16
Module: Introduction to Bioinformatics [MSSSE-1305501/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Genome and Sequences (DNA sequences, Algorithms for sequencecomparison, Sequence databases, Patterns and motifs, Phylogenetic trees) Proteins and Structures (3D modelling, Protein databases, Protein structure analysis and prediction) Protein Expression and Function (DNA chip technology, Gene expression analysis, Clustering, Proteomics) Pathways and Systems (Metabolic networks, Pathway analysis, Cell simulation) Introduction to Bioinformatics Introduction to Bioinformatics 1 1 2
Students will be introduced to interdisciplinary thinking. Students will understand informatics solutions/contributions tobiological approaches, in particular molecular biology (genomics,proteomics, expression analysis, network analysis). Students will be able to set up simple models for naturalphenomena as part of bioinformatics algorithms and will be able toassess the relevance of algorithm output.
Course Texts Reinhard Rauhut, Bioinformatik. Sequenz - Struktur - Funktion. Wiley-VCH, 2001. Richard Durbin, A. Krogh, G. Mitchison, S. Eddy, Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, 1999. Minoru Kanehisa, Post-Genome Informatics. Oxford University Press, 2000.
Englisch Thomas Berlage 4 3 75 Degree elective

Title Lecture Introduction to Bioinformatics Exercise Introduction to Bioinformatics Masterexam Introduction to Bioinformatics Ref. Code MSSSE-13055 01.a/11 MSSSE-13055 01.b/11 MSSSE-13055 01.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Introduction to Bioinformatics [MSSSE-1305501.a/11]

123
Lecture Introduction to Bioinformatics Lecture Introduction to Bioinformatics 1 see module description Degree elective
Assessment: Exercise Introduction to Bioinformatics [MSSSE-1305501.b/11]

Title Short Title Semester of Study Content Exercise Introduction to Bioinformatics Exercise Introduction to Bioinformatics 1 see module description Degree elective
Assessment: Masterexam Introduction to Bioinformatics [MSSSE-1305501.c/11]

Title Short Title Semester of Study Content Masterexam Introduction to Bioinformatics Masterexam Introduction to Bioinformatics 1 see module description Degree elective
124 Revision: 13.06.2013 02:26:16
Module: CSCW and Groupware: Concepts and Systems for Computer Supported Cooperative Work [MSSSE-1305601/11]
Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content CSCW and Groupware: Concepts and Systems for Computer Supported Cooperative Work CSCW and Groupware 1 1 2 The following topics are discussed in the lecture: General Introduction Video Conferencing Media spaces Synchronous shared Applications Semistructured Communication and Cooperation Workflow Shared Workspaces and Awareness The course aims at imparting fundamental theoretical and practical knowledge about cooperation support systems (CSCW) and common methods of their realization and evaluation. This course builds the background for other course (labs and seminars) on cooperative systems. The students shall learn how to build, use, and evaluate CSCW systems and how to model cooperative applications. In the scientific and business world the development and application multi-media communication and groupware systems is a fundamental requirement. Knowledge about the basic principles of such systems and about their use and deployment is essential in the area of Media Informatics.
Prerequisites Course Texts Language of Instruction Grading
none Papers supporting the different chapters of the lecture have been provided to the students using the web-based cooperation environment (BSCW) Englisch lecture graded written examination participation at exercises with compulsory attendance homework solving of exercises or programming exercises Wolfgang Prinz 4 3 75 Degree elective

Title Lecture CSCW and Groupware Exercise CSCW and Ref. Code MSSSE-13056 01.a/11 MSSSE-13056 Credits 0 0 125 Credits Workload 2.5 1.5 Contact hours (h) 2 1 Self-Study Time (h) 45 30
Groupware Masterexam CSCW and Groupware
01.b/11 MSSSE-13056 01.c/11 4 0 0 0
Assessment: Lecture CSCW and Groupware [MSSSE-1305601.a/11]

Title Short Title Semester of Study Content Lecture CSCW and Groupware Lecture CSCW and Groupware 1 see module description Degree elective
Assessment: Exercise CSCW and Groupware [MSSSE-1305601.b/11]

Title Short Title Semester of Study Content Exercise CSCW and Groupware Exercise CSCW and Groupware 1 see module description Degree elective
Assessment: Masterexam CSCW and Groupware [MSSSE-1305601.c/11]

Title Short Title Semester of Study Content Masterexam CSCW and Groupware Masterexam CSCW and Groupware 1 see module description Degree elective
126 Revision: 13.06.2013 02:26:16
Module: Process Management [MSSSE-1305701/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Process Management Process Management 1 1 2 Folien zur Vorlesung sowie z.B. folgende Bcher: A. Gadatsch (2005). Geschftsprozess-Management, Vieweg. A.-W. Scheer, F. Abolhassan, W. Jost, M. Kirchmer, Eds. (2003) Business process change management, Springer. W. van Aalst (2000). Business process management: models, techniques and empirical studies, Springer. J. Becker, M. Kgeler, M. Rosemann (2003). Process management — a guide for the design of business processes.
Englisch Thomas Rose 4 3 75 Degree elective

Title Lecture Process Management Exercise Process Management Masterexam Process Management Ref. Code MSSSE-13057 01.a/11 MSSSE-13057 01.b/11 MSSSE-13057 01.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Process Management [MSSSE-1305701.a/11]

Title Short Title Semester of Study Content Lecture Process Management Lecture Process Management 1 see module description Degree elective
Assessment: Exercise Process Management [MSSSE-1305701.b/11]

Title Short Title Exercise Process Management Exercise Process Management 127
Assessment: Masterexam Process Management [MSSSE-1305701.c/11]

Title Short Title Semester of Study Content Masterexam Process Management Masterexam Process Management 1 see module description Degree elective
128 Revision: 13.06.2013 02:26:16
Module: eBusiness - Applications, Architecture and Standards [MSSSE-1305702/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts eBusiness - Applications, Architecture and Standards eBusiness 1 1 0 Variable Folien zur Vorlesung sowie z.B. folgende Bcher: D. Chaffey (2004). E-Business and E-Commerce Management, Prentice Hall.
M. Merz (2002). E-Commerce und E-Business, dpunkt Verlag. C. Van Slyke, F. Belanger (2003). E-Business Technologies — Supporting Net-Enhanced Organization, John-Wiley & Sons. M. Cheshar, R. Kaura, P. Linton (2003). Electronic Business & Commerce, Springer.
Englisch Thomas Rose 4 3 75 Degree elective

Title Lecture eBusiness Applications, Architecture and Standards Exercise eBusiness Applications, Architecture and Standards Masterexam eBusiness Applications, Architecture and Standards Ref. Code MSSSE-13057 02.a/11 MSSSE-13057 02.b/11 MSSSE-13057 02.c/11 Credits 0 Credits Workload 2.5 Contact hours (h) 2 Self-Study Time (h) 45
1.5
30
Assessment: Lecture eBusiness - Applications, Architecture and Standards [MSSSE-1305702.a/11]

Title Short Title Semester of Study Content Lecture eBusiness - Applications, Architecture and Standards Lecture eBusiness 1 see module description Degree elective
Assessment: Exercise eBusiness - Applications, Architecture and Standards [MSSSE-1305702.b/11]

129
Exercise eBusiness - Applications, Architecture and Standards Exercise eBusiness 1 see module description Degree elective
Assessment: Masterexam eBusiness - Applications, Architecture and Standards [MSSSE-1305702.c/11]

Title Short Title Semester of Study Content Masterexam eBusiness - Applications, Architecture and Standards Masterexam eBusiness 1 see module description Degree elective
130 Revision: 13.06.2013 02:26:16
Module: Index Structures for Databases [MSSSE-1309101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Index Structures for Databases Index Structures for Databases 1 1 2 Folienskript zur Vorlesung mit zahlreichen Verweisen auf die Originalliteratur Deutsch Thomas Seidl 6 5 105 Degree elective

Title Lecture Index Structures for Databases Exercise Index Structures for Databases Masterexam Index Structures for Databases Ref. Code MSSSE-13091 01.a/11 MSSSE-13091 01.b/11 MSSSE-13091 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Index Structures for Databases [MSSSE-1309101.a/11]

Title Short Title Semester of Study Content Lecture Index Structures for Databases Lecture Index Structures for Databases 1 see module description Degree elective
Assessment: Exercise Index Structures for Databases [MSSSE-1309101.b/11]

Title Short Title Semester of Study Content Exercise Index Structures for Databases Exercise Index Structures for Databases 1 see module description Degree elective
Assessment: Masterexam Index Structures for Databases [MSSSE-1309101.c/11]

Title Masterexam Index Structures for Databases 131
Masterexam Index Structures for Databases 1 see module description Degree elective
132 Revision: 13.06.2013 02:26:16
Module: Advanced Data Mining Algorithms [MSSSE-1309103/11]

Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Algorithms and concepts for Data Mining in large and high dimensional databases: Introduction: KDD Process und traditional data mining tasks Algorithms detecting clusters und association rules Challenges due to recent application scenarios such as high dimensional databases Solutions in recent paradigms: Subspace Clustering und Projected Clustering Solutions for redundancy elimination in Subspace Clustering Novel knowledge extraction by orthogonal Subspace Clustering Outlier mining techniques Future work in this research area Advanced Data Mining Algorithms 1 1 0 Variable
Students will gain knowledge in some of the most recent data mining techniques for large and high dimensional database systems.Especially knowledge about functionality and scalability of recent data mining algorithms.Ability to evaluate data mining solutions on real world applications. Required: skills provided in the module Datenstrukturen und Algorithmen.Recommended: skills provided in the module Datenbanken und Imformationssysteme and Einfhrung in Data Mining Algorithmen Folienskript zur Vorlesung mit zahlreichen Verweisen auf die Originalliteratur sowie Jiawei Han and Micheline Kamber: Data Mining -Concepts and Techniques. Morgan Kaufmann Publishers, 2000. Martin Ester and Jrg Sander: Knowledge Discovery in Databases - Techniken und Anwendungen. Springer Verlag, 2000 (in German).
Prerequisites
Course Texts
Deutsch/Englisch Thomas Seidl 6 5 105 Degree elective

Title Lecture Advanced Data Mining Algorithms Exercise Advanced Data Mining Algorithms Masterexam Advanced Data Ref. Code MSSSE-13091 03.a/11 MSSSE-13091 03.b/11 MSSSE-13091 Credits 0 0 6 133 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Mining Algorithms
03.c/11
Assessment: Lecture Advanced Data Mining Algorithms [MSSSE-1309103.a/11]

Title Short Title Semester of Study Content Lecture Advanced Data Mining Algorithms Lecture Advanced Data Mining Algorithms 1 see module description Degree elective
Assessment: Exercise Advanced Data Mining Algorithms [MSSSE-1309103.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercise Advanced Data Mining Algorithms Exercise Advanced Data Mining Algorithms 1 Degree elective
Assessment: Masterexam Advanced Data Mining Algorithms [MSSSE-1309103.c/11]

Title Short Title Semester of Study Content Masterexam Advanced Data Mining Algorithms Masterexam Advanced Data Mining Algorithms 1 see module description Degree elective
134 Revision: 13.06.2013 02:26:16
Module: Content-based Similarity Search [MSSSE-1309104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Content-based Similarity Search Content-based Similarity Search 1 1 0 Variable Folienskript zur Vorlesung mit zahlreichen Verweisen auf die Originalliteratur Deutsch Thomas Seidl 6 5 105 Degree elective

Title Lecture Content-based Similarity Search Exercise Content-based Similarity Search Masterexam Content-based Similarity Search Ref. Code MSSSE-13091 04.a/11 MSSSE-13091 04.b/11 MSSSE-13091 04.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Content-based Similarity Search [MSSSE-1309104.a/11]

Title Short Title Semester of Study Content Lecture Content-based Similarity Search Lecture Content-based Similarity Search 1 see module description Degree elective
Assessment: Exercise Content-based Similarity Search [MSSSE-1309104.b/11]

Title Short Title Semester of Study Content Exercise Content-based Similarity Search Exercise Content-based Similarity Search 1 see module description Degree elective
Assessment: Masterexam Content-based Similarity Search [MSSSE-1309104.c/11]

135
Masterexam Content-based Similarity Search Masterexam Content-based Similarity Search 1 see module description Degree elective
136 Revision: 13.06.2013 02:26:16
Module: Data Mining Algorithms I [MSSSE-1309105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Concepts and Techniques for Data Mining Introduction: KDD process, data mining tasks Data warehousing and data preprocessing Generalization and concept description Basic concepts of indexing structures Clustering: partitioning methods, density-based clustering, subspace clustering, etc. hierarchical clustering, Data Mining Algorithms I Data Mining Algorithms I 1 1 2
Classification: decision trees, nearest neighbor classifier, Bayes Mining association rules: Apriori-algorithm etc. Mining complex types of data
classifier, etc.
Knowledge: On successful completion of this module, students should be able to Describe basic data mining tasks Describe recent data mining solutions.
Skills: They should be able to Select, design and apply appropriate data mining algorithms for the analysis and exploration of large data sets.
Competences: Based on the knowledge and skills acquired they should be able to Discuss potentials and limitations of data mining algorithms Discuss the applicability of data mining and retrieval application domains. for large data sets. solutions for real-world
Course Texts Slides Web page with exercises 137
Slides with links to original literature (articles in conference proceedings and journals), including particularly: Jiawei Han and Micheline Kamber: Data Mining - Concepts and Techniques. Morgan Kaufmann Publishers, 2000. Martin Ester and Jrg Sander: Knowledge Discovery in Databases - Techniken und Anwendungen. Springer Verlag, 2000 (in German).
English
Active participation in lecture and exercises
Weekly submission of exercises (homework) Written exam at the end
Thomas Seidl 6 5 105 Degree elective

Title Lecture Data Mining Algorithms I Exercise Data Mining Algorithms I Masterexam Data Mining Algorithms I Ref. Code MSSSE-13091 05.a/11 MSSSE-13091 05.b/11 MSSSE-13091 05.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Data Mining Algorithms I [MSSSE-1309105.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Lecture Data Mining Algorithms I Lecture Data Mining Algorithms I 1 Degree elective
Assessment: Exercise Data Mining Algorithms I [MSSSE-1309105.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercise Data Mining Algorithms I Exercise Data Mining Algorithms I 1 Free elective
Assessment: Masterexam Data Mining Algorithms I [MSSSE-1309105.c/11]

138 Revision: 13.06.2013 02:26:16
Title Short Title Semester of Study Relevance to Degree Programme
Masterexam Data Mining Algorithms I Masterexam Data Mining Algorithms I 1 Degree elective
139
Module: Data Mining Algorithms II [MSSSE-1309106/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Introduction: KDD Process and data mining tasks. Mining high-dimensional data: Challenges and solutions for subspace clustering, projected clustering, multi-view clustering, outlier detection. Mining graph and network data: Challenges and solutions for data analysis, similarity models. Mining dynamic stream data: Challenges and solutions for clustering, classification, concept drift detection. Future work in this research area. Data Mining Algorithms II Data Mining Algorithms II 1 1 0
Knowledge: On successful completion of this module, students should be able to Describe basic data mining tasks and their applicability for complex object types. Desribe recent data mining solutions for complex data including graphs, network data, high-dimensional data and data streams.
Skills: They should be able to Select, design and apply appropriate data mining algorithms for the analysis and exploration of complex objects including graphs and streams of high-dimensional data. Understand new proposals about data mining techniques for noisy and imperfect data.
Competences: Based on the knowledge and skills acquired they should be able to Discuss potentials and limitations of data mining algorithms for graphs, networks and streams of high-dimensional data. Discuss the applicability of data mining and retrieval solutions for real-world application domains.
Prerequisites It is helpful to have knowledge in Data Mining Algorithms I Databases and Information Systems 140 Revision: 13.06.2013 02:26:16
Data Structures and Algorithms Programming
Course Texts Slides Web page with exercises Slides with links to original literature (articles in conference proceedings and journals).
Grading Active participation in lecture and exercises Weekly submission of exercises (homework) Written exam at the end
Thomas Seidl 6 5 105 Degree elective

Title Lecture Data Mining Algorithms II Exercise Data Mining Algorithms II Exam Data Mining Algorithms II Ref. Code MSSSE-13091 06.a/11 MSSSE-13091 06.b/11 MSSSE-13091 06.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Data Mining Algorithms II [MSSSE-1309106.a/11]

Title Semester of Study Relevance to Degree Programme Lecture Data Mining Algorithms II 1 Degree elective
Assessment: Exercise Data Mining Algorithms II [MSSSE-1309106.b/11]

Title Semester of Study Relevance to Degree Programme Exercise Data Mining Algorithms II 1 Degree elective
Assessment: Exam Data Mining Algorithms II [MSSSE-1309106.c/11]

Title Exam Data Mining Algorithms II
141
1 Degree elective
142 Revision: 13.06.2013 02:26:16
Module: IT-Security 1 - Cryptographic Basics and Network Security [MSSSE-1317101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content IT-Security 1 - Cryptographic Basics and Network Security IT-Security 1 1 1 2 Cryptographic Basics Symmetric Encryption
Integrity protection Asymmetric Encryption Digital Signatures Certificates and public key infrastructures Authentication and key agreement
Network Security Kerberos protocol
IPsec protocol TLS protocol SSH protocol DNS Security Email Security Web Security and Phishing Attacks
Understanding the main cryptographic basics and in particular the most commonly used security mechanisms and building blocks for cryptographic protocols. This includes the mode of operation, the properties and goals of the mechanisms as well as their weaknesses. Detailed knowledge on the latest versions of the most relevant network security protocols specified for the different network layers.
Basics of Data Communication and Modular Arithmetic
Introduction to Cryptography and Network Security, Forouzan, Mc Graw-Hill International
Network Security: Private Communication in a Public World, Kaufmann, Perlman, and Speciner, Prentice Hall Cryptography and Network Security - Principles and Practice, Stallings, Prentice Hall
Englisch Ulrike Meyer 6 4 120 143
Degree elective

Title Lecture IT-Security 1 Lecture IT-Security 1 Masterexam IT-Security 1 Ref. Code MSSSE-13171 01.a/11 MSSSE-13171 01.b/11 MSSSE-13171 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture IT-Security 1 [MSSSE-1317101.a/11]

Title Short Title Semester of Study Content Lecture IT-Security 1 Lecture IT-Security 1 1 see module description Degree elective
Assessment: Lecture IT-Security 1 [MSSSE-1317101.b/11]

Assessment: Masterexam IT-Security 1 [MSSSE-1317101.c/11]

Title Short Title Semester of Study Content Masterexam IT-Security 1 Masterexam IT-Security 1 1 see module description Degree elective
144 Revision: 13.06.2013 02:26:16
Module: IT-Security 2 - Computer Security [MSSSE-1317102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content IT-Security 2 - Computer Security IT-Security 2 1 1 2 The lecture comprises three parts: in the first part, security solutions for different applications are discussed. The second part is the main part of the lecture and is focused on system security. Finally, the last part of the lecture is dedicated to security management, i.e. designing secure systems and evaluating the security of a system. The following topics are treated: Part 1: Electronic Payment Biometrics Digital Rights Management Electronic Voting Privacy Part 2: Access Control Physical Security Firewalls Malware and Buffer Overflows Intrusion Detection Part 3: Design Principles and Risk Management
System Evaluation
Understand the main security threats, attacks and defence mechanisms on the application layer as well as on the system level in networked computer systems Get to know the basic principles of secure design and system evaluation methodologies
Prerequisites Cryptographic basics equivalent to the ones conveyed in the first part of the Modul IT-Security 1 Basic knowledge on computer systems and data communication
Course Texts Matt Bishop: Introduction to Computer Security, Addison-Wesley, 2004 Ross Anderson: Security Engineering - A Guide to Building Dependable Distributed Systems , Wiley, 2008
145
Englisch Ulrike Meyer 6 4 120 Degree elective

Title Lecture IT-Security 2 Exercise IT-Security 2 Masterexam IT-Security 2 Ref. Code MSSSE-13171 02.a/11 MSSSE-13171 02.b/11 MSSSE-13171 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture IT-Security 2 [MSSSE-1317102.a/11]

Assessment: Exercise IT-Security 2 [MSSSE-1317102.b/11]

Title Short Title Semester of Study Content Exercise IT-Security 2 Exercise IT-Security 2 1 see module description Degree elective
Assessment: Masterexam IT-Security 2 [MSSSE-1317102.c/11]

Title Short Title Semester of Study Content Masterexam IT-Security 2 Masterexam IT-Security 2 1 see module description Degree elective
146 Revision: 13.06.2013 02:26:16
Module: Security in Mobile Communication [MSSSE-1317103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Security in Mobile Communication Security in Mobile Communication 1 1 2 Security architectures and attacks against already standardized wireless communication systems. In particular: Mobile networks: GSM, GPRS, UMTS, SAE/LTE Wireless local area networks: WLAN Personal area networks: Bluetooth Other wide area networks: WiMax Cordless telephony: DECT Sensor networks RFID systems Security mechanisms for different variants of Mobile IP EAP-based roaming
Understanding the security mechanisms used to protect current wireless communication systems. This includes well-known attacks against the security mechanisms of the different systems. The goal is not only to get to know the security properties and vulnerabilities of existing systems but also to learn how to methodically evaluate the newly evolving systems.
Prerequisites Cryptographic basics corresponding to the module IT-Security 1 Not necessary but helpful: prior attendence to the module Mobile Communications
Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
The course covers the topics in a depth that is not provided by any text book. References to the relevant standards documents are provided for each chapter. Englisch Ulrike Meyer 6 4 120 Degree elective

Title Lecture Security in Mobile Communication Exercise Security in Mobile Communication Masterexam Security in Mobile Communication Ref. Code MSSSE-13171 03.a/11 MSSSE-13171 03.b/11 MSSSE-13171 03.c/11 Credits 0 0 6 147 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Security in Mobile Communication [MSSSE-1317103.a/11]

Title Short Title Semester of Study Content Lecture Security in Mobile Communication Lecture Security in Mobile Communication 1 see module description Degree elective
Assessment: Exercise Security in Mobile Communication [MSSSE-1317103.b/11]

Title Short Title Semester of Study Content Exercise Security in Mobile Communication Exercise Security in Mobile Communication 1 see module description Degree elective
Assessment: Masterexam Security in Mobile Communication [MSSSE-1317103.c/11]

Title Short Title Semester of Study Content Masterexam Security in Mobile Communication Masterexam Security in Mobile Communication 1 see module description Degree elective
148 Revision: 13.06.2013 02:26:16
Module: Security and Cooperation in Wireless Networks [MSSSE-1317104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Security and Cooperation in Wireless Networks Security and Cooperation in Wireless Networks 1 1 2 The lecture studies security challenges and solutions in upcoming wireless networks such as vehicular networks, wireless mesh networks, mobile at hoc networks, and RFID systems. Security mechanisms to prevent malicious behavior are studied as well as incentives mechanisms for cooperative behavior. Overview on existing networks Upcoming networks Security of Naming and Addressing Establishing security Associations Securing neighbor discovery Secure routing in multihop networks Privacy protection Selfish behavior at the MAC layer Selfishness in packet forwarding Wireless operators in a shared spectrum Protocols for behavior enforcement
Get to know the unique security challenges of upcoming, not yet standardized, wireless networks. Learn how the security mechanisms so far suggested work and how they can be evaluated. Get in touch with the open research questions in this area. Basic cryptographic knowledge as covered, e.g. by the module IT-Security 1 L. Buttyan, J.-P. Hubaux: Security and Cooperation in Wireless Networks - Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing, Cambridge Press 2007 Englisch Ulrike Meyer 6 4 120 Degree elective

Title Lecture Security and Cooperation in Wireless Networks Exercise Security and Cooperation in Wireless Ref. Code MSSSE-13171 04.a/11 MSSSE-13171 04.b/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
0 149
45
Networks Masterexam Security and Cooperation in Wireless Networks MSSSE-13171 04.c/11 6 0 0 0
Assessment: Lecture Security and Cooperation in Wireless Networks [MSSSE-1317104.a/11]

Title Short Title Semester of Study Content Lecture Security and Cooperation in Wireless Networks Lecture Security and Cooperation in Wireless Netwo 1 see module description Degree elective
Assessment: Exercise Security and Cooperation in Wireless Networks [MSSSE-1317104.b/11]

Title Short Title Semester of Study Content Exercise Security and Cooperation in Wireless Networks Exercise Security and Cooperation in Wireless Netw 1 see module description Degree elective
Assessment: Masterexam Security and Cooperation in Wireless Networks [MSSSE-1317104.c/11]

Title Short Title Semester of Study Content Masterexam Security and Cooperation in Wireless Networks Masterexam Security, Cooperation in Wireless Netwo 1 see module description Degree elective
150 Revision: 13.06.2013 02:26:16
Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme 1 1 2 James F. Kurose and Keith W. Ross, Computer Networking: A Top-Down Approach, Addison Wesley Englisch Petri Mhnen 5 3 105 Degree elective

Title Ref. Code MSSSE-13201 01.a/11 MSSSE-13201 01.c/11 Credits 0 5 Credits Workload 5 0 Contact hours (h) 3 0 Self-Study Time (h) 105 0
151
Module: Ad-Hoc Networks: Architectures and Protocols [MSSSE-1320102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Die Vorlesung deckt die folgenden Schwerpunkte ab: Ad Hoc Netzwerke und ihre Funktionen Pfadsuche in Ad Hoc Netzwerken MAC Layer fr Drahtlosnetze Energieeffiziente Protokolle Ad-Hoc Networks: Architectures and Protocols AHAP 2 1 2
Fachbezogen: Die Studierenden kennen Netzwerktopologien und ihren Einfluss auf den Systemaufbau Die Studierenden verstehen den Entwurf von Medienzugriffs- und Netwerkprotokollen auf Grundlage der verschiedenen Einsatzbereiche von Funksystemen Die Studierenden knnen die Funktionsweise bekannter Medienzugriffs- und Netzwerkprotokolle wiedergeben und in den Systemkontext einordnen Nicht fachbezogen: Die Studierenden vertiefen ihre Analysekenntnisse in multi-parametrischen komplexen Systemen Die Studierenden erweitern ihre mathematischen Kenntnisse der Modellierung von Funksystemen Die Studierenden erweiteren ihre Prsentationsfhigkeiten anhand Beispiele des Fachbereichs in englischer Sprache ausgewhlter
Die Studierenden erlernen den Umgang mit wissenschaftlichen Quellen und deren kritische Beurteilung
Grundkenntnisse im Bereich des Entwurfs von Kommunikationsnetzen
C. Siva Ram Murthy and B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols, Prentice Hall
Language of Instruction Grading Module Coordinator Credits Contact Hours per week Self-Study Time (h) Revision: 13.06.2013 02:26:16
Englisch mndliche Prfung (30min) Petri Mhnen 4 3 75 152
Degree elective

Title Ref. Code MSSSE-13201 02.a/11 MSSSE-13201 02.b/11 Credits 0 4 Credits Workload 4 0 Contact hours (h) 3 0 Self-Study Time (h) 75 0
153
Module: Mobile Radio Networks 1 [MSSSE-1320103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Die Vorlesung deckt die folgenden Schwerpunkte ab: Modelle der Funkwellenausbreitung Konzepte zellulrer Funksysteme Handover-Mechanismen Systemarchitektur moderner zellulrer Funknetze Logische und physikalische Funkkanle Systemsicherheit in Sprachnetzen Mobile Radio Networks 1 MRN 1 2 1 2
Fachbezogen: Die Studierenden kennen Mglichkeiten und Grenzen der Funkkommunikation und modellieren sie anhand aktueller Modelle des Funkkanals Die Studierenden erwerben einen Grundwortschatz in relevanten Themen der Telekommunikation Die Studierenden verstehen Entwurfsentscheidungen in zellulren Netzwerken und ihren Zusammenhang zu Eigenschaften der Funkwellenausbreitung und des Systemdesigns Nicht fachbezogen: Die Studierenden vertiefen ihre Analysekenntnisse in multi-parametrischen komplexen Systemen Die Studierenden erweitern ihre Kenntnisse der mathematischen Systemmodellierung mittels Abstraktion Die Studierenden erfahren den ingenieurswissenschaftlichen Diskurs in internationalen Umgebung mit Englisch als Arbeitssprache einer
Prerequisites
Grundkenntnisse im Bereich des Entwurfs von Kommunikationsnetzen und der Ausbreitung elektromagnetischer Wellen
Course Texts Theodore S. Rappaport, Wireless Communications: Principles and Practice (2nd Edition), Prentice Hall Y.B. Lin and I. Chlamtac, Wireless and Mobile Network Architectures, Wiley R. Steele, Mobile Radio Communications, Wiley
Englisch schriftliche Prfung (90min)
154 Revision: 13.06.2013 02:26:16
Petri Mhnen 4 3 75 Free elective

155
Module: Mobile Radio Networks 2 [MSSSE-1320104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Die Vorlesung deckt die folgenden Schwerpunkte ab: Direct Sequence Spread Spectrum Technologie Code Division Multiple Access Technik Pseudo-Zufallszahlengeneratoren in Funknetzen Universal Mobile Telecommunications System IEEE 802.11 Wireless LAN standard IEEE 802.15.1 Bluetooth standard ZigBee Mobile Radio Networks 2 MRN 2 1 1 2
Fachbezogen: Die Studierenden kennen fortgeschrittene Techniken des Medienzugriffs Die Studierenden erwerben einen Grundwortschatz in relevanten Themen der dritten und vierten Generation von Mobilfunknetzen und bekannter Funkstandards Die Studierenden kennen Entwurfsentscheidungen zur Bandbreitenerhhung in modernen Funksystemen Nicht fachbezogen: Die Studierenden vertiefen ihre Analysekenntnisse in multi-parametrischen komplexen Systemen Die Studierenden erweitern ihre mathematischen Kenntnisse der Modellierung von Funksystemen Die Studierenden erfahren den ingenieurswissenschaftlichen Diskurs in internationalen Umgebung mit Englisch als Arbeitssprache einer
Prerequisites Grundkenntnisse im Bereich des Entwurfs von Kommunikationsnetzen und der Ausbreitung elektromagnetischer Wellen Grundkenntnisse im Bereich des Entwurfs von Kommunikationsnetzen, Grundkenntnisse der Signalverarbeitung un der Kodierung und Modulation von Informationsstrmen
Course Texts Juha Heiskala and John Terry, OFDM Wireless LANs: A theoretical and Practical Guide, Sams Matthew Gast, 802.11 Wireless Networks: The Definitive Guide, O'Reilly
Language of Instruction Revision: 13.06.2013 02:26:16
Englisch 156
Grading schriftliche Prfung (90min) Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Petri Mhnen 4 3 75 Degree elective

157
Module: Cryptography I [MSSSE-1327101/11]

Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Classical cryptography: cryptanalysis of classical cyphers, frequency analysis, general types of attacks. Entropy and perfect secrecy: equivocation, redundancy, one-time pad. Fast block ciphers: DES, AES, IDEA, modes of operation. Number theoretic reference problems: primality testing, integer factorization, extended Euclidean algorithm, Chinese remainder theorem, discrete logarithm, Diffie-Hellman key agreement, Shamir's no-key protocol. Public-key encryption: basic concept, RSA encryption, security of RSA, implementational aspects. Authentication and digital signatures: challenge-and-response, RSA authentication and digital signature. Course Texts Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton, 1996. Schneier, B.: Applied Cryptography (2nd ed.). Wiley, New-York, 1996. Trappe, W., Washington, L.C.: Introduction to Cryptography with Coding Theory. Prentice Hall, Upper Saddle River, 2002. Cryptography I 1 1 2
Englisch Rudolf Mathar 4.5 3 90 Degree elective

Title Lecture Cryptography I Exercise Cryptography I Masterexam Cryptography I Ref. Code MSSSE-13271 01.a/11 MSSSE-13271 01.b/11 MSSSE-13271 01.c/11 Credits 0 0 4.5 Credits Workload 3 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 60 30 0
Assessment: Lecture Cryptography I [MSSSE-1327101.a/11]

Title Short Title Semester of Study Content Revision: 13.06.2013 02:26:16 Lecture Cryptography I Lecture Cryptography I 1 see module description 158
Degree elective
Assessment: Exercise Cryptography I [MSSSE-1327101.b/11]

Title Short Title Semester of Study Content Exercise Cryptography I Exercise Cryptography I 1 see module description Degree elective
Assessment: Masterexam Cryptography I [MSSSE-1327101.c/11]

Title Short Title Semester of Study Content Masterexam Cryptography I Masterexam Cryptography I 1 see module description Degree elective
159
Module: Advanced Methods of Cryptography [MSSSE-1327102/11]

Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Advanced public key encryption Side channel attacks Cryptographic hash functions Identification and entity authentication Elliptic curve cryptography Quantum cryptography Advanced Methods of Cryptography 1 1 2
Aims and Learning Outcomes Prerequisites Course Texts
Students will acquire advanced knowledge about cryptographic protocols and their foundation in mathematics. They will understand corresponding standards, modern implementations and applications. Basic knowledge about cryptographic primitives, elementary number theoretic foundations
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton, 1996. Schneier, B.: Applied Cryptography (2nd ed.). Wiley, New-York, 1996. Trappe, W., Washington, L.C.: Introduction to Cryptography with Coding Theory. Prentice Hall, Upper Saddle River, 2002. A list of further readings will be issued at the beginning of the lecture. Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Englisch Rudolf Mathar 4.5 4 75 Degree elective

Title Lecture Advanced Methods of Cryptography Exercise Advanced Methods of Cryptography Masterexam Advanced Methods of Cryptography Ref. Code MSSSE-13271 02.a/11 MSSSE-13271 02.b/11 MSSSE-13271 02.c/11 Credits 0 0 4.5 Credits Workload 3 1.5 0 Contact hours (h) 2 2 0 Self-Study Time (h) 60 15 0
Assessment: Lecture Advanced Methods of Cryptography [MSSSE-1327102.a/11]

Title Short Title Semester of Study Revision: 13.06.2013 02:26:16 Lecture Advanced Methods of Cryptography Lecture Advanced Methods of Cryptography 1 160
Content
Assessment: Exercise Advanced Methods of Cryptography [MSSSE-1327102.b/11]

Title Short Title Semester of Study Content Exercise Advanced Methods of Cryptography Exercise Advanced Methods of Cryptography 1 see module description Degree elective
Assessment: Masterexam Advanced Methods of Cryptography [MSSSE-1327102.c/11]

Title Short Title Semester of Study Content Masterexam Advanced Methods of Cryptography Masterexam Advanced Methods of Cryptography 1 siehe Modulbeschreibung Degree elective
161
Module: Pattern Recognition and Neural Networks [MSSSE-1406101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Introduction/motivation. Bayes' decision rule. Training and learning. Model-free methods. Mixture densities and cluster analysis. Stochastic finite automata. Feature extraction. Pattern Recognition and Neural Networks Pattern Recognition and Neural Networks 1 1 2
Intuition for the basic
methods of pattern recognition and neural networks. and neural networks.
Learning of basic algorithms and principles of pattern recognition
Acquirement of the ability of independent handling of the contents of this module and confident command of basic methods of pattern recognition neural networks. Practice of the presented content by exemplary realization of specific problems from pattern recognition and neural networks and corresponding basic classification tasks.
Course Texts R. O. Duda, P. E. Hart, D. G. Storck: Pattern Classification. 2nd ed., J. Wiley, New York, NY, 2001. K. Fukunaga: Introduction to Statistical Pattern Recognition. Academic Press, New York, NY, 1990.
Language of Instruction Additional Information Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
Deutsch/English Regular solution of exercises, 50% of the exercise points are exam. Hermann Ney 8 6 150 Degree elective required for admission to the

Title Lecture Pattern Recognition and Neural Networks Ref. Code MSSSE-14061 01.a/11 Credits 0 Credits Workload 6 Contact hours (h) 4 Self-Study Time (h) 120
162 Revision: 13.06.2013 02:26:16
Exercises Pattern Recognition and Neural Networks Masterexam Pattern Recognition and Neural Networks
MSSSE-14061 01.b/11 MSSSE-14061 01.c/11
30
Assessment: Lecture Pattern Recognition and Neural Networks [MSSSE-1406101.a/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Lecture Pattern Recognition and Neural Networks Lecture Pattern Recognition and Networks 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
Assessment: Exercises Pattern Recognition and Neural Networks [MSSSE-1406101.b/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Exercises Pattern Recognition and Neural Networks Exercises Pattern Recogn. and Neural Netw. 4 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
Assessment: Masterexam Pattern Recognition and Neural Networks [MSSSE-1406101.c/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Masterexam Pattern Recognition and Neural Networks Masterexam Pattern Recogn. aand Neural Netw. 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
163
Module: Automatic Speech Recognition [MSSSE-1406102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Introduction/motivation. Digital signal processing. Spectral Analysis. Time alignment and isolated word recognition. Statistical interpretation and models. Connected Word Recognition. Large Vocabulary Speech Recognition. Automatic Speech Recognition Automatic Speech Recognition 1 1 2
Intuition for the basic
properties and methods of automatic speech recognition.
Learning of basic algorithms of automatic speech recognition and their integration into a complete recognition system. Acquirement of the ability of independent handling of the contents of this module and confident command of basic techniques of automatic speech recognition. Application of decision theory to the speech recognition problem. Practice of the presented content automatic speech recognition. by exemplary realization of specific problems from
Course Texts Emphasis on signal processing and small-vocabulary recognition: L. Rabiner, B. H. Juang: Fundamentals of Speech Recognition. Prentice Hall, Englewood Cliffs, NJ, 1993. Emphasis on large vocabulary and language modelling: F. Jelinek: Statistical Methods for Speech Recognition. MIT Press, Cambridge, 1997. Introduction to both speech and language: D. Jurafsky, J. H. Martin: Speech and Language Processing. Prentice Hall, Englewood Cliffs, NJ, 2000. Advanced topics: R. De London, 199. Mori: Spoken Dialogues with Computers. Academic Press,
Language of Instruction Additional Information Module Coordinator Credits Contact Hours per week
Deutsch/English Regular solution of exercises, 50% of the exercise points are exam. Hermann Ney 8 6 required for admission to the
164 Revision: 13.06.2013 02:26:16
150 Degree elective

Title Lecture Automatic Speech Recognition Exercises Automatic Speech Recognition Masterexam Automatic Speech Recognition Ref. Code MSSSE-14061 02.a/11 MSSSE-14061 02.b/11 MSSSE-14061 02.c/11 Credits 0 0 8 Credits Workload 6 2 0 Contact hours (h) 4 2 0 Self-Study Time (h) 120 30 0
Assessment: Lecture Automatic Speech Recognition [MSSSE-1406102.a/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Lecture Automatic Speech Recognition Lecture Automatic Speech Recognition 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
Assessment: Exercises Automatic Speech Recognition [MSSSE-1406102.b/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Exercises Automatic Speech Recognition Exercises Automatic Speech Recognition 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
Assessment: Masterexam Automatic Speech Recognition [MSSSE-1406102.c/11]

Title Short Title Semester of Study Content Masterexam Automatic Speech Recognition Masterexam Automatic Speech Recognition 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
Information Link Relevance to Degree Programme
165
Module: Statistical Methods in Natural Language Processing [MSSSE-1406103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Introduction/Motivation Linguistic and Statistical Foundations Text and Document Classification Language Modelling Part-of-Speech (POS) Tagging Information Extraction by Tagging Probabilistic Context Free Grammars and Parsing Machine Translation Statistical Methods in Natural Language Processing Stat. Meth. in Natural Language Processing 1 1 2
Understanding of statistic methods for natural language processing, as well as corresponding human-machine interaction applications and other tasks in artificial intelligence. Comprehension of statistical methods for natural language processing, especially text and document classification including information retrieval, information extraction including tagging and semantic annotation, machine translation of natural language. Einfhrung in die Stochastik Datenstrukturen und Algorithmen Formale System, Automaten, Prozesse
Prerequisites
Course Texts C. D. Manning, H. Schtze: Foundations of Statistical Processing. MIT Press, Cambridge, MA, D. Jurafsky, J. H. Martin: Speech and Language Hall, Englewood Cliffs, NJ, 2000. Folien/Lecture Notes: http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Natural Language 1999. Processing. Prentice
Language of Instruction Additional Information Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
Englisch / Deutsch Regular solution of exercises, 50% of the exercise points are exam. Hermann Ney 8 6 150 Semester-specific degree elective required for admission to the

166 Revision: 13.06.2013 02:26:16
Title Lecture Statistical Methods in Natural Language Processing Exercises Statistical Methods in Natural Language Processing Masterexam Statistical Methods in Natural Language Processing
Credits 0
Credits Workload 6
Contact hours (h) 4
Self-Study Time (h) 120
30
Assessment: Lecture Statistical Methods in Natural Language Processing [MSSSE-1406103.a/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Lecture Statistical Methods in Natural Language Processing Lecture Natural Language Processing 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
Assessment: Exercises Statistical Methods in Natural Language Processing [MSSSE-1406103.b/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Exercises Statistical Methods in Natural Language Processing Exercises Natural Language Processing 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
Assessment: Masterexam Statistical Methods in Natural Language Processing [MSSSE-1406103.c/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Masterexam Statistical Methods in Natural Language Processing Masterexam Natural Language Processing 1 s. module description. http://www-i6.informatik.rwth-aachen.de/web/Teaching/ Degree elective
167
Module: Advanced Methods in Statistical Classification [MSSSE-1406104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Introduction/Motivation Summary of Introduction to Pattern Recognition Discriminants and Neural Networks Training criteria Log-linear modeling Support Vector Machines Classification and regression trees. Boosting Model Selection Advanced Methods in Statistical Classification AMSC 1 1 0 Variable
Deepened comprehension of advanced methods and formalisms of pattern recognition. Learning of advanced methods of pattern recognition. Acquirement of the ability of independent handling of the contents of this module and confident command of advanced techniques of pattern recognition. Practice of the presented content by exemplary realization of specific problems from pattern recognition. Overview of the state of the art in pattern recognition.
Introduction to Pattern Recognition
R. O. Duda, P. E. Hart, D. G. Storck: Pattern Classification. 2nd ed., J. Wiley, New York, NY, 2001. K. Fukunaga: Introduction to Statistical Pattern Recognition. Academic Press, New York, NY, 1990.
Deutsch/Englisch Hermann Ney 6 5 105 Degree elective
168 Revision: 13.06.2013 02:26:16

Title Lecture Advanced Methods in Statistical Classification Exercise Advanced Methods in Statistical Classification Masterexam Advanced Methods in Statistical Classification Ref. Code MSSSE-14061 04.a/11 MSSSE-14061 04.b/11 MSSSE-14061 04.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Advanced Methods in Statistical Classification [MSSSE-1406104.a/11]

Title Short Title Semester of Study Content Lecture Advanced Methods in Statistical Classification VL AMSC 1 see module description Degree elective
Assessment: Exercise Advanced Methods in Statistical Classification [MSSSE-1406104.b/11]

Title Short Title Semester of Study Content Exercise Advanced Methods in Statistical Classification UE AMSC 1 see module description Degree elective
Assessment: Masterexam Advanced Methods in Statistical Classification [MSSSE-1406104.c/11]

Title Short Title Semester of Study Content Masterexam Advanced Methods in Statistical Classification MP AMSC 1 see module description Degree elective
169
Module: Advanced Methods in Automatic Speech Recognition [MSSSE-1406105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Summary of large vocabulary speech recognition using a linear lexicon. Search using lexical pronunciation prefix trees. Word graph method using word pair approximation. Time-conditioned search. Across-word modeling. Confidence measures and system combination. Discriminative training. Speaker adaptation and normalization. Current issues. Advanced Methods in Automatic Speech Recognition Advanced Methods in Automatic Speech Recognition 1 1 0
Deepened comprehension of advanced methods and formalisms of automatic speech recognition. Learning of advanced methods of automatic speech recognition. Acquirement of the ability of independent handling of the contents of this module and confident command of advanced techniques of automatic speech recognition. Practice of the presented content by exemplary realization of specific problems of automatic speech recognition. Overview of the state of the art in automatic speech recognition.
Module (Introduction to) Automatic Speech Recognition
F. Jelinek: Statistical Methods for Speech Recognition, MIT Press, Cambridge 1997. D. Jurafsky, J.H. Martin: Speech and Language Processing, Prentice Hall, Englewood Cliffs, NJ, 2000. R. De Mori: Spoken Dialogues with Computers, Academic Press, London, 1998. Publications on automatic speech recognition.
Deutsch/Englisch Hermann Ney 6 5 105 Degree elective

170 Revision: 13.06.2013 02:26:16
Title Lecture Advanced Methods in Automatic Speech Recognition Exercise Advanced Methods in Automatic Speech Recognition Masterexam Advanced Methods in Automatic Speech Recognition
Credits 0
Credits Workload 4
Contact hours (h) 3
Self-Study Time (h) 75
30
Assessment: Lecture Advanced Methods in Automatic Speech Recognition [MSSSE-1406105.a/11]

Title Short Title Semester of Study Content Lecture Advanced Methods in Automatic Speech Recognition Lecture Advan. Methods Auto. Speech Recognition 1 see module description Degree elective
Assessment: Exercise Advanced Methods in Automatic Speech Recognition [MSSSE-1406105.b/11]

Title Short Title Semester of Study Content Exercise Advanced Methods in Automatic Speech Recognition Exercise Advan. Methods Auto. Speech Recognition 1 see module description Degree elective
Assessment: Masterexam Advanced Methods in Automatic Speech Recognition [MSSSE-1406105.c/11]

Title Short Title Semester of Study Content Masterexam Advanced Methods in Automatic Speech Recognition Masterexam Advan, Methods Auto. Speech Recognition 1 see module description Degree elective
171
Module: Advanced Topics in Statistical Natural Language Processing [MSSSE-1406106/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Introduction/motivation. Probabilistic context-free grammars and parsing. Phrase-based machine translation. Search for phrase-based machine translation. Hierarchical phrase-based machine translation. Advanced Topics in Statistical Natural Language Processing Adv. Statistical Natural Language Processing 1 1 0 Variable
Develop intuition for advanced problems in natural language processing. Learning of advanced methods for natural language processing and machine translation. Acquirement of the ability of independent handling of the contents of this module and confident command of advanced techniques of statistical natural language processing and machine translation. Competence for independent analysis of the properties and performance of machine translation systems and their corresponding optimization.
Module (Introduction to) Statistical Methods in Natural Language Processing
C. D. Manning, H. Schtze: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge, MA, 1999. D. Jurafsky, J. H. Martin: Speech and Language Processing. Prentice Hall, Englewood Cliffs, NJ, 2000. E. Charniak: Statistical Language Learning. MIT Press, Cambridge, MA, 1997. F. Jelinek: Statistical Methods for Speech Recognition. MIT Press, Cambridge, MA, 1997.
Englisch Hermann Ney 6 4 120 Degree elective

Title Ref. Code Credits 172 Revision: 13.06.2013 02:26:16 Credits Workload Contact hours (h) Self-Study Time (h)
Lecture Advanced Topics in Statistical Natural Language Processing Exercise Advanced Topics in Statistical Natural Language Processing Masterexam Advanced Topics in Statistical Natural Language Processing
MSSSE-14061 06.a/11 MSSSE-14061 06.b/11 MSSSE-14061 06.c/11
75
30
Assessment: Lecture Advanced Topics in Statistical Natural Language Processing [MSSSE-1406106.a/11]

Title Short Title Semester of Study Content Lecture Advanced Topics in Statistical Natural Language Processing Lecture Adv. Statistical Natural Language Proc. 1 see module description Degree elective
Assessment: Exercise Advanced Topics in Statistical Natural Language Processing [MSSSE-1406106.b/11]

Title Short Title Semester of Study Content Exercise Advanced Topics in Statistical Natural Language Processing Exercise Adv. Statistical Natural Language Proc. 1 see module description Degree elective
Assessment: Masterexam Advanced Topics in Statistical Natural Language Processing [MSSSE-1406106.c/11]

Title Short Title Semester of Study Content Masterexam Advanced Topics in Statistical Natural Language Processing Masterexam Adv. Statistical Nat. Language Proc. 1 see modue description Degree elective
173
Module: Basic Techniques in Computer Graphics [MSSSE-1408101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Foundations of geometry representations (polygonal meshes, volumetric representations, freeform curves and surfaces) Local illumination (3D transformations, clipping, rasterization, lighting, shading) Global illumination (visibility problem, shadow computation, ray tracing), radiosity Foundations of image processing (transformations, color coding, image compression) Volume rendering Basic Techniques in Computer Graphics Basic Techniques in Computer Graphics 1 1 2
Knowledge of the most important data structures for the representation of 3-dimensional objects and scenes Basic operations and methods for the transformation of a 3D model into a realistic 2-dimensional image (rendering pipeline) Overview of the the central problems and their efficient solutions in the whole area of Computer Graphics
Prerequisites Lecture Algorithms and Data Structures Lecture Linear Algebra
Course Texts Foley, van Dam, Feiner, Hughes: Computer Graphics: Principles and Practice Watt: 3D Computer Graphics
Deutsch/English Leif Kobbelt 6 5 105 Degree elective

Title Lecture Basic Techniques in Computer Graphics Exercise Basic Techniques in Computer Graphics Revision: 13.06.2013 02:26:16 Ref. Code MSSSE-14081 01.a/11 MSSSE-14081 01.b/11 Credits 0 0 174 Credits Workload 4 2 Contact hours (h) 3 2 Self-Study Time (h) 75 30
Masterexam Basic Techniques in Computer Graphics
MSSSE-14081 01.c/11
Assessment: Lecture Basic Techniques in Computer Graphics [MSSSE-1408101.a/11]

Title Short Title Semester of Study Content Lecture Basic Techniques in Computer Graphics Lecture Basic Techniques in Computer Graphics 1 see module description Degree elective
Assessment: Exercise Basic Techniques in Computer Graphics [MSSSE-1408101.b/11]

Title Short Title Semester of Study Content Exercise Basic Techniques in Computer Graphics Exercise Basic Techniques in Computer Graphics 1 see module description Degree elective
Assessment: Masterexam Basic Techniques in Computer Graphics [MSSSE-1408101.c/11]

Title Short Title Semester of Study Content Masterexam Basic Techniques in Computer Graphics Masterexam Basic Techniques in Computer Graphics 1 see module description Degree elective
175
Module: Global Illumination and Image-based Rendering [MSSSE-1408102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Global Illumination: Rendering equation Radiosity techniques Monte-Carlo- und Metropolis-techniques Photon mapping Image-Based Rendering: Lighfields and their generation Rendering and compression The Lumigraph Global Illumination and Image-based Rendering Global Illumination and Image-based Rendering 1 1 2
Knowledge of important techniques for the computation of the illumination of a 3-dimensional scene Understanding of the advantages and disadvantages of the various techniques for different applications Knowledge of important image-based illumination and rendering techniques
Prerequisites Analysis Linear Algebra Basic Techniques in Computer Graphics
Course Texts Foley, van Dam, Feiner, Hughes: Computer Graphics: Principles and Practice, Section 16.11 - 16.13 Philip Dutre, Kavita Bala, Philippe Bekaert: Advanced Global Illumination Henrik W. Jensen: Realistic Image Synthesis Using Photon Mapping P. Debevec et al.: Image-Based Modeling, Rendering, and Lighting, SIGGRAPH 99 Course Notes
Deutsch/English Leif Kobbelt 6 5 105 176
Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Global Illumination and Image-based Rendering Exercise Global Illumination and Image-based Rendering Masterexam Global Illumination and Image-based Rendering Ref. Code MSSSE-14081 02.a/11 MSSSE-14081 02.b/11 MSSSE-14081 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Global Illumination and Image-based Rendering [MSSSE-1408102.a/11]

Title Short Title Semester of Study Content Lecture Global Illumination and Image-based Rendering Lecture Glob Illumination and Image-based Rend. 1 see module description Degree elective
Assessment: Exercise Global Illumination and Image-based Rendering [MSSSE-1408102.b/11]

Title Short Title Semester of Study Content Exercise Global Illumination and Image-based Rendering Exercise Glob. Illumination and Image-based Rend. 1 see module description Degree elective
Assessment: Masterexam Global Illumination and Image-based Rendering [MSSSE-1408102.c/11]

Title Short Title Semester of Study Content Masterexam Global Illumination and Image-based Rendering Masterexam Glob. Illumination and Image-based Rend 1 see module description Degree elective
177
Module: Graphics Programming in OpenGL [MSSSE-1408103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Standard OpenGL: - Geometry representations - Transformations - Color, Texturing - Lighting - Efficient data structures - OpenGL-Buffer - Interaction Advanced techniques like complex illumination models, shadows, performance, special effects OpenGL Extensions GLSlang GPGPU: The GPU as general purpose parallel processor Graphics Programming in OpenGL Graphics Programming in OpenGL 1 1 0 Variable
Hands-on introduction into 3D graphics programming Sound knowledge of OpenGL Advanced aspects like performance tuning, shader programming, GPGPU
Prerequisites Knowledge of C++ Lecture Basic Techniques in Computer Graphics
Course Texts M. Woo, J. Neider, T. Davis, and D. Shreiner: OpenGL Programming Guide, 4th Edition, 2003, Addison-Wesley Professional Foley, van Dam, Feiner, Hughes: Computer Graphics: Principles and Practice, 1995, Addison-Wesley Professional Nehe OpenGL Tutorials, http://nehe.gamedev.net/
Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Revision: 13.06.2013 02:26:16
Deutsch/Englisch Leif Kobbelt 6 5 105 Degree elective 178

Title Lecture Graphics Programming in OpenGL Exercise Graphics Programming in OpenGL Masterexam Graphics Programming in OpenGL Ref. Code MSSSE-14081 03.a/11 MSSSE-14081 03.b/11 MSSSE-14081 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Graphics Programming in OpenGL [MSSSE-1408103.a/11]

Title Short Title Semester of Study Content Lecture Graphics Programming in OpenGL Lecture Graphics Programming in OpenGL 1 see module description Degree elective
Assessment: Exercise Graphics Programming in OpenGL [MSSSE-1408103.b/11]

Title Short Title Semester of Study Content Exercise Graphics Programming in OpenGL Exercise Graphics Programming in OpenGL 1 see module description Degree elective
Assessment: Masterexam Graphics Programming in OpenGL [MSSSE-1408103.c/11]

Title Short Title Semester of Study Content Masterexam Graphics Programming in OpenGL Masterexam Graphics Programming in OpenGL 1 see module description Degree elective
179
Module: Geometry Processing [MSSSE-1408104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Methods for the generation of polygonal meshes (laser scanning, registration and integration of mesh patches, etc.) Optimization of polygonal meshes: surface fairing, remeshing, decimation, refinement Hierarchical representations: coarse-to-fine and fine-to-coarse hierarchies, mesh editing approaches Parametrization and texturing Efficient data structures and mesh compression Geometry Processing Geometry Processing 1 1 2
Techniques for the generation of highly detailed 3-dimensional models of real objects Advanced knowledge of current algorithms for the optimization, processing and storage of geometry data with a focus on polygonal meshes
Prerequisites Basic Techniques in Computer Graphics Algorithms and data structures Linear algebra
Course Texts Foley, van Dam, Feiner, Hughes: Computer Graphics: Principles and Practice Watt: 3D Computer Graphics
Deutsch/Englisch Leif Kobbelt 6 5 105 Degree elective

Title Lecture Geometry Processing Exercise Geometryprocessing Ref. Code MSSSE-14081 04.a/11 MSSSE-14081 04.b/11 Credits 0 0 Credits Workload 4 2 Contact hours (h) 3 2 Self-Study Time (h) 75 30
180 Revision: 13.06.2013 02:26:16
Masterexam Geometry Processing
MSSSE-14081 04.c/11
Assessment: Lecture Geometry Processing [MSSSE-1408104.a/11]

Title Short Title Semester of Study Content Lecture Geometry Processing Lecture Geometry Processing 1 see module description Degree elective
Assessment: Exercise Geometryprocessing [MSSSE-1408104.b/11]

Title Short Title Semester of Study Content Exercise Geometryprocessing Exercise Geometryprocessing 1 see module description Degree elective
Assessment: Masterexam Geometry Processing [MSSSE-1408104.c/11]

Title Short Title Semester of Study Content Masterexam Geometry Processing Masterexam Geometry Processing 1 see module description Degree elective
181
Module: Polynomial Curves and Surfaces [MSSSE-1408105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Foundations of geometry: affine spaces, parametric curves and surfaces Bezier-curves: Bernstein-polynomials, algorithm of de Casteljau, derivatives, integration, conversion, polar form, subdivision Bspline-curves: definition, algorithm of de Boor, derivatives, knot insertion, interpolation and approximation of scattered data Tensor product surfaces: definition, polar form, evaluation, derivatives Bezier surface patches: multivariate Bernstein-polynomials, multivariate algorithm of de Casteljau, polar form, derivatives degree elevation, subdivision Construction of smooth surfaces: Clough-Tocher interpolant, analytic and geometric continuity Polynomial Curves and Surfaces Polynomial Curves and Surfaces 1 1 2
Knowledge of the basic mathematical representations and properties of curves and surfaces in CAGD Understanding of algorithms for the efficient construction, modification and evaluation of freeform curves and surfaces Understanding of the concept of geometric continuity and approaches for the construction of surfaces of arbitrary topology
Prerequisites Analysis Linear Algebra
Course Texts H.Prautzsch, W.Boehm, M.Paluszny: Bezier and B-Spline Techniques G. Farin: Curves and surfaces for computer aided geometric design

182 Revision: 13.06.2013 02:26:16
Title Lecture Polynomial Curves and Surfaces Exercise Polynomial Curves and Surfaces Masterexam Polynomial Curves and Surfaces
Credits 0 0 6
Assessment: Lecture Polynomial Curves and Surfaces [MSSSE-1408105.a/11]

Title Short Title Semester of Study Content Lecture Polynomial Curves and Surfaces Lecture Polynomial Curves and Surfaces 1 see module description Degree elective
Assessment: Exercise Polynomial Curves and Surfaces [MSSSE-1408105.b/11]

Title Short Title Semester of Study Content Exercise Polynomial Curves and Surfaces Exercise Polynomial Curves and Surfaces 1 see module description Degree elective
Assessment: Masterexam Polynomial Curves and Surfaces [MSSSE-1408105.c/11]

Title Short Title Semester of Study Content Masterexam Polynomial Curves and Surfaces Masterexam Polynomial Curves and Surfaces 1 see module description Degree elective
183
Module: Subdivision Curves and Surfaces [MSSSE-1408106/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Simple techniques for curves: Lane-Riesenfeld, 4-point-scheme, corner-cutting Analysis of curve techniques: concept of convergence, difference scheme, z-transform Boxsplines: definition and properties, boxspline subdivision Surface techniques: Catmull-Clark, Doo-Sabin, Loop Analysis of surface techniques in regular areas Analysis of surface techniques in singular points: subdivision matrix, characteristic map Advanced techniques, e.g.: interpolation and approximation of scattered data, curve networks, and normals, representation of sharp features, texturing, variational subdivision, Boolean operations, adaptive subdivision (red-green triangulation, sqrt(3), 4-8-subdivsion) Subdivision Curves and Surfaces Subdivision Curves and Surfaces 1 1 0 Variable
Knowledge of common subdivision methods for curves and surfaces Understanding of mathematical methods for the analysis and construction of subdivision schemes Ability to choose a suitable subdivision method for a given geometrical problem
Lecture Polynomial Curves and Surfaces
H.Prautzsch, W.Boehm, M.Paluszny: Bezier and B-Spline Techniques J. Warren, H. Weimer: Subdivision Methods for Geometric Design

Title Lecture Subdivision Curves and Surfaces Exercise Subdivision Curves Ref. Code MSSSE-14081 06.a/11 MSSSE-14081 Credits 0 0 184 Revision: 13.06.2013 02:26:16 Credits Workload 4 2 Contact hours (h) 3 2 Self-Study Time (h) 75 30
and Surfaces Masterexam Subdivision Curves and Surfaces
06.b/11 MSSSE-14081 06.c/11 6 0 0 0
Assessment: Lecture Subdivision Curves and Surfaces [MSSSE-1408106.a/11]

Title Short Title Semester of Study Content Lecture Subdivision Curves and Surfaces Lecture Subdivision Curves and Surfaces 1 see module description Degree elective
Assessment: Exercise Subdivision Curves and Surfaces [MSSSE-1408106.b/11]

Title Short Title Semester of Study Content Exercise Subdivision Curves and Surfaces Exercise Subdivision Curves and Surfaces 1 see module description Degree elective
Assessment: Masterexam Subdivision Curves and Surfaces [MSSSE-1408106.c/11]

Title Short Title Semester of Study Content Masterexam Subdivision Curves and Surfaces Masterexam Subdivision Curves and Surfaces 1 see module description Degree elective
185
Module: Game Programming [MSSSE-1408107/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Game Programming Game Programming 1 1 2 Game Physics Particle systems Deformable objects (e.g. cloth simulation) Rigid bodies Fluid simulation
Animation / Geometry Collision detection Character animation Facial animation Rendering Natural phenomena (sky, clouds, water, fire, etc.) Advanced material rendering (texture tricks, subsurface scattering, procedural techniques) Screen space techniques (deferred shading, ambient occlusion, etc.)
In the lecture students gain basic knowledge about different concepts and techniques in Game Programming. In the seminar and the practical course the participants have the chance to deepen knowledge of special topics of their interest by presenting and implementing those techniques.
Grading The exam of Game Programming contains three parts: Seminar, includes a short paper and a 20-minutes presentation. Teams of 2-3 students working in a lab. At the end each team gives a 20-minutes presentation. Colloquium (ca. 15 minutes) after the presentation of the lab results.
Module Coordinator Credits Contact Hours per week
Leif Kobbelt 6 3 186
Revision: 13.06.2013 02:26:16
135 Degree elective

Title Lecture/Seminar/Lab Game Programming Masterexam Game Programming Ref. Code MSSSE-14081 07.a/11 MSSSE-14081 07.c/11 Credits 0 6 Credits Workload 6 0 Contact hours (h) 4 0 Self-Study Time (h) 120 0
Assessment: Lecture/Seminar/Lab Game Programming [MSSSE-1408107.a/11]

Title Semester of Study Relevance to Degree Programme Lecture/Seminar/Lab Game Programming 1 Degree elective
Assessment: Masterexam Game Programming [MSSSE-1408107.c/11]

Title Semester of Study Content The exam of Game Programming contains three parts: Seminar, includes a short paper and a 20-minutes presentation Teams of 2-3 students working in a lab. At the end each team gives a 20-minutes presentation Colloquium (ca. 15 minutes) after the presentation of the lab results. Masterexam Game Programming 1
Degree elective
187
Module: Computer Vision [MSSSE-1408301/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Image processing basics: Image formation, Binary image processing, Linear filters, Edge detection & structure extraction, Radiometry & color Computer Vision Computer Vision 1 1 2
Segmentation as clustering, k-Means, EM, Mean-shift Segmentation as energy minimization: Normalized cuts, Graph cuts Object recognition: Global approaches, Subspace representations Local invariant features: Detection and description, Efficient feature matching and indexing Object recognition with local features Object categorization: Sliding-window techniques, Bag-of-features models, Part-based models 3D Reconstruction: Epipolar geometry, Camera calibration, Multi-view stereo, Structure-from-motion Motion & Tracking: Optical flow, Tracking with linear dynamic models, Kalman filters, Particle filters, Tracking-by-detection
The goal of Computer Vision is to develop methods that enable a machine to understand or analyze images and videos. This lecture will teach the fundamental Computer Vision techniques that underlie such capabilities. In addition, it will show current research developments and how they are applied to solve real-world tasks. The lecture is accompanied by Matlab-based exercises that will allow students to collect hands-on experience with the algorithms introduced in the lecture (there will be one exercise sheet roughly every two weeks). Familiarity with basic math, linear algebra, and probability theory is recommended.
D. Forsyth, J. Ponce, Computer Vision -- A Modern Approach, Prentice Hall, 2002 R. Hartley, A. Zisserman. Multiple View Geometry in Computer Vision, 2nd Edition, Cambridge University Press, 2004
Englisch Bastian Leibe 6 4 120 Degree elective

Lecture Computer Vision Exercise Computer Vision Masterexam Computer Vision
0 0 6
4 2 0
3 1 0
75 45 0
Assessment: Lecture Computer Vision [MSSSE-1408301.a/11]

Title Short Title Semester of Study Content Lecture Computer Vision Lecture Computer Vision 1 see module description Degree elective
Assessment: Exercise Computer Vision [MSSSE-1408301.b/11]

Title Short Title Semester of Study Content Exercise Computer Vision Exercise Computer Vision 1 see module description Degree elective
Assessment: Masterexam Computer Vision [MSSSE-1408301.c/11]

Title Short Title Semester of Study Content Masterexam Computer Vision Masterexam Computer Vision 1 see module description Degree elective
189
Module: Machine Learning [MSSSE-1408302/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Introduction: Probability Theory, Bayes Decision Theory Probability Density Estimation: Parametric methods, Mixture models, Non-parametric methods Linear Discriminant Functions Statistical Learning Theory Support Vector Machines Model Combination, Bagging, Boosting, AdaBoost Decision Trees Randomized Trees, Random Forests, Ferns Model Selection Graphical Models: Bayesian Networks, Markov Random Fields, Factor Graphs Exact Inference: Message Passing, Belief Propagation, Graph Cuts Approximate Inference: Monte Carlo Methods Gaussian Processes for regression and classification Machine Learning Machine Learning 1 1 2
The goal of Machine Learning is to develop techniques that enable a machine to learn how to perform certain tasks from experience. The important part here is the learning from experience. That is, we do not try to encode the knowledge ourselves, but the machine should learn it itself from training data. The tools for this are statistical learning and probabilistic inference techniques. Such techniques are used in many real-world applications. This lecture teaches the fundamental machine learning know-how that underlies those capabilities. In addition, we show current research developments and how they are applied to solve real-world tasks. The class is accompanied by exercises that allows students to collect hands-on experience with the algorithms introduced in the lecture. There are both pen&paper exercises and practical programming exercises based on Matlab (1 exercise sheet every 2 weeks).
Familiarity with basic math, linear algebra, probability theory, and statistics.
C.M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006 R.O. Duda, P.E. Hart, D.G. Stork, Pattern Classification, 2nd Edition, Wiley-Interscience, 2000
Englisch Bastian Leibe 6 4 120 190
Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Machine Learning Exercise Machine Learning Masterexam Machine Learning Ref. Code MSSSE-14083 02.a/11 MSSSE-14083 02.b/11 MSSSE-14083 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Machine Learning [MSSSE-1408302.a/11]

Title Short Title Semester of Study Content Lecture Machine Learning Lecture Machine Learning 1 see module description Degree elective
Assessment: Exercise Machine Learning [MSSSE-1408302.b/11]

Title Short Title Semester of Study Content Exercise Machine Learning Exercise Machine Learning 1 see module description Degree elective
Assessment: Masterexam Machine Learning [MSSSE-1408302.c/11]

Title Short Title Semester of Study Content Masterexam Machine Learning Masterexam Machine Learning 1 see module description Degree elective
191
Module: Advanced Machine Learning [MSSSE-1408303/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content This lecture will extend the scope of the Machine Learning lecture with additional and, in parts, more advanced concepts. In particular, the lecture will cover the following areas: Regression techniques (linear regression, ridge regression, regression) Gaussian Processes Bayesian Estimation Bayesian Nonparametric methods (Dirichlet Processes, Structured Output Learning Beta Processes) support vector Advanced Machine Learning Advanced Machine Learning 1 1 2
Knowledge: On successful completion of this module, students should be able to recall and explain the theoretical foundations and concepts underlying Machine Learning techniques, in particular Linear regression Regularization Support Vector Regression Gaussian Processes Bayesian Estimation Probability Distributions (Gaussian, Bernoulli, Multinomial, Dirichlet, Beta), Conjugate Priors Approximate inference: sampling techniques, MCMC Mixture Models Latent Factor Models (PCA, Factor Analysis, ICA) Latent Dirichlet Allocation Bayesian Non-Parametric Methods (Dirichlet Processes, Chinese Restaurant Process, Beta Processes, Indian Buffet Process) Support Vector Machines Structured Output Learning 192
Revision: 13.06.2013 02:26:16
Skills: They should be able to derive, explain, and apply the following practical machine learning methods and algorithms: Linear regression: Least-squares regression, Ridge regression Probability density estimation: Maximum Likelihood, Maximum-A-Posteriori, Bayesian estimation, EM algorithm for Mixture-of-Gaussians estimation Gaussian Processes for regression Support Vector Regression Gibbs Sampling, MCMC Latent Dirichlet Allocation Dirichlet Processes Beta Processes Support Vector Machines Structured Output Regression
Competences: Based on the knowledge and skills acquired, they should be able to discuss the advantages and disadvantages of the covered techniques find practical solutions to complex real-world machine work on practical problems in a team machine learning
learning problems
Prerequisites It is advised to have knowledge in Linear algebra Basic Probability theory and statistics
Course Texts Medienformen: Lecture script in form of printed slides Additional handouts for certain topics Web page with supplementary material and exercises: http://www.mmp.rwth-aachen.de/teaching Literatur: C.M. Bishop, Pattern Recognition and Machine Learning, Springer, 2006
T. Hastie, R. Tibshirani, J. Friedman, The Elements of Statistical Learning, 2nd Edition, Springer, 2009 193
C.E. Rasmussen, C.K.I. Williams, Gaussian Processes for Machine Learning, MIT Press, 2006
English
Active participation in lecture and exercises Oral exam at the end
Bastian Leibe 6 4 120 Degree elective

Title Lecture Advanced Machine Learning Exercise Advanced Machine Learning Masterexam Advanced Machine Learning Ref. Code MSSSE-14083 03.a/11 MSSSE-14083 03.b/11 MSSSE-14083 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Advanced Machine Learning [MSSSE-1408303.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Lecture Advanced Machine Learning Lecture Advanced Machine Learning 1 Degree elective
Assessment: Exercise Advanced Machine Learning [MSSSE-1408303.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercise Advanced Machine Learning Exercise Advanced Machine Learning 1 Degree elective
Assessment: Masterexam Advanced Machine Learning [MSSSE-1408303.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Masterexam Advanced Machine Learning Masterexam Advanced Machine Learning 1 Degree elective
194 Revision: 13.06.2013 02:26:16
195
Module: eLearning (Computer-supported Learning) [MSSSE-1409201/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content eLearning Development Process 1. Needs analysis and didactic analysis 2. Didactic design 3. Scripting and authoring 4. Layout, screen and navigation design 5. Development of learning objects 6. Implementation and testing 7. Employment and evaluation of eLearning Motivation, Aspects and Scenarios of eLearning and Blended Learning Learning Theories in the Context of Media-supported Learning Didactic models for Multimedia Learning Theories of Instructional Design Memory Models and Principles of Multimedia Learning eAssessment and Feedback eLearning Technologies Authoring Tools, Rapid eLearning Production Web 2.0 and eLearning Further topics such as legal issues, web accessibility, usability, security etc. will be incorporated in the course lectures. The course includes regular assignments and project exercises in which the discussed technologies are put into practice to consolidate understanding. Aims and Learning Outcomes Understanding cognitive theories pertaining to multimedia learning and applying them in practical exercises (by means of check lists and in cooperation with experts) Employing didactic principles and models in design and content development Choosing adequate eLearning technologies and applying them with theoretical consideration After completing the class, students will have obtained knowledge of the basic principles of cognitive psychology and educational science in regard to media-supported learning have knowledge of the process of eLearning system development be able to evaluate and choose adequate technologies and tools for eLearning systems be capable of developing small and medium-sized eLearning systems and contents eLearning (Computer-supported Learning) eLearning 1 1 2
Prerequisites Proficiency in the concepts of imperative and object-oriented programming languages and techniques: JavaScript, Java, php-skills are helpful Good knowledge of software engineering The ability to develop small and medium-sized programs 196 Revision: 13.06.2013 02:26:16
The ability to become acquainted with user languages, web technologies and specific systems easily An interest in dealing with theories of cognitive psychology and educational science and to carry out software development based on these The necessary verve and commitment for the realization of project assignments
Course Texts
Folien und Codebeispiele zur Vorlesung, Vorlesungsaufzeichnung, sowie z.B. folgende Bcher: Niegemann, Helmut M.; Hessel, Silvia; Deimann, Markus; Hochscheid-Mauel, Dirk; Aslanski, Kristina; Kreuzberger, Gunther (2004): Kompendium E-Learning. Berlin: Springer (X.media.press). Kerres, Michael (2001): Multimediale und telemediale Lernumgebungen. Konzeption und Entwicklung. 2., vollst. berarb. Aufl. Mnchen: Oldenbourg. Clark, Ruth Colvin; Mayer, Richard E. (2003): e-Learning and the Science of Instruction. Proven Guidelines for Consumers an Designers of Multimedia Learning. San Francisco Calif.: Pfeiffer. Riser, Urs (2002): Konzeption und Entwicklung interaktiver Lernprogramme. Kompendium und multimedialer Workshop Lernen Interaktiv. Berlin: Springer (X.media.press). Mair, Daniela (2005): E-Learning - das Drehbuch. Handbuch fr Medienautoren und Projektleiter. Berlin: Springer (X.media.press). Blumstengel, Astrid (1998): Entwicklung hypermedialer Lernsysteme. Berlin: Wiss. Verl. Berlin. Online verfgbar unter http://dsor.upb.de/~blumstengel/main_index_titel.html Weitere ausgewhlte Kapitel aus diversen Bchern und vor allem Internetquellen zu den jeweils vorgestellten Technologien werden in der Vorlesung bekannt gegeben.
Deutsch/Englisch Ulrik Schroeder 6 5 105 Degree elective

Title Lecture eLearning Exercise eLearning Masterexam eLearning Ref. Code MSSSE-14092 01.a/11 MSSSE-14092 01.b/11 MSSSE-14092 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture eLearning [MSSSE-1409201.a/11]

Title Short Title Semester of Study Content Lecture eLearning Lecture eLearning 1 see module description
197
Degree elective
Assessment: Exercise eLearning [MSSSE-1409201.b/11]

Title Short Title Semester of Study Content Exercise eLearning Exercise eLearning 1 see module description Degree elective
Assessment: Masterexam eLearning [MSSSE-1409201.c/11]

Title Short Title Semester of Study Content Masterexam eLearning Masterexam eLearning 1 see module description Degree elective
198 Revision: 13.06.2013 02:26:16
Module: Designing Interactive Systems I [MSSSE-1410101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Designing Interactive Systems I Designing Interactive Systems I 1 1 2 This class introduces students to human-computer interaction (HCI) and user interface design. It covers the following topics: Fundamental characteristics of human cognition, such as reaction time, rules of perception, and memory performance Models of interaction between people and their environment, such as affordances, mappings, constraints, slips and mistakes Milestones in the history of human-computer interaction Principles of iterative design User interface prototyping techniques Golden rules of user interface design User interface design notations User studies and evaluation methods
After this class, students will know how user interfaces have developed over the past decades, and what constants of human performance need to be considered when designing them. They will be able to apply iterative design, prototyping, and evaluation methods to design usable, appropriate user interfaces in a user-centered fashion. All assignments are group assignments to foster collaboration skills, and project-based to strengthen project planning, conflict management and presentation skills. Students learn to think in designers' terms. This is a crucial competence for computer scientists working on user interfaces, a job that requires collaboration in interdisciplinary teams. D. Norman: The Design Of Everyday Things, Basic Books 2002 (required textbook for first few weeks), plus excerpts from A. Dix et al.: Human-Computer Interaction, Prentice-Hall 2004 B. Shneiderman et al.: Designing The User Interf., Add.-W. 2004 J. Raskin: The Humane Interface, Addison-Wesley 2000
Course Texts
Englisch Jan Oliver Borchers 6 5 105 Degree elective

Title Ref. Code Credits Credits Workload 199 Contact hours (h) Self-Study Time (h)
Designing Interactive Systems I Designing Interactive Systems I Masterexam Designing Interactive Systems I (6 Credits)
0 0 6
4 2 0
3 2 0
75 30 0
Assessment: Designing Interactive Systems I [MSSSE-1410101.a/11]

Title Short Title Semester of Study Content Designing Interactive Systems I Designing Interactive Systems I 1 see module description Degree elective
Assessment: Designing Interactive Systems I [MSSSE-1410101.b/11]

Title Short Title Semester of Study Content Designing Interactive Systems I Designing Interactive Systems I 1 see module description Degree elective
Assessment: Masterexam Designing Interactive Systems I (6 Credits) [MSSSE-1410101.c/11]

Title Short Title Semester of Study Content Masterexam Designing Interactive Systems I (6 Credits) Masterexam DIS I (6 Credits) 1 see module description Degree elective
200 Revision: 13.06.2013 02:26:16
Module: Designing Interactive Systems II [MSSSE-1410102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Designing Interactive Systems II Designing Interactive Systems II 1 1 2 This module builds on the foundations of Designing Interactive Systems I, and provides an understanding of how interactive multimedia systems are built from a computer science point of view. It covers the principles of event-based operating systems, window system architectures, input and output device technology for multiple modalities, as well as User Interface Management Systems and UI development toolkits and their relative merits. In the labs, students will develop a minimalistic window system themselves, but also learn to work with various real-life development environments, including window systems such as Java Swing and multimedia development environments, to develop user interfaces. After this class, students will know how the technology behind interactive systems works. They can analyze, design, and implement graphical and other user interfaces for existing and emerging technologies, both for the desktop and beyond, and including interfaces for multimedia contents. Group-based, project-centered assignments and lab activities convey hands-on experience building user interfaces and foster project management and teamwork skills. 50-90% of development effort for today's applications go into the user interface (UI). A sound understanding of the techniques, advantages, and pitfalls of the various user interface development approaches used in industry will help students to make informed decisions when implementing or managing UI design projects in industry, and will give them a crucial head start when asked to create new UI architectures for the rapidly growing markets of next-generation devices and applications. Designing Interactive Systems I Own script, plus collection of papers about seminal system designs. Englisch Jan Oliver Borchers 6 5 105 Degree elective

Title Lecture Designing Interactive Systems II Execise Designing Interactive Systems II Masterexam Designing Interactive Systems II Ref. Code MSSSE-14101 02.a/11 MSSSE-14101 02.b/11 MSSSE-14101 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Designing Interactive Systems II [MSSSE-1410102.a/11]

Title Short Title Semester of Study Lecture Designing Interactive Systems II Lecture Designing Interactive Systems II 1 201
Content
Assessment: Execise Designing Interactive Systems II [MSSSE-1410102.b/11]

Title Short Title Semester of Study Content Execise Designing Interactive Systems II Exercise Designing Interactive Systems II 1 see module description Degree elective
Assessment: Masterexam Designing Interactive Systems II [MSSSE-1410102.c/11]

Title Short Title Semester of Study Content Masterexam Designing Interactive Systems II Masterexam Designing Interactive Systems II 1 see module description Degree elective
202 Revision: 13.06.2013 02:26:16
Module: HCI Design Patterns [MSSSE-1410103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Aims and Learning Outcomes HCI Design Patterns HCI Design Patterns 1 1 2 Computer science professionals that work on the user interface of interactive products, systems and services need to communicate their design ideas efficiently to team members from a variety of other professions. Moreover, capturing the user interface design lessons learned from a completed project is crucial to avoid repeating costly earlier mistakes. After learning about HCI and UI design basics in DIS I, this module gives students a vehicle to communicate their designs more effectively. After this class, students will be able to write clear and cross-disciplinary design patterns that each capture the essence of a certain user interface design decision and its tradeoffs. They will be able to combine these patterns into larger structures called pattern languages, and will also be able to use existing pattern languages to quickly learn about crucial design guidelines for specific interface markets such as web sites or mobile devices. This unusual class in computer science emphasizes pattern reading and writing, providing an excellent opportunity to improve technical writing skills. All assignments are group-based, fostering communication skills both within their own and with other disciplines. Designing Interactive Systems I Required: Jan Borchers: A Pattern Approach to Interaction Design, Wiley, 2001. Optional: Alexander et al.: A Pattern Language: Towns, Buildings, Construction, Oxford, 1977 Alexander: The Timeless Way of Building, Oxford, 1979 Van Duyne et al.: The Design of Sites, Addison-Wesley, 2003 Graham: A Pattern Language for Web Usability, Addison-Wesley, 2003
Englisch
Lecture attendance with short in-class exercises Successful completion of weekly project-based group assignments culminating in a graded written project Graded written midterm and final examinations
Jan Oliver Borchers 6 5 105 Degree elective

Title Lecture HCI Design Ref. Code MSSSE-14101 Credits 0 203 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
Patterns Exercise HCI Design Patterns Masterexam HCI Design Patterns
03.a/11 MSSSE-14101 03.b/11 MSSSE-14101 03.c/11 0 6 2 0 2 0 30 0
Assessment: Lecture HCI Design Patterns [MSSSE-1410103.a/11]

Title Short Title Semester of Study Content Lecture HCI Design Patterns Lecture HCI Design Patterns 1 see module description Degree elective
Assessment: Exercise HCI Design Patterns [MSSSE-1410103.b/11]

Title Short Title Semester of Study Content Exercise HCI Design Patterns Exercise HCI Design Patterns 1 see module description Degree elective
Assessment: Masterexam HCI Design Patterns [MSSSE-1410103.c/11]

Title Short Title Semester of Study Content Masterexam HCI Design Patterns Masterexam HCI Design Patterns 1 see module description Degree elective
204 Revision: 13.06.2013 02:26:16
Module: iPhone Application Programming [MSSSE-1410104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content iPhone Application Programming iPhone Application Programming 1 1 2 1. Introduction: Objetive-C, COCOA, iPhone SDK 2. Interface Builder: NIB Files, 3. View Controller 4. Data Management 5. Input 6. Networking & Web 7. Audio & Video 8. Animation & OpenGL 9. Performance & Debugging 10. MapKit & AdressBook
Getting to know the iPhone SDK Being able to implement efficient iPhone applications
Prerequisites Basics in object-oriented software development
Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme
keine/none. English Jan Oliver Borchers 6 5 105 Degree elective

Title Lecture iPhone Application Programming Exercises iPhone Application Programming Masterexam iPhone Application Programming (3 Credits) Masterexam iPhone Application Programming (6 Credits) Ref. Code MSSSE-14101 04.a/11 MSSSE-14101 04.b/11 MSSSE-14101 04.c/11 MSSSE-14101 04.d/11 Credits 0 0 3 Credits Workload 3 3 0 Contact hours (h) 2 3 0 Self-Study Time (h) 60 45 0
205
Assessment: Lecture iPhone Application Programming [MSSSE-1410104.a/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Lecture iPhone Application Programming Lecture iPhone Application Programming 5 s. module description. http://hci.rwth-aachen.de/iphone Degree elective
Assessment: Exercises iPhone Application Programming [MSSSE-1410104.b/11]

Title Short Title Semester of Study Content Information Link Relevance to Degree Programme Exercises iPhone Application Programming Exercises iPhone Application Programming 5 s. module description. http://hci.rwth-aachen.de/iphone Degree elective
Assessment: Masterexam iPhone Application Programming (3 Credits) [MSSSE-1410104.c/11]

Title Short Title Semester of Study Content Masterexam iPhone Application Programming (3 Credits) Masterexam iPhone App. Prog. (3 Credits) 5 s. module description. http://hci.rwth-aachen.de/iphone Degree elective
Information Link Relevance to Degree Programme
Assessment: Masterexam iPhone Application Programming (6 Credits) [MSSSE-1410104.d/11]

Title Short Title Semester of Study Content Masterexam iPhone Application Programming (6 Credits) Masterexam iPhone App. Prog. (6 Credits) 1 see module description Degree elective
206 Revision: 13.06.2013 02:26:16
Module: Current Topics in Media Computing and HCI [MSSSE-1410105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Current Topics in Media Computing and HCI Current Topics in Media Computing and HCI 1 1 0 This class covers current research trends in Human-Computer Interaction and Media Computing. We use a mix of recent book chapters and papers from conferences and journals of the last few years to give you an idea of the hot topics that are being worked on in the international research community. Examples from past years include zoomable user interfaces, haptic input/output devices, matrix calculus for user interface modeling, and ubiquitous display technologies. You will learn about important current trends in HCI and the class also teaches you how to quickly retrieve information from existing literature, a skill you will need for your thesis and future research work. Designing Interactive Systems I Englisch Jan Oliver Borchers 6 5 105 Degree elective
Aims and Learning Outcomes Prerequisites Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme

Title Lecture Current Topics in Media Computing and HCI Exercise Current Topics in Media Computing and HCI Masterexam Current Topics in Media Computing and HCI Ref. Code MSSSE-14101 05.a/11 MSSSE-14101 05.b/11 MSSSE-14101 05.c/11 Credits 0 0 6 Credits Workload 3 3 0 Contact hours (h) 2 3 0 Self-Study Time (h) 60 45 0
Assessment: Lecture Current Topics in Media Computing and HCI [MSSSE-1410105.a/11]

Title Short Title Semester of Study Content Lecture Current Topics in Media Computing and HCI Lecture Cur. Topics in Media Comp. and HCI 1 see module description Degree elective
Assessment: Exercise Current Topics in Media Computing and HCI [MSSSE-1410105.b/11]

Title Short Title Exercise Current Topics in Media Computing and HCI Exercise Cur. Topics in Media Comp. and HCI 207
Assessment: Masterexam Current Topics in Media Computing and HCI [MSSSE-1410105.c/11]

Title Short Title Semester of Study Content Masterexam Current Topics in Media Computing and HCI Masterexam Cur. Topics in Media Comp. and HCI 1 see module description Degree elective
208 Revision: 13.06.2013 02:26:16
Module: Parallel Algorithms [MSSSE-1412104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Parallel Algorithms Parallel Algorithms 1 1 0 Variable Handouts zur Vorlesung sowie z.B.: M. J. Quinn: Parallel Programming in C with MPI and OpenMP, McGraw-Hill, 2003. V. Kumar, A. Grama, A. Gupta, G. Karypis: Introduction to Parallel Computing: Design and Analysis of Algorithms, 2nd Edition, Addison Wesley, 2003.
Deutsch/Englisch Martin Bcker 4 3 75 Degree elective

Title Lecture Parallel Algorithms Exercise Parallel Algorithms Masterexam Parallel Algorithms Ref. Code MSSSE-14121 04.a/11 MSSSE-14121 04.b/11 MSSSE-14121 04.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Parallel Algorithms [MSSSE-1412104.a/11]

Title Short Title Semester of Study Content see module description Relevance to Degree Programme Degree elective Lecture Parallel Algorithms Lecture Parallel Algorithms 1
Assessment: Exercise Parallel Algorithms [MSSSE-1412104.b/11]

Title Short Title Semester of Study Exercise Parallel Algorithms Exercise Parallel Algorithms 1
209
Content
Assessment: Masterexam Parallel Algorithms [MSSSE-1412104.c/11]

Title Short Title Semester of Study Content Masterexam Parallel Algorithms Masterexam Parallel Algorithms 1 see module description Degree elective
210 Revision: 13.06.2013 02:26:16
Module: Programming of high performance computers [MSSSE-1412105/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Programming of high performance computers Programming of high performance computers 1 1 0 Variable Handouts zur Vorlesung sowie z.B.: M. J. Quinn: Parallel Programming in C with MPI and OpenMP, McGraw-Hill, 2003.
W. Gropp, E. Lusk, A. Skjellum: Using MPI, 2nd edition, MIT Press, 2003. R. Chandra, L. Dagum, D. Kohr, D. Maydan, J. McDonald, R. Menon: Parallel Programming in OpenMP, Academic Press, 2001.
Deutsch/Englisch Christian Bischof Martin Bcker 4 3 75 Degree elective

Title Lecture Programming of high performance computers Lab Programming of high performance computers Masterexam Programming of high performance computers Ref. Code MSSSE-14121 05.a/11 MSSSE-14121 05.b/11 MSSSE-14121 05.c/11 Credits 0 Credits Workload 2.5 Contact hours (h) 2 Self-Study Time (h) 45
0 4
1.5 0
1 0
30 0
Assessment: Lecture Programming of high performance computers [MSSSE-1412105.a/11]

Title Short Title Semester of Study Content Lecture Programming of high performance computers Lecture Programming of high performance computers 1 see module description Degree elective
Assessment: Lab Programming of high performance computers [MSSSE-1412105.b/11]

Title Lab Programming of high performance computers
211
Lab Programming of high performance computers 1 see module description Degree elective
Assessment: Masterexam Programming of high performance computers [MSSSE-1412105.c/11]

Title Short Title Semester of Study Content Masterexam Programming of high performance computers Masterexam Programming high performance computers 1 see module description Degree elective
212 Revision: 13.06.2013 02:26:16
Module: Derivative Code Compilers [MSSSE-1412201/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Derivative Code Compilers Derivative Code Compilers 1 1 2 Computation of derivatives of numerical programs definitions finite difference quotients tangent-linear and adjoint programs Compiler front-ends lexical analysis syntax analysis scanner and parser generators Syntax-directed compilation of derivative code attribute grammars synthesis of tangent-linear programs synthesis of adjoint programs Program analysis internal representation of numerical programs control flow analysis data flow analysis
Acquire following knowledge and abilities:
knowledge of fundamental principles behind lexical and syntax analyses ability to use tangent-linear and adjoint programs knowledge of syntax-directed approach to compilation of derivative code; understanding of implementation using a bottom-up parser generator understanding of control and data flow analyses in the context of derivative code compilers Prerequisites Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) none Englisch Uwe Naumann 4 4 60
213
Degree elective

Title Lecture Derivative Code Compilers Exercise Derivative Code Compilers Masterexam Derivative Code Compilers Ref. Code MSSSE-14122 01.a/11 MSSSE-14122 01.b/11 MSSSE-14122 01.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 2 0 Self-Study Time (h) 45 15 0
Assessment: Lecture Derivative Code Compilers [MSSSE-1412201.a/11]

Title Short Title Semester of Study Content Lecture Derivative Code Compilers Lecture Derivative Code Compilers 1 see module description Degree elective
Assessment: Exercise Derivative Code Compilers [MSSSE-1412201.b/11]

Title Short Title Semester of Study Content Exercise Derivative Code Compilers Exercise Derivative Code Compilers 1 see module descrition Degree elective
Assessment: Masterexam Derivative Code Compilers [MSSSE-1412201.c/11]

Title Short Title Semester of Study Content Masterexam Derivative Code Compilers Masterexam Derivative Code Compilers 1 see module description Degree elective
214 Revision: 13.06.2013 02:26:16
Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Handouts zur Vorlesung sowie z.B.: A. Griewank: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, SIAM, 2000 3 1 2
English Uwe Naumann 6 4 120 Semester-specific degree elective

215
Module: Combinatorial Problems in Scientific Computing [MSSSE-1412206/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Language of Instruction Module Coordinator Combinatorial Problems in Scientific Computing Combinatorial Problems in Scientific Computing 1 1 2 Variable Vorlesungsskript mit Verweisen auf Originalartikel Englisch Christian Bischof Martin Bcker Uwe Naumann 4 3 75 Degree elective

Title Lecture Combinatorial Problems in Scientific Computing Exercise Combinatorial Problems in Scientific Computing Masterexam Combinatorial Problems in Scientific Computing Ref. Code MSSSE-14122 06.a/11 MSSSE-14122 06.b/11 MSSSE-14122 06.c/11 Credits 0 Credits Workload 2.5 Contact hours (h) 2 Self-Study Time (h) 45
1.5
30
Assessment: Lecture Combinatorial Problems in Scientific Computing [MSSSE-1412206.a/11]

Title Short Title Semester of Study Content Lecture Combinatorial Problems in Scientific Computing Lecture Combinatorial Problems in Scientific Compu 1 see module description Degree elective
Assessment: Exercise Combinatorial Problems in Scientific Computing [MSSSE-1412206.b/11]

Title Short Title Semester of Study Exercise Combinatorial Problems in Scientific Computing Exercise Combinatorial Problems in Scientific Comp 1
216 Revision: 13.06.2013 02:26:16
Content
Assessment: Masterexam Combinatorial Problems in Scientific Computing [MSSSE-1412206.c/11]

Title Short Title Semester of Study Content Masterexam Combinatorial Problems in Scientific Computing Masterexam Combinatorial Problems in Scientific Co 1 see module description Degree elective
217
Module: Virtual Reality [MSSSE-1412301/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Virtual Reality Virtual Reality 1 1 2 This course teaches the basic methods for a simulation of virtual environments and introduces to Virtual Reality applications in the fields of mechanical engineering, simulation science, and medicine. The course comes along with practical presentations and covers the following topics: Physiological aspects of 3-D viewing and hearing, VR-related computer graphics, stereoscopic projections, projection and interaction hardware, binaural acoustics, haptics, motion tracking, collision detection, physically-based modelling of virtual objects, kinematic structures VR applications in research and industry (Product development, robotics, fluid mechanics, metal forming, medicine). After the course, students should understand the basic methodology and algorithms of virtual Reality. The course also aims at demonstrating the high potential of Virtual Reality as a tool in scientific and industrial applications. none
D. Bowman et al. 3D User Interfaces. Addison-Wesley K. M. Stanney. Handbook of Virtual Environments. Erlbaum M.Slater et al. Computer Graphics & Virtual Environments. Addison-Wesley G. Burdea, P. Coiffet. Virtual Reality Technology. John Wiley & Sons K.-F. Kraiss (Ed.). Advanced Man Machine Interfaces. Springer R.S. Kalawski. The Science of Virtual Reality and Virtual Environments. Addison Wesley
Deutsch/Englisch Torsten Kuhlen 6 4 120 Degree elective

Title Lecture Virtual Reality Exercise Virtual Reality Masterexam Virtual Reality Ref. Code MSSSE-14123 01.a/11 MSSSE-14123 01.b/11 MSSSE-14123 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Virtual Reality [MSSSE-1412301.a/11]

Title Lecture Virtual Reality
218 Revision: 13.06.2013 02:26:16
Lecture Virtual Reality 1 see module description Degree elective
Assessment: Exercise Virtual Reality [MSSSE-1412301.b/11]

Title Short Title Semester of Study Content Exercise Virtual Reality Exercise Virtual Reality 1 see module description Degree elective
Assessment: Masterexam Virtual Reality [MSSSE-1412301.c/11]

Title Short Title Semester of Study Content Masterexam Virtual Reality Masterexam Virtual Reality 1 see module description Degree elective
219
Module: Medical Image Processing [MSSSE-1416501/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Medical Image Processing Medical Image Processing 1 1 2 This course gives an overview of medical image formation, enhancement, analysis, visualization, and communication with many examples from medical applications. This includes a brief introduction to medical imaging modalities and acquisition systems. Basic approaches to display multi-dimensional biomedical data are introduced. As a focus, image enhancement techniques, segmentation, texture analysis and their application in diagnostic imaging will be discussed. To complete this overview, storage, retrieval, and communication of medical images are also reviewed. The students understand basic algorithms and methods of image acquisition, processing and analysis, visualization of 2D and 3D data, and image management in the medical domain, where multiple images of the same kind may differ strongly regarding their visual appearance. The students will learn to transfer their knowledge to novel tasks providing competences and knowledge to 1. 2. 3. 4. 5. 6. 7. 8. identify major processes involved in formation of medical images classify the various medical image processing algorithms describe fundamental methods of image enhancement appraise efficacy and drawbacks of several techniques of image segmentation get familiar with the fundamental concepts of texture and shape analysis apply Fourier transform and system theory on image processing visualize medical 2D, 3D and 4D data explain the basic principles of medical image communication
Prerequisites Language of Instruction Module Coordinator
Basics in mathematics and computer science are required. Englisch Thomas Deserno

Title Lecture Medical Image Processing Exercise Medical Image Processing Examination Medical Image Processing Ref. Code MSSSE-14165 01.a/11 MSSSE-14165 01.b/11 MSSSE-14165 01.c/11 Credits 0 0 6 Credits Workload 3 3 0 Contact hours (h) 2 2 0 Self-Study Time (h) 60 60 0
Assessment: Lecture Medical Image Processing [MSSSE-1416501.a/11]

Title Short Title Revision: 13.06.2013 02:26:16 Lecture Medical Image Processing Lecture Medical Image Processing 220
1 Degree elective
Assessment: Exercise Medical Image Processing [MSSSE-1416501.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercise Medical Image Processing Exercise Medical Image Processing 1 Degree elective
Assessment: Examination Medical Image Processing [MSSSE-1416501.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Examination Medical Image Processing Examination Medical Image Processing 1 Degree elective
221
Module: Languages for Scientific Computing 1 [MSSSE-1418101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Languages for Scientific Computing 1 Languages for Scientific Computing 1 1 1 2 We will compare and contrast languages especially suitable for numerical computations, symbolic computations, and high-performance computations: Mathematica, Matlab, C, Fortran. We will also cover standard tools and libraries for scientific and parallel computations: BLAS, LAPACK, MPI, OpenMP... Different programming paradigms will be introduced: functional vs. imperative, discrete vs. numerical vs. symbolic. Programs will beevaluated with respect to metrics like performance, size, elegance. This first module focuses on numerical computations, high-performance and parallelism. Aims and Learning Outcomes Prerequisites Programming languages, theory and tools for numerical computations. Basic knowledge of numerical methods, numerical linear algebra, programming languages, algorithms.
Course Texts Writing Scientific Software by Suely Oliveira, David E. Stewart The C Programming Language, by Brian Kernighan and Dennis Ritchie http://reference.wolfram.com/mathematica/guide/Mathematica.html http://www.mathworks.com/access/helpdesk/help/techdoc/matlab.shtml
Englisch Paolo Bientinesi 6 4 120 Degree elective

Title Lecture Languages for Scientific Computing 1 Exercise Languages for Scientific Computing 1 Masterexam Languages for Scientific Computing 1 Ref. Code MSSSE-14181 01.a/11 MSSSE-14181 01.b/11 MSSSE-14181 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Languages for Scientific Computing 1 [MSSSE-1418101.a/11]

Title Lecture Languages for Scientific Computing 1
222 Revision: 13.06.2013 02:26:16
Lecture Languages for Scientific Computing 1 1 see module description Degree elective
Assessment: Exercise Languages for Scientific Computing 1 [MSSSE-1418101.b/11]

Title Short Title Semester of Study Content Exercise Languages for Scientific Computing 1 Exercise Languages for Scientific Computing 1 1 see module description Degree elective
Assessment: Masterexam Languages for Scientific Computing 1 [MSSSE-1418101.c/11]

Title Short Title Semester of Study Content Masterexam Languages for Scientific Computing 1 Masterexam Languages for Scientific Computing 1 1 see module description Free elective
223
Module: Languages for Scientific Computing 2 [MSSSE-1418102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Languages for Scientific Computing 2 Languages for Scientific Computing 2 1 1 2 This second module of Languages for Scientific Computing focuses onsymbolic computations and functional languages. Mathematica and otherlanguages with symbolic capabilities (Maple, Sage, Matlab) are used tocontinue comparison between different programming paradigms:functional vs. imperative, discrete vs. numerical vs. symbolic. Wewill cover concepts as pattern matching, textual substitution,functions and functionals, algebraic manipulations. Programs will beevaluated with respect to metrics like performance, size, elegance. The concepts of automation, program correctness and numericalstability are then introduced. Finally, symbolic technique are used toshow how to automatically generate and analyze algorithms and routines. Aims and Learning Outcomes Prerequisites Basic knowledge of numerical linear algebra. Principles of algorithms and programming. Familiarity with at least one of the following languages: Mathematica, Maple, Matlab, Sage. NOTE: Languages for Scientific Computing 1 is NOT a prerequisite. Course Texts http://reference.wolfram.com/mathematica/guide/Mathematica.html And a number of research papers: The Science of Deriving Dense Linear Algebra Algorithms. A Goal-Oriented and Modular Approach to Stability Analysis. SuperMatrix Out-of-Order Scheduling of Matrix Operations for SMP and Multi-Core Architectures. Mechanical Derivation and Systematic Analysis of Correct Linear Algebra Algorithms. Programming languages, theory and tools for symbolic computations.
Englisch Paolo Bientinesi 6 4 120 Degree elective

Title Lecture Languages for Scientific Computing 2 Ref. Code MSSSE-14181 02.a/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
224 Revision: 13.06.2013 02:26:16
Exercise Languages for Scientific Computing 2 MasterexamLanguages for Scientific Computing 2
MSSSE-14181 02.b/11 MSSSE-14181 02.c/11
0 6
2 0
1 0
45 0
Assessment: Lecture Languages for Scientific Computing 2 [MSSSE-1418102.a/11]

Title Short Title Semester of Study Content Lecture Languages for Scientific Computing 2 Lecture Languages for Scientific Computing 2 1 see module description Degree elective
Assessment: Exercise Languages for Scientific Computing 2 [MSSSE-1418102.b/11]

Title Short Title Semester of Study Content Exercise Languages for Scientific Computing 2 Exercise Languages for Scientific Computing 2 1 see module description Degree elective
Assessment: MasterexamLanguages for Scientific Computing 2 [MSSSE-1418102.c/11]

Title Short Title Semester of Study Content MasterexamLanguages for Scientific Computing 2 Masterexam Languages for Scientific Computing 2 1 see module description Degree elective
225
Module: High-Performance Computing [MSSSE-1418103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Parallel computer architectures, network topologies Block algorithms for the exploitation of data locality in deep memory hierachies Principles of parallel algorithm design Modeling parallelism (speedup, efficiency, Amdahl) Introduction to parallel programming Further selected topics Hybrid programming of shared memory clusters High-Performance Computing High-Performance Computing 1 1 2
Understanding of basic parallel computer architectures Knowledge of fundamental methods for the design of data locality optimizing serial and parallel algorithms Control of basic methods for the analysis of parallel algorithms Basic understanding of elementary operations involved in parallel programming Application of the principles of parallel hybrid programming to a practical example
Prerequisites Knowledge of essential concepts of imperative and object-orientied programming languagesas well as basic programming techniques in these languages (Lecture: Programming)
Course Texts
Handouts zur Vorlesung sowie z.B.: V. Kumar, A. Grama, A. Gupta, G. Karypis: Introduction to Parallel Computing: Design and Analysis of Algorithms, 2nd Edition, Addison Wesley, 2003.
Deutsch oder Englisch Matthias Mller 6 4 120 Degree elective

Lecture High-Performance Computing Exercise High-Performance Computing Masterexam High-Performance Computing
0 0 6
4 2 0
3 1 0
75 45 0
Assessment: Lecture High-Performance Computing [MSSSE-1418103.a/11]

Title Short Title Semester of Study Content Relevance to Degree Programme Lecture High-Performance Computing Lecture High-Performance Computing 1 see module description Degree elective
Assessment: Exercise High-Performance Computing [MSSSE-1418103.b/11]

Title Short Title Semester of Study Content Exercise High-Performance Computing Exercise High-Performance Computing 1 see module description Degree elective
Assessment: Masterexam High-Performance Computing [MSSSE-1418103.c/11]

Title Short Title Semester of Study Content Masterexam High-Performance Computing Masterexam High-Performance Computing 4 see module description Degree elective
227
Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts V. Kumar, A. Grama, A. Gupta and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. Second edition. Addison Wesley, Harlow, 2003 D.P. Bertsekas and J.N. Tsitsiklis. Parallel and Distributed Computation. Prentice Hall, Englewood Cliffs, 1989 G. Golub, J.M. Ortega. Scientific Computing - An Introduction with Parallel Computing. Academic Press, 1993 G. Meurant. Computer Solution of Large Linear Systems. North Holland, Amsterdam, 1999 M.T. Heath. Scientific Computing - An Introductory survey. Second edition. McGraw-Hill, 2002 J.W. Demmel. Applied Numerical Linear Algebra. SIAM, 1997 2 1 4
English Paolo Bientinesi 6 4 120 Degree elective

Title Ref. Code MSSSE-14181 04.a/11 MSSSE-14181 04.b/11 MSSSE-14181 04.e/11 Credits 6 0 0 Credits Workload 0 5 1 Contact hours (h) 0 3 1 Self-Study Time (h) 0 105 15
Assessment: [MSSSE-1418104.e/11]
228 Revision: 13.06.2013 02:26:16
229
Module: Simulation Software Engineering [MSSSE-1419101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content This course teaches software-engineering techniques and tools targeting the development of parallel simulation codes. Software development process and life cycle Requirements engineering Design Quality assurance Deployment & maintenance Scientific libraries Simulation Software Engineering Simulation Software Engineering 1 1 2
Students should be enabled to write correct, robust, efficient, and maintainable parallel numerical software. Knowledge of the C/C++ programming language.
I. Sommerville: Software Engineering, Addison-Wesley, 8th edition, 2006. S. Oliveira, D. Stewart: Writing Scientific Software, Cambridge University Press, 2006
Englisch Felix Gerd Eugen Wolf 6 5 105 Degree elective

Title Lecture Simulation Software Engineering Exercise Simulation Software Engineering Masterexam Simulation Software Engineering Ref. Code MSSSE-14191 01.a/11 MSSSE-14191 01.b/11 MSSSE-14191 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Simulation Software Engineering [MSSSE-1419101.a/11]

Title Short Title Semester of Study Lecture Simulation Software Engineering Lecture Simulation Software Engineering 1 230 Revision: 13.06.2013 02:26:16
Content
Assessment: Exercise Simulation Software Engineering [MSSSE-1419101.b/11]

Title Short Title Semester of Study Content Exercise Simulation Software Engineering Exercise Simulation Software Engineering 1 see module description Degree elective
Assessment: Masterexam Simulation Software Engineering [MSSSE-1419101.c/11]

Title Short Title Semester of Study Content Masterexam Simulation Software Engineering Masterexam Simulation Software Engineering 1 see module description Degree elective
231
Module: Parallel Programming I [MSSSE-1419102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Parallel Programming I PP-I 1 1 2 This course teaches parallel programming for science and engineering. Emphasis is given to programming models predominantly used in high-performance computing. * Parallel architectures * Principles of parallel performance * Processes and threads * MPI * OpenMP * Parallel programming tools * Patterns of parallel programming
Students should be enabled to write correct and efficient parallel programs. Knowledge of the C programming language. * W. Gropp, A. Skjellum, E. Lusk: Using MPI: Portable Parallel Programming with the Message Passing Interface, 2nd Edition, The MIT Press, 1999. * R. Chandra, L. Dagum, D. Kohr, D. Maydan, J. McDonald, R. Menon: Parallel Programming in OpenMP, Morgan Kaufmann Publishers, Academic Press, 2001. * B. Chapman, G. Jost , R. van der Pas: Using OpenMP: Portable Shared Memory Parallel Programming, The MIT Press, 2007. * T. Mattson, B. Sanders, B. Massingill: Patterns for Parallel Programming, Addison-Wesley, 2004. Deutsch/English Felix Gerd Eugen Wolf 6 5 105 Degree elective

232 Revision: 13.06.2013 02:26:16
Degree elective
Relevance to Degree Programme Degree elective
Relevance to Degree Programme Degree elective
233
Module: Parallel Programming II [MSSSE-1419103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content This course teaches advanced parallel programming for science and engineering. Emphasis is given to programming models predominantly used in high-performance computing. POSIX Threads Advanced MPI features PGAS languages GPU programming Parallel I/O Parallel Programming II Parallel Programming II 0 1 2
Aims and Learning Outcomes Prerequisites
Building on knowledge of the course Parallel Programming I, the students should gain deeper insights into parallel programming as well as learn about recent developments in the area of parallel programming models. Knowledge of the C programming language Course Parallel Programming I
Course Texts W. Gropp, E. Lusk, Rajeev Thakur: Using MPI-2: Advanced Features of the Message-Passing Interface, The MIT Press, 1999. Tarek El-Ghazawi, William Carlson, und Thomas L. Sterling: UPC: Distributed Shared Memory Programming, John Wiley & Sons, 2005.
Englisch Felix Gerd Eugen Wolf 6 5 105 Degree elective

Title Lecture Parallel Programming II Exercise Parallel Programming II Masterexam Parallel Programming II Ref. Code MSSSE-14191 03.a/11 MSSSE-14191 03.b/11 MSSSE-14191 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
234 Revision: 13.06.2013 02:26:16
Assessment: Lecture Parallel Programming II [MSSSE-1419103.a/11]

Title Short Title Semester of Study Content Lecture Parallel Programming II Lecture Parallel Programming II 0 see module description Degree elective
Assessment: Exercise Parallel Programming II [MSSSE-1419103.b/11]

Title Short Title Semester of Study Content Exercise Parallel Programming II Exercise Parallel Programming II 0 see module description Degree elective
Assessment: Masterexam Parallel Programming II [MSSSE-1419103.c/11]

Title Short Title Semester of Study Content Masterexam Parallel Programming II Masterexam Parallel Programming II 0 see module description Degree elective
235
Module: The Software-Engineering programming language Ada 95 [MSSSE-1503101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content The Software-Engineering programming language Ada 95 The programming language Ada 95 1 1 0 In this lecture the concepts of the programming language Ada for coarse and detailed structuring of large and reliable software systems are introduced. In addition, concepts to assure properties like adaptability, portability, and reusability are presented. The students gain the required capabilites for successful system development in Ada 95. Additionally, the concepts provide orientation for large projects in other programming languages, like C++, and the students learn the fundamental concepts of programming languages. In the exercises the concepts of the lecture are intensified and the students get a practical experience. Main topics: Software engineering and Ada Fundamental terms of programming languages Control structures Data structures in detail Ada for design Concurrent programm systems Relationship to the context of the Ada programm system
Gaining basic knowledge of Ada programming Applying type-safe data structures Learning object-oriented concepts of Ada Realizing concurrent systems with Ada Using the Ada compiler Learning about concepts of classical and modern programming languages
Introduction to software engineering of avail
M. Nagl: Softwaretechnik und Ada '95 - Entwicklung groer Systeme, 5. Auflage, 504 S., Wiesbaden: Vieweg-Verlag. (1999); 6. Aufl. (2003). J. Barnes: Programming in ADA '95, 2. Auflage, 720 S., Addison-Wesley Longman, Amsterdam, (6. Mrz 1998). Weitere Literatur wird in der Vorlesung angegeben.
Deutsch/Englisch Manfred Nagl 6 5 236
Revision: 13.06.2013 02:26:16
105 Degree elective

Title Lecture The Software-Engineering programming language Ada 95 Ecercise the Software-Engineering programming language Ada 95 Masterexam the Software-Engineering programming language Ada 95 Ref. Code MSSSE-15031 01.a/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
MSSSE-15031 01.b/11
30
MSSSE-15031 01.c/11
Assessment: Lecture The Software-Engineering programming language Ada 95 [MSSSE-1503101.a/11]

Title Short Title Semester of Study Content Lecture The Software-Engineering programming language Ada 95 Lecture The programming language Ada 95 1 see moduledescription Degree elective
Assessment: Ecercise the Software-Engineering programming language Ada 95 [MSSSE-1503101.b/11]

Title Short Title Semester of Study Content Ecercise the Software-Engineering programming language Ada 95 Exercise the programming language Ada 95 1 see moduledescription Degree elective
Assessment: Masterexam the Software-Engineering programming language Ada 95 [MSSSE-1503101.c/11]

Title Short Title Semester of Study Content Masterexam the Software-Engineering programming language Ada 95 Masterexam the programming language Ada 95 1 see moduledescription Degree elective
237
Module: Generative Software Engineering [MSSSE-1503102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Principles of modeling Domain Specific Languages UML Test case modeling Code Generation Generative Software Engineering Generative Software Engineering 1 1 2
After completing this course the students will have a deeper understanding of the use of generative techniques for the development of software systems. They will be able to develop generators for UML or other DSLs and different target platforms. Furthermore they will be able to judge the quality of systems and generators. Lecture Einfhrung in die Softwaretechnik
K. Czarnecki, U. Eisenecker: Generative Programming. Methods, Tools and Applications.: Methods, Techniques and Applications, Addision-Wesley 2000 B. Rumpe : Modellierung mit UML : Sprache, Konzepte und Methodik, Springer, Mai 2004 B. Rumpe : Agile Modellierung mit UML : Codegenerierung, Testflle, Refactoring. Springer, August 2004
Deutsch/Englisch Bernhard Rumpe 6 5 105 Degree elective

Title Lecture Generative Software Engineering Exercise Generative Software Engineering Masterexam Generative Software Engineering Ref. Code MSSSE-15031 02.a/11 MSSSE-15031 02.b/11 MSSSE-15031 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Generative Software Engineering [MSSSE-1503102.a/11]

Title Revision: 13.06.2013 02:26:16 Lecture Generative Software Engineering 238
Lecture Generative Software Engineering 1 see moduledescription Degree elective
Assessment: Exercise Generative Software Engineering [MSSSE-1503102.b/11]

Title Short Title Semester of Study Content Exercise Generative Software Engineering Exercise Generative Software Engineering 1 see moduledescription Degree elective
Assessment: Masterexam Generative Software Engineering [MSSSE-1503102.c/11]

Title Short Title Semester of Study Content Masterexam Generative Software Engineering Masterexam Generative Software Engineering 1 see moduledescription Degree elective
239
Module: Model-Based Software Engineering [MSSSE-1503103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content After a thorough and detailed introduction of UML, the possibilities of using models in the software development process are discussed. These include simulation, code and test case generation, analysis, modeling and evolution of systems by refactoring of models. UML Use of models in the software engineering process Simulation, Analysis Evolution code and test generation of models of models by refactoring Model-Based Software Engineering Model-Based Software Engineering 1 1 2
Understanding of the use of models Application of models in software engineering Knowledge and practicing of UML
Lecture Einfhrung in die Softwaretechnik
B. Rumpe : Modellierung mit UML : Sprache, Konzepte und Methodik, Springer, Mai 2004 B. Rumpe : Agile Modellierung mit UML : Codegenerierung, Testflle, Refactoring. Springer, August 2004

Title Lecture Model-Based Software Engineering Exercise Model-Based Software Engineering Masterexam Model-Based Software Engineering Ref. Code MSSSE-15031 03.a/11 MSSSE-15031 03.b/11 MSSSE-15031 03.c/11 Credits 0 0 6 Credits Workload 3 3 0 Contact hours (h) 2 3 0 Self-Study Time (h) 60 45 0
240 Revision: 13.06.2013 02:26:16
Assessment: Lecture Model-Based Software Engineering [MSSSE-1503103.a/11]

Title Short Title Semester of Study Content Lecture Model-Based Software Engineering Lecture Model-Based Software Engineering 1 see moduledescription Degree elective
Assessment: Exercise Model-Based Software Engineering [MSSSE-1503103.b/11]

Title Short Title Semester of Study Content Exercise Model-Based Software Engineering Exercise Model-Based Software Engineering 1 see moduledescription Degree elective
Assessment: Masterexam Model-Based Software Engineering [MSSSE-1503103.c/11]

Title Short Title Semester of Study Content Masterexam Model-Based Software Engineering Masterexam Model-Based Software Engineering 1 see moduledescription Degree elective
241
Module: Software Architectures [MSSSE-1503104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Modeling at design level A module concept Subarchitectures and extensions of the module concept Transformation into programming languages Architecture examples Strategies for adaptability and reusability Expressing semantics Expressing distribution Concurrent & embedded systems Concrete and abstract component connections Software Architectures Software Architectures 1 1 4
Object-based and object-oriented architecture modeling Integrating Approach including locality, layering, inheritance Studying of big examples for transformation systems, interactive systems, and embedded systems Approach also applicable for integration aspects in reverse engineering, embedded systems
Prediploma or Bachelor; Introduction to Software Engineering is recommended
M. Nagl: Methodisches Programmieren 1990 weitere schriftliche Unterlagen andere Lehrbcher zur Ergnzung
Deutsch/Englisch Manfred Nagl 6 5 105 Degree elective

Title Ref. Code Credits Credits Workload 242 Revision: 13.06.2013 02:26:16 Contact hours (h) Self-Study Time (h)
Lecture Software Architectures Exercise Software Architectures Masterexam Software Architectures
0 0 6
4 2 0
3 2 0
75 30 0
Assessment: Lecture Software Architectures [MSSSE-1503104.a/11]

Title Short Title Semester of Study Content Lecture Software Architectures Lecture Software Architectures 1 see moduledescription Degree elective
Assessment: Exercise Software Architectures [MSSSE-1503104.b/11]

Title Short Title Semester of Study Content Exercise Software Architectures Exercise Software Architectures 1 see moduledescription Degree elective
Assessment: Masterexam Software Architectures [MSSSE-1503104.c/11]

Title Short Title Semester of Study Content Masterexam Software Architectures Masterexam Software Architectures 1 see moduledescription Degree elective
243
Module: Processes and Methods of Software Tests [MSSSE-1503105/11]

Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Foundations: introduction, motivation and wording, basic test process, prioritizing tests, psychology of testing Tests in the software lifecycle: software development methodologies, module/component tests, integration test, system test, acceptance test, maintenance of tests, prototype testing Static tests: manual methods, static analysis Dynamic tests: black-box approach, white-box approach, intuitive test case development Test management: risk management, economic efficiency, reuse of tests, failure management, metrics, organizing test teams, qualifications, configuration management, standards, TestProcessImprovement (TPI) Tools and automation: types, evaluation and introduction of tools, home built vs. commercial, introduction of tools Processes and Methods of Software Tests 1 1 2
After completing this module, students have the following knowledge and skills. They know the difference between trying and testing. know the processes, methods and tools for software testing in theory and practice. know the embedding of software testing in the system software engineering. have an understanding about the benefits of software testing. know about improving processes for the introduction of software testing in practice have fulfilled the requirements for certification for the Certified Tester ISTQB
Introduction to Software Engineering
A. Spillner, T. Linz: Basiswissen Softwaretest: Aus- und Weiterbildung zum Certified Tester - Foundation Level nach ISTQB-Standard, August 2005 H. Balzert: Lehrbuch der Softwaretechnik (v.a. Band 2) M. Pol, T. Koomen, A. Spillner: Management und Optimierung des Testprozesses, Dpunkt 2002 G. E. Thaller: Software-Test: Verifikation und Validation, Heise 2002 Peter Liggesmeyer: Software-Qualitt, Spektrum Akademischer Verlag (August 2002)
Deutsch Bernhard Rumpe 3 2 60 Degree elective
244 Revision: 13.06.2013 02:26:16

Semester of Study Content 1 see module description Degree elective
Semester of Study Content 1 see module description Degree elective
245
Module: Applied Software Engineering within the life cycle of Automotive Electronics [MSSSE-1503106/11]
Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Specification of a modern architecture for Automotive Electronics: bus system, ECUs, Software The Life Cycle of Automotive Electronics Methods of electronics development Communicating with Automotive Electronics: Example of a data driven layered architecture - Use of international standards - Abstraction from the specific automobile The challenge of auto shop services: How can Software Engineering support the maintenance of Automotive Electronics of 20 model generations - Management of variants - Version- / configuration management - Data logistics Applied Software Engineering within the life cycle of Automotive Electronics 1 1 2
This course will impart a practical approach of modern software engineering: Automotive Electronics. The course contains integral modern techniques of today electronic engineering and maintenance. On the one hand the course supports applying learnt software engineering methods to practical applications. On the other hand it prepares students to get started with automotive topics for further research. Software Engineering
W. Zimmermann, R. Schmidgal: Bussysteme in der Fahrzeugtechnik: Protokolle und Standards J. Schuffele, T. Zurawka: Automotive Software Engineering: Grundlagen, Prozesse, Methoden und Werkzeuge effizient einsetzen Kai Borgeest: Elektronik in der Fahrzeugtechnik: Hardware, Software, Systeme und Projektmanagement
Deutsch Ansgar Schleicher Bernhard Rumpe 2 1 45 Degree elective

Title Lecture Applied Software Engineering within the life cycle of Automotive Electronics Revision: 13.06.2013 02:26:16 Ref. Code MSSSE-15031 06.a/11 Credits 0 Credits Workload 2 Contact hours (h) 1 Self-Study Time (h) 45
246
Masterexam Applied Software Engineering within the life cycle of Automotive Electronics
MSSSE-15031 06.c/11
Assessment: Lecture Applied Software Engineering within the life cycle of Automotive Electronics [MSSSE-1503106.a/11]
Title Short Title Semester of Study Content Lecture Applied Software Engineering within the life cycle of Automotive Electronics Lecture Software Engineering Automotive Electronic 1 see module description Degree elective
Assessment: Masterexam Applied Software Engineering within the life cycle of Automotive Electronics [MSSSE-1503106.c/11]
Title Short Title Semester of Study Content Masterexam Applied Software Engineering within the life cycle of Automotive Electronics Masterexam Software Engineering Automotive Electro 1 see module description Degree elective
247
Module: Generative Software Engineering for the Automotive Domain [MSSSE-1503107/11]

Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Artifacts created during an OEM's traditional development process Using Matlab/Simulink as design and modeling tool AUTOSAR: Specification and methodology Code and test case generation: Approaches for generative software engineering Generative Software Engineering for the Automotive Domain 1 1 2
After completing this course the students will have a deeper understanding for the requirements and usage of tools to generate artifacts during the development process for modern vehicle functions. On the example of AUTOSAR students realize how software composition can be enabled and how time-consuming, error-prone, and repeatable process steps can be simplified and sometimes automated by means of generative software engineering. Furthermore, it is illustrated how domain-specific languages can be used to extend an existing development process based on generative software engineering. Knowledge in Matlab/Simulink and from the class 'Generative Software Engineering' are helpful. O. Kindel, M. Friedrich: Softwareentwicklung mit AUTOSAR. dpunkt.verlag, Heidelberg, 2009. B. Rumpe: Agile Modellierung mit UML. Springer, Heidelberg, 2005. J. Schuffle, T. Zurawka: Automotive Software Engineering. Vieweg+Teubner, Wiebaden, 2010.

Title Lecture Generative Software Engineering for the Automotive Domain Masterexam Generative Software Engineering for the Automotive Domain Revision: 13.06.2013 02:26:16 Ref. Code MSSSE-15031 07.a/11 MSSSE-15031 07.c/11 Credits 0 Credits Workload 4 Contact hours (h) 2 Self-Study Time (h) 90
248
Assessment: Lecture Generative Software Engineering for the Automotive Domain [MSSSE-1503107.a/11]
Title Semester of Study Relevance to Degree Programme Lecture Generative Software Engineering for the Automotive Domain 1 Degree elective
Assessment: Masterexam Generative Software Engineering for the Automotive Domain [MSSSE-1503107.c/11]
Title Semester of Study Relevance to Degree Programme Masterexam Generative Software Engineering for the Automotive Domain 1 Degree elective
249
Module: Innovations in Software Engineering [MSSSE-1503109/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Current Topics and Problems from Industry and Research Modeling Software Architectures Software Engineering Tools Innovations in Software Engineering Innovations in Software Engineering 1 1 1
After completing this module, students have a thorough understanding of selected issues, problems and solutions from industry and current research. By knowing these approaches, the students will be able to apply the obtained knowledge directly in the industry. At the same time students are able to extend their fundamental knowledge with practical example and are able to apply them. Moreover, it will become clear how established techniques of software engineering are evolved and adapted for new user bases. The successful participation in one of the lectures 'Generative Software Engineering' or 'Modelbased Software Engineering' is a prerequisite. Participation in both will be helpful. B. Rumpe: Modellierung mit UML. Springer, 2. Auflage, Berlin 2011 B. Rumpe: Agile Modellierung mit UML. Springer, Berlin, 2004.

Title Lecture Innovations in Software Engineering Masterexam Innovations in Software Engineering Ref. Code MSSSE-15031 09.a/11 MSSSE-15031 09.c/11 Credits 0 3 Credits Workload 3 0 Contact hours (h) 2 0 Self-Study Time (h) 60 0
Assessment: Lecture Innovations in Software Engineering [MSSSE-1503109.a/11]

Title Short Title Lecture Innovations in Software Engineering Lecture Innovations in Software Engineering 250 Revision: 13.06.2013 02:26:16
1 Degree elective
Assessment: Masterexam Innovations in Software Engineering [MSSSE-1503109.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Masterexam Innovations in Software Engineering Masterexam Innovations in Software Engineering 1 Degree elective
251
Module: Applied Software Engineering within the life cycle of Automotive Electronics [MSSSE-1503116/11]
Module Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Specification of a modern architecture for Automotive Electronics: bus system, ECUs, Software The Life Cycle of Automotive Electronics Methods of electronics development Communicating with Automotive Electronics: Example of a data driven layered architecture - Use of international standards - Abstraction from the specific automobile The challenge of auto shop services: How can Software Engineering support the maintenance of Automotive Electronics of 20 model generations - Management of variants - Version- / configuration management - Data logistics Applied Software Engineering within the life cycle of Automotive Electronics 1 1 2
This course will impart a practical approach of modern software engineering: Automotive Electronics. The course contains integral modern techniques of today electronic engineering and maintenance. On the one hand the course supports applying learnt software engineering methods to practical applications. On the other hand it prepares students to get started with automotive topics for further research. Software Engineering
W. Zimmermann, R. Schmidgal: Bussysteme in der Fahrzeugtechnik: Protokolle und Standards J. Schuffele, T. Zurawka: Automotive Software Engineering: Grundlagen, Prozesse, Methoden und Werkzeuge effizient einsetzen Kai Borgeest: Elektronik in der Fahrzeugtechnik: Hardware, Software, Systeme und Projektmanagement
Deutsch Ansgar Schleicher Bernhard Rumpe 3 1 75 Degree elective

Title Lecture Applied Software Engineering within the life cycle of Automotive Electronics Revision: 13.06.2013 02:26:16 Ref. Code MSSSE-15031 16.a/11 Credits 0 Credits Workload 3 Contact hours (h) 1 Self-Study Time (h) 75
252
Masterexam Applied Software Engineering within the life cycle of Automotive Electronics
MSSSE-15031 16.c/11
Assessment: Lecture Applied Software Engineering within the life cycle of Automotive Electronics [MSSSE-1503116.a/11]
Title Short Title Semester of Study Content Lecture Applied Software Engineering within the life cycle of Automotive Electronics Lecture Software Engineering Automotive Electronic 1 see module description Degree elective
Assessment: Masterexam Applied Software Engineering within the life cycle of Automotive Electronics [MSSSE-1503116.c/11]
Title Short Title Semester of Study Content Masterexam Applied Software Engineering within the life cycle of Automotive Electronics Masterexam Software Engineering Automotive Electro 1 see module description Degree elective
253
Module: Object Oriented Software Construction [MSSSE-1503201/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Object Oriented Software Construction Object Oriented Software Construction 1 1 2 The following areas are covered: Object oriented concepts, polymorphism and inheritance Advanced object oriented programming concepts Use case based object oriented analysis Architecture modeling with UML Architectural pattern and design pattern Framework development Tool-material construction metaphor Refactoring of code and architecture Java based component models
After completing the module the students have the following knowledge and skills. They … know how to apply important object oriented modeling concepts are able to perform use case based object oriented analysis know important design patterns and are able to apply patterns in architectural design know how to improve code and architecture by refactoring know the architecture of Java based component models
Module Software Engineering
Meyer, B. (1997) : Object Oriented Software Construction, 2nd edition, Prentice Hall. Zllighoven, H. (2005): Object-Oriented Construction Handbook - Developing Application-Oriented Software with the Tools and Materials Approach. dpunkt.verlag, Heidelberg. Erich Gamma, Richard Helm, Ralph Johnson, John Vlissides (1995): Design Patterns, Addison-Wesley Fowler Martin (1999): Refactoring - Improving the design of existing code, Addison Wesley.
Deutsch/Englisch Horst Lichter 6 5 105
254 Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Object Oriented Software Construction Exercise Object Oriented Software Construction Masterexam Object Oriented Software Construction Ref. Code MSSSE-15032 01.a/11 MSSSE-15032 01.b/11 MSSSE-15032 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Object Oriented Software Construction [MSSSE-1503201.a/11]

Title Short Title Semester of Study Content Lecture Object Oriented Software Construction Lecture Object Oriented Software Construction 1 see module description Degree elective
Assessment: Exercise Object Oriented Software Construction [MSSSE-1503201.b/11]

Title Short Title Semester of Study Content Exercise Object Oriented Software Construction Exercise Object Oriented Software Construction 1 see module description Degree elective
Assessment: Masterexam Object Oriented Software Construction [MSSSE-1503201.c/11]

Title Short Title Semester of Study Content Masterexam Object Oriented Software Construction Masterexam Object Oriented Software Construction 1 see module description Degree elective
255
Module: Software Project Management [MSSSE-1503202/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Software Project Management Software Project Management 2 1 2 The following areas are covered: foundations, basic terminology, and concepts of project management process models RUP, XP project management processes project initiation project planning techniques risk management project controlling and monitoring cost estimation techniques project management simulation
After completing the module the students have the following knowledge and skills. They … know the goals, major activities, and processes of software project management know the collaboration and relationship between project management and software development activities are able to apply important planning and controlling techniques know processes and approaches of systematic risk management
H. Kerzner (2002): Project Management - A Systems Approach to Planning, Scheduling and Controlling, Wiley. IEEE Std 1490 (2003): Adoption of PMI Standard A Guide to the Project Management Body of Knowledge Wysocki, R. (2007): Effective Project Management, Wiley Publishing Inc.
Englisch Horst Lichter 4 2 90 Required course

256 Revision: 13.06.2013 02:26:16
Title Lecture Software Project Management Exercises Software Project Management Masterexam Software Project Management
Credits 0 0 4
Assessment: Lecture Software Project Management [MSSSE-1503202.a/11]

Title Short Title Semester of Study Content Lecture Software Project Management Lecture Software Project Management 1 see module description Required course
Assessment: Exercises Software Project Management [MSSSE-1503202.b/11]

Title Semester of Study Relevance to Degree Programme Exercises Software Project Management 2 Required course
Assessment: Masterexam Software Project Management [MSSSE-1503202.c/11]

Title Short Title Semester of Study Content Masterexam Software Project Management Masterexam Software Project Management 1 see module description Required course
257
Module: Software Quality Assurance [MSSSE-1503203/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Software Quality Assurance Software Quality Assurance 1 1 2 The following areas are covered: basic terminology, models, and concepts methods of static software inspections classification of software tests, general test process systematic test case selection approaches testing object oriented software economics of software tests and inspections test management and tools fundamentals of software measurement and metrics assessment and improvement of software development processes
After completing the module the students have the following knowledge and skills. They … know the goals, concepts, models, and basic terms of software quality assurance know important methods of static software inspections are able to apply test case selection techniques and know important test exit criteria. They are able to systematically develop test specifications know the fundamentals of software measurement and are able to define and assess software metrics know standard approaches to evaluate and improve software development processes
Liggesmeyer, P. (2003): Software- Qualitt. Testen, Analysieren und Verifizieren von Software, Spektrum Verlag. Spillner, A., T. Linz, H. Schaefer (2006): Software Testing Foundations - A Study Guide for the Certified Tester Exam. dpunkt.verlag Heidelberg. Ludewig, J., H. Lichter (2006): Software Engineering - Grundlagen, Menschen, Prozesse, Techniken, dpunkt.verlag, Heidelberg.
Deutsch/Englisch Horst Lichter 6 4 120
258 Revision: 13.06.2013 02:26:16
Degree elective

Title Lecture Software Quality Assurance Exercise Software Quality Assurance Masterexam Software Quality Assurance Ref. Code MSSSE-15032 03.a/11 MSSSE-15032 03.b/11 MSSSE-15032 03.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Software Quality Assurance [MSSSE-1503203.a/11]

Title Short Title Semester of Study Content Lecture Software Quality Assurance Lecture Software Quality Assurance 1 see module description Degree elective
Assessment: Exercise Software Quality Assurance [MSSSE-1503203.b/11]

Title Short Title Semester of Study Content Exercise Software Quality Assurance Exercise Software Quality Assurance 1 see module description Degree elective
Assessment: Masterexam Software Quality Assurance [MSSSE-1503203.c/11]

Title Short Title Semester of Study Content Masterexam Software Quality Assurance Masterexam Software Quality Assurance 1 see module description Degree elective
259
Module: Development of Software Product Lines [MSSSE-1503204/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Development of Software Product Lines Development of Software Product Lines 1 1 0 Variable Folien zur Vorlesung sowie z.B. folgende Bcher: Lai, Weiss (1999): Software product line engineering, A family-based software development process, Addison-Wesley, ISBN 0-201-69438-7
Clements, Northrop (2002): Software Product Lines Practices and Patterns, Addison-Wesley, ISBN 0-201-70332-7 Bckle, Knauber, Pohl., Schmid (Hrsg.) (2004): Software-Produktfamilien Methoden, Einfhrung in der Praxis, dpunkt.verlag Pohl, Bckle, van der Linden (2005): Software Product Line Engineering: Foundations, Principles and Techniques, Springer
Deutsch/Englisch Horst Lichter 4 3 75 Degree elective

Title Lecture Development of Software Product Lines Exercise Development of Software Product Lines Masterexam Development of Software Product Lines Ref. Code MSSSE-15032 04.a/11 MSSSE-15032 04.b/11 MSSSE-15032 04.c/11 Credits 0 0 4 Credits Workload 2.5 1.5 0 Contact hours (h) 2 1 0 Self-Study Time (h) 45 30 0
Assessment: Lecture Development of Software Product Lines [MSSSE-1503204.a/11]

Title Short Title Semester of Study Content Lecture Development of Software Product Lines Lecture Development of Software Product Lines 1 see module description Degree elective
Assessment: Exercise Development of Software Product Lines [MSSSE-1503204.b/11]

260 Revision: 13.06.2013 02:26:16
Exercise Development of Software Product Lines Exercise Development of Software Product Lines 1 see module description Degree elective
Assessment: Masterexam Development of Software Product Lines [MSSSE-1503204.c/11]

Title Short Title Semester of Study Content Masterexam Development of Software Product Lines Masterexam Development of Software Product Lines 1 see module description Degree elective
261
Module: Information Management [MSSSE-1505107/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Content Information Management Information Management 1 1 0 Variable The module discusses the key aspects of the implementation of database systems and Internet information systems. This includes the introduction of basic architectures (e.g. layered architecture) as well the procedures necessary for solving individual tasks (especially query analysis and transaction management). The concepts of implementation will be applied to classical (relational model, deductive databases) as well as to search engines and integrated information systems. In addition to the necessary theoretical background practical concepts will be introduced that allow database administrators the efficient tuning of databases. General / Related to the module: Students learn how large-scale databases and information systems are technically implemented and managed. This includes relational database systems as well as Internet information systems such as search engines. Students also learn how large-scale databases and data centers are administered and managed. Subject-/Methodical-/Learning Competence/Soft Skills: Students will be able to evaluate, apply, and possibly improve database architectures, query processing and transaction management (concurrent users and error recovery). They also understand and experiment with the major mechanisms in search engines such as Google, and with different methods of information integration. In the exercises the students have to present their handed-in solution in front of the class. Exercises can be done in small groups. Benefits for future professional life: Professional knowledge about evaluating, administrating and tuning existing databases as well as a solid understanding of information system architectures and their management in modern businesses is provided.
Subject-/Methodical-/Learning Competence/Soft Skills: Students will be able to evaluate, apply, and possibly improve database architectures, query processing and transaction management (concurrent users and error recovery). They also understand and experiment with the major mechanisms in search engines such as Google, and with different methods of information integration. In the exercises the students have to present their handed-in solution in front of the class. Exercises can be done in small groups. Benefits for future professional life: Professional knowledge about evaluating, administrating and tuning existing databases as well as a solid understanding of information system architectures and their management in modern businesses is provided. Subject-/Methodical-/Learning Competence/Soft Skills: Students will be able to evaluate, apply, and possibly improve database architectures, query processing and transaction management (concurrent users and error recovery). They also understand and experiment with the major mechanisms in search engines such as Google, and with different methods of information integration. In the exercises the students have to present their handed-in solution in front of the class. Exercises can be done in small groups. Benefits for future professional life: Professional knowledge about evaluating, administrating and tuning existing databases as well as a solid understanding of information system architectures and their management in modern businesses is provided. Students will be able to evaluate, apply, and possibly improve database architectures, query processing and transaction management (concurrent users and error recovery). They also understand and experiment with the major mechanisms in search engines such as Google, and with different methods of information integration. In the exercises the students have to present their handed-in solution in front of the class. Exercises can be done in small groups. Benefits for future professional life: Professional knowledge about evaluating, administrating and tuning existing databases as well as a solid understanding of information system architectures and their management in modern businesses is provided.
262 Revision: 13.06.2013 02:26:16
Benefits for future professional life: Professional knowledge about evaluating, administrating and tuning existing databases as well as a solid understanding of information system architectures and their management in modern businesses is provided. Benefits for future professional life: Professional knowledge about evaluating, administrating and tuning existing databases as well as a solid understanding of information system architectures and their management in modern businesses is provided. Professional knowledge about evaluating, administrating and tuning existing databases as well as a solid understanding of information system architectures and their management in modern businesses is provided.
Prerequisites Introduction to Databases (Bachelor or Master Level) Working knowledge in data structures and algorithms
Course Texts D.E. Shasha: Database Tuning - A Principled Approach. Prentice Hall, 1992. R. Elmasri, S. Navathe: Fundamentals of Database Systems, Addison-Wesley, 4. Aufl. 2003 A. Kemper, A. Eickler: Datenbanksysteme - eine Einfhrung. 8. Aufl. 2011 (Oldenbourg). H. Krcmar: Informationsmanagement. 5. Aufl., Springer 2009
Englisch Matthias Jarke 6 4 120 Degree elective

Title Lecture Information Management Exercise Information Management Masterexam Information Management Ref. Code MSSSE-15051 07.a/11 MSSSE-15051 07.b/11 MSSSE-15051 07.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Information Management [MSSSE-1505107.a/11]

Title Short Title Lecture Information Management Lecture Information Management 263
Assessment: Exercise Information Management [MSSSE-1505107.b/11]

Title Short Title Semester of Study Content Exercise Information Management Exercise Information Management 1 see module description Degree elective
Assessment: Masterexam Information Management [MSSSE-1505107.c/11]

Title Short Title Semester of Study Content Masterexam Information Management Masterexam Information Management 1 see module description Degree elective
264 Revision: 13.06.2013 02:26:16
Module: Embedded Systems [MSSSE-1511101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Embedded Systems Embedded Systems 1 1 2 Folien zur Vorlesung, Skript sowie als Ergnzung folgende Bcher: Marwedel: Eingebettete Systeme. 2003 Bass, Clements: Software Architecture in Practice. Douglass: Real-time UML
Deutsch/Englisch Stefan Kowalewski 6 4 120 Degree elective

Title Lecture Embedded Systems Exercise Embedded Systems Masterexam Embedded Systems Ref. Code MSSSE-15111 01.a/11 MSSSE-15111 01.b/11 MSSSE-15111 01.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Embedded Systems [MSSSE-1511101.a/11]

Title Short Title Semester of Study Content Lecture Embedded Systems Lecture Embedded Systems 1 see module description Degree elective
Assessment: Exercise Embedded Systems [MSSSE-1511101.b/11]

Title Short Title Semester of Study Content Exercise Embedded Systems Exercise Embedded Systems 1 see module description
265
Degree elective
Assessment: Masterexam Embedded Systems [MSSSE-1511101.c/11]

Title Short Title Semester of Study Content Masterexam Embedded Systems Masterexam Embedded Systems 1 see module description Degree elective
266 Revision: 13.06.2013 02:26:16
Module: Dynamic Systems for Computer Scientist [MSSSE-1511102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Dynamic Systems for Computer Scientist Dynamic Systems for Computer Scientist 1 1 2 Folien zur Vorlesung, Skript sowie als Ergnzung folgende Bcher: Leigh: Control Theory Lunze: Automatisierungstechnik

Title Lecture Dynamic Systems for Computer Scientist Exercise Dynamic Systems for Computer Scientist Masterexam Dynamic Systems for Computer Scientist Ref. Code MSSSE-15111 02.a/11 MSSSE-15111 02.b/11 MSSSE-15111 02.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Dynamic Systems for Computer Scientist [MSSSE-1511102.a/11]

Title Short Title Semester of Study Content Lecture Dynamic Systems for Computer Scientist Lecture Dynamic Systems for Computer Scientist 1 see module description Degree elective
Assessment: Exercise Dynamic Systems for Computer Scientist [MSSSE-1511102.b/11]

Title Short Title Semester of Study Content Exercise Dynamic Systems for Computer Scientist Exercise Dynamic Systems for Computer Scientist 1 see module description
267
Degree elective
Assessment: Masterexam Dynamic Systems for Computer Scientist [MSSSE-1511102.c/11]

Title Short Title Semester of Study Content Masterexam Dynamic Systems for Computer Scientist Masterexam Dynamic Systems for Computer Scientist 1 see module description Degree elective
268 Revision: 13.06.2013 02:26:16
Module: Security and Reliability software-controlled Systems [MSSSE-1511103/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Security and Reliability software-controlled Systems Security, Reliability software-controlled Systems 1 1 2 Folien zur Vorlesung, Skript sowie als Ergnzung folgende Bcher: Storey: Safety-critical computer systems. Prentice Hall, 1996. N. Leveson: Safeware. Addison-Wesley, 2001. J. Barnes: High integrity software. Addison-Wesley, 2003. K. Simpson, D. Smith: Functional Safety. Elsevier, 2004. Birolini: Reliability Engineering. Springer, 2004. S. Montenegro: Sichere und fehlertolerante Steuerungen. Hanser, 1999.

Title Lecture Security and Reliability software-controlled Systems Exercise Security and Reliability software-controlled Systems Masterexam Security and Reliability software-controlled Systems Ref. Code MSSSE-15111 03.a/11 MSSSE-15111 03.b/11 MSSSE-15111 03.c/11 Credits 0 Credits Workload 4 Contact hours (h) 3 Self-Study Time (h) 75
45
Assessment: Lecture Security and Reliability software-controlled Systems [MSSSE-1511103.a/11]

Title Short Title Semester of Study Content Lecture Security and Reliability software-controlled Systems Lecture Security, Reliability softw.-control. Sys. 1 see module description Degree elective
Assessment: Exercise Security and Reliability software-controlled Systems [MSSSE-1511103.b/11]

269
Exercise Security and Reliability software-controlled Systems Exercis Security, Reliability softw.-control. Sys. 1 see module description Degree elective
Assessment: Masterexam Security and Reliability software-controlled Systems [MSSSE-1511103.c/11]

Title Short Title Semester of Study Content Masterexam Security and Reliability software-controlled Systems Masterexam Security, Reliability softw.-contr. Sys 1 see module description Degree elective
270 Revision: 13.06.2013 02:26:16
Module: Formal Methods for Emebedded Systems [MSSSE-1511104/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content Embedded Software Explicit Model Checking Symbolic Model Checking Static Analysis Abstract Interpretation Abstraction Techniques Formal Methods for Emebedded Systems Formal Methods for Emebedded Systems 1 1 2
Communication of knowledge about formal methods, embedded systems, and the application of formal methods to embedded systems. None. Siehe Veranstaltung im CAMPUS. Deutsch Bastian Schlich Stefan Kowalewski 6 4 120 Degree elective

Title Lecture Formal Methods for Emebedded Systems Exercise Formal Methods for Emebedded Systems Masterexam Formal Methods for Emebedded Systems Ref. Code MSSSE-15111 04.a/11 MSSSE-15111 04.b/11 MSSSE-15111 04.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 1 0 Self-Study Time (h) 75 45 0
Assessment: Lecture Formal Methods for Emebedded Systems [MSSSE-1511104.a/11]

Title Short Title Semester of Study Content Lecture Formal Methods for Emebedded Systems Lecture Formal Methods for Emebedded Systems 1 see module description Degree elective 271
Assessment: Exercise Formal Methods for Emebedded Systems [MSSSE-1511104.b/11]

Title Short Title Semester of Study Content Exercise Formal Methods for Emebedded Systems Exercise Formal Methods for Emebedded Systems 1 see module description Degree elective
Assessment: Masterexam Formal Methods for Emebedded Systems [MSSSE-1511104.c/11]

Title Short Title Semester of Study Content Masterexam Formal Methods for Emebedded Systems Masterexam Formal Methods for Emebedded Systems 1 see module description Degree elective
272 Revision: 13.06.2013 02:26:16
Module: Seminar I [MSSSE-201/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme 4 2 90 Degree elective Seminar I Seminar I 1 1 1 Themenabhngig; wird vorgegeben bzw.selbst recherchiert Deutsch/Englisch Fachgruppe Informatik

Title Seminar I Ref. Code MSSSE-201.a/ 11 Credits 4 Credits Workload 4 Contact hours (h) 2 Self-Study Time (h) 90
Assessment: Seminar I [MSSSE-201.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Seminar I Seminar I 1 Degree elective
273
Module: Seminar II [MSSSE-202/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme 4 2 90 Degree elective Seminar II Seminar II 1 1 1 Themenabhngig; wird vorgegeben bzw.selbst recherchiert Deutsch/Englisch Fachgruppe Informatik

Title Seminar II Ref. Code MSSSE-202.a/ 11 Credits 4 Credits Workload 4 Contact hours (h) 2 Self-Study Time (h) 90
Assessment: Seminar II [MSSSE-202.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Seminar II Seminar II 1 Degree elective
274 Revision: 13.06.2013 02:26:16
Module: Software Lab [MSSSE-301/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme 7 4 150 Degree elective Software Lab Software Lab 1 1 1 Fachgruppe Informatik

Title Software Lab Ref. Code MSSSE-301.a/ 11 Credits 7 Credits Workload 7 Contact hours (h) 4 Self-Study Time (h) 150
Assessment: Software Lab [MSSSE-301.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Software Lab Software Lab 1 Degree elective
275
Semester of Study Duration (semesters) Course Cycle (every n semesters) Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme 3 0 90 Degree elective 1 1 1 Fachgruppe Informatik

Title Ref. Code MSSSE-401.a/ 11 Credits 3 Credits Workload 3 Contact hours (h) 0 Self-Study Time (h) 90
276 Revision: 13.06.2013 02:26:16
Module: Research Focus Class on Communication Systems [MSSSE-4204101/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content The Research Focus Class (RFC) addresses students with an interest in current research and development activities in the area of communication and distributed systems. Each participant will examine special aspects of a selected research area. After an introductory lecture into the current state of the art of a selected research area, the RFC consists of an extensive exercise course. As exercises, the participants will be assigned specific topics which have to be examined scientifically, theoretically as well as practically. The results have to be presented and possibly demonstrated, followed by extensive discussions. A list of potential fields from which topics are selected, is given in the following: Network architectures, e.g. peer-to-peer or DTNs Wireless networks: ad-hoc, mesh, and sensor networks Mobility and security in the Internet Cross-layer protocols and modular protocol stacks Protocol simulation and verification The actual topics will be announced each semester. Aims and Learning Outcomes Detailed knowledge of current research in communication and distributed systems Deepened understanding of a selected current topic Knowledge of scientific methods for obtaining results, theoretically as well as practically Ability to independently familiarize oneself with a research topic Research Focus Class on Communication Systems Research Focus Class on Communication Systems 1 1 1
Prerequisites Course Texts Language of Instruction Grading
Successful participation in the lecture Advanced Internet Technology Wird in der Veranstaltung bekanntgegeben; aktuelle Literatur zu ausgewhlten Themen. Englisch
The examination of the course consists of three components: an oral exam on the concepts developed in the lecture, a scientific presentation of a current research topic including a subsequent discussion, and practical work necessary for achieving the presented results. The assignment of grades is: 20% oral exam on the lecture (MPO 7 Abs. 3), 40% presentation (MPO 7 Abs. 8), and 40% practical work (MPO 7 Abs. 13). Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Klaus Wehrle 6 5 105 Degree elective

Title Ref. Code Credits Credits Workload 277 Contact hours (h) Self-Study Time (h)
Lecture Research Focus Class on Communication Systems Exercise Research Focus Class on Communication Systems Presentation Research Focus Class on Communication Systems Practical Course Research Focus Class on Communication Systems Exam Research Focus Class on Communication Systems
MSSSE-42041 01.a/11 MSSSE-42041 01.b/11 MSSSE-42041 01.c/11 MSSSE-42041 01.d/11 MSSSE-42041 01.e/11
75
30
Assessment: Lecture Research Focus Class on Communication Systems [MSSSE-4204101.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Lecture Research Focus Class on Communication Systems Lecture RFC Communication Systems 1 Degree elective
Assessment: Exercise Research Focus Class on Communication Systems [MSSSE-4204101.b/11]

Title Short Title Semester of Study Relevance to Degree Programme Exercise Research Focus Class on Communication Systems Exercise RFC Communication Systems 1 Degree elective
Assessment: Presentation Research Focus Class on Communication Systems [MSSSE-4204101.c/11]

Title Short Title Semester of Study Relevance to Degree Programme Presentation Research Focus Class on Communication Systems Presentation RFC Communication Systems 1 Degree elective
Assessment: Practical Course Research Focus Class on Communication Systems [MSSSE-4204101.d/11]

Title Short Title Semester of Study Relevance to Degree Programme Practical Course Research Focus Class on Communication Systems Practical Course RFC Communication Systems 1 Degree elective
Assessment: Exam Research Focus Class on Communication Systems [MSSSE-4204101.e/11]

Title Exam Research Focus Class on Communication Systems
278 Revision: 13.06.2013 02:26:16
Short Title Semester of Study Relevance to Degree Programme
Exam RFC Communication Systems 1 Degree elective
279
Module: Masterthesis [MSSSE-501/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme Masterthesis Masterthesis 4 1 1 Fachgruppe Informatik 30 0 900 Degree elective

Title Masterthesis Ref. Code MSSSE-501.a/ 11 Credits 30 Credits Workload 30 Contact hours (h) 0 Self-Study Time (h) 900
Assessment: Masterthesis [MSSSE-501.a/11]

Title Short Title Semester of Study Relevance to Degree Programme Masterthesis Masterthesis 4 Free elective
280 Revision: 13.06.2013 02:26:16
Module: [ALT] Peer-to-Peer Systems and Applications (Massively Distributed Systems I) [MSSSE-91204201/11]
Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Content [ALT] Peer-to-Peer Systems and Applications (Massively Distributed Systems I) Peer-to-Peer Systems and Applications 1 1 2 This course focuses on Peer-to-Peer systems and applications. Basics of Peer-to-Peer Networking: Motivation, characteristics, topologies, challenges, goals Unstructured Peer-to-Peer systems: e.g. Gnutella, FreeNet etc. Structured Peer-to-Peer systems: mainly the concept of distributed hash tables (Chord, CAN, Pastry) Peer-to-Peer applications: like end-system-based multicast, distributed file systems, instant messaging, P2P-VoIP etc.
Acquirement of the following skills and knowledge: Comprehension of the basic characteristics of Peer-to-Peer and massively scalable systems Knowledge of unstructured Peer-to-Peer systems Knowledge of structured Peer-to-Peer systems Expertise to design massively scalable / decentral systems, services, and applications based on the technologies presented in the lecture
Folien zur Vorlesung Steinmetz, Wehrle (Eds.): Peer-to-Peer Systems and Applications, Springer, 2005.

Title Lecture Peer-to-Peer Systems and Applications Exercise Peer-to-Peer Systems and Applications Ref. Code MSSSE-91204 201.a/11 MSSSE-91204 201.b/11 Credits 0 0 Credits Workload 4 2 Contact hours (h) 3 1 Self-Study Time (h) 75 45
281
Masterexam Peer-to-Peer Systems and Applications
MSSSE-91204 201.c/11
Assessment: Lecture Peer-to-Peer Systems and Applications [MSSSE-91204201.a/11]

Title Short Title Semester of Study Content Lecture Peer-to-Peer Systems and Applications Lecture Peer-to-Peer Systems and Applications 1 see module description Degree elective
Assessment: Exercise Peer-to-Peer Systems and Applications [MSSSE-91204201.b/11]

Title Short Title Semester of Study Content Exercise Peer-to-Peer Systems and Applications Exercise Peer-to-Peer Systems and Applications 1 see module description Degree elective
Assessment: Masterexam Peer-to-Peer Systems and Applications [MSSSE-91204201.c/11]

Title Short Title Semester of Study Content Masterexam Peer-to-Peer Systems and Applications Masterexam Peer-to-Peer Systems and Applications 1 see module description Degree elective
282 Revision: 13.06.2013 02:26:16
Module: [ALT] Models of Data Exploration [MSSSE-91309102/11]

Module Title Short Title Semester of Study Duration (semesters) Course Cycle (every n semesters) Start of Cycle Course Texts Language of Instruction Module Coordinator Credits Contact Hours per week Self-Study Time (h) Relevance to Degree Programme [ALT] Models of Data Exploration Models of Data Exploration 1 1 0 Variable Folienskript zur Vorlesung mit zahlreichen Verweisen auf die Originalliteratur Deutsch Thomas Seidl 6 5 105 Degree elective

Title Lecture Models of Data Exploration Exercise Models of Data Exploration Masterexam Models of Data Exploration Ref. Code MSSSE-91309 102.a/11 MSSSE-91309 102.b/11 MSSSE-91309 102.c/11 Credits 0 0 6 Credits Workload 4 2 0 Contact hours (h) 3 2 0 Self-Study Time (h) 75 30 0
Assessment: Lecture Models of Data Exploration [MSSSE-91309102.a/11]

Title Short Title Semester of Study Content Lecture Models of Data Exploration Lecture Models of Data Exploration 1 see module description Degree elective
Assessment: Exercise Models of Data Exploration [MSSSE-91309102.b/11]

Title Short Title Semester of Study Content Exercise Models of Data Exploration Exercise Models of Data Exploration 1 see module description Degree elective
Assessment: Masterexam Models of Data Exploration [MSSSE-91309102.c/11]

283
Masterexam Models of Data Exploration Masterexam Models of Data Exploration 1 see module description Degree elective
284 Revision: 13.06.2013 02:26:16

Module English

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Module English

Uploaded by

Copyright:

Available Formats

Module Handbook for Master of Science Software Systems Engineering

2 Revision: 13.06.2013 02:26:16

Degree Course Information: Master of Science Software Systems Engineering [MSSSE/11]

Module: Network Algorithms [MSSSE-1101101/11]

Aims and Learning Outcomes

Prerequisites Course Texts

Basic knowledge about algorithms, discrete structures and probability theory

Englisch Berthold Vcking 6 4 120 Degree elective

Assessment and Qualifications

Masterexam Network Algorithms

Assessment: Lecture Network Algorithms [MSSSE-1101101.a/11]

Relevance to Degree Programme

Assessment: Exercise Network Algorithms [MSSSE-1101101.b/11]

Relevance to Degree Programme

Assessment: Masterexam Network Algorithms [MSSSE-1101101.c/11]

Relevance to Degree Programme

Module: Algorithmic Game Theory [MSSSE-1101102/11]

Aims and Learning Outcomes

Prerequisites Course Texts

Basic knowledge about algorithms, discrete structures, probability theory (stochastic)

Englisch Berthold Vcking 6 4 120 Degree elective

Assessment and Qualifications

6 Revision: 13.06.2013 02:26:16

Masterexam Algorithmic Game Theory

Assessment: Lecture Algorithmic Game Theory [MSSSE-1101102.a/11]

Relevance to Degree Programme

Assessment: Exercise Algorithmic Game Theory [MSSSE-1101102.b/11]

Relevance to Degree Programme

Assessment: Masterexam Algorithmic Game Theory [MSSSE-1101102.c/11]

Relevance to Degree Programme

Module: Algorithmic Cryptography [MSSSE-1101103/11]

Englisch Walter Unger 6 5 105 Degree elective

Assessment and Qualifications

Assessment: Lecure Algorithmic Cryptography [MSSSE-1101103.a/11]

Relevance to Degree Programme

Assessment: Exercise Algorithmic Cryptography [MSSSE-1101103.b/11]

Relevance to Degree Programme

Assessment: Masterexam Algorithmic Cryptography [MSSSE-1101103.c/11]

Relevance to Degree Programme

Module: Graph Algorithms [MSSSE-1101104/11]

Englisch Walter Unger 6 5 105 Degree elective

Assessment and Qualifications

Assessment: Lecture Graph Algorithms [MSSSE-1101104.a/11]

Relevance to Degree Programme

Assessment: Exercise Graph Algorithms [MSSSE-1101104.b/11]

Relevance to Degree Programme

Assessment: Masterexam Graph Algorithms [MSSSE-1101104.c/11]

Relevance to Degree Programme

Module: Theoretical Foundations of Distributed Systems [MSSSE-1101106/11]

Aims and Learning Outcomes

Prerequisites Course Texts

Basic knowledge about algorithms, discrete structures, and probability theory

English Berthold Vcking 6 5 105 Degree elective

Assessment and Qualifications

12 Revision: 13.06.2013 02:26:16

Exercise Theory of Distributed Systems Masterexam Theory of Distributed Systems

MSSSE-11011 06.b/11 MSSSE-11011 06.c/11

Assessment: Lecture Theory of Distributed Systems [MSSSE-1101106.a/11]

Assessment: Exercise Theory of Distributed Systems [MSSSE-1101106.b/11]

Assessment: Masterexam Theory of Distributed Systems [MSSSE-1101106.c/11]

Module: Analysis of Algorithms [MSSSE-1101201/11]

Aims and Learning Outcomes

Lecture Notes on Analysis of Algorithms and the books