Mathematics

Indigenous Knowledge in STEM Education

Speaker: 
Ron Eglash
Date: 
Fri, Mar 8, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Special Lecture
Abstract: 

Computing with Culture From fractals in African architecture to algorithms in First Nations beadwork, simulations of indigenous designs reveal complex concepts and practices that can be mapped onto analogous principles in math, science and computing. Applications for this work include outreach to K-12 students as well as contributions to sustainable development.

Class: 

The power and weakness of randomness (when you are short on time)

Speaker: 
Avi Wigderson
Date: 
Fri, Mar 8, 2013
Location: 
Department of Mathematics, UBC
Conference: 
PIMS/UBC Distinguished Colloquium
Abstract: 

Avi Wigderson is a widely recognized authority in theoretical computer science. His main research area is computational complexity theory. This field studies the power and limits of efficient computation and is motivated by such fundamental scientific problems as: Does P=NP? Can every efficient process be efficiently reversed? Can randomness enhance efficient computation? Can quantum mechanics enhance efficient computation? He has received, among other awards, both the Nevanlinna Prize and the Gödel Prize.

Class: 

Cryptography: Secrets and Lies, Knowledge and Trust

Speaker: 
Avi Wigderson
Date: 
Thu, Mar 7, 2013
Location: 
PIMS, University of British Columbia
Conference: 
PIMS Public Lecture
Abstract: 

What protects your computer password when you log on, or your credit card number when you shop on-line, from hackers listening on the communication lines? Can two people who never met create a secret language in the presence of others, which no one but them can understand? Is it possible for a group of people to play a (card-less) game of Poker on the telephone, without anyone being able to cheat? Can you convince others that you can solve a tough math (or SudoKu) puzzle, without giving them the slightest hint of your solution?These questions (and their remarkable answers) are in the realm of modern cryptography. In this talk I plan to survey some of the mathematical and computational ideas, definitions and assumptions which underlie privacy and security of the Internet and electronic commerce. We shall see how these lead to solutions of the questions above and many others. I will also explain the fragility of the current foundations of modern cryptography, and the need for stronger ones.No special background will be assumed.

Class: 

How Does Google Google?

Speaker: 
Margot Gerritsen
Date: 
Thu, Jan 17, 2013
Location: 
PIMS, University of Calgary
Conference: 
Mathematics of Planet Earth 2013
Abstract: 

Abstract: We all Google. You may even have found this talk by Googling. What you may not know is that behind the Google's and other search engines is beautiful and elegant mathematics. In this talk, I will try to explain the workings of page ranking and search engines using only rusty calculus.

Bio: Dr. Margot Gerritsen is the Director of the Institute for Computational and Mathematical Engineering at Stanford University. She is also the chair of the SIAM Activity group in Geoscience, the co-director and founder of the Stanford Center of Excellence for Computational Algorithms in Digital Stewardship, and the director of Stanford Yacht Research. She has been appointed to several prestigious positions, including Magne Espedal Professorship at Bergen University, Aldo Leopold Fellow, Faculty Research Fellow at the Clayman Institute and she is also a Stanford Fellow. She is the editor of the Journal of Small Craft Technology and an associate editor of Transport in Porous Media. We are delighted to have Dr. Gerritsen participate in the Mathematics of Planet Earth series.

Class: 

A Computational Mathematician Combusts

Speaker: 
Margot Gerritsen
Date: 
Fri, Jan 18, 2013
Location: 
PIMS, University of Calgary
Conference: 
Mathematics of Planet Earth 2013
Abstract: 

Large scale production of very heavy oil is gaining momentum because of the decline of easy to produce reservoirs, the increasing oil demand and subsequent rising oil price, which makes such resources more economical. Considering the pressure on the oil market and our still very heavy dependence on oil, this move to heavy oil production seems inevitable. Typically, heavy oil reservoirs are stimulated thermally. Injecting steam that is generated at the surface is not always viable or desirable. An alternative technique for production is In-Situ Combution (ISC) where a steam drive is generated in the reservoir itself. In this process, (enriched) air is injected in the reservoir. After ignition a combustion front develops in-situ that burns a small percentage of the oil in place and slowly moves through the reservoir producing steam along the way. A side benefit of this process is that the heat thus generated often cracks the oil into heavy, undesirable components (the "guck") that stay behind in the reservoir and lighter, more valuable components that can be brought up to the surface. Performance prediction of ISC projects is rather tricky and poses many computational challenges. In this talk I'll discuss our work in ISC simulation, which is centered around the design of upscaling methods for kinetics and critical reservoir heterogeneities supported by laboratory experimentation.

Class: 

Recent Results on Bootstrap Percolation

Speaker: 
Béla Bollobás
Date: 
Fri, Feb 15, 2013 to Sat, Feb 16, 2013
Location: 
PIMS, University of British Columbia
Conference: 
PIMS/UBC Distinguished Colloquium
Abstract: 

Bootstrap percolation, one of the simplest cellular automata, can be viewed as an oversimplified model of the spread of an infection on a graph. In the past three decades, much work has been done on bootstrap percolation on finite grids of a given dimension in which the initially infected set A is obtained by selecting its vertices at random, with the same probability p, independently of all other choices. The focus has been on the critical probability, the value of p at which the probability of percolation (eventual full infection) is 1/2.

The first half of my talk will be a review of some of the fundamental results concerning critical probabilities proved by Aizenman, Lebowitz, Schonman, Cerf, Cirillo, Manzo, Holroyd and others, and by Balogh, Morris, Duminil-Copin and myself. The second half will about about the very recent results I have obtained with Holmgren, Smith, Uzzell and Balister on the time a random initial set takes to percolate.

Class: 

Using epidemiological data to understand within-host parasite dynamics of malaria infection

Speaker: 
Miles Davenport
Date: 
Sat, Jan 19, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Disease Dynamics 2013
Abstract: 

Using epidemiological data to understand within-host parasite dynamics of malaria infection.

Class: 

Public Health Decision-Making in Global HIV/STIs

Speaker: 
David Wilson
Date: 
Fri, Jan 18, 2013 to Sat, Jan 19, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Disease Dynamics 2013
Abstract: 

Public Health Decision-Making in Global HIV/STIs

Class: 

Combatting Neglected Disease Leishmaniasis in India: Identifying True Burden & Designing Efficient Control Policy

Speaker: 
Anuj Mubayi
Date: 
Sat, Jan 19, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Disease Dynamics 2013
Abstract: 

Combatting Neglected Disease Leishmaniasis in India: Identifying True Burden & Designing Efficient Control Policy

Class: 

Stochastic modeling insights into early HIV infection

Speaker: 
Jessica Conway
Date: 
Fri, Jan 18, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Disease Dynamics 2013
Abstract: 

Stochastic modeling insights into early HIV infection

Class: 

Pages