Mesoscale processes in the atmosphere refer to the atmospheric processes that take place within a scale of a few to several hundred kilometres. Atmospheric phenomena like thunderstorms, inertia-gravity waves, jet streaks, ...
A Cuntz-Pimsner algebra is a quotient of a generalized Toeplitz algebra. It is
completely determined by a C*-correspondence, which consists of a right Hilbert A-
module, E, and a *-homomorphism from the C*-algebra A into ...
For many matrix algebras, every associative automorphism is inner. We discuss results by Đoković that a non-associative Lie automorphism φ of a triangular matrix algebra Tₙ over a connected unital commutative ring, is of ...
In this dissertation, we consider a generalization of the historically significant problem posed in 1850 by Reverend Thomas Kirkman which asked whether it was possible for 15 schoolgirls to walk in lines of three to school ...
Human induced pluripotent stem cells (hiPSCs) have two main properties: pluripotency
and self-renewal. Physical cues presented by biomaterial scaffolds can stimulate
differentiation of hiPSCs to neurons. In this work, ...
We study a nonlinear kinetic model describing the interactions of particles in a granular medium, i.e. inelastic systems where kinetic energy is not conserved due to internal friction. Examples of particles that fall into ...
We propose a mathematical procedure to derive a stochastic parameterization for the bulk warm cloud micro-physical properties of collision and coalescence. Unlike previous bulk parameterizations, the stochastic parameterization ...
The following new results concerning 1-factorizations of the complete graph are proved: (1) There are exactly 6 equivalence classes of 1-factorizations of the complete graph with 8 vertices. (2). There are exactly 396 ...
We apply anisotropic Banach space methods together with operator renewal theory to obtain polynomial rates of decay of correlations for a class of generalized baker's transformations. The polynomial rates were proved for ...
We introduce new methods based on the L2 Optimal Transport (OT) problem
and the Navier-Stokes equations to approximate a fluid velocity field from images
obtained with Particle Image Velocimetry (PIV) measurements. The ...
Historically, artificial neural networks have been loosely defined as biologically inspired computational models. When deciding what sort of network to use for a given task there are two things that need to be considered. ...
Interval graphs admit elegant ordering and structural characterizations. A natural digraph analogue of interval graphs, called chronological interval digraphs, has recently been identified and studied.
We introduce ...
Let G be a graph and f be a function that maps V to {0,1,2, ..., diam(G)}.
Let V+ be the set of all vertices such that f(v) is positive.
If for every vertex v not in V+ there exists a vertex w in V+ such that
the ...
A mixed graph is a simple graph in which a subset of the edges have been assigned directions to form arcs. For non-negative integers j and k, a (j, k)−mixed graph is a mixed graph with j types of arcs and k types of edges. ...
Recent advances in technology for brain imaging and high-throughput genotyping have motivated studies examining the influence of genetic variation on brain structure. In this setting, high-dimensional regression for multi-SNP ...
Brain decoding involves the determination of a subject’s cognitive state or an associated stimulus from functional neuroimaging data measuring brain activity. In this setting the cognitive state is typically characterized ...
Optimal design problems aim at selecting design points optimally with respect to certain
statistical criteria. The research of this thesis focuses on optimal design problems with
respect to A-, D- and E-optimal criteria, ...
Many models in the physical and life sciences formulated as dynamical systems
have a positive steady state, with the local behavior of this steady state determined
by the eigenvalues of its Jacobian matrix. The rest ...
Given a graph G=(V,E), a vertex ordering of G is a total order v1,v2,...,vn of V. A graph search algorithm is a systematic method for visiting each vertex in a graph, naturally producing a vertex ordering of the graph. We ...
The Kari-Culik tilings are formed from a set of 13 Wang tiles that tile the plane
only aperiodically. They are the smallest known set of Wang tiles to do so and are not as well understood as other examples of aperiodic ...