University Crossing 132
Department of Computer Science
Drexel University
Email:
Phone: (215)-895-4910
University Crossing 132
Department of Computer Science
Drexel University
Email:
Phone: (215)-895-4910
From time to time, some people get the wrong impression about Ph.D. majoring in computer science by thinking they have very strong theoretical skills, but poor in programming. However, that is not totally true. As far as I know, many Ph.D.s (including myself) are very good programmers.
The Wireless Internet Collaboration System is a Serice Oriented Architecuter based system that allows one or more participants working on smartphones or laptops to exchange mathematical formulas, geometric drawings and chat messages, and to access diverse computer algebra services while sharing the results.
It is based on J2SE and J2ME technologies.
It consists of 80 JAVA files, near 13,000 lines of JAVA codes.
Working with Werner Krandick and Shawn Pierce!
Develop a tool to discover the repeated patterns in the mathforum archive
Develop an automatic system to answer questions (on-going)
Working with Bruce Char, Jeremy Johnson.
A C++ template library for exact, high-performance linear algebra computation with dense, sparse, and structured matrices over the integers and over finite fields.
It consists of near 400 C++ files, near 125,000 lines of C++ codes.
It uses GMP, NTL, Givaro, BLAS, LAPACK, and doxygen packages.
Working with B. David Saunders and other LinBox members
From time to time, I have some other interests besides research (to amuse myself).
The reasons I study them are my curiosity and their applibilities.
I took a few courses in statistics during my undergraduate study.
I have been reading a few interesting statistical books.
It is widely accepted that the model which holds that stock prices are log-normally distributed.
I am reading the book, "OPTIONS, FUTURES, and OTHER DERIVTIVES" by John C. Hull.
Journal papers
- B. David Saunders and Zhendong Wan An engineered algorithm for the Smith form of an integer matrix, Submitted to ACM TOMS, 2006
- Zhendong Wan, An algorithm to solve integer linear systems exactly using numerical methods , Journal of Symbolic Computation, volume 41, issue 6, p621-632, 2006.
Conference Proceedings
- Jean-Guillaume Dumas, Clement Pernet, and Zhendong Wan, Efficient Computation of the Characteristic Polynomial, ISSAC 2005, Beijing, China.
- Jeffrey Adamas, B. David Saunders, and Zhendong Wan, Signature of Symmetric Rational Matrices and the Unitary Dual of Lie Groups, ISSAC 2005, Beijing, China.
- B. David Saunders and Zhendong Wan, Smith Normal Form of Dense Integer Matrices, Fast Algorithms into Practice, ISSAC 2004, Spain.
Conference Presentations
- Austin Lobo, B. David Saunders, and Zhendong Wan, Rank and Smith Form of extremely sparse matrices, ACA 2003, Raleigh, NC.
- Ahmet Duran, B. David Saunders, and Zhendong Wan, Hybrid algorithm for rank of sparse matrices , SIAM Applied Linear Algebra conference, 2003, Williamburge, VA.
Conference Posters
- Werner Krandick, Shawn S. Pierce, and Zhendong Wan, Towards collaboration across display diversity, ISSAC'06 poster, Genoa, Italy
- B. David Saunders and Zhendong Wan, Fast Early Termination Technique in Symbolic Linear Algebra, ECCAD'05 Poster, Ashland, OH
- B. David Saunders and Zhendong Wan, Tighter Probability Bounds for Randomized Linear Algebra Algorithms, ECCAD'04 Poster, Waterloo, ON, Canada.
- Clement Pernet and Zhendong Wan, LU based algorithms for the characteristic polynomial over a finite field, ISSAC'03 Poster , Philly, PA.
- Ahmet Duran, B. David Saunders, and Zhendong Wan, Rank of sparse {0,1} matrices, ECCAD'03 Poster , Clemson, SC.
- Jean-Guillaume Dumas, William Turner, and Zhendong Wan, Exact solution to large sparse integer linear systems, Poster at ECCAD 2002, New York, NY.