Alan CH Ling - College of Engineering and Mathematics - University ...

Alan C. H. LingNovember 21, 2013Office: 325 Votey 802-656-8688Department of Computer ScienceUniversity of VermontBurlington, VT05405U.S.A.E-mail: aling@cems.uvm.eduWWW: http://www.cems.uvm.edu/∼aling/Personal InformationCitizenship: Hong Kong and CanadianStatus in US: Permanent ResidentLanguages: Fluency in both Cantonese andEnglishEducation1995-1997 Ph.D. (Combinatorics and Optimization), University of Waterloo, Waterloo, Ontario.Thesis Title: “Pairwise Balanced Designs and Related Codes”.Supervised by Dr. Charles J. Colbourn.1994-1995 M.Math. (Combinatorics and Optimization), University of Waterloo, Waterloo, Ontario.Outstanding Achievement in Graduate Studies – Master’s Program.Thesis Title: “Pairwise Balanced Designs with Consecutive Block Sizes”.Supervised by Dr. Charles J. Colbourn.1991-1994 B.Math. (Combinatorics and Optimization with Pure Mathematics Minor), University ofWaterloo, Waterloo, Ontario.Graduated With Distinction – Dean’s Honours List.Awards• 2002 Kirkman Medal, Institute of Combinatorics and its Applications.• 2001 Outstanding research award (junior level), Michigan Technological University.• 1997 NSERC Postdoctoral Fellowship ($29,000 per year).• 1995-1996 Institute of Computer Research Scholarship ($4,000 per year).• 1994-1996 Faculty of Mathematics Graduate Scholarship, University of Waterloo ($3,000 per year).1

Teaching ExperienceTerm (F,S) Course Size TitleF13 CS 64 62 Discrete StruturesF13 CS 243 27 Theory of ComputationS13 CS 222 13 Computer ArchitecureS13 CS 266 19 Network SecurityF12 CS 64 63 Discrete StructuresF12 CS 243 17 Theory of ComputationS12 CS 266 10 Network SecurityS12 CS 222 11 Computer ArchitectureF11 CS 64 36 Discrete StructuresF11 CS 243 15 Theory of ComputationS11 CS 266 9 Network SecurityS11 CS 222 17 Computer ArchitectureF10 CS 243 23 Theory of ComputationF10 CS 64 41 Discrete StructuresS10 CS 222 9 Computer ArchitectureS10 CS 266 7 Network SecurityF09 CS 201 26 Operating SystemF09 CS 243 21 Theory of ComputationS09 CS 266 12 Network SecurityS09 CS 222 7 Computer ArchitectureF08 CS 243 32 Theory of ComputationF08 CS 64 26 Discrete StructuresF07 MAS 421 7 CombinatoricsS07 CS 266 18 Network SecurityS07 CS 222 12 Computer ArchitectureF06 CS 243 13 Theory of ComputationS06 CS 395 7 Quantum ComputingS06 CS 222 20 Computer ArchitectureF05 CS 201 34 Operating SystemS05 CS 222 28 Computer ArchitectureS05 CS 266 26 Network SecurityF04 CS 243 30 Theorey of ComputationS04 CS 222 32 Computer ArchitectureS04 CS 266 23 Network SecurityF03 CS 201 34 Operating SystemS03 CS 295/316 10 Combinatorial AlgorithmsS03 CS 266 17 Network SecurityF02 MA 295 1 Group TestingF02 CS 243 17 Theory of ComputationS02 CS 103 22 Programming LanguagesF01 CS 266 18 Network SecurityF01 CS 103 32 Programming LanguagesS01 MA 3203 51 Introduction to CryptographyS01 MA 5980 1 Combinatorial DesignsF00 MA 1160 40 Calculus with Technology IF00 MA 3210 23 Introduction to CombinatoricsF99 CS 266 14 Network SecurityF96 MATH 19 30 Calculus I3

Graduate SupervisionCompleted1. L. Li (M.S.), Kirkman triple system of order 27 with a group of order 8, Michigan TechnologicalUniversity.2. M. Guzowski (M.S.), An improved approximation method for wiring an ASIC image/packing combination,University of Vermont.3. K. Simonova, A key predistribution framework for wide-area Wireless sensor networks, Universityof Vermont.Industrial ExperiencePosition Period Institution DepartmentAnalyst 10/97-10/98 Bank of Montreal Quantitative Risk ManagementResearch Interests• Combinatorial design theory including pairwise balanced designs, group divisible designs, triplesystems.• Coding theory, sequence designs and connection to design theory.• Applications of design theory to computer science, engineering and computational biology.Articles in refereed journals1. Y.M. Chee, C.J. Colbourn, A.C.H. Ling and R.M. Wilson, Covering and packing for pairs, Journalof Combinatorial Theory (A) (2013), 1440-1449.2. J.H. Chan, P. Dukes, E.R. Lamken and A.C.H. Ling, The asymptotic existence of resolvable groupdivisible designs, Journal of Combinatorial Designs (2013), 112-126.3. C.J. Colbourn, A.C.H. Ling, G. Quattrocchi, V.R. Syrotiuk, Grooming traffic to minimize load,Discrete Math. (2012), 536-544.4. C.J. Colbourn, G. Ge and A.C.H. Ling, Optical grooming with grooming ration nine, DiscreteMath. (2011) 8-15.5. Y.M. Chee, A.C.H. Ling and J. Yin, Optimal partitioned cyclic difference packing for frequencyhopping and code synchronization, IEEE Trans. on Inform. Theory (2010), 5738-5746.6. A.C.H. Ling, On the existence of well-ordered Steiner triple systems, Ars Combinatoria (2010),411-415.7. Y.M. Chee, G. Ge and A.C.H. Ling, Spectrum of sizes for perfect deletion-correcting codes, SIAMJournal on Discrete Math. (2010), 33-55.8. Y.M. Chee, S.H. Dau, A.C.H. Ling and S. Ling, Linear size optimal q-ary constant-weight codesand constant-composition codes, IEEE Trans. on Inform. Theory (2010), 291-306.9. Y.M. Chee and A.C.H. Ling, Limit on the addressability of fault-tolerant nanowire decoders, IEEEComputer (2009), 60-68.10. C.J. Colbourn and A.C.H. Ling, A recursive construction for perfect hash families, J. Math. Cryptol.(2009), 291-306.4

11. C.J. Colbourn, G. Ge and A.C.H. Ling, Graph designs for the eight-edge five-vertex graphs, DiscreteMath. (2009), 6440-6445.12. A.J. Wolfe, A.C.H. Ling and J.H. Dinitz, The existence of N 2 -resolvable Latin squares, SIAMJournal on Discrete Math. (2009), 1217-1237.13. A.C.H. Ling and J.H. Dinitz, The Hamilton-Waterloo problem with triangle-factors and Hamiltoncycles: the case n ≡ 3 (mod 18), J. Combin. Math. and Combin. Comput. (2009), 143-147.14. P. Dukes and A.C.H. Ling, Existence of balanced sampling plan avoiding adjacent distances, Metrika(2009), 131-140.15. C.J. Colbourn, G. Ge and A.C.H. Ling, Optical grooming with grooming ratio eight, DiscreteApplied Mathematics (2009), 2763-2772.16. J.H. Dinitz, A.C.H. Ling and P. Danziger, Maximum uniformly resolvable designs with block sizes2 and 4, Discrete Math. (2009), 4716-4721.17. R. Zhang, G. Ge, A.C.H. Ling, and H.L. Fu and Y. Mutoh, The existence of r ×4 grid-block designswith r = 3, 4, SIAM Journal on Discrete Math. (2009), 1045-1062.18. R.J.R. Abel, G. Ge, M. Greig and A.C.H. Ling, Further results on (v, {5, w ⋆ }, 1)-PBDs, DiscreteMath. (2009), 2323-2339.19. C.J. Colbourn and A.C.H. Ling, Linear hash families and forbidden configurations, Designs Codesand Crypt. (2009), 25-55.20. J.H. Dinitz and A.C.H. Ling, The Hamilton-Waterloo problem: the case of triangle-factors and oneHamilton cycle, Journal of Combinatorial Designs (2009), 160-176.21. A.C.H. Ling, C.J. Colbourn, and Q. Quattrocchi, Minimum embedding of Steiner triple systemsinto K 4 \ e designs II, Discrete Math. (2009), 400-411.22. C.J. Colbourn, H.L. Fu, G. Ge, A.C.H. Ling and H.C. Lu, Minimizing SONET AMDs in unifirectionalWDM rings with grooming ratio seven, SIAM Journal on Discrete Math. , 2008/09, 109-122.23. Y.M. Chee, G. Ge and A.C.H. Ling, Group divisible codes and their application in the constructionof optimal constant-composition codes of weight three, IEEE Trans. on Inform. Theory (2008),3552-3564.24. Y.M. Chee, S.H. Dau, A.C.H. Ling and S. Ling, The sizes of optimal q-ary codes of weight threeand distance four: a complete solution, IEEE Trans. on Inform. Theory (2008), 3552-3564.25. C.J. Colbourn. A.C.H. Ling and G. Quattrocchi, Minimum embedding of Steiner triple systemsinto K 4 \ e designs I, Discrete Math. (2008), 5308-5311.26. G.Ge, A.C.H. Ling and Y. Miao, A systematic construction for Radar Arrays, IEEE Trans. onInform. Theory (2008), 410-414.27. P. Dukes and A.C.H. Ling, Edge-coloring of K n,n with no long two-colored cycles, Combinatorica(2008), 373-378.28. Y. Chee, A.C.H. Ling and H. Shen, Fine intersection of STS, Graph and Combinatorics (2008),149-157.29. M.B. Cohen, C.J. Colbourn, and A.C.H. Ling, Constructing Strength Three Covering Arrays withAugmented Annealing, Discrete Math. (2008), 2709-2722.30. G. Ge, M. Greig, A.C.H. Ling and R.S. Rees, Resolvable balanced block designs with subdesigns ofblock size 4, Discrete Math. (2008), 2674-2703.5

31. J.H. Dinitz and A.C.H. Ling, Two new infinite families of extremal class-uniformly resolvable designs,Journal of Combinatorial Designs (2008), 213-220.32. Z. He, X.S. Wang, B.S. Lee and A.C.H. Ling, Mining partial periodic correlations in time series,Knowledge and Inform. Systems (2008), 31-54.33. G. Ge and A.C.H. Ling, On the existence of K 5 \ e designs with application to optical networks,SIAM Journal on Discrete Math. (2007), 805-821.34. P. Dukes and A.C.H. Ling, On the asymptotic existence of resolvable graph designs, Can. Math.Bulletin (2007), 504-518.35. Y.M. Chee, A.C.H. Ling, S. Ling and H. Shen, The PBD-closure of constant nonzero-compositioncodes, IEEE Trans. on Inform. Theory (2007), 2685-2692.36. G. Ge and A.C.H. Ling, On the existence of resolvable K 4 \ e designs, Journal of CombinatorialDesigns (2007), 502-510.37. Y.M. Chee and A.C.H. Ling, On Extremal k-Graphs Without Repeated Copies of 2-IntersectingEdges, SIAM Journal on Discrete Math. (2007), 805-821.38. J.H. Dinitz, A.C.H. Ling, and D.R. Stinson, Perfect hash families from transversal designs, AustralasianJournal of Combinatorics (2007), 233-242.39. P. Dukes and A.C.H. Ling, Linear programming bounds for balanced arrays, Journal of Stat. Plann.Stat. Infer. (2007), 324-330.40. D. He, A.N. Arslan and A.C.H. Ling, A Fast Algorithm for the Constrained Multiple SequenceAlignment Problem, Acta Cybernia 17 (2006), 701-717.41. J.H. Dinitz, A.C.H. Ling, and D.R. Stinson, Fault tolerant routing with minimal optical index,Networks 48 (2006), 47-55.42. G. Ge, E.R. Lamken and A.C.H. Ling, Scheduling CCRR tournaments, Journal of CombinatorialTheory (A) 113 (2006), 352-379.43. J.-C. Bermond, C.J. Colbourn, D. Coudert, G. Ge, A.C.H. Ling, and X. Munoz, Traffice grommingin unidirectional wavelength-division multiplexed rings with grooming ratio C = 6, SIAM Journalon Discrete Math. 19 (2005), 523-542.44. P. Dukes and A.C.H. Ling, Disjoint union-free designs with block size three, Bulletin of Insti.Combin. Appli. 45 (2005), 5-10.45. C.J. Colbourn, A.C.H. Ling and G. Quattrocchi, Embedding path designs into kite systems, DiscreteMath. 297 (2005), 38-48.46. G. Ge and A.C.H. Ling, Asymptotic results on the existence of 4-RGDDs and uniform 5-GDDs,Journal of Combinatorial Designs 13 (2005), 222-237.47. G. Ge and A.C.H. Ling, Constructions of quad-rooted double cover, Graph and Combinatorics 21(2005), 231-238.48. G. Ge, C. W. H. Lam, A.C.H. Ling and H. Shen, Resolvable maximum packings with quadruples,Designs Codes and Crypt. 35 (2005), 287-302.49. G. Ge and A.C.H. Ling, Group divisible designs with block size four and group type g u m 1 withminimum m, Designs Codes and Crypt. 34 (2005), 117-126.50. A.C.H. Ling, S. Milici and G. Quattrocchi, Two generalizations of the metamorphosis definition,Bulletin of Insti. Combin. Appli. 43 (2005), 58-66.6

51. G. Ge and A.C.H. Ling, A systematic approach to some block design constructions, Journal ofCombinatorial Theory (A) 108 (2004), 89-97.52. M.L Aggarwal and A.C.H. Ling, On the existence of balanced n-ary reidual treatment-effects designsBulletin of Insti. Combin. Appli. 42 (2004), 115-118.53. G. Ge and A.C.H. Ling, Group divisible designs with block size four and group type g u m 1 for smallg, Discrete Math. 285 (2004), 97-120.54. A.C.H. Ling, P.C. Li, G.H.J. van Rees, G. H. J. Splitting systems and separating systems, DiscreteMath. 279 (2004), 355-368.55. C.J. Colbourn, A.C.H. Ling, and V.R. Syrotiuk, Cover-free families and topology-transparentscheduling in MANETs, Designs Codes and Crypt. (2004), 115-118.56. C.J. Colbourn, T. Klove and A.C.H. Ling, Permutation arrays for powerline communication andmutually orthogonal Latin sqaures, IEEE Trans. on Inform. Theory 50 (2004), 1289-1291.57. J.-C. Bermond, C.J. Colbourn, A.C.H. Ling, and M.L. Yu, Grooming in unidirectional rings: K 4 \edesigns, Discrete Math. 284 (2004), 57-62.58. P. Dukes and A.C.H. Ling, A combinatorial error bound for t-point based sampling, Theo. Comp.Sci. 310 (2004), 479-488.59. M. Keranen, R.S. Rees and A.C.H. Ling, An infinite class of fibre in CURD, Journal of CombinatorialDesigns 12 (2004), 112-122.60. H.-D.O.F. Gronau, D.L. Kreher and A.C.H. Ling, On super-simple (v, 5, 2) designs, Discrete AppliedMathematics 138 (2004), 65-77.61. G. Ge and A.C.H. Ling, Some more 5-GDDs and optimal (v, 5, 1)-packings, Journal of CombinatorialDesigns 12 (2004), 132-141.62. G. Ge, C. W. H. Lam and A.C.H. Ling, Some new uniform frames with block size four and indexone or three, Journal of Combinatorial Designs 12 (2004), 112-122.63. G. Ge and A.C.H. Ling, A survey on resolvable group divisible designs with block size four, DiscreteMath. 279 (2004), 225-245.64. G. Ge and A.C.H. Ling, A new construction for Z-cyclic whist tournaments, Discrete AppliedMathematics 131 (2003), 643-650.65. H. K. Aw, Y.M. Chee and A.C.H. Ling, Six new constant weight binary codes, Ars Combinatoria67 (2003), 313-318.66. J.H. Dinitz, P. Dukes and A.C.H. Ling, Sets of three pairwise orthogonal Steiner triple systems,Journal of Combinatorial Theory (A) 101 (2003), 90-116.67. C.J. Colbourn. A.C.H. Ling and G. Quattrocchi, Minimum embedding of P3-designs into K 4 \ edesigns, Journal of Combinatorial Designs 11 (2003), 352-366.68. M. Chateauneuf, A.C.H. Ling and D.R. Stinson, Slope packings and coverings, and generic algorithmsfor the discrete logarithm problem, Journal of Combinatorial Designs 11 (2003), 36-50.69. R.J. Jamison, T. Jiang and A.C.H. Ling, Canonical Ramsey numbers of trees, Journal of GraphTheory 42 (2003), 1-16.70. A.C.H. Ling, Hyperoval in Steiner systems, J. of Geometry 77 (2003), 128-135.71. C.J. Colbourn and A.C.H. Ling, Graph decompositions with application to wavelength add-dropmultiplexing for minimizing SONET ADMs Discrete Math. 261 (2003), 141-156.7

72. A.C.H. Ling, An application of splittable 4-frame to coloring of K n,n , Discrete Math. 261 (2003),377-382.73. D.L. Kreher, C. Lam, A.C.H. Ling and R.S. Rees, On 4-GDD of type 2 10 , Discrete Math. 261(2003), 373-376.74. J.H. Dinitz, E.R. Lamken, A.C.H. Ling, Complementary partial resolution squares for Steiner triplesystems, Discrete Math. 261 (2003), 243-254.75. A.C.H. Ling, Some applications of combinatorial designs to extremal graph theory, Ars Combinatoria67 (2003), 221-229.76. D. Bryant, H. Gavlas, and A.C.H. Ling, Skolem-type Difference Sets for Cycle Systems, Europ. J.Combinatorics 0 (2003).77. C.J. Colbourn and A.C.H. Ling, Kirkman triple systems of order 27, 33 and 39, J. Combin. Math.and Combin. Comput. 43 (2002), 3-8.78. M. Greig, D.L. Kreher and A.C.H. Ling, On PBIBD designs based on triangular schemes, Annalsof Combinatorics 6 (2002), 147-155.79. Y.M. Chee and A.C.H. Ling, Uniform GDD with block sizes 3 and n, Graph and Combinatorics 18(2002), 421-445.80. C.J. Colbourn, E.R. Lamken, A.C.H. Ling and W.H. Mills, The existence of Kirkman squares—doubly resolvable (ν, 3, 1)-BIBDs, Designs Codes and Crypt. 26 (2002), 169-196.81. B. Stevens, A.C.H. Ling and E. Mendelsohn, A direct construction of transversal covers using groupdivisible designs, Ars Combinatoria 63 (2002), 145-159.82. G. Exoo, A.C.H. Ling, J.P. McSorley, N.C.K. Phillips and W.D. Wallis, Totally magic graphs,Discrete Math. 254 (2002), 103-113.83. A.C.H. Ling, Packings with block size five and index one: v ≡ 2 (mod 4), Ars Combinatoria 63(2002), 223-233.84. I. Adamczak, D.L. Kreher, A.C.H. Ling and R.S. Rees, Further results on the maximum size ofa hole in an incomplete t-wise balanced design with specified minimum block size, Journal ofCombinatorial Designs 10 (2002), 256-281.85. A.C.H. Ling, Difference triangle sets from affine planes, IEEE Trans. on Inform. Theory 48 (2002),2399-2341.86. C.J. Colbourn, A.C.H. Ling and M. Tompa, Construction of optimal quality control for Oligo arrays,Bioinformatics 18 (2002), 529-535.87. S.C. Furino, S. Kagayama, A.C.H. Ling, Y. Miao and J. Yin, Frames with block size four and indexthree, Journal of Stat. Plann. Stat. Infer. 106 (2002), 117-124.88. M.B. Cohen, C.J. Colbourn, L.A. Ives and A.C.H. Ling, Kirkman triple systems of orders 21 withnontrival automorphism group, Mathematics of Computation 71 (2002), 873-881.89. J.H. Dinitz and A.C.H. Ling, The existence of referee squares, Discrete Math. 232 (2001), 109-112.90. N. Alon, C.J. Colbourn, A.C.H. Ling and M. Tompa, Equireplicate balanced binary codes for Oligoarrays, SIAM Journal on Discrete Math. 14 (2001), 481-497.91. C.J. Colbourn and A.C.H. Ling, (M, S)-optimal designs with block size 3, Australasian Journal ofCombinatorics 23 (2001), 171-179.8

92. A.C.H. Ling, More on the existence of quasi-multiples of affine and projective planes, Journal ofCombinatorial Designs 9 (2001), 182-186.93. T.M.J. Vasiga, S. Furino, and A.C.H. Ling, The spectrum of α-resolvable designs with block sizefour, Journal of Combinatorial Designs 9 (2001), 1-16.94. A.C.H. Ling, Y. Lu, G.H.J. Van Rees and L. Zhu, V (m, t)’s for m = 3, 4, 5, 6, Journal of Stat.Plann. Stat. Infer. 86 (2000), 515-525.95. C.J. Colbourn and A.C.H. Ling, Quorum systems from difference covers, Inform. Process. Letters75 (2000), 9-12.96. A.C.H. Ling, C.J. Colbourn, M.J. Grannell and T.S. Griggs, Construction techniques for anti-PaschSteiner triple systems, Journal London Math. Soc. 61 (2000), 641-657.97. C.J. Colbourn and A.C.H. Ling, Modified group divisible designs with block size 4, Discrete Math.219 (2000), 207-221.98. R.J.R. Abel and A.C.H. Ling, Some new direct constructions for (v, {5, w ∗ }, 1) PBDs, J. Combin.Math. and Combin. Comput. 32 (2000), 97-102.99. A.C.H. Ling, On a conjecture of Dénes, Mullen and Suchower, J. Combin. Math. and Combin.Comput. 32 (2000), 219-221.100. Y.M. Chee, C.J. Colbourn and A.C.H. Ling, Asymptotically optimal erasure-resilient codes for largedisk arrays, Discrete Applied Mathematics 102 (2000), 3-36.101. A.C.H. Ling, On 2-chromatic (v, 5, 1)-design, J. of Geometry 66 (1999), 144-148.102. C.J. Colbourn and A.C.H. Ling, Balanced sampling plans with block size four excluding contiguousunits, Australasian Journal of Combinatorics 20 (1999), 37-46.103. C.J. Colbourn and A.C.H. Ling, Kirkman school project designs, Discrete Math. 203 (1999), 49-60.104. Z. Jiang, R.P. Gallant and A.C.H. Ling, The spectrum of cyclic group divisible designs with blocksize three, Journal of Combinatorial Designs 7 (1999), 95-105.105. C.J. Colbourn and A.C.H. Ling, A class of partial triple systems with applications in survey sampling,Commun. Statist. (A) 27 (1998), 1009-1018.106. C.J. Colbourn and A.C.H. Ling, Point codes of Steiner triple systems, Designs Codes and Crypt.14 (1998), 141-146.107. A.C.H. Ling and C.J. Colbourn, Deleting lines in projective planes, Ars Combinatoria 50 (1998),129-138.108. Y.M. Chee, C.J. Colbourn and A.C.H. Ling, Weakly union-free twofold triple systems, Annals ofCombinatorics 1 (1997), 215-225.109. A.C.H. Ling, A direct product construction for 5-sparse triple systems, Journal of CombinatorialDesigns 5 (1997), 443-447.110. R.C. Mullin, A.C.H. Ling, R.J.R. Abel and F.E. Bennett, On the closure of subsets of {4, 5, . . ., 9}contain {4}, Ars Combinatoria 45 (1997), 33-76.111. J. Yin, A.C.H. Ling, C.J. Colbourn and R.J.R. Abel, The existence of uniform 5-GDDs, Journal ofCombinatorial Designs 5 (1997), 275-299.112. C.J. Colbourn and A.C.H. Ling, Pairwise balanced designs with block sizes 8, 9 and 10, Journal ofCombinatorial Theory (A) 77 (1997), 228-245.9

113. Y.M. Chee, C.J. Colbourn, R.P. Gallant and A.C.H. Ling, On a problem of Hartman and Heinrichconcerning pairwise balanced designs with holes, J. Combin. Math. and Combin. Comput. 23(1997), 121-128.114. A.C.H. Ling, X.J. Zhu, C.J. Colbourn and R.C. Mullin, Pairwise balanced designs with consecutiveblock sizes, Designs Codes and Crypt. 10 (1997), 203-222.Chapters in books1. A.C.H. Ling and C.J. Colbourn, Rosa triple systems, in: Geometry, Combinatorial Designs andRelated Structures (J.W.P. Hirschfeld, S.S. Magliveras, M.J. de Resmini; editors) Cambridge UniversityPress, 1997, pp. 149-159.2. F. Bennett, H.-D.O.F. Gronau, A.C.H. Ling and R.C. Mullin, PBD-closure, in CRC Handbook ofCombinatorial Designs (C.J. Colbourn and J.H. Dinitz, eds.), Boca Raton, 1996, pp. 203-213.Articles in refereed conference proceedings1. Y.M. Chee, H.M. Kiah, A.C.H. Ling and C. Wang, Optimal equitable symbol weight codes forpower line communitcations, ISIT, 2012.2. K. Simonova, A.C.H. Ling and X.S. Wang, A key predistribution framework for wide-area Wirelesssensor networks, to appear in ACM workshop on Security of ad hoc and sensor networks, 2006.3. Y.M. Chee, C.J. Colbourn, and A.C.H. Ling, Optimal memoryless encoding for low power off-chipdata buses, in ICCAD 2006: Proceedings of the IEEE/ACM 2006 International Conference onComputer-Aided Design, ACM Press, 2006.4. M.B. Cohen, C.J. Colbourn, and A.C.H. Ling, Augmenting simulated annealing to build interactiontest suites, Proc. IEEE Int Symp Software Reliability Eng (ISSRE 2003), Denver CO, November2003, pp. 394-405.5. V.R. Syrotiuk, C.J. Colbourn, and A.C.H. Ling, Topology-Transparent Scheduling for MANETs usingOrthogonal Arrays, Proceedings Conf. Principles of Mobile Computing (DIALM-POMC2003),San Diego CA, September 2003, 43-49.6. C.J. Colbourn, V.R. Syrotiuk, and A.C.H. Ling, Steiner Systems for Topology-Transparent AccessControl in MANETs, Proceedings of AdHocNow03, Second International Conference on AD-HOCNetworks and Wireless , Montreal CA, October 2003, Lecture Notes in Computer Science 2865(2003), 247-258.7. D.R. de la Torre, C.J. Colbourn and A.C.H. Ling, An application of permutation arrays to blockciphers, Congress. Numer. 145 (2000), 5-7.8. A.C.H. Ling and C.J. Colbourn, Concerning the generating set of Z n , Congress. Numer. 113(1996), 65-72.Professional PracticeServed as referee for– Ars Combinatoria.– Australasian Journal of Combinatorics.– Bulletin of ICA.– Computer Networks.10

– Designs, Codes and Cryptography.– Discrete Mathematics.– Electronic J. of Combinatorics.– IEEE Transactions on Computers.– IEEE Transactions on Information Theory.– Journal of Combinatorial Designs.– Journal of Combinatorial Mathematics and Combinatorial Computing.– Journal of Combinatorial Theory (A).– Journal of Statistical Planning and Inference.– Networks.Organized and participated in Design Theory Seminar at the University of Waterloo (1995-1996).Thesis Examination1. Timothy Alderson, Ph.D., On MDS codes and Bruen-Silverman codes, Department of Mathematics,University of Western Ontario, London, Canada, 2002 (external examiner).Invited conference presentationsTitle Date Conference LocationOn the existence of resolvable06/06 Combinatorics 2006 Ischia, Naplesgraph designsOn resolvable group 07/03 DIMACS Connect Institute Rutgers University, New Jerseydivisible designs with (DCI): Research Workshop onblock size fourCombinatorial Design Theory,On sets of orthogonalSteiner triple systems05/02 Fourth Shanghai Conference onCombinatroicsShanghai Jiao Tong University,ShanghaiDoubly resolvable 07/01 Second Lethbridge Workshop on University of Lethbridge, AlbertaSteiner triple systems Designs, Codes, Cryptographyand Graph TheoryHow did I spend my 05/01 Combinatorial Designs Theory: PIMS, Burnaby, BCsummer in 1999?Resolvability and ParallelismSome applications of 11/00 Emerging Applications of CombinatorialMSRI, Berkeley, CAcombinatorial designsto extremal graph theoryDesignErasure codes and 03/00 Mini-Symposium on Triple SystemThe Fields Institute,Steiner SystemToronto, OntarioDifference triangle sets 05/99 Summer Meeting of Canadian St. John’s, NewfoundlandMathematics Society5-sparse triple systems 07/97 International Conference on Portland, MaineCombinatorics, InformationTheory and Statistics11

Contributed conference presentationsTitle Date Conference LocationA combinatorial errorbound for t-point basedsampling11/02 The Sixteenth Midwest Conferenceon Combinatorics, Cryptographyand ComputingQuality control of manufacturingOligo arraysvia combinatorial designs05/02 DIMACS Conference on theInterconnections among Codes,Designs, Graphs, and MolecularBiologyPairwise balanced designswith block sizesfive, six and sevenResearch GrantsRosa triple systems 04/96 10th Ontario CombinatoricsWorkshopGroup divisible designs 02/96 26th South-Eastern Conferencewith block size fiveon Combinatorics, Graph Theoryand Computing04/95 9th Ontario CombinatoricsWorkshopSouthern Illinois University,Carbondale, IllinoisNational Center of TheoreticalScience, National ChiaoTung University, Hsinchu,TaiwanUniversity of Toronto,Toronto, OntarioBoca Raton, FloridaMcMaster University, Hamilton,OntarioAgency Title Period Amount NoteARO Reliability and Performance of Large 01/02-03/05 299,658+170,505 PI cost share (3 years)Scale Disk ArraysexternalDOE EPSCoR Combinatorial Constructions for 07/01-06/03 30,000 PI, internalOligo Arrays via Combinatorial Desgins12

Seminar presentationsTitle Date LocationOn the existence of resolvable graph 11/05 Carleton University, Ottawa, CanadadesignsOn t-point based sampling 02/04 University of Vermont, Burlington, VermontOn t-point based sampling 06/03 Università degli Studi di L’Aquila, L’Aquila, ItalyGrooming in undirectional rings: K 4 \ 06/03 Università degli Studi L’Aquila L’Aquila, Italye designsOn t-point based sampling 05/03 Università degli Studi di Catania, Catania, ItalyGrooming in undirectional rings: K 4 \ 05/03 Università degli Studi di Catania, Catania, Italye designsSlope packings and coverings, and 10/02 University of Vermont, Burlington, Vermontgeneric algorithms for the discrete logarithmproblemErasure-resilient codes for large disk 06/02 Hong Kong University of Science and TechnologyarraysSlope packings and coverings, andgeneric algorithms for the discrete logarithm04/02 Worcester Polytechnic Institute, Worcester, MassachusettsproblemOn some weak colourings of K n,n 03/02 University of Manitoba, Winnipeg, ManitobaOn some weak colourings of K n,n 01/02 University of Vermont, Burlington, VermontEmbedding STSs into K 4 − e designs 01/02 Università degli Studi di Catania, Catania, ItalyCombinatorial constructions for Oligo 05/01 University of Vermont, Burlington, VermontArrays via Combinatorial DesignsCombinatorial constructions for Oligo 02/01 Lethbridge University, Lethbridge, AlbertaArraysQuality Control in Manufacturing 10/00 Brock University, St. Catherines, OntarioOligo ArraysAn introduction to cryptography 10/00 Brock University, St. Catherines, OntarioErasure codes and Steiner systems 02/00 University of Vermont, Burlington, VermontErasure codes and Steiner systems 02/00 York University, Toronto, OntarioErasure codes and Steiner systems 02/00 Brock University, St. Catherines, OntarioErasure codes and Steiner systems 02/00 Worcester Polytechnic Institute, Worcester, MassachusettsAn introduction to financial derivatives02/00 Worcester Polytechnic Institute, Worcester, MassachusettsErasure codes 02/00 Michigan Technological University, Houghton,MichiganDeletion/Insertion codes 10/99 University of Vermont, Burlington, VermontDifference triangle sets 06/99 University of Vermont, Burlington, VermontAnti-Pasch Steiner triple systems 02/97 University of Winnipeg, Winnipeg, ManitobaWeakly union free twofold triple systems02/97 University of Manitoba, Winnipeg, ManitobaAnti-Pasch Steiner triple systems 01/97 University of Toronto, Toronto, OntarioOptical orthogonal codes 09/96 University of Vermont, Burlington, VermontPackings with block size five 06/96 University of Waterloo, Waterloo, OntarioGroup divisible designs with block size 04/96 Auburn University, Auburn, AlabamafiveRosa triple systems 03/96 Auburn University, Auburn, AlabamaPairwise balanced designs with consecutive03/96 University of Waterloo, Ontarioblock sizesDeleting lines in projective planes 11/95 University of Waterloo, Waterloo, OntarioModified group divisible designs withblock size four09/95 University of Waterloo, Waterloo, Ontario13

References• Dr. Charles J. ColbournDepartment of Computer Science and EngineeringArizona State UniversityP.O. Box 875406Tempe, Arizona 85287-5406(480) 965-3190email: Charles.Colbourn@asu.edu• Dr. J.H. DinitzDepartment of Mathematics and StatisticsUniversity of VermontBurlington, VT 05405U.S.A.(802) 656-4284email: Jeff.Dinitz@uvm.edu• Dr. Ronald C. MullinDepartment of Combinatorics and OptimizationUniversity of WaterlooWaterloo, OntarioN2L 3G1CANADA(519) 888-4069email: rcmullin@math.uwaterloo.ca• Dr. Douglas R. StinsonSchool of Computer ScienceUniversity of WaterlooWaterloo Ontario, N2L 3G1Canada519) 888-4567, ext. 5590email: dstinson@waterloo.ca14