Three Minute Thesis & Research Presentations.

Transcription

1 Three Minute Thesis & Research Presentations

2 Ludovica Luisa Vissat

3 Modelling and analysis of spatial stochastic systems Case-study: disease spread Average infected population Probability of an epidemic Control of the epidemic Observations Model Prediction Analysis Ludovica Luisa Vissat

4 Sorcha Gilroy

5 Sorcha Gilroy

6 Ian Simpson

7 Data Connections for the Brain HUMAN BRAIN 86 billion neurons >100 trillion connections MENTAL HEALTH $5 billion per year 500 million affected PHARMACEUTICALS $3 billion each >10 years to develop >90% failure rate

8 Hakan Bilen

9 Hakan Bilen - IPAB Computer vision: a machine vs human perspective A success story (machine>human) Limitation 1: require annotations {motorbike,person} 3 sec sec sec object classification Australian terrier identification S. Stallone lip reading afternoon Weakly supervised learning Limitation 2: only good in one task CNN C L x + Deep net Deep net Deep net Deep net Deep net Unsupervised learning Multi-task and multi-domain learning C1 C2 Learnet

10 He Sun

11 Efficient Algorithms for Massive Graphs 50 times every decade Algorithms that run as fast as the time needed to read an entire graph that work for processing dynamic and streaming dataset Efficient data representation and summarisation Relations between graphs, matrices and manifolds Foundations Dynamic algorithms for learning and vision problems, e.g. online video segmentation Algorithmic libraries for spectral algorithms Applications He Sun

12 Stefano Albrecht

13 Multi-Agent Interaction Autonomous cars Home assistance Multi-player gaming Multi-robot rescue User interfaces Robot football Stefano Albrecht

14 Dorota Glowacka

15 Same Interface Different Search Results Dorota Glowacka

16 Vassilis Zikas

17 Vassilis Zikas Sr. Lecturer in Security & Privacy, Vice-director, Blockchain Technology Lab About Me: PhD Postdoc Simons Fellow Asst. Prof My Research: Secure Multi-Party Computation (MPC) & Distributed Computation How can we decentralize security sensitive services? Removing the trusted party in: E-auctions, E-voting, E-exchanges, Eliminating Single Points of Failure: identification, key-management Blockchains & Cryptocurrencies Foundations Applications Rational Cryptography Privacy preserving computation Distributed learning on private data Privacy in voting mechanisms Quantum Cryptography

18 Markulf Kohlweiss

19 TWO VISIONS FOR CYBER SECURITY AND PRIVACY Formal verification of core protocols Key-exchange, Secure Messaging, TLS, F* State-separating Game-based Proofs Data (de-)anonymiation Differential privacy Data-ethics Privacy on the blockchain Zero-knowledge proofs and SNARKs Trusted setups using an Updateable CRS Privacy-enhancing protocols Applied MPC Anonymous communication Markulf Kohlweiss Snark

20 Heng Guo

21 Computational counting and sampling My research focus: (theory of) computational counting and sampling. Include: computing marginal probabilities and/or expectations of random variables from complicated statistical models. Recent highlights: Rapid mixing of random cluster dynamics [G. and Jerrum 17] First rigorous analysis of the Swendsen and Wang ( 87) algorithm (widely applied, 3000 citations). Confirms a conjecture of Sokal and Peres. Partial rejection sampling [G., Jerrum, Liu 17] Linking the classical Lovász local lemma with sampling problems. First polynomial-time approximation for network reliability (open since 83, confirms a conjecture of Welsh) [G. and Jerrum 18]. Heng Guo

22 Arno Onken

23 Multiple Scales Probabilistic Models Tensor Decompositions Activity Decoders Activity Patterns Arno Onken

24 Rico Sennrich

25 Rico Sennrich