Difference between revisions of "Meetings in Summer 2007"

From The Programming Languages and Systems Research Group
Jump to: navigation, search
Line 17: Line 17:
 
{{EListEntry|326|Thursday, 31 May|12:15 -- 13:15, CS202J|Neil Mitchell|Fastest Lambda First|}}
 
{{EListEntry|326|Thursday, 31 May|12:15 -- 13:15, CS202J|Neil Mitchell|Fastest Lambda First|}}
  
{{EListEntry|327|Thursday, 07 June|12:15 -- 13:15, CS202J|Jan Tobias Muehlberg| |}}
+
{{EListEntry|327|Thursday, 07 June|12:15 -- 13:15, CS202J|Ian Toyn| |}}
 
{{EListEntry|328|Thursday, 14 June|12:15 -- 13:15, CS202J|Colin Runciman| |}}
 
{{EListEntry|328|Thursday, 14 June|12:15 -- 13:15, CS202J|Colin Runciman| |}}
 
{{EListEntry|329|Thursday, 21 June|12:15 -- 13:15, CS202J|Detlef Plump| |}}
 
{{EListEntry|329|Thursday, 21 June|12:15 -- 13:15, CS202J|Detlef Plump| |}}
 
{{EListEntry|330|Thursday, 28 June|12:15 -- 13:15, CS202J|Jonathan Ezekiel|CAV and PDMC Practice|}}
 
{{EListEntry|330|Thursday, 28 June|12:15 -- 13:15, CS202J|Jonathan Ezekiel|CAV and PDMC Practice|}}

Revision as of 14:09, 22 May 2007

Thursday, 26 April : " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 03 May Ben Mitchel: "Animating Simulated Annealing with Lego Mindstorms"
12:20 -- 12:40, CS202J Abstract: This project explores the physical animation of simulated annealing using Lego Mindstorms, and assesses the suitability of this approach to algorithm animation for use as an interactive teaching aid.

Thursday, 03 May Ian Boden: "Animation of Garbage Collection Algorithms using Lego Mindstorms"
12:40 -- 13:00, CS202J Abstract: My project investigates the use of Lego Mindstorms for educating students about Garbage Collection algorithms. It concentrates on producing a tool for demonstration and independent learning which is as capable of educating as standard methods with the advantage of making the topic more exciting for the students.

Thursday, 10 May : " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 17 May : " "
12:15 -- 13:15, CS119N Abstract:

Thursday, 24 May Malcolm Wallace: "Functional Programming and Visualisation: A Lazy PolyTypic Grid"
12:15 -- 13:15, CS202J Abstract: This talk will give an overview of the Lazy Polytypic Grid project,and outline some of our early results. Our aim is to explore how to make existing well-known visualisation algorithms (e.g. volumetric surface extraction):
  • lazy, so that the whole dataset is not required all at once;
  • datatype-generic (polytypic), so that the algorithm is independent of the original dataset storage format, including questions of irregular and unstructured sampling;
  • grid-enabled, such that it is possible to distribute the processing tasks across a heterogeneous network of machines, harnessing any implicit parallelism in the algorithms to speed up the calculation for huge datasets.

Thursday, 31 May Neil Mitchell: "Fastest Lambda First"
12:15 -- 13:15, CS202J Abstract:

Thursday, 07 June Ian Toyn: " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 14 June Colin Runciman: " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 21 June Detlef Plump: " "
12:15 -- 13:15, CS202J Abstract:

Thursday, 28 June Jonathan Ezekiel: "CAV and PDMC Practice"
12:15 -- 13:15, CS202J Abstract: