Author: ss265

Jessie Kennedy (Edinburgh Napier): Visualization and Taxonomy (School Seminar)

Abstract:

This talk will consider the relationship between visualization and taxonomy from two perspectives. Firstly, how visualization can aid understanding the process of taxonomy, specifically biological taxonomy and the visualization challenges this poses. Secondly, the role of taxonomy in understanding and making sense of the growing field of visualization will be discussed and the challenges facing the visualization community in making this process more rigorous will be considered.

Speaker Bio:

Jessie joined Edinburgh Napier University in 1986 as a lecturer, was promoted to Senior Lecturer, Reader, and then Professor in 2000 Thereafter she held the post of Director of the Institute for Informatics and Digital Innovation from 2010-14 and is currently Dean of Research and Innovation for the University.

Jessie has published widely, with over 100 peer-reviewed publications and over £2 million in research funding from a range of bodies, including EPSRC, BBSRC, National Science Foundation, and KTP, and has had 13 PhD students complete. She has been programme chair, programme committee member and organiser of many international conferences, a reviewer and panel member for many national and international computer science funding bodies, and became a Member of EPSRC Peer Review College in 1996 and a Fellow of the British Computer Society.

Jessie has a long-standing record of contribution to inter-disciplinary research, working to further biological research through the application of novel computing technology.

Her research in the areas of user interfaces to databases and data visualisation in biology contributed to the establishment of the field of biological visualisation. She hosted the first biological visualisation workshop at the Royal Society of Edinburgh in 2008, was an invited speaker at a BBSRC workshop on Challenges in Biological Visualisation in 2010, was a founding member of the International Symposium in Biological Visualisation – being Programme Chair in 2011, General Chair in 2012 and 2013 – and steering committee member since 2014.

She has been keynote speaker at related international conferences and workshops, such as VIZBI, the International Visualisation conference and BioIT World, and is currently leading a BBSRC network on biological visualisation.

Her research in collaboration with taxonomists at the Royal Botanic Gardens, Edinburgh, produced a data model for representing differing taxonomic opinions in Linnaean classification. This work led to collaboration on a large USA-funded project with ecologists from six US universities and resulted in a data standard for the exchange biodiversity data that has been adopted by major global taxonomic and biodiversity organisations.

Event details

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

Barnaby Martin (Durham): The Complexity of Quantified Constraints (School Seminar)

Abstract:

We elaborate the complexity of the Quantified Constraint Satisfaction Problem, QCSP(A), where A is a finite idempotent algebra. Such a problem is either in NP or is co-NP-hard, and the borderline is given precisely according to whether A enjoys the polynomially-generated powers (PGP) property. This reduces the complexity classification problem for QCSPs to that of CSPs, modulo that co-NP-hard cases might have complexity rising up to Pspace-complete. Our result requires infinite languages, but in this realm represents the proof of a slightly weaker form of a conjecture for QCSP complexitymade by Hubie Chen in 2012. The result relies heavily on the algebraic dichotomy between PGP and exponentially-generated powers (EGP), proved by Dmitriy Zhuk in 2015, married carefully to previous work of Chen.

Event details

  • When: 24th October 2017 14:00 - 15:00
  • Where: Cole 1.33a
  • Series: School Seminar Series
  • Format: Seminar

Maja Popović (Humboldt-Universität zu Berlin): (Dis)similarity Metrics for Texts (School Seminar)

Abstract:
Natural language processing (NLP) is a multidisciplinary field closely related to linguistics, machine learning and artificial intelligence. It comprises a number of different subfields dealing with different kinds of analysis and/or generation of natural language texts. All these methods and approaches need some kind of evaluation, i.e. comparison between the obtained result with a given gold standard. For tasks dealing with text generation (such as speech recognition or machine translation), a comparison between two texts has to be carried out. This is usually done either by counting matched words or word sequences (which produces a similarity score) or by calculating edit distance, i.e. a number of operations needed to transform the generated word sequence into a desired word sequence (which produces a “dissimilarity” score called “error rate”). The talk will give an overview of advantages, disadvantages and challenges related to this type of metrics mainly concentrating on machine translation (MT) but also relating to some other NLP tasks.

Speaker bio:
Maja Popović graduated at the Faculty of Electrical Engineering, University of Belgrade and continued her studies at the RWTH Aachen, Germany, where she obtained her PhD with the thesis “Machine Translation: Statistical Approach with Additional Linguistic Knowledge”. After that, she continued her research at the DFKI Institute and thereafter at the Humboldt University of Berlin, mainly related to various approaches for evaluation of machine translation. She has developed two open source evaluation tools, (i) Hjerson, a tool for automatic translation error classification, and (ii) chrF, an automatic metric for machine translation evaluation based on character sequence matching.

Event details

  • When: 29th September 2017 13:00 - 14:00
  • Where: Cole 1.33a
  • Series: School Seminar Series
  • Format: Seminar

Ott: Effective Tool Support for the Working Semanticist

ACM SIGPLAN has judged Ott: Effective Tool Support for the Working Semanticist, by Peter Sewell, Francesco Zappa Nardelli, Scott Owens, Gilles Peskine, Thomas Ridge, Susmit Sarkar, and Rok Strniša, to be the recipient of the Most Influential ICFP Paper Award for 2017. From the citation:

