Celebrating Twenty Years of a Serials Column

A co-editor of “The Balance Point” column looks back at its twenty-year history, its current function and its future in serving the serials professional and scholarly community. The author examines how the column emerged as an idea by then Serials Review editor Cindy Hepfer in 1988 to be a forum on important serials issues for practitioners who might not otherwise write formally on these topics. The column has continued though the 1990s and 2000s to provide that function, as well as serve as an important place where authors are invited to explore serial issues much in need of a balanced approach. The author shares comments from past “Balance Point” column editors, John Riddick, Mary Beth Clack, Ellen Finnie Duranceau, Karen Cargille, Markel Tumlin, and Kay Johnson on how they regarded the column, the rewards and challenges they faced, and how they see the future of this format in an evolving electronic communication milieu.     

Why is one choice different?

Let X_i be nonnegative independent random variables with finite expectations and . The value is what can be obtained by a “prophet”. A “mortal” on the other hand, may use k1 stopping rules t₁,…,t_k yielding a return E[max_i=1,…,kX_ti]. For nk the optimal return is where the supremum is over all stopping rules which stop by time n. The well known “prophet inequality” states that for all such X_i's and one choice and the constant “2” cannot be improved on for any n2. In contrast we show that for k=2 the best constant d satisfying for all such X_i's depends on n. On the way we obtain constants c_k such that .     

On a robustness property of PBIBD

In this paper we study a robustness property of partially balanced incomplete block designs based on association schemes with m classes (PBIBD(m)) against the unavailability of data in the sense that, when any t (a positive integer) observations are unavailable the design remains connected w.r.t. treatment. We characterize the robustness property of PBIBD(m) completely for m=2 and partially for m=3.     

Auxiliary sets of matrices with non-increasing step parameter sequences

The following result is proved: for every projective plane ?p there exists a projective Hjelmslev plane π of type 4 over ?p such that the step parameter sequence of π is non-increasing.     

Optimal spacing of the selected sample quantiles for the joint estimation of the location and scale parameters of a symmetric distribution

We are considering the ABLUE’s – asymptotic best linear unbiased estimators – of the location parameter μ and the scale parameter σ of the population jointly based on a set of selected k sample quantiles, when the population distribution has the density of the form

where the standardized function f(u) being of a known functional form.A set of selected sample quantiles with a designated spacing

or in terms of u=(x−μ)/σ

where

λ_i=∫_−∞^u_if(t) dt, i=1,2,…,k

are given by

x(n₁)<x(n₂)<<x(n_k),

where

Asymptotic distribution of the k sample quantiles when n is very large is given by

h(x(n₁),x(n₂),…,x(n_k);μ,σ)=(2πσ²)^−k/2[λ₁(λ₂−λ₁)(λ_k−λ_k−1)(1−λ_k)]^−1/2n^k/2 exp(−nS/2σ²),

where

f_i=f(u_i), i=0,1,…,k,k+1,

f₀=f_k+1=0, λ₀=0, λ_k+1=1.

The relative efficiency of the joint estimation is given by

where

and κ being independent of the spacing . The optimal spacing is the spacing which maximizes the relative efficiency η(μ,σ).We will prove the following rather remarkable theorem. Theorem. The optimal spacing for the joint estimation is symmetric, i.e.

λ_i+λ_k−i+1=1,

or

u_i+u_k−i+1=0, i=1,2,…,k,

if the standardized density f(u) of the population is differentiable infinitely many times and symmetric

f(−u)=f(u), f′(−u)=−f′(u).

     

An Interview with Ben Brown, Co-founder of So New Media and Publisher of Words! Words! Words!

With this installment of “They Might Be Giants,” Michael Brown talks with Ben Brown (no relation) about publishing books (ten so far!) and magazines (issue 3 of Words! Words! Words! is about to be released), while at the same time working nine-to-five at a really boring tech job. It's a do-it-yourselfer's dream come true. Serials Review 2002; 28:344–348.     

Group screening method for the statistical analysis of -optimal mixed-level supersaturated designs

In this paper, we propose the application of group screening methods for analyzing data using E(f_NOD)-optimal mixed-level supersaturated designs possessing the equal occurrence property. Supersaturated designs are a large class of factorial designs which can be used for screening out the important factors from a large set of potentially active variables. The huge advantage of these designs is that they reduce the experimental cost drastically, but their critical disadvantage is the high degree of confounding among factorial effects. Based on the idea of the group screening methods, the f factors are sub-divided into g “group-factors”. The “group-factors” are then studied using the penalized likelihood statistical analysis methods at a factorial design with orthogonal or near-orthogonal columns. All factors in groups found to have a large effect are then studied in a second stage of experiments. A comparison of the Type I and Type II error rates of various estimation methods via simulation experiments is performed. The results are presented in tables and discussion follows.     

