Search result: Catalogue data in Autumn Semester 2021

Computational Science and Engineering Bachelor Information
Electives
In the ‘electives’ subcategory, at least two course units must be successfully completed.
NumberTitleTypeECTSHoursLecturers
151-0709-00LStochastic Methods for Engineers and Natural ScientistsW4 credits4GD. W. Meyer-Massetti
AbstractThe course provides an introduction into stochastic methods that are applicable for example for the description and modeling of turbulent and subsurface flows. Moreover, mathematical techniques are presented that are used to quantify uncertainty in various engineering applications.
ObjectiveBy the end of the course you should be able to mathematically describe random quantities and their effect on physical systems. Moreover, you should be able to develop basic stochastic models of such systems.
Content- Probability theory, single and multiple random variables, mappings of random variables
- Estimation of statistical moments and probability densities based on data
- Stochastic differential equations, Ito calculus, PDF evolution equations
- Monte Carlo integration with importance and stratified sampling
- Markov-chain Monte Carlo sampling
- Control-variate and multi-level Monte Carlo estimation
All topics are illustrated with engineering applications.
Lecture notesDetailed lecture notes will be provided.
LiteratureSome textbooks related to the material covered in the course:
Stochastic Methods: A Handbook for the Natural and Social Sciences, Crispin Gardiner, Springer, 2010
The Fokker-Planck Equation: Methods of Solutions and Applications, Hannes Risken, Springer, 1996
Turbulent Flows, S.B. Pope, Cambridge University Press, 2000
Spectral Methods for Uncertainty Quantification, O.P. Le Maitre and O.M. Knio, Springer, 2010
CompetenciesCompetencies
Subject-specific CompetenciesConcepts and Theoriesassessed
Techniques and Technologiesassessed
Method-specific CompetenciesAnalytical Competenciesassessed
Decision-makingassessed
Media and Digital Technologiesassessed
Problem-solvingassessed
Personal CompetenciesCreative Thinkingassessed
Critical Thinkingassessed
Integrity and Work Ethicsassessed
Self-direction and Self-management assessed
151-0317-00LVisualization, Simulation and Interaction - Virtual Reality IIW4 credits3GA. Kunz
AbstractThis lecture provides deeper knowledge on the possible applications of virtual reality, its basic technolgy, and future research fields. The goal is to provide a strong knowledge on Virtual Reality for a possible future use in business processes.
ObjectiveVirtual Reality can not only be used for the visualization of 3D objects, but also offers a wide application field for small and medium enterprises (SME). This could be for instance an enabling technolgy for net-based collaboration, the transmission of images and other data, the interaction of the human user with the digital environment, or the use of augmented reality systems.
The goal of the lecture is to provide a deeper knowledge of today's VR environments that are used in business processes. The technical background, the algorithms, and the applied methods are explained more in detail. Finally, future tasks of VR will be discussed and an outlook on ongoing international research is given.
ContentIntroduction into Virtual Reality; basisc of augmented reality; interaction with digital data, tangible user interfaces (TUI); basics of simulation; compression procedures of image-, audio-, and video signals; new materials for force feedback devices; intorduction into data security; cryptography; definition of free-form surfaces; digital factory; new research fields of virtual reality
Lecture notesThe handout is available in German and English.
Prerequisites / NoticePrerequisites:
"Visualization, Simulation and Interaction - Virtual Reality I" is recommended, but not mandatory.

Didactical concept:
The course consists of lectures and exercises.
CompetenciesCompetencies
Subject-specific CompetenciesConcepts and Theoriesassessed
Techniques and Technologiesassessed
Method-specific CompetenciesAnalytical Competenciesassessed
Media and Digital Technologiesassessed
Social CompetenciesCommunicationassessed
Cooperation and Teamworkassessed
Personal CompetenciesCreative Thinkingassessed
Critical Thinkingassessed
151-0833-00LApplied Finite Element AnalysisW4 credits2V + 2UB. Berisha, N. Manopulo
AbstractMost problems in engineering are of nonlinear nature. The nonlinearities are caused basically due to the nonlinear material behavior, contact conditions and instability of structures. The principles of the nonlinear Finite-Element-Method (FEM) will be introduced for treating such problems. The finite element program ABAQUS is introduced to investigate real engineering problems.
ObjectiveThe goal of the lecture is to provide the students with the fundamentals of the non linear Finite Element Method (FEM). The lecture focuses on the principles of the nonlinear Finite-Element-Method based on explicit and implicit formulations. Typical applications of the nonlinear Finite-Element-Methods are simulations of:

- Crash
- Collapse of structures
- Material behavior (metals and rubber)
- General forming processes

