| Budget Amount *help |
¥2,870,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥270,000)
Fiscal Year 2007: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2006: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2005: ¥600,000 (Direct Cost: ¥600,000)
Fiscal Year 2004: ¥500,000 (Direct Cost: ¥500,000)
|
|---|
| Research Abstract |
Designs of experiments and group testing's have common combinatorial structure, Constructions of these designs use theory and methods of discrete mathematics like finite geometries, design theory, graph theory, etc. Software testing uses classical combinatorial configurations like orthogonal arrays, however the conditions to construct them are too strong. We tried to construct combinatorial configurations, called covering array, using combinatorial arrays, families of sets or sequences with weaker condition. To construct covering arrays, we solved a problem on finite projective geometries, called external arcs. An answer of the problem directly gives us a covering array. We also tried to solve various types of combinatorial design or sequence problems which have relations to designs of software testing, called balanced arrays, nested designs, FHS sequences, optical orthogonal codes etc. We have many results of the problems, which help to construct covering arrays.
|
