中部大学

中部大学

教員情報

神保 雅一 JIMBO Masakazu

プロフィール

生年 1951年
職名 教授
所属 現代教育学部 現代教育学科
大学院 教育学研究科 教育学専攻
最終学歴 東京工業大学大学院理工学研究科情報科学専攻修士課程修了
学位 理学博士(東京工業大学)
所属学会・役職 日本数学会
日本統計学会
応用統計学会
日本オペレーションズリサーチ学会
Institute of Combinatorics and its Applications
専門分野 統計学、離散数学
研究テーマ 統計的実験計画法、符号理論、組合せデザイン
授業科目 微分積分学

著書および訳書

[7] Sanpei Kageyama and Masakazu Jimbo 編, Combinatorial Configurations and Information Sciences, Taylor and Francis, 2012.

[6] 神保雅一編, 『暗号とセキュリティ』, オーム社, 2010.

[5] 神保雅一編, 『暗号がわかる本』, オーム社, 2005.3.

[4] 間瀬茂, 神保雅一, 鎌倉稔成, 金藤浩司著, 『工学のためのデータサイエンス入門』, 数理工学社, 2004.3.

[3] 神保雅一編, 分担執筆, 『データサンプリング』, 共立出版, 2002.5.

[2] 後藤宗弘, 鎌部, 神保雅一共著, 『情報伝送と符号の理論』, オーム社, 1999.9.

[1] 藤原良, 神保雅一著「符号と暗号の数理」共立出版, 1993.

学術論文、評論

査読付き論文

70. M. Hirao, M. Sawa, M. Jimbo, Constructions of Φp-optimal rotatable designs on the ball , Sankhya - The Indian Journal of Statistics, Ser. A, Vol. 77, Issue 1, 211-236, (2015).

69. Y. Lin, M. Mishima, M. Jimbo, Optimal equi-difference conflict-avoiding codes of weight four, Des. Codes, Cryptogr., (2014) DOI 10.1007/s10623-014-0030-x.

68. Yiling Lin, Miwako Mishima, Masakazu Jimbo, Junya Satoh, Optimal equi-difference conflict-avoiding codes of odd length and weight three, Finite Field and their applications, Vol. 26, 49-68, (2014).

67. Yiling Lin, Masakazu Jimbo, Extremal properties of t-SEEDs and recursive constructions, Design, Codes and Cryptography, Vol. 73, 805-823, (2014).

66. Koji Momihara, Miwako Mishima, Masakazu Jimbo, A decomposition of the 2-design formed by the planes in AG(2n; 3). , Finite fields and their applications, Vol. 18, 956-970, (2012).

65. T. Kanamori, H. Uehara, M. Jimbo, Pooling design and bias correction in DNA library screening, Journal of Statistical Theory and Practice, Vol. 6, 220-238, (2012).

64. N. Esmailzadeh, H. Talebi, K. Momihara, M. Jimbo, A new series of main effects plus one plan for 2m factorial experiments with m=4λ+1 and 2m runs, Journal of Statistical Planning and Inference, Vol. 141, 1567-1574, (2011).

63. Masakazu Jimbo, Yutaka Kunihara, Reinhard Laue, Masanori Sawa, Unifying some known infinite families of combinatorial 3-designs, Journal of Combinatorial Theory, Series A, Vol. 118, 1072-1085, (2011).

62. M. Jimbo, K. Shiromoto, Quantum jump codes and related combinatorial designs, Information Security, Coding Theory and Related Combinatorics, IOS Press, 285-311, (2011).

61. K. Ozawa, N. Tsushima, M. Jimbo, A-optimal diallel cross experiments for estimating g.c.a. effects, Journal of Statistics and Applications, Vol.4, No.2-3, pp. 421-431, (2009).

60. H. Uehara and M. Jimbo, A positive detecting algorithm for DNA library screening based on CCCP, J. Japan Statist. Soc., Vol. 39, 89-109, (2009).

59. M. Jimbo and K. Shiromoto, A construction of mutually disjoint Steiner systems from isomorphic Golay codes, Journal of Combinatorial Theory, Series A, Vol. 116, 1245-1251, (2009).