Special attention will be paid to the modeling of the nonlinear material behavior, thermo-mechanical processes and processes with large plastic deformations. The ability to independently create a virtual model which describes the complex non linear systems will be acquired through accompanying exercises. These will include the Matlab programming of important model components such as constitutive equations. The FEM Program ABAQUS will be introduced to investigate real engineering problems
Content- introduction into FEM
- Fundamentals of continuum mechanics to characterize large plastic deformations
- Elasto-plastic material models
- Lagrange and Euler approaches
- FEM implementation of constitutive equations
- Element formulations
- Implicit and explicit FEM methods
- FEM formulations of coupled thermo-mechanical problems
- Modeling of tool contact and the influence of friction
- Solvers and convergence
- Instability problems
Lecture notesLecture slides
LiteratureBathe, K. J., Finite-Element-Procedures, Prentice-Hall, 1996
151-0529-00LComputational Mechanics II: Nonlinear FEAW4 credits2V + 2UL. De Lorenzis
AbstractThe course provides an introduction to non-linear finite element analysis. The treated sources of non-linearity are related to material properties (hyperelasticity, plasticity), kinematics (large deformations, instability problems) and boundary conditions (contact).
ObjectiveTo be able to address all major sources of non-linearity in theory and numerics, and to apply this knowledge to the solution of relevant problems in solid mechanics.
Content1. Introduction: various sources of nonlinearities and implications for FEA.
2. Non-linear kinematics: large deformations, stability problems.
3. Non-linear material behavior: hyperelasticity, plasticity.
4. Non-linear boundary conditions: contact problems.
Lecture notesLecture notes will be provided. However, students are encouraged to take their own notes.
Prerequisites / NoticeMechanics 1, 2, Dynamics, Continuum Mechanics I and Introduction to FEA. Ideally also Continuum Mechanics II.
263-2800-00LDesign of Parallel and High-Performance Computing Information Restricted registration - show details
Number of participants limited to 125.
W9 credits3V + 2U + 3AT. Hoefler, M. Püschel
AbstractAdvanced topics in parallel and high-performance computing.
ObjectiveUnderstand concurrency paradigms and models from a higher perspective and acquire skills for designing, structuring and developing possibly large parallel high-performance software systems. Become able to distinguish parallelism in problem space and in machine space. Become familiar with important technical concepts and with concurrency folklore.
ContentWe will cover all aspects of high-performance computing ranging from architecture through programming up to algorithms. We will start with a discussion of caches and cache coherence in practical computer systems. We will dive into parallel programming concepts such as memory models, locks, and lock-free. We will cover performance modeling and parallel design principles as well as basic parallel algorithms.
Prerequisites / NoticeThis class is intended for the Computer Science Masters curriculum. Students must have basic knowledge in programming in C as well as computer science theory. Students should be familiar with the material covered in the ETH computer science first-year courses "Parallele Programmierung (parallel programming)" and "Algorithmen und Datenstrukturen (algorithm and data structures)" or equivalent courses.
227-0102-00LDiscrete Event Systems Information W6 credits4GR. Jacob, L. Vanbever, R. Wattenhofer
AbstractIntroduction to discrete event systems. We start out by studying popular models of discrete event systems. In the second part of the course we analyze discrete event systems from an average-case and from a worst-case perspective. Topics include: Automata and Languages, Specification Models, Stochastic Discrete Event Systems, Worst-Case Event Systems, Verification, Network Calculus.
ObjectiveOver the past few decades the rapid evolution of computing, communication, and information technologies has brought about the proliferation of new dynamic systems. A significant part of activity in these systems is governed by operational rules designed by humans. The dynamics of these systems are characterized by asynchronous occurrences of discrete events, some controlled (e.g. hitting a keyboard key, sending a message), some not (e.g. spontaneous failure, packet loss).

The mathematical arsenal centered around differential equations that has been employed in systems engineering to model and study processes governed by the laws of nature is often inadequate or inappropriate for discrete event systems. The challenge is to develop new modeling frameworks, analysis techniques, design tools, testing methods, and optimization processes for this new generation of systems.

In this lecture we give an introduction to discrete event systems. We start out the course by studying popular models of discrete event systems, such as automata and Petri nets. In the second part of the course we analyze discrete event systems. We first examine discrete event systems from an average-case perspective: we model discrete events as stochastic processes, and then apply Markov chains and queuing theory for an understanding of the typical behavior of a system. In the last part of the course we analyze discrete event systems from a worst-case perspective using the theory of online algorithms and adversarial queuing.
Content1. Introduction
2. Automata and Languages
3. Smarter Automata
4. Specification Models
5. Stochastic Discrete Event Systems
6. Worst-Case Event Systems
7. Network Calculus
Lecture notesAvailable
Literature[bertsekas] Data Networks
Dimitri Bersekas, Robert Gallager
Prentice Hall, 1991, ISBN: 0132009161

[borodin] Online Computation and Competitive Analysis
Allan Borodin, Ran El-Yaniv.
Cambridge University Press, 1998

[boudec] Network Calculus
J.-Y. Le Boudec, P. Thiran
Springer, 2001

[cassandras] Introduction to Discrete Event Systems
Christos Cassandras, Stéphane Lafortune.
Kluwer Academic Publishers, 1999, ISBN 0-7923-8609-4

[fiat] Online Algorithms: The State of the Art
A. Fiat and G. Woeginger

[hochbaum] Approximation Algorithms for NP-hard Problems (Chapter 13 by S. Irani, A. Karlin)
D. Hochbaum

[schickinger] Diskrete Strukturen (Band 2: Wahrscheinlichkeitstheorie und Statistik)
T. Schickinger, A. Steger
Springer, Berlin, 2001

[sipser] Introduction to the Theory of Computation
Michael Sipser.
PWS Publishing Company, 1996, ISBN 053494728X
227-0116-00LVLSI 1: HDL based design for FPGAs Information W6 credits5GF. K. Gürkaynak, L. Benini
AbstractThis first course in a series that extends over three consecutive terms is concerned with tailoring algorithms and with devising high performance hardware architectures for their implementation as ASIC or with FPGAs. The focus is on front end design using HDLs and automatic synthesis for producing industrial-quality circuits.
ObjectiveUnderstand Very-Large-Scale Integrated Circuits (VLSI chips), Application-Specific Integrated Circuits (ASIC), and Field-Programmable Gate-Arrays (FPGA). Know their organization and be able to identify suitable application areas. Become fluent in front-end design from architectural conception to gate-level netlists. How to model digital circuits with SystemVerilog. How to ensure they behave as expected with the aid of simulation, testbenches, and assertions. How to take advantage of automatic synthesis tools to produce industrial-quality VLSI and FPGA circuits. Gain practical experience with the hardware description language SystemVerilog and with industrial Electronic Design Automation (EDA) tools.
ContentThis course is concerned with system-level issues of VLSI design and FPGA implementations. Topics include:
- Overview on design methodologies and fabrication depths.
- Levels of abstraction for circuit modeling.
- Organization and configuration of commercial field-programmable components.
- FPGA design flows.
- Dedicated and general purpose architectures compared.
- How to obtain an architecture for a given processing algorithm.
- Meeting throughput, area, and power goals by way of architectural transformations.
- Hardware Description Languages (HDL) and the underlying concepts.
- SystemVerilog
- Register Transfer Level (RTL) synthesis and its limitations.
- Building blocks of digital VLSI circuits.
- Functional verification techniques and their limitations.
- Modular and largely reusable testbenches.
- Assertion-based verification.
- Synchronous versus asynchronous circuits.
- The case for synchronous circuits.
- Periodic events and the Anceau diagram.
- Case studies, ASICs compared to microprocessors, DSPs, and FPGAs.

During the exercises, students learn how to model FPGAs with SystemVerilog. They write testbenches for simulation purposes and synthesize gate-level netlists for FPGAs. Commercial EDA software by leading vendors is being used throughout.
Lecture notesTextbook and all further documents in English.
LiteratureH. Kaeslin: "Top-Down Digital VLSI Design, from Architectures to Gate-Level Circuits and FPGAs", Elsevier, 2014, ISBN 9780128007303.
Prerequisites / NoticePrerequisites:
Basics of digital circuits.

Examination:
In written form following the course semester (spring term). Problems are given in English, answers will be accepted in either English oder German.

Further details:
Link
227-0147-10LVLSI 3: Full-Custom Digital Circuit Design Restricted registration - show details W6 credits2V + 3UC. Studer, O. Castañeda Fernández
AbstractThis third course in our VLSI series is concerned with full-custom digital integrated circuits. The goals are to learn how to design digital circuits on the schematic, layout, gate, and register-transfer levels. The use of state-of-the-art CAD software (Cadence Virtuoso) in order to simulate, optimize, and characterize digital circuits is another important topic of this course.
ObjectiveAt the end of this course you will
- understand how the main building blocks of state-of-the-art digital integrated circuits are designed
- be able to design and optimize digital integrated circuits on the schematic, layout, and gate levels
- be able to use standard industry software (Cadence Virtuoso) for drawing, simulating, and characterizing digital circuits
- understand the performance trade-offs between speed, area, and power consumption
ContentThe third VLSI course begins with the basics of metal-oxide-semiconductor (MOS) field-effect transistors (FETs) and moves up the stack towards logic gates and increasingly complex digital circuit structures. The topics of this course include:
• Nanometer MOSFETs
• Static and dynamic behavior of complementary MOS (CMOS) inverters
• CMOS gate design, sizing, and timing
• Full-custom standard-cell design
• Wire models and parasitics
• Latch and flip-flop circuits
• Gate-level timing analysis and optimization
• Static and dynamic power consumption; low-power techniques
• Alternative logic styles (dynamic logic, pass-transistor logic, etc.)
• Arithmetic and logic circuits
• Fixed-point and floating-point arithmetic
• Memory circuits (ROM, SRAM, and DRAM)
• In- and near-memory processing architectures
• Full-custom accelerator circuits for machine learning
The exercises are concerned with schematic entry, layout, and simulation of digital integrated circuits using a disciplined standard-cell-based approach with Cadence Virtuoso.
LiteratureN. H. E. Weste and D. M Harris, CMOS VLSI Design: A Circuits and Systems Perspective (4th Ed.), Addison-Wesley
Prerequisites / NoticeVLSI3 can be taken in parallel with “VLSI1: HDL based design for FPGAs” and is designed to complement the topics of this course. Basic analog circuit knowledge is required.
227-0148-00LVLSI III: Test and Fabrication of VLSI Circuits Information
Does not take place this semester.
W6 credits4GL. Benini
AbstractIn this course, we will cover how modern microchips are fabricated, and we will focus on methods and tools to uncover fabrication defects, if any, in these microchips. As part of the exercises, students will get to work on an industrial 1 million dollar automated test equipment.
ObjectiveLearn about modern IC manufacturing methodologies, understand the problem of IC testing. Cover the basic methods, algorithms and techniques to test circuits in an efficient way. Learn about practical aspects of IC testing and apply what you learn in class using a state-of-the art tester.
ContentIn this course we will deal with modern integrated circuit (IC) manufacturing technology and cover topics such as:
- Today's nanometer CMOS fabrication processes (HKMG).
- Optical and post optical Photolithography.
- Potential alternatives to CMOS technology and MOSFET devices.
- Evolution paths for design methodology.
- Industrial roadmaps for the future evolution of semiconductor technology (ITRS).

If you want to earn money by selling ICs, you will have to deliver a product that will function properly with a very large probability. The main emphasis of the lecture will be discussing how this can be achieved. We will discuss fault models and practical techniques to improve testability of VLSI circuits. At the IIS we have a state-of-the-art automated test equipment (Advantest SoC V93000) that we will make available for in class exercises and projects. At the end of the lecture you will be able to design state-of-the art digital integrated circuits such as to make them testable and to use automatic test equipment (ATE) to carry out the actual testing.

During the first weeks of the course there will be weekly practical exercises where you will work in groups of two. For the last 5 weeks of the class students will be able to choose a class project that can be:
- The test of their own chip developed during a previous semester thesis
- Developing new setups and measurement methods in C++ on the tester
- Helping to debug problems encountered in previous microchips by IIS.

Half of the oral exam will consist of a short presentation on this class project.
Lecture notesMain course book: "Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits" by Michael L. Bushnell and Vishwani D. Agrawal, Springer, 2004. This book is available online within ETH through
Link
Prerequisites / NoticeAlthough this is the third part in a series of lectures on VLSI design, you can follow this course even if you have not visited VLSI I and VLSI II lectures. An interest in integrated circuit design, and basic digital circuit knowledge is required though.

Course website:
Link
227-0417-00LInformation Theory IW6 credits4GA. Lapidoth
AbstractThis course covers the basic concepts of information theory and of communication theory. Topics covered include the entropy rate of a source, mutual information, typical sequences, the asymptotic equi-partition property, Huffman coding, channel capacity, the channel coding theorem, the source-channel separation theorem, and feedback capacity.
ObjectiveThe fundamentals of Information Theory including Shannon's source coding and channel coding theorems
ContentThe entropy rate of a source, Typical sequences, the asymptotic equi-partition property, the source coding theorem, Huffman coding, Arithmetic coding, channel capacity, the channel coding theorem, the source-channel separation theorem, feedback capacity
LiteratureT.M. Cover and J. Thomas, Elements of Information Theory (second edition)
227-0427-00LSignal Analysis, Models, and Machine Learning
Does not take place this semester.
This course was replaced by "Introduction to Estimation and Machine Learning" and "Advanced Signal Analysis, Modeling, and Machine Learning".
W6 credits4GH.‑A. Loeliger
AbstractMathematical methods in signal processing and machine learning.
I. Linear signal representation and approximation: Hilbert spaces, LMMSE estimation, regularization and sparsity.
II. Learning linear and nonlinear functions and filters: neural networks, kernel methods.
III. Structured statistical models: hidden Markov models, factor graphs, Kalman filter, Gaussian models with sparse events.
ObjectiveThe course is an introduction to some basic topics in signal processing and machine learning.
ContentPart I - Linear Signal Representation and Approximation: Hilbert spaces, least squares and LMMSE estimation, projection and estimation by linear filtering, learning linear functions and filters, L2 regularization, L1 regularization and sparsity, singular-value decomposition and pseudo-inverse, principal-components analysis.
Part II - Learning Nonlinear Functions: fundamentals of learning, neural networks, kernel methods.
Part III - Structured Statistical Models and Message Passing Algorithms: hidden Markov models, factor graphs, Gaussian message passing, Kalman filter and recursive least squares, Monte Carlo methods, parameter estimation, expectation maximization, linear Gaussian models with sparse events.
Lecture notesLecture notes.
Prerequisites / NoticePrerequisites:
- local bachelors: course "Discrete-Time and Statistical Signal Processing" (5. Sem.)
- others: solid basics in linear algebra and probability theory
227-0971-00LComputational Psychiatry
Please note that participation in this course and the practical sessions requires additional registration at: Link
W3 credits4SK. Stephan
AbstractThis six-day course teaches state-of-the-art methods in computational psychiatry. It covers various computational models of cognition (e.g., learning and decision-making) and brain physiology (e.g., effective connectivity) of relevance for psychiatric disorders. The course not only provides theoretical background, but also demonstrates open source software in application to concrete examples.
ObjectiveThis course aims at bridging the gap between mathematical modelers and clinical neuroscientists by teaching computational techniques in the context of clinical applications. The hope is that the acquisition of a joint language and tool-kit will enable more effective communication and joint translational research between fields that are usually worlds apart.
ContentThis six-day course teaches state-of-the-art methods in computational psychiatry. It covers various computational models of cognition (e.g., learning and decision-making) and brain physiology (e.g., effective connectivity) of relevance for psychiatric disorders. The course not only provides theoretical background, but also demonstrates open source software in application to concrete examples. Furthermore, practical exercises provide in-depth exposure to different software packages. Please see Link for details.
252-0417-00LRandomized Algorithms and Probabilistic Methods Information W10 credits3V + 2U + 4AA. Steger
AbstractLas Vegas & Monte Carlo algorithms; inequalities of Markov, Chebyshev, Chernoff; negative correlation; Markov chains: convergence, rapidly mixing; generating functions; Examples include: min cut, median, balls and bins, routing in hypercubes, 3SAT, card shuffling, random walks
ObjectiveAfter this course students will know fundamental techniques from probabilistic combinatorics for designing randomized algorithms and will be able to apply them to solve typical problems in these areas.
ContentRandomized Algorithms are algorithms that "flip coins" to take certain decisions. This concept extends the classical model of deterministic algorithms and has become very popular and useful within the last twenty years. In many cases, randomized algorithms are faster, simpler or just more elegant than deterministic ones. In the course, we will discuss basic principles and techniques and derive from them a number of randomized methods for problems in different areas.
Lecture notesYes.
Literature- Randomized Algorithms, Rajeev Motwani and Prabhakar Raghavan, Cambridge University Press (1995)
- Probability and Computing, Michael Mitzenmacher and Eli Upfal, Cambridge University Press (2005)
252-0206-00LVisual Computing Information W8 credits4V + 3US. Coros, M. Pollefeys
AbstractThis course acquaints students with core knowledge in computer graphics, image processing, multimedia and computer vision. Topics include: Graphics pipeline, perception and camera models, transformation, shading, global illumination, texturing, sampling, filtering, image representations, image and video compression, edge detection and optical flow.
ObjectiveThis course provides an in-depth introduction to the core concepts of computer graphics, image processing, multimedia and computer vision. The course forms a basis for the specialization track Visual Computing of the CS master program at ETH.
ContentCourse topics will include: Graphics pipeline, perception and color models, camera models, transformations and projection, projections, lighting, shading, global illumination, texturing, sampling theorem, Fourier transforms, image representations, convolution, linear filtering, diffusion, nonlinear filtering, edge detection, optical flow, image and video compression.

In theoretical and practical homework assignments students will learn to apply and implement the presented concepts and algorithms.
Lecture notesA scriptum will be handed out for a part of the course. Copies of the slides will be available for download. We will also provide a detailed list of references and textbooks.
LiteratureMarkus Gross: Computer Graphics, scriptum, 1994-2005
252-0543-01LComputer Graphics Information
Does not take place this semester.
W8 credits3V + 2U + 2A
AbstractThis course covers some of the fundamental concepts of computer graphics generation of photorealistic images from digital representations of 3D scenes and image-based methods for recovering digital scene representations from captured images.
ObjectiveAt the end of the course the students will be able to build a rendering system. The students will study the basic principles of rendering and image synthesis. In addition, the course is intended to stimulate the students' curiosity to explore the field of computer graphics in subsequent courses or on their own.
ContentThis course covers fundamental concepts of modern computer graphics. Students will learn about 3D object representations and the details of how to generate photorealistic images from digital representations of 3D scenes. Starting with an introduction to 3D shape modeling, geometry representation and texture mapping, we will move on to the physics of light transport, acceleration structures, appearance modeling and Monte Carlo integration. We will apply these principles for computing light transport of direct and global illumination due to surfaces and participating media. We will end with an overview of modern image-based capture and image synthesis methods, covering topics such as geometry and material capture, light-fields and depth-image based rendering.
Lecture notesno
LiteratureBooks:
High Dynamic Range Imaging: Acquisition, Display, and Image-Based Lighting
Multiple view geometry in computer vision
Physically Based Rendering: From Theory to Implementation
Prerequisites / NoticePrerequisites:
Fundamentals of calculus and linear algebra, basic concepts of algorithms and data structures, programming skills in C++, Visual Computing course recommended.
The programming assignments will be in C++. This will not be taught in the class.
252-0546-00LPhysically-Based Simulation in Computer Graphics Information W5 credits2V + 1U + 1AV. da Costa de Azevedo, B. Solenthaler, B. Thomaszewski
AbstractThis lecture provides an introduction to physically-based animation in computer graphics and gives an overview of fundamental methods and algorithms. The practical exercises include three assignments which are to be solved in small groups. In an addtional course project, topics from the lecture will be implemented into a 3D game or a comparable application.
ObjectiveThis lecture provides an introduction to physically-based animation in computer graphics and gives an overview of fundamental methods and algorithms. The practical exercises include three assignments which are to be solved in small groups. In an addtional course project, topics from the lecture will be implemented into a 3D game or a comparable application.
ContentThe lecture covers topics in physically-based modeling,
such as particle systems, mass-spring models, finite difference and finite element methods. These approaches are used to represent and simulate deformable objects or fluids with applications in animated movies, 3D games and medical systems. Furthermore, the lecture covers topics such as rigid body dynamics, collision detection, and character animation.
Prerequisites / NoticeFundamentals of calculus and physics, basic concepts of algorithms and data structures, basic programming skills in C++. Knowledge on numerical mathematics as well as ordinary and partial differential equations is an asset, but not required.
252-0834-00LInformation Systems for Engineers Information W4 credits2V + 1UG. Fourny
AbstractThis course provides the basics of relational databases from the perspective of the user.

We will discover why tables are so incredibly powerful to express relations, learn the SQL query language, and how to make the most of it. The course also covers support for data cubes (analytics).
ObjectiveThis lesson is complementary with Big Data for Engineers as they cover different time periods of database history and practices -- you can take them in any order, even though it might be more enjoyable to take this lecture first.

After visiting this course, you will be capable to:

1. Explain, in the big picture, how a relational database works and what it can do in your own words.

2. Explain the relational data model (tables, rows, attributes, primary keys, foreign keys), formally and informally, including the relational algebra operators (select, project, rename, all kinds of joins, division, cartesian product, union, intersection, etc).

3. Perform non-trivial reading SQL queries on existing relational databases, as well as insert new data, update and delete existing data.

4. Design new schemas to store data in accordance to the real world's constraints, such as relationship cardinality

5. Explain what bad design is and why it matters.

6. Adapt and improve an existing schema to make it more robust against anomalies, thanks to a very good theoretical knowledge of what is called "normal forms".

7. Understand how indices work (hash indices, B-trees), how they are implemented, and how to use them to make queries faster.

8. Access an existing relational database from a host language such as Java, using bridges such as JDBC.

9. Explain what data independence is all about and didn't age a bit since the 1970s.

10. Explain, in the big picture, how a relational database is physically implemented.

11. Know and deal with the natural syntax for relational data, CSV.

12. Explain the data cube model including slicing and dicing.

13. Store data cubes in a relational database.

14. Map cube queries to SQL.

15. Slice and dice cubes in a UI.

And of course, you will think that tables are the most wonderful object in the world.
ContentUsing a relational database
=================
1. Introduction
2. The relational model
3. Data definition with SQL
4. The relational algebra
5. Queries with SQL

Taking a relational database to the next level
=================
6. Database design theory
7. Databases and host languages
8. Databases and host languages
9. Indices and optimization
10. Database architecture and storage

Analytics on top of a relational database
=================
12. Data cubes

Outlook
=================
13. Outlook
Literature- Lecture material (slides).

- Book: "Database Systems: The Complete Book", H. Garcia-Molina, J.D. Ullman, J. Widom
(It is not required to buy the book, as the library has it)
Prerequisites / NoticeFor non-CS/DS students only, BSc and MSc
Elementary knowledge of set theory and logics
Knowledge as well as basic experience with a programming language such as Pascal, C, C++, Java, Haskell, Python
401-3627-00LHigh-Dimensional StatisticsW4 credits2VP. L. Bühlmann
Abstract"High-Dimensional Statistics" deals with modern methods and theory for statistical inference when the number of unknown parameters is of much larger order than sample size. Statistical estimation and algorithms for complex models and aspects of multiple testing will be discussed.
ObjectiveKnowledge of methods and basic theory for high-dimensional statistical inference
ContentLasso and Group Lasso for high-dimensional linear and generalized linear models; Additive models and many smooth univariate functions; Non-convex loss functions and l1-regularization; Stability selection, multiple testing and construction of p-values; Undirected graphical modeling
LiteraturePeter Bühlmann and Sara van de Geer (2011). Statistics for High-Dimensional Data: Methods, Theory and Applications. Springer Verlag.
ISBN 978-3-642-20191-2.
Prerequisites / NoticeKnowledge of basic concepts in probability theory, and intermediate knowledge of statistics (e.g. a course in linear models or computational statistics).
401-4623-00LTime Series Analysis
Does not take place this semester.
W6 credits3GF. Balabdaoui
AbstractThe course offers an introduction into analyzing times series, that is observations which occur in time. The material will cover Stationary Models, ARMA processes, Spectral Analysis, Forecasting, Nonstationary Models, ARIMA Models and an introduction to GARCH models.
ObjectiveThe goal of the course is to have a a good overview of the different types of time series and the approaches used in their statistical analysis.
ContentThis course treats modeling and analysis of time series, that is random variables which change in time. As opposed to the i.i.d. framework, the main feature exibited by time series is the dependence between successive observations.

The key topics which will be covered as:

Stationarity
Autocorrelation
Trend estimation
Elimination of seasonality
Spectral analysis, spectral densities
Forecasting
ARMA, ARIMA, Introduction into GARCH models
LiteratureThe main reference for this course is the book "Introduction to Time Series and Forecasting", by P. J. Brockwell and R. A. Davis
Prerequisites / NoticeBasic knowledge in probability and statistics
401-3901-00LLinear & Combinatorial Optimization Information W11 credits4V + 2UR. Zenklusen
AbstractMathematical treatment of optimization techniques for linear and combinatorial optimization problems.
ObjectiveThe goal of this course is to get a thorough understanding of various classical mathematical optimization techniques for linear and combinatorial optimization problems, with an emphasis on polyhedral approaches. In particular, we want students to develop a good understanding of some important problem classes in the field, of structural mathematical results linked to these problems, and of solution approaches based on such structural insights.
ContentKey topics include:
- Linear programming and polyhedra;
- Flows and cuts;
- Combinatorial optimization problems and polyhedral techniques;
- Equivalence between optimization and separation.
Literature- Bernhard Korte, Jens Vygen: Combinatorial Optimization. 6th edition, Springer, 2018.
- Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003. This work has 3 volumes.
- Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
- Alexander Schrijver: Theory of Linear and Integer Programming. John Wiley, 1986.
Prerequisites / NoticeSolid background in linear algebra.

Former course title: Mathematical Optimization.
CompetenciesCompetencies
Subject-specific CompetenciesConcepts and Theoriesassessed
Techniques and Technologiesfostered
Method-specific CompetenciesAnalytical Competenciesassessed
Decision-makingassessed
Media and Digital Technologiesfostered
Problem-solvingassessed
Project Managementfostered
Social CompetenciesCommunicationassessed
Cooperation and Teamworkfostered
Customer Orientationfostered
Leadership and Responsibilityfostered
Self-presentation and Social Influence fostered
Sensitivity to Diversityfostered
Negotiationfostered
Personal CompetenciesAdaptability and Flexibilityfostered
Creative Thinkingassessed
Critical Thinkingfostered
Integrity and Work Ethicsfostered
Self-awareness and Self-reflection fostered
Self-direction and Self-management fostered
402-2203-01LClassical Mechanics Information W7 credits4V + 2UR. Renner
AbstractA conceptual introduction to theoretical physics: Newtonian mechanics, central force problem, oscillations, Lagrangian mechanics, symmetries and conservation laws, spinning top, relativistic space-time structure, particles in an electromagnetic field, Hamiltonian mechanics, canonical transformations, integrable systems, Hamilton-Jacobi equation.
ObjectiveFundamental understanding of the description of Mechanics in the Lagrangian and Hamiltonian formulation. Detailed understanding of important applications, in particular, the Kepler problem, the physics of rigid bodies (spinning top) and of oscillatory systems.
227-1033-00LNeuromorphic Engineering I Restricted registration - show details
Registration in this class requires the permission of the instructors. Class size will be limited to available lab spots.
Preference is given to students that require this class as part of their major.