“Over the past ten years, ICFP researchers have benefitted tremendously from the open-source tool and the effective design space exploration that it promotes.”

Job Vacancy: Research Fellow in Computer Science

A Research Associate position in analysis and verification of novel cache algorithms is available at the School of Computer Science within the University of St Andrews. The position is a fixed-term position for 18 months, starting January 2017 or as soon as possible thereafter. The project involves understanding and developing the theoretical basis for such algorithms, formalising them using formal techniques of theorem proving and/or model checking, and developing formal analysis and correctness proofs for such algorithms.

This is part of the EPSRC-funded “C3:Scalable & Verified Shared Memory via Consistency-Directed Cache Coherence” (EP/M027317/1) project, a collaborative project with architecture researchers at the University of Edinburgh and at Intel Corporation Ltd, investigating high-performance cache coherence protocols. Our goal is to propose and verify a family of protocols that are aware of high-level programming models, including in particular those with so-called relaxed memory consistency models.

The particular direction at St Andrews under the direction of Dr Sarkar is to develop verification methods that will scale to the research cache coherence protocols being co-developed within the project. This is a new application area for formal methods, with performance and correctness both equally important. Thus, a background in one or more of Formal Methods, Compilers and Static Analysis, and Verification Tools is expected. Software development and/or formal proof development experience is invaluable.

For an informal discussion about the post you are welcome to contact Dr Susmit Sarkar.

Applications are particularly welcomed from women and other groups that are under-represented in Research posts at the University.

Full posting

PhD Studentship: Reasoning about Racy Programs under Relaxed Consistency

A PhD studentship on “Reasoning about Racy Programs under Relaxed Consistency” is available in the School of Computer Science at the University of St Andrews, funded by Microsoft Research and EPSRC.

The project will involve developing reasoning principles and tools for relaxed memory consistency settings. This is a key problem in shared-memory concurrency at the low-level, whether in C or C++, or even higher-level languages such as Java.

There has been lots of work done on proving shared-memory concurrent programs correct, by the use of very sophisticated program logics such as Concurrent Separation Logic and RGsep. However, shared-memory concurrent programs actually do not satisfy a key building block of such logics, an assumption that memory is sequentially consistent. Instead, when programming at the low-level in C or C++, or even in relatively higher-level languages such as Java, programmers have to deal with relaxed memory consistency. How and whether sophisticated program logics can scale up to this setting is the open research question we seek to address. Furthermore, efficient concurrent code often have intentional races, making the problem harder (and rendering the standard prescription of data-race-freedom ineffective). If we can develop such a logic, we can build tools that can automatically analyse code and make them safe, efficient, and correct by suggesting appropriate fences or other mechanisms. With multiprocessors everywhere from personal mobile devices to servers, this is an important problem with a potential of high impact, both in theory and in practice.

The project will be supervised by Dr Susmit Sarkar at the University of St Andrews. Dr Jade Alglave of Microsoft Research Cambridge will be the Microsoft supervisor. During the course of their PhD, Scholars are invited to Microsoft Research in Cambridge for an annual Summer School, and there is also a possibility of paid internships during studies. The studentship is fully funded to pay fees and stipend for students with a relevant connection to the UK.

Applicants are expected to have or expect to obtain a UK first-class Honours or Masters degree (or its equivalent from non-UK institutions) in Computer Science, but the minimum standard we require is an upper second-class Honours degree or equivalent. Some experience in concurrent and/or functional programming and an aptitude for mathematical subjects are required. Knowledge and experience of one or more of formal verification, mechanised proofs, and programming languages is highly desirable.

For further information on how to apply, see our postgraduate web pages. Ideally the student will start in October 2015, or as soon as possible thereafter. Further details on the project and suggested reading is available from Dr Susmit Sarkar.

PhD Studentship: Reasoning about Racy Programs under Relaxed Consistency

A PhD studentship on “Reasoning about Racy Programs under Relaxed Consistency” is available in the School of Computer Science at the University of St Andrews, funded by Microsoft Research and EPSRC.

The project will involve developing reasoning principles and tools for relaxed memory consistency settings. This is a key problem in shared-memory concurrency at the low-level, whether in C or C++, or even higher-level languages such as Java.

The project will be supervised by Dr Susmit Sarkar at the University of St Andrews. Dr Jade Alglave of Microsoft Research Cambridge will be the Microsoft supervisor. During the course of their PhD, Scholars are invited to Microsoft Research in Cambridge for an annual Summer School, and there is also a possibility of paid internships during studies. The studentship is fully funded to pay fees and stipend for students with a relevant connection to the UK.

Applicants are expected to have or expect to obtain a UK first-class Honours or Masters degree (or its equivalent from non-UK institutions) in Computer Science, but the minimum standard we require is an upper second-class Honours degree or equivalent. Some experience in concurrent and/or functional programming and an aptitude for mathematical subjects are required. Knowledge and experience of one or more of formal verification, mechanised proofs, and programming languages is highly desirable.

For further information on how to apply, see our postgraduate web pages. Ideally the student will start in October 2015, or as soon as possible thereafter. Further details on the project and suggested reading is available from Dr Susmit Sarkar.