# Search result: Catalogue data in Autumn Semester 2018

Computational Science and Engineering Master | ||||||

Fields of Specialization | ||||||

Systems and Control | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |
---|---|---|---|---|---|---|

151-0575-01L | Signals and Systems | W | 4 credits | 2V + 2U | A. Carron, G. Ducard | |

Abstract | Signals arise in most engineering applications. They contain information about the behavior of physical systems. Systems respond to signals and produce other signals. In this course, we explore how signals can be represented and manipulated, and their effects on systems. We further explore how we can discover basic system properties by exciting a system with various types of signals. | |||||

Objective | Master the basics of signals and systems. Apply this knowledge to problems in the homework assignments and programming exercise. | |||||

Content | Discrete-time signals and systems. Fourier- and z-Transforms. Frequency domain characterization of signals and systems. System identification. Time series analysis. Filter design. | |||||

Lecture notes | Lecture notes available on course website. | |||||

Prerequisites / Notice | Control Systems I is helpful but not required. | |||||

151-0563-01L | Dynamic Programming and Optimal Control | W | 4 credits | 2V + 1U | R. D'Andrea | |

Abstract | Introduction to Dynamic Programming and Optimal Control. | |||||

Objective | Covers the fundamental concepts of Dynamic Programming & Optimal Control. | |||||

Content | Dynamic Programming Algorithm; Deterministic Systems and Shortest Path Problems; Infinite Horizon Problems, Bellman Equation; Deterministic Continuous-Time Optimal Control. | |||||

Literature | Dynamic Programming and Optimal Control by Dimitri P. Bertsekas, Vol. I, 3rd edition, 2005, 558 pages, hardcover. | |||||

Prerequisites / Notice | Requirements: Knowledge of advanced calculus, introductory probability theory, and matrix-vector algebra. | |||||

252-0535-00L | Advanced Machine Learning | W | 8 credits | 3V + 2U + 2A | J. M. Buhmann | |

Abstract | Machine learning algorithms provide analytical methods to search data sets for characteristic patterns. Typical tasks include the classification of data, function fitting and clustering, with applications in image and speech analysis, bioinformatics and exploratory data analysis. This course is accompanied by practical machine learning projects. | |||||

Objective | Students will be familiarized with advanced concepts and algorithms for supervised and unsupervised learning; reinforce the statistics knowledge which is indispensible to solve modeling problems under uncertainty. Key concepts are the generalization ability of algorithms and systematic approaches to modeling and regularization. Machine learning projects will provide an opportunity to test the machine learning algorithms on real world data. | |||||

Content | The theory of fundamental machine learning concepts is presented in the lecture, and illustrated with relevant applications. Students can deepen their understanding by solving both pen-and-paper and programming exercises, where they implement and apply famous algorithms to real-world data. Topics covered in the lecture include: Fundamentals: What is data? Bayesian Learning Computational learning theory Supervised learning: Ensembles: Bagging and Boosting Max Margin methods Neural networks Unsupservised learning: Dimensionality reduction techniques Clustering Mixture Models Non-parametric density estimation Learning Dynamical Systems | |||||

Lecture notes | No lecture notes, but slides will be made available on the course webpage. | |||||

Literature | C. Bishop. Pattern Recognition and Machine Learning. Springer 2007. R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley & Sons, second edition, 2001. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, 2001. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, 2004. | |||||

Prerequisites / Notice | The course requires solid basic knowledge in analysis, statistics and numerical methods for CSE as well as practical programming experience for solving assignments. Students should have followed at least "Introduction to Machine Learning" or an equivalent course offered by another institution. | |||||

401-5850-00L | Seminar in Systems and Control for CSE | W | 4 credits | 2S | F. Dörfler, R. Smith | |

Abstract | ||||||

Objective | ||||||

Robotics | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

151-0601-00L | Theory of Robotics and Mechatronics | W | 4 credits | 3G | P. Korba, S. Stoeter | |

