We formulate and solve a generalized inverse Navier–Stokes boundary value problem for velocity field reconstruction and simultaneous boundary segmentation of noisy Flow-MRI velocity images. We use a Bayesian framework that combines CFD, Gaussian processes, adjoint methods, and shape optimization in a unified and rigorous manner.
With this framework, we find the velocity field and flow boundaries (i.e. the digital twin) that are most likely to have produced a given noisy image. We also calculate the posterior covariances of the unknown parameters and thereby deduce the uncertainty in the reconstructed flow. First, we verify this method on synthetic noisy images of flows. Then we apply it to experimental phase contrast magnetic resonance (PC-MRI) images of an axisymmetric flow at low and high SNRs. We show that this method successfully reconstructs and segments the low SNR images, producing noiseless velocity fields that match the high SNR images, using 30 times less data.
This framework also provides additional flow information, such as the pressure field and wall shear stress, accurately and with known error bounds. We demonstrate this further on a 3-D in-vitro flow through a 3D-printed aorta and 3-D in-vivo flow through a carotid artery.

In this lecture, I will discuss the resolution of the Arthur-Barbasch-Vogan conjecture on the unitarity of special unipotent representations for any real form of a connected reductive complex Lie group, with contributions by several groups of authors (Barbasch-Ma-Sun-Zhu, Adams-Arancibia-Mezo, and Adams-Miller-van Leeuwen-Vogan). The main part of the lecture will be on the approach of the first group of authors for the case of real classical groups: counting by coherent families (combinatorial aspect), construction by theta lifting (analytic aspect), and distinguishing by invariants (algebraic-geometric aspect), resulting in a full classification, and with unitarity as a direct consequence of the construction.

I shall present a new flexible method showing that every countable model of PA admits a pointwise definable end-extension, one in which every point is definable without parameters. Also, any model of PA of size at most continuum admits an extension that is Leibnizian, meaning that any two distinct points are separated by some expressible property. Similar results hold in set theory, where one can also achieve V=L in the extension, or indeed any suitable theory holding in an inner model of the original model.

A classic result of Chvatál and Erdős (1972) asserts that, if the vertex-connectivity of a graph G is at least as large as its independence number, then G has a Hamilton cycle. We prove a similar result, implying that a graph G is pancyclic, namely it contains cycles of all lengths between 3 and |G|: we show that if |G| is large and the vertex-connectivity of G is larger than its independence number, then G is pancyclic. This confirms a conjecture of Jackson and Ordaz (1990) for large graphs.