Event details
- When: 3rd March 2015 14:00 - 15:00
- Where: Cole 1.33
- Series: CS Colloquia Series, School Seminar Series
- Format: Seminar, Talk
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:
The St Andrews team will lead research in data linkage methodology, and are currently investigating the potential to use prefabricated secure rooms within the premises of institutions where researchers require secure access to sensitive data.
The St Andrews team involves:
The data linkage methodology research programme also includes Alasdair Gray at Heriot-Watt and Peter Christen at Australian National University.
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 teaching in abstract algebra, number theory, cryptography, combinatorics, graph theory, coding theory, optimisation and search, among other areas.
The CCP aims to support the ecosystem of users, extenders and developers of these systems and encourage best practice in their use, and to support the more rapid uptake of new features such as parallel programming support.
The project will run for 5 years starting from March 1st, 2015.
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, provided the Scholar meets the requirements of the institution.
Payment is made to the institution. The amount of the scholarship is the maximum amount Microsoft Research pays to the institution. In addition, every Scholar receives a laptop allowance.
During the course of their PhD, Scholars are invited to Microsoft Research in Cambridge for a PhD Summer School that includes a series of talks of academic interest and posters sessions, which provides the Scholars the opportunity to present their work to Microsoft researchers and a number of Cambridge academics.
Some of the Scholars may also be offered—at the sole discretion of Microsoft Research—an internship in one of the Microsoft Research laboratories. Internships involve working on a project alongside and as part of a team of Microsoft researchers. Scholars are paid during their internship—in addition to their scholarship bursary. Interested Scholars can apply through the Microsoft Research internship website.
The 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

A new CNC Router has just been undergoing its initial testing and calibration procedures. Its purchase was jointly funded by the School and the Research Groups of Professor Al Dearle , Professor Simon Dobson and Dr Miguel Nacenta. The router will be used for the manufacture of printed circuit boards , it can also be used to machine Plastic and Aluminium parts for research and student projects using suitable 3D CAD software such as FreeCAD. All the software used thus far has been Open Source and is as follows LinuxCNC for the machine controller , KiCAD for PCB design , pcb2gcode for the conversion of the Gerber file generated by KiCAD into GCode for the CNC Router. This allows one to manufacture PCBs using the copper isolation method , this is done using the Router cutter to create individual tracks on the blank copper PCB material using the generated GCode of the PCB design.
The image above shows a newly made PCB that has been routed and is also drilled ready for electronic components to be inserted.
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.
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 work and study. They are pictured below being presented with flowers and keepsakes.
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.