1  Current Projects

1. Universal Traversal Sequences
   Implementing efficient sequential and parallel algorithms for an analytical-computational method for finding tighter length lower bounds for universal traversal sequences; combinatorial problems embedded in the study of universal traversal sequences.
   
   
2. Complexity Issues in Non-blocking Interconnection Networks
   Narrowing the size lower and upper bounds versus depth for synchronous strictly non-blocking connectors; computational complexity for deciding general wide-sense and strictly non-blocking concentration and generalized-concentration properties.
   
   
3. Index Structures
   Studying space-filling indexing methods and tree index structures for multi-dimensional data.
   
   
4. Computer Network Design and Routing
   Developing and implementing efficient heuristic algorithms for constrained local-access and wide-area network designs, and routing algorithms in computer networks.
   
   

2  Recent Publications

1. Parallel Computation
   J. H. Park and H. K. Dai. Reconfigurable hardware solution to parallel prefix computation. To appear in Journal of Supercomputing, 2008; published online-version in May 2007:
   www.springerlink.com/content/00113134w6h2h725/.
   H. K. Dai and H. C. Su. A parallel algorithm for finding all successive minimal maximum subsequences. In J. R. Correa, A. Hevia, and M. Kiwi, editors, Lecture Notes in Computer Science (3887): LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pages 337-348, Springer-Verlag, Berlin Heidelberg, 2006.
   B. Cong, N. Chen, and H. K. Dai. On embeddings of neural networks onto massively parallel computer systems. Journal of Computer Science and Information Management: Special Issue on Applications of Parallel and Distributed Computing, 2(4):7-13, 1999.
   H. K. Dai. Deciding strictly non-blocking generalized-concentration properties with constrained network parameters. In Proceedings of the Fourth International Symposium on Parallel Architectures, Algorithms, and Networks, pages 22-27. IEEE Computer Society, June 1999.
   H. K. Dai. The complexity of deciding strictly non-blocking concentration and generalized-concentration properties. International Journal of Foundations of Computer Science: Special Issue on Interconnection Networks, 8(3):237-252, 1997.
   H. K. Dai. Strictly non-blocking generalized-concentrators with constrained network parameters. In Proceedings of the Tenth International Conference on Parallel and Distributed Computing Systems, pages 258-262. International Society for Computers and Their Applications, October 1997.
   H. K. Dai. The size complexity of strictly non-blocking fixed ratio concentrators with constant depth. In L. Bougé, P. Fraigniaud, A. Mignotte, and Y. Robert, editors, Lecture Notes in Computer Science (1123-1124): Euro-Par'96 Parallel Processing, pages 234-242, Springer-Verlag, Berlin Heidelberg, 1996.
   H. K. Dai. Strictly non-blocking concentrators with full capacity. In Proceedings of the International Conference on Intelligent Information Management Systems, pages 117-121. International Association of Science and Technology for Development - International Society for Mini and Microcomputers, June 1996.
   H. K. Dai. Probabilistic construction of rearrangeable concentrators. Journal of Computer and Information: Special Issue for Proceedings of the Seventh International Conference on Computing and Information, 1(2):201-217, 1995.
   H. K. Dai. An improvement in the size-depth tradeoff for strictly non-blocking generalized-concentration networks. In C. Halatsis, D. Maritsas, G. Philokyprou, and S. Theodoridis, editors, Lecture Notes in Computer Science (817): PARLE'94 Parallel Architectures and Languages Europe, pages 214-225, Springer-Verlag, Berlin Heidelberg, 1994.
   H. K. Dai. The complexity of deciding strictly non-blocking concentration and generalized-concentration properties with small depth. In Proceedings of the Fifth International Conference on Computing and Information, pages 48-54. IEEE Computer Society, May 1993.
   H. K. Dai. Size-depth tradeoff for synchronous strictly non-blocking generalized-concentrators. In Proceedings of the Fifth International Conference on Computing and Information, pages 41-47. IEEE Computer Society, May 1993.
   H. K. Dai. On synchronous strictly non-blocking concentrators and generalized-concentrators. In Proceedings of the Seventh International Parallel Processing Symposium, pages 406-412. IEEE Computer Society, April 1993.
   H. K. Dai. A probabilistic construction of a class of interconnection networks. In Proceedings of the 25th Small College Computing Symposium, pages 16-25, Small College Computing Symposium, April 1992.
   
   
2. Universal Traversal Sequences
   H. K. Dai. Optimizing a computational method for length lower bounds for reflecting sequences. In J. Wang, editor, Lecture Notes in Computer Science (2108): Computing and Combinatorics, pages 228-236, Springer-Verlag, Berlin Heidelberg, 2001.
   H. K. Dai and K. E. Flannery. Improved length lower bounds for reflecting sequences. In J.-Y. Cai and C. K. Wong, editors, Lecture Notes in Computer Science (1090): Computing and Combinatorics, pages 56-67, Springer-Verlag, Berlin Heidelberg, 1996.
   K. E. Flannery, H. K. Dai, and T. E. O'Neil. Lower bounds for t-reflecting sequences: a computational approach. Journal of Computer and Information: Special Issue for Proceedings of the Sixth International Conference on Computing and Information, 1(1):178-193, 1994
   H. K. Dai, K. E. Flannery, and T. E. O'Neil. Regularity and construction of universal traversal sequences. In Proceedings of the 26th Small College Computing Symposium, pages 355-364. Small College Computing Symposium, April 1993.
   
   
3. Index Structures
   H. K. Dai and H. C. Su. On p-norm based locality measures of space-filling curves. In R. Fleischer and G. Trippen, editors, Lecture Notes in Computer Science (3341): Algorithms and Computation: 15th International Symposium, ISAAC 2004 Proceedings, pages 364-376, Springer-Verlag, Berlin Heidelberg, 2004.
   H. K. Dai and H. C. Su. On the locality properties of space-filling curves. In T. Ibaraki, N. Katoh, and H. Ono, editors, Lecture Notes in Computer Science (2906): Algorithms and Computation: 14th International Symposium, ISAAC 2003 Proceedings, pages 385-394, Springer-Verlag, Berlin Heidelberg, 2003.
   H. K. Dai and H. C. Su. Approximation and analytical studies of inter-clustering performances. In Proceedings of the International Conference on Discrete Random Walks (Discrete Mathematics and Theoretical Computer Science, Volume AC (2003)), pages 53-68, September 2003.
   H. K. Dai and H. C. Su. An empirical study of p-norm based locality measures of space-filling curves. In Proceedings of the 2003 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 1434-1440. Computer Science Research, Education, and Applications Press, June 2003.
   H. K. Dai and H. C. Su. Locality measures of some mesh-indexings. In Proceedings of the 2002 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 1337-1343. Computer Science Research, Education, and Applications Press, June 2002.
   H. C. Su and H. K. Dai. A maintenance algorithm for G⁺-tree index structures. In Proceedings of the 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 1044-1050. Computer Science Research, Education, and Applications Press, June 2001.
   H. K. Dai and K. Furusawa. Maintenance algorithms for modified compact 0-complete trees. In Proceedings of the Fifth International Conference on Computer Science and Informatics, pages 660-666. Association for Intelligent Machinery, February 2000.
   H. K. Dai and K. Furusawa. Modified compact 0-complete trees as index structures. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pages 574-581. Computer Science Research, Education, and Application Tech., July 1998.
   K. Furusawa and H. K. Dai. A study of compact 0-complete trees as index structures. In Proceedings of the Fourteenth Annual International Conference of the International Association of Management - Computer Science Group, pages 160-165. International Association of Management, August 1996.
   
   
4. Combinatorial and Bioinformatic Algorithms
   M. K. Das and H. K. Dai. A survey of the DNA motif finding algorithms (full paper). BioMed Central Bioinformatics, 8(Supplement 7):S21 (15 pages), November 2007.
   M. K. Das and H. K. Dai. A survey of the DNA motif finding algorithms (extended abstract). In Proceedings of the Fourth Annual Conference of the MidSouth Computational Biology and Bioinformatics Society. MidSouth Computational Biology and Bioinformatics Society, February 2007.
   H. K. Dai and L. Zhao. A combined approach to the identification of transcription factor binding sites in prokaryotes. In Proceedings of the Sixth International Symposium on Computational Biology and Genome Informatics, pages 1217-1220. Joint Conference on Information Sciences, July 2005.
   C. C. Chiang and H. K. Dai. On the minimum-cost set-covering problem. In Proceedings of the 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 1199-1205. Computer Science Research, Education, and Applications Press, June 2005.
   H. K. Dai and X. Zhang. Improved linear expected-time algorithms for computing maxima. In M. Farach-Colton, editor, Lecture Notes in Computer Science (2976): LATIN 2004: Theoretical Informatics: 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004 Proceedings, pages 181-192, Springer-Verlag, Berlin Heidelberg, 2004.
   
   
5. Computer Networks
   H. K. Dai and C.-T. Yeh. Content-based image watermarking via public-key cryptosystems. In O. Gervasi and M. L. Gavrilova, editors, Lecture Notes in Computer Science (4705): Computational Science and Its Applications - ICCSA 2007, International Conference, Kuala Lumpur, Malaysia, August 26-29, 2007. Proceedings, Part I, Springer-Verlag, Berlin Heidelberg, 2007.
   H. K. Dai and Y. Du. On the bounded-delay minimum-cost path problem of quality-of-service routing. In Proceedings of the 16th International Conference on Computer Communications and Networks, IEEE ICCCN 2007, pages 384-390. IEEE Computer Society, August 2007.
   H. K. Dai and C.-T. Yeh. On digital watermarking via public-key cryptosystems. In Proceedings of the 2007 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 822-828. Computer Science Research, Education, and Applications Press, June 2007.
   H. K. Dai, Z. Li, and H. C. Su. An empirical study of bounded delay constrained bandwidth routing. In Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 973-979. Computer Science Research, Education, and Applications Press, June 2004.
   H. K. Dai, A. Raju, and V. Sarangan. Routing in mobile ad hoc networks based on block decomposition. In Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 986-992. Computer Science Research, Education, and Applications Press, June 2004.
   K. H. Choi and H. K. Dai. A marking scheme using Huffman codes for IP traceback. In Proceedings of the Seventh International Symposium on Parallel Architectures, Algorithms, and Networks, pages 421-428. IEEE Computer Society, May 2004.
   H. K. Dai and S. Fujino. On designing constrained local access networks. In Proceedings of the Fourth International Symposium on Parallel Architectures, Algorithms, and Networks, pages 167-176. IEEE Computer Society, December 2000.
   H. K. Dai and S. Fujino. Improving the Esau-Williams algorithm for designing local access networks. In Proceedings of the 2000 International Conference on Parallel and Distributed Processing Techniques and Applications, pages 343-350. Computer Science Research, Education, and Applications Press, June 2000.
   
   
6. Machine Learning
   H. K. Dai and G. Wang. Mining a class of complex episodes in event sequences. In N. Megiddo, Y. Xu, and B. Zhu, editors, Lecture Notes in Computer Science (3521): Algorithmic Applications in Management: First International Conference, AAIM 2005 Proceedings, pages 460-471, Springer-Verlag, Berlin Heidelberg, 2005.
   J. Peng, D. R. Heisterkamp, and H. K. Dai. Adaptive discriminant and quasiconformal kernel nearest neighbor classification. In L. Wang, editor, Studies in Fuzziness and Soft Computing (177): Support Vector Machines: Theory and Applications, pages 181-203, Springer-Verlag, Berlin Heidelberg, 2005.
   J. Peng, D. R. Heisterkamp, and H. K. Dai. Adaptive quasiconformal kernel nearest neighbor classification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(5):656-661, May 2004.
   J. Peng, D. R. Heisterkamp, and H. K. Dai. LDA/SVM driven nearest neighbor classification. IEEE Transactions on Neural Networks, 14(4):940-942, 2003.
   A. Auyeung, I. Gondra, and H. K. Dai. Integrating random ordering into multi-heuristic list scheduling genetic algorithm. In A. Abraham, K. Franke, and M. K[o\ddot]ppen, editors, Advances in Soft Computing: Intelligent Systems Design and Applications, pages 447-458, Springer-Verlag, Berlin Heidelberg, 2003.
   A. Auyeung, I. Gondra, and H. K. Dai. Multi-heuristic list scheduling genetic algorithm for task scheduling. In Proceedings of the 2003 ACM Symposium on Applied Computing, pages 721-724. Association for Computing Machinery, March 2003.
   J. Peng, D. R. Heisterkamp, and H. K. Dai. Adaptive kernel metric nearest neighbor classification. In Proceedings of the Sixteenth International Conference on Pattern Recognition, Volume 3, pages 33-36. International Association for Pattern Recognition, August 2002.
   J. Peng, D. R. Heisterkamp, and H. K. Dai. LDA/SVM driven nearest neighbor classification. In Proceedings of the 2001 IEEE Conference on Computer Vision and Pattern Recognition, Volume 1, pages 58-63. IEEE Computer Society, December 2001.
   D. R. Heisterkamp, J. Peng, and H. K. Dai. Adaptive quasiconformal kernel metric for image retrieval. In Proceedings of the 2001 IEEE Conference on Computer Vision and Pattern Recognition, Volume 2, pages 388-393. IEEE Computer Society, December 2001.
   D. R. Heisterkamp, J. Peng, and H. K. Dai. Feature relevance learning with query shifting for content-based image retrieval. In Proceedings of the Fifteenth International Conference on Pattern Recognition, Volume 4, pages 250-253. International Association for Pattern Recognition, September 2000.
   H. K. Dai. On structural modification learning algorithms. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pages 2856-2862. Computer Science Research, Education, and Applications Press, June 1999.
   J. I. Folland and H. K. Dai. Warpnet: neural network with a parabolic warp. In Proceedings of the Seventh International Conference on Parallel and Distributed Computing and Systems, pages 98-102. International Association of Science and Technology for Development - International Society for Mini and Microcomputers, October 1995.
   J. I. Folland and H. K. Dai. Neural networks: survey of structural modification learning algorithms. In Proceedings of the 28th Small College Computing Symposium, pages 307-316, Small College Computing Symposium, April 1995.
   
   
7. Miscellaneous
   H. K. Dai and K. E. Flannery. Making the Ada 95 transition in a newly-formed Ada 83 computer science curriculum. In Proceedings of the Ninth Annual Symposium on Ada Software Engineering Education and Training, pages 169-174, Ada Software Engineering Education and Training Team, June 1995.
   H. K. Dai and K. E. Flannery. On the reliability of the vertical and longitudinal redundancy check. In Proceedings of the 27th Small College Computing Symposium, pages 455-461, Small College Computing Symposium, April 1994.
   H. K. Dai and K. E. Flannery. Ada versus Modula-2: a plan for an empirical comparison of their effectiveness in introductory computer programming courses. In Proceedings of the Twelfth Annual National Conference on Ada Technology, pages 129-133. U. S. Department of Commerce, National Technical Information Service, March 1994.