Masakazu Jimbo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Masakazu Jimbo has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Miwako Mishima
Gifu University
2 shared publications - Yiling Lin
Nagoya University
2 shared publications - Hiroaki Uehara
Nagoya University 464-8603 Furocho Chikusaku Nagoya Japan
1 shared publication - Junya Satoh
Nagoya Univ, Grad Sch Informat Sci, Chikusa Ku, Furo Cho, Nagoya, Aichi 4648601, Japan
1 shared publication Kentaro Mimura
Keio University, Hiyoshi, Yokohama 223-8522, Japan
1 shared publication- Koji Momihara
Division of Natural Science, Kumamoto University, Kumamoto, Japan
1 shared publication
Latest Publications
- 21 December 2014
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 78 (3) , 747-776
Optimal equi-difference conflict-avoiding codes of weight four
- 21 December 2014
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 78 (3) , 747-776
Optimal equi-difference conflict-avoiding codes of weight four
- 15 June 2013
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 73 (3) , 805-823
Extremal properties of t-SEEDs and recursive constructions
- 15 June 2013
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 73 (3) , 805-823
Extremal properties of t-SEEDs and recursive constructions
- 16 April 2012
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 18 (5) , 956-970
A decomposition of the 2-design formed by the planes in
- 16 April 2012
- Published by Elsevier in Finite Fields and Their Applications
- Vol. 18 (5) , 956-970
A decomposition of the 2-design formed by the planes in
- 8 March 2012
- Published by Springer Nature in Journal of Statistical Theory and Practice
- Vol. 6 (1) , 1-2
Preface
(2012). Preface. Journal of Statistical Theory and Practice: Vol. 6, Combinatorial Configurations and Information Sciences, pp. 1-2.
- 8 March 2012
- Published by Springer Nature in Journal of Statistical Theory and Practice
- Vol. 6 (1) , 1-2
Preface
(2012). Preface. Journal of Statistical Theory and Practice: Vol. 6, Combinatorial Configurations and Information Sciences, pp. 1-2.
- Open Access
Pooling Design and Bias Correction in DNA Library Screening
We study the group test for DNA library screening based on probabilistic approach. Group test is a method of detecting a few positive items from among a large number of items, and has wide range of applications. In DNA library screening, positive item corresponds to the clone having a specified DNA segment, and it is necessary to identify and isolate the positive clones for compiling the libraries. In the group test, a group of items, called pool, is assayed in a lump in order to save the cost of testing, and positive items are detected based on the observation from each pool. It is known that the design of grouping, that is, pooling design is important to %reduce the estimation bias and achieve accurate detection. In the probabilistic approach, positive clones are picked up based on the posterior probability. Naive methods of computing the posterior, however, involves exponentially many sums, and thus we need a device. Loopy belief propagation (loopy BP) algorithm is one of popular methods to obtain approximate posterior probability efficiently. There are some works investigating the relation between the accuracy of the loopy BP and the pooling design. Based on these works, we develop pooling design with small estimation bias of posterior probability, and we show that the balanced incomplete block design (BIBD) has nice property for our purpose. Some numerical experiments show that the bias correction under the BIBD is useful to improve the estimation accuracy.
Open AccessPooling Design and Bias Correction in DNA Library Screening
We study the group test for DNA library screening based on probabilistic approach. Group test is a method of detecting a few positive items from among a large number of items, and has wide range of applications. In DNA library screening, positive item corresponds to the clone having a specified DNA segment, and it is necessary to identify and isolate the positive clones for compiling the libraries. In the group test, a group of items, called pool, is assayed in a lump in order to save the cost of testing, and positive items are detected based on the observation from each pool. It is known that the design of grouping, that is, pooling design is important to %reduce the estimation bias and achieve accurate detection. In the probabilistic approach, positive clones are picked up based on the posterior probability. Naive methods of computing the posterior, however, involves exponentially many sums, and thus we need a device. Loopy belief propagation (loopy BP) algorithm is one of popular methods to obtain approximate posterior probability efficiently. There are some works investigating the relation between the accuracy of the loopy BP and the pooling design. Based on these works, we develop pooling design with small estimation bias of posterior probability, and we show that the balanced incomplete block design (BIBD) has nice property for our purpose. Some numerical experiments show that the bias correction under the BIBD is useful to improve the estimation accuracy.
- 13 March 2008
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 138 (11) , 3309-3315
A construction of by nonlinear functions and some classification for
- 13 March 2008
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 138 (11) , 3309-3315
A construction of by nonlinear functions and some classification for
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 336-340
Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding Codes
A conflict-avoiding code (CAC) C of length n with weight k is a family of binary sequences of length n and weight k satisfying Sigma0 les t les n-1 xit xj, t+s les lambda for any distinct codewords xj = (xi0,xi1,hellip,xi, n-1) and xj = (xj0, xj1,hellip, xj, n-1) in C and for any integer s, where the subscripts are taken modulo n. A CAC with maximal code size for given n and k is said to be optimal. A CAC has been studied for sending messages correctly through a multiple-access channel. The use of an optimal CAC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, the case lambda = 1 is treated, and various direct and recursive constructions of optimal CACs for weight k = 4 and 5 are obtained by providing constructions of CACs for general weight k. In particular, the maximum code size of CACs satisfying certain sufficient conditions is determined through number theoretical and combinatorial approaches.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 336-340
Bounds and Constructions for Optimal Constant Weight Conflict-Avoiding Codes
A conflict-avoiding code (CAC) C of length n with weight k is a family of binary sequences of length n and weight k satisfying Sigma0 les t les n-1 xit xj, t+s les lambda for any distinct codewords xj = (xi0,xi1,hellip,xi, n-1) and xj = (xj0, xj1,hellip, xj, n-1) in C and for any integer s, where the subscripts are taken modulo n. A CAC with maximal code size for given n and k is said to be optimal. A CAC has been studied for sending messages correctly through a multiple-access channel. The use of an optimal CAC enables the largest possible number of asynchronous users to transmit information efficiently and reliably. In this paper, the case lambda = 1 is treated, and various direct and recursive constructions of optimal CACs for weight k = 4 and 5 are obtained by providing constructions of CACs for general weight k. In particular, the maximum code size of CACs satisfying certain sufficient conditions is determined through number theoretical and combinatorial approaches.