58. C. Ding, R. Fuji-Hara, Y. Fujiwara, M. Jimbo, M. Mishima, Sets of frequency hopping sequences: Bounds and optimal constructions, IEEE Transactions on Information Theory, Vol. 55, 3297-3304, (2009).

57. Koji Momihara, Masakazu Jimbo, On a cyclic sequence of a packing by triples with error correcting consecutive unions, Utilitas Mathematica, Vol. 78, 93-105, (2009).

56. S. Yagi, K. Mimura, M. Jimbo, A construction of OA(s^t, t+1, s, t) by nonlinear functions and some classification for s=4, Journal of Statistical Planning and Inference, Vol. 138, No.11, 3309-3315, (2008).

55. Hiroaki Uhehara and Masakazu Jimbo, A Positive Detecting Code and its Decoding Algorithm for DNA Library Screening, IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 5, No.4, 652-666, (2008).

54. T. Hishida, M. Jimbo, M. Mishima, K. Ozawa, Y. Mutoh, Further constructions for BIB designs with nested rows and columns, Ars Combinatoria, Vol. 86, 239-256, (2008).

53. M. Sawa, S. Kageyama, M. Jimbo, Compatibility of BIB designs, Statistics and Applications, Vol. 6, No.1,2, 56-71, (2008).

52. K. Momihara, M. Jimbo, Some constructions for block sequences for Steiner quadruple systems with error correcting consecutive unions, Journal of Combinatorial Designs, Vol. 16, 152-163, (2008).

51. M. Jimbo, M. Mishima, S. Janiszewski, A.Y. Teymorian, V.D. Tonchev, On conflict-avoiding codes of length n=4m for three active users, IEEE, Transaction on Information Theory, Vol. 53, No.8, 2732-2742, (2007).

50. Koji Momihara, Meinard Mueller, Junya Satoh, Masakazu Jimbo, Constant weight conflict-avoiding codes, SIAM Journal on Discrete Mathematics, Vol. 21, 959-979, (2007).

49. M. Mueller, M. Jimbo, Cyclic sequences of k-subsets with distinct consecutive unions, Discrete Math., Vol. 308, No.2-3, 457-464, (2006).

48. K. Ozawa, M. Mishima, S. Kuriki, M. Jimbo, Constructions for rectangular designs, Utilitas Math., Vol. 71, 179-196, (2006).

47. S. Kuriki, I. Mejza, M. Jimbo, S. Mejza, K. Ozawa, Resolvable semi-balanced incomplete split-block designs, Metrika, Vol. 61, 9-16, (2005).

46. T. Adachi, M. Mueller, M. Jimbo, Cluttered orderings for the complete bipartite graph, Discrete Appl. Math., Vol. 152, 213-228, (2005).

45. M. Mueller, M. Jimbo, Consecutive positive detectable matrices and group testing for consecutive positives, Discrete Math., Vol. 279, 369-381, (2004).

44. M. Jimbo, M. Mueller, Combinatorial problems arising from DNA library screening, Le Mathematiche, Vol. LIX, 215-224, (2004).

43. M. Mishima, M. Jimbo, Optimum multilevel orthogonal arrays for correlated errors, AKCE International J. of Graphs and Combinatorics, Vol. 1, No.2, 83-98, (2004).

42. Y. Mutoh, M. Jimbo, H.-L. Fu, A resolvable r x c grid block packing and its application to DNA library screening, Taiwanese J. Math., Vol. 8, 713-737, (2004).

41. M. Mueller, M. Jimbo, Erasure-resilient codes from affine spaces, Discrete Appl. Math., Vol. 143, 292-297, (2004).

40. K. Ozawa, S. Mejza, M. Jimbo, I. Mejza, S. Kuriki, Incomplete split-plot designs generated by some resolvable balanced designs, Statist. Prob. Letters, Vol. 68, 9-15, (2004).

