Jonathan Li On Wing
351, 12th Avenue
LaSalle, Québec
Canada
H8P 3P8
Office:
Reasoning & Learning Lab
School of Computer Science
McGill University
3480 University Street
Engineering McConnell Building, Room 111
Montréal, Québec
H3A 2A7
Sorry, currently too busy to post an html version. A pdf version is available here.
Last updated: March 25, 2006.
McGill University (M.Sc. Computer Science)
Current Courses
Winter 2006
COMP 529 - Software Architecture and Analysis
COMP 506 - Advanced Algorithm Analysis
COMP 533 - Object-Oriented Design
COMP 526 - Probabilitic Reasoning in AI
COMP 601 - Topics in Computer Science
COMP 601 - Topics in Computer Science
COMP 763 - Modern Computer Games
McGill University (B.Sc. Software Engineering)
Atmospheric & Oceanic Sciences
ATOC 220 - Introduction to Oceanic Sciences
Computer Science
COMP 206 - Introduction to Software Systems
COMP 250 - Introduction to Computer Science
COMP 251 - Data Structures & Algorithms
COMP 302 - Programming Lang. & Paradigms
COMP 304 - Object-Oriented Design
COMP 310 - Operating Systems
COMP 330 - Theoretical Aspects of Comp. Sci.
COMP 360 - Algorithm Design Techniques
COMP 361 - Systems Development Project
COMP 421 - Database Systems
COMP 424 - Topics in Artificial Intelligence
COMP 557 - Fund of Computer Graphics
Earth and Planetary Sciences
EPSC 200 - The Terrestrial Planets
Electrical, Computer, and Software Engineering
ECSE 200 - Fundamentals of Electrical Engineering
ECSE 221 - Intro to Computer Engineering
ECSE 321 - Intro to Software Engineering
ECSE 428 - Software Engineering Practice
ECSE 429 - Software Validation
ECSE 495 - Software Engineering Project
Management
MGCR 211 - Introduction to Financial Accounting
Mathematics and Statistics
MATH 223 - Linear Algebra
MATH 240 - Discrete Structures & Computing
MATH 260 - Intermediate Calculus
MATH 314 - Advanced Calculus
MATH 315 - Ordinary Differential Equations
MATH 323 - Probability Theory
MATH 324 - Statistics
Psychology
PSYC 215 - Social Psychology
Under construction... I'm slowly adding these!
Current projects!
On Bus Graph Realizability
Winter 2006
Submitted...but ummmm.... rejected
Abstract: In this paper, we consider the following graph embedding
problem: Given a bipartite graph G = (V1; V2; E), where the maximum
degree of vertices in V2 is 4, can G be embedded on a two dimensional
grid such that each vertex in V1 is drawn as a line segment along a grid
line, each vertex in V2 is drawn as a point at a grid point, and each
edge e = (u; v) for some u E V1 and v E V2 is drawn as a line segment
connecting u and v, perpendicular to the line segment for u? We show
that this problem is NP-complete, and sketch how our proof techniques
can be used to show the hardness of several other related problems.
Interpersonal Relationships: From Aggression and Hatred...
Winter 2006
Title: Interpersonal Relationships: From Aggression and Hatred
to Altruism and Love - How should one perceive another in a Computer
Game Course & Prof: COMP 763 | Clark Verbrugge Abstract: Realistic artificial intelligent agents have been in high demand by computer game players. This paper investigates realistic agents, more specifically relationships and reputations, which have been relatively unresearched. This paper introduces an approach to show realistic relationships among AI agents and human players, and to do so, we use an artificial neural network and break the problem down into four categories to investigate: intrapersonal, interpersonal and communal relations, and momentum. Key Words: Computer Games, Aritficial Intelligence, Role-playing
Games, Social Behaviours, Reputation, Neural Network
Supervisor: Joseph Vybihal Abstract: Our project involved writing behavioural specifications,
as well as improving and debugging the Prometheus Expert System. The
Prometheus project, supervised by Mr. Joseph Vybihal from the McGill
School of Computer Science, is an emulation of an ant colony. Our
main task was to write brain logic scripts to simulate an ant-like
entity's instinct. Furthermore, we wrote test scripts to perform
regression tests to verify that all requirements were satisfied with
every version. Finally, a gatherer behaviour specification was created.