MEETING-DATE:September 30, 2009
MEETING-LOCATION:DC 1331
MEETING-TIME:1:30
MEETING-CHAIR:Zainab Meraj
MEETING-CHAIRPIC:zainab.jpg
COFFEE-HOUR-LAST-WEEK:None
COFFEE-HOUR-THIS-WEEK:Kate Kinnear
COFFEE-HOUR-NEXT-WEEK:Volunteers?
FORTH-DATE1:October 7, 2009
FORTH-DATE2:October 14, 2009
FORTH-DATE3:October 21, 2009
FORTH-DATE4:October 28, 2009
FORTH-LOCATION1:DC 1304 1:30
FORTH-LOCATION2:DC 1304 1:30
FORTH-LOCATION3:DC 1304 1:30
FORTH-LOCATION4:DC 1304 1:30
FORTH-CHAIR1:Matei Negulescu
FORTH-CHAIR2:Alex Pytel
FORTH-CHAIR3:Jaime Ruiz
FORTH-CHAIR4:Andrew Seniuk
FORTH-CHAIRPIC1:noface3.jpg
FORTH-CHAIRPIC2:apytel.jpg
FORTH-CHAIRPIC3:Ruiz.jpg
FORTH-CHAIRPIC4:noface3.jpg
FORTH-TP1:Craig Kaplan
FORTH-TP2:Kate Kinnear
FORTH-TP3:Zainab Meraj
FORTH-TP4:Edward Lank
FORTH-TPPIC1:craig.jpg
FORTH-TPPIC2:kate.jpg
FORTH-TPPIC3:zainab.jpg
FORTH-TPPIC4:ed.jpg
TPNAME:Matthew Kay
TPTITLE:Getting Attention with Software Notices
TPABSTRACT:Research indicates that less than 20f the population reads license agreements during software installation. To address this problem, we developed textured agreements, visually redesigned agreements that employ information layering, vignettes, sensationalism, and visual variety to accentuate information and highlight its personal relevance. Notably, textured agreements accomplish these goals without requiring modification of the underlying text. A follow-up to a previous study on textured agreements has shown similar improvements in reading behaviour (subjects spent 30 seconds longer on consent screens than the in control condition). Furthermore, the study results show a significant increase in median reading time by 4 out of 16 points.
TPPIC:mattkay.jpg
DIONE:
DITWO:
DITHREE:
DIFOUR:
AIONE:Need to prepare for Oct 16 presentation for graduate students
AITWO:
AITHREE:
AIFOUR:
DMONE:None
DMTWO:
DMTHREE:
DMFOUR:
SEMINARS:<dl><nl><dt>Wednesday, 30 September 2009, 3:30PM -- MC5136</dt><nl><dd>   Algorithms and Complexity Group Seminar -- Computer Science <nl>          Speaker: Narges Simjour, School of Computer Science, University<nl>          of Waterloo </dd><nl><dd>          Title: "Improved Parameterized Algorithms for the Kemeny<nl>          Aggregation Problem" </dd><nl></dl><nl><nl><dl><nl><dt>Thursday, 1 October 2009, 11:30AM -- CPH 4333 </dt><nl><dd>   Continuous Optimization Seminar -- Combinatorics and Optimization<nl>          Speaker: Vris Cheung, Dept. of Combinatorics and Optimization, Uw </dd><nl><dd>          Title: "Robust Optimization: applications in portfolio selection<nl>          problem" </dd><nl><nl><dt>Thursday, 1 October 2009, 1:30PM -- Mc 5136 </dt><nl><nl><dd>    Algebraic Graph Theory Seminar -- Combinatorics and Optimization<nl>          Speaker: Chris Godsil, Dept. of Combinatorics and Optimization, UW </dd><nl><dd>          Title: "Control theory, graph theory and quantum computing"</dd><nl><nl></dl><nl><nl><dl><nl><dt>Friday, 2 October 2009, 2:00PM -- MC 5046</dt><nl><dd>   Geometry & Topology Seminar Seminar -- Pure Mathematics<nl>          Speaker: Michael Wong, McGill University </dd><nl><dd>          Title: "Wonderful Compactifications and Moduli of Principal<nl>          Bundles"</dd><nl></dl><nl><nl><dl><nl><dt>Friday, 2 October 2009, 3:30PM -- MC 5046 </dt><nl><dd>   Geometry & Topology Seminar Seminar -- Pure Mathematics<nl>          Speaker: John Loftin, Rutgers University Newark </dd><nl><dd>          Title: "Surface Group Representations and Generalizations of<nl>          Teichmuller Space"</dd><nl></dl><nl><nl><nl><dl><nl>Newly added:<nl><dt>Friday , 2 October 2009, 400PM -- Tathum Center</dt><nl><dd>   Digital Arts PechaKucha night<nl>       Speakers: includes Craig Kaplan, School of Computer Science, University<nl>          of Waterloo </dd><nl></dl><nl><nl><nl><dl><nl><dt> Saturday, 3 October 2009, 10:00AM -- DC 1301</dt><nl><dd>   Short Course -- Computer Science<nl>          Speaker: various speakers, Computer Science Club/School of<nl>          Computer Science </dd><nl><dd>          Title: "Linux Install Fest"  </dd><nl><dd> Remarks: Lunch will be provided. </dd><nl></dl>