Search result: Catalogue data in Spring Semester 2015
|Electrical Engineering and Information Technology Master|
| Major Courses|
A total of 42 CP must be achieved form courses during the Master Program. The individual study plan is subject to the tutor's approval.
|Computers and Networks|
| Core Subjects|
These core subjects are particularly recommended for the field of "Computers and Networks".
|227-0558-00L||Principles of Distributed Computing||W||6 credits||2V + 2U + 1A||R. Wattenhofer|
|Abstract||We study the fundamental issues underlying the design of distributed systems: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques.|
|Objective||Distributed computing is essential in modern computing and communications systems. Examples are on the one hand large-scale networks such as the Internet, and on the other hand multiprocessors such as your new multi-core laptop. This course introduces the principles of distributed computing, emphasizing the fundamental issues underlying the design of distributed systems and networks: communication, coordination, fault-tolerance, locality, parallelism, self-organization, symmetry breaking, synchronization, uncertainty. We explore essential algorithmic ideas and lower bound techniques, basically the "pearls" of distributed computing. We will cover a fresh topic every week.|
|Content||Distributed computing models and paradigms, e.g. message passing, shared memory, synchronous vs. asynchronous systems, time and message complexity, peer-to-peer systems, small-world networks, social networks, sorting networks, wireless communication, and self-organizing systems.|
Distributed algorithms, e.g. leader election, coloring, covering, packing, decomposition, spanning trees, mutual exclusion, store and collect, arrow, ivy, synchronizers, diameter, all-pairs-shortest-path, wake-up, and lower bounds
|Lecture notes||Available. Our course script is used at dozens of other universities around the world.|
|Literature||Lecture Notes By Roger Wattenhofer. These lecture notes are taught at about a dozen different universities through the world.|
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Hagit Attiya, Jennifer Welch.
McGraw-Hill Publishing, 1998, ISBN 0-07-709352 6
Introduction to Algorithms
Thomas Cormen, Charles Leiserson, Ronald Rivest.
The MIT Press, 1998, ISBN 0-262-53091-0 oder 0-262-03141-8
Disseminatin of Information in Communication Networks
Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger.
Springer-Verlag, Berlin Heidelberg, 2005, ISBN 3-540-00846-2
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
Frank Thomson Leighton.
Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991, ISBN 1-55860-117-1
Distributed Computing: A Locality-Sensitive Approach
Society for Industrial and Applied Mathematics (SIAM), 2000, ISBN 0-89871-464-8
|Prerequisites / Notice||Course pre-requisites: Interest in algorithmic problems. (No particular course needed.)|
|227-0678-00L||Speech Processing II |
"Speech Processing II" takes place for the last time in spring 2015.
|W||6 credits||2V + 2U||B. Pfister|
|Abstract||Interdisciplinary approaches to text-to-speech synthesis and speech recognition (continuation of course speech processing I).|
|Objective||In this course selected concepts and interdisciplinary approaches to text-to-speech synthesis and speech recognition are presented.|
|Content||Fundamentals of representation and application of linguistic knowledge: Introduction of the theory of formal languages, the Chomsky hierarchy, word analysis, finite state machines, parsing.|
Speech synthesis: Natural language analysis (for words and sentences), lexicon, grammar for natural language; generation of the abstract representation of pronunciation (phone sequence, accents, phrases). Additionally, the ETH text-to-speech system SVOX is discussed.
Speech recognition: The statistical approach to speech recognition with hidden Markov models is detailed: Basic algorithms (forward, Viterbi and Baum-Welch algorithm), problems of implementation, HMM training, whole vs. subword modeling, isolated word recognition, continuous speech recognition, statistical and rule-based language models.
|Lecture notes||The following textbook will be used: "Sprachverarbeitung - Grundlagen und Methoden der Sprachsynthese und Spracherkennung", B. Pfister und T. Kaufmann, Springer Verlag, ISBN: 978-3-540-75909-6|
|Prerequisites / Notice||Prerequisites: |
Speech Processing I.
- Page 1 of 1