Abstract | This course provides an introduction and covers the fundamentals of the field, including rigid motions, homogeneous transformations, forward and inverse kinematics of multiple degree of freedom manipulators, velocity kinematics, motion planning, trajectory generation, sensing, vision, and control. It’s a requirement for the Robotics Vertiefung and for the Masters in Mechatronics and Microsystems. | |||||

Objective | Robotics is often viewed from three perspectives: perception (sensing), manipulation (affecting changes in the world), and cognition (intelligence). Robotic systems integrate aspects of all three of these areas. This course provides an introduction to the theory of robotics, and covers the fundamentals of the field, including rigid motions, homogeneous transformations, forward and inverse kinematics of multiple degree of freedom manipulators, velocity kinematics, motion planning, trajectory generation, sensing, vision, and control. This course is a requirement for the Robotics Vertiefung and for the Masters in Mechatronics and Microsystems. | |||||

Content | An introduction to the theory of robotics, and covers the fundamentals of the field, including rigid motions, homogeneous transformations, forward and inverse kinematics of multiple degree of freedom manipulators, velocity kinematics, motion planning, trajectory generation, sensing, vision, and control. | |||||

Lecture notes | available. | |||||

252-0535-00L | Advanced Machine Learning | W | 8 credits | 3V + 2U + 2A | J. M. Buhmann | |

Abstract | Machine learning algorithms provide analytical methods to search data sets for characteristic patterns. Typical tasks include the classification of data, function fitting and clustering, with applications in image and speech analysis, bioinformatics and exploratory data analysis. This course is accompanied by practical machine learning projects. | |||||

Objective | Students will be familiarized with advanced concepts and algorithms for supervised and unsupervised learning; reinforce the statistics knowledge which is indispensible to solve modeling problems under uncertainty. Key concepts are the generalization ability of algorithms and systematic approaches to modeling and regularization. Machine learning projects will provide an opportunity to test the machine learning algorithms on real world data. | |||||

Content | The theory of fundamental machine learning concepts is presented in the lecture, and illustrated with relevant applications. Students can deepen their understanding by solving both pen-and-paper and programming exercises, where they implement and apply famous algorithms to real-world data. Topics covered in the lecture include: Fundamentals: What is data? Bayesian Learning Computational learning theory Supervised learning: Ensembles: Bagging and Boosting Max Margin methods Neural networks Unsupservised learning: Dimensionality reduction techniques Clustering Mixture Models Non-parametric density estimation Learning Dynamical Systems | |||||

Lecture notes | No lecture notes, but slides will be made available on the course webpage. | |||||

Literature | C. Bishop. Pattern Recognition and Machine Learning. Springer 2007. R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley & Sons, second edition, 2001. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference and Prediction. Springer, 2001. L. Wasserman. All of Statistics: A Concise Course in Statistical Inference. Springer, 2004. | |||||

Prerequisites / Notice | The course requires solid basic knowledge in analysis, statistics and numerical methods for CSE as well as practical programming experience for solving assignments. Students should have followed at least "Introduction to Machine Learning" or an equivalent course offered by another institution. | |||||

263-5902-00L | Computer Vision | W | 6 credits | 3V + 1U + 1A | M. Pollefeys, V. Ferrari, L. Van Gool | |

Abstract | The goal of this course is to provide students with a good understanding of computer vision and image analysis techniques. The main concepts and techniques will be studied in depth and practical algorithms and approaches will be discussed and explored through the exercises. | |||||

Objective | The objectives of this course are: 1. To introduce the fundamental problems of computer vision. 2. To introduce the main concepts and techniques used to solve those. 3. To enable participants to implement solutions for reasonably complex problems. 4. To enable participants to make sense of the computer vision literature. | |||||

Content | Camera models and calibration, invariant features, Multiple-view geometry, Model fitting, Stereo Matching, Segmentation, 2D Shape matching, Shape from Silhouettes, Optical flow, Structure from motion, Tracking, Object recognition, Object category recognition | |||||

Prerequisites / Notice | It is recommended that students have taken the Visual Computing lecture or a similar course introducing basic image processing concepts before taking this course. | |||||

263-3210-00L | Deep Learning Number of participants limited to 300. | W | 4 credits | 2V + 1U | F. Perez Cruz | |

Abstract | Deep learning is an area within machine learning that deals with algorithms and models that automatically induce multi-level data representations. | |||||

Objective | In recent years, deep learning and deep networks have significantly improved the state-of-the-art in many application domains such as computer vision, speech recognition, and natural language processing. This class will cover the mathematical foundations of deep learning and provide insights into model design, training, and validation. The main objective is a profound understanding of why these methods work and how. There will also be a rich set of hands-on tasks and practical projects to familiarize students with this emerging technology. | |||||

Prerequisites / Notice | This is an advanced level course that requires some basic background in machine learning. More importantly, students are expected to have a very solid mathematical foundation, including linear algebra, multivariate calculus, and probability. The course will make heavy use of mathematics and is not (!) meant to be an extended tutorial of how to train deep networks with tools like Torch or Tensorflow, although that may be a side benefit. The participation in the course is subject to the following conditions: 1) The number of participants is limited to 300 students (MSc and PhDs). 2) Students must have taken the exam in Machine Learning (252-0535-00) or have acquired equivalent knowledge, see exhaustive list below: Machine Learning Link Computational Intelligence Lab Link Learning and Intelligent Systems/Introduction to Machine Learning Link Statistical Learning Theory Link Computational Statistics Link Probabilistic Artificial Intelligence Link Data Mining: Learning from Large Data Sets Link | |||||

151-0563-01L | Dynamic Programming and Optimal Control | W | 4 credits | 2V + 1U | R. D'Andrea | |

Abstract | Introduction to Dynamic Programming and Optimal Control. | |||||

Objective | Covers the fundamental concepts of Dynamic Programming & Optimal Control. | |||||

Content | Dynamic Programming Algorithm; Deterministic Systems and Shortest Path Problems; Infinite Horizon Problems, Bellman Equation; Deterministic Continuous-Time Optimal Control. | |||||

Literature | Dynamic Programming and Optimal Control by Dimitri P. Bertsekas, Vol. I, 3rd edition, 2005, 558 pages, hardcover. | |||||

Prerequisites / Notice | Requirements: Knowledge of advanced calculus, introductory probability theory, and matrix-vector algebra. | |||||

151-0851-00L | Robot Dynamics | W | 4 credits | 2V + 2U | M. Hutter, R. Siegwart | |

Abstract | We will provide an overview on how to kinematically and dynamically model typical robotic systems such as robot arms, legged robots, rotary wing systems, or fixed wing. | |||||

Objective | The primary objective of this course is that the student deepens an applied understanding of how to model the most common robotic systems. The student receives a solid background in kinematics, dynamics, and rotations of multi-body systems. On the basis of state of the art applications, he/she will learn all necessary tools to work in the field of design or control of robotic systems. | |||||

Content | The course consists of three parts: First, we will refresh and deepen the student's knowledge in kinematics, dynamics, and rotations of multi-body systems. In this context, the learning material will build upon the courses for mechanics and dynamics available at ETH, with the particular focus on their application to robotic systems. The goal is to foster the conceptual understanding of similarities and differences among the various types of robots. In the second part, we will apply the learned material to classical robotic arms as well as legged systems and discuss kinematic constraints and interaction forces. In the third part, focus is put on modeling fixed wing aircraft, along with related design and control concepts. In this context, we also touch aerodynamics and flight mechanics to an extent typically required in robotics. The last part finally covers different helicopter types, with a focus on quadrotors and the coaxial configuration which we see today in many UAV applications. Case studies on all main topics provide the link to real applications and to the state of the art in robotics. | |||||

Prerequisites / Notice | The contents of the following ETH Bachelor lectures or equivalent are assumed to be known: Mechanics and Dynamics, Control, Basics in Fluid Dynamics. | |||||

