08S+08W+09S | 09W | 10S | 10W | 11S | 11W | 12S | 12W | 13S | 13W | 14S | 14W | 15S | 15W | 16S | 16W | 17S | 17W

Winter Term 2017/18, Doctoral School Events
2017-11-17 Doctoral School Seminar (Inst. Mathematik, Heinrichstr. 36, SR 11.33, 14:00—16:30, KFU)
K. Gilette (KFU, advisor G. Plank): Patient-specific Parameterization of Models of Cardiac Electrophysiology 

Abstract: Image-based models of human cardiac electrophysiology (EP) are increasingly relevant as a clinical research tool. However, current clinical EP models typically lack patient-specificity as they mostly rely on generic data, or are simplified to fit within clinical time scales due to a lack of computational efficiency. This work therefore aimed to develop an efficient, clinically-compatible automated workflow for patient-specific parameterization of human cardiac EP models using non-invasive standard ECG recordings. 
This talk presents an initial left-ventricular model used to demonstrate the feasibility of generating patient-specific activation sequences based on measured QRS complexes in non-invasive ECG recordings. The left-ventricular model was then used to further facilitate data-driven clinical EP model parameterization with increasing complexity.

M. Mosshammer (TU, advisor M. Kang): Enumerating cubic graphs on orientable surfaces

Abstract: In recent years there have been various results on enumerating cubic graphs embeddable on orientable surfaces of a certain fixed genus g, e.g. planar graphs. One way to count embeddable graphs is a constructive decomposition resulting in the problem of counting cubic graphs on orientable surfaces. Cubic graphs in turn are enumerated via corresponding maps. However, these methods rely heavily on the fact that g is constant.
In this talk, we introduce new methods on how to enumerate cubic graphs embeddable on orientable surfaces of non-constant genus. We will give estimates on their number and compare the results to the number of general cubic graphs and cubic graphs embeddable on constant genus surfaces. We obtain bounds on g=g(n) for which the asymptotic number of such graphs resembles general cubic graphs or planar cubic graphs.

M. Preischl (TU, advisor R. Tichy): Quasi Monte Carlo methods for PDMP-type risk models

Abstract: We consider a risk process which is governed by a piecewise deterministic Markov process. Analyzing the time of ruin and the surplus prior to ruin, we find an integral equation for which we find a solution via Banach's fixed point theorem. Numerical values are then obtained by quasi-Monte Carlo integration.

2017-01-19 Doctoral School Seminar (Seminarraum 2 des Instituts für Geometrie, Kopernikusgasse 24, 10:30—13:00, TU)
T. Lachmann (TU, advisor C. Aistleitner):
L. Marx (KFU):
S. Dohr (TU, advisor O. Steinbach):
S. Nakato (TU, advisor S. Frisch):