|
|
Xiaojun Shen, Professor
|
|
Department
of Computer Networking
|
|
|
5110
Rockhill Road, #550C |
|
|
Kansas
City, MO 64110-2499, USA |
|
|
Tel: +1 816 235-2223 |
|
|
Fax: +1 816
235-5159 |
|
|
Email: shenx@umkc.edu
|
|
|
last
update on
|
|
|
|
|
|
|
|
Education
|
PH.D. |
University
of Illinois at Urbana-Champaign, Urbana, IL 61801 |
|
09/85---
08/89 Department of Computer Science, PH.D. issued on Oct. 15,
1989 |
|
|
M.S. |
Nanjing
University of Science and Technology, Nanjing, China. |
|
09/78---11/81
Department of Computer Science, M.S. issued in April 1982 |
|
|
B.S.
Equivalent |
Tsinghua
University, Beijing, China. |
|
09/63---12/68
Major in Numerical analysis. |
Experience
·
Working Experience
|
Engineer |
China,
12/68---09/78 |
|
|
Instructor |
Nanjing
University of Science & Technology, china, 12/81---06/84 |
|
|
Assistant
Professor |
University
of Missouri-Kansas City, 09/89---08/95 |
|
|
Associate
Professor |
University
of Missouri-Kansas City, 09/95---08/01 |
|
|
Professor |
University
of Missouri-Kansas City, 09/01--- current, member of Doctoral faculty, IEEE
member |
· Service Experience
|
He
is on the UMKC research board. |
|
He
once served as graduate committee chair of CST program in UMKC and also
served on various campus committees. |
|
He
served as conference program co-chair for PDCS 2000. |
|
He
served as a session chair of several conferences. |
Teaching
|
Xiaojun
Shen has taught eight different courses since he came to UMKC. These
courses are: |
||
|
CS101 |
Problem
Solving and Programming |
|
|
CS291 |
Discrete
Structures II |
|
|
CS421 |
Foundations
of Data Networks |
|
|
CS481 |
Advanced
Computer Architecture |
|
|
CS520 |
Network
Architecture I |
|
|
CS581 |
Parallel
Computer Architecture |
|
|
CS592 |
Design
and Analysis of Algorithms |
|
|
CS590D |
Distributed
Algorithms |
|
|
He
has also guided 6 Ph.D. students and 17 master students. |
||
Research
|
Xiaojun
Shen's research areas includes |
|
|
1. |
Computer
algorithms |
|
2. |
Parallel
processing with focus on interconnection networks |
|
3. |
Telecommunications
and computer networking with focus on optical switching, optical routing,
wavelength assignment problems, and packet scheduling. |
Publications
· Journal Publications
|
1. |
Shen,
X. and Edelsbrunner, H., "A Tight Lower bound on The Size of
Visibility Graphs," Information Processing Letters,
26(1987/88) p61-64. |
|
2. |
Edelsbrunner,
H., Hasan, N.,Seidel, R., and Shen, X., " Circles Through Two
Points That Always Enclose Many Points," Geometriae Dedicata, 32(1989)
p1-12.
|
|
3. |
Shen,
X., Cai, Y.Z., Liu, C.L., and Kruskal, C.P., "Generalized Latin Squares
I", Discrete Applied Mathematics, 25 (1989) p155-178 |
|
4. |
Edelsbrunner, H., Robison, A.D., and Shen, X., "Covering Convex Sets with Non-overlapping Polygons," Discrete Mathematics, 81(1990) p153-164. |
|
5. |
Reingold,
E.M. and Shen, X., "More Nearly Optimal Algorithms for Unbounded
Searching, Part I: the finite case", SIAM Journal on Computing, vol.
20, No. 1 (1991) p156-183. |
|
6. |
Reingold,
E.M. and Shen, X., "More Nearly Optimal Algorithms for Unbounded
Searching, Part II: the transfinite case", SIAM Journal on
Computing, vol. 20, No. 1, (1991) p184-208. |
|
7. |
Shen,
X, and E.M. Reingold, "Scheduling on a Hypercube", Information
Processing Letters, 40 (1991) p323-328. |
|
8. |
Shen,
X., Q. Hu, B. Cong, H. Sudborough, M. Girou, and S. Bettayeb, "The 4-
Star graph is not a Subgraph of any Hypercube", Information
Processing Letters, 45 (1993) p199-203. |
|
9. |
Shen,
X., and Q. Hu, "A Note on the Minimal Visibility Graphs," Information
Processing Letters, 46 (1993) p101. |
|
10. |
Shen,
X., Q.Hu, W. Liang, "Realization of an Arbitrary Permutation on a
Hypercube," Information Processing Letters, 51(1994)
p237-243. |
|
11. |
Shen,
X., "Generalized Latin Squares II," Discrete
Mathematics, 143 (1995) p221-242. |
|
12. |
Shen,
X., M. Xu, and X. Wang, "An Optimal Algorithm for Permutation
Admissibility to Multistage interconnection Networks," IEEE
Transactions on Computers, Vol.44, No.4, April 1995,p604-608. |
|
13. |
Shen,
X., Q.Hu, and W. Liang, "Embedding k-ary Complete Trees into
Hypercubes," J. Parallel and Distributed Computing, 24
(1995), p100-106. |
|
14. |
Shen, X.," Optimal Realization of Any BPC Permutation on K-Extra-Stage Omega Networks," IEEE Transactions on Computers, Vol. 44, No.5, May, 1995, p714-719. |
|
15. |
Shen,
X., "An Optimal O(NlgN) Algorithm for Permutation Admissibility to
Extra-Stage Cube-Type Networks," IEEE Transactions on Computers,
Vol. 44, No. 9, Sept. 1995, pp. 1144-1149. |
|
16. |
Hu,
Q., Yang, J., Zhang, Q., Liu, K. Shen, X., "An Automatic Seal
Imprint Verification Approach," Pattern Recognition,
Vol.28, No.4, 1995, p1251-1266. |
|
17. |
Hu,
Q., X., Shen, W. Liang, "Optimally Routing LC Permutations on k-extra-
stage Cube-type Networks," IEEE Transactions on Computers, Vol.
45, No. 1, Jan. 1996, pp. 97-103 |
|
18. |
W.
Liang, X. Shen, and Q. Hu, "Parallel Algorithm for the Edge-coloring and
Edge-coloring Update Problems," Journal of Parallel and
Distributed Computing, 32 (1996), pp. 66-73. |
|
19. |
Hu, Q., and X Shen, "Topologies of Combined (2n-1)-Stage Interconnection Networks." IEEE Transactions on Computers, Vol. 46, No. 1, 1997, pp.118-124. |
|
20. |
Shen, X., W. Liang, and Q. Hu, "On Embedding Between 2-D Meshes of the Same Size." IEEE Transactions on Computers, Vol. 46, No. 8, 1997, pp. 880-889. |
|
21. |
Liang,
W., and X. Shen, "Finding the k Most Vital Edges in the Minimum
Spanning Tree Problem," Parallel Computing, Vol. 23, No. 13,
1997, pp1989-1907. |
|
22. |
Shen,
X., J.Agrawal, Q.Hu, and Yan Xiong, "Topological Equivalent Classes for
Tegular MINs of Arbitrary Stages", International Journal of
Parallel and Distributed Systems and Networks, Vol.1, No.3, 1998,
p136-142. |
|
23. |
Q.Hu,
Y.Zhang, and X. Shen, "Rearrangeable Graphs", Information
Processing Letters, 71(1999), p23-27. |
|
24. |
J.P.
Agrawal, X.Shen, S.V. Reddy, R.Halker , "Efficient Multicasting in ATM
Switches by Integrating Copying and Broadcasting", International
Journal of Parallel and Distributed Systems and Networks, Vol.2, No..4,
1999, p255-264. |
|
25. |
Shen,
X. and Y.Zhang, "Partitionability of k-Extra-Stage Omega Networks and an
Optimal Task Migration algorithm," Journal of Parallel and
distributed Computing, 60(2000), p334-348. |
|
26. |
W. Liang and X. Shen, "Improved Lightpath (Wavelength) Routing in Large WDM Networks," IEEE Transactions on communications, Vol 48, No.8, Sept. 2000, p1571-1579. |
|
27. |
Han, J., W. Liang, X.shen, "Very Fast Parallel algorithm for Approximate Edge Coloring", Discrete Applied Mathematics, 108(2001) p227-238. |
|
28. |
W. Liang, X. shen, and Q. Hu, "finding the Most Vital Edge for Graph Minimization Problem on Meshes and hypercubes," International journal of Parallel and Distributed Systems & Networks, Vo.3, No.4, 2000, p197-205. |
|
29. |
X.
Shen, F.Yang, Y.Pan, "Equivalent Permutation Capabilities between
Time Division Optical Omega Networks and Non-optical Extra-Stage
Omega Networks," IEEE/ACM Transactions on Networking, Vol. 9 ,
No.4, Aug 2001, p518-524. |
|
30. |
W.
Liang and X. Shen, "Permutation Routing in All-Optical Product
Networks," IEEE Transactions on Circuits and Systems, Vol. 49,
No. 4, April 2002, p533-542. |
|
31. |
Y.
Han and X. Shen, "Parallel Integer Sorting Is More Efficient than
Parallel Comparison Sorting on Exclusive Write PRAMS," SIAM J.
Computing, Vol. 31, No. 6, 2002, p1852-1878. |
|
32. |
W.
Liang and X. Shen, "Finding Multiple Routing Paths in Wide-Area WDM
Networks," ELSEVIER Computer Communications, Vol. 28, 2005,
p811-818. |
|
33. |
W.
Liang and X. Shen, "A General Approach for All-to-All Routing in
Multihop WDM Optical Networks," IEEE/ACM Transactions on Networking,
Vol. 14, No. 4, August 2006, p914-923. |
|
34. |
Y.
Lee, J. Lou, J. Luo, and X. Shen, "An Efficient Packet Scheduling
Algorithm with Deadline Guarantees for Input-Queued Switches," IEEE/ACM
Transactions on Networking, to appear. |
· Conference Publications
|
The
stared papers occurred as journal papers in later dates. |
|
|
1. |
Shen, X., Scoggins, S. and Tang, A., "An Improved RCP-method for Protocol Test Generation Using Backward UIO sequences," Proc. ACM Symposium on Applied Computing (SAC 1991), Kansas city, 1991, p284-293. |
|
2. |
Shen, X. and G. Li, "A New Protocol Conformance Test Generation Method and Experimental Results" , Proceedings of ACM Symposium on Applied Computing ( SAC'92), Kansas City, 1992, p75-84. |
|
3. |
Shen, X. and Q. Hu, "Approximate Submatrix Matching Problems". Proc. ACM Symposium on Applied Computing ( SAC'92), Kansas City, 1992, p993-999. |
|
4. |
Shen,
X. and Tang, A., "On the quality of Protocol Test Sequences by Multiple
UIO Methods," Proc. ISMM First International Conference on
Computer Communications and Networks, (IC3N'92), San Diego, June
8-10, 1992, p20-24. |
|
5. |
Liang,
W. and X. Shen, "A Distributed Algorithm for Topological
Sorting" , Proc. ISMM First International Conference on
Computer Communications and Network. (IC3N'92) San Diego, June
8-10, 1992, p261-264 |
|
6. |
Liang,
W. and X. Shen, "The Linked List Prefix Computation on Mesh Array",
Proceedings of International Computer Science Conference (ICSC'92), Hong
Kong, Dec.13-16, 1992, p183-188. |
|
7. |
Xu,
M. and X. Shen, "A New Fault-Tolerant Generalized Cube with an Extra
Stage", Proceedings of International Computer Science
Conference (ICSC'92), Hong Kong, Dec. 13-16, 1992, p99-105. |
|
8. |
Shen,
X. and Guogang Li, "Protocol Conformance Test Generation Using Circular
UIO with Overlapping", Proceedings of the Second International
Computer Science Conference (ICSC'92), Hong Kong, Dec. 13-16, 1992,
30-36.
|
|
9. |
Shen, X., and W. Liang, "A Parallel Algorithm for Multiple Edge Updates of Minimum Spanning Trees," Proceedings of 7th International Parallel Processing Symposium, April 13-16, 1993, Newport Beach, California, p310-317. |
|
*10. |
Shen,
X., W. Liang, and Q. Hu, "Embedding Between 2-D Meshes of the Same
Size," Proceedings of the 5th IEEE Symposium on Parallel and
Distributed Processing, Dec. 1-4, 1993, Dallas, Texas, p712-719. |
|
*11. |
Shen,
X., W. Liang, and Q. Hu, "Efficient Embedding K-ary Complete Trees into
Hypercubes," Proceedings of 8th International Parallel
Processing Symposium, April 26-29, 1994, Cancun, Mexico,
p710-714.
|
|
12. |
Shen, X. Q. Hu, H. Dai, and X. Wang, "Optimal Routing of Permutations on Rings," Lecture Notes in Computer Science, Vol. 834, Beijing, China, Aug. 1994, p360-368. |
|
13. |
Liang, W., X. Shen, and Q. Hu, "Parallel Algorithms for Verification and Sensitivity Analysis of Minimum Spanning Trees," Proceedings of 1994 International conference on Parallel and distributed Systems, Dec. 19-21, 1994, Taiwan, China, p310-315. |
|
14. |
Liu, L.J., X. Shen, J. Y. Yang, K. Liu, Q. Hu, Y.G. Wu, "Image Processing System To Auto-Analyze Particle Distributions for In- line Particle Holograms," SPIE's International Symposium, Los Angeles California, Jan. 22-29, 1994, Vol. 2122, #24. |
|
15. |
Liang, W. and X. Shen, " Fast Sequential and Parallel Algorithms for Finding the Longest Subsequence or the Maximum Weighted Subsequence," in Proceedings of the Fourth International conference for Young Computer scientists, July 19-21, 1995, Beijing, China, p656-661. |
|
16. |
Han, Y. and X. Shen, "Conservative Algorithms for Parallel and Sequential Integer Sorting," Lecture Notes in Computer Science, Vol. 959, 1995, p324-333. |
|
17. |
Shen,
X. and Y. Zhang, "Partition and migration of k-extra-stage Omega networks,"
Proceedings of 1996 International conference on Parallel Processing,
Bloomingdale, Illinois, Aug. 12-16, 1996, pp. I-97-I-100. |
|
18. |
Shen,
X. and Y. Zhang, "Two Task migration on Omega Networks," Proceedings
of 9th IASTED International Conference on Parallel and Distribute Computing
and Systems, Oct. 13-16, 1997, Washington D. C., pp. 489-492. |
|
*19. |
Shen, X., J. Agrawal, Q. Hu, and Y. Xiong, "Topological Equivalent Classes for Regular MINs of Arbitrary Stages," Proceedings of 9th IASTED International Conference on Parallel and Distribute Computing and Systems, Oct. 13-16, 1997, Washington D. C., pp. 133-138. |
|
*20. |
Hu, Q., Y. Zhang, and X. Shen, "Rearrangable Graphs," Lecture Notes in Computer Science, Vol. 1276, 1997, pp. 441-449, (COCOON 97). |
|
*21. |
Liang,
W., G. Havas, and X. Shen, " Improved lightpath (Wavelength) Routing in
Large WDM Networks," Proceedings of IEEE Intern. Conf in Distributed
Computing System, (ICDCS'98) Amsterdam, 26-29 May 1998, p516-523. |
|
22. |
Agrawal, J., X.Shen, S.R. Irigi, "A Low cost Permutation Network Using Pipelined Architecture for Time-space Tradeoff", Proceedings of 10th IASTED International conference on Parallel and Distribute Computing and Systems (PDCS'98), Las Vegas, Nevada, USA, Oct. 28-31, 1998, p408-413 |
|
*23. |
Liang,
W., Q. Hu, X. Shen, "Finding the Most vital Edge on Meshes
and Hypercubes," Proceedings of 10th IASTED International conference
on Parallel and Distribute Computing and Systems (PDCS'98),
Las Vegas, Nevada, USA, Oct. 28-31, 1998, p14-19. |
|
*24. |
Han,
J., W. Liang, X. Shen, " Very Fast Parallel Algorithm for
Approximate Edge Coloring," Proceedings of 10th IASTED International
conference on Parallel and Distribute Computing and Systems (PDCS'98),
Las Vegas, Nevada, USA, Oct. 28-31, 1998, p244-249. |
|
25. |
Yijie Han and X.Shen, "Parallel Integer Sorting Is More Efficient than Parallel Comparison sorting on Exclusive Write PRAMs," Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99), Baltimore, Maryland, Jan..17-19, 1999, p419-428. |
|
*26. |
Shen, X., Fan Yang, and Yi Pan, " Equivalent Permutation Capabilities between Time Division Optical Omega Network and Non-optical Extra Stage Omega Network," Proc. IEEE International Performance, Computing , and Communications Conference (IPCCC'99), Scottsdale, Arizona, Feb. 10-12, 1999, p356-362. |
|
27. |
Shen, X., Z. Liu, L. Harn, and Y. Lou, " A batch-verifying Algorithm for Multiple Digital Signatures," Proceedings of 11th IASTED International Conference on Parallel and Distribute Computing and Systems (PDCS'99) MIT, Boston, USA, Nov.3-6,1999, p507-510 |
|
28. |
Liang
W. and X. Shen, " Permutation Routing in All-Optical Product
Networks," 11th IPPS/SPDP'99 Workshop, Lecture Notes in Computer
Science, Vol. 1586, p831-844. |
|
29. |
Qingde
Wang, Mao Xu, and X. Shen, "An Efficient Scheme to Transfer
VoATM Trunk Traffic," Proceedings of the IASTED International
Conference on Parallel and Distributed Computing and Systems,
Nov.6-9, 2000, Las Vegas, Nevada, USA, p69-74. |
|
*30 |
Liang
W. and X. Shen, "Finding Multiple Paths in Wide Area WDM Networks,"
Proceedings of the 2002 ICPP workshops on Optical Networks, August 18-21,
2002, Vancouver, B.C., Canada, p99-206. |
|
31 |
H.
Wang, J. Lou, Y. Chen, Y. Sun, and X. Shen, "Achieving Maximum Throughput
with a Minimum Number of Label Switched Paths," Proceedings of the
14th IEEE ICCCN 2005 conference, Oct. 17-19, 2005, San Diego, CA, USA,
p187-192. |
Grant
|
1. |
NSF
Proposal ( with Drs. Medhi, Agrawal, Place, Sohraby) " CISE Research
Instrumentation," July 1994, $55,000, plus $47,000
matching fund from UMKC. |
|
2. |
NSF
proposal "Routing with Minimal Number of Stages," Nov.25, 1997,
$35,900 (CCR-9810692). |
|
3. |
NSF
supplemental funding to "routing with Minimal Number of Stages,
" $29,998 (CCR-9810692), 07/99 |
|
4. |
UMKC
FRG, UMKC Research Board proposal, "New Protocol Test Generation
Methods", Mar.8, 1993, $4,000 (K-2-11134). |
|
5. |
UMKC Research
Board proposal, "Routing Permutations with Minimal Edge Capacity on
Interconnection Networks", Mar. 10, 1994, $3,150 (K-2-11191).
|
|
6. |
UMKC Research
Board proposal, "Self-routing and Fault-tolerant Routing on
Multistage Interconnection Networks", Mar. 10, 1995, $4,982 (K-2-11265).
|
|
7. |
UMRB
proposal, "topological Equivalent Relations of MINs," March 1995,
$17,500 (K-3-40627). |
|
8. |
UMRB
proposal (with J. Agrawal), "Design of Cost Effective Nonblocking
MINs," Oct. 1996, $12,960 (K-3-40758-3000). |
|
9. |
UMKC
FRG, " Rearrangeability of (2n-1)-stage Shuffle-connected
networks," Mar.1999. $2,500 (K-2-11678). |
|
10. |
UMRB
proposal, "Scheduling Packets with Minimum Packet Loss Ratio,"
07/01/2004 - 05/31/2006, $26,800 (K3706020). |
|
11. |
A
total of $23,000 personal gifts received for his research and students
support. |