Tutorien finden erst ab der 2. Vorlesungswoche statt

Vorlesung siehe 19300001

Contents: 

Introduction to Functional Programming (Haskell): 

• Syntax (Backus-Naur Form) 
• primitive data types, lists, tuples, strings 
• expressions, function definitions, recursion and iteration 
  • evaluation strategies of functional programs
  • higher-order functions
  • polymorphism 
  • type system and verification 
• Algebraic and abstract data types 
• input, output and Monads
• searching and sorting algorithms 

Introduction of computability: 

• Lambda calculus 
• Primitive Recursion 
• μ-Recursion 

Proofs of program properties: 

• Term Rewriting 
• Structural induction 
• Termination 

Implementation and programming technique: 

• Modular program design

• Simon Thompson: Haskell: The Craft of Functional Programming, 2nd Edition, Addison-Wesley, 1999
• Graham Hutton: Programming in Haskell, Cambridge University Press, 2007
• Bird, R./Wadler, Ph.: Einführung in Funktionale Programmierung, Hanser Verlag, 1982
• Hans Hermes: Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit, Springer-Verlag 1978

For the tutorial please refer to 19300004

• Analysis of sorting algorithms: Mergesort, Quicksort, etc.
• ADTs priority queue and dictionary and corresponding data structures: heaps, hashing, binary search trees, B-trees, etc. 
• Graph algorithms: breadth first search and depth first search, topolocigal sorting, minimum spanning trees, shortest paths.
• Analysis on Strings.
• Memory-management.
• Algorithm design: divide-and-conquer, greedy algorithms, dynamic programming.
• Mathematical analysis of algorithms: running time, space.

• P. Morin: Open Data Structures, an open content textboox.
• T. H. Cormen, C. Leiserson, R. Rivest, C. Stein: Introduction to Algorithms, MIT Press, 2009.
• R. Sedgewick: Algorithms in Java (Part 1–5), Addison-Wesley, 2003.
• G. Saake, S. Sattler: Algorithmen und Datenstrukturen, dpunkt.verlag, 2013.
• M. Dietzfelbinger, K. Mehlhorn, P. Sanders. Algorithmen und Datenstrukturen: Die Grundwerkzeuge, Springer, 2014.
• M.T. Goodrich, R. Tamassia: Data Structures and Algorithms in Java, Wiley, 2014.

The module Fundamentals of Computer Engineering forms the basis for understanding the functioning of real computer systems.

Starting from logic, this module primarily covers the subject areas of switching networks and switching mechanisms, logic minimization, gates, flip-flops, memory, automatic machines and simple hardware design.

Furthermore, basic knowledge of DC and AC networks, semiconductors, transistors, CMOS, operational amplifiers, A/D and D/A converters is taught, as far as it is necessary for computer science.

In the corresponding practical course, the knowledge gained in the lecture and in the module Computer Architecture, Operating and Communication Systems are deepened with numerous practical experiments.

Based on a simple hardware platform with processor and various interfaces, the participants will learn how to program elementary drivers, extend operating system routines and control 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
 

See documentation on the website - only from the FB network or via VPN Webseite

Website: GTI (nur aus dem FB-Netz oder über VPN verfügbar)

Das Seminar am PC ist die Begleitveranstaltung zur Vorlesung 19300501

Website: GTI (nur aus dem FB-Netz oder über VPN verfügbar)

The module Computer Architecture covers basic concepts of computer systems. Topics are von-Neuman/Harvard architecture, microarchitectures, RISC/CISC, micro programming, pipelining, caches, memory hierarchy, bus systems, assembler programming, multi processor systems, branch prediction, representation of numbers and other data types, computer arithmetic.

• Andrew S. Tannenbaum: 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.

The module Computer Architecture covers basic concepts of computer systems. Topics are von-Neuman/Harvard architecture, microarchitectures, RISC/CISC, micro programming, pipelining, caches, memory hierarchy, bus systems, assembler programming, multi processor systems, branch prediction, representation of numbers and other data types, computer arithmetic.

Operating systems tie together the execution of applications, user experience and usability with the management of computer hardware. Starting with the tasks an operating system has to perform and the requirements it has to meet, the most important aspects of design and development of modern operating systems will be introduced:

