Author: csblog

May 18th, Data Science Seminar Series or “a Summer of V’s”

The Sum­mer of V’s is an excit­ing series of four events on the Four V’s of Data Sci­ence: Vera­city, Vari­ety, Velo­city and Volume. The series is coordin­ated by the new Insti­tute of Data Intens­ive Research at the Uni­ver­sity of St Andrews. How­ever, these events don’t simply tar­get groups in Sci­ence, Medi­cine or the Human­it­ies but instead all three across the Uni­ver­sity. The series aims to take a cross cut­ting theme approach with a few speak­ers present­ing on a shared aspect of data. Our aim is to bal­ance the speak­ers from across the Uni­ver­sity and as a res­ult meet­ings are rel­ev­ant to all dis­cip­lines across the University.

The first event start­s with lunch from 1.30pm on 18th May at the Bell Pet­ti­grew Museum and Bute Lec­ture Theatre A.

To register and for all the details visit the IDIR page

Event details

  • When: 18th May 2015 13:30 - 17:00
  • Where: St Andrews
  • Format: Seminar, Symposium

June 26, Andruid Kerne, The Future of Human Expression: Ideation − Play − Body-based Interaction

Speaker: Andruid Kerne, Texas A&M, USA
Date/Time: 2-3pm June 26, 2015
Location: CS1.33a, University of St Andrews

 

Andruid is research scientist-artist investigating how people experience personal expression, creative ideation, and social engagement. He develops and evaluates expressive interfaces, computational architectures, and distributed systems that support creative processes of knowledge production and interpersonal communication.

For more details see the SACHI page

Event details

  • When: 26th June 2015 14:00 - 15:00
  • Format: Seminar

May 19, Tom Rodden, On lions, impala, and bigraphs: modelling interactions in Ubiquitous Computing.

Speaker: Tom Rodden, University of Nottingham
Date/Time: 2-3pm May 19, 2015
Location: CS1.33a, University of St Andrews

As ubiquitous systems have moved out of the lab and into the world the need to think more systematically about how there are realised has grown. This talk will present intradisciplinary work I have been engaged in with other computing colleagues on how we might develop more formal models and understanding of ubiquitous computing systems.

More details can be found on this SACHI page

 

Event details

  • When: 19th May 2015 14:00 - 15:00
  • Where: Cole 1.33a
  • Format: Seminar

May 8th, Workshop, Sketching and Constructing Visualisations

A hands-on introduction to data literacy

This will be a hands-on workshop where we will conduct exercises on data characterisation, visualisation data sketching, and constructive visualisation. There will be several short talks on basic data visualisation concepts, discussions, sketching sessions and constructive visualisation sessions.

In this workshop you employ the basic visual variables to construct meaningful representations, the dynamic manipulation of spatial positioning to enable spatial reasoning, and through these practices you will become aware of the wide variety of ways that people can think about data.

More details can be found on this SACHI page.

 

Event details

  • When: 8th May 2015 11:00 - 16:30
  • Where: Cole 1.33

LitLong launches from AHRC funded project

The Palimpsest project involving the University of St Andrews’ SACHI group collaborating with the University of Edinburgh’s English literature and text-mining group launched LitLong Edinburgh on 30th march 2015.

LitLong_web_vis

LitLong_appLit Long: Edinburgh features a range of maps and accessible visualisations, which enable users to interact with Edinburgh’s literature in a variety of ways, exploring the spatial relations of the literary city at particular times in its history, in the works of particular authors, or across different eras, genres and writers. Lit Long: Edinburgh makes a major contribution to our knowledge of the Edinburgh literary cityscape, with potential to shape the experience and understanding of critics and editors, residents and visitors, readers and writers.

Give the web visualisation a try here.

SACHI’s Dr Uta Hinrichs created the web visualisation, Dr David Harris-Birtill created the mobile app and Professor Aaron Quigley was the St Andrews lead and co-investigator on the Palimpsest project funded by the AHRC.

This work is featured on the Guardians website and mentioned in Edinburgh University’s news.

New EPSRC project C3: Scalable & Verified Shared Memory

C3: Scalable & Verified Shared Memory via Consistency-directed Cache Coherence

Dr Susmit Sarkar

Dr Susmit Sarkar

Susmit Sarkar with colleagues in the University of Edinburgh and Intel as project partners, have been successful in their application to the EPSRC for their project C3: Scalable & Verified Shared Memory via Consistency-directed Cache Coherence. This 3 year project starts in July 2015 and aims to realise scalable and verified shared memory.

Shared-memory multi-core processors are ubiquitous, but programming them remains challenging. The programming model exposed by such multi-core processors depends crucially on a “memory consistency model” (MCM), a contract between the hardware and the programmer, which essentially specifies what value a read can return. On the hardware side, one key mechanism to implement the memory consistency model is the “cache-coherence protocol” (CCP), which essentially communicates memory operations between processors. However, the connection between the CCP and the MCM remains unclear. This is especially true for modern CCPs and MCMs, in which CCP design has been divorced from the requirements of the MCM. Susmit and his colleagues argue that this has negatively impacted the scalability and the verifiability of CCPs.

On the scalability front, there are serious question marks about sustaining cache coherence as the number of cores continue to scale. On the verification front, the application of existing verification techniques, which do not verify the CCP against the MCM, are arguably broken.

The C3 proposal, proposes a family of CCPs that are “aware” of, and verified against the MCM. Their approach is motivated by the fact that both hardware and programming languages are converging to various relaxed MCMs for performance oriented reasons. The team use such relaxed MCMs as inspiration to research CCPs that can take advantage of them.

Specifically, they will research “lazy” CCPs where memory operations are batched, and the cost of communicating a memory operation can be amortised. They will also, for the first time, formally verify the relationship between the hardware CCPs and the programmer-oriented MCM they provide. They will investigate rigorously the gains to be had from such lazy CCPs. The team will do this by creating a multi-core silicon prototype of our proposed CCP, leveraging our experience in the design of industrial-strength micro-architectures and their implementations.

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 ParsingBy 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