C3

Numerous mathematical models have been proposed for modelling cancerous tumour invasion (Gatenby and Gawlinski 1996), angiogenesis (Owen et al 2008), growth kinetics (Wang et al 2009), response to irradiation (Gao et al 2013) and metastasis (Qiam and Akcay 2018). In this study, we attempt to model the qualitative behavior of growth, invasion, angiogenesis and fragmentation of tumours at the tissue level in an explicitly spatial and continuous manner in two dimensions. We simulate the effectiveness of radiation therapy on a growing tumour in comparison with immunotherapy and propose a novel framework based on vector fields for modelling the impact of interstitial flow on tumour morphology. The results of this model demonstrate the effectiveness of employing a system of partial differential equations along with vector fields for simulating tumour fragmentation and that immunotherapy, when applicable, is substantially more effective than radiation therapy.

C*-algebras constructed from topological groupoids allow us to study many interesting and a priori very different constructions
of C*-algebras in a common framework. Moreover, they are general enough to appear intrinsically in the theory. In particular, it was recently shown
by Xin Li that all C*-algebras falling within the scope of the classification program admit (twisted) groupoid models.
In this talk I will give a gentle introduction to this class of C*-algebras and discuss some of their structural properties, which appear in connection
with the classification program.
 

A particularly active area of research in modern algebraic number theory is the study of a class of numbers, called periods. In their simplest form, periods are integrals of rational functions over domains defined by rational in equations. They form a ring, which encompasses all algebraic numbers, logarithms thereof and \pi. They arise in the study of modular forms, cohomology and quantum field theory, and conjecturally have a sort of Galois theory.

We will take a whirlwind tour of these numbers, before discussing non-periods. In particular, we will sketch the construction of an explicit non-period, often forgotten about.

We study the stability properties of the Eulerian mean flow generated by monochromatic surface-gravity waves propagating in a rotating frame. The wave averaged equations, also known as the Craik-Leibovich equations, govern the evolution of the mean flow. For propagating waves in a rotating frame these equations admit a steady depth-dependent base flow sometimes called the Ekman-Stokes spiral, because of its resemblance to the standard Ekman spiral. This base flow profile is controlled by two non-dimensional numbers, the Ekman number Ek and the Rossby number Ro. We show that this steady laminar velocity profile is linearly unstable above a critical Rossby number Roc(Ek). We determine the threshold Rossby number as a function of Ek using a numerical eigenvalue solver, before confirming the numerical results through asymptotic expansions in the large/low Ek limit. These were also confirmed by nonlinear simulations of the Craik-Leibovich equations. When the system is well above the linear instability threshold, Ro >> Roc, the resulting flow fluctuates chaotically. We will discuss the possible implications in an oceanographic context, as well as for laboratory experiments.

Automatic structures are algebraic structures, such as graphs, groups
and partial orders, that can be presented by automata. By varying the 
classes of automata (e.g. finite automata, tree automata, omega-automata) 
one varies the classes of automatic structures. The class of all automatic 
structures is robust in the sense that it is closed under many natural
algebraic and model-theoretic operations.  
In this talk, we give formal definitions to 
automatic structures, motivate the study, present many examples, and
explain several fundamental theorems.  Some results in the area
are deeply connected  with algebra, additive combinatorics, set theory, 
and complexity theory. 
We then motivate and pose several important  unresolved questions in the
area.

In a robust decision, we are pessimistic toward our decision making when the probability measure is unknown. In particular, we optimise our decision under the worst case scenario (e.g. via value at risk or expected shortfall).  On the other hand, most theories in reinforcement learning (e.g. UCB or epsilon-greedy algorithm) tell us to be more optimistic in order to encourage learning. These two approaches produce an apparent contradict in decision making. This raises a natural question. How should we make decisions, given they will affect our short-term outcomes, and information available in the future?

In this talk, I will discuss this phenomenon through the classical multi-armed bandit problem which is known to be solved via Gittins' index theory under the setting of risk (i.e. when the probability measure is fixed). By extending this result to an uncertainty setting, we can show that it is possible to take into account both uncertainty and learning for a future benefit at the same time. This can be done by extending a consistent nonlinear expectation  (i.e. nonlinear expectation with tower property) through multiple filtrations.

At the end of the talk, I will present numerical results which illustrate how we can control our level of exploration and exploitation in our decision based on some parameters.
 

Multiple scales analysis is a powerful asymptotic technique for problems where the solution depends on two scales of widely different sizes. Standard multiple scales involves the introduction of a macroscale and microscale which are assumed to be independent. A common (and usually acceptable) assumption is that when considering behaviour on the microscale, the macroscale variable can be taken as constant, however there are instances where this assumption is not valid. In this talk, I will explain one such situation, that is, when considering conductive-radiative thermal transfer within a solid matrix with spherical perforations and discuss the appropriate measures when converting the radiative boundary condition into multiple-scales form.
 

The time bottleneck in the manufacturing process of Besi (company involved in ESGI 149 Innsbruck) is the extraction of undamaged dies from a component wafer. The easiest way for them to speed up this process is to reduce the number of 'selections' made by the robotic arm.  Each 'selection' made by this robotic arm can be thought of as choosing a 2x2 submatix of a large binary matrix, and editing the 1's in this submatrix to be 0's.  The quesiton is: what is the fewest number of 2x2 submatrices required to cover the full matrix, and how can we find this number. This problem can be solved exactly using integer programming methods, although this approach proves to be prohibitively expensive for realistic sizes. In this talk I will describe the approach taken by my team at EGSI 149, as well as directions for further improvement.

I plan to present a brief introduction to optimal control theory (no background knowledge assumed), and discuss a fascinating and oft-forgotten family of problems where the optimal control behaves very strangely; it changes state infinitely often in finite time. This causes havoc in practice, and even more so in the literature.