An Interview with Stanford M. Forrester, Editor and Publisher of bottle rockets

A little haiku zine / from Connecticut / who would have guessed? This installment of “They Might Be Giants” focuses on bottle rockets, a small haiku journal from, that's right, Connecticut. Stanford M. Forrester, publisher and editor of bottle rockets, talked briefly with Michael Brown about poetry, fireworks, and why he does what he does. Serials Review 2003; 29:321–324.     

They might be giants: a review of small presses and little magazines: an interview with Whitney Pastorek, Editor of Pindeldyboz

This installment of “They Might Be Giants” highlights a small online/print zine from New York called Pindeldyboz. Described by its editor Whitney Pastorek as a lit mag, Pindeldyboz publishes new fiction every week or so at the Web site but then publishes longer fiction once a year in the annual print zine of the same name. While this may indicate a split personality on the part of the editor/publisher, the goals of both the print and online versions are the same: to publish good fiction.     

Non binary partially neighbor balanced designs for circular blocks

ABSTRACT

Neighbor designs are recommended for the cases where the performance of treatment is affected by the neighboring treatments as in biometrics and agriculture. In this paper we have constructed two new series of non binary partially neighbor balanced designs for v = 2n and v = 2n+1 number of treatments, respectively. The blocks in the design are non binary and circular but no treatment is ever a neighbor to itself. The designs proposed here are partially balanced in terms of nearest neighbors. No such series are known in the literature.     

A note on the robustness of PBIBD(2)s against breakdown in the event of observation loss

Robustness against design breakdown following observation loss is investigated for Partially Balanced Incomplete Block Designs with two associate classes (PBIBD(2)s). New results are obtained which add to the body of knowledge on PBIBD(2)s. In particular, using an approach based on the E‐value of a design, all PBIBD(2)s with triangular and Latin square association schemes are established as having optimal block breakdown number. Furthermore, for group divisible designs not covered by existing results in the literature, a sufficient condition for optimal block breakdown number establishes that all members of some design sub‐classes have this property.     

General upper bound for the number of blocks having a given number of treatments common with a given block

The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations.     

Construction of neighbor designs of block size 4 for all values of v ≥ 5 by using the method of addition

In this article, a general method of construction of neighbor block designs is given. The designs are constructed using variation of a simple method which we refer to as the method of addition (renamed as the method of cyclic shifts). We give complete solution of neighbor balanced designs for k = 4 for any value of v. We also give many series of generalized neighbor designs (GNDs). In the last section, we have constructed GNDs in a sequential manner (as Did John 1981) for v ≤ 50 and r is multiple of k.     

Order statistics from trivariate normal and -distributions in terms of generalized skew-normal and skew- distributions

We consider here a generalization of the skew-normal distribution, GSN(λ₁,λ₂,ρ), defined through a standard bivariate normal distribution with correlation ρ, which is a special case of the unified multivariate skew-normal distribution studied recently by Arellano-Valle and Azzalini [2006. On the unification of families of skew-normal distributions. Scand. J. Statist. 33, 561–574]. We then present some simple and useful properties of this distribution and also derive its moment generating function in an explicit form. Next, we show that distributions of order statistics from the trivariate normal distribution are mixtures of these generalized skew-normal distributions; thence, using the established properties of the generalized skew-normal distribution, we derive the moment generating functions of order statistics, and also present expressions for means and variances of these order statistics.Next, we introduce a generalized skew-t_ν distribution, which is a special case of the unified multivariate skew-elliptical distribution presented by Arellano-Valle and Azzalini [2006. On the unification of families of skew-normal distributions. Scand. J. Statist. 33, 561–574] and is in fact a three-parameter generalization of Azzalini and Capitanio's [2003. Distributions generated by perturbation of symmetry with emphasis on a multivariate skew t distribution. J. Roy. Statist. Soc. Ser. B 65, 367–389] univariate skew-t_ν form. We then use the relationship between the generalized skew-normal and skew-t_ν distributions to discuss some properties of generalized skew-t_ν as well as distributions of order statistics from bivariate and trivariate t_ν distributions. We show that these distributions of order statistics are indeed mixtures of generalized skew-t_ν distributions, and then use this property to derive explicit expressions for means and variances of these order statistics.     

On the E-optimality of complete block designs under a mixed interference model

In experiments in which the response to a treatment can be affected by other treatments, the interference model with neighbor effects is usually used. It is known that circular neighbor balanced designs (CNBDs) are universally optimal under such a model if the neighbor effects are fixed (Druilhet, 1999) or random (4 and 7). However, such designs cannot exist for every combination of design parameters. In the class of block designs with the same number of treatments as experimental units per block, a CNBD cannot exist if the number of blocks, b  , is equal to p(t−1)±1$p(t-1)\pm 1$, where p is a positive integer and t is the number of treatments. Filipiak et al. (2008) gave the structure of the left-neighboring matrix of E-optimal complete block designs with p  =1 under the model with fixed neighbor effects. The purpose of this paper is to generalize E-optimality results for designs with p∈N$p\in \mathbb{N}$ assuming random neighbor effects.     

