In this lecture, we present  practical and provably
secure (authenticated) key exchange protocol and password
authenticated key exchange protocol, which are based on the
learning with errors problems. These protocols are conceptually
simple and have strong provable security properties.
This type of new constructions were started in 2011-2012.
These protocols are shown indeed practical.  We will explain
that all the existing LWE based key exchanges are variants
of this fundamental design.  In addition, we will explain
some issues with key reuse and how to use the signal function
invented for KE for authentication schemes.

What's the continuous analog of randn?  In recent months I've been exploring such questions with Abdul-Lateef Haji-Ali and other members of the Chebfun team, and Chebfun now has commands randnfun, randnfun2, randnfunsphere, and randnfundisk.  These are based on finite Fourier series with random coefficients, and interesting questions arise in the "white noise" limit as the lengths of the series approaches infinity and as random ODEs become stochastic DEs.    This work is at an early stage and we are grateful for input from stochastic experts at Oxford and elsewhere.

For many applications in science and engineering, the ability to efficiently and accurately approximate solutions to elliptic PDEs dictates what physical phenomena can be simulated numerically.  In this seminar, we present a high-order accurate discretization technique for variable coefficient PDEs with smooth coefficients.  The technique comes with a nested dissection inspired direct solver that scales linearly or nearly linearly with respect to the number of unknowns.  Unlike the application of nested dissection methods to classic discretization techniques, the constant prefactors do not grow with the order of the discretization.  The discretization is robust even for problems with highly oscillatory solutions.  For example, a problem 100 wavelengths in size can be solved to 9 digits of accuracy with 3.7 million unknowns on a desktop computer.  The precomputation of the direct solver takes 6 minutes on a desktop computer.  Then applying the computed solver takes 3 seconds.  The recent application of the algorithm to inverse media scattering also will be presented.

Proteomics is seen as the next logical step after genomics to understand life processes at the molecular level. With increasing capabilities of modern mass spectrometers the deep proteome (>8000 proteins detected) has become widely accessible, only to be replaced recently by the "Ultra-deep proteome" with ~14000 proteins detected in a single cell line. Furthermore, new data search algorithms and sample preparation methods allow not only to achieve comprehensive sequence coverage for the majority of proteins, but also to detect protein variations and single amino acid polymorphisms in proteins, further linking genomic variation to protein phenotypes. The combination of genomic and proteomic information on individual (patient) level could mark the beginning of the "Post-Proteomic Era".

Please register via https://www.eventbrite.co.uk/e/qbiox-colloquium-trinity-term-2017-ticke…