Computer Science Blog

Abstract: The cache coherence protocol is an important but notoriously complicated part of a multicore processor. Typical protocols are far too complicated to verify completely and thus industry relies on extensive testing in hopes of uncovering bugs. In this work, we propose a verification-aware approach to protocol design, in which we design scalable protocols such … Daniel Sorin (Duke University): Designing Formally Verifiable Cache Coherence Protocol (School Seminar)

Abstract: Plan and goal recognition is the task of inferring the plan and goal of an agent through the observation of its actions and its environment and has a number of applications on computer-human interaction, assistive technologies and surveillance. Although such techniques using planning domain theories have developed a number of very accurate and effective … Felipe Meneguzzi (PUCRS): Plan Recognition in the Real World (School Seminar)

Abstract: An email client. An instant messenger. A real-time financial market data viewer and news reader. A portfolio viewer. A note taker, file manager, media viewer, flight planner, restaurant finder… All built into one secure mobile application. On 4 different mobile operating systems. Does this sound challenging? Mark from Bloomberg’s Mobile team will discuss how … Mark Olleson (Bloomberg): Super-sized mobile apps: getting the foundations right (School Seminar)

Abstract: Modern, complex systems are likely to execute in open environments (e.g., applications running over the Internet of Things), where changes are frequent and have the potential to cause significant negative consequences for the application. A better understanding of the dynamics in the environment will enable applications to better automate planning for change and remain … Siobhán Clarke (Trinity College Dublin): Exploring Autonomous Behaviour in Open, Complex Systems (School Seminar)

Abstract: The previous two decades have seen significant advances in optimisation techniques that are able to quickly find optimal or near-optimal solutions to problem instances in many combinatorial optimisation domains. Despite many successful applications of both these approaches, some common weaknesses exist in that if the nature of the problems to be solved changes over … Emma Hart (Edinburgh Napier): Lifelong Learning in Optimisation (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 … Jessie Kennedy (Edinburgh Napier): Visualization and Taxonomy (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 … Barnaby Martin (Durham): The Complexity of Quantified Constraints (School Seminar)

Please note that this seminar confirmed for Purdie C on Wednesday October 4th between 14:00 and 15:00 Title: New file metaphors for a networked world

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 … Maja Popović (Humboldt-Universität zu Berlin): (Dis)similarity Metrics for Texts (School Seminar)