Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article - MaRDI portal

scientific article

From MaRDI portal
Publication:4057439

zbMath0302.62039MaRDI QIDQ4057439

D. V. Chopra

Publication date: 1975


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



Related Items (18)

On the robustness of the optimum balanced \(2^ m\) factorial designs of resolution V (given by Srivastava and Chopra) in the presence of outliersOn the characteristic polynomial of the information matrix of balanced fractional \(s^ m\) factorial designs for resolution \(V_{p,q}\)\(2^m\) fractional factorial designs of resolution V with high \(A\)-efficiency, \(7\leq m\leq 10\)Weighted A-optimality for fractional \(2^m\) factorial designs of resolution \(V\)A-optimal partially balanced fractional \(2^{m_ 1+m_ 2}\) factorial designs of resolution V, with \(4\leq m_ 1+m_ 2\leq 6\)Balanced arrays of strength 4 and balanced fractional \(3^m\) factorial designsOn the norm of alias matrices in balanced fractional \(2^m\) factorial designs of resolution \(2l+1\)Alias balanced and alias partially balanced fractional \(2^ m\) factorialOn robustness of optimal balanced resolution V plansCharacteristic polynomials of the information matrices of balanced fractional \(3^ m\) factorial designs of resolution VBounds on the number of constraints for balanced arrays of strength tFractional factorial designs of two and three levelsOn the robustness of balanced fractional \(2^ m\) factorial designs of resolution \(2l+1\) in the presence of outliersMore precise tables of optimal balanced \(2^ m\) fractional factorial designs of Srivastava and Chopra, 7\(\leq m\leq 10\)Some general existence conditions for balanced arrays of strength \(t\) and 2 symbolsOn some optimal fractional \(2^ m \)factorial designs of resolution VSearch designs for \(2^ m\) factorials derived from balanced arrays of strength \(2(\ell +1)\) and AD-optimal search designsBlock plan for a fractional \(2^ m\) factorial design derived from a \(2^ r\) factorial design




This page was built for publication: