The University of Adelaide Australia
 Home  >> Research  >> Publications  >> Hong Shen  ||  Courses  ||  Programs  ||  Staff  ||  Research  || 

Here is a list of my selected journal publications, contact me at hong.shen@adelaide.edu.au for a full publication list.



A

0-1.     H. Shen and S. Xu, "œCoordinated En-Route Web Caching in Multiserver Networks", IEEE Transcations on Computers, accepted Aug 2008.

0-2.     Yingpeng Sang and Hong Shen, "œEfficient and Secure Protocols for Privacy Preserving Set Operations", ACM Transactions on Information Systems and Security, accepted Nov. 2008.

0-3.     Y. Sang, H. Shen and H. Tian, "œPrivacy Preserving Tuple Matching in Distributed Databases", IEEE Transactions on Knowledge and Data Engineering, accepted Jan 2009.

0-4.     H. Zhang and H. Shen, "œBalancing Energy Consumption to Maximize Network Lifetime in Data-gathering Sensor Networks", IEEE Transactions on Parallel and Distributed Systems, accepted Nov. 2008.

0-5.     Z. Zhang and H. Shen, "œM-AID: An Adaptive Middleware Built Upon Anomaly Detectors for Intrusion Detection and Response", ACM Transactions on Autonomous and Adaptive Systems, accepted Feb. 2008.

0-6.     H. Shen and Y. Zhang, "œImproved Approximate Detection of Duplicates for Data Streams Over Sliding Windows", Journal of Computer Science and Technology, Vol. 23, No. 6, 2008, pp. 973-987.

0-7.     K. Li, H. Shen, F. Chin, W. Zhang, "œMultimedia Object Placement for Transparent Data Replication", IEEE Transactions on Parallel and Distributed Systems, Vol.  18, No. 2, 2007, pp. 212-224.


1.        H. Kan, H. Shen, “Lower bounds on the minimal delay of complex orthogonal designs with maximal rates”, IEEE Transactions on Communications, Vol.  54, No. 3, 2006, p. 383-388

2.        H. Tian and H. Shen, “Multicast Based Inference for Topology and Network-Internal Loss Performance from End-to-end Measurements", Computer Communications, Elsevier, Vol 29, No. 11, 2006, p. 1936-1947.

3.        H. Tian, H. Shen and T. Matsuzawa, “Random Walk Routing for Wireless Sensor Networks with Regular Topologies”, Journal of Computer Science and Technology, Vol. 21, No. 4, 2006, p. 496-502

4.        K. Li and H. Shen, “Coordinated En-Route Multimedia Object Caching in Transcoding Proxies for Tree Networks”, ACM Transactions on Multimedia Computing, Communications and Applications (TOMCAPP), Vol. 1, No. 3, 2005, p. 289-314.

5.        K. Li, H. Shen, F. Chin, and S. Zheng, “Optimal Methods for Coordinated En-Route Web Caching for Tree Networks”, ACM Transactions on Internet Technology (TOIT), Vol. 5, No. 3, 2005, p. 480-507.  

6.        H. Kan and H. Shen, “A relation between the characteristic generators of a linear code and its dual,” IEEE Transactions on Information Theory, Vol. 51, No. 3, 2005, p. 1199-1202.

7.        H. Kan and H. Shen, A counterexample for the conjecture on the minimal delay of orthogonal designs with maximal rates, IEEE Transactions on Information Theory, Vol. 51, No. 1, 2005, p. 355-359.

8.        G. Xie and H. Shen, “Highly Scalable, Low-Complexity Image Coding Using Zeroblocks of Wavelet Coefficients”, IEEE Transactions on Circuits and Systems for Video Technology, Vol. 15, No. 6, 2005, p. 762-770.

9.        Z. Zhang and H. Shen, “Application of Online-training SVMs for Real-time Intrusion Detection with Different Considerations”, Computer Communications, Vol.28,  No. 12, Elsevier, 2005, p.1428-1442.

10.    H. Kan and H. Shen, Trellis Properties of Product codes, IEICE Transactions on Fundamentals, Vol. E88-A, No. 1, Jan. 2005.

11.    J. Li, H. Shen and R. Topor, “Mining informative rule set for prediction”, Journal of Intelligent Information Systems, Vol. 22, No. 2, 2004, p. 155-174.

12.    X. Jiang, H. Shen, Md. M. and S. Horiguchi, “Blocking Behaviors of Crosstalk-free Optical Banyan Networks on Vertical Stacking”, IEEE/ACM Trans. Networking, Vol. 11, No. 6, 2003, p. 982-993.

13.    X. Jiang, H. Shen, Md. M.R. Khandker and S. Horiguchi, “A new scheme to realize crosstalk-free permutation in vertically stacked optical MINs”, Photonic Network Comm, Vol. 5, No. 1, 2003, p. 89-102.