• Structure and design of an operating system including historical summary, structures and philosophies of OS design and resources and resource management
• Threads and processes including thread management
• Scheduling including real-time scheduling
• Process interaction and inter-process communication
• Resource management including device operation, driver development, management and operation of input- and output devices
• Memory management including address spaces and virtual memory
• File system including management and operation of discs and memory hierarchy
• Distributed operating systems including distributed architectures for resource management
• Performance evaluation and modeling including overload detection and handling

Modern operating systems provide examples for different aspects and current research will be introduced. The tutorials serve to reflect the topics dealt with in the lecture and to acquire experience by developing a small operating system.

• A.S. Tanenbaum: Modern Operating Systems, 2nd Ed. Prentice-Hall, 2001
• A. Silberschatz et al.: Operating Systems Concepts with Java, 6th Ed. Wiley, 2004

The overwhelming majority of future computer systems will be characterized by communicating, embedded systems. These are found in machine controls, household appliances, motor vehicles, airplanes, intelligent buildings, etc. and will in future be increasingly integrated into networks such as the Internet.

The internship will address the architecture of embedded systems and demonstrate the differences to traditional PC architectures (e.g., real-time capability, interaction with the environment) with practical examples. The internship is based on 16- and 32-bit microcontroller systems.

The main focus of the internship is the following:

    register structures
    memory organization
    Hardware assembler and high-language programming
    I / O system and timer programming
    Interrupt system
    Watchdog logic
    Analog interface
    Bus system connection of components
    Communication (serial, CAN bus, Ethernet, radio and USB)
    Control of models and use of different sensors

• Brian W. Kernighan, Dennis M. Ritchie: The C Programming Language, Second Edition, Prentice Hall, 1988.

See documents on the website - only from the FB network or via VPN website

Group A, Wednesday, 12-16 h Takustraße 9, Room K63
Group B, Thursday, 12-16 h Takustraße 9, Room K63

This course addresses communication asp. The lecture addresses topics such as:

• Basic background: protocls, services, models, communication standards;
• Principles of communication engineering: signals, coding, modulation, media;
• Data link layer: media access etc.;
• Local networks: IEEE-Standards, Ethernet, bridges;
• Network layer: routing and forwarding, Internet protocols (IPv4, IPv6);
• Transport layer: quality of service, flow control, congestion control, TCP;
• Internet: TCP/IP protocol suite;
• Applications: WWW, security, network management;
• New network concepts.

In the supplementary exercise course the students will practically apply their knowledge.

• Larry Peterson, Bruce S. Davie: Computernetze - Ein modernes Lehrbuch, dpunkt Verlag, Heidelberg, 2000
• Krüger, G., Reschke, D.: Lehr- und Übungsbuch Telematik, Fachbuchverlag Leipzig, 2000
• Kurose, J. F., Ross, K. W.: Computer Networking: A Top-Down Approach Featuring the Internet, Addi-son-Wesley Publishing Company, Wokingham, England, 2001
• Siegmund, G.: Technik der Netze, 4. Auflage, Hüthig Verlag, Heidelberg, 1999
• Halsall, F.: Data Communi-cations, Computer Networks and Open Systems 4. Auflage, Addison-Wesley Publishing Company, Wokingham, England, 1996
• Tanenbaum, A. S.: Computer Networks, 3. Auflage, Prentice Hall, Inc., New Jersey, 1996

Requirements: Basic understanding of computer networks, e.g., TI-III

We will study the history, technology and applications of cryptocurrencies and blockchain. This course will be organised as a 4h lecture during the first half of the semester and a project during the second half of the semester.

Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

We will study the history, technology and applications of cryptocurrencies and blockchain. This course will be organised as a 4h lecture during the first half of the semester and a project during the second half of the semester.

Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

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

KVV-Link

In the last couple of years cryptocurrencies arose as an alternative payment method. These currencies promise anonymity and independence from state-regulated markets. For this, cryptocurrencies use cryptographic primitives to ensure decentralization and security of the transactions.

This proseminar aims at Bachelor students who want to get into the field of cryptography and cryptocurrencies. Starting from the theoretical basics, in the course of the semester we will examine the most popular examples and applications.

The module exam consists of a 30 minute presentation followed by a discussion round. For the active participation a five page elaboration of the presentation (in LaTeX/LyX) and a regular involvement in the discussion are needed.

Prerequisites:

Lectures "Algorithms, data structures, and data abstraction" and "Logic and Discrete Mathematics".

An advantage would be knowledge in the area of computer security.

