Contents

• foundations of computability:
  • universal register machines
  • syntax and operational semantics of imperative programming languages
• formal methods for the specification and verification of imperative programs:
  • assertions,
  • Hoare-calculus, partial correctness, termination
• imperative and object-oriented programming concepts (Java):
  • primitive and composite data types,
  • methords (procedures and functions). calling conventions, overloading
  • modules, classes, objects
  • class hierarchies, inheritance, polymorphism
  • abstract classes, interfaces
• programming methods:
  • stepwise refinement
  • divide and conquer
  • backtracking
• analysis of time and space requirements:
  • O-notation
  • recursion and iteration
  • analysis of algorithms for sorting and searching
  • algorithms, data structures, data abstraction

• Concepts of Programming Languages, Robert Sebesta, Pearson Education , 10th Edition, 2012, ISBN: 0131395319
• Data Structures & Problem Solving Using Java, Mark Allen Weiss, Addison Wesley, 4. Auflage, 2010, ISBN: 0-321-54140-5
• Cormen, Leiserson, Rivest: Introduction to Algorithms, 3. Auflage 2009,
• Bundle of algorithms in java, third edition, parts 1-5. Sedgewick Robert und Michael Schidlowsky. Addison-Wesley Longman, Amsterdam. 2003.

Prerequisites

background as taught in the class "Functional Programming".

Please also sign up for the class in our KVV.

The first lecture will take place Monday, 20th of April 2020 at 2pm ct. Please note that all exercises start in week 2 as well!

Contents:

The students will learn to understand the basic concepts of non-sequential and distributed programming with shared memory and message exchange. They can then structure distributed programs with processes/threads/active objects in a suitable way and avoid undesired non-deterministic effects and jamming through suitable synchronization procedures. You will know and understand the security risks that can arise in non-sequential programs and can use methods to avoid them. The students will be shown how they can formally specify properties of processes and threads and verify them exemplarily.

Students will be able to distinguish relevant interaction paradigms such as client/server and peer-to-peer, to classify their own applications according to these paradigms and to construct distributed systems on the basis of interprocess communication and remote calls. You will learn design, structure and implement web applications, customer/service provider applications, peer-to-peer applications and develop distributed systems using suitable middleware.

https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/summer-term-2020/alp-IV.html

The first lecture will take place Monday, 20th of April 2020 at 2pm ct. Please note that all exercises start in week 2 as well!

Contents:

The students will learn to understand the basic concepts of non-sequential and distributed programming with shared memory and message exchange. They can then structure distributed programs with processes/threads/active objects in a suitable way and avoid undesired non-deterministic effects and jamming through suitable synchronization procedures. You will know and understand the security risks that can arise in non-sequential programs and can use methods to avoid them. The students will be shown how they can formally specify properties of processes and threads and verify them exemplarily.

Students will be able to distinguish relevant interaction paradigms such as client/server and peer-to-peer, to classify their own applications according to these paradigms and to construct distributed systems on the basis of interprocess communication and remote calls. You will learn design, structure and implement web applications, customer/service provider applications, peer-to-peer applications and develop distributed systems using suitable middleware.

https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/summer-term-2020/alp-IV.html

The module operating and communication systems closes the gap between the hardware of a computer and the applications.

We will cover the following topics::

• I/O systems
• DMA/PIO
• Interrupt handling
• Buffers
• Processes/threads
• Virtual memory
• UNIX and Windows
• Shells
• Utilities
• Peripherals and networking
• Networks
• Media
• Media access
• Protocols
• Reference models
• TCP/IP
• The Internet

• Andrew S. Tanenbaum: Computerarchitektur, 5.Auflage, Pearson Studium, 2006
• English: Andrew S. Tanenbaum (with contributions from James R. Goodman):
• Structured Computer Organization, 4th Ed., Prentice Hall International, 2005.

Begleitveranstaltung zur Vorlesung 19300701

The module “Grundlagen der Technischen Informatik” build the basis of understanding the operation mode of real computer systems. Starting with the logic, this module will focus on combinatorial circuits and sequential circuits, logic minimization, gates, flip-flops, memory, automatic and simple hardware design. Furthermore, basic knowledge in the areas of direct and alternating current networks, semiconductors, transistors, CMOS, operational amplifiers, A/D and D/A converters are taught, as far as they are necessary for the computer science.  The corresponding “Praktikum”amplifys with numerous practical tests the content learned in the lecture and the module "Rechnerarchitektur, Betriebs- und Kommunikationssysteme". Based on a simple hardware platform with a processor and several interfaces to, the participants learn to program basic driver to enhance operating system routines and to drive the interfaces. Subsequently, the systems should be networked and be able to interact with their environment.

Siehe Unterlagen auf der Webseite - nur aus dem FB-Netz oder über VPN Webseite
Seminar am PC Dienstag, 12-16 Uhr Takustraße 9, Raum K63
 

The module Mobile Communications covers many topics of mobile and wireless communication systems - an area of Computer Science that shows tremendous growth rates and that influences more and more areas of our society.

We put special emphasis on a system perspective throughout the whole module and give many references to real systems, international standards and up-to-date research results.

Topics coverd are:

