Simon Fraser University

We will discuss properties of solutions to aggregation-diffusion models appearing in many biological models such as cell adhesion, organogenesis and pattern formation. We will concentrate on typical behaviours encountered in systems of these equations...

In many engineering applications governed by PDEs, the parameters of the equations (coefficients, forcing terms, boundary and initial conditions, shape of the domain) are not known exactly but rather affected by a certain degree of uncertainties, and...

In the Kirchoff-Love theory, the vertical displacement of a homogeneous, thin clamped plate under pure bending satisfies the biharmonic equation in a two dimensional domain with Dirichlet boundary conditions (the value and normal derivative are...

The abstract grammatical system of a language both shapes and is shaped by the sounds of the particular words that speakers know. I present GLaPL, a computational model which concurrently learns gradient grammar and gradient word representations...

Uncertainty Quantification (UQ) is an increasingly popular subject in computational science and engineering, that deals with assessing the impact on the PDE solution of the uncertainty on the coefficients of the same PDE. Coefficients here is a term...

Compressive sensing (CS) is a general paradigm that enables us to measure objects (such as images, signals, or functions) by using a number of linear measurements proportional to their sparsity, i.e. to the minimal amount of information needed to...

The aim of this event is to offer graduate students in Statistics and Actuarial Science with an opportunity to attend a seminar with accessible talks providing them an introduction to active areas of research in the field. For three students from...

The stochastic inverse problem of determining probability structures on input parameters for a physics model corresponding to a given probability structure on the output of the model forms the core of scientific inference and engineering design. We...

In this talk we summarize the classification of regular polyhedra and polytopes and extend the concept to that of hypertope: a thin, residually connected incidence geometry. We present the characterization of the automorphism groups of regular...

The CanaDAM conference will bring together researchers from the various disciplines with which discrete and algorithmic mathematics interact. Particular areas of interest are the following: graphs and digraphs, hypergraphs, matroids, ordered sets...