BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:(Skills) OpenGL / (Research) Optimising Network Selection Using Co
 verage Maps - Oliver Woodman and David Cottingham
DTSTART:20080506T130000Z
DTEND:20080506T140000Z
UID:TALK12123@talks.cam.ac.uk
CONTACT:Andrew Rice
DESCRIPTION:Skills: OpenGL\, Oliver Woodman\n\nThis talk will provide an i
 ntroduction to OpenGL. I will outline the OpenGL architecture\, describe i
 ts uses\, and explain the potential benefits of (hardware accelerated) Ope
 nGL relative to software rendering. I will also explain how to use OpenGL 
 in conjunction with a higher level language such as Java or C#. \n\n\nRese
 arch: Optimising Network Selection Using Coverage Maps\, David Cottingham\
 n\n\nWireless network coverage can be represented by collecting large quan
 tities of signal strength data and processing it to create a coverage map.
  Such maps provide much needed information on where network black spots ar
 e\, or what bit rate should be used by wireless cards to decrease the like
 lihood of packet loss. However\, how can these maps of many overlapping ne
 tworks of different technologies be used to infer the "best" sequence of n
 etworks a vehicle should connect to as it traverses a given geographical r
 oute? Including the cost of handovers in the problem means it is not solub
 le using simple shortest-path routing. In this talk\, I'll present our sol
 ution for how this "given route" problem can be solved\, and also how we c
 an find other routes that not only take into account distance\, but also n
 etwork coverage as well. I might even keep the presentation to time.\n
LOCATION:SS03\, William Gates Building
END:VEVENT
END:VCALENDAR