Literaturhinweise erfolgen während des Vorbesprechungstermins.

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. / To be announced.

Target group

Students in the Master's or Bachelor's programme

Prerequisites

Good programming skills, introduction to database systems.

Mixed groups of master and bachelor students will either implement an independent project or are part of a larger project in the area of semantic technologies. They will gain in-depth programming knowledge about applications of semantic technologies and artificial intelligence techniques in the Corporate Semantic Web. They will practice teamwork and best practices in software development of large distributed systems and Semantic Web applications. The software project can be done in collaboration with an external partner from industry or standardization. It is possible to continue the project as bachelor or master thesis.

Corporate Semantic Web

Further information can be found on the course website

[1] http://www.tptp.org/
[2] https://github.com/leoprover/embed_modal
[3] https://github.com/leoprover/embed_modal/blob/master/TODO.md
[4] http://www.tptp.org/cgi-bin/SystemOnTPTP
[5] http://tptp.cs.miami.edu/~tptp/cgi-bin/SystemB4TPTP

In this semester, we will again focus on questions on mixed reality. The concepts in this area range from Augmented Reality ("AR", for example with HoloLens) to Virtual Reality ("VR", for example with Oculus Rift). The technical possibilities are now available. However, there is still a lack of solutions beyond the application in the area of entertainment or military. The metaphors used are often a mimicry of the real world - novel interaction concepts are still missing.

We want to explore existing possibilities and develop new applications. We consider AR or VR as an open system, which is integrated with existing applications and services.

The goal is to develop product and interaction concepts in interdisciplinary teams, which use these new possibilities of networking intelligently and meaningfully and make their specific qualities experienceable. The implementation of the concepts will be functioning prototypes.

The question in the course will focus on a better connection with the digital (virtual) and the physical (real) world, towards a hybrid “thing”. We will address the following questions:

• How can we enrich existing real objects with augmented information?

• How can we design new interaction concepts that mediate between the digital and the physical?

• How can an application provide physical data as physically interactively as possible?

• How can we design intuitive interaction in the physical-digital space?

A series of hands-on workshops will be accompanied with the course, including an introduction to Unity3D and WebVR.

Please note: equipment (HoloLens, Oculus Rift) will be provided in the course of the course.

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

Sophienstrasse 22a, 2.HH, 2.Stock, 10178 Berlin

www.interdisciplinary-laboratory.hu-berlin.de

Today’s supercomputers especially cluster computers are used for a wide range of applications – from common Client-Server-Apps to High Performance Computing. To support all of these different applications with their different requirements is a challenge for the management systems. That’s why there are different ongoing research projects in this field. This project seminar deals with enhancements of the management systems used to manage the different computer resources. Different applications and scenarios of usage should be supported transparently and in a reliable way. The enhancement will be based on previous work in the context of the Virtual Resource Manager (VRM) project.

Target group

Bachelor and Master of Computer Science

Language

The course language is German.

Homepage

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

Lecturer & Contact Person

Barry Linnert

When studying Computer Science at university you mainly focus on concepts. This approach generally makes sense as these conceps are far more persistent and applicable in a broader sense than concrete details would be. Many details, however, which are important for concrete software development, are falling by the wayside. The course is supposed to reduce this deficit.

In it we mainly focus on concepts too, but always only on those which directly have to do with software development, and make sure to apply them precisely, personally in practice -- reflecting its use jointly (something which distinguisdes this course from most other software projects).

The concepts dealt with and practiced may be assigned to three different but closeky connected spheres:

• software development and structuring (object-oriented) Softwareentwurf und -strukturierung (und zwar objektorientiert)
• approaches (for example in the areas prototyping, automatisation, incremental improvement)
• personality development (aspects like consistency, responsibility, communicational skills)

Important: Each participant needs to have a software project of his/her own, which has been started far in advance or the course (within a company, for founding a company or as an open source project), on which he/she works on a weekly basis for the entire duration of the course (mainly in a team) and which serves as training ground for the concepts.

This is a hard prerequisite for participation.

Prerequisites

Essential prerequisite for participation is a software project as described above which is continued for the entire duration of the course with at least 6 hours per week time and effort for the covered topics. 

Target Group

Students who by intensive training wish to establish skills needed by good and professionally working software developers.

Classification & Credits

Wahlveranstaltung for the Master in Computer Science with 5 credits.

Sources

Main source for the concepts dealt with is the website http://clean-code-developer.de

Website