Information for UZH students:
Enrolment to this course unit only possible at ETH. No enrolment to module INI404 at UZH.
Please mind the ETH enrolment deadlines for UZH students: Link
W6 credits2V + 3UT. Delbrück, G. Indiveri, S.‑C. Liu
AbstractThis course covers analog circuits with emphasis on neuromorphic engineering: MOS transistors in CMOS technology, static circuits, dynamic circuits, systems (silicon neuron, silicon retina, silicon cochlea) with an introduction to multi-chip systems. The lectures are accompanied by weekly laboratory sessions.
ObjectiveUnderstanding of the characteristics of neuromorphic circuit elements.
ContentNeuromorphic circuits are inspired by the organizing principles of biological neural circuits. Their computational primitives are based on physics of semiconductor devices. Neuromorphic architectures often rely on collective computation in parallel networks. Adaptation, learning and memory are implemented locally within the individual computational elements. Transistors are often operated in weak inversion (below threshold), where they exhibit exponential I-V characteristics and low currents. These properties lead to the feasibility of high-density, low-power implementations of functions that are computationally intensive in other paradigms. Application domains of neuromorphic circuits include silicon retinas and cochleas for machine vision and audition, real-time emulations of networks of biological neurons, and the development of autonomous robotic systems. This course covers devices in CMOS technology (MOS transistor below and above threshold, floating-gate MOS transistor, phototransducers), static circuits (differential pair, current mirror, transconductance amplifiers, etc.), dynamic circuits (linear and nonlinear filters, adaptive circuits), systems (silicon neuron, silicon retina and cochlea) and an introduction to multi-chip systems that communicate events analogous to spikes. The lectures are accompanied by weekly laboratory sessions on the characterization of neuromorphic circuits, from elementary devices to systems.
LiteratureS.-C. Liu et al.: Analog VLSI Circuits and Principles; various publications.
Prerequisites / NoticeParticular: The course is highly recommended for those who intend to take the spring semester course 'Neuromorphic Engineering II', that teaches the conception, simulation, and physical layout of such circuits with chip design tools.

Prerequisites: Background in basics of semiconductor physics helpful, but not required.
327-1201-00LTransport Phenomena I Information W5 credits4GJ. Vermant
AbstractPhenomenological approach to "Transport Phenomena" based on balance equations supplemented by thermodynamic considerations to formulate the undetermined fluxes in the local species mass, momentum, and energy balance equations; Solutions of a few selected problems relevant to materials science and engineering both analytical and using numerical methods.
ObjectiveThe teaching goals of this course are on five different levels:
(1) Deep understanding of fundamentals: local balance equations, constitutive equations for fluxes, entropy balance, interfaces, idea of dimensionless numbers and scaling, ...
(2) Ability to use the fundamental concepts in applications
(3) Insight into the role of boundary conditions (mainly part 2)
(4) Knowledge of a number of applications.
(5) Flavor of numerical techniques: finite elements and finite differences.
ContentPart 1 Approach to Transport Phenomena
Equilibrium Thermodynamics
Balance Equations
Forces and Fluxes
Applications
1. Measuring Transport Coefficients
2. Fluid mechanics
3. combined heat and flow
Lecture notesThe course is based on the book D. C. Venerus and H. C. Öttinger, A Modern Course in Transport Phenomena (Cambridge University Press, 2018) and the book by W. M. Deen, Analysis of Transport Phenomena (Oxford University Press, 1998)
Literature1. D. C. Venerus and H. C. Öttinger, A Modern Course in Transport Phenomena (Cambridge University Press, 2018)
2. R. B. Bird, W. E. Stewart, and E. N. Lightfoot, Transport Phenomena, 2nd Ed. (Wiley, 2001)
3. L.G. Leal, Advanced Transport Phenomena (Oxford University Press, 2011)
4. W. M. Deen, Analysis of Transport Phenomena (Oxford University Press, 1998)
5. R. B. Bird, Five Decades of Transport Phenomena (Review Article), AIChE J. 50 (2004) 273-287
Prerequisites / NoticeComplex numbers. Vector analysis (integrability; Gauss' divergence theorem). Laplace and Fourier transforms. Ordinary differential equations (basic ideas). Linear algebra (matrices; functions of matrices; eigenvectors and eigenvalues; eigenfunctions). Probability theory (Gaussian distributions; Poisson distributions; averages; moments; variances; random variables). Numerical mathematics (integration). Equilibrium thermodynamics (Gibbs' fundamental equation; thermodynamic potentials; Legendre transforms). Maxwell equations. Programming and simulation techniques (Matlab, Monte Carlo simulations).
CompetenciesCompetencies
Subject-specific CompetenciesConcepts and Theoriesassessed
Techniques and Technologiesassessed
Method-specific CompetenciesProblem-solvingassessed
» see also Fields of Specialization
» Electives (CSE Master)