14.    Y. Wang, X. Song, M. Aboulhamid, H. Shen, “Near-optimal residue to binary converter for the moduli”  IEEE Transactions on Signal Processing, Vol. 50, No. 7, pp. 1772-1779, 2002.

15.    Y. Han, Y. Pan and H. Shen ``Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus", IEEE Transactions on Computers, Vol. 51, No. 5, 2002, p. 702-707.

16.    S. D. Chen, H. Shen and R. Topor ``Permutation-based range-join algorithms on N-dimensional meshes", IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 4, 2002, p. 413-431.

17.    J. Li, H. Shen and R. Topor, “Mining optical class rule set”, Knowledge-Based Systems (Elsevier), Vol. 15, No. 7, 2002, p. 399-405.

18.    S. Chen, H. Shen and R. Topor, “An efficient algorithm for constructing Hamiltonian paths in meshs”, Parallel Computing, Vol. 28, No. 11, 2002, p. 1293-1305.

19.    W. Liang, R. Brent, H. Shen, ``Fully dynamic maintenance of k-connectivity in parallel", IEEE Transactions on Parallel and Distributed Systems, Vol. 12, No. 8, 2001, p. 846-864.

20.    Y. Pan, S.Q. Zheng, K. Li, H. Shen, ``An improved generalization of mesh-connected computers with Multiple Buses", IEEE Transactions on Parallel and Distributed Sys., Vol. 12, No. 3, pp. 293-305, 2001.

21.    H. Shen, S. Lor, P. Maheshwari, "An architecture-independent graphical tool for automatic contention-free process-to-processor mapping", Journal of Supercomputing, Vol.. 18, No. 2, 2001, p. 115-139.

22.    A. Harwood and H. Shen, “A new family of extremal interconnection networks”, Journal of Interconnection Networks, Vol. 2, No. 4, 2001, p. 421-444.

23.    A. Harwood, H. Shen, ``Using fundamental electrical theory for varying time quantum uniprocessor scheduling", Journal of Systems Architecture, Vol. 47, No. 2, 2001, p. 181-192.

24.    H. Shen, ``Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree", Int. Journal of Computer Mathematics, Vol. 75, No 2, 2000, p. 129-136.

25.    L. Shen, H. Shen, L. Cheng and Paul Pritchard, "Fast Association Discovery in Derivative Transaction Collections", journal of Knowledge and Information Systems, (Springer), Vol. 2, No. 2, 2000, p. 147-160.

26.    S. Venema, H. Shen and F. Suraweera, `` NC algorithms for the single most vital edge problem with respect to all pairs shortest paths", Parallel Processing Letters, Vol. 10, No. 1, pp. 51-58, 2000.

27.    L. Shen, H. Shen, L. Cheng and Paul Pritchard, "Fast Association Discovery in Derivative Transaction Collections", journal of Knowledge and Information Systems, (Springer), Vol. 2, No. 2, 2000, p. 147-160.

28.    H. Shen, ``Optimal multiselection in hypercubes", Parallel Algorithms and Applications (Gordon & Breach), Vol. 14, No. 3, p. 203-213, 2000.

29.    H. Shen, F. Chin and Y. Pan, ``Efficient fault-tolerant routing in multihop optical WDM networks", IEEE Transactions. on Parallel and Distributed Systems, Vol. 10, No. 10, 1999, p. 1012-1025.

30.    H. Shen, ``Finding the k most vital edges with respect to minimum spanning tree", Acta Informatica (Springer-Verlag), Vol. 36, 1999, p. 405-424.

31.    L. Shen, H. Shen and L. Cheng ``New Algorithms for Efficient Mining of Association Rules", Information Sciences (Elsevier), Vol. 118, 1999, p. 251-268.

32.    H. Shen, D. J. Evans, W. Liang and Yuke Wang, ``Multiple multicasting in wide-area fiber-optic networks", IECIE Trans. Information and Systems (EIC), Vol. E82-D, No. 6, 1999, 1074-1078.

33.    H. Shen, W. Liang and J. K-W. Ng, ``Efficient Computation of Frequent Itemsets in A Subcollection of Multiple Set Families", Informatica, Vol. 23, No. 4, 1999, p. 543-548.

34.    H. Shen, K. Li, Y. Pan, G.H. Young and S.Q. Zheng, ``Performance analysis for dynamic tree embedding in k-partite networks by random walk", J. of Parallel and Distributed Computing (special issue), Vol. 50, No. 1, 1998, p. 144-156.

35.    K. Li, Y. Pan, H. Shen, G.H. Young and S.Q. Zheng, ``Lower bounds for dynamic tree embedding in bipartite networks", J. of Parallel and Distributed Computing, V. 53, 1998, p. 119-143.

36.    P. Maheshwari and H. Shen, An efficient clustering algorithm for partitioning parallel programs, Parallel Computing, Vol. 24, No. 5-6, 1998, p. 893-909.

37.    H. Shen, J. You and D.J. Evans, ``An efficient parallel algorithm for visible-surface detection in 3D graphics display", Int. J. of Computer Mathematics (Gordon & Sons), V. 67, 1998, p. 359-371.

38.    H. Shen, ``Optimal parallel multiselection on EREW PRAM", Parallel Computing (North-Holland), V. 23, 1997, p. 1987-92.

39.    H. Shen, ``Optimal algorithms for generalized matrix search problem", Theoretical Computer Science (North-Holland), V. 188, p. 1997, 221-230.

40.    H. Shen, D.J. Evans and J. You, ``Fault-tolerant multicasting with load balancing in hypercubes'', Parallel Algorithms and Applications, Vol. 11, 1997, p. 287-298.

41.    H. Shen, ``Efficient multiple multicasting in hypercubes'', J. System Architectures (North-Holland), Vol.43, No.9, 1997, p. 655-662.

42.    H. Shen and W. Liang, ``Efficient enumeration of all minimal separators in a graph'', Theoretical Computer Science (North-Holland), Vol. 180, 1997, p. 169-180.

43.    S. Venema, H. Shen and F. Suraweera, ``An NC algorithm for finding the most vital edge with respect to the shortest path problem'', Information Processing Letters (North-Holland), Vol.60, No.5, 1996, p. 243-248.

44.    W. Liang, B. McKay and H. Shen, ``NC algorithms for dynamically solving the all pairs shortest path problem and related problems'', Information Processing Letters, Vol. 58, 1996, p. 149-155.

45.    H. Shen and S. Ramnath, ``Optimal parallel selection in sorted matrices'', Information Processing Letters, Vol. 59, 1996, 117-122.

46.    H. Shen and D.J. Evans, ``An optimal parallel algorithm for generating integer compositions'', J. of Parallel Algorithms and Applications, Vol. 9, 1996, p. 101-109.

47.    H. Shen and D.J. Evans, ``Fast sequential and parallel algorithms for finding the extremal sets in a family of sets'', Int. J. of Computer Mathematics (Gordon & sons), Vol. 61, No. 3-4, 1996, p. 195-211.

48.    H. Shen, ``Parallel k-set mutual range-join in hypercubes'', Microprocessing and Microprogramming (North-Holland), Vol. 41, No. 7, 1995, p. 443-448.

49.    H. Shen, ``Efficient parallel k-set chain range-join in hypercubes'', The Computer Journal (Cambridge Press), Vol. 38, No. 3, 1995, p. 217-225.

50.    H. Shen, ``An efficient permutation-based parallel algorithm for range-join in hypercubes'', Parallel Computing (North-Holland), Vol. 21, 1995, p. 303-313.

51.    S.D. Chen, H. Shen and R. Topor, ``An efficient permutation-based parallel range-join algorithm on N-dimensional torus computers'', Information Processing Letters, Vol. 52, 1994, No. 1, p. 35-38.

52.    H. Shen, ``Efficient message routing in PrS-network'', Microprocessing and Microprogramming (North-Holland), Vol. 40, No. 1, 1994, p. 57-64.

53.    H. Shen and R.J.R. Back, ``Construction of large-size interconnection networks with high performance'', NETWORKS, Vol. 23, No. 4, 1993, p. 399-414.

54.    H. Shen, ``A high performance interconnection network for multiprocessor systems'', Parallel Computing (North-Holland), Vol. 19, No. 9, 1993, p. 993-1001.

55.    H. Shen, ``Improved universal k-selection in hypercubes'', Parallel Computing (North-Holland), Vol. 18, No. 2, 1992, p. 177-184.

56.    H. Shen, ``Self-adjusting mapping: a heuristic mapping algorithm for mapping parallel programs onto transputer networks'', The Computer Journal (Cambridge Press), Vol. 35, No. 1, 1992, p. 71-80.

57.    H. Shen, ``Fast path-disjoint routing for transputer networks'', Microprocessing and Microprogramming (North-Holland), Vol. 33, No. 1, 1991, p. 21-31.

58.    H. Shen, ``Efficient design and implementation of parallel algorithms'', Acta Academiae Aboensis, Ser. B (Mathematica et Physica), Vol. 51, No. 3, 1991, p. 1-20.

59.    T. Hagerup and H. Shen, ``Improved non-conservative sequential and parallel integer sorting", Information Processing Letters (North-Holland), Vol. 36, No. 2, 1990, p. 57-63.

60.    H. Shen and G.L. Chen, ``A new upper bound of delay time in selection networks", Chinese Journal of Computers (Science Press), Vol. 13, No. 2, 1990, 88-100.

61.    G.L. Chen and H. Shen, ``A bitonic selection algorithm on multiprocessor system", J. of Computer Sci. & Tech. (Science Press, English), Vol. 4, No. 4, 1989, 315-322.

62.    H. Shen and G.L. Chen, ``Parallel selection using recursive filtering", Chinese Journal of Computers, Vol. 11, No. 9, 1988 (Science Press), 523-532.