401-5860-00L | Seminar in Robotics for CSE | W | 4 credits | 2S | R. Siegwart | |

Abstract | This course provides an opportunity to familiarize yourself with the advanced topics of robotics and mechatronics research. The study plan has to be discussed with the lecturer based on your specific interests and/or the relevant seminar series such as the IRIS's Robotics Seminars and BiRONZ lectures, for example. | |||||

Objective | The students are familiar with the challenges of the fascinating and interdisciplinary field of Robotics and Mechatronics. They are introduced in the basics of independent non-experimental scientific research and are able to summarize and to present the results efficiently. | |||||

Content | This 4 ECTS course requires each student to discuss a study plan with the lecturer and select minimum 10 relevant scientific publications to read through, or attend 5-10 lectures of the public robotics oriented seminars (e.g. Public robotics seminars such as the IRIS's Robotics Seminars Link, and BiRONZ lectures Link are good examples). At the end of semester, the results should be presented in an oral presentation and summarized in a report, which takes the discussion of the presentation into account. | |||||

Physics For the field of specialization `Physics' basic knowledge in quantum mechanics is required. | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

402-0809-00L | Introduction to Computational Physics | W | 8 credits | 2V + 2U | H. J. Herrmann | |

Abstract | This course offers an introduction to computer simulation methods for physics problems and their implementation on PCs and super computers: classical equations of motion, partial differential equations (wave equation, diffusion equation, Maxwell's equation), Monte Carlo simulations, percolation, phase transitions | |||||

Objective | ||||||

Content | Einführung in die rechnergestützte Simulation physikalischer Probleme. Anhand einfacher Modelle aus der klassischen Mechanik, Elektrodynamik und statistischen Mechanik sowie interdisziplinären Anwendungen werden die wichtigsten objektorientierten Programmiermethoden für numerische Simulationen (überwiegend in C++) erläutert. Daneben wird eine Einführung in die Programmierung von Vektorsupercomputern und parallelen Rechnern, sowie ein Überblick über vorhandene Softwarebibliotheken für numerische Simulationen geboten. | |||||

Prerequisites / Notice | Lecture and exercise lessons in english, exams in German or in English | |||||

402-0205-00L | Quantum Mechanics I | W | 10 credits | 3V + 2U | M. Gaberdiel | |

Abstract | Introduction to non-relativistic single-particle quantum mechanics. In particular, the basic concepts of quantum mechanics, such as the quantisation of classical systems, wave functions, the description of observables as operators on a Hilbert space, as well as the formulation of symmetries, will be discussed. Basic phenomena will be analysed and illustrated by generic examples. | |||||

Objective | Introduction to single-particle quantum mechanics. Familiarity with basic ideas and concepts (quantisation, operator formalism, symmetries, angular momentum, perturbation theory) and generic examples and applications (bound states, tunneling, hydrogen atom, harmonic oscillator). Ability to solve simple problems. | |||||

Content | Keywords: Schrödinger equation, basic formalism of quantum mechanics (states, operators, commutators, measuring process), symmetries (translations, rotations, discrete symmetries), quantum mechanics in one dimension, spherically symmetric problems in three dimensions, hydrogen atom, harmonic oscillator, angular momentum, spin, addition of angular momenta, relation between QM and classical physics. | |||||

Literature | J.J. Sakurai: Modern Quantum Mechanics A. Messiah: Quantum Mechanics I S. Weinberg: Lectures on Quantum Mechanics | |||||

402-0461-00L | Quantum Information Theory | W | 8 credits | 3V + 1U | J. Renes | |

Abstract | The goal of this course is to introduce the foundations of quantum information theory. It starts with a brief introduction to the mathematical theory of information and then discusses the basic information-theoretic aspects of quantum mechanics. Further topics include applications such as quantum cryptography and quantum computing. | |||||

Objective | The course gives an insight into the notion of information and its relevance to physics and, in particular, quantum mechanics. It also serves as a preparation for further courses in the area of quantum information sciences. | |||||

402-0777-00L | Particle Accelerator Physics and Modeling I | W | 6 credits | 2V + 1U | A. Adelmann | |

Abstract | This is the first of two courses, introducing particle accelerators from a theoretical point of view and covers state-of-the-art modelling techniques. | |||||

Objective | You understand the building blocks of particle accelerators. Modern analysis tools allows you to model state-of-the-art particle accelerators. In some of the exercises you will be confronted with next generation machines. We will develop a Python simulation tool (pyAcceLEGOrator) that reflects the theory from the lecture. | |||||

Content | Here is the rough plan of the topics, however the actual pace may vary relative to this plan. - Recap of Relativistic Classical Mechanics and Electrodynamics - Building Blocks of Particle Accelerators - Lie Algebraic Structure of Classical Mechanics and Applications to Particle Accelerators - Symplectic Maps & Analysis of Maps - Symplectic Particle Tracking - Collective Effects - Linear & Circular Machines incl. Cyclotrons - Radiation and Free Electron Lasers | |||||

Lecture notes | Lecture notes | |||||

Prerequisites / Notice | Physics, Computational Science (RW) at BSc. Level This lecture is also suited for PhD. students | |||||

401-5810-00L | Seminar in Physics for CSE | W | 4 credits | 2S | A. Adelmann | |

Abstract | In this seminar, the students present a talk on an advanced topic in modern theoretical or computational physics. The main focus is quantum computation. | |||||

Objective | To teach students the topics of current interest in computational and theoretical physics. In particular, concepts of quantum computation. | |||||

Computational Finance | ||||||

Number | Title | Type | ECTS | Hours | Lecturers | |

401-3913-01L | Mathematical Foundations for Finance | W | 4 credits | 3V + 2U | E. W. Farkas, M. Schweizer | |

Abstract | First introduction to main modelling ideas and mathematical tools from mathematical finance | |||||

Objective | This course gives a first introduction to the main modelling ideas and mathematical tools from mathematical finance. It mainly aims at non-mathematicians who need an introduction to the main tools from stochastics used in mathematical finance. However, mathematicians who want to learn some basic modelling ideas and concepts for quantitative finance (before continuing with a more advanced course) may also find this of interest.. The main emphasis will be on ideas, but important results will be given with (sometimes partial) proofs. | |||||

Content | Topics to be covered include - financial market models in finite discrete time - absence of arbitrage and martingale measures - valuation and hedging in complete markets - basics about Brownian motion - stochastic integration - stochastic calculus: Itô's formula, Girsanov transformation, Itô's representation theorem - Black-Scholes formula | |||||

Lecture notes | Lecture notes will be sold at the beginning of the course. | |||||

Literature | Lecture notes will be sold at the beginning of the course. Additional (background) references are given there. | |||||

Prerequisites / Notice | Prerequisites: Results and facts from probability theory as in the book "Probability Essentials" by J. Jacod and P. Protter will be used freely. Especially participants without a direct mathematics background are strongly advised to familiarise themselves with those tools before (or very quickly during) the course. (A possible alternative to the above English textbook are the (German) lecture notes for the standard course "Wahrscheinlichkeitstheorie".) For those who are not sure about their background, we suggest to look at the exercises in Chapters 8, 9, 22-25, 28 of the Jacod/Protter book. If these pose problems, you will have a hard time during the course. So be prepared. | |||||

401-4657-00L | Numerical Analysis of Stochastic Ordinary Differential Equations Alternative course title: "Computational Methods for Quantitative Finance: Monte Carlo and Sampling Methods" | W | 6 credits | 3V + 1U | A. Jentzen, L. Yaroslavtseva | |

Abstract | Course on numerical approximations of stochastic ordinary differential equations driven by Wiener processes. These equations have several applications, for example in financial option valuation. This course also contains an introduction to random number generation and Monte Carlo methods for random variables. | |||||

Objective | The aim of this course is to enable the students to carry out simulations and their mathematical convergence analysis for stochastic models originating from applications such as mathematical finance. For this the course teaches a decent knowledge of the different numerical methods, their underlying ideas, convergence properties and implementation issues. | |||||

Content | Generation of random numbers Monte Carlo methods for the numerical integration of random variables Stochastic processes and Brownian motion Stochastic ordinary differential equations (SODEs) Numerical approximations of SODEs Applications to computational finance: Option valuation | |||||

Lecture notes | Lecture notes are available as a PDF file: see Learning materials. | |||||

Literature | P. Glassermann: Monte Carlo Methods in Financial Engineering. Springer-Verlag, New York, 2004. P. E. Kloeden and E. Platen: Numerical Solution of Stochastic Differential Equations. Springer-Verlag, Berlin, 1992. | |||||

Prerequisites / Notice | Prerequisites: Mandatory: Probability and measure theory, basic numerical analysis and basics of MATLAB programming. a) mandatory courses: Elementary Probability, Probability Theory I. b) recommended courses: Stochastic Processes. Start of lectures: Wednesday, September 19, 2018. Date of the End-of-Semester examination: Wednesday, December 19, 2018, 13:00-15:00; students must arrive before 12:30 at ETH HG E 19. Room for the End-of-Semester examination: ETH HG E 19. Exam inspection: Tuesday, February 26, 2019, 12:00-13:00 at HG D 7.2. Please bring your legi. | |||||

401-8905-00L | Financial Engineering (University of Zurich)No enrolment to this course at ETH Zurich. Book the corresponding module directly at UZH. UZH Module Code: MFOEC200 Mind the enrolment deadlines at UZH: Link | W | 6 credits | 4G | University lecturers | |

Abstract | This lecture is intended for students who would like to learn more on equity derivatives modelling and pricing. | |||||

Objective | Quantitative models for European option pricing (including stochastic volatility and jump models), volatility and variance derivatives, American and exotic options. | |||||

Content | After introducing fundamental concepts of mathematical finance including no-arbitrage, portfolio replication and risk-neutral measure, we will present the main models that can be used for pricing and hedging European options e.g. Black- Scholes model, stochastic and jump-diffusion models, and highlight their assumptions and limitations. We will cover several types of derivatives such as European and American options, Barrier options and Variance- Swaps. Basic knowledge in probability theory and stochastic calculus is required. Besides attending class, we strongly encourage students to stay informed on financial matters, especially by reading daily financial newspapers such as the Financial Times or the Wall Street Journal. | |||||

Lecture notes | Script. | |||||

Prerequisites / Notice | Basic knowledge of probability theory and stochastic calculus. Asset Pricing. | |||||

401-5820-00L | Seminar in Computational Finance for CSE | W | 4 credits | 2S | J. Teichmann | |

Abstract | ||||||

Objective | ||||||

Content | We aim to comprehend recent and exciting research on the nature of stochastic volatility: an extensive econometric research [4] lead to new in- sights on stochastic volatility, in particular that very rough fractional pro- cesses of Hurst index about 0.1 actually provide very attractive models. Also from the point of view of pricing [1] and microfoundations [2] these models are very convincing. More precisely each student is expected to work on one specified task consisting of a theoretical part and an implementation with financial data, whose results should be presented in a 45 minutes presentation. | |||||

Literature | [1] C. Bayer, P. Friz, and J. Gatheral. Pricing under rough volatility. Quantitative Finance , 16(6):887-904, 2016. [2] F. M. Euch, Omar El and M. Rosenbaum. The microstructural founda- tions of leverage effect and rough volatility. arXiv:1609.05177 , 2016. [3] O. E. Euch and M. Rosenbaum. The characteristic function of rough Heston models. arXiv:1609.02108 , 2016. [4] J. Gatheral, T. Jaisson, and M. Rosenbaum. Volatility is rough. arXiv:1410.3394 , 2014. | |||||

Prerequisites / Notice | Requirements: sound understanding of stochastic concepts and of con- cepts of mathematical Finance, ability to implement econometric or simula- tion routines in MATLAB. |

- Page 2 of 5 All