The behaviour of complex processing systems is often controlled by large numbers of parameters.  For example, one Thales radar processor has over 2000 adjustable parameters.  Evaluating the performance for each set of parameters is typically time-consuming, involving either simulation or processing of large recorded data sets (or both).  In processing recorded data, the optimum parameters for one data set are unlikely to be optimal for another.

We would be interested in discussing mathematical techniques that could make the process of optimisation more efficient and effective, and what we might learn from a more mathematical approach.

VerdErg Renewable Energy Ltd is developing a new hydropower unit for cost-effective energy generation at very low heads of pressure. The device is called the VETT after the underlying technology – Venturi Enhanced Turbine Technology. Flow into the VETT is split into two. The larger flow at low head transfers its energy to the smaller flow at a greater head. The smaller flow powers a conventional turbo-generator which can be a smaller, faster unit at an order of magnitude lower cost. Further, there are significant environmental benefits to fish and birds compared to the conventional hydropower solution. After several physical model test programmes* in the UK, France and The Netherlands along with CFD studies the efficiency now stands at 50%. We wish to increase that by understanding the major loss mechanisms and how they might be avoided or minimised.

The presentation will explain the VETT’s working principles and key relationships, together with some possible ideas for improvement. The comments of attendees on problem areas, potential solutions and how an enhanced understanding of key phenomena may be applied will be most welcome.

*(One was observed by Prof John Ockendon who identified a fairly extreme flow condition in a region previously thought to be benign.)

A compact space is a Rosenthal compactum if it can be embedded into the space of Baire class 1 functions on a Polish space. Those objects have been well studied in functional analysis and set theory. In this talk, I will explain the link between them and the model-theoretic notion of NIP and how they can be used to prove new results in model theory on the topology of the space of types.
 

NOTE CHANGE OF TIME AND PLACE

It is known by results of Macintyre and Chatzidakis-Hrushovski that the theory ACFA of existentially closed difference fields is decidable. By developing techniques of difference algebraic geometry, we view quantifier elimination as an instance of a direct image theorem for Galois formulae on difference schemes. In a context where we restrict ourselves to directly presented difference schemes whose definition only involves algebraic correspondences, we develop a coarser yet effective procedure, resulting in a primitive recursive quantifier elimination. We shall discuss various algebraic applications of Galois stratification and connections to fields with Frobenius.

I will speak about weak Fano 3-folds, K3 surfaces and their Picard lattices, and explain how to solve the matching problem in various situations

Motivated by the study of supersymmetric backgrounds with non-trivial fluxes, we provide a formulation of supergravity in the language of generalised geometry, as first introduced by Hitchin, and its extensions. This description both dramatically simplifies the equations of the theory by making the hidden symmetries manifest, and writes the bosonic sector geometrically as a direct analogue of Einstein gravity. Further, a natural analogue of special holonomy manifolds emerges and coincides with the conditions for supersymmetric backgrounds with flux, thus formulating these systems as integrable geometric structures.
 

Dellamonica, Kohayakawa, Rödl and Ruciński showed that for $p=C(\log n/n)^{1/d}$ the random graph $G(n,p)$ contains asymptotically almost surely all spanning graphs $H$ with maximum degree $d$ as subgraphs. In this talk I will discuss a resilience version of this result, which shows that for the same edge density, even if a $(1/k-\epsilon)$-fraction of the edges at every vertex is deleted adversarially from $G(n,p)$, the resulting graph continues to contain asymptotically almost surely all spanning $H$ with maximum degree $d$, with sublinear bandwidth and with at least $C \max\{p^{-2},p^{-1}\log n\}$ vertices not in triangles. Neither the restriction on the bandwidth, nor the condition that not all vertices are allowed to be in triangles can be removed. The proof uses a sparse version of the Blow-Up Lemma. Joint work with Peter Allen, Julia Ehrenmüller, Anusch Taraz.