Test of algorithms for sequential adjustment in online phototriangulation
β Scribed by Knut Ragnar Holm
- Publisher
- Elsevier Science
- Year
- 1989
- Weight
- 689 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0031-8663
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A simple shift algorithm is described enabling the exact determination of power functions and sample size distributions for a large variety of closed sequential two-sample designs with a binary outcome variable. The test statistics are assumed to be based on relative frequencies of successes or fail
This paper presents a static test compaction method for IDDQ testing of sequential circuits. Test compaction reduces test application time and tester memory and consequently reduces testing cost. Particularly for IDDQ testing, measurement of IDDQ is time-consuming, and thus test compaction is a very
Because the evaiuation of rodent carcinogenicity studies involves performing a stat istical analysis at each tumor site encountered i t is important to undeistaud the extent to which this multiplicity affects the false positive rate. It is equally important to apply methods of accounting for this mu
The problem of sequentially testing two simple hypotheses is considered for i.i.d, observations. We give explicit lower bounds for the kth moments of the expected sample size for a sequential test with error probabilities a and ft. These bounds give the optimal asymptotic rate as a, fl ~ 0. (~) 1997