News

School Hosts StacsHack 2015

The School hosted a hugely successful StacsHack last month. We congratulate Stacs St Andrews Computing Society for organising and running a fantastic event. Hackathons allow students with a range of talents and aptitudes to form groups and create innovative projects in 24hrs. It’s clear from the many photos that great fun was had by all. School Hosts StacsHack 2015

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 School Seminars: Building the News Search Engine – Bloomberg

Administrative Data Research Centre – Scotland, St Andrews team

The Scottish ADRC is led by Chris Dibben at the University of Edinburgh, and is supported by the Economic and Social Research Council. The ADRC – Scotland: Brings together major Scottish centres of research, and builds on predecessor organisation structures, involving secondary analysis of public-sector data in order to create a common framework for research Administrative Data Research Centre – Scotland, St Andrews team

CoDiMa (CCP in the area of Computational Discrete Mathematics)

Steve Linton and Alexander Konovalov were successful in the application for the EPSRC-funded Collaborative Computational Project called CoDiMa (CCP in the area of Computational Discrete Mathematics): CoDiMa (CCP in the area of Computational Discrete Mathematics) CoDiMa is centred on two open source software systems: GAP and SAGE which are already widely used for research and CoDiMa (CCP in the area of Computational Discrete Mathematics)

A PhD studentship, in collaboration with MSR (Cambridge)

Reasoning about Racy Programs under Relaxed Consistency A PhD studentship, in collaboration with MSR (Cambridge) http://research.microsoft.com/en-us/collaboration/global/apply-europe.aspx> Each Microsoft scholarship consists of an annual bursary up to a maximum of three years. The amount varies in different countries and may depend on specific arrangement with public research funding agencies. The bursary continues automatically the following years, A PhD studentship, in collaboration with MSR (Cambridge)

Notable Woman in Computing Card Deck

Available on a coffee table (Jack Cole) near you: Notable Women in Computing playing card deck featuring 54 notable women in computer science. Play your favourite card game and learn more about the history and future of women in computer science. Read more about the KickStarter and Wiki Project.

PhD Poster Session 2015

Students and staff are pictured at the annual PhD poster session. The perfect opportunity,before teaching starts for supervisors and reviewers to catch up with student progress, and a great venue for students to discuss their research with their peers.

Ae fond farewell: Anne and Joy

As we start a new semester, we take time to reflect on those leaving the department. Fare thee well Anne and Joy. The School hosted a retirement reception for them last week. We thank them for all their hard work over many years and their contribution to making the School such a great place to Ae fond farewell: Anne and Joy

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 School Seminar Series: Matching in Practice: Junior Doctor Allocation and Kidney Exchange

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 School Seminar Series: Statistically Consistent Estimation and Efficient Inference for Natural Language Parsing