esc

Courses & Seminars

12Courses
4Substitute Lectures
8Theses

Courses

Friedrich-Alexander-UniversitätErlangen-Nürnberg
1×II2×III ∫ Tutorial Analysis II and III Mathematics, '23 – '26.
Blog post
∇ Tutorial Mathematics for Engineers A II and A IV Mathematics, '23 – '26.
3× A― Tutorial Topology Mathematics, '23 – '26.
ℓ2 Tutorial Functional Analysis Mathematics, '25.
∀∃ Course Units Writing Proofs Mathematics, '24.
det Tutorial Linear Algebra I Mathematics, '23.
H∙ Seminar Homological Perspective on Data Computer Science, '21.
Slides
⋈ Seminar New Methods in Data Management Computer Science, '18 – '21.
{xi}i∈I Full Lecture Knowledge Discovery in Databases Computer Science, '20.
Lectures
βk Seminar Topological Data Analysis Computer Science, '20.
Talk
↻ Exercise Classes Process-Oriented Information Systems Computer Science, '18 – '19.
⊑ Exercise Classes Conceptual Modelling Computer Science, '18.

Substitute Lectures

In Place of Kang Li
A A f F 1 −1
Tietze Extension TheoremLet X be a normal space, A⊆X closed and f:A→[−1,1] continuous. Then there is a continuous F:X→[−1,1] with F|A=f.
A B u = 0 u = 1
Urysohn’s LemmaLet X be a normal space and A,B⊆X disjoint and closed. Then there is a continuous u:X→[0,1] with u|A=0 and u|B=1.
In Place of Cathérine Meusburger
x0 ε δ
ContinuityA map f:X→Y of metric spaces is continuous if and only if for all x∈X and ε>0 there is δ>0 with d(f(x),f(x′))<ε whenever d(x,x′)<δ, if and only if f−1(V) is open for every open V⊆Y.
K
CompactnessA subset K⊆Rn is compact, that is, every open cover of K has a finite subcover, if and only if K is closed and bounded.

Knowledge Discovery in Databases

  1. Prologue
  2. Introduction
  3. Data
  4. Preprocessing
  5. OLAP
  6. Frequent Patterns
  7. Classification
  8. Cluster Analysis
  9. Outlier Detection

Supervision

5 Master’s and 3 Bachelor’s theses.

Sensors ECG Gas Sensing Machine Learning Signal Processing

Flash Cards

Algebra Analysis Category Theory Topology Computer Science Languages Handouts