http://www.mi.fu-berlin.de/w/SE/KursProfessionelleSWEntwicklung2018

Secure software engineering joins two important fields: Software engineering and information security. software engineering is the systematic use of principles, methods and tools to develop and deploy software. information security covers topics like confidentiality, integrity and availability of informations and data.

- Claudia Eckert: IT-Sicherheit, 9. Auflage, De Gruyter Oldenbourg, 2014; - Ross Anderson: Security Engineering, 2. Auflage, Wiley, 2008. Weitere Literaturhinweise werden zu den einzelnen Themenblöcken bereitgestellt.

The goal of this lecture is to teach principles, methods and tools for the development of secure software applications. To this end, basic concepts are first introduced. This is followed by process models for developing secure software and evaluating the maturity of development processes. Along the phases or process groups of software development, central principles, methods and tools are then introduced and explained. Special attention is given to threat and risk analysis, security requirements, principles and patterns for designing secure software applications, secure and insecure software implementations, security tests and evaluation of the security properties of software applications.

Today's natural use of digital media has only become possible through efficient coding techniques. The lecture will discuss the basic coding techniques entropy coding, quantization, predictive coding, transformation coding, which are the main components of modern image and video codecs. For all the coding techniques discussed, a detailed analysis of the coding efficiency is carried out on the basis of simple signal models. In addition, practical applications in image and video coding will be demonstrated.

The topics covered form the basis for the advanced lecture "Image and Video Coding II: Algorithms and Applications", in which the application of the introduced coding techniques in modern image and video codecs is discussed in detail.

Main topics:

    Lossless coding / entropy coding: unambiguously decodable codes; derivation of different entropy measures as lower limit of the average codeword length; Huffman coding; arithmetic coding

    Rate distortion theory: maximum coding efficiency of lossy methods; information rate distortion function; differential entropy; Shannon limit

    Quantization: scalar quantization with fixed and variable length codes; rate distortion functions for high rates; vector quantization; comparison of different quantizers

    Prediction and predictive coding: linear prediction; prediction gain; quantization in the prediction loop; predictive coding efficiency

    Transformation coding: Structure of transformation coding systems; Unitary block transformations; Bit assignment for transformation coefficients; Optimal transformation for Gaussian processes; Signal-independent transformations; Efficiency of transformation coding

Universal Logical Reasoning (with exemplary applications in Mathematics, Metapyhsics, Ethics, AI and CS).

This lecture is intended to extend the previously awarded lecture "Computational Metaphysics" (SS16, 19323701/2) by further exciting and highly topical application topics.

Students from Computer Science, Mathematics and Philosophy are welcome.

tba

Block course after WS18/19, Feb. 25 - Mar 1, 2019. Pre-discussion/topic assignment early november, tba.

Vorlesung siehe 19328001

As the use of data in research, business and politics become increasingly important, well-designed data visualizations are needed to improve understanding, reduce human memory and support decision-making.

This course aims to familiarize students with the principles, techniques, and algorithms of data visualization.
This course teaches students the basics of the current state of data visualization. At the end of the course, students will have an understanding of the following:

1. essential visualization techniques and theory, including data models, graphical perception and methods for visual coding and interaction.
2. basic techniques and algorithms for visualizing data, including multivariate data, networks, and maps.
3. practical experience in the creation and evaluation of visualizations.

The course calls for students who are interested in using data visualization in their work as well as students who develop visualization tools and systems. Basic knowledge and willingness to learn of graphics/visualization tools (e.g., D3) and data analysis tools (e.g., R) are helpful.

In addition to participating in discussions in class, students must complete several short programming and data analysis tasks as well as a final project. Students are expected to submit the results of the project in the form of a conference paper.

Please note that the course does not include exploratory approaches to the discovery of data. Instead, the course focuses on how data is visually encoded and presented to an audience after the structure of the data and its content is known.

Interactive Data Visualization for the Web, 2nd Edition. Scott Murray, O'Reilly Press. 2017. 

Yau, Nathan: Visualize This: The FlowingData Guide to Design, Visualization, and Statistics. Wiley Publishing, Inc. 2011.

Spence, Robert: Information Visualization: Design for Interaction. Pearson. 2007.

https://www.mi.fu-berlin.de/inf/groups/hcc/teaching/winter_term_2018-19/course_data_visualization

Goal:

After this course the students

