School Seminar: Efficient Privacy Preserving Data Mining via Secure Computation by Dr Changyu Dong

The School of Computer Science welcomes the opportunity to hear from Dr Changyu Dong, from the Department of Computer and Information Sciences University of Strathclyde, who will be delivering his talk on ‘Efficient Privacy Preserving Data Mining via Secure Computation’. Chanyu Dong

Abstract: Loosely speaking, secure computation allows parties to compute a function jointly while keeping their inputs private. Participants of secure computation learns only the output of the function, but nothing about the others’ private inputs. An oblivious application of secure computation is privacy preserving data mining. Imagine a scenario in which Amazon and Facebook want to find correlations between their users’ activities. With current technology, this cannot happen because none of the companies is willing to disclose its own data to the other. Secure computation can remove this barrier because data remains private during  and after the computation. In the past, secure computation is considered to be only theoretical because of its inefficiency. Recently much effort has been made to make secure computation practical. In this talk, I will present some recent advancements in this area. I will first introduce Private Set Intersection (PSI), an important secure computation primitive, and how it can be realised efficiently. I will show how PSI can be applied to linking record in databases (private record linkage) and finding association rules. I will then show how fully homomorphic encryption, an emerging cryptographic technology, can be used in building efficient secure computation protocols, and in turn be used for privacy preserving data mining.

Bio: Changyu Dong is a lecturer at the University of Strathclyde. He obtained his PhD from the Department of Computing at Imperial College London in 2009. His research is in cyber security, specifically in applied cryptography. Since 2006, He has published 27 research papers in major journals and international conferences, including the most prestigious venues in security such as ACM CCS, ESORICS and Journal of Computer Security. He has served on and chaired program committees for many conferences and workshops, and is a regular invited reviewer for top international journals including Journal of Computer Security, IEEE Transactions on Dependable and Secure Computing and IEEE Transactions on Information Forensics and Security. Shortly after moving to Strathclyde in 2011, he started his research on efficient secure computation. This research direction has led to some breakthroughs in secure computing for Private Set Intersection and Private Information Retrieval protocols, which he applied in domains such as data mining.

Event details

  • When: 1st July 2015 14:00 - 15:00
  • Where: Cole 1.33a
  • Series: School Seminar Series
  • Format: Seminar

Computer Science Distinguished Lectures 2015

Earlier this month Prof. Mothy Roscoe from ETH Zürich delivered the first set of distinguished lectures for 2015 in the Byre Theatre. The three highly accessible, well attended and engaging lectures centred around the question “What’s happening to computer hardware, and what does it mean for systems software?”

dls1

dls2

Images courtesy of Saleem Bhatti

Type-driven Verification of Communicating Systems in Idris

Speaker: Edwin Brady