39. T. Adachi, M. Jimbo, S. Kageyama, Discrete structure of group divisible designs with designs with r=λ1 + 2 and n=4, Statistical Methods and Practice: Recent Advances, N. Balakrishnan, N. Kannan and M. R. Srinivasan, eds., Narosa Publishers Ltd. (Springer affiliate). , 233-254, (2003).

38. H.-L. Fu, F. Hwang, M. Jimbo, Y. Mutoh, C. L. Shiue, Decomposing Complete Graphs into Kr x Kc’s, J. Statist. Planning Inference, Vol. 119, 225-236, (2003).

37. T. Adachi, M. Jimbo, S. Kageyama, Combinatorial structure of group divisible designs without α-resolution classes in each group, Discrete Math., Vol. 265, 1-11, (2003).

36. Y. Mutoh, T. Morihara, M. Jimbo, H.-L. Fu, The existence of 2x4 grid designs and their applications, SIAM Discrete Math., Vol. 16, 173-178, (2003).

35. K. Ozawa, M. Jimbo, S. Kageyama, S. Mejza, Optimality and efficiency of incomplete split-block designs, Metrika, Vol. 56, 1-18, (2002).

34. K. Ozawa, M. Jimbo, S. Kageyama, S. Mejza, Optimality and constructions of incomplete split-block designs, J. Statist. Planning Inference, Vol. 106, 135-157, (2002).

33. T. Hishida, M. Jimbo, Constructions of balanced incomplete block designs with nested rows and columns, J. Statist. Planning Inference, Vol. 106, 47-57, (2002).

32. M. Jimbo, S. Kageyama, Discrete Structure of Group Divisible Design with r=lambda_{1+1}, ICA Bulletin, Vol. 32, 29-36, (2001).

31. M. Mishima, M. Jimbo, S. Kageyama, Constructions for a certain type of balanced bipartite block designs, J. Statist. Planning Inference, Vol. 95, 257-268, (2001).

30. M. Mishima, M. Jimbo and T. Shirakura, On the optimality of orthogonal arrays for correlated errors, J. Statist. Planning Inference, Vol. 88, 319--338 (2000).

29. T. Hishida, K. Ishikawa, M. Jimbo, S. Kageyama, S. Kuriki, Non-Existence of a nested BIB design NB(10, 15, 2, 3), J. Combinatorial Mathematics and Combinatorial Computing, Vol. 36, 55-63, (2000).

28. K. Ozawa, H. Yumiba, S. Kuriki, M. Jimbo, Balanced and semi-balanced incomplete split-block designs, Congressus Numerantium, Vol. 145, 193-201, (2000).

27. T. Hishida and M. Jimbo, Cyclic resolutions of the BIB design in PG(5,2), Australasian Journal of Combinatorics, Vol. 22, pp.73-79, (2000).

26. M. Mishima and M. Jimbo, Recursive constructions for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs, Discrete Math. 211 (2000). , 135-152.

25. T. Anazawa and M. Jimbo, Optimum requirement spanning trees and reliability of tree networks, Networks, Vol. 34, 122-131, (1999).

24. T. Hishida and M. Jimbo, Possible patterns of cyclic resolution of the BIB design associated with PG(7,2), Congressus Numerantium, Vol. 131, 179-186, (1998).

23. Miwako Mishima, Ying Miao, Sanpei Kageyama and Masakazu Jimbo, Constructions of nested directed BIB designs, The Australasian Journal of Combinatorics, Vol. 18, 157-172 (1998).

22. T. Anazawa, T. Kodera, M. Jimbo, An explicit solution of optimum requirement spanning tree with maximum degree conditions, Congressus Numerantium, Vol. 117, 43-52, (1997).

21. M. Mishima, M. Jimbo, Some types of cyclically resolvable cyclic Steiner 2-designs, Congressus Numerantium, Vol. 123, 193-203, (1997).

20. M. Genma, M. Mishima, M. Jimbo, Cyclic resolvability of cyclic Steiner 2-designs, J. Combinatorial Design, Vol. 5, 177-187, (1997).

19. M. Mishima, M. Jimbo, A series of identities for the coefficients of inverse matrices on a Hamming scheme, Discrete Math., Vol. 156, 285-290, (1996).

18. M. Jimbo, S. Kageyama, A construction of semi-regular group divisible designs, Sankhya, Vol. 54, 207-217, (1992).

17. M. Jimbo, Recursive constructions for cyclic BIB designs and their generalizations, Discrete Math., Vol. 116, 79-95, (1993).

16. F. Yuan, M. Jimbo, R. Fuji-Hara, An extension method for balanced arrays, Communications in Statist., Theory and Methods, Vol. 20, 1073-1085, (1991).

15. M. Jimbo, R. Fuji-Hara, Optimal authentication systems and combinatorial designs, IEEE Transactions on Information Theory, Vol. 36, 54-62, (1990).

14. R. Fuji-Hara, S. Kuriki, M. Jimbo, On balanced complementation for regular t-wise balanced designs, Discrete Mathematics, Vol. 76, 29-35, (1989).

13. R. Fuji-Hara, M. Jimbo, F. Yuan, A recursive construction of balanced arrays, Utilitas Math., Vol. 36, 83-92, (1989).

12. R. Mukerjee, M. Jimbo, S. Kageyama, On cyclic semiregular group divisible designs, Osaka J. Mathematics, Vol. 24, 395-407, (1987).

11. M. Jimbo, S. Kuriki, A product theorem for cyclic graph designs, Annals of Discrete Mathematics, Vol. 34, 287-296, (1987).

10. R. Fuji-Hara, M. Jimbo, S.A. Vanstone, Some results on the line partitioning problem in PG(2k,q), Utilitas Math., Vol. 30, 235-241, (1986).

9. M. Jimbo, Cyclic neofields and cyclic Steiner 2-designs with block size 4, Advances in Discrete Mathematics and Computer Science, Vol. I, 360-367, (1985). [4がF. Hsu編集のSpecial issueに再録された]

8. M. Jimbo, Serially balanced designs related to balanced incomplete block designs, J. Japan Statist. Soc., Vol. 15, 161-175, (1985).

7. M. Jimbo, S.A. Vanstone, Recursive constructions for resolvable and doubly resolvable 1-rotational Steiner 2-designs, Utilitas Math., Vol. 26, 45-61, (1984).

6. S. Kuriki, M. Jimbo, On 1-rotational Sλ(2,3,v) designs, Discrete Math., Vol. 46, 33-40, (1983).

5. M. Jimbo and S. Kuriki, Constructions of nested designs, Ars Combinatoria, Vol. 16, 275-285, (1983).

4. M. Jimbo, Cyclic neofields and cyclic Steiner 2-designs with block size 4, European J. Combinatorics, Vol. 4, 247-254, (1983).

3. M. Jimbo, A recursive construction of 1-rotational Steiner 2-designs, Aequationes Math., Vol. 26, 184-190, (1983).

2. M. Jimbo and S. Kuriki, On a composition of cyclic 2-designs, Discrete Math., Vol. 46, 249-255, (1983).

1. M. Jimbo, K. Kunisawa, An iteration method for calculating the relative capacity, Information and Control, Vol. 43, No. 2, 216-223, (1979).

国際会議Proceedings(査読付き)

7. Koji Momihara, M. Muller, J. Satoh and M. Jimbo, Bounds and constructions for optimal constant conflict avoiding codes, Proceedings of International Symposium on Information Theory 2007, pp. 336-340, Nice, France, June, 2007.6.

6. M. Mueller, J. Satoh and M. Jimbo, Conflict avoiding codes with k-active users, Proceedings of 10th International Conference on Algebraic and Combinatorial Coding Theory, pp. 206-209, Zvenivgorod, Russia, 2006.

5. T. Anazawa, M. Jimbo, Quantile estimation based on a non-parametric density estimator derived from maximum entropy criterion. Proceedings of  Statistics in Industry, Science and Technology, Tokyo, 102-107, 1994.11.

4. M. Jimbo, M. Mishima,On the optimality of orthogonal arrays in case of correlated errors. Proceedings of  Statistics in Industry, Science and Technology, Tokyo, 267-272, 1994.11.

3. M. Jimbo, R. Fuji-Hara, Combinatorial properties of optimal authentication systems and their constructions. World Conference on Information Processing/Communication, Seoul, Korea, 428-432, 1989.

2. M. Jimbo, Robustness of orthogonal arrays for correlated errors. Proceeding of Second Japan China Symposium on Statistics, 117-120, 1986.11.

1. K. Kunisawa and M. Jimbo, A quasi convex programming related to an entropy model. Seminar on Applied Functional Analysis, ed. H. Umegaki, Vol. 2, 59-63,1979.

講演、シンポジウム、学会発表

招待講演

7. 神保雅一, 量子ジャンプ符号とC上の直交t-デザイン, IMI共同利用研究集会「モダン符号理論からポストモダン符号理論への展望」, 九州大学,2013.3.4-7.

6. M. Jimbo, Quantum jump codes and related combinatorial designs, Information Security, Coding Theory and Related Combinatorics, Opatia, Croatia, 2010.6. 本講演は, クロアチアで行われた上記研究集会で, 若手研究者に対する3時間招待講演として実施された. 本講演では, ある性質を満たす複素数体上のt-デザインの族を導入して量子ジャンプ符号を特徴づけ, 同時に組合せデザインの概念を拡張した新しい研究対象を見出し, その存在,非存在について講演を行った.

5. 神保雅一, 上原啓明, ゲノム塩基配列識別アルゴリズムとベイジアンネットワーク, 応用統計学会年会特別講演, 東京工業大学, 2007.5.24

4. M. Jimbo, Combinatorial problems arising from pooling designs for DNA library screening, Combinatorics 2004, Catania, Italy. Plenary talk, 2004.9.13-18. DNA library screeningにおいて, グループテストと呼ばれる組合せ構造が用いられる場合にpositive cloneを発見するために最適なpooling designの組合せ論的構成法を与えた.

3. M. Jimbo, A resolvable K_r x K_c packing and its application to DNA library screening, Taiwan Mathematical Society annual meeting Discrete Math., Taichung, Taiwan, 2001.

2. M. Jimbo, A mathematical model of competing species and Hadamard designs, The 97th American Mathematical Society annual meeting special session “Combinatorial Designs”, 1991.1.16-19.

1. 神保雅一, 日本数学会1984年度秋期年会・統計分科会・特別講演「巡回型ブロックデザインの構成」

主な国際会議発表

66. Masakazu Jimbo and Satoshi Noguchi, Cyclic codes with large minimum distances and related combinatorial designs, ALKOMA15, Kloster Banz, Germany, 2015.3.15-20.

65. Yiling Lin, Miwako Mishima, Masakazu Jimbo, Optimal equi-difference conflict-avoiding codes of weight four, The 3rd Taiwan-Japan Conference of Combinatorics and its Applications, National Chiayi University (台湾), 20140322.

64. Masakazu Jimbo, Generalized 1-factorizations over C and quasi-difference matrices, The 3rd Taiwan-Japan conference on combinatorics and its applications, Chiayi University, Taiwan, 2014.3.21-23.

63. M. Jimbo, A deterministic construction of compressed sensing matrices derived from combinatorial designs, 22nd FIM Conference on Interdisciplinary Mathematics, Statistics and Computational Techniques, Kita-Kyushu, 2013.11.10-12.

62. M. Jimbo, Mutually orthogonal t-designs over the complex number field. Seminar at Caltech, USA, 2013.4.11.

61. M. Jimbo, Mutually orthogonal t-designs over the complex number field. Seminar at Caltech, 2013.3.11.

60. Y. Lin, M. Mishima, M. Jimbo, Equi-difference conflict-avoiding codes of length n = 2a3bm and weight four, 44th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic Univ. 2013.3.

59. Y. Lin, M. Mishima, J. Sato, M. Jimbo, Tight Equi-difference conflict-avoiding codes of odd length and weight three, The 2nd Japan-Taiwan Conference on Combinatorics and its Applications, Nagoya Univ., 2012 11.

58. K. Ishii, M. Jimbo, Group testing on an inhibitor model and an effective positive detecting algorithm, The 2nd Japan-Taiwan Conference on Combinatorics and its Applications, Poster Presentation, Nagoya Univ. 2012.11.

57. M. Jimbo, K. Shiromoto, Y. Lin, Mutually orthogonal t-designs over C related to quantum jump codes, 2012 Shanghai Conference on Algebraic Combinatorics, Shanghai Jiao Tong Univ. 2012.8.17-22.

56. M. Hirao, M. Jimbo, M. Sawa, Optimalities of designs and configurations of points on the sphere. The 2nd Institute of Mathematical Statistics Asia Pacific Rim Meeting (ims-APRM2012), Organaized session by M. Jimbo “Design of experiments and group testing”, Tsukuba, 2012.7.2-4.

55. M. Jimbo, Mutually orthogonal t-designs over C related to quantum jump codes, Wilsonfest - a conference in honor of Rick Wilson, Oral Presentation, Caltech, USA, 2012.3.25-29.

54. M. Jimbo, M. Mishima, K. Momihara, Decompositions of the 2-design formed by the set of planes of AG(2n, q). for q = 2, 3, The 10th International Conference on Finite Fields and their Applications, Oral Presentation, Ghent, Belgium, 2011.

53. M. Jimbo, Quantum jump codes and mutually orthogonal partial t-designs over C. Seminar at Suzhou Univ., 2011.9.13.

52. M. Jimbo, Quantum jump codes and mutually orthogonal partial t-designs over C. Seminar at Zheijiang Univ., 2011.9.9-12.

51. M. Jimbo, Group testing, 廣西師範大学セミナー, 2011.9.2.

50. M. Jimbo, K. Shiromoto, Quantum jump codes and related combinatorial designs, The 1st Taiwan-Japan Conference of Combinatorics and its applications, Oral Presentation, Tamkang University, Tansui, Taiwan, 2011.3.

49. M. Jimbo, A cyclic Steiner quadruple system on a residue ring admitting all units as multipliers. Seminar at National Chiao Tung Univ., 2009.11.23.

48. K. Shiromoto, M. Jimbo, A construction of mutually disjoint 5-designs from self-dual codes. 4ICC, Auckland, New Zealand, 2008.12.4-8.

47. M. Jimbo, K. Momihara, S. Yoshikawa, A strictly cyclic Steiner quadruple system on Z_v admitting all units as multipliers, 4ICC, Auckland, New Zealand, 2008.12.4-8.

46. M. Jimbo, A strictly cyclic Steiner quadruple system on Z_v admitting all units as multipliers, The 4th International Conference on Combinatorial Mathematics and Combinatorial Computing, Southern Illinois University, USA, 2008.12.

45. M. Jimbo, ????????, Seminar at Caltech, 2008.11.

44. M. Jimbo, A Steiner quadruple system on Z_p^m admitting all units as multipliers, Workshop on Combinatorial Design Theory, Banff International Research Station, Canada, 2008.11.9-14.

43. H. Uehara and M. Jimbo, Group testing algorithms for DNA library screening based on BP and CCCP, Group testing on the Life Sciences, Schloss Dagstuhl, Germany, 2008.7.

42. M. Jimbo, K.Shiromoto, Quantum jump codes derived from affine geometry and cyclic codes, 2007 COE Conference on the Development of Dynamic Mathematics with High Functionality, Fukuoka, 2007.10.1-4.

41. M. Jimbo, K. Shiromoto, Quantum jump codes derived from cyclic codes and finite geometry. COE Conference on the Development of Dynamic Mathematics with High Functionality (DMHF2007), 171-173, Fukuoka Japan, 2007.10.1-4.

40. K. Momihara, M. Mueller, M. Jimbo, Bounds and constructions for optimal constant weight conflict-avoiding codes. 2007 IEEE International Symposium on Information Theory (ISIT), Nice, France, 2007.6.24-29.

39. M. Jimbo, M. Mishima, S. Janiszewski, A. Y. Teymorian, V. Tonchev, S. Uruno, On conflict-avoiding code of length n=4m for three active users. International Workshop on Combinatorics 2007, Keio Univ. & Kyoto Univ., 2007.6.6-13.

