MEETING-DATE:April 8th, 2009
MEETING-LOCATION:DC 1331
MEETING-TIME:1:30
MEETING-CHAIR:Ryan Stedman
MEETING-CHAIRPIC:ryan_bw.jpg
COFFEE-HOUR-LAST-WEEK:Kate
COFFEE-HOUR-THIS-WEEK:Volunteers?
COFFEE-HOUR-NEXT-WEEK:Volunteers?
FORTH-DATE1:April 15th, 2009
FORTH-DATE2:April 22nd, 2009
FORTH-DATE3:April 29th, 2009
FORTH-DATE4:May 6th, 2009
FORTH-LOCATION1:DC 1331 1:30
FORTH-LOCATION2:DC 1331 1:30
FORTH-LOCATION3:DC 2303 1:30
FORTH-LOCATION4:DC 1304 1:30
FORTH-CHAIR1:Stephen Mann
FORTH-CHAIR2:Michael McCool
FORTH-CHAIR3:Zainab Meraj
FORTH-CHAIR4:Alex Pytel
FORTH-CHAIRPIC1:smann.jpg
FORTH-CHAIRPIC2:mmccool.jpg
FORTH-CHAIRPIC3:zainab.jpg
FORTH-CHAIRPIC4:apytel.jpg
FORTH-TP1:Kate Kinnear
FORTH-TP2:Ben Lafreniere
FORTH-TP3:Stephen Mann
FORTH-TP4:Michael McCool
FORTH-TPPIC1:kinnear.gif
FORTH-TPPIC2:ben.jpg
FORTH-TPPIC3:smann.jpg
FORTH-TPPIC4:mmccool.jpg
TPNAME:Craig Kaplan
TPTITLE:An introduction to orbifolds
TPABSTRACT:Orbifolds are an elegant, intuitive and practical way to think about the symmetries of patterns.  In this talk I'll explain what an orbifold is, how simple symmetry groups can be described based on their orbifold structures, and how they can be used to derive facts about symmetry groups and tilings.
TPPIC:craig.jpg
DIONE:
DITWO:
DITHREE:
DIFOUR:
AIONE:Meeting for April 29th will be in DC 2303
AITWO:
AITHREE:
AIFOUR:
DMONE:
DMTWO:
DMTHREE:
DMFOUR:
SEMINARS:<pre><nl>2009 Apr 15, 13:30 — Algorithms and Complexity Group Master's Thesis Presentation<nl>Pat Nicholson, graduate student, David R. Cheriton School of Comp. Sci., Univ. Waterloo <nl>The application of the in-tree knapsack problem to routing prefix caches<nl></pre><nl><pre><nl>2009 Apr 15, 14:00 — Programming Languages Lab PhD Seminar<nl>Thomas Lynam, PhD candidate, David R. Cheriton School of Comp. Sci., Univ. Waterloo<nl>TREC Legal Track Experiments<nl></pre>