• Basics of wireless transmission: frequencies, signals, antennas, signal propagation, multiplexing, modulation, spread spectrum, cellular systems;
• Media access: SDMA, FDMA, TDMA, CDMA;
• Wireless telecommunication systems: GSM, TETRA, UMTS, IMT-2000, LTE;
• Wireless local area networks: infrastructure/ad-hoc, IEEE 802.11/15, Bluetooth;
• Mobile networking: Mobile IP, ad-hoc networks;
• Mobile transport layer: traditional TCP, adapted TCP versions, additional mechanisms;
• Mobility support;
• Outlook: 5th generation mobile networks

Jochen Schiller, Mobilkommunikation, Addison-Wesley, 2.Auflage 2003

Alle Unterlagen verfügbar unter http://www.mi.fu-berlin.de/inf/groups/ag-tech/teaching/resources/Mobile_Communications/course_Material/index.html

Cluster computer are the prevailing type of high performance computers. They are built of custom off-the-shelf processor boards that are connected by a high speed interconnection network. Although usually locally integrated, they are conceptually distributed systems with local operating system images. Their enormous potential, however, can only be exploited, if program code and data are optimally distributed across the nodes. Cluster management mechanisms also need to be scalable to be employed in systems with thousands of nodes. The lecture course gives an overview of the architecture of cluster computers and the related management problems for which algorithmic solutions are presented. It runs in parallel to the integrated course Parallel Programming. Both complement each other and form the module Parallel Systems.

• Heiss, H.-U.: Prozessorzuteilung in Parallelrechnern, BI-Verlag, Mannheim, 1996
• Andrews, G. A.: Foundations of Multithreaded, Parallel and Distributed Programming, Addison-Wesley, 2000
• Pfister, G.: In Search of Clusters 2nd ed., Prentice Hall, 1998
• Zomaya, A.: Parallel and distributed computing handbook, McGraw Gill, 1995
• Buyya, R.: High Performance Cluster Computing, Vol. 1+2, Prentice Hall, 1999

Target group

• Computer Science Master students

Requirements

• Experience with computers and software as well as programing skills.

Language

• The course language is German (or English if requested).
• The exam will be formulated in German, but answers may be given in English, too.

Credits & Exams

The criteria for gaining credits are

• active participation in the tutorials: regular preparation of assignements & presentation of results in the tutorials
• passing of the exam

Website

https://www.mi.fu-berlin.de/w/SE/VorlesungClusterComputing

• Bull, D. R., “Communicating Pictures: A Course in Image and Video Coding,” Elsevier, 2014.
• Ohm, J.-R., “Multimedia Signal Coding and Transmission,” Springer, 2015.
• Wien, M., “High Efficiency Video Coding — Coding Tools and Specifications,” Springer 2014.
• Sze, V., Budagavi, M., and Sullivan, G. J. (eds.), “High Efficiency Video Coding (HEVC): Algorithm and Architectures,” Springer, 2014.
• Schwarz, H. and Wiegand, T., “Video Coding: Part II of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, Now Publishers, vol. 10, no. 1–3, 2016.

Cluster computer are the prevailing type of high performance computers. They are built of custom off-the-shelf processor boards that are connected by a high speed interconnection network. Although usually locally integrated, they are conceptually distributed systems with local operating system images. Their enormous potential, however, can only be exploited, if program code and data are optimally distributed across the nodes. Cluster management mechanisms also need to be scalable to be employed in systems with thousands of nodes. The lecture course gives an overview of the architecture of cluster computers and the related management problems for which algorithmic solutions are presented. It runs in parallel to the integrated course Parallel Programming. Both complement each other and form the module Parallel Systems.

• Heiss, H.-U.: Prozessorzuteilung in Parallelrechnern, BI-Verlag, Mannheim, 1996
• Andrews, G. A.: Foundations of Multithreaded, Parallel and Distributed Programming, Addison-Wesley, 2000
• Pfister, G.: In Search of Clusters 2nd ed., Prentice Hall, 1998
• Zomaya, A.: Parallel and distributed computing handbook, McGraw Gill, 1995
• Buyya, R.: High Performance Cluster Computing, Vol. 1+2, Prentice Hall, 1999

Target group

• Computer Science Master students

Requirements

• Experience with computers and software as well as programing skills.

Language

• The course language is German (or English if requested).
• The exam will be formulated in German, but answers may be given in English, too.

Credits & Exams

The criteria for gaining credits are

• active participation in the tutorials: regular preparation of assignements & presentation of results in the tutorials
• passing of the exam

Website

https://www.mi.fu-berlin.de/w/SE/VorlesungClusterComputing

• Bull, D. R., “Communicating Pictures: A Course in Image and Video Coding,” Elsevier, 2014.
• Ohm, J.-R., “Multimedia Signal Coding and Transmission,” Springer, 2015.
• Wien, M., “High Efficiency Video Coding — Coding Tools and Specifications,” Springer 2014.
• Sze, V., Budagavi, M., and Sullivan, G. J. (eds.), “High Efficiency Video Coding (HEVC): Algorithm and Architectures,” Springer, 2014.
• Schwarz, H. and Wiegand, T., “Video Coding: Part II of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, Now Publishers, vol. 10, no. 1–3, 2016.

Contents:

• models of computation
  • automata
  • formal languates
  • grammars and the Chomsky-hierarchy
  • Turing-machines
  • computabilty
• introduction to the complexity of computational problems

