Feng Xie Ph.D. Student -- NSERC PGS-D recipient M.Sc. (McMaster University, OGS recipient) B.Sc. (York University, NSERC USRA recipient) Department of Computing and Software Faculty of Engineering McMaster University

Tutorials

Publications

1. Antoine Deza Tamon Stephen, and Feng Xie
   More colourful simplices.
   Discrete and Computational Geometry 45 (2011) 272-278.
2. Antoine Deza Sonoko Moriyama, Hiroyuki Miyata, and Feng Xie
   Hyperplane Arrangements with Large Average Diameter: a Computational Approach.
   Advanced Studies in Pure Mathematics (to appear).
3. Antoine Deza and Feng Xie:
   On the Generalized Berge Sorting Conjecture.
   Journal of Discrete Algorithms 8 (2010) 1-7.
4. Antoine Deza and Feng Xie:
   Hyperplane arrangements with large average diameter.
   Centre de Recherches Mathematiques and American Mathematical Society series 48 (2009) 103-114.
5. Feng Xie and Andrew Davenport:
   Solving scheduling problems using parallel message-passing based constraint programming.
   Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (2009) 53-58, 19th International Conference on Automated Planning and Scheduling, Thessaloniki, Greece.

6. Antoine Deza, Tamás Terlaky, Feng Xie, and Yuriy Zinchenko:
   Diameter and curvature : intriguing analogies.
   Electronic Notes in Discrete Mathematics 31 (2008) 221-225.
7. David Bremner, Antoine Deza and Feng Xie:
   The complexity of the envelope of line and plane arrangements.
   Optimization - Modeling and Algorithms (21) 1-7, Institute of Statistical Mathematics, Tokyo.
8. Antoine Deza and Feng Xie:
   Line and plane arrangements with large average diameter.
   Proceedings of the 5th Hungarian-Japanese Symposium on Discrete mathematics and its Applications, Sendai, Japan (2007) 106-111.
9. Master's Thesis, Department of Computing and Software, McMaster University.

Presentations

1. More colourful simplices.
   Talk, Discrete Mathematical Days, Ottawa, Ontario, May 14-15, 2010.
   
2. Hyperplane arrangements with large average diameter. (Poster)
   Talk, Discrete Geometry Meeting, Toronto, Ontario, November 29, 2008.
   Talk, Ontario Combinatorics Workshop, Waterloo, Ontario, May 24-25, 2008.
   Poster, Second Mathematical Programming Society International Conference on Continuous Optimization, Hamilton, Canada, August 13-16, 2007.
   Talk, Canadian Operational Research Society (CORS), London, Canada, May 13-16, 2007.
   Talk, Optimization Days 2007, Montreal, Canada, May 7-9, 2007.
3. Parallelization of constraint programming based scheduling using MPI.
   Talk, Combinatorial Optimization Day, Hamilton, Ontario, August 22, 2008.
4. On extensions of cyclic arrangements.
   Talk, Canadian Mathematical Society Winder Meeting, Windsor, Ontario, Canada, December 5-7, 2009.
   Talk, Canada-Japan Workshop on Discrete and Computational Geometry, Tokyo, Japan, July 13-15, 2009.

Teaching Assistantship

1. Fall 2010/2011, Continuous Optimization Algorithms (COMP SCI 4TE3,6TE3 / CES 722,723)
2. Fall 2009/2010, Computer Architecture and Organization / Graphical Processors (COMP SCI 2CA3 / SFWR ENG 3GA3)
3. Winter 2008/2009, 2009/2010, Operations Research (SWFR ENG 4O03 / COMP SCI 4O03). Tutorials
4. Fall 2007/2008, 2008/2009, Data Structures and Algorithms (CAS 702).
5. Winter 2006/2007, 2007/2008, Mechanical Engineering Measurement (MECH ENG 2B03).
6. Fall 2006/2007, Engineering Mechanics: Kinetics and Dynamics (MECH ENG 2Q04).

Parallel Computation

Summer 2008 @ IBM T. J. Watson Research Center

Parallelization of constraint programming based scheduling using MPI on Blue Gene.

Computational Geometry

OMC (Oriented Matroid Computation)

Oriented matroid is a combinatorial abstraction of many geometric objects such as hyperplane arrangement and vector configuration. OMC (Oriented Matroid Computation) is a C++ package for oriented matroid computation that would help explore related research topics computationally.

More details on OMC can be found here,

Berge Sorting

Optimal Berge sorting solutions for n = 20+8t : 20,28,36,44,52,60,68,76,84.

Optimal Berge sorting solutions for n = 32+8t : 32,40,48,56,64,72,80,88.

For an introduction of Berge sorting, please visit Berge Sorting Homepage.

For the demonstrations of sorting no more than 50 coins, please visit William Hua's website.

NSERC USRA Project - Process Scheduler for Embedded Systems

Summer 2004 @York University

This project features a process scheduling system that enables multiprogramming on PIC18F452 microcontroller and a demo robot based on the system.

• For simplicity, processes are non-preemptive and pre-defined. Tasks of process management and context switching are reduced to minimum.
• Processes that are blocked by the timer and RS232 are moved to various waiting queues, thus yielding the control of CPU to other processes.
• Process synchronization is realized by semaphores and process communication is through shared memory.
• A simple shell enables users to interact with the system through RS232 link.
• Five processes are programmed into the demo robot, whose tasks varies from barrier dodging to RS232 communication.

Website Development

cceds.mcmaster.ca : A conference website based on Open Conference System and developed using PHP and MySQL.

Updated on September 29, 2010.