Suche
Anzeige der Dokumente 21-30 von 49
Buch
Stochastische Simulation von Zufallsexperimenten mit Fathom
(Franzbecker, Hildesheim, 2010)
In der Mathematikdidaktik gibt es die weit verbreitete Auffassung, durch die Verwendung von Simulationen Lernprozesse zu unterstützen. Dies hat mich im Rahmen meiner Dissertation dazu bewogen, erstens eine Werkzeuganalyse des Simulationspotentials der Software Fathom durchzuführen und zweitens exemplarische Analysen dazu, wie Lernende mit der Software arbeiten.
Bei der Werkzeuganalyse standen vor allem folgende zwei Fragen im Mittelpunkt: Was bietet die Software an Simulationspotential? Wie gut und leicht lassen ...
Preprint
On Solution Sets of Information Inequalities
(2011)
We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce important properties of Bayesian networks, which is important within causal inference.
Dissertation
Free Resolutions from Involutive Bases
(2016-11-02)
We show that the theory of involutive bases can be combined with discrete algebraic Morse Theory. For a graded k[x0 ...,xn]-module M, this yields a free resolution G, which in general is not minimal. We see that G is isomorphic to the resolution induced by an involutive basis. It is possible to identify involutive bases inside the resolution G. The shape of G is given by a concrete description. Regarding the differential dG, several rules are established for its computation, which are based on the fact that in the ...
Habilitation
Applicability of ordinal-array-based indicators to strange nonchaotic attractors
(Universität Kassel, 2017-06-12)
Time series are useful for modeling systems behavior, for predicting some events (catastrophes, epidemics, weather, ...) or for classification purposes (pattern recognition, pattern analysis). Among the existing data analysis algorithms, ordinal pattern based algorithms have been shown effective when dealing with simulation data. However, when applied to quasi-periodically forced systems, they fail to detect SNA and tori as regular dynamics. In this work we address this concern by defining ordinal array (OA) based ...
Aufsatz
The Impact of Visualizing Nested Sets. An Empirical Study on Tree Diagrams and Unit Squares
(2017-01-06)
It is an ongoing debate, what properties of visualizations increase people’s performance when solving Bayesian reasoning tasks. In the discussion of the properties of two visualizations, i.e., the tree diagram and the unit square, we emphasize how both visualizations make relevant subset relations transparent. Actually, the unit square with natural frequencies reveals the subset relation that is essential for the Bayes’ rule in a numerical and geometrical way whereas the tree diagram with natural frequencies does it ...
Preprint
Characterization theorem for classical orthogonal polynomials on non-uniform lattices: The functional approach
(2010)
Using the functional approach, we state and prove a characterization theorem for classical orthogonal polynomials on non-uniform lattices (quadratic lattices of a discrete or a q-discrete variable) including the Askey-Wilson polynomials. This theorem proves the equivalence between seven characterization properties, namely the Pearson equation for the linear functional, the second-order divided-difference equation, the orthogonality of the derivatives, the Rodrigues formula, two types of structure relations,and the ...
Preprint
On the relationship between the Method of Least Squares and Gram-Schmidt orthogonalization
(2010)
The method of Least Squares is due to Carl Friedrich Gauss. The Gram-Schmidt
orthogonalization method is of much younger date. A method for solving Least Squares Problems is developed which automatically results in the appearance of the Gram-Schmidt orthogonalizers. Given these orthogonalizers an induction-proof is available for solving Least Squares Problems.
Dissertation
Deterministic Genericity and the Computation of homological Invariants
(2016-08-10)
The main goal of this thesis is to discuss the determination of homological invariants of polynomial ideals. Thereby we consider different coordinate systems and analyze their meaning for the computation of certain invariants. In particular,
we provide an algorithm that transforms any ideal into strongly stable position if char k = 0. With a slight modification, this algorithm can also be used to achieve a stable or quasi-stable position. If our field has positive characteristic, the Borel-fixed position is the ...
Dissertation
Harmonische Funktionen auf dem Bruhat-Tits-Gebäude der PGL_3 über Funktionenkörpern
(2016-05-09)
Harmonische Funktionen auf dem Bruhat-Tits-Gebäude der PGL(3) über Funktionenkörpern lassen sich als ein Analogon zu den auf der oberen Halbebene definierten klassischen Spitzenformen verstehen. An die Stelle des starken Abklingens der Spitzenformen tritt hier die Endlichkeit des Trägers modulo einer gewissen Untergruppe. Der erste Teil der vorliegenden Arbeit befaßt sich mit der Untersuchung und Charakterisierung dieses Trägers. Im weiteren Verlauf werden gewisse Konzepte der klassischen Theorie auf harmonische ...
Dissertation
Modulsymbole und Bruhat-Tits-Gebäude der PGL(3) über Funktionenkörpern
(2015-01-21)
Thema der vorliegenden Arbeit ist die Bestimmung von Basen von Räumen spezieller harmonischer 2-Koketten auf Bruhat-Tits-Gebäuden der PGL(3) über Funktionenkörpern. Hierzu wird der Raum der speziellen harmonischen 2-Koketten auf dem Bruhat-Tits-Gebäude der PGL(3) zunächst mit gewissen komplexen Linearkombinationen von 2-Simplizes des Quotientenkomplexes, sogenannten geschlossenen Flächen, identifiziert und anschließend durch verallgemeinerte Modulsymbole beschrieben. Die Darstellung der Gruppe der Modulsymbole durch ...