Colloquium/Seminar

YearMonth
2017 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Oct   Nov   Dec  
2016 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Oct   Nov   Dec  
2015 Jan   Feb   Mar   Apr   May   Jun   Aug   Sep   Oct   Nov   Dec  
2014 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2013 Jan   Feb   Mar   Apr   May   Jun   Aug   Sep   Nov   Dec  
2012 Jan   Feb   Apr   May   Jun   Jul   Aug   Sep   Nov   Dec  
2011 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2010 Jan   Feb   Mar   Apr   May   Jun   Sep   Oct   Nov   Dec  
2009 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2008 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2007 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2006 Jan   Feb   Mar   Apr   May   Jun   Jul   Sep   Oct   Nov   Dec  
2005 Jan   Feb   Mar   Apr   May   Jun   Jul   Aug   Sep   Oct   Nov   Dec  
2004 Jan   Feb   Mar   Apr   May   Aug   Sep   Oct   Nov   Dec  

Event(s) on November 2009


  • Monday, 2nd November, 2009

    Title: Lecture Series on Graph Theory and Combinatorial Algorithms: Some Related Topics on Friendly Labeling
    Speaker: Dr. Wai-chee Shiu, Department of Mathematics, Hong Kong Baptist University, Hong Kong
    Time/Place: 11:00  -  12:00
    FSC1217, Fong Shu Chuen Library, HSH Campus, Hong Kong Baptist University


  • Wednesday, 11th November, 2009

    Title: Brilliance of Civilization - Distinguished Computational Mathematics Lecture: New Algorithms in Information Science
    Speaker: Prof. Stanley Osher, University of California, Los Angeles, USA
    Time/Place: 16:30  -  18:00 (Preceded by Reception at 4:00pm)
    WLB103, The Wing Lung Bank Building for Business Studies, Shaw Campus, Hong Kong Baptist University
    Abstract: The past few years have seen an incredible explosion of new (or revival of old) fast and effective algorithms for various imaging and information science applications. These include: nonlocal means, compressive sensing, graph cuts, Bregman iteration, as well as relatively old favorites such as the level set method and PDE based image restoration. Prof. Osher will give his view of where we are, hopefully giving credit to all the people involved.


  • Thursday, 12th November, 2009

    Title: Lecture Series on Graph Theory and Combinatorial Algorithms: Generalizations of Chung-Feller Theorems
    Speaker: Prof. Yeong-Nan Yeh, Institute of Mathematics, Academia, Taiwan, R.O.C.
    Time/Place: 11:00  -  12:00
    FSC1217, Fong Shu Chuen Library, HSH Campus, Hong Kong Baptist University


  • Monday, 16th November, 2009

    Title: Lecture Series on Graph Theory and Combinatorial Algorithms: Incidence Colouring: Recent Developments and Relation with Other Colourings
    Speaker: Dr. Pak-kiu Sun, Department of Mathematics, City University of Hong Kong, Hong Kong
    Time/Place: 11:00  -  12:00
    FSC1217, Fong Shu Chuen Library, HSH Campus, Hong Kong Baptist University


  • Monday, 23rd November, 2009

    Title: Lecture Series on Graph Theory and Combinatorial Algorithms: On the Laplacian and Signless Laplacian Characteristic Polynomial of a Graph
    Speaker: Prof. Jiming Guo, China University of Petroleum, China
    Time/Place: 11:00  -  12:00
    FSC1217, Fong Shu Chuen Library, HSH Campus, Hong Kong Baptist University


  • Tuesday, 24th November, 2009

    Title: System Reduction Using Optimal Replacement Variables
    Speaker: Prof. Alex Solomonof, Division of Applied Mathematics, Brown University, USA
    Time/Place: 11:30  -  12:30
    FSC1217, Fong Shu Chuen Library, HSH Campus, Hong Kong Baptist University
    Abstract: We present a method of approximating a large system of ODEs by one with fewer equations, while attempting to preserve the dynamics of a given set of variables of interest. The method is as follows: 1) Put a (simple, ad-hoc) probability distribution on the phase space of the ODE, 2) Assert that a small set of {em replacement variables} are to be unknown linear combinations of the not-of-interest variables, and let the variables of the reduced system consist of the variables-of-interest together with the replacement variables. 3) Find the linear combinations that minimize the difference between the dynamics of the original system and the reduced system. We describe this program in detail for linear systems of ODEs, show that the resulting approximate system of ODEs gives quite good approximations to the original, discuss methods and issues for carrying out the required minimization, and consider the many possible directions for further work.