113. Y.M. Chee, C.J. Colbourn, R.P. Gallant <strong>and</strong> A.C.H. <strong>Ling</strong>, On a problem <strong>of</strong> Hartman <strong>and</strong> Heinrichconcerning pairwise balanced designs with holes, J. Combin. Math. <strong>and</strong> Combin. Comput. 23(1997), 121-128.114. A.C.H. <strong>Ling</strong>, X.J. Zhu, C.J. Colbourn <strong>and</strong> R.C. Mullin, Pairwise balanced designs with consecutiveblock sizes, Designs Codes <strong>and</strong> Crypt. 10 (1997), 203-222.Chapters in books1. A.C.H. <strong>Ling</strong> <strong>and</strong> C.J. Colbourn, Rosa triple systems, in: Geometry, Combinatorial Designs <strong>and</strong>Related Structures (J.W.P. Hirschfeld, S.S. Magliveras, M.J. de Resmini; editors) Cambridge <strong>University</strong>Press, 1997, pp. 149-159.2. F. Bennett, H.-D.O.F. Gronau, A.C.H. <strong>Ling</strong> <strong>and</strong> R.C. Mullin, PBD-closure, in CRC H<strong>and</strong>book <strong>of</strong>Combinatorial Designs (C.J. Colbourn <strong>and</strong> J.H. Dinitz, eds.), Boca Raton, 1996, pp. 203-213.Articles in refereed conference proceedings1. Y.M. Chee, H.M. Kiah, A.C.H. <strong>Ling</strong> <strong>and</strong> C. Wang, Optimal equitable symbol weight codes forpower line communitcations, ISIT, 2012.2. K. Simonova, A.C.H. <strong>Ling</strong> <strong>and</strong> X.S. Wang, A key predistribution framework for wide-area Wirelesssensor networks, to appear in ACM workshop on Security <strong>of</strong> ad hoc <strong>and</strong> sensor networks, 2006.3. Y.M. Chee, C.J. Colbourn, <strong>and</strong> A.C.H. <strong>Ling</strong>, Optimal memoryless encoding for low power <strong>of</strong>f-chipdata buses, in ICCAD 2006: Proceedings <strong>of</strong> the IEEE/ACM 2006 International Conference onComputer-Aided Design, ACM Press, 2006.4. M.B. Cohen, C.J. Colbourn, <strong>and</strong> A.C.H. <strong>Ling</strong>, Augmenting simulated annealing to build interactiontest suites, Proc. IEEE Int Symp S<strong>of</strong>tware Reliability Eng (ISSRE 2003), Denver CO, November2003, pp. 394-405.5. V.R. Syrotiuk, C.J. Colbourn, <strong>and</strong> A.C.H. <strong>Ling</strong>, Topology-Transparent Scheduling for MANETs usingOrthogonal Arrays, Proceedings Conf. Principles <strong>of</strong> Mobile Computing (DIALM-POMC2003),San Diego CA, September 2003, 43-49.6. C.J. Colbourn, V.R. Syrotiuk, <strong>and</strong> A.C.H. <strong>Ling</strong>, Steiner Systems for Topology-Transparent AccessControl in MANETs, Proceedings <strong>of</strong> AdHocNow03, Second International Conference on AD-HOCNetworks <strong>and</strong> Wireless , Montreal CA, October 2003, Lecture Notes in Computer Science 2865(2003), 247-258.7. D.R. de la Torre, C.J. Colbourn <strong>and</strong> A.C.H. <strong>Ling</strong>, An application <strong>of</strong> permutation arrays to blockciphers, Congress. Numer. 145 (2000), 5-7.8. A.C.H. <strong>Ling</strong> <strong>and</strong> C.J. Colbourn, Concerning the generating set <strong>of</strong> Z n , Congress. Numer. 113(1996), 65-72.Pr<strong>of</strong>essional PracticeServed as referee for– Ars Combinatoria.– Australasian Journal <strong>of</strong> Combinatorics.– Bulletin <strong>of</strong> ICA.– Computer Networks.10
– Designs, Codes <strong>and</strong> Cryptography.– Discrete <strong>Mathematics</strong>.– Electronic J. <strong>of</strong> Combinatorics.– IEEE Transactions on Computers.– IEEE Transactions on Information Theory.– Journal <strong>of</strong> Combinatorial Designs.– Journal <strong>of</strong> Combinatorial <strong>Mathematics</strong> <strong>and</strong> Combinatorial Computing.– Journal <strong>of</strong> Combinatorial Theory (A).– Journal <strong>of</strong> Statistical Planning <strong>and</strong> Inference.– Networks.Organized <strong>and</strong> participated in Design Theory Seminar at the <strong>University</strong> <strong>of</strong> Waterloo (1995-1996).Thesis Examination1. Timothy Alderson, Ph.D., On MDS codes <strong>and</strong> Bruen-Silverman codes, Department <strong>of</strong> <strong>Mathematics</strong>,<strong>University</strong> <strong>of</strong> Western Ontario, London, Canada, 2002 (external examiner).Invited conference presentationsTitle Date Conference LocationOn the existence <strong>of</strong> resolvable06/06 Combinatorics 2006 Ischia, Naplesgraph designsOn resolvable group 07/03 DIMACS Connect Institute Rutgers <strong>University</strong>, New Jerseydivisible designs with (DCI): Research Workshop onblock size fourCombinatorial Design Theory,On sets <strong>of</strong> orthogonalSteiner triple systems05/02 Fourth Shanghai Conference onCombinatroicsShanghai Jiao Tong <strong>University</strong>,ShanghaiDoubly resolvable 07/01 Second Lethbridge Workshop on <strong>University</strong> <strong>of</strong> Lethbridge, AlbertaSteiner triple systems Designs, Codes, Cryptography<strong>and</strong> Graph TheoryHow did I spend my 05/01 Combinatorial Designs Theory: PIMS, Burnaby, BCsummer in 1999?Resolvability <strong>and</strong> ParallelismSome applications <strong>of</strong> 11/00 Emerging Applications <strong>of</strong> CombinatorialMSRI, Berkeley, CAcombinatorial designsto extremal graph theoryDesignErasure codes <strong>and</strong> 03/00 Mini-Symposium on Triple SystemThe Fields Institute,Steiner SystemToronto, OntarioDifference triangle sets 05/99 Summer Meeting <strong>of</strong> Canadian St. John’s, Newfoundl<strong>and</strong><strong>Mathematics</strong> Society5-sparse triple systems 07/97 International Conference on Portl<strong>and</strong>, MaineCombinatorics, InformationTheory <strong>and</strong> Statistics11