Analytical proofs of classical inequalities between Spearman's and Kendall's

Short analytical proofs are given for classical inequalities due to Daniels [1950. Rank correlation and population models. J. Roy. Statist. Soc. Ser. B 12, 171–181; 1951. Note on Durbin and Stuart's formula for E(r_s). J. Roy. Statist. Soc. Ser. B 13, 310] and Durbin and Stuart [1951. Inversions and rank correlation coefficients. J. Roy. Statist. Soc. Ser. B 13, 303–309] relating Spearman's ρ and Kendall's τ.     

Nonparametric depth-based multivariate outlier identifiers, and masking robustness properties

In extending univariate outlier detection methods to higher dimension, various issues arise: limited visualization methods, inadequacy of marginal methods, lack of a natural order, limited parametric modeling, and, when using Mahalanobis distance, restriction to ellipsoidal contours. To address and overcome such limitations, we introduce nonparametric multivariate outlier identifiers based on multivariate depth functions, which can generate contours following the shape of the data set. Also, we study masking robustness, that is, robustness against misidentification of outliers as nonoutliers. In particular, we define a masking breakdown point (MBP), adapting to our setting certain ideas of Davies and Gather [1993. The identification of multiple outliers (with discussion). Journal of the American Statistical Association 88, 782–801] and Becker and Gather [1999. The masking breakdown point of multivariate outlier identification rules. Journal of the American Statistical Association 94, 947–955] based on the Mahalanobis distance outlyingness. We then compare four affine invariant outlier detection procedures, based on Mahalanobis distance, halfspace or Tukey depth, projection depth, and “Mahalanobis spatial” depth. For the goal of threshold type outlier detection, it is found that the Mahalanobis distance and projection procedures are distinctly superior in performance, each with very high MBP, while the halfspace approach is quite inferior. When a moderate MBP suffices, the Mahalanobis spatial procedure is competitive in view of its contours not constrained to be elliptical and its computational burden relatively mild. A small sampling experiment yields findings completely in accordance with the theoretical comparisons. While these four depth procedures are relatively comparable for the purpose of robust affine equivariant location estimation, the halfspace depth is not competitive with the others for the quite different goal of robust setting of an outlyingness threshold.     

On Universal Optimality of Circular Weakly Neighbor Balanced Designs Under an Interference Model

In this article, the optimal design problem in a fixed effects interference model with left-neighbor effects is studied. It is known (Druilhet, 1999 Druilhet , P. ( 1999 ). Optimality of circular neighbor balanced designs . J. Statist. Plann. Infer. 81 : 141 – 152 .[Crossref], [Web of Science ®] , [Google Scholar]) that circular neighbor balanced designs (CNBDs) are universally optimal in such a model. We prove the universal optimality of circular weakly neighbor balanced designs (CWNBDs), which require a smaller number of blocks than CNBDs. CWNBDs with the number of blocks smaller than the number of treatments belong to the class of partially neighbor balanced designs (PNBDs) defined by Wilkinson et al. (1983 Wilkinson , G. N. , Eckert , R. , Hancock , T. W. , Mayo , O. ( 1983 ). Nearest neighbour (NN) analysis of field experiments . J. Roy. Statist. Soc. Ser. B 45 : 151 – 210 . [Google Scholar]). We give a construction method for some CWNBDs, with examples.     

Some important classes of generalized neighbor designs for linear blocks

In this paper, some infinite series of generalized neighbor designs are constructed for the linear blocks which are useful to balance out the neighbor effects for the cases where (a) one of the v treatments has some neighbor effects with other treatments, while remaining (v – 1) treatments have half of that neighbor effect among selves, (b) some of the v treatments have some neighbor effect with other treatments, while remaining treatments have half of that neighbor effect among themselves, (c) one of the v treatments has some neighbor effect with other treatments, while remaining (v – 1) treatments have double of that effect among themselves, and (d) some of the v treatments have some neighbor effect with other, while remaining treatments have double of it among themselves.     

Estimating parameters of a selected Pareto population

Let Π₁,…,Π_k be k populations with Π_i being Pareto with unknown scale parameter α_i and known shape parameter β_i;i=1,…,k. Suppose independent random samples (X_i1,…,X_in), i=1,…,k of equal size are drawn from each of k populations and let X_i denote the smallest observation of the ith sample. The population corresponding to the largest X_i is selected. We consider the problem of estimating the scale parameter of the selected population and obtain the uniformly minimum variance unbiased estimator (UMVUE) when the shape parameters are assumed to be equal. An admissible class of linear estimators is derived. Further, a general inadmissibility result for the scale equivariant estimators is proved.