Publications

Papers

         Limin XIANG, Kai CHENG, and Kazuo USHIJIMA,

Sequence analysis in constant time on BSR, PDCAT¨06, Taipei, December 4-7, 2006, pp.431-436.

         Limin XIANG, Kai CHENG, and Kazuo USHIJIMA,

On Gray Codes for Set Partitions, Proc. Information-MFCSIT'06, Cork, Ireland, August 1-5, 2006, pp.180-183.

           Limin XIANG, Kazuo USHIJIMA, Kai Cheng, Jianjun ZHAO, and Cunwei Lu,

Constant Time Algorithm to Generate Plus and Minus Symbol Sequences, INFORMATION, vol.9, no.2, 2006, pp.331-337.

           Limin XIANG, Kai CHENG, and Kazuo USHIJIMA,

Encoding a Binary Search Tree in Constant Time on BSRProc. PDCAT 2005, IEEE CS Press, Dalian, China, December 5-8, 2005, pp.740-744.

           Kai CHENG, Limin XIANG, Toyohiko HIROTA, and Kazuo USHIJIMA,

A Web-based Classroom Environment for Enhanced Residential College EducationICWL 2005(LNCS3583),Springer, Hong Kong, July 31-August 3, 2005, pp.56-65.

           Kai CHENG, Mizuho IWAIHARA, Limin XIANG, and Kazuo USHIJIMA,

Efficient Web Profiling by Time-Decaying Bloom Filters, DBSJ Letters, vol.4, no.1, 2005, pp.137-140.

           Kai CHENG, Limin XIANG, and etc.,

Time-Decaying Bloom Filters for Data Streams with Skewed Distributions, RIDE 2005, IEEE CS Press, Tokyo, April 3-7, 2005, pp.63-69.

           Cunwei LU, Limin XIANG, and Seiji INOKUCHI,

Optimization of the Projection Pattern and a Quasi-optimal Combination Generation Algorithm for 3-D Shape MeasurementIEICE Transactions on Information and systems, vol. J88-D2, no.2, 2005, pp.325-333.

           Jianjun ZHAO, and Limin XIANG,

Chapter VIII: Architectural Slicing to Support System Evolution, in Book: Managing Corporate Information Systems Evolution and Maintenance (Edited by K. Khan and Y. Zhang), Idea Group Publishing, © 2005, pp.197-210.

           Limin XIANG, Kazuo USHIJIMA, Kai Cheng, Jianjun ZHAO, and Cunwei Lu,

O(1) Time Algorithm on BSR for Constructing a Binary Search Tree with Best Frequencies, Proc. PDCAT 2004 (LNCS3320), Springer, Singapore, December 8-10, 2004, pp. 218-225.

           Limin XIANG, Kazuo USHIJIMA, Kai Cheng, Jianjun ZHAO, and Cunwei Lu,

Generating Gray Codes for Sequences of Plus and Minus Symbols, Proc. the 3rd International Conference on INFORMATION, III, Tokyo, November 29-December 2, 2004, pp.460-463.

           Limin XIANG, Kazuo USHIJIMA, and Jianjun ZHAO,

An O(1) Time Algorithm for Generating Restricted Permutations, INFORMATION, vol.6, no.4, 2003, pp.417-426.

           Cunwei LU and Limin XIANG,

Optimal intensity-modulation projection technique for three-dimensional shape measurement, Applied Optics, vol.42, no.23, 2003, pp.4649-4657.

           Limin XIANG, Kazuo USHIJIMA, Jianjun ZHAO, Tianqing ZHANG, and Changjie TANG, 

O(1) Time Algorithm On BSR for Constructing a Random Binary Search Tree, Proc. PDCAT 2003, IEEE Press, Chengdu, China, August 27-29, 2003, pp.599-602.

           Limin XIANG, Kazuo USHIJIMA, and Jianjun ZHAO,

Time Optimal n-Size Matching Parentheses and Binary Tree Decoding Algorithms on a p-Processor BSR, Parallel Processing Letters,          vol.12, no.3-4, 2002, pp.365-374.

           Jianjun Zhao, Hongji Yang, Limin Xiang, and Baowen Xu,

Change Impact Analysis to Support Architectural Evolution, Journal of Software Maintenance and Evolution: Research and Practice, vol.14, no.5, 2002, pp.317-333.

           Limin XIANG and Kazuo USHIJIMA,

O(1) Time Algorithm on BSR for Computing Convex Hull, Proc. PDCS 2002, ACTA Press, Cambridge, USA, November 4-6, 2002, pp.143-146.

           Cunwei LU and Limin XIANG,

3-D Image Measurement Using Optimal Intensity-modulation Projection Technique, Proc. SIP 2002, ACTA Press, Kauai, August 12-14, 2002, pp.648-653.

           Limin XIANG and Kazuo USHIJIMA,

An O(1) Algorithm for Generating Restricted Permutations, Proc. the 2nd International Conference on INFORMATION, Beijing, July 24-27, 2002, pp.236-241.

           Limin XIANG, Kazuo USHIJIMA, and Yuichi ASAHIRO,

Coding k-ary trees for efficient loopless generation in lexicographic order, Proc. ITCC 2002, IEEE Computer Society Press, Las Vegas, April 8-10, 2002, pp. 396-401.

           Jianjun ZHAO, Limin XIANG, Kouichi NISHIMI, and Tomofumi HARADA,

Understanding Java Bytecode Programs using Kafer, Proc. Applied Informatics 2002, ACTA Press, Innsbruck, February 18-21, 2002, pp.108-112.

           Limin XIANG and Kazuo USHIJIMA,

On time bounds, work-time scheduling principle and optimality for BSR, IEEE Trans. Parallel Distrib. Systems, vol.12, no.9, 2001, pp.912-921.

           Limin XIANG and Kazuo USHIJIMA,

On O(1) time algorithms for combinatorial generation, The Computer Journal, vol.44, no.4, 2001, pp.292-302.

           Limin XIANG, Kazuo USHIJIMA, and Changjie TANG,

On generating k-ary trees in computer representation, Information Processing Letters, vol.77, no.5-6, 2001, pp.231-238.

           Limin XIANG, Kazuo USHIJIMA, and Changjie TANG,

Efficient loopless generation of Gray codes for k-ary trees, Information Processing Letters, vol.76, no.4-6, 2000, pp.169-174.

           Limin XIANG, Kazuo USHIJIMA, and Selim G. AKL,

Generating regular k-ary trees efficiently, The Computer Journal, vol.43, no.4, 2000, pp.290-300.

           Limin XIANG and Kazuo USHIJIMA,

Optimal Parallel Merging Algorithms on BSR, Proc. I-SPAN 2000, IEEE Computer Society Press, Dallas, December 7-9, 2000, pp.12-17.

           Limin XIANG, Armin LAWI, and Kazuo USHIJIMA,

On Constructing a Binary Tree from Its Traversals, Res. Rep. ISEE Kyushu University, vol.5, no.1, 2000, pp.13-18.

           Limin XIANG and Kazuo USHIJIMA,

Grammar-oriented Enumeration of Arbitrary Trees and Arbitrary k-ary Trees, IEICE Trans. Inf. & Syst., vol.E82-D, no.9, 1999, pp.1245-1253.

           Limin XIANG and Kazuo USHIJIMA,

A theorem on the relation between BSRk and BSR+, Information Processing Letters, vol.71, no.2, 1999, pp.71-73.

           Limin XIANG and Kazuo USHIJIMA,

Rearranging scattered information on BSR, Information Processing Letters, vol.71, no.1, 1999, pp.43-47.

           Limin XIANG, Kazuo USHIJIMA, Selim G. AKL, and Ivan STOJMENOVIC,

An Efficient Implementation for the BROADCAST Instruction of BSR+, IEEE Trans. Parallel Distrib. Systems, vol.10, no.8, 1999, pp.852-863.

           Limin XIANG and Kazuo USHIJIMA,

Decoding and drawing on BSR for a binary tree from its i-p sequence, Parallel Processing Letters, vol.9, no.1, 1999, pp.103-110.

            Changjie TANG, Rynson W. H. LAU, Huabei YIN, Qing LI, Lu YANG, Zhonghua YU, Limin XIANG, and Tianqing ZHANG,

Discovering Tendency Association between Objects with Relaxed Periodicity and its Application in Seismolo, Proc. ICSC'99( LNCS 1749),Springer, Hong Kong, Dec. 13-15, 1999, pp.51-62.

           Limin XIANG and Kazuo USHIJIMA,

ANSV problem on BSRs, Information Processing Letters, vol.65, no.3, 1998, pp.135-138.

           Limin XIANG and Kazuo USHIJIMA,

Decoding and drawing an arbitrary tree from its pre-post sequence, Proc. PDCS'98, ACTA Press, Las Vegas, Oct. 28-31, 1998, pp.182-185.

           Limin XIANG, Kazuo USHIJIMA, and Changjie TANG,

Grammar-oriented enumeration of binary trees, The Computer Journal, vol.40, no.5, 1997, pp.278-291.

           Limin XIANG and Kazuo USHIJIMA,

Iterative formulas for enumerating binary trees, Res. Rep. ISEE Kyushu University, vol.2, no.2, 1997, pp.179-183.

           Limin XIANG and Kazuo USHIJIMA,

Properties on leftchain trees, Res. Rep. ISEE Kyushu University, vol.2, no.1, 1997, pp.9-13.

Invited Lecture

           Limin XIANG and Kazuo USHIJIMA

A General Method for the Loopless Generation of Combinatorial Objects, Twelfth International Colloquium on Numerical Analysis and Computer Science with Applications, Plovdiv, Bulgaria, August 12-17, 2003.

Books

           Changjie TANG, Limin XIANG, Lan XIONG, and Ming XIONG,

          The Design and Implementation of DBMS (in Chinese), Beijing: Electronic Industry Press, ISBN 7-5053-1946-9/TP473, May, 1993.

           Kazuo USHIJIMA, Limin XIANG, and Yuichi ASAHIRO,

          Discrete Mathematics (in Japanese) , Corona Publishing Co., LTD,  September, 2006.