Meeting Agenda - 2000.04.26
April 26th, 2000
- Location:
- DC1304
- Time:
- 11:30 a.m.
- Chair:
-
Stephen Mann
Member
List
Member Profile: Eric Hall
1. Adoption of the Agenda - additions or deletions
2. Coffee Hour
- Coffee hour last week:
- Josee Lajoie - Thanks!
- Coffee hour this week:
- ???
- Coffee hour next week:
- ???
3. Next meeting
- Date:
- Wednesday, May 3, 2000
- Location:
- DC1304
- Time:
- 1:30 p.m. ?
- Chair:
-
Michael McCool
- Technical presentation:
-
Marryat Ma
4. Forthcoming
Chair:
-
Kevin Moule (May 10rd)
-
Chris O'Sullivan (May 17th)
-
Jasmin Patry (May 24th)
Tech Presenters:
-
Vincent Ma (May 10rd)
-
Mike McCool (May 17th) To be swapped due to GI-2K
-
Kevin Moule (May 24rd)
5. Technical Presentation
- Presenter:
Celine Latulipe
-
- Title:
- Digital Tape Drawing
- Abstract:
-
Tape drawing artists at auto design studios create concept images of cars
using black photographic tape. These images eventually have to be
digitized. Researchers at Alias/Wavefront have come up with a digital
version of tape drawing. In this presentation I will talk about a paper
presented at UIST '99 titled "Digital Tape Drawing". The authors are Ravin
Balakrishnan, George Fitzmaurice, Gordon Kurtenbach and William Buxton.
6. General Discussion Items
- Moving the CGL meeting time back to 1:30pm?!
- There is a fire drill scheduled for the Davis Centre this
afternoon around 4 PM.
- Ian Bell: The spline project talks
will be on Thursday, April 27, from 3pm to 5pm
in DC1304.
-
Tim Lahey: Collaboration opportunities with C.O.R.E. Digital Pictures
-
Patrick Gilhuly: Tulip is no more.
-
Patrick Gilhuly: We seem to have a disk space shortage.
7. Action List
-
UIST submission deadline is May 9th
-
Graphics Interfaces Conference: May 15-17, Montreal.
-
SIGGRAPH early registration is June 16th
8. Director's Meeting
9. Seminars
-
Wednesday, 26 April 2000, 3:30PM - Computer Science (Algorithms and Complexity Group), DC1304
Michael A. Nielsen: -- Quantum computation and quantum information
Quantum computers are devices which harness quantum mechanics to perform information processing tasks in a
manner strikingly different from and perhaps superior to "classical" computing devices. Most interestingly, they
appear to be good candidates to violate the strong Church-Turing thesis: that any realisitic computing device can
be simulated efficiently using a probabilistic Turing machine. In this talk I introduce the basic ideas of quantum
computation, describe some of the reasons why quantum computers are thought to be superior to ordinary
computing devices, and review some of the challenges facing us in understanding the power of quantum computers
for information processing. No prior knowledge of quantum mechanics will be assumed.
-
Thursday, 27 April 2000, 10:30AM - Computer Science , DC 1304
N. Asokan: -- Fair Exchange
In this talk, I will describe optimistic_ protocols for fair exchange. They use a third party to guarantee fairness; but
the third party is involved only when one of the players demands it. The idea is to optimise for the common case that
both players are honest and are interested in completing the exchange successfully. I will illustrate the optimistic
approach using contract signing protocols in the synchronous communication model (where communication
channels can be assumed to be reliable) as well as the asynchronous communication model.
-
Thursday, April 27, 3:00 - 5:00 p.m., DC 1304.
Splines project talks, various speakers
10. Lab Cleanup
Disk cleanup!