scientific article

From MaRDI portal
Publication:4072674

zbMath0313.62060MaRDI QIDQ4072674

Jagdish N. Srivastava

Publication date: 1975


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Construction of supersaturated designs involving \(s\)-level factors, On regular fractional factorial experiments in row--column designs, Search designs for estimating main effects and searching several two-factor interactions in general factorials, On a decision rule using dichotomies for identifying the nonnegligible parameter in certain linear models, Search designs for estimating main effects and searching several two- factor interactions in general factorials, Search designs for \(2^ m\) factorial experiments, On the characteristic polynomial of the information matrix of balanced fractional \(s^ m\) factorial designs for resolution \(V_{p,q}\), Searching probabilities for nonzero effects in search designs for the noisy case, A new efficient MEP.1 series for \(2^f\) factorial experiments, Enumeration of unlabelled bicolored graphs by degree parities, CV, ECV, and robust CV designs for replications under a class of linear models in factorial experiments, Construction and analysis of \(Es^{2}\) efficient supersaturated designs, Model discrimination - another perspective on model-robust designs, Common variance fractional factorial designs and their optimality to identify a class of models, On the norm of alias matrices in balanced fractional \(2^m\) factorial designs of resolution \(2l+1\), Probabilistic existence theorems in group testing, Main effect plan for \(2^n\) factorials which allow search and estimation of one unknown effect, A new series of main effects plus one plan for \(2^m\) factorial experiments with \(m=4\lambda \pm 1\) and \(2m\) runs, Weakly resolvable IV.3 search designs for the \(p^ n\) factorial experiment, On some new search designs for \(2^ m\) factorial experiments, A Bayesian criterion for selecting super saturated screening designs., Optimum mixed level detecting arrays, Effects of noise in performance comparisons of designs for model identification and discrimina\-tion, Folded over non-orthogonal designs, An infinite series of resolution III.2 designs for the \(2^ m\) factorial experiment, Sequential factorial probing designs for identifying and estimating non- negligible factorial effects for the \(2^ m\) experiment under the tree structure, Model-robust supersaturated and partially supersaturated designs, Supersaturated designs with high searching probability, Main effect plans with an additional search property for \(2^ m\) factorial experiments, Modelling by supersaturated designs, A comparison of three approaches for constructing robust experimental designs, Norm of alias matrices for balanced fractional \(2^m\) factorial designs when interesting factorial effects are not aliased with effects not of interest in estimation, Enumeration of connected graphs with cut vertices, Minimum number of runs for two-level factorial search designs, Choosing columns from the 12-run Plackett-Burman design, Searching for important factors in simulation models with many factors: Sequential bifurcation, An MEP.2 plan in \(3^n\) factorial experiment and its probability of correct identification, Log-efficient search for significant inputs of linear model, Optimum two level fractional factorial plans for model identification and discrimination, Optimal discrimination designs for exponential regression models, Fractional factorial designs of two and three levels, Probability of correct model identification in supersaturated design, Existence theorems for some group testing strategies, Families of search designs for simultaneous detection of the active main and 2-factor interaction effects, Finding MDS-optimal supersaturated designs using computer searches, Construction of search designs from orthogonal arrays, Supersaturated designs with the maximum number of factors for a given resolution-rank, Two-level supersaturated designs: a review, Screening designs for model discrimination, Minimal 2-coverings of a finite affine space based on GF(2), A note on Morris' bound for search designs, On the identifiability of a supersaturated design., Supersaturated designs for one or two effective factors, Search designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designs, Main effect plus one or two plans for \(2^ m\) factorials, Some new factor screening designs using the search linear model, Some search designs for symmetric and asymmetric factorials, Comparisons of search designs using search probabilities, Construction of main effect plus two plans for \(2^m\) factorials