IDC Seminar: Provenance Information Promotes Fluidity And Rigor: Journalism Revisited

December 8, 2015 at 11:00 am

Simon Attfield

Abstract to come

IDC seminar (7 Dec) Designing for security: Users are not the weakest link

December 7, 2015 at 2:00 pm

(please note this is not the usual seminar time: 2pm on Monday in C204)

Dr. Sonia Chiasson (Carleton University)


There is a prevailing belief that users are the weakest link in the security chain. In this talk, I will discuss how this perspective is inherently counterproductive to achieving increased cyber security and explore alternatives with a higher chance of improving security.  Our research group explores how systems can be designed to better support secure behaviour and how user behaviour impacts security.  We investigate how underlying system and interaction design choices can lead to more secure systems by decreasing chances of misuse, errors, or exploitation of security mechanisms. I will present research examples from our recent work, including anti-phishing and privacy-preserving apps.


Sonia Chiasson is the Canada Research Chair in Human Oriented Computer Security and a faculty member in the School of Computer Science at Carleton University in Ottawa, Canada.  She is Deputy Scientific Director of SERENE-RISC, a Canadian Networks of Centers of Excellence for Knowledge Mobilization created to help protect Canadian individuals and organizations from online security and privacy threats. Her main research interests are in usable security and privacy: the intersection between human-computer interaction and computer security and privacy. She leads Carleton’s Human Oriented Research in Usable Security (CHORUS) research group.

IDC seminar (1 Dec) – Trip Report: Phong Nguyen (VisWeeks) + Craig Anslow (ITS & Splash)

December 1, 2015 at 11:00 am

There is no abstract of speaker bio, as this is a trip report:




IDC Seminar (24 Nov) – Generating Insights: Hard-to-get-at data from difficult-to-access users

November 24, 2015 at 11:58 am

Bob Fields, Middlesex University


This talk reports on the development of a suite of tools to collect, analyze and visualize a diverse range of data from sufferers of mental ill health. The aim is to allow researchers and ultimately sufferers and clinicians to better understand ‘individual signatures’ of factors that indicate or identify episodes of ill health. The tools have been applied in a study working with clients of a mental health service that demonstrates their applicability and acceptability in developing a better understanding of the factors surrounding self-harm behavior.

IDC seminar (17 Nov) – Schematization with and without geography

November 17, 2015 at 12:01 pm

Dr Wouter Meulemans (giCentre, City University, London)

Wouter Meulemans Schematic maps reduce details to a minimal level, while still supporting the main purpose of the map. This is in stark contrast to traditional generalization for topographic maps, that show detail at a maximal level, constrained by legibility. Furthermore, distortion and stylization are often applied to clarify structures in the information and communicate the schematic nature of the map.

A central question for computing such maps is what is means for a schematic shape to “resemble” the geographic one. We review prominent similarity measures, assessing their suitability as an optimization criterion for the schematization process. Based on this, we present a heuristic algorithm, guided by a similarity measure, that can effectively and efficiently compute schematic maps following the angular-restriction criterion as pioneered by Beck’s map of the London underground. Inspired by both traditional schematic maps and recent trends, we also show how to compute schematic maps that restrict geometry to circular arcs, followed by a brief comparison between straight-line and circular-arc schematization.

We’ll then take a step back and look at a more fundamental question. If we discard the constraints arising from geography, we are left with just a combinatorial graph as input. The question that arises is how many line segments we need, to draw a given graph. We introduce and review three algorithms for planar cubic 3-connected graphs, and show the results of an experiment comparing these methods.


After a PhD in computational geometry from TU Eindhoven and a postdoc at WWU Münster, Wouter Meulemans is now a Marie-Curie research fellow at the giCentre, City University London. His research interests lie in developing geometric algorithms and applying these to problems arising in information visualization, automated cartography and GIS.