Simon Fraser University

Many problems in science and engineering are described in terms of equilibrium shapes on which certain conditions are imposed and which separate regions where the solution may have different properties. A prototypical problem of this type involves...

Adaptive time stepping methods for meta-stable dynamics of the Allen Cahn and Cahn Hilliard equations are investigated in the spatially continuous, semi-discrete setting. Predicted behaviour of the number of time steps with specified local error...

We are faced with a flood of molecular and clinical data. We are measuring interactions between various bio-molecules in a cell that form large, complex systems. Patient omics datasets are also increasingly becoming available. These systems-level...

The Winter 2018 SFU/UBC Joint Seminar is the second of two seminars taking place in the 2017/2018 school year between the UBC department of Statistics and the SFU department of Statistics and Actuarial Science. It is intended to give graduate...

Computational modelling can be used to reveal insights into the mechanisms of new drugs and to develop new diagnostic tools. Here I will discuss three major diseases: diabetes, hypertension, and autism. I will talk about how we construct models to...

What is a game? Mathematically speaking, a game has players, strategies and scores to explain why the players win or lose. Games which are modelled with differential equations are called differential games. Common examples are pursuit-evasion games...

This is the second of a two-part talk. In talk one, I will review various well-known algorithms for integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, FFT multiplication, and the Schoenhage-Strassen algorithm. The...

Integer programming is one of the most fundamental problems in discrete optimization. While integer programming is computationally hard in general, there exist efficient algorithms for special instances. In particular, integer programming is fixed...

Let G=(V,E) be an undirected graph on n vertices and λ:E →2^N a mapping that assigns to every edge a non-empty set of positive integer labels. These labels can be seen as discrete times when the edge is present. Such a labeled graph G'=(G,λ) is said...