SPRING 2012
| |
Friday Feb. 03
12:00--12:50
Room C674 |
Dr. Hadi Kharaghani
Dr. Joy Morris
Dr. Soroosh Yazdani
|
A glimpse at research in mathematics
In this seminar three of our math professors are going to give you an accessible glimpse of their research in three short mini-talks (15 minutes each).
These talks will be accessible to undergraduate students and will allow them to discover what their profs are doing outside the classroom.
Our department is very active in research and we are looking for good students to apply for graduate studies.
This seminar will be of particular interest for any students considering graduate studies in mathematics.
|
Friday Feb. 10
12:00--12:50
Room C674 |
Dr. Kevin Grant
Dr. Shahadat Hossain
Dr. John Zhang
|
A glimpse at research in computer science
In this seminar, three of our Computer Science professors will give a glimpse of their research in three short mini-talks (15 minutes each).
These talks will be accessible to undergraduate students, and will allow them to discover what their profs are doing outside the classroom.
Our department is very active in research, and we are looking for good students to apply for graduate studies.
This seminar will be of particular interest for any students considering graduate studies in computer science.
|
Friday Feb. 17
12:00--12:50
Room C674 |
documentary
http://zalafilms.com/films/juliarobinson.html
|
Julia Robinson and Hilbert's Tenth Problem
Julia Robinson (1919-1985) was a pioneer among American women in mathematics. She was the first woman elected to the mathematical section of the National Academy of Sciences, and the first woman to become president of the American Mathematical Society.
The documentary features a heroine, captivated by the lure of unsolved mathematical problems, and one in particular - Hilbert's tenth problem.
Her work, and the exciting story of the path that led to the solution of this problem produced an unusual friendship between Russian and American colleagues at the height of the cold war.
The film also covers important events in the history of modern mathematics while exploring the relationship between mathematical research and the development of computers.
This documentary is accessible to a general audience (no scientific background required).
|
Friday March 2
12:00--12:50
Room C674 |
Stephen Nsoh
MSc student (computer science)
Supervisor: Robert Benkoczi
|
Resource Allocation in Wimax Mesh Networks
Wimax mesh networks hold the promise of providing wider coverage and supporting higher data rates for broadband wireless internet services. A wimax mesh network consists of a base station and several subscriber stations. The base station has a wired connection to the internet and subscriber stations have to relay their traffic to the base station through multihop transmission. Two main
design challenges need to be addressed in these networks: 1. construction of a routing tree that
shows the flow of traffic in the network. 2. scheduling links in the tree so as to maximize system
throughput. In this talk, we present algorithms for both routing and scheduling which are currently
being studied for my thesis work.
|
Friday March 9
12:00--12:50
Room C674 |
Ben Burnett
MSc student (computer science)
Supervisor: Shahadat Hossein
|
title
abstract
|
Friday March 16
12:00--12:50
Room C674 |
Fataneh Esteki
MSc student (mathematics)
Supervisors: Amir Akbary and Habiba Kadiri
|
title
abstract
|
Friday March 23
12:00--12:50
Room C674 |
Shah Mostafa Khaled
MSc student (computer science)
Supervisor: Robert Benkoczi
|
title
abstract
|
Friday March 30
12:00--12:50
Room C674 |
Ebrahim Ghaderpour
MSc student (mathematics)
Supervisor: Hadi Kharaghani
|
title
abstract
|
Friday April 6
12:00--12:50
Room C674 |
Majid Shahabi
MSc student (mathematics)
Supervisors: Amir Akbary and Nathan Ng
|
title
abstract
|
FALL 2011
| |
Friday Sept 16
12:00--12: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:00--12: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 first-year math will be explained as necessary.
|
Friday Oct. 21
12:00--12: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:00--12: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 front-page 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:00--12: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
|
|