• Uwe Schöning, Theoretische Informatik kurzgefasst, 5. Auflage, Spektrum Akademischer Verlag, 2008
• John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, Einführung in die Automatentheorie, Formale Sprachen und Komplexität, Pearson Studium, 3. Auflage, 2011
• Ingo Wegener: Theoretische Informatik - Eine algorithmenorientierte Einführung, 2. Auflage, Teubner, 1999
• Michael Sipser, Introduction to the Theory of Computation, 2nd ed., Thomson Course Technology, 2006
• Wegener, Kompendium theoretische Informatik - Eine Ideensammlung, Teubner 1996

Contents

The proseminar delves more deeply into topics covered in the basic classes taught by the theory group. During the winter semester, we consider advanced topics from the theory of computability and of formal languates (in continuation of "Theory of Computation"); during the summer semester, we talk about algorithms (in continuation of "Algorithms, Data Structures, and Data Abstraction").

Prerequisites

two semesters of computer science, successful completion of "Theory of Computation"

wird mit der Ankündigung bekannt gegeben

In this Proseminar students will present selected topics from programming languages. We will cover special topics in the theoretical and practical foundations of programming languages as well as the scientific basis for several less mainstream programming paradigms such as aspect orientation and the synchronous paradigm. 

Each presentation will be followed by detailed discussion amongst all participants. To help all participants prepare for these discussions, a writeup of the presentation should be made available to all students well ahead of the presentation.

Literatur wird selbst recherchiert

Target group:

• Students in the bachelor track (third semester or later)
• Students in the teaching bachelor track
• Students minoring in our department

Prerequisites:

• Functional and object oriented programming

The proseminar/seminar will focus on semantic technologies, (Corporate) Semantic Web, artificial intelligence (AI) and declarative knowledge representation in the enterprise context.

Content:

    Part 1: Mathematical principles: similarity and distance measures, vector space
    Part 2: Building a search engine, state of the art Boolean Retrieval.
    Part 3: Dictionaries and selected aspects of Natural Language Processing
    Part 4: Ranking and evaluation of search results
    Part 5: Relevance Feedback and Query Extension
    Part 6: Link Analysis, PageRank

Literatur: Manning, C., Schütze, H.: Introduction to Information Retrieval, Cambridge University Press (und online) Weitere Literatur wird bekannt gegeben.

Topic assignment on the first day of the seminar.

Lectures and further details from mid-September 2018 on the homepage. There you will find details of the course. You can now apply for a presentation by e-mail to the lecturer.

Erst kürzlich, Ende Januar, fand im Deutschen Bundestag eine öffentliche Expertenanhörung zum Thema „Recht auf Verschlüsselung – Privatsphäre und Sicherheit im digitalen Raum stärken“ statt: Eine Angelegenheit, die einerseits alle Mitglieder unserer heutigen „Digitalen Gesellschaft“ betrifft, zu der sich aber anderseits nur Bürger mit dem nötigen informatischen Vorwissen zur IT-Sicherheit fundiert eine Meinung bilden – und auch nur so unsere Demokratie aktiv mitgestalten – können.

Im Proseminar „IT-Sicherheit in der Bildung“ wollen wir daher  untersuchen, welche zentralen Begriffe, Konzepte und Ideen der IT-Sicherheit für alle von Bedeutung sind: Hierzu betrachten wir sowohl die bisherige, internationale Forschung zur IT-Sicherheit im Bildungsbereich als auch brandaktuelle Themen um Begriffe wie „social engineering“ oder „Quantenkryptografie“.

Bitte melden Sie sich bei Interesse zeitnah per Mail beim Dozenten an: ddi-itsec@lists.fu-berlin.de

Wir freuen uns auf Ihre Mitgestaltung am Seminar!

Hinweis:
Zur baldigen Koordination der Themen – und damit Ihnen die größtmögliche Bearbeitungszeit für diese eingeräumt werden kann – findet am Montag, 24. Februar um 12:15 bis 13:45 Uhr ein Vorbesprechungstermin im Lehr-Lern-Labor der DDI (Königin-Luise-Straße 24-26, Raum 016) statt. Bitte melden Sie sich auch per E-Mail zum Vorbesprechungstermin an – ebenso für den Fall, dass Sie nicht am Vorbesprechungstermin teilnehmen können, oder diesen aufgrund der VL-freien Zeit versäumt haben sollten: Sie erhalten dann einen individuellen Termin.

Wird im Seminar bekanntgegeben.

Content

Database design with ERM/ERDD. Theoretical foundations of relational database systems: relational algebra, functional dependencies, normal forms. Relational database development: SQL data definitions, foreign keys and other integrity constraints, SQL as applicable language: essential language elements, embedding in programming language. Application programming; object-relational mapping. Security and protection concepts. Transaction subject, transactional guaranties, synchronization of multi user operations, fault tolerance features. Application and new developments: data warehousing, data mining, OLAP.

Project: the topics are deepened in an implementation project for student groups.

• Alfons Kemper, Andre Eickler: Datenbanksysteme - Eine Einführung, 5. Auflage, Oldenbourg 2004
• R. Elmasri, S. Navathe: Grundlagen von Datenbanksystemen, Pearson Studium, 2005

Requirements

• ALP 1 - Functional Programming
• ALP 2 - Object-oriented Programming
• ALP 3 - Data structures and data abstractions
• OR Informatik B