38. M. jimbo, Bounds and constructions for a conflict-aviding code. ISM Symposium on Stochastic Models and Discrete Geometry, The Institute of Statistical Mathematics, Tokyo, 2007.2.26-28.

37. M. Jimbo, K. Momihara, N. Tsushima, K. Ozawa, Optimal diallel cross experiments for estimating s.c.a effects. SCRA2006/FIM XIII, Tomar, Portugal, 2006.9.2.

36. S. Janiszewski, M. Jimbo, M. Mishima???, A. Y. Teymorian, V. Tonchev, An optimal conflict-avoiding code of length n=4m for three active users. The 37th Southeastern In ternational Conference on Combinatorics, Graph Theory & Computing, Florida Atrantic Univ., USA, 2006.3.6-10.

35. M. Jimbo, BIB designs with non prime power block sizes derived from affie geometry. The 30th ACCMCC, Brisbane, Australia, 2005.12.5-9.

34. M. Jimbo, 2-designs with non-prime power block size derived from affine geometry. Symposium in Honor of Prof. Dr. J.H. van Lint, Conference center Koningshof, Veldhoven, The Netherlands, 2005.10.2-5.

33. M. Jimbo, Optimal diallel cross experiments for estimating s.c.a effects. International Conference on Design of Experiments: Theory and Applications, Univ. Memphis, USA, 2005.5.13-15.

32. M. Jimbo and H. Uehara, A positive detecting code and its decoding algorithm for DNA library screening. The 2nd East Asian Conference on Algebra and Combinatorics, Kyushu Univ., 2003.11.17-21.

31. M. Jimbo, M. Mueller, Erasure-resilient codes from affine spaces. 27th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing, Univ. Newcastle, 2002.12.9-13.

30. M. Jimbo and Y. Mutoh, A combinatorial design for DNA library screening. 4th Biennial International Conference on Statistics, Probability and Related Areas, DeKalb, Illinois, USA, 2002.6.14-16.

29. T. Adachi, M. Jimbo, H.-L. Fu, Constructions of a cluttered ordering for the complete graph and the complete bipartite graph. The 30th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Florida Atrantic Univ., 2002.3.4-8.

28. K. Ozawa, M. jimbo, S. Kageyama, S. Mejza, Optimality and efficiency factor of incomplete split-block designs. The 30th International Biometrical Colloquium, Wigry, Poland, 2000.9.17-21.

27. Y.Mutoh, T. Morihara, M. jimbo, A grid design related to DNA library screening. 32th Southeastern International conference on Combinatorics, Graph Theory, Computing, Louisiana State Univ., Baton Rouge, USA, 2001.2.26-3

26. T. Adachi, M. jimbo, S. Kageyama, Combinatorial structure of GDDs without nontrivial alpha-resolvable classes in each group. 32th Southeastern International conference on Combinatorics, Graph Theory, Computing, Louisiana State Univ., Baton Rouge, USA, 2001.2.26-3.2.

25. T. Hishida, A. Ishida, J. Yamamatsu, T. Hirai, K. Ozawa, J. Hayashi and J. Jimbo, Fractal image coding and comparison with other methods, VSMM 2000, 306-315, (2000).

24. A. Ishida, M. Usui, J. Yamamatsu, K. Ozawa, T. Hishida, Y. Okada, K. Tanaka and M. Jimbo, Development of an A/V telecommunication system with dynamic path selection mechanism, VSMM 2000, 627-633, (2000).

23. K. Koizumi, T. Hishida, K. Ozawa, K. Yoshikawa, A. Ishida, H. Ohta, N. Takahira, M. Jimbo, A dynamic Multimedia information retrieval system by utilizing Jini/Java. VSMM 2000, 346-353, (2000).

22. M. Jimbo and S. Kageyama, Discrete structure of group divisible designs with r=λ1+1. 31st Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic Univ., USA, 2000.3.13-17.

21. K. Ozawa, M. Jimbo, S. Kageyama, S. Mejza, On a balanced incomplete split-block design. 941st, AMS meeting, University of Illinois, Urbana, (1999.3.18-21).

