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; zbMATH DE number 3446914 - MaRDI portal

scientific article; zbMATH DE number 3446914

From MaRDI portal
Publication:4770972

zbMath0285.05023MaRDI QIDQ4770972

D. V. Chopra, Jagdish N. Srivastava

Publication date: 1974


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



Related Items (19)

Further investigations on balanced arraysOn 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}\)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\)Orthogonal designs of parallel flats typeJ.N. Srivastava and experimental designBalanced 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\)On 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 levelsRobustness of balanced fractional \(2^ m\) factorial designs derived from simple arraysOn aliasing and generalized defining relationships of factorial arrangementsOn the robustness of balanced fractional \(2^ m\) factorial designs of resolution \(2l+1\) in the presence of outliersOn 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: