Welcome
to Ying Miao's Home Page!
I am an Assistant Professor of the Institute
of Policy and Planning Sciences at the University of Tsukuba in Tsukuba, Japan.
My address, phone and fax number and e-mail
address are given below.
Institute of Policy and Planning Sciences
University of Tsukuba
Tsukuba, Ibaraki 305-8573, Japan
Tel & Fax: 0298-53-5009
E-mail: miao@sk.tsukuba.ac.jp
My Research Interests
My main research interests are in design theory
(including combinatorial designs and experimental designs),
coding theory, cryptography and their interactions.
I am interested in many types of designs,
including group divisible designs, perfect Mendelsohn designs,
resolvable designs, nested designs, combinatorial arrays,
difference families. I am also interested in algorithmic method
in design theory, including enumeration and isomorphism testing
of designs. Some of my research topics in coding theory and
cryptography include equidistant q-ary codes, optical orthogonal
codes, t-insertion/deletion-correcting codes.
In all, I am interested in computational and
algebraic methods for determining the structure and existence of
combinatorial configurations, and interested in statistical
method (analysis of variance) for analysing experimental designs.
Education Background
- D.S., March 1997, Mathematics, Hiroshima University,
Japan.
- M.S., July 1989, Mathematics, Suzhou University,
P.R.China.
- B.S., July 1985, Mathematics, Wuhan University,
P.R.China.
Theses
- Construction of Block Designs with Resolvability or
Nested Structure, D. Sc. Thesis, Hiroshima University,
Japan, March 1997 (Supervisors: Professor S. Kageyama and
Professor Y. Fujikoshi).
- On Almost Resolvable Designs with k = 5 (in Chinese), M.
Sc Thesis, Suzhou University, P. R. China, June 1989
(Supervisor: Professor L. Zhu).
Employment
- Assistant Professor, April 1998 -- Present, Institute of
Policy and Planning Sciences, University of Tsukuba,
Japan.
- Post-Doctoral Fellow, June 1997 -- March 1998, Centre
Interuniversitaire en Calcul Mathematique Algebrique, Department of
Computer Science, Concordia University,
Canada.
- Research Fellow, April 1995 -- March 1997, Japan Society
for the Promotion of Sciences, Japan.
- Assistant Professor, December 1991 -- December 1993,
Suzhou Institute of Silk Textile Technology, P. R. China.
- Teaching-Research Associate, July 1989 -- November 1991,
Suzhou Institute of Silk Textile Technology, P. R. China.
Visiting Positions
- Michigan Technological University, Department of
Mathematical Sciences, March 1999.
- Hiroshima University, Faculty of School Education, Department of
Mathematics, April - June, 1997.
- Hiroshima University, Faculty of Science, Department of
Mathematics, January - March, 1994.
List of Publications
Monograph
- S. Furino, Y. Miao and J. Yin, Frames and Resolvable
Designs: Uses, Constructions, and Existence, The CRC
Press Series on Discrete Mathematics and its
Applications, CRC Press, Boca Raton, FL, 1996. viii+248
pp. ISBN: 0-8493-3984-7.
Papers in refereed
journals
- C. Lam and Miao, On cyclically resolvable cyclic Steiner
2-designs, Journal of Combinatorial Theory, Series A, 85
(1999), 194 - 207.
- Y. Miao and S. Kageyama, Two classes of q-ary codes based
on group divisible association schemes, Discrete
Mathematics 195 (1999), 269 - 276.
- S. Kageyama and Y. Miao, A construction for resolvable
designs and its generalizations, Graphs and Combinatorics
14 (1998), 11 - 24.
- S. Kageyama and Y. Miao, How to nest a perfect Mendelsohn
design with block size three or four, Journal of
Combinatorics, Information & System Sciences 23
(1998), 125 - 133.
- S. Kageyama and Y. Miao, Nested designs of superblock
size four, Journal of Statistical Planning and Inference
73 (1998), 1 - 5.
- M. Mishima, Y. Miao, S. Kageyama and M. Jimbo,
Constructions of nested directed BIB designs, The
Australasian Journal of Combinatorics 18 (1998), 157 -
172.
- S. Kageyama and Y. Miao, Nested designs with block size
five and subblock size two, Journal of Statistical
Planning and Inference 64 (1997), 125 - 139.
- S. Kageyama and Y. Miao, Note on a paper
"1-Rotational designs with block size 4",
Bulletin of the Institute of Combinatorics and its
Applications 20 (1997), 82 - 84.
- S. Kageyama and Y. Miao, Nested directed BIB designs with
block size three or four, Journal of the Indian Society
of Agricultural Statistics 49 (1996/97), 99 - 110.
- S. Kageyama and Y. Miao, A few results on
block-colourings of designs, Hiroshima Mathematical
Journal 26 (1996), 245 - 251.
- S. Kageyama and Y. Miao, Some constructions of
semiframes, Ars Combinatoria 43 (1996), 17 - 31.
- S. Kageyama and Y. Miao, Some non-embeddable
quasi-derived designs,, Journal of Combinatorial Theory,
Series A , 76 (1996), 295 - 304.
- S. Kageyama and Y. Miao, The spectrum of nested designs
with block size three or four, Congressus Numerantium 114
(1996), 73 - 80.
- Y. Miao, S. Kageyama and X. Duan, Further constructions
of nested group divisible designs, Journal of the Japan
Statistical Society 26 (1996), 231 - 239.
- Y. Miao and S. Yang, Concerning the vector V(m, t),
Journal of Statistical Planning and Inference 51 (1996),
223 - 227.
- S. Kageyama and Y. Miao, Difference families with
applications to resolvable designs, Hiroshima
Mathematical Journal 25 (1995), 475 - 485.
- Y. Miao, Some resolvable balanced incomplete block
designs (in Chinese), Mathematica Applicata 8(1995), 116
- 118.
- Y. Miao and L. Zhu, On resolvable BIBDs with block size
five, Ars Combinatoria 39 (1995), 261 - 275.
- Y. Miao and L. Zhu, Perfect Mendelsohn designs with block
size six, Discrete Mathematics 143 (1995), 189 - 207.
- S. Furino, M. Greig, Y. Miao and J. Yin, Resolvable BIBDs
with block size 8 and index 7, Journal of Combinatorial
Designs 2 (1994), 101 - 116.
- S. Kageyama and Y. Miao, A construction of resolvable
designs, Utilitas Mathematica 46 (1994), 49 - 54.
- Y. Miao, A note on a generating set for
$N_\{5\}^\{\\infty\}$, The Journal of Combinatorial
Mathematics and Combinatorial Computing 15 (1994), 227 -
228.
- Y. Miao, Existence of resolvable BIBDs with k = 5 and
lambda = 4, Discrete Mathematics 128 (1994), 283 - 303.
- Y. Miao, Some constructions and uses of double group
divisible designs, Bulletin of the Institute of
Combinatorics and its Applications 10 (1994), 66 - 72.
- J. Yin and Y. Miao, Almost resolvable BIBDs with block
size 5 or 6, Ars Combinatoria 35 (1993), 303 -313.
- Y. Miao and D. Wu, Some group divisible designs
constructed from ovals (in Chinese), Journal of Textile
Basic Sciences 16 (1992), 119 - 122.
- Y. Miao and L. Zhu, Pairwise balanced designs with block
sizes 5t + 1, Ars Combinatoria 32 (1991), 239 - 251.
- Y. Miao, On the existence of almost resolvable BIBDs with
block size five (in Chinese), Journal of Suzhou Institute
of Silk Textile Technology 10 (1990), 64 - 71.
- Y. Miao and L. Zhu, Existence of incomplete group
divisible designs, The Journal of Combinatorial
Mathematics and Combinatorial Computing 6 (1989), 33 -
49.
Papers in refereed
proceedings
- S. Kageyama and Y. Miao, On nested group divisible
designs with block size three or four, in: Y. Alavi, D.
R. Lick and A. Schwenk, eds., Combinatorics, Graph
Theory, and Algorithms, Vol II, 515 - 525, New Issue
Press, Western Michigan University, Kalamazoo, Michigan
(1999).
- S. Kageyama and Y. Miao, Some methods of construction of
rectangular PBIB designs, in: T. H. Ku, ed.,
Combinatorial and Graph Theory'95, Vol. 1, 186 - 198,
World Scientific Publishing Co. Pte. Ltd., Singapore
(1995).
Papers accepted for
publication
- R. J. R. Abel, M. Greig, Y. Miao and L. Zhu, Resolvable
BIBDs with block size 7 and index 6, Discrete
Mathematics, to appear, February 2000.
- R. Fuji-Hara, S. Kuriki, Y. Miao and S. Shinohara,
Balanced nested designs and n-ary designs, Journal of
Statistical Planning and Inference, to appear, November
1999.
- C. Lam and Y. Miao, Cyclically resolvable cyclic Steiner
triple systems of order 21 and 39, Discrete Mathematics,
to appear, August 1999.
- S. Furino, S. Kageyama, A. C. H. Ling, Y. Miao and J.
Yin, Frames with block size four and index three, Journal
of Statistical Planning and Inference, to appear, June
1999.
- C. Lam, Y. Miao and M. Mishima, Cyclically resolvable
cyclic Steiner 2-systems S(2, 4, 52), Journal of
Statistical Planning and Inference, to appear, April
1999.
- R. Fuji-Hara, Y. Miao and S. Shinohara, Complete sets of
disjoint difference families and their applications,
Journal of Statistical Planning and Inference, to appear,
Junuary 1999.
- S. Kageyama and Y. Miao, Existence of nested designs with
block size five, Journal of Statistical Planning and
Inference, to appear, May 1997.
Papers submitted for
publication
- S. Kageyama and Y. Miao, Optical orthogonal codes derived
from difference triangle sets, Congressus Numerantium,
April 2000.
- Fuji-Hara and Y. Miao, Geometrical constructions for
ordered orthogonal arrays and (T,M,S)-nets, Finite Fields
and Their Applications, March 2000.
- Fuji-Hara, Y. Miao, J. Wang and J. Yin, Directed B(K,1;v)
with K = {4,5} and {4,6} related to codes in deletion and
insertion metric, Journal of Combinatorial Designs,
January 2000.
- Fuji-Hara and Y. Miao, Optical orthogonal codes: their
bounds and new optimal constructions, IEEE Transactions
on Information Theory, December 1999.
- C. Lam and Y. Miao, (C oplus G, k, lambda) difference
families, Designs, Codes, and Cryptography, July 1999.
- R. J. R. Abel, M. Buratti, M. Greig and Y. Miao,
Constructions for rotational near resolvable block
designs, Journal of Combinatorial Designs, June 1999.
- R. Fuji-Hara, S. Kageyama, S. Kuriki, Y. Miao and S.
Shinohara, Balanced nested designs and balanced arrays,
Discrete Mathematics, April 1999.
Other Professional Activities
Professional Organizations:
- Mathematical Society of Japan
- Institute for
Combinatorics and its Applications, Fellow.
Professional Services:
Referee for:
Other Useful Links
Last modified: May 11, 2000