20. T. Hishida and M. Jimbo, Cyclic resolutions of BIB designs generated by planes in PG(5,2), International Conference on Combinatorics, Statistics, Pattern Recognition and Related Areas, Mysore, India (1998.12).

19. T. Hishida and M. Jimbo, Cyclic resolutions of BIB designs generated by planes in PG(5,2), Workshop on Graph Theory and Combinatorics, Keio University (1998.7).

18. K. Ozawa, M. Jimbo, S. Kageyama, S. Mejza, On a balanced incomplete split-block design. T. Calinski’s 70th anniversary meeting, Poznan, Poland, ????

17. T. Hishida and M. Jimbo, Some types of cyclic resolutions of the BIB design associated with PG(7,2). , South Eastern Conference on Combinatorics, Graph theory, Computing, Boca Raton, USA, (1998.3).

16. Miwako Mishima, Masakazu Jimbo and Sanpei Kageyama, Constructions of a certain type of balanced bipartite block designs, 29th Southeastern International conference on Combinatorics, Graph Theory, Computing, Florida Atlantic University, Boca Raton, USA (1998.3,9-13).

15. M. Jimbo, Optimality and constructions of a split block design, Workshop on Combinatorial Mathematics and Combinatorial Computing, Southern Illinois University, USA, (1998).

14. M. Jimbo, Constructions of incomplete split block designs. International Conference on recent advances in statistics and probability, Indian Statistical Institute Calcutta, 1997.12.29-1.1.

13. Miwako Mishima and Masakazu Jimbo, A recursive construction for cyclic quasiframes and cyclically resolvable cyclic Steiner 2-designs, 28th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, 1997.3

12. M. Jimbo, On the optimality and robustness of orthogonal arrays in case of correlated errors. Poznan Agricultural Univ., Poland, 1996.10.9.

11. M. Jimbo, Tournaments with sharply transitive automorphism groups and three person tournament games. 27th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., Baton Rouge, 1996.2.19-23.

10. M. Jimbo and M. Genma, A recursive construction of cyclically resolvable cyclic BIB designs. The 25th Manitoba Conference on Combinatorial mathematics and Computing, Univ. of Manitoba, Winnipeg, Canada, 1995.9.29-10.1.

9. M. Genma, M. Jimbo, Cyclic resolvability of cyclic Steiner 2-designs. R.C. Bose Memorial Conference on Statisitical Design and Related Combinatorics, Colorado State Univ., USA, 1995.6.7-11.

8. T. Anazawa and M. jimbo, Quantile estimation based on a non-parametric density estimator derived from maximum entropy criterion, Proceeding of Statistics in Industry, Science and Technology, (1994.7.11-13.)

7. M. Jimbo and M. Mishima, On the optimality of orthogonal arrays in case of correlated errors, Proceeding of Statistics in Industry, Science and Technology, (1994.7).

6. M. Jimbo, A Hadamard tournament and three person tournament games. 14th British Combinatorial Conference, Keele Univ. Keele, 1993.7.5-9.

5. M. Jimbo, A three person tournament game and an Hadamard tournament. Shanghai Conference Designs, Codes and Finite Geometries, 1993.5.24-28.

4. M. Jimbo and Y. Itoh, A well-balanced digraph related to a mathematical model of competing species. The 22nd Southeastern International Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., USA, 1991.2.11-15.

3. M. Jimbo, Y. Itoh, Conserved quantities of Lotka-Volterra systems associated with cyclic digraphs. The 2nd Japan Conference on Graph Theory and Combinatorics, Hakone, 1990.8.18-22.

2. M. Jimbo and S. A. Vanstone, A recursive construction for 1-rotational doubly resolvable designs, 15th Southeastern Conference on Combinatorics, Graph Theory and Computing, Louisiana State Univ., 1984.3.

1. K. Kunisawa, M. Jimbo, A quasi convex programming related to an entropy model, 1979-Seminar on Applied Functional Analysis, 59-63, ed. H. Umegaki (1979).

ページの先頭へ

ホーム
訪問者別メニュー