 
Friday Sept 16 12:0012:50 Room C674 
Fei Wang Undergraduate student (Computer Science) Supervisor: Robert Benkoczi 
Undergraduate Capstone Open Source Projects 2011
The Undergraduate Capstone Open Source Projects (UCOSP) is a program that brings together senior CS students from many universities across North America to contribute to open source projects. The collaboration lasts for the duration of a semester, appears on the student's transcripts (as an applied study course), is graded, and gives the student a taste of software development in the real world. Fei Wang will talk about his experience working on the open source project Freeseer in Spring 2011. 
Friday Oct. 14 12:0012:50 Room C674 
Hugh Ramp Undergraduate student (Physics) Supervisor: Hadi Kharaghani 
Weighing Matrices
Weighing Matrices, W (n,w) are n x n matrices with entries in {0, 1,1}, and the property that WW* = wI, where * is the Hermitian transpose. In this presentation, we will expand the definition to matrices with entries on the unit circle in the complex plane and define a standardized form, which will be used to classify weighing matrices for weights 1 to 3, and give insight into weight 4. In order to make this presentation accessible to all audiences, any required concepts beyond firstyear math will be explained as necessary. 
Friday Oct. 21 12:0012:50 Room C674 
Darcy Best M.Sc student (Mathematics) Supervisor: Hadi Kharaghani 
Mutually unbiased weighing matrices
A weighing matrix W of order n and weight w is a square matrix where every entry has absolute value of 0 or 1, such that WW*=wI where * is the Hermitian transpose. Two weighing matrices H and K of the same order and weight are unbiased if HK*=sqrt(w)L, where L is a weighing matrix (of the same order and weight). Calderbank et al. gave an upper bound for the number of a related set of objects. We give some examples where this upper bound is attained by mutually unbiased weighing matrices and discuss, among other things, some very nice applications of these matrices. The talk should be accessible to everyone with knowledge of first year math. 
Friday Nov. 04 12:0012:50 Room C674 
Documentary. 
Fermat's Last Theorem
a film by Simon Singh and John Lynch (48 min) Anyone who thinks that mathematics doesn't involve passion and emotion should hear directly from Andrew Wiles. For over 350 years, some of the greatest minds of science struggled to prove what was known as Fermat's Last Theorem: the idea that a certain simple equation had no solutions. In 1993, Andrew Wiles made frontpage headlines when he announced a proof of the problem, but this was not the end of the story; an error in his calculation jeopardized his life's work. In this interview, Wiles recounts how he came to terms with the mistake, and eventually went on to achieve his life's ambition. To learn more about the story of the proof: Fermat's Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem by Singh, Simon (1998). 
Friday Nov. 25 12:0012:50 Room C674 
ACM Team A: Darcy Best, Hugh Ramp, Keilan Scholten ACM Team D: Rio Lowry, Chris Martin, Chris Thomas Coach: Howard Cheng (Computer Science) 
ACM Rocky Mountain Regional Contest
The University of Lethbridge Programming Contest teams competed in the annual ACM Rocky Mountain Regional Programming Contest. Our top team finished 3rd in the region and our second team also finished in the top half of the competition. Our top two teams will talk about the problems they solved and their experiences with the contest, and some tips on how to do well in this competition. More information on the contest: http://www.cs.uleth.ca/~cheng/icpc.html 