Abstract: Idris (http://idris-lang.org/) is a general-purpose programming language with an expressive type system which allows a programmer to state properties of a program precisely in its type. Type checking is equivalent to formally and mechanically checking a program’s correctness. Introductory examples of programs verified in this way typically involve length preserving operations on lists, or ordering invariants on sorting.

Realistically, though, programming is not so simple: programs interact with users, communicate over networks, manipulate state, deal with erroneous input, and so on. In this talk I will give an introduction to programming in Idris, with demonstrations, and show how its advanced type systems allows us to express such interactions precisely. I will show how it supports verification of stateful and communicating systems, in particular giving an example showing how to verify properties of concurrent communicating systems.

Bio: Edwin Brady is a Lecturer in Computer Science at the University of St Andrews. His research interests include programming language design, in particular type systems and domain specific languages. He leads the design and implementation of the Idris programming language, a general purpose functional programming language with dependent types, which he uses to implement verified domain specific languages. When he’s not doing that, he’s likely to be playing a game of Go, wrestling with the crossword, or stuck on a train somewhere.

 

Event details

  • When: 7th April 2015 14:00 - 15:00
  • Where: Cole 1.33a
  • Series: School Seminar Series
  • Format: Seminar

School Seminars: Building the News Search Engine – Bloomberg

Building the news search engine, by Ramkumar Aiyengar, Bloomberg
Abstract:
This talk provides an insight into the challenges involved in providing near real-time news search to Bloomberg customers. Our News team is in the process of migrating to using Solr/Lucene as its search and alerting backend. This talk starts with a picture of what’s involved in building such a backend, then delves into what makes up a search engine, and then discusses the challenges of scaling up for low-latency and high-load.
Bio:
Ramkumar leads the News Search backend team at the Bloomberg R&D office in London. He joined Bloomberg from his university in India and has been with the News R&D team for 7 years now. For the last couple of years, his team has focussed on rewriting almost the entire search/alert backend, used by almost every Bloomberg user to get near-real time access to news with sub-second latencies. A geek at heart, he considers himself a Linux evangelist, an open source enthusiast, and one of those weird creatures who believes that Emacs is an operating system and had once got his music player and playlists to be controlled through a library written in Lisp.

Event details

  • When: 3rd March 2015 14:00 - 15:00
  • Where: Cole 1.33
  • Series: CS Colloquia Series, School Seminar Series
  • Format: Seminar, Talk

What’s happening to computer hardware, and what does it mean for systems software?

Mothy RoscoeThe first set of Computer Science Distinguished Lectures in 2015 will
be given by Prof Mothy Roscoe of ETH Zurich, 09:15–15:30 on Thursday 2nd April
in the Byre Theatre.

Computer systems are not what they used to be, and the days when a
machine could be described as a processor, some memory, and some I/O
devices are long gone. Modern machines, from Systems-on-a-Chip in
phones to rack-scale data appliances, are themselves complex networks
of heterogeneous processing elements, different kinds of memory, and
diverse communication links.
Continue reading

Event details

  • When: 2nd April 2015 09:15 - 15:30
  • Where: St Andrews
  • Series: Distinguished Lectures Series
  • Format: Distinguished lecture

School Seminar Series: Matching in Practice: Junior Doctor Allocation and Kidney Exchange

Matching in Practice: Junior Doctor Allocation and Kidney Exchange by Dr. David Manlove

Abstract:
Matching problems typically involve assigning agents to commodities, possibly on the basis of ordinal preferences or other metrics. These problems have large-scale applications to centralised matching schemes in many countries and contexts. In this talk I will describe the matching problems featuring in two such schemes in the UK that have involved collaborations between the National Health Service and the University of Glasgow. One of these dealt with the allocation of junior doctors to Scottish hospitals (1999-2012), and the other is concerned with finding kidney exchanges among incompatible donor-patient pairs across the UK (2007-date). In each case I will describe the applications, present the underlying algorithmic problems, outline the computational methods for their solution and give an overview of results arising from real data connected with the matching schemes in recent years.

BIO:
David Manlove is a Senior Lecturer at the School of Computing Science, University of Glasgow, where he has been since 1995. His research interests lie mainly in the field of algorithms and complexity, and include algorithms for matching problems involving preferences. These arise in applications such as the assignment of school leavers to universities, kidney patients to donors and junior doctors to hospitals. He and his colleagues have been involved in collaborations with the NHS in relation to the Scottish Foundation Allocation Scheme (for matching junior doctors to hospitals) and the National Living Donor Kidney Sharing Schemes (for enabling kidney “swaps” between incompatible donor-patient pairs) where optimal matching algorithms developed by him and colleagues have been deployed. He has over 50 publications in this area including his book “Algorithmics of Matching Under Preferences”, published in 2013.

Event details

  • When: 3rd February 2015 14:00 - 15:00
  • Where: Cole 1.33a
  • Series: School Seminar Series
  • Format: Talk

School Seminar Series: Statistically Consistent Estimation and Efficient Inference for Natural Language Parsing

Statistically Consistent Estimation and Efficient Inference for
Natural Language Parsing
By Shay Cohen, University of Edinburgh.

Abstract:
In the past few years, there has been an increased interest in the machinel earning community in spectral algorithms for estimating models with latent variables. Examples include algorithms for estimating mixture of Gaussians or for estimating the parameters of a hidden Markov model.

The EM algorithm has been the mainstay for estimation with latent variables, but because it is guaranteed to converge to a local maximum of the likelihood, it is not a consistent estimator. Spectral algorithms, on the other hand, are often shown to be consistent. They are often more computationally efficient than EM.

In this talk, I am interested in presenting two types for spectral algorithms for latent-variable PCFGs, a model widely used in the NLP community for parsing. One algorithm is for consistent estimation of L-PCFGs, and the other is for efficient inference with L-PCFGs (or PCFGs). Both algorithms are based on linear-algebraic formulation of L-PCFGs and PCFGs.

BIO:
Shay Cohen is a Chancellor’s fellow (assistant professor) at the University of Edinburgh (School of Informatics). Before that, he was a postdoctoral research scientist in the Department of Computer Science at Columbia University, and held an NSF/CRA Computing Innovation Fellowship. He received his B.Sc. and M.Sc. from Tel Aviv University in 2000 and 2004, and his Ph.D. from Carnegie Mellon University in 2011. His research interests span a range of topics in natural language processing and machine learning, with a focus on structured prediction. He is especially interested in developing efficient and scalable parsing algorithms as well as learning algorithms for probabilistic grammars.

Event details

  • When: 21st January 2015 14:00 - 15:00
  • Where: Cole 1.33a
  • Series: School Seminar Series
  • Format: Talk

Distinguished Lecture Series 2014: Luca Cardelli

The 2014 Distinguished Lecture Series took place on Tuesday in Lower College Hall. This year’s speaker Prof Luca Cardelli of Microsoft Research and the University of Oxford, delivered three lectures involving Morphisms of Reaction Networks that Couple Structure to Function.

Slides from the lectures are now available: http://lucacardelli.name/indexTalks.html

Luca pictured in Lower College Hall on Tuesday

Luca pictured in Lower College Hall on Tuesday

Abstract
The mechanisms underlying complex biological systems are routinely represented as networks. Network kinetics is widely studied, and so is the connection between network structure and behavior. But it is the relationships between network structures that can reveal similarity of mechanism.

We define morphisms (mappings) between reaction networks that establish structural connections between them. Some morphisms imply kinetic similarity, and yet their properties can be checked statically on the structure of the networks. In particular we can determine statically that a complex network will emulate a simpler network: it will reproduce its kinetics for all corresponding choices of reaction rates and initial conditions. We use this property to relate the kinetics of many common biological networks of different sizes, also relating them to a fundamental population algorithm. Thus, structural similarity between reaction networks can be revealed by network morphisms, elucidating mechanistic and functional aspects of complex networks in terms of simpler networks.

Tuesday’s Programme:
09:15-09:30 Introduction by Prof Simon Dobson

09:39-10:30 Lecture 1 – Molecular Programming

11:00-12:00 Lecture 2 – The Cell Cycle Switch Computes Approximate Majority

13:30-14:30 Lecture 3 – Morphisms of Chemical Reaction Networks

14:30-15:30 Q & A Session

Image courtesy of Prof Saleem Bhatti

School Seminar: Cloud Platform in Financial Services – Allan Beck, J.P. Morgan

Title: Cloud Platform in Financial Services

Presenter: Allan Beck, Cloud Platform and Strategy Lead from JPMorgan Chase

Abstract: Cloud Computing is revolutionising the delivery of compute services and driving the next generation of web-scale application design. This presents enormous opportunities but also challenges, particularly in heavily regulated sectors such as Financial Services.
Allan Beck, Cloud Platform and Strategy Lead from JPMorgan Chase, will discuss the current approach and challenges to Cloud in Financial Services. This will include an overview of available Cloud services and capabilities, the specific challenges to Cloud in Financial Services (private and public Cloud) and an overview of the next-generation Cloud platform and developer experience at JPMorgan Chase.

Event details

  • When: 18th November 2014 14:00 - 15:00
  • Where: Cole 1.33
  • Series: School Seminar Series
  • Format: Seminar, Talk

Distinguished lecture 2014

The first of this academic year’s distinguished lectures will be given by Prof Luca Cardelli of Microsoft Research and the University of Oxford, 0930–1600 on Tuesday 25 November in Lower College Hall.

Continue reading

Event details

  • When: 25th November 2014 09:15 - 16:00
  • Where: Lower College Hall
  • Series: Distinguished Lectures Series
  • Format: Distinguished lecture, Lecture