Simple,exact inference for 2 × 2 tables

Exact inference for odds-ratio tests and confidence intervals relies on sophisticated algorithms, typically found only in the specialize software. This tends to discourage the use of exact methods in the analyses of 2 × 2 tables. We show that by first devolving each corresponding hypergeometric random variable into independent Bernoulli variates, simple and efficient algorithms emerge that are easily programmed in the commonly available software.     

Index to Articles,by Author,Volume 2 (1984)

This article investigates the statistical properties of the U.S. sacrifice ratio—the cumulative output loss arising from a permanent reduction in inflation. We derive estimates of the sacrifice ratio from three structural vector autoregression models and then conduct a series of simulation exercises to analyze their sampling distribution. We obtain point estimates of the sacrifice ratio that are consistent with results reported in earlier studies. However, the estimates are very imprecise, which we suggest reflects the poor quality of instruments used in estimation. We conclude that the estimates provide a very unreliable guide for assessing the output cost of disinflation policy.     

Skewness-Kurtosis Bounds for EGB1, EGB2, and Special Cases

An examination of the theoretical moments of a probability density function provides useful information about the flexibility of alternative distributions. Johnson and Kotz (1970), among others, consider skewness-kurtosis plots to illustratve the ability of various probability density functions to model diverse distributional characteristics. This article investigates the skewness-kurtosis plots of the exponential generalized beta of the first and second kind and some important special cases which have been used in various applications in economics, statistics, and finance.     

A characterization of some {3v2 + v3, 3v1 + v2; 3, 3}-minihypers and some [15, 4, 9; 3]-codes with B2 = 0

It is known (cf. Hill and Newton (Ars Combin., 25A (1988), 61–72; Designs Codes Cryptography, 2 (1992), 137–157) and Remark A.2 in the Appendix) that (1) there is no [14, 4, 9; 3]-code meeting the Griesmer bound and (2) if C is a [15, 4, 9; 3]-code then B₂ = 0 or 2 and (3) there is a one-to-one correspondence between the set of all nonequivalent [15, 4, 9; 3]-codes with B₂ = 0 and the set of all {3v₂ + v₃, 3v₁ + v₂: 3, 3}-minihypers, where v₁ = 1, v₂ = 4, v₃ = 13 and B₂ denotes the number of codewords of weight 2 in its dual code. Recently it has been shown by Eupen and Hill (Designs Codes Cryptography, 4 (1994) 271–282) that a [15, 4, 9; 3]-code with B₂ = 2 is unique up to equivalence. The purpose of this paper is to characterize all [15, 4, 9; 3]-codes with B₂ = 0 using the geometrical structure of the corresponding {3v₂ + v₃, 3v₁ + v₂; 3, 3}-minihypers. Those results give a complete characterization of [15, 4, 9; 3]-codes.     

Case study in data analysis,no. 2

In November 1979, the derailment of a train passing through Mississauga, Ontario, caused the explosion of tank cars containing liquid propane and the leakage of chlorine through a hole in another tank car, Officials evacuated more than 200,000 people from the area, but firemen stayed, exposing themselves to noxious fumes from the explosions and fires. When the crisis was over, health officials administered health tests and questionnaires to the affected men and to a control group of unaffected firefighters. Health information was gathered again one and two years later. In this study, two independent sets of analysts examine the health data to determine whether exposure to hazardous chemicals at the derailment site had any lasting effects on the lung function of the Mississauga firefighters.     

Classification of affine resolvable 2-(27, 9, 4) designs

All affine resolvable designs with parameters of the design of the hyperplanes in ternary affine 3-space are enumerated. This enumeration implies the classification (up to equivalence), of all optimal equidistant ternary codes of length 13 and distance 9, as well as all complete orthogonal arrays of strength 2 with 3 symbols, 13 constraints and index 3. Up to isomorphism, there are exactly 68 such designs. The automorphism groups and the rank of the incidence matrices over GF(3) are computed. There are six designs with point-transitive automorphism groups, and one design with trivial group. The affine geometry design is the unique design with lowest 3-rank, and the only design with 2-transitive automorphism group.     

Projective (2n,n,λ,1)-designs

A projective (2n,n,λ,1)-design is a set $\text{D}$ of n element subsets (called blocks) of a 2n-element set V having the properties that each element of V is a member of λ blocks and every two blocks have a non-empty intersection. This paper establishes existence and non-existence results for various projective (2n,n,λ,1)-designs and their subdesigns.     

Designing ChSP-4(c1, c2) plans

In this paper, the notion of average total inspection (ATI) is introduced to ChSP-4(c1,c2) sampling plans. Procedures have been developed for the construction and selection of ChSP-4(c1, c2 plans, minimizing ATI at a given process average, while protection to the consumer is given in terms of the (i) average outgoing quality limit and (ii) limiting quality level.A wide range of c1 and c2 values are considered for developing tables which cover almost all practical situations. The procedure described is similar to that of Dodge and Romig.