• have a deep understanding of design principles of security protocols and security infrastructures.
• have knowledge of the basic security goals in cryptography and its relevance to practical use cases.
• understand, in which way well-known security protocols (TLS, PACE, EAC) achieve the security goals.
• understand the key topics of the wide-spread security infrastructure standards and apply them to practical tasks.
• are able to choose suitable protocols for a given use case.
• can evaluate the security properties of security protocols and infrastructures.

Content:   

• Security goals (CIA)
• Network security protocols (TLS)
• Security protocols for electronic ID cards
• Abstract Syntax Notation 1 (ASN.1)
• Certificates and related standards X.509/RFC5280
• Public Key Cryptography Standard Series
• Certificate-based security infrastructures (PKI)
• Practical and theoretical solutions to exercises

We will study the history, technology and applications of cryptocurrencies and blockchain. This course will be organised as a 4h lecture during the first half of the semester and a project during the second half of the semester.

Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

Secure software engineering joins two important fields: Software engineering and information security. software engineering is the systematic use of principles, methods and tools to develop and deploy software. information security covers topics like confidentiality, integrity and availability of informations and data.

- Claudia Eckert: IT-Sicherheit, 9. Auflage, De Gruyter Oldenbourg, 2014; - Ross Anderson: Security Engineering, 2. Auflage, Wiley, 2008. Weitere Literaturhinweise werden zu den einzelnen Themenblöcken bereitgestellt.

The goal of this lecture is to teach principles, methods and tools for the development of secure software applications. To this end, basic concepts are first introduced. This is followed by process models for developing secure software and evaluating the maturity of development processes. Along the phases or process groups of software development, central principles, methods and tools are then introduced and explained. Special attention is given to threat and risk analysis, security requirements, principles and patterns for designing secure software applications, secure and insecure software implementations, security tests and evaluation of the security properties of software applications.

Today's natural use of digital media has only become possible through efficient coding techniques. The lecture will discuss the basic coding techniques entropy coding, quantization, predictive coding, transformation coding, which are the main components of modern image and video codecs. For all the coding techniques discussed, a detailed analysis of the coding efficiency is carried out on the basis of simple signal models. In addition, practical applications in image and video coding will be demonstrated.

The topics covered form the basis for the advanced lecture "Image and Video Coding II: Algorithms and Applications", in which the application of the introduced coding techniques in modern image and video codecs is discussed in detail.

Main topics:

    Lossless coding / entropy coding: unambiguously decodable codes; derivation of different entropy measures as lower limit of the average codeword length; Huffman coding; arithmetic coding

    Rate distortion theory: maximum coding efficiency of lossy methods; information rate distortion function; differential entropy; Shannon limit

    Quantization: scalar quantization with fixed and variable length codes; rate distortion functions for high rates; vector quantization; comparison of different quantizers

    Prediction and predictive coding: linear prediction; prediction gain; quantization in the prediction loop; predictive coding efficiency

    Transformation coding: Structure of transformation coding systems; Unitary block transformations; Bit assignment for transformation coefficients; Optimal transformation for Gaussian processes; Signal-independent transformations; Efficiency of transformation coding

Universal Logical Reasoning (with exemplary applications in Mathematics, Metapyhsics, Ethics, AI and CS).

This lecture is intended to extend the previously awarded lecture "Computational Metaphysics" (SS16, 19323701/2) by further exciting and highly topical application topics.

Students from Computer Science, Mathematics and Philosophy are welcome.

tba

Block course after WS18/19, Feb. 25 - Mar 1, 2019. Pre-discussion/topic assignment early november, tba.

Vorlesung siehe 19328001

As the use of data in research, business and politics become increasingly important, well-designed data visualizations are needed to improve understanding, reduce human memory and support decision-making.

This course aims to familiarize students with the principles, techniques, and algorithms of data visualization.
This course teaches students the basics of the current state of data visualization. At the end of the course, students will have an understanding of the following:

1. essential visualization techniques and theory, including data models, graphical perception and methods for visual coding and interaction.
2. basic techniques and algorithms for visualizing data, including multivariate data, networks, and maps.
3. practical experience in the creation and evaluation of visualizations.

The course calls for students who are interested in using data visualization in their work as well as students who develop visualization tools and systems. Basic knowledge and willingness to learn of graphics/visualization tools (e.g., D3) and data analysis tools (e.g., R) are helpful.

