Welcome to the Department of Mathematics


Event: 56th annual meeting of the Canadian Operational Research Society (CORS) in Ottawa.

As in the past two years, we encouraged the undergraduates in Math 402W Operations Research Clinic to submit their projects to the CORS undergraduate student paper competition.  And, once again, they won both prizes.  This year, all 3 projects submitted were chosen as finalists, and presented their work at the meeting. (The fourth finalist was from the University of Alberta; nine entries were received.)  Congratulations go to:

Kishley Bhalla, Craig Mathews, W. Brett Robinson and Katie Sclater "Selecting Optimal Tolling Levels: A Case Study for the Fraser River in the Greater Vancouver Area"

Honourable Mention:
Nicole Mo, Alborz Namazi, Joyce Tai and Eric Yuen "Optimal Locations of Telecommunication Equipment: A Case Study for the City of Richmond, British Columbia, Canada"

Kingsley Cheang, Feiqi He, Sarah Lin and Ashlie Neufelt "The Community Mailbox Location-Routing Problem"

Additionally, Second Prize in the CORS Practice Competition went to Daniel Karapetyan (SFU Math postdoc 2011-13) and Abraham Punnen, for their paper "Operational Research Models and Algorithms for Fleet Size Planning and Schedule Optimisation for the British Columbia Ferry Services Inc."  Finalists for the practice competition included teams from the University of Toronto and IBM, first prize went to UOIT.


Daily News

Upcoming Events

  • CSC Seminar - Thomas Humphries, Oregon State
    2:30 PM - 3:30 PM
    September 19, 2014
    CSC Seminar Friday, September 19, 2014 2:30 pm TASC-2, Rm 8500 Speaker: Thomas Humphries, Oregon State Title: Reconstruction of polyenergetic CT data from a small number of projections Abstract: Recent work in CT image reconstruction has seen increasing interest in the use of compressive sensing (CS) techniques to reconstruct images from undersampled projection data. The underlying principle of CS is that if an image is known to be sparse (or, more typically, the result of some transform applied to the image is sparse), then the image can be accurately reconstructed from fewer samples than are required without any sparsity assumption. To date, work in this area has used a linear model for acquisition of CT data, which implicitly assumes that the x-ray beam used to generate the data is monoenergetic. X-ray beams used in clinical systems are polyenergetic, however, which is inconsistent with the linear model. This inconsistency produces so-called beam hardening artifacts in images reconstructed assuming a linear model, including images produced using CS methods. In this talk I will analyze a recently proposed polyenergetic reconstruction algorithm, which is based on the algebraic reconstruction technique (ART). I will show that this algorithm works well for practical purposes, although unlike ART, is not guaranteed to converge. I will then show that this algorithm can be incorporated into the CS framework to produce images that are free of beam hardening artifacts from a small number of projections.
  • 2014 West Coast Optimization Meeting (WCOM)
    8:30 AM - 4:00 PM
    September 21, 2014
    Full details available at:
  • Math Success Seminar
    4:30 PM - 5:30 PM
    September 22, 2014
    Math Success Seminar Monday, September 22, 2014 IRMACS Theatre/ 4:30pm-5:20pm
  • Brad Jones, M.Sc. Thesis Defence, Mathematics Room: PIMS 8500 TASC II
    10:30 AM - 12:30 PM
    September 25, 2014
    Sr. Supervisor: Karen Yeats Title: On tree hook length formulae, Feynman rules and B-series Abstract: This thesis relates similar ideas from enumerative combinatorics, Hopf algebraic quantum field theory and differential analysis. Hook length formulae, from enumerative combinatorics, are equations that can lead to bijections between tree classes and other combinatorial classes. Feynman rules are maps used in quantum field theory to generate integrals from particle interaction diagrams. Here we consider Feynman rules from the Hopf aslgebra perspective. $B$-series are powers series that sum over trees and are used in differential analysis to analyze Runge-Kutta method. The aim of this thesis is to bring together the ideas of the three communities. We show how to use differential equations to obtain new hook length formulae. Some of these new hook length formulae result in new combinatorial bijections. We use hook length formulae to express differential equations combinatorially. We also provide a generalization to hook length. Finally we include a catalogue of known hook length formulae.
  • IRMACS Retreat
    October 6-7, 2014
    No Description
  • Download .ics