C4

It is often difficult to include sufficient biological detail when modelling cell population growth to make models with real predictive power. Continuum models often fail to capture physical and chemical processes happening at the level of individual cells and discrete cell-based models are often very computationally expensive to solve. In the first part of this talk, I will describe a phenomenological continuum model of cell aggregate growth in a specific perfusion bioreactor cell culture system, and the results of numerical simulations of the model to determine the effects of the bioreactor operating conditions and cell seeding on the growth. In the second part of the talk, I will introduce a modelling approach used to derive continuum models for cell population growth from discrete cell-based models, and consider possible extensions to this framework.

JH: Water filtration systems typically involve flow along a channel with permeable walls and suction applied across the wall. In this ``cross-flow'' arrangement, clean water leaves the channel while impurities remain within it. A limiting factor for the operation of cross-flow devices is the build-up of a high concentration of particles near the wall due to the induced flow. Termed concentration polarization (CP), this effect ultimately leads to the blocking of pores within the permeable wall and the deposition of a ``cake'' on the wall surface. Here we show that, through strategic choices in the spatial variations of the channel-wall permeability, we may reduce the effects of CP by allowing diffusion to smear out any build up of particles that may occur. We demonstrate that, for certain classes of variable permeability, there exist optimal choices that maximize the flux of clean water out of a device.

\\

IvG: TBC

Berz used the Hahn-Banach Theorem over Q to prove that the graph of a measurable subadditive function that is non-negatively Q-homogeneous consists of two lines through the origin. I will give a proof using the density topology and Steinhaus’ Sum-set Theorem. This dualizes to a much simpler category version: a `Baire-Berz Theorem’. I will give the broader picture of this using F. Burton Jones’ analysis of additivity versus linearity. Shift-compactness and special subsets of R will be an inevitable ingredient. The talk draws on recent work with Nick Bingham and separately with Harry I. Miller.

Data assimilation is a particular form of state estimation. That's partly the "what". We'll also look at the how's, the why's, some who's and some where's.

In the first JAM seminar of 2013/2014, I will discuss the topic of singular perturbed hyperbolic systems of PDE arising in physical phenomena, particularly the St Venant equations of shallow water theory. Using a mixture of analytical and numerical techniques, I will demonstrate the dangers of approximating the dynamics of a system by the equations obtained upon taking a singular limit $\epsilon\rightarrow 0$ and furthermore how the dynamics of the system change when the parameter $\epsilon$ is taken to be small but finite. Problems of this type are ubiquitous in the physical sciences, and I intend to motivate another example arising in elastoplasticity, the subject of my DPhil study.

\\

\\

Note: This seminar is not intended for faculty members, and is available only to current undergraduate and graduate students.

Let $G$ be an addable minor-closed class of graphs. We prove that a zero-one law holds in monadic second-order logic (MSO) for connected graphs in G, and a convergence law in MSO for all graphs in $G$. For each surface $S$, we prove the existence of a zero-one law in first order logic (FO) for connected graphs embeddable in $S$, and a convergence law in FO for all graphs embeddable in $S$. Moreover, the limiting probability that a given FO sentence is satisfied is independent of the surface $S$. If $G$ is an addable minor-closed class, we prove that the closure of the set of limiting probabilities is a finite union of intervals, and it is the same for FO and MSO. For the class of planar graphs it consists of exactly 108 intervals. We give examples of non-addable classes where the results are quite different: for instance, the zero-one law does not hold for caterpillars, even in FO. This is joint work with Peter Heinig, Tobias Müller and Anusch Taraz.