Contents

We choose a typical application area of algorithms, usually for geometric problems, and develop software solutions for it, e.g., computer graphics (representation of objects in a computer, projections, hidden edge and surface removal, lighting, raytracing), computer vision (image processing, filtering, projections, camera calibration, stereo-vision) or pattern recognition (classification, searching).

Prerequsitions

Basic knowledge in design and anaylsis of algorithms.

je nach Anwendungsgebiet

Programming for Internet Communication Along the Stack

In this course, students will develop solutions that relate to Internet communication. We will consider all aspects of the Internet ecosystem, including lower layers up to the application layer for the current Internet as well as the Internet of Things. Participants will work in smaller groups (3-4 students), where each group will focus on a specific builing block. This will allow to adapt to interests and expertises (e.g., web vs. embedded system programming).

Note that we intend to use the results of this software project to revamp the old super computers in the entrance area of the CS building (i.e., the PDP 11 and the Russian clone). We will extend both computers by network-capabale devices, sensors, screens, and your software (a) to demonstrate the Internet of Things and (b) to give insights into the current state of the Internet backbone.

Below you find some initial topics, which we will clarify during the first meeting.

Embedded / IoT Programming

You will develop applications for embedded devices. The software base is the open source operating system RIOT.

Internet Backbone Measurements

You will develop applications that process live BGP data and check if an attack is happening. The software base is the RTRlib and BGPMON/BGPStream.

Web Interface

You will develop a web interfaces that shows the state of the super computers to remote participants. Your web frontend should be suitable for mobile devices.

If you have questions in advance, feel free to contact Matthias Wählisch.

• A. S. Tanenbaum, Modern Operating Systems, 3rd ed. Upper Saddle River, NJ, USA: Prentice Hall Press, 2007.
• Shelby, Zach, and Carsten Bormann. 6LoWPAN: The wireless embedded Internet. Vol. 43. Wiley. com, 2011.
• A. Dunkels, B. Gronvall, and T. Voigt, "Contiki - a lightweight and flexible operating system for tiny networked sensors." in LCN. IEEE Computer Society, 2004, pp. 455-462.
• P. Levis, S. Madden, J. Polastre, R. Szewczyk, K. Whitehouse, A. Woo, D. Gay, J. Hill, M. Welsh, E. Brewer, and D. Culler, "TinyOS: An Operating System for Sensor Networks," in Ambient Intelligence, W. Weber, J. M. Rabaey, and E. Aarts, Eds. Berlin/Heidelberg: Springer-Verlag, 2005, ch. 7, pp. 115-148.
• Oliver Hahm, Emmanuel Baccelli, Mesut Günes, Matthias Wählisch, Thomas C. Schmidt, "RIOT OS: Towards an OS for the Internet of Things," in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), Poster Session, April 2013.
• M.R. Palattella, N. Accettura, X. Vilajosana, T. Watteyne, L.A. Grieco, G. Boggia and M. Dohler, "Standardized Protocol Stack For The Internet Of (Important) Things", IEEE Communications Surveys and Tutorials, December 2012.
• J. Wiegelmann, Softwareentwicklung in C für Mikroprozessoren und Mikrocontroller, Hüthig, 2009

