Suchergebnis: Katalogdaten im Frühjahrssemester 2020
Elektrotechnik und Informationstechnologie Master  | ||||||
 Master-Studium (Studienreglement 2018) | ||||||
| Computers and Networks The core courses and specialization courses below are a selection for students who wish to specialize in the area of "Computers and Networks", see https://www.ee.ethz.ch/studies/main-master/areas-of-specialisation.html. The individual study plan is subject to the tutor's approval. | ||||||
| Vertiefungsfächer These specialization courses are particularly recommended for the area of "Computers and Networks", but you are free to choose courses from any other field in agreement with your tutor. A minimum of 40 credits must be obtained from specialization courses during the Master's Programme. | ||||||
| Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
|---|---|---|---|---|---|---|
| 101-0178-01L | Uncertainty Quantification in Engineering | W | 3 KP | 2G | S. Marelli | |
| Kurzbeschreibung | Uncertainty quantification aims at studying the impact of aleatory and epistemic uncertainty onto computational models used in science and engineering. The course introduces the basic concepts of uncertainty quantification: probabilistic modelling of data (copula theory), uncertainty propagation techniques (Monte Carlo simulation, polynomial chaos expansions), and sensitivity analysis. | |||||
| Lernziel | After this course students will be able to properly pose an uncertainty quantification problem, select the appropriate computational methods and interpret the results in meaningful statements for field scientists, engineers and decision makers. The course is suitable for any master/Ph.D. student in engineering or natural sciences, physics, mathematics, computer science with a basic knowledge in probability theory. | |||||
| Inhalt | The course introduces uncertainty quantification through a set of practical case studies that come from civil, mechanical, nuclear and electrical engineering, from which a general framework is introduced. The course in then divided into three blocks: probabilistic modelling (introduction to copula theory), uncertainty propagation (Monte Carlo simulation and polynomial chaos expansions) and sensitivity analysis (correlation measures, Sobol' indices). Each block contains lectures and tutorials using Matlab and the in-house software UQLab (www.uqlab.com). | |||||
| Skript | Detailed slides are provided for each lecture. A printed script gathering all the lecture slides may be bought at the beginning of the semester. | |||||
| Voraussetzungen / Besonderes | A basic background in probability theory and statistics (bachelor level) is required. A summary of useful notions will be handed out at the beginning of the course. A good knowledge of Matlab is required to participate in the tutorials and for the mini-project. | |||||
| 227-0126-00L | Advanced Topics in Networked Embedded Systems | W | 2 KP | 1S | L. Thiele, J. Beutel | |
| Kurzbeschreibung | The seminar will cover advanced topics in networked embedded systems. A particular focus are cyber-physical systems, internet of things, and sensor networks in various application domains. | |||||
| Lernziel | The goal is to get a deeper understanding on leading edge technologies in the discipline, on classes of applications, and on current as well as future research directions. In addition, participants will improve their presentation, reading and reviewing skills. | |||||
| Inhalt | The seminar enables Master students, PhDs and Postdocs to learn about latest breakthroughs in wireless sensor networks, networked embedded systems and devices, and energy-harvesting in several application domains, including environmental monitoring, tracking, smart buildings and control. Participants are requested to actively participate in the organization and preparation of the seminar. In particular, they review all presented papers using a standard scientific reviewing system, they present one of the papers orally and they lead the corresponding discussion session. | |||||
| 227-0420-00L | Information Theory II Findet dieses Semester nicht statt. | W | 6 KP | 2V + 2U | A. Lapidoth | |
| Kurzbeschreibung | This course builds on Information Theory I. It introduces additional topics in single-user communication, connections between Information Theory and Statistics, and Network Information Theory. | |||||
| Lernziel | The course has two objectives: to introduce the students to the key information theoretic results that underlay the design of communication systems and to equip the students with the tools that are needed to conduct research in Information Theory. | |||||
| Inhalt | Differential entropy, maximum entropy, the Gaussian channel and water filling, the entropy-power inequality, Sanov's Theorem, Fisher information, the broadcast channel, the multiple-access channel, Slepian-Wolf coding, and the Gelfand-Pinsker problem. | |||||
| Skript | n/a | |||||
| Literatur | T.M. Cover and J.A. Thomas, Elements of Information Theory, second edition, Wiley 2006 | |||||
| 227-0436-00L | Digital Communication and Signal Processing | W | 6 KP | 2V + 2U | A. Wittneben | |
| Kurzbeschreibung | A comprehensive presentation of modern digital modulation, detection and synchronization schemes and relevant aspects of signal processing enables the student to analyze, simulate, implement and research the physical layer of advanced digital communication schemes. The course both covers the underlying theory and provides problem solving and hands-on experience. | |||||
| Lernziel | Digital communication systems are characterized by ever increasing requirements on data rate, spectral efficiency and reliability. Due to the huge advances in very large scale integration (VLSI) we are now able to implement extremely complex digital signal processing algorithms to meet these challenges. As a result the physical layer (PHY) of digital communication systems has become the dominant function in most state-of-the-art system designs. In this course we discuss the major elements of PHY implementations in a rigorous theoretical fashion and present important practical examples to illustrate the application of the theory. In Part I we treat discrete time linear adaptive filters, which are a core component to handle multiuser and intersymbol interference in time-variant channels. Part II is a seminar block, in which the students develop their analytical and experimental (simulation) problem solving skills. After a review of major aspects of wireless communication we discuss, simulate and present the performance of novel cooperative and adaptive multiuser wireless communication systems. As part of this seminar each students has to give a 15 minute presentation and actively attends the presentations of the classmates. In Part III we cover parameter estimation and synchronization. Based on the classical discrete detection and estimation theory we develop maximum likelihood inspired digital algorithms for symbol timing and frequency synchronization. | |||||
| Inhalt | Part I: Linear adaptive filters for digital communication • Finite impulse response (FIR) filter for temporal and spectral shaping • Wiener filters • Method of steepest descent • Least mean square adaptive filters Part II: Seminar block on cooperative wireless communication • review of the basic concepts of wireless communication • multiuser amplify&forward relaying • performance evaluation of adaptive A&F relaying schemes and student presentations Part III: Parameter estimation and synchronization • Discrete detection theory • Discrete estimation theory • Synthesis of synchronization algorithms • Frequency estimation • Timing adjustment by interpolation | |||||
| Skript | Lecture notes. | |||||
| Literatur | [1] Oppenheim, A. V., Schafer, R. W., "Discrete-time signal processing", Prentice-Hall, ISBN 0-13-754920-2. [2] Haykin, S., "Adaptive filter theory", Prentice-Hall, ISBN 0-13-090126-1. [3] Van Trees, H. L., "Detection , estimation and modulation theory", John Wiley&Sons, ISBN 0-471-09517-6. [4] Meyr, H., Moeneclaey, M., Fechtel, S. A., "Digital communication receivers: synchronization, channel estimation and signal processing", John Wiley&Sons, ISBN 0-471-50275-8. | |||||
| Voraussetzungen / Besonderes | Formal prerequisites: none Recommended: Communication Systems or equivalent | |||||
| 227-0559-00L | Seminar in Deep Reinforcement Learning  Number of participants limited to 25. | W | 2 KP | 2S | R. Wattenhofer, O. Richter | |
| Kurzbeschreibung | In this seminar participating students present and discuss recent research papers in the area of deep reinforcement learning. The seminar starts with two introductory lessons introducing the basic concepts. Alongside the seminar a programming challenge is posed in which students can take part to improve their grade. | |||||
| Lernziel | Since Google Deepmind presented the Deep Q-Network (DQN) algorithm in 2015 that could play Atari-2600 games at a superhuman level, the field of deep reinforcement learning gained a lot of traction. It sparked media attention with AlphaGo and AlphaZero and is one of the most prominent research areas. Yet many research papers in the area come from one of two sources: Google Deepmind or OpenAI. In this seminar we aim at giving the students an in depth view on the current advances in the area by discussing recent papers as well as discussing current issues and difficulties surrounding deep reinforcement learning. | |||||
| Inhalt | Two introductory courses introducing Q-learning and policy gradient methods. Afterwards participating students present recent papers. For details see: www.disco.ethz.ch/courses.html | |||||
| Skript | Slides of presentations will be made available. | |||||
| Literatur | OpenAI course (https://spinningup.openai.com/en/latest/) plus selected papers. The paper selection can be found on www.disco.ethz.ch/courses.html. | |||||
| Voraussetzungen / Besonderes | It is expected that student have prior knowledge and interest in machine and deep learning, for instance by having attended appropriate courses. | |||||
| 252-0408-00L | Cryptographic Protocols | W | 6 KP | 2V + 2U + 1A | M. Hirt, U. Maurer | |
| Kurzbeschreibung | The course presents a selection of hot research topics in cryptography. The choice of topics varies and may include provable security, interactive proofs, zero-knowledge protocols, secret sharing, secure multi-party computation, e-voting, etc. | |||||
| Lernziel | Indroduction to a very active research area with many gems and paradoxical results. Spark interest in fundamental problems. | |||||
| Inhalt | The course presents a selection of hot research topics in cryptography. The choice of topics varies and may include provable security, interactive proofs, zero-knowledge protocols, secret sharing, secure multi-party computation, e-voting, etc. | |||||
| Skript | the lecture notes are in German, but they are not required as the entire course material is documented also in other course material (in english). | |||||
| Voraussetzungen / Besonderes | A basic understanding of fundamental cryptographic concepts (as taught for example in the course Information Security or in the course Cryptography Foundations) is useful, but not required. | |||||
| 851-0734-00L | Recht der Informationssicherheit Findet dieses Semester nicht statt. Besonders geeignet für Studierende D-INFK, D-ITET | W | 2 KP | 2V | ||
| Kurzbeschreibung | Einführung in das Recht der Informationssicherheit für Nicht-Juristen bzw. angehende Entscheidträger von Unternehmen und Behörden, welche sich mit Fragen der Informationssicherheit zu befassen haben (CIO, COO, CEOs). Die Vorlesung behandelt die rechtlichen Aspekte der Sicherheit von ICT-Infrastrukturen und Netzen (Internet) und der transportierten und verarbeiteten Informationen. | |||||
| Lernziel | Lernziel ist das Erkennen der Bedeutung und der Ziele der Informationssicherheit und der rechtlichen Rahmenbedingungen, die Kenntnis des rechtlichen Instrumentariums für einen effizienten Schutz von Infrastrukturen und schützenswerten Rechtsgütern sowie die Analyse von allfälligen Regelungslücken und möglicher Massnahmen. Für den Besuch der Vorlesung braucht es keine juristischen Vorkenntnisse. | |||||
| Inhalt | Es werden aktuelle branchenspezifische und sektorübergreifende Themen aus dem Spannungsfeld zwischen Technik und Recht aus den Bereichen Datenschutzrecht, Computerdelikte, gesetzliche Geheimhaltungspflichten, Fernmeldeüberwachung (Internet), elektronische Signatur, Haftungsrecht etc. behandelt. | |||||
| Skript | Powerpoint-Slides, welche entweder zu Vorlesungsbeginn jeweils abrufbar sind oder in der Vorlesung in Papierform abgegeben werden. | |||||
| Literatur | Auf weiterführende Literatur wird jeweils in der Vorlesung hingewiesen werden. | |||||
| 252-0437-00L | Verteilte Algorithmen | W | 5 KP | 3V + 1A | F. Mattern | |
| Kurzbeschreibung | Modelle verteilter Berechnungen; Raum-Zeit Diagramme; Virtuelle Zeit; Logische Uhren und Kausalität; Wellenalgorithmen; Verteilte und parallele Graphtraversierung; Berechnung konsistenter Schnappschüsse; Wechselseitiger Ausschluss; Election und Symmetriebrechung; Verteilte Terminierung; Garbage-Collection in verteilten Systemen; Beobachten verteilter Systeme; Berechnung globaler Prädikate. | |||||
| Lernziel | Kennenlernen von Modellen und Algorithmen verteilter Systeme. | |||||
| Inhalt | Verteilte Algorithmen sind Verfahren, die dadurch charakterisiert sind, dass mehrere autonome Prozesse gleichzeitig Teile eines gemeinsamen Problems in kooperativer Weise bearbeiten und der dabei erforderliche Informationsaustausch ausschliesslich über Nachrichten erfolgt. Derartige Algorithmen kommen im Rahmen verteilter Systeme zum Einsatz, bei denen kein gemeinsamer Speicher existiert und die Übertragungszeit von Nachrichten i.a. nicht vernachlässigt werden kann. Da dabei kein Prozess eine aktuelle konsistente Sicht des globalen Zustands besitzt, führt dies zu interessanten Problemen. Im einzelnen werden u.a. folgende Themen behandelt: Modelle verteilter Berechnungen; Raum-Zeit Diagramme; Virtuelle Zeit; Logische Uhren und Kausalität; Wellenalgorithmen; Verteilte und parallele Graphtraversierung; Berechnung konsistenter Schnappschüsse; Wechselseitiger Ausschluss; Election und Symmetriebrechung; Verteilte Terminierung; Garbage-Collection in verteilten Systemen; Beobachten verteilter Systeme; Berechnung globaler Prädikate. | |||||
| Literatur | - F. Mattern: Verteilte Basisalgorithmen, Springer-Verlag - G. Tel: Topics in Distributed Algorithms, Cambridge University Press - G. Tel: Introduction to Distributed Algorithms, Cambridge University Press, 2nd edition - A.D. Kshemkalyani, M. Singhal: Distributed Computing, Cambridge University Press - N. Lynch: Distributed Algorithms, Morgan Kaufmann Publ | |||||
| 227-0559-10L | Seminar in Communication Networks: Learning, Reasoning and Control Findet dieses Semester nicht statt. Number of participants limited to 24. | W | 2 KP | 2S | L. Vanbever, A. Singla | |
| Kurzbeschreibung | In this seminar participating students review, present, and discuss (mostly recent) research papers in the area of computer networks. This semester the seminar will focus on topics blending networks with machine learning and control theory. | |||||
| Lernziel | The two main goals of this seminar are: 1) learning how to read and review scientific papers; and 2) learning how to present and discuss technical topics with an audience of peers. Students are required to attend the entire seminar, choose a paper to present from a given list, prepare and give a presentation on that topic, and lead the follow-up discussion. To ensure the talks' quality, each student will be mentored by a teaching assistant. In addition to presenting one paper, every student is also required to submit one (short) review for one of the two papers presented every week in-class (12 reviews in total). The students will be evaluated based on their submitted reviews, their presentation, their leadership in animating the discussion for their own paper, and their participation in the discussions of other papers. | |||||
| Inhalt | The seminar will start with two introductory lectures in week 1 and week 2. Starting from week 3, participating students will start reviewing, presenting, and discussing research papers. Each week will see two presentations, for a total of 24 papers. The course content will vary from semester to semester. This semester, the seminar will focus on topics blending networks with machine learning and control theory. For details, please see: https://seminar-net.ethz.ch | |||||
| Skript | The slides of each presentation will be made available on the website. | |||||
| Literatur | The paper selection will be made available on the course website: https://seminar-net.ethz.ch | |||||
| Voraussetzungen / Besonderes | Communication Networks (227-0120-00L) or equivalents. It is expected that students have prior knowledge in machine learning and control theory, for instance by having attended appropriate courses. | |||||
| 252-0312-00L | Ubiquitous Computing | W | 4 KP | 2V + 1A | C. Holz, F. Mattern, S. Mayer | |
| Kurzbeschreibung | Unlike desktop computing, ubiquitous computing occurs anytime and everywhere, using any device, in any location, and in any format. Computers exist in different forms, from watches and phones to refrigerators or pairs of glasses. Main topics: Smart environments, IoT, mobiles & wearables, context & location, sensing & tracking, computer vision on embedded systems, health monitoring, fabrication. | |||||
| Lernziel | Unlike desktop computing, ubiquitous computing occurs anytime and everywhere, using any device, in any location, and in any format. Computers exist in different forms, from watches and phones to refrigerators or pairs of glasses. Main topics: Smart environments, IoT, mobiles & wearables, context & location, sensing & tracking, computer vision on embedded systems, health monitoring, fabrication. | |||||
| Skript | Copies of slides will be made available | |||||
| Literatur | Will be provided in the lecture. To put you in the mood: Mark Weiser: The Computer for the 21st Century. Scientific American, September 1991, pp. 94-104 | |||||
Seite
1
von
1
