Month: September 2011

Interaction and Visualization Approaches for Artistic Applications

Speaker: Sean Lynch, Innovis group/Interactions lab, University of Calgary, Canada Abstract: Information visualization and new paradigms of interaction are generally applied to productive processes (i.e., at work) or for personal and entertainment purposes. In my work, I have looked instead at how to apply new technologies and visualization techniques to art. I will present mainly … Interaction and Visualization Approaches for Artistic Applications

Undergrad BBQ

Another BBQ in the School is underway. An opportunity to welcome the new undergraduates and allow them to meet other Comp Sci students. A great turnout from 2nd yr, JH and SH.

Computer Science Gamefest

A small Gamefest in the sub honours lab on Wednesday proved successful and attracted some of our new undergraduate students. Comp Sci staples Pizza and Irn Bru provided sustenance for the afternoon session of Mario Kart and Call of Duty.

MSc BBQ

The Scottish weather proved favourable for the MSc barbecue yesterday. An excellent turn out with over 50 MSc students sampling burgers, sausages and the local delicacy Irn Bru. Photographic evidence provided.

The Dependability of Complex Socio-technical Infrastructure & Smart Grids and Smart Meters: Game Changer, or Serious Danger? by Prof. Ross Anderson

DLS Programme Lecture 1: The Dependability of Complex Socio-technical Infrastructure Abstract: We have all become dependent on large complex systems such as Facebook, the bank payment system and even the Internet itself. Keeping these systems dependable in the face of accidents, errors and malice is one of the most important, and interesting, challenges facing engineers … The Dependability of Complex Socio-technical Infrastructure & Smart Grids and Smart Meters: Game Changer, or Serious Danger? by Prof. Ross Anderson

Learning hard chart constraints for efficient context-free parsing by Brian Roark – Oregon Health & Science University

Abstract: In this talk, I’ll present some recent work in learning hard constraints for cells within a context-free parsing chart, to reduce parsing time. Each cell in the chart represents one of the O(n^2) substrings of the input string, and characteristics of each substring can be used to decide how much work to do in … Learning hard chart constraints for efficient context-free parsing by Brian Roark – Oregon Health & Science University