In this course you will be expected to write code. The outcome of your software project should be a concrete contribution to the RIOT code base, and take the shape of one or more pull request(s) to the RIOT github (https://github.com/RIOT-OS/RIOT). Before you start coding, refer to the starting guide

https://github.com/RIOT-OS/RIOT/wiki#wiki-start-the-riot

Content

Subject of the project: either development of software together with a company (in this case: 4­ weeks fulltime August/September) or we build a so called NoSQL system. Decision in March. Further information are published in the KVV.

Wird bekannt gegeben

Requirement

ALP I-V, Foundations of Datenbase Systems, good programming knowledge.

Literatur, Materialien und Geräte werden während der Veranstaltung gestellt.

Automated methods for the recognition and analysis of behavior have been increasingly used to investigate individual and collective animal behavior. This includes applications such as tracking individuals in large groups (humans in crowds, animals in herds/swarms/flocks, cars in traffic), mapping observations of an individual to a behavioral space ("what is person X doing"), and learning about the structure of social interactions ("who is doing what with whom"). Recent methods allow processing large amounts of data resulting in surprisingly accurate results. We will look at a variety of supervised and unsupervised approaches with examples from our own research.

,,

,,

Contents

• mathematical foundations of computer graphics,
• representation of 3d scenes in a comuter
• geometric transformations, projections,
• hidden surface removal, lighting,
• raytracing
• radiosity,
• animation

Target Audience

B.Sc.-students in their fifth semester, M.Sc.-students in computer science, mathematics, physics, etc.,

• Computer Graphics (2nd Edition C Version). D. Hearn, M.P. Baker, Prentice-Hall, 1997.
• Computer Graphics - Principles and Practice (2nd Edition in C). J.D. Foley, A. Van-Dam, S.K. Feiner and J.F. Hughes. Addison-Wesley, 1996
• Interactive Computer Graphics (4th Edition).E. Angel, Addison-Wesley, 2006
• OpenGL Programming Guide: The Official Guide to Learning OpenGL, Version 2.1.D. Shreiner, M. Woo, J. Neider, T. Davis, Addison-Wesley, 2007

Content

This course motivates the need for computer security and introduces central concepts of computer security such as security objectives, threats, threat analysis, security policy and mechanism, assumptions and trust, and assurance.

We discuss authentication mechanisms, followed by various security models and show which security related questions can be answered in these models. The models we discussed include the Access Control Matrix Model, the Take-Grant Protection Model, the Bell-LaPadula and related models, the Chinese Wall Model, the Lattice Model of Information Flow.

Subsequently, we cover principles of security architectures and go through design approaches for secure systems e.g., capability based systems and hardware rotection mechanism concepts such as protection rings. Based on the learned, we may look at selected case studies of existing systems.

In the remainder of the course, we cover exploitation techniques for specific implementation vulnerabilities such as race conditions, stack and heap overflows, integer overflows, and return oriented programming. We continue with a discussion of insider threats, insider recruitment and social engineering attacks.

If time permits, we continue to look at the problems that arise when humans interface with security e.g., password habits and password entry mechanisms, human responses to security prompts, incentives and distractors for better security, or reverse Turing tests.

1. M. Gasser. Building Secure Computer Systems.
2. D. Denning. Cryptography and Data Security.
3. D. Kleidermacher, M. Kleidermacher. Embedded Systems Security.
4. M. Bishop. Computer Security Art and Practice.
5. Various research papers.

The lecture held by Dr. Andreas Wolf (from the Bundesdruckerei) He will give a broad overview of biometric processes and applications. He will also address the current issues with ePassports and new electronic identity cards.

The course aims to include:

• General structure of biometric systems
• Features of biometric modalities
• IT security and risk assessment
• Errors in biometric processes
• Fingerprinting
• Facial and iris recognition
• Speaker recognition and other modalities
• Standards
• ePassport

Next to the theoretical foundations of biometric modalities, the students are to develop the ability to assess the applicability of biometrics in various scenarios.

Die Lehrveranstaltung soll am Freitag den 27. April beginnen.

Skript zur VL wird zu Anfang des Sommersemesters bekannt gegeben.

Cluster computer are the prevailing type of high performance computers. They are built of custom off-the-shelf processor boards that are connected by a high speed interconnection network. Although usually locally integrated, they are conceptually distributed systems with local operating system images. Their enormous potential, however, can only be exploited, if program code and data are optimally distributed across the nodes. Cluster management mechanisms also need to be scalable to be employed in systems with thousands of nodes. The lecture course gives an overview of the architecture of cluster computers and the related management problems for which algorithmic solutions are presented. It runs in parallel to the integrated course Parallel Programming. Both complement each other and form the module Parallel Systems.

• Heiss, H.-U.: Prozessorzuteilung in Parallelrechnern, BI-Verlag, Mannheim, 1996
• Andrews, G. A.: Foundations of Multithreaded, Parallel and Distributed Programming, Addison-Wesley, 2000
• Pfister, G.: In Search of Clusters 2nd ed., Prentice Hall, 1998
• Zomaya, A.: Parallel and distributed computing handbook, McGraw Gill, 1995
• Buyya, R.: High Performance Cluster Computing, Vol. 1+2, Prentice Hall, 1999

Target group

• Computer Science Master students

Requirements

• Experience with computers and software as well as programing skills.

Language

• The course language is German (or English if requested).
• The exam will be formulated in German, but answers may be given in English, too.

Credits & Exams

The criteria for gaining credits are

• active participation in the tutorials: regular preparation of assignements & presentation of results in the tutorials
• passing of the exam

Website

https://www.mi.fu-berlin.de/w/SE/VorlesungClusterComputing

• Bull, D. R., “Communicating Pictures: A Course in Image and Video Coding,” Elsevier, 2014.
• Ohm, J.-R., “Multimedia Signal Coding and Transmission,” Springer, 2015.
• Wien, M., “High Efficiency Video Coding — Coding Tools and Specifications,” Springer 2014.
• Sze, V., Budagavi, M., and Sullivan, G. J. (eds.), “High Efficiency Video Coding (HEVC): Algorithm and Architectures,” Springer, 2014.
• Schwarz, H. and Wiegand, T., “Video Coding: Part II of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, Now Publishers, vol. 10, no. 1–3, 2016.

Nowadays, both in the business environment and in private use, the question is no longer whether software should be used, but which software should be chosen. In such decision-making processes, the usability of the software is often not an explicit requirement, but implicitly it has a high influence on the selection decision. Good usability and a positive user experience for the user can only be achieved by knowing and understanding the user's wishes, hidden needs and cognitive abilities. In addition to choosing the "right" technology and the "right" procedure, the consideration of the users and their needs is fundamental for the later success of the project or product. However, usability is neither a product characteristic inherent in software, nor can usability, like a software feature, be developed separately at a certain point in time. Usability always stands in a certain usage context and this context must be clearly understood in order to increase it. In addition, to improve usability, the entire software development process must be interfered with and, depending on the project phase and project situation, different principles and methods must be selected and adapted. The goal should be to ensure the usability of the software for the respective target group in spite of complex functionality and wealth of information. The aim is to create a positive user experience for the user by taking emotional and aesthetic factors into account.

• Shneiderman, Ben, et al. Designing the user interface: strategies for effective human-computer interaction. Pearson, 2016.
• Dix A, Finlay J, Abowd GD, Beale R (2004) Human Computer Interaction. Pearson Prentice Hall 2004.
• Sharp, Helen, Yvonne Rogers, and Jenny Preece. "Interaction design: beyond human-computer interaction." (2007).

https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/summer-term-2020/human-computer-interaction_1.html

The lecture held by Dr. Andreas Wolf (from the Bundesdruckerei) He will give a broad overview of biometric processes and applications. He will also address the current issues with ePassports and new electronic identity cards.

The course aims to include:

• General structure of biometric systems
• Features of biometric modalities
• IT security and risk assessment
• Errors in biometric processes
• Fingerprinting
• Facial and iris recognition
• Speaker recognition and other modalities
• Standards
• ePassport

Next to the theoretical foundations of biometric modalities, the students are to develop the ability to assess the applicability of biometrics in various scenarios.

Die Lehrveranstaltung soll am Freitag den 27. April beginnen.

Skript zur VL wird zu Anfang des Sommersemesters bekannt gegeben.

Cluster computer are the prevailing type of high performance computers. They are built of custom off-the-shelf processor boards that are connected by a high speed interconnection network. Although usually locally integrated, they are conceptually distributed systems with local operating system images. Their enormous potential, however, can only be exploited, if program code and data are optimally distributed across the nodes. Cluster management mechanisms also need to be scalable to be employed in systems with thousands of nodes. The lecture course gives an overview of the architecture of cluster computers and the related management problems for which algorithmic solutions are presented. It runs in parallel to the integrated course Parallel Programming. Both complement each other and form the module Parallel Systems.

• Heiss, H.-U.: Prozessorzuteilung in Parallelrechnern, BI-Verlag, Mannheim, 1996
• Andrews, G. A.: Foundations of Multithreaded, Parallel and Distributed Programming, Addison-Wesley, 2000
• Pfister, G.: In Search of Clusters 2nd ed., Prentice Hall, 1998
• Zomaya, A.: Parallel and distributed computing handbook, McGraw Gill, 1995
• Buyya, R.: High Performance Cluster Computing, Vol. 1+2, Prentice Hall, 1999

Target group

• Computer Science Master students

Requirements

• Experience with computers and software as well as programing skills.

Language

• The course language is German (or English if requested).
• The exam will be formulated in German, but answers may be given in English, too.

Credits & Exams

The criteria for gaining credits are

• active participation in the tutorials: regular preparation of assignements & presentation of results in the tutorials
• passing of the exam

Website

https://www.mi.fu-berlin.de/w/SE/VorlesungClusterComputing

• Bull, D. R., “Communicating Pictures: A Course in Image and Video Coding,” Elsevier, 2014.
• Ohm, J.-R., “Multimedia Signal Coding and Transmission,” Springer, 2015.
• Wien, M., “High Efficiency Video Coding — Coding Tools and Specifications,” Springer 2014.
• Sze, V., Budagavi, M., and Sullivan, G. J. (eds.), “High Efficiency Video Coding (HEVC): Algorithm and Architectures,” Springer, 2014.
• Schwarz, H. and Wiegand, T., “Video Coding: Part II of Fundamentals of Source and Video Coding,” Foundations and Trends in Signal Processing, Now Publishers, vol. 10, no. 1–3, 2016.

Nowadays, both in the business environment and in private use, the question is no longer whether software should be used, but which software should be chosen. In such decision-making processes, the usability of the software is often not an explicit requirement, but implicitly it has a high influence on the selection decision. Good usability and a positive user experience for the user can only be achieved by knowing and understanding the user's wishes, hidden needs and cognitive abilities. In addition to choosing the "right" technology and the "right" procedure, the consideration of the users and their needs is fundamental for the later success of the project or product. However, usability is neither a product characteristic inherent in software, nor can usability, like a software feature, be developed separately at a certain point in time. Usability always stands in a certain usage context and this context must be clearly understood in order to increase it. In addition, to improve usability, the entire software development process must be interfered with and, depending on the project phase and project situation, different principles and methods must be selected and adapted. The goal should be to ensure the usability of the software for the respective target group in spite of complex functionality and wealth of information. The aim is to create a positive user experience for the user by taking emotional and aesthetic factors into account.

• Shneiderman, Ben, et al. Designing the user interface: strategies for effective human-computer interaction. Pearson, 2016.
• Dix A, Finlay J, Abowd GD, Beale R (2004) Human Computer Interaction. Pearson Prentice Hall 2004.
• Sharp, Helen, Yvonne Rogers, and Jenny Preece. "Interaction design: beyond human-computer interaction." (2007).

https://www.mi.fu-berlin.de/en/inf/groups/hcc/teaching/summer-term-2020/human-computer-interaction_1.html

In this course we will study stochastic models commonly used to analyse the performance of dynamic systems. Markov models and queues are used to study the behaviour over time of a wide range of systems, from computer hardware, communication systems, biological systems, epidemics, traffic networks to crypto-currencies. We will take a tour of the basics of Markov modelling, starting from birth-death processes, the Poisson process to general Markov and semi-Markov processes and solution methods for those processes. Then we will look at queueing models and queueing networks with exact and approximate solution algorithms. If time allows we will finally study some of the foundations of discrete event simulation.

William Stewart. Probability, Markov Chains, Queues and Simulation. Princeton University Press 2009.

Qualification objectives: The students have a basic understanding of algebraic and computational methods for deep neural networks, their application scope and can practically build and train them with state-of-the-art software tools. They are familiar with typical deep learning structures and understand the relationship to their shallow counterparts.

Content:

- Perceptron

- Multilayer neural network and universal represenation theorem

- Backpropagation

- Deep feedforward networks

- Convolutional Neural Networks

- Autoencoder versus principal component analysis

- Time-autoencoder versus time-lagged independent component analysis

- Generative networks: Variational Autoencoders and Adversarial Generative Networks

- Active learning

This lecture/lab course is suitable for Master students of Mathematics, Computer Science or Computational Sciences.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

Efficient data structures are important components of all nontrivial algorithms, and are basic building blocks of the modern computing infrastructure. Besides their practical importance, the design and analysis of data structures has revealed a rich mathematical theory. The ultimate theoretical limits of data structures are the subject of deep open questions.

The topic of this course is the design and analysis of data structures (including both classical and recent results), with emphasis on data structures that are adaptive, exploiting regularities in their input. One fresh topic is planned for each week. These include: self-adjusting trees and heaps, the geometry of comparison-based data structures, static and dynamic optimality, persistent-, succinct-, and external-memory- data structures, soft heaps and selection, pattern-avoidance, hashing and approximate counting, dynamic graph problems.

• Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, 2nd Ed. McGraw-Hill 2001
• Tarjan: Data Structures and Network Algorithms, SIAM 1987
• recent articles

Links to similar courses at other universities:

• Pat Morin, Carleton,  http://cglab.ca/~morin/teaching/5408/
• Erik Demaine, MIT, http://courses.csail.mit.edu/6.851/
• Jeff Erickson, UIUC, http://jeffe.cs.illinois.edu/teaching/datastructures/
• Venkatesh Raman, IMSc, https://www.imsc.res.in/~vraman/adsjan2012/index.html

Target Audience

Masters students in Computer Science or Mathematics, advanced Bachelor students.

Prerequisites

"Advanced Algorithms" or a similar class

Course objectives 

Security is a prerequisite of modern wireless communication systems and user services. In this course we will introduce a new security paradigm for communication systems called physical layer security (PLS). PLS is an advanced method envisioned to meet the advanced requirements of future communication systems such as low latency ('fast security') and 'plug & secure' functionality. PLS is based on a well-defined mathematical theory exploiting the inherent properties of the wireless channel such as noise and fading. The goal of the course is to present the information-theoretic foundations of PLS including the definition of secrecy capacity definitions for the point-to-point wireless channel with an eavesdropper ('wiretap channel') as well as secret key agreement from stochastic channel measurements.

The course will also take on the attackers view and address potential attacks. Finally, several potential deployment scenarios such as the Internet of Things will be discussed.

Course Content

• Overview of security schemes in communication systems: layer model, asymmetric/symmetric encryption, PLS classifications
• Wiretap channel: basic definitions and assumptions, secrecy capacity, strong/weak secrecy, coding methods, MIMO channel, multiuser aspects
• Secret key agreement: source models, key generation, common randomness, reciprocal wireless channel, correlation properties
• Attacker models: passive/active, 'man in the middle', jamming
• Deployment scenarios: lightweight security, wormhole detection

Matthieu Bloch and Joao Barros: Physical Layer Security: From Information Theory to Security Engineering. Cambridge University Press, 2011

In this course we will study stochastic models commonly used to analyse the performance of dynamic systems. Markov models and queues are used to study the behaviour over time of a wide range of systems, from computer hardware, communication systems, biological systems, epidemics, traffic networks to crypto-currencies. We will take a tour of the basics of Markov modelling, starting from birth-death processes, the Poisson process to general Markov and semi-Markov processes and solution methods for those processes. Then we will look at queueing models and queueing networks with exact and approximate solution algorithms. If time allows we will finally study some of the foundations of discrete event simulation.

William Stewart. Probability, Markov Chains, Queues and Simulation. Princeton University Press 2009.

Efficient data structures are important components of all nontrivial algorithms, and are basic building blocks of the modern computing infrastructure. Besides their practical importance, the design and analysis of data structures has revealed a rich mathematical theory. The ultimate theoretical limits of data structures are the subject of deep open questions.

The topic of this course is the design and analysis of data structures (including both classical and recent results), with emphasis on data structures that are adaptive, exploiting regularities in their input. One fresh topic is planned for each week. These include: self-adjusting trees and heaps, the geometry of comparison-based data structures, static and dynamic optimality, persistent-, succinct-, and external-memory- data structures, soft heaps and selection, pattern-avoidance, hashing and approximate counting, dynamic graph problems.

• Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, 2nd Ed. McGraw-Hill 2001
• Tarjan: Data Structures and Network Algorithms, SIAM 1987
• recent articles

Links to similar courses at other universities:

• Pat Morin, Carleton,  http://cglab.ca/~morin/teaching/5408/
• Erik Demaine, MIT, http://courses.csail.mit.edu/6.851/
• Jeff Erickson, UIUC, http://jeffe.cs.illinois.edu/teaching/datastructures/
• Venkatesh Raman, IMSc, https://www.imsc.res.in/~vraman/adsjan2012/index.html

Target Audience

Masters students in Computer Science or Mathematics, advanced Bachelor students.

Prerequisites

"Advanced Algorithms" or a similar class

Course objectives 

Security is a prerequisite of modern wireless communication systems and user services. In this course we will introduce a new security paradigm for communication systems called physical layer security (PLS). PLS is an advanced method envisioned to meet the advanced requirements of future communication systems such as low latency ('fast security') and 'plug & secure' functionality. PLS is based on a well-defined mathematical theory exploiting the inherent properties of the wireless channel such as noise and fading. The goal of the course is to present the information-theoretic foundations of PLS including the definition of secrecy capacity definitions for the point-to-point wireless channel with an eavesdropper ('wiretap channel') as well as secret key agreement from stochastic channel measurements.

The course will also take on the attackers view and address potential attacks. Finally, several potential deployment scenarios such as the Internet of Things will be discussed.

Course Content

• Overview of security schemes in communication systems: layer model, asymmetric/symmetric encryption, PLS classifications
• Wiretap channel: basic definitions and assumptions, secrecy capacity, strong/weak secrecy, coding methods, MIMO channel, multiuser aspects
• Secret key agreement: source models, key generation, common randomness, reciprocal wireless channel, correlation properties
• Attacker models: passive/active, 'man in the middle', jamming
• Deployment scenarios: lightweight security, wormhole detection

Matthieu Bloch and Joao Barros: Physical Layer Security: From Information Theory to Security Engineering. Cambridge University Press, 2011

In this course we will study stochastic models commonly used to analyse the performance of dynamic systems. Markov models and queues are used to study the behaviour over time of a wide range of systems, from computer hardware, communication systems, biological systems, epidemics, traffic networks to crypto-currencies. We will take a tour of the basics of Markov modelling, starting from birth-death processes, the Poisson process to general Markov and semi-Markov processes and solution methods for those processes. Then we will look at queueing models and queueing networks with exact and approximate solution algorithms. If time allows we will finally study some of the foundations of discrete event simulation.

William Stewart. Probability, Markov Chains, Queues and Simulation. Princeton University Press 2009.

Qualification objectives: The students have a basic understanding of algebraic and computational methods for deep neural networks, their application scope and can practically build and train them with state-of-the-art software tools. They are familiar with typical deep learning structures and understand the relationship to their shallow counterparts.

Content:

- Perceptron

- Multilayer neural network and universal represenation theorem

- Backpropagation

- Deep feedforward networks

- Convolutional Neural Networks

- Autoencoder versus principal component analysis

- Time-autoencoder versus time-lagged independent component analysis

- Generative networks: Variational Autoencoders and Adversarial Generative Networks

- Active learning

This lecture/lab course is suitable for Master students of Mathematics, Computer Science or Computational Sciences.

Cryptoanalysis of asymmetrical schemes

The lecture deals with different asymmetrical cryptanalytics, in particular with the supposed hard problems of these processes. Some of the contents are

• RSA and the problem of factorization
• DSA and the discrete logarithm problem
• Merkel-Hellman and the knapsack and grid problem
• McEliece and the problem of decoding
• Matsumoto-Imai and the multivariate Polynomial System

Knowledge in the areas of IT security and cryptography is obligatory.

Contents: - the real numbers, - the concept of limits (sequences and series) – functions (continuity and differentiability) – minima and maxima of differentiable functions, extreme value calculation – the Riemann integral

Content:

• Basic terms/concepts: sets, maps, equivalence relations, groups, rings,
• fields
• Linear equation systems: solvability criteria, Gauss algorithm
• Vector spaces: linear independence, generating systems and bases, dimension,
• subspaces, quotient spaces, cross products in R3
• Linear maps: image and rank, relationship to matrices, behaviour under
• change of basis
• Dual vector spaces: multilinear forms, alternating and symmetric bilinear
• forms, relationship to matices, change of basis
• Determinants: Cramer's rule, Eigenvalues and Eigenvectors

Prerequisites:

Participation in the preparatory course (Brückenkurs) is highly recommended.

Literatur:
Siegfried Bosch, Lineare Algebra, 4. Auflage, Springer-Verlag, 2008;
Tammo tom Dieck, Lineare Algebra, Skript, Universität Göttingen Version vom 7.10.2014

• linear algebra:
  • vector space, basis and dimension;
  • linear map, matrix and rank;
  • Gauss-elimination and linear systems of equations;
  • determinants, eigenvalues and eigenvectors;
  • euclidean vector spaces and orthonormalization;
  • principal component transformation;
  • Applications of linear algebra in affine geometry, statistics, and coding theory  (linear codes)

• Klaus Jänich: Lineare Algebra, Springer-Lehrbuch, 10. Auflage 2004
• Dirk Hachenberger: Mathematik für Informatiker, Pearson 2005
• G. Grimmett, D. Welsh: Probability - An Introduction, Oxford Science Publications 1986
• Kurt Meyberg, Peter Vachenauer: Höhere Mathematik 1, Springer-Verlag, 6. Auflage 2001
• G. Berendt: Mathematik für Informatiker, Spektrum Akademischer Verlag 1994
• Oliver Pretzel: Error-Correcting Codes and Finite Fields, Oxford Univ. Press 1996

The sign-up for the tutorial sessions will be announced in due time.

Contents: - the real numbers, - the concept of limits (sequences and series) – functions (continuity and differentiability) – minima and maxima of differentiable functions, extreme value calculation – the Riemann integral