Event

LIFT OFF to Success

This session is run as part of the LIFT OFF to Success (LO2S) programme and is aimed at giving school pupils an insight into what it would be like to study computer science at university. During the session, pupils take part in a practical programming exercise, where they learn about software development techniques and gain LIFT OFF to Success

Teachers Together

The School is welcoming teachers and representatives of Local Education Authorities to a departmental visit as part of the Teachers Together Conference. Attendees will hear about our first year curriculum and how subjects such as Maths and Physics feed into it. They will also take part in a discussion about subject development in computer science, Teachers Together

First Chances Taster Sessions

These taster sessions are run as part of the First Chances Project and are aimed at giving school pupils an insight into what it would be like to study computer science at university. During the sessions, pupils take part in a practical programming exercise and attend a computer science lecture similar to those they would First Chances Taster Sessions

Practice talks for papers that Aaron and Daniel are presenting at AVI.

Title: AwToolkit: Attention-Aware User Interface Widgets Authors: Juan-Enrique Garrido, Victor M. R. Penichet, Maria-Dolores Lozano, Aaron Quigley, Per Ola Kristensson. Abstract: Increasing screen real-estate allows for the development of applications where a single user can manage a large amount of data and related tasks through a distributed user inter- face. However, such users can easily Practice talks for papers that Aaron and Daniel are presenting at AVI.

Honorary degree for Professor Dana Scott

We’re delighted that the University will be awarding the degree of Doctor of Science, honoris causa, to Professor Dana Scott at the graduation ceremony on Wednesday 25th June. What does it mean to describe a computation? For Turing, it meant designing an ideal machine whose small set of simple operations could perform calculations: the operational Honorary degree for Professor Dana Scott

What’s so great about compositionality? by Professor Stuart M Shieber, Harvard.

Abstract: Compositionality is the tenet that the meaning of an expression is determined by the meanings of its immediate parts along with their method of combination. The semantics of artificial languages (such as programming languages or logics) are uniformly given compositionally, so that the notion doesn’t even arise in that literature. Linguistic theories, on the What’s so great about compositionality? by Professor Stuart M Shieber, Harvard.

Computational Social Choice: an Overview by Edith Elkind, University of Oxford

ABSTRACT In this talk, we will provide a self-contained introduction to the field of computational social choice – an emerging research area that applies tools and techniques of computer science (most notably, algorithms, complexity and artificial intelligence) to problems that arise in voting theory, fair division, and other subfields of social choice theory. We will Computational Social Choice: an Overview by Edith Elkind, University of Oxford

A slippery slope — the path to national health data linkage in Australia – John Bass

Abstract: Linkage of health-related data in Australia dates back to the late 1960’s with the first inspiration coming from the United Kingdom. Since then computers have developed at a barely believable rate, and technical considerations still exist but do not pose any serious problems. Progress has been slowed by the increasing need for better privacy and A slippery slope — the path to national health data linkage in Australia – John Bass

The Chomsky-Schutzenberger Theorem for Quantitative Context-Free Languages by Heiko Vogler, University of Dresden

ABSTRACT: Weighted automata model quantitative aspects of systems like the consumption of resources during executions. Traditionally, the weights are assumed to form the algebraic structure of a semiring, but recently also other weight computations like average have been considered. Here, we investigate quantitative context-free languages over very general weight structures incorporating all semirings, average computations, The Chomsky-Schutzenberger Theorem for Quantitative Context-Free Languages by Heiko Vogler, University of Dresden