In addition to participating in discussions in class, students must complete several short programming and data analysis tasks as well as a final project. Students are expected to submit the results of the project in the form of a conference paper.

Please note that the course does not include exploratory approaches to the discovery of data. Instead, the course focuses on how data is visually encoded and presented to an audience after the structure of the data and its content is known.

Interactive Data Visualization for the Web, 2nd Edition. Scott Murray, O'Reilly Press. 2017. 

Yau, Nathan: Visualize This: The FlowingData Guide to Design, Visualization, and Statistics. Wiley Publishing, Inc. 2011.

Spence, Robert: Information Visualization: Design for Interaction. Pearson. 2007.

https://www.mi.fu-berlin.de/inf/groups/hcc/teaching/winter_term_2018-19/course_data_visualization

Goal:

After this course the students

• have a deep understanding of design principles of security protocols and security infrastructures.
• have knowledge of the basic security goals in cryptography and its relevance to practical use cases.
• understand, in which way well-known security protocols (TLS, PACE, EAC) achieve the security goals.
• understand the key topics of the wide-spread security infrastructure standards and apply them to practical tasks.
• are able to choose suitable protocols for a given use case.
• can evaluate the security properties of security protocols and infrastructures.

Content:   

• Security goals (CIA)
• Network security protocols (TLS)
• Security protocols for electronic ID cards
• Abstract Syntax Notation 1 (ASN.1)
• Certificates and related standards X.509/RFC5280
• Public Key Cryptography Standard Series
• Certificate-based security infrastructures (PKI)
• Practical and theoretical solutions to exercises

We will study the history, technology and applications of cryptocurrencies and blockchain. This course will be organised as a 4h lecture during the first half of the semester and a project during the second half of the semester.

Bitcoin and Cryptocurrency Technologies: A Comprehensive Introduction, by Arvind Narayanan, Joseph Bonneau, Edward Felten, Andrew Miller, Steven Goldfeder

Secure software engineering joins two important fields: Software engineering and information security. software engineering is the systematic use of principles, methods and tools to develop and deploy software. information security covers topics like confidentiality, integrity and availability of informations and data.

- Claudia Eckert: IT-Sicherheit, 9. Auflage, De Gruyter Oldenbourg, 2014; - Ross Anderson: Security Engineering, 2. Auflage, Wiley, 2008. Weitere Literaturhinweise werden zu den einzelnen Themenblöcken bereitgestellt.

The goal of this lecture is to teach principles, methods and tools for the development of secure software applications. To this end, basic concepts are first introduced. This is followed by process models for developing secure software and evaluating the maturity of development processes. Along the phases or process groups of software development, central principles, methods and tools are then introduced and explained. Special attention is given to threat and risk analysis, security requirements, principles and patterns for designing secure software applications, secure and insecure software implementations, security tests and evaluation of the security properties of software applications.

We will not neglect the theoretical basics of functional programming (lambda calculus, monads, continuations), but one focus of this course is practical application. You will learn how functional devices are implemented in languages such as Scala, Java, and JavaScript and how they are used in frameworks such as streams, futures, distributed analytics, and reactive programming.

The class focuses on topics such as

• general principles of algorithm design,
• network flows,
• number-theoretic algorithms (including the RSA crypto system),
• string matching,
• NP-completeness,
• approximation algorithms for hard problems,
• arithmetic algorithms and circuits, fast fourier transform.

• Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, 2nd Ed. McGraw-Hill 2001
• Kleinberg, Tardos: Algorithm Design Addison-Wesley 2005.

Target audience

All Master and Bachelor students who are interested in algorithms.

Prerequisites

Basic familiarity with the design and analysis of algorithms.

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

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

Universal Logical Reasoning (with exemplary applications in Mathematics, Metapyhsics, Ethics, AI and CS).

This lecture is intended to extend the previously awarded lecture "Computational Metaphysics" (SS16, 19323701/2) by further exciting and highly topical application topics.

Students from Computer Science, Mathematics and Philosophy are welcome.

tba

Block course after WS18/19, Feb. 25 - Mar 1, 2019. Pre-discussion/topic assignment early november, tba.

Vorlesung siehe 19328001

The lecture aims at a deeper understanding of cryptographic algorithms, especially which design criteria have to be considered for the development of secure encryption algorithms. For that purpose we will get to know and evaluate different cryptanalytic methods for symmetrical and asymmetrical encryption techniques – e.g. linear and differential cryptanalysis on block ciphers, correlation attacks on stream ciphers and algorithms to solve the factorization problem and the discrete logarithm problem. Weaknesses in the implementation, e.g. to exploit side-channel attacks, will be discussed only peripherally.

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

