| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2017: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
The conversion of a uniformly distributed random number to approximate a given target distribution is generally called random number generation. In this study, we consider the problem of minimizing the size of the value set in which the uniform random number takes while the approximation is done within some precision. This problem is called the problem of resolvability. This study introduces the problem of resolvability based on the idea of variable-length coding, and the minimum resolvability rate is investigated. When the target distribution is a stationary memoryless source or a mixture of such sources, the minimum resolvability can be characterized in a form which does not depend on the length of source sequences. In addition, we extend the approximation measure between two probability distributions in the problem of fixed-length resolvability.
|
