Several non-asymptotic formulas are established in channel resolvability and identification capacity, and they are applied to wire-tap channel. By using these formulas, the ǫ capacities of the above three problems are considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. As a result, we solve an open problem pro...

We review recently developed theory for the Minimum Description Length principle, penalized likelihood and its statistical risk. An information theoretic condition on a penalty pen(f) yields the conclusion that the optimizer of the penalized log likelihood criterion log 1/likelihood(f) + pen(f) has risk not more than the index of resolvability, corresponding to the accuracy of the optimizer of ...

We review recently developed theory for the Minimum Description Length principle, penalized likelihood and its statistical risk. An information theoretic condition on a penalty pen(f) yields the conclusion that the optimizer of the penalized log likelihood criterion log 1/likelihood(f) + pen(f) has risk not more than the index of resolvability, corresponding to the accuracy of the optimizer of ...

We propose to extract the charge information of high energy muons in very inclined extensive air showers by analyzing their relative lateral positions in the shower transverse plane. We calculate the muon lateral deviation under the geomagnetic field and compare it to dispersive deviations from other causes. By our criterion of resolvability, positive and negative muons with energies above 104 ...

A bstract. We give miscellaneous constructions for I-rotational (4q+l,5,?\)-BIBD's, being q an odd prime power, investigating their possible resolvability whenever q (mod 10). Concerning Steiner 2-designs, the strongest result that we obtain, is the explicit construction of a I-rotational (4q+l,5,1)-BIBD (with a multiplier of order 5) for each prime q == 1 (mod 30) such that (11 + 5-[5) /2 is n...

Introduction Echo-planar imaging (EPI), used in most functional MRI (fMRI) studies, has several major limitations, including 1) geometric distortion, 2) low spatial-resolution, and 3) low anatomic resolvability, as compared with structural MRI data. Because of these limitations, it is difficult to accurately register EPI based fMRI data to structural images. For the same reasons, it remains cha...

A connection graph represents resolvability in a set of clauses explicitly. The corresponding connection graph proof procedure has the deeciency that the graphs may grow, becoming impractical to handle. We present a novel proof procedure for condition graphs, which is a reenement of connection graphs. Our idea is to control the growth of the graph by recognizing tests in clauses and translating...