Universal Logical Reasoning (with exemplary applications in Mathematics, Metapyhsics, Ethics, AI and CS).

This lecture is intended to extend the previously awarded lecture "Computational Metaphysics" (SS16, 19323701/2) by further exciting and highly topical application topics.

Students from Computer Science, Mathematics and Philosophy are welcome.

tba

Block course after WS18/19, Feb. 25 - Mar 1, 2019. Pre-discussion/topic assignment early november, tba.

Vorlesung siehe 19328001

This course gives an introduction to cryptography and cryptographic key management, as well as an introduction to cryptographic protocols and their application in the field of security in distributed systems. Relevant mathematical tools will be developed accordingly. In addition, the lecture addresses the importance of implementation details in the context of IT system security.

• Jonathan Katz and Yehuda Lindell, Introduction to Modern Cryptography, 2008
• Lindsay N. Childs, A Concrete Introduction to Higher Algebra. Springer Verlag, 1995.
• Johannes Buchmann, Einfuehrung in die Kryptographie. Springer Verlag, 1999.

Weitere noch zu bestimmende Literatur und Primärquellen.

Requirements: Participants must have a good mathematical understanding and good knowledge of computer security and networking.

• propositional logic and mathematical proof techniques
• Boolean formulae und Boolean functions, disjunctive and conjunctive normal form, satisfiability, resolution calculus
• set theory:  sets, relations, equivalence and order relations, functions
• natural numbers, the induction principle, cardinal numbers
• first-order logic und mathematical structures
• combinatorics: counting techniques, binomial coefficents and Stirling numbers, recurrences, pigeon hole principle
• graph theory: graphs and their representations, paths and cycles in graphs, trees

• Christoph Meinel, Martin Mundhenk: Mathematische Grundlagen der Informatik, Teubner; 2. Auflage 2002
• Uwe Schöning: Logik für Informatiker, B.I.-Wissenschaftsverlag; 5. Auflage 2000
• Kenneth H. Rosen: Discrete Mathematics and its Applications, Mc-Graw Hill; 1999
• M. Aigner: Diskrete Mathematk, Vieweg, 5. Auflage 2004

This is the first part of a three semester introduction into the basic mathematical field of Analysis. Differential and integral calculus in a real variable will be covered.
Topics: - 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, Fourier series – ordinary differential equations.

The lecture follows the script Analysis I

Further literatur:

• Blatter, Ch.: Analysis 1. Springer-Verlag. xi+369 S.

• Forster, O.: Analysis 1. Differential- und Integralrechnung einer Veränderlichen. Vieweg. viii+208 S.

• Fritzsche, K.: Grundkurs Analysis 1 - Differentiation und Integration in einer Veränderlichen. Spektrum Verlag. xii+372 S.

Many examples, applications and useful comments can be found in

• Arens, T. , et al.: Mathematik. Heidelberg: Spektrum Akademischer Verlag. 2008. xiv+1496 S.

The following book develops Analysis  using a historical context

• Körle, H.-H.: Die phantastische Geschichte der Analysis. Ihre Probleme und Methoden seit Demokrit und Archimedes. Dazu die Grundbegriffe von heute. Oldenbourg. 2009. xiv+217 S.

Die Vorlesung folgt dem Skript Analysis I

Weitere Literatur:

• Blatter, Ch.: Analysis 1. Springer-Verlag. xi+369 S.

• Forster, O.: Analysis 1. Differential- und Integralrechnung einer Veränderlichen. Vieweg. viii+208 S.

• Fritzsche, K.: Grundkurs Analysis 1 - Differentiation und Integration in einer Veränderlichen. Spektrum Verlag. xii+372 S.

Zahlreiche Beispiele, Anwendungen und nützliche Anmerkungen findet man in

• Arens, T. , et al.: Mathematik. Heidelberg: Spektrum Akademischer Verlag. 2008. xiv+1496 S.

Das folgende Buch entwickelt die Analysis aus dem historischen Kontext

• Körle, H.-H.: Die phantastische Geschichte der Analysis. Ihre Probleme und Methoden seit Demokrit und Archimedes. Dazu die Grundbegriffe von heute. Oldenbourg. 2009. xiv+217 S.

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

Contents:

• number systems: from natural numbers to real numbers, completeness property of the reals
• polynomials: roots of polynomials, polynomial interpolation, rational functions
• special functions:  exponential function, logarithm, trigonometric functions
• complex numbers: exponential function for complex numbers, complex roots
• convergence of sequences and series, convergence of functions, continuous functions, O-notation
• differential calculus: derivative of a function,  interpretations and applications of the derivative
• intergral calculus: primitive functions, definite integrals,  fundamental theorem of calculus, applications
• power series
• basics of stochastics: probability spaces, discrete and continuous random variables, expected value and variance of random variables

• Kurt Meyberg, Peter Vachenauer: Höhere Mathematik 1, Springer-Verlag, 6. Auflage 2001
• Dirk Hachenberger: Mathematik für Informatiker, Pearson 2005
• Peter Hartmann: Mathematik für Informatiker, Vieweg, 4. Auflage 2006
• Thomas Westermann: Mathematik für Ingenieure mit Maple 1, Springer-Verlag, 4. Auflage 2005

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

This is the first part of a three semester introduction into the basic mathematical field of Analysis. Differential and integral calculus in a real variable will be covered.
Topics: - 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, Fourier series – ordinary differential equations.

The lecture follows the script Analysis I

Further literatur:

• Blatter, Ch.: Analysis 1. Springer-Verlag. xi+369 S.

• Forster, O.: Analysis 1. Differential- und Integralrechnung einer Veränderlichen. Vieweg. viii+208 S.

• Fritzsche, K.: Grundkurs Analysis 1 - Differentiation und Integration in einer Veränderlichen. Spektrum Verlag. xii+372 S.

Many examples, applications and useful comments can be found in

• Arens, T. , et al.: Mathematik. Heidelberg: Spektrum Akademischer Verlag. 2008. xiv+1496 S.

The following book develops Analysis  using a historical context

• Körle, H.-H.: Die phantastische Geschichte der Analysis. Ihre Probleme und Methoden seit Demokrit und Archimedes. Dazu die Grundbegriffe von heute. Oldenbourg. 2009. xiv+217 S.

Die Vorlesung folgt dem Skript Analysis I

Weitere Literatur:

• Blatter, Ch.: Analysis 1. Springer-Verlag. xi+369 S.

• Forster, O.: Analysis 1. Differential- und Integralrechnung einer Veränderlichen. Vieweg. viii+208 S.

• Fritzsche, K.: Grundkurs Analysis 1 - Differentiation und Integration in einer Veränderlichen. Spektrum Verlag. xii+372 S.

Zahlreiche Beispiele, Anwendungen und nützliche Anmerkungen findet man in

• Arens, T. , et al.: Mathematik. Heidelberg: Spektrum Akademischer Verlag. 2008. xiv+1496 S.

Das folgende Buch entwickelt die Analysis aus dem historischen Kontext

• Körle, H.-H.: Die phantastische Geschichte der Analysis. Ihre Probleme und Methoden seit Demokrit und Archimedes. Dazu die Grundbegriffe von heute. Oldenbourg. 2009. xiv+217 S.

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

Current topics from the area of medical imaging will be worked on and presented. Amongst these are applications from radiography, computer tomography, nuclear medicine, magnetic resonance tomography, and medical ultrasonics.

Website

http://www.charite.de/medinfo/Studium/wahllehre.php

Target Group

MSc students

Preconditions

Having visited the lecture and tutorial Medical Imaging

Advanced module data visualization and data mining.

Wird bekannt gegeben.

Preliminary discussion date to be announced.

Contents

Advanced topcis in algorithm design with a changing focus. The topic is determined newly in each semester. For example, we might consider algorithms for problems on graphs, such as connectivity, shortest paths, or network flows.

Target audience

Masters students in computer science and mathematics.

Recommended prerequisites

"Advanced algorithms" or a similar class.

Spezialliteratur aus Zeitschriften

Current topics from the area of medical imaging will be worked on and presented. Amongst these are applications from radiography, computer tomography, nuclear medicine, magnetic resonance tomography, and medical ultrasonics.

Website

http://www.charite.de/medinfo/Studium/wahllehre.php

Target Group

MSc students

Preconditions

Having visited the lecture and tutorial Medical Imaging

Advanced module data visualization and data mining.

Wird bekannt gegeben.

Preliminary discussion date to be announced.