Mohammad Shoaib Jamall

• approximation algorithms for graph theoretic problems using PageRanks - graph theory is the new calculus; many practical problems can be framed in terms of graphs. These problems are often intractable but can be solved approximately. I am interested in finding newer, faster and better approximate solutions for these problems using PageRank and in the process contribute to the development of a PageRank theory of graphs. My knowledge of software and computer science will enable me to better exploit the interplay between theory and application in this area

• bearing insights from graph theory on real world problems - since graph theory can be used to model many real world phenomenon, results from the theory can be used to improve algorithms and to enhance our understanding of the real world. For instance, expansion properties of certain graphs can be used to amplify probabilities in monte carlo algorithms. Another example would be the use of spectral graph theory for visualization of graphs

Education

Awards

Principal's Student-Athlete Academic Honor Roll, McGill University, 1998
James McGill Award for academic excellence, McGill University, 1997
Dean's Honor List, McGill University, 1996-1998
Golden Key National Honor Society, 1996
Hugh Brock Entrance Scholarship, McGill University, 1995

Research Experience

Paper with F. Chung "Drawing Graphs using PageRanks", to be submitted, July 2008
Organized the Combinatorics Reading Seminar at University of California, San Diego, Summer 2008
Attended "The 5th Workshop on Algorithms and Models for the Web-Graph", San Diego, CA, 2007 Wrote "Using Code Coverage Tools to Enhance Automated Test Suites", internal Oracle Corporation paper, 2003
Wrote "Reducing Information Overload in Web Applications", internal Oracle Corporation paper, 2002

Presentations

"Drawing Graphs using PageRanks", Netseer Inc., Los Angeles, July 2008
"Mathematical Results on Scale-Free Random Graphs", Combinatorics Reading Seminar, University of California, San Diego, July 2008
"Simple Deterministic Approximation Algorithms for Counting Matchings", Combinatorics Reading Seminar, University of California, San Diego, August 2007
"CelsiusTech: A Case Study in Product Line Development", Topics in Software Engineering, Universty of Illinois, Urbana-Champaign, November 2004
"Automated Testing for Improved Software Reliability", Oracle, Redwood Shores, California, November 2003

Software Engineering

I developed and engineered software at Oracle Corporation, Redwood Shores, California, from 1999 to 2004. I was soon promoted to Principal Software Engineer(the second highest engineering designation). Below are some highlights from my tenure at Oracle

• Researched methods for improving software quality. This lead to the introduction of code coverage tools in Oracle Financials. These tools enabled engineers to enhance their automated test suites
• Configured record breaking Oracle Applications benchmarks

Teaching

"Game Theory", Teaching Assistant, University of California, San Diego, Spring 2008
"Calculus for Science and Engineering" and "Linear Algebra", Teaching Assistant, University of California, San Diego, 2006-2008
"Embedded Systems Architecture and Software", Teaching Assistant, University of Illinois, Urbana-Champaign, 2004-2005
"Introduction to Computer Engineering", Teaching Assistant, McGill University, Canada, 1997
"Advanced Calculus" and "Differential Equations", Teaching Assistant, McGill University, Canada, 1997-1998

Skills

Programming - java, C, C++, Perl, Matlab, Database Applications
Operating Systems - Unix, Linux, Windows
Languages - Urdu(native), Arabic(intermediate)