Some Construction Methods of Optimum Chemical Balance Weighing Designs III

Size: px
Start display at page:

Download "Some Construction Methods of Optimum Chemical Balance Weighing Designs III"

Transcription

1 Open Journal of Statistics, 06, 6, Published Online February 06 in SciRes. Some Construction Meods of Optimum Chemical Balance Weighing Designs III Rashmi Awad *, Shati Banerjee School of Statistics, Devi Ahilya University, Indore, India Received 4 November 05; accepted 5 February 06; published 8 February 06 Copyright 06 by auors and Scientific Research Publishing Inc. This wor is licensed under e Creative Commons Attribution International License (CC BY). Abstract Meods of constructing e optimum chemical balance weighing designs from symmetric balanced incomplete bloc designs are proposed wi illustration. As a by-product pairwise efficiency and variance balanced designs are also obtained. Keywords Balanced Incomplete Bloc Design, Symmetric Balanced Incomplete Bloc Design, Ternary Balanced Bloc Design, Variance Balanced Design, Efficiency Balanced Design, Nested Balanced Incomplete Bloc Design, Weighing Design, Chemical Balance Weighing Design, Optimum Chemical Balance Weighing Design. Introduction Originally Yates (see []) gave e concept of weighing design. Afterward his wor was formulated by Hotelling (see []) and he gave e condition of attaining e lower bound by each of e variance of e estimated weights. Many statisticians did prominent wor in obtaining optimum weighing designs (see [3]-[7]). In recent years, different meods of constructing e optimum chemical balance weighing designs; using e incidence matrices of nown balanced incomplete bloc designs, balanced bipartite bloc designs, ternary balanced bloc designs and group divisible designs have been given in e literature (see [8]-[]). Construction meods of obtaining optimum chemical balance weighing designs using e incidence matrices of symmetric balanced incomplete bloc designs have been given by Awad et al. []-[4]; some pairwise balanced designs are also been obtained which are efficiency as well as variance balanced. In is paper; some oer new construction meods of obtaining optimum chemical balance weighing designs using e incidence matrices of nown symmetric balanced incomplete bloc designs are propose. Some more pairwise efficiency as * Corresponding auor. How to cite is paper: Awad, R. and Banerjee, S. (06) Some Construction Meods of Optimum Chemical Balance Weighing Designs III. Open Journal of Statistics, 6,

2 well as variance balanced designs are also been proposed. Let us consider a bloc design in which treatments arranged in b blocs and elements of e incidence matrix N are denoted by n ij, for all i =,,, ; j =,,, b, such at e j bloc contains j ex perimental units and e i treatment appears r i times in e entire design. A balanced bloc design is said to be (a) binary when n ij = 0 or, i =,,, ; j =,,, b. Oerwise, it is said to be nonbinary (see [7]); (b) ternary if n ij = 0, or, i =,,, ; j =,,, b, and it has parameters, b, ρ, ρ, r,, Λ ; where ρ, ρ are e number of times, occurs in e incidence matrix, respectively (see [5]); (c) generalized binary if n ij = 0 or x, i =,,, ; j =,,, b and some positive integer x ( > ), and it has parameters, b, r,, Λ (see [6]). A balanced incomplete bloc design is an arrangement of symbols (treatments) into b sets (blocs) such at () each bloc contains ( < ) distinct treatments; () each treatment appears in r ( > λ ) different blocs and; (3) every pair of distinct treatments appears togeer in exactly λ blocs. Here, e parameters of balanced incomplete bloc design (, b, r,, λ ) are related by e following relations ( ) ( ) ( ) r = b, r = λ and b Fisher s Inequality A balanced incomplete bloc design is said to be symmetric if b = ( consequently, r = ). In is case, incidence matrix N is a square matrix i.e. N = N. In case of symmetric balanced incomplete bloc design any two sets have λ symbols in common. Balancing of design in various senses has been given in e literature (see [7] [8]). In is paper, we consider e balanced design of e following types: ) variance balanced bloc designs; ) efficiency balanced bloc designs and; 3) pairwise balanced bloc designs. ) A bloc design is said to be variance balanced if and only if its C-matrix, R NK N, satisfies R NK N = ψ I ( ), for some constant ψ (see [9]-[]); where ψ is e unique nonzero eigen value of e matrix C wi e multiplicity ( ), I is e identity matrix. ) A bloc design is said to be efficiency balanced if R NK N = µ I + ( µ ) n r, for some constant µ (see [0]-[]); where µ is e unique non zero eigen value wi multiplicity ( ). For e EB bloc C= µ R n rr ; see [3] design N, e information matrix is given as ( )( ( ) ) b 3) A bloc design is said to be pairwise balanced if nn j= ij i j = Λ (a constant) for all i, i ; where i i and ii,,,,. A pairwise balanced bloc design is said to be binary if n ij = 0 or only, for all i, j and it has parameters, b, r,, Λ (= λ, say) (in is case, when r = r and = b, it is a BIB design wi parameters, b, r,, λ ). A design is said to form a nested structure, when ere are two sources of variability and one source is nested wiin oer. Preece (see [4]) introduced a class of nested BIB designs wi treatments, each replicated r times, wi two systems of blocs, such at (a) e second system nested wiin e first, wi each bloc from e first system (called super blocs) containing exactly m blocs from e second system (called sub-blocs). (b) Ignoring e sub-blocs, leaves a BIB design wi parameters, b, r,, λ. (c) Ignoring e superblocs, leaves a BIB design wi parameters, b, r,, λ. The, b, b, r,,, λ, λ and m are called e parameters of a nested BIB design. The parameters satisfy e following conditions: so at r = b = bm = b ( ) = ( ) r λ ( ) = λ ( ) r ( )( λ λ ) = ( ) m m r The following additional notations are used = [ b ] is e column vector of bloc sizes, r = [ rr r ] is e column vector of treatment replication, K = bb diag[ b], Rv v diag[ rr r ] b ri = j = n is e total number of experimental units, wi is N b = r and N i= j= =, =, Where a is e a vector of ones. Furermore µ represents e loss of information, i.e., µ represents an effi- 38

3 ciency of e design, ( ψ ) represents e variance of any normalized contrast in e intra bloc analysis (see [0] [3] [5] [6]). For given p objects to be weighted in groups in n weightings, a weighing designs consists of n groupings of e p objects and e least square estimates of e weight of e objects can be obtained by e usual meods when n p. Using matrix notations e general linear model can be written as: Y = Xw + e () where Y is n column vector of e weights of e objects, w is e p column vector of e unnown weights of objects and e is n vector of error components in e different observations such at E( e ) = 0 n and E( ee ) = σ I n. Also X = ( x ij ), ( i =,,, n; j =,,, p) is e n p matrix of nown quantities called design matrix whose entries are +, or 0. Let matrix X taes e values as: + if e j object is in e left pan in e i weighing xij = if e j object is in e right pan in e i weighing 0 if e j object is not in e i weighing The normal equations for estimating w are as follows: X Xwˆ = X Y () where ŵ is e vector of e weights estimated by e least squares meod. Singularity or non-singularity of a weighing design depends on wheer e matrix XX is singular or nonsingular, respectively. When X is of full ran, en it is obvious at e matrix XX is non-singular. Then in is case e least squares estimate of w is given by and e variance-covariance matrix of ŵ is ( ) ŵ= X X XY (3) Var w ( ˆ ) σ ( X X ) = (4) A weighing design is said to be e chemical balance weighing design if e objects are placed on two pans in a chemical balance. In a chemical balance weighing design, e elements of design matrix X = ( x ij ) taes e values as + if e j object is placed in e left pan in e i weighing, if e j object is placed in e right pan in e i weighing and 0 if e j object is not weighted in e i weighing. Hotelling (see []) has shown at e precision of e estimates of e weight of e object increases furer by placing in e oer pan of e scale ose objects not included in e weighing and us using two pan chemical balance. He proved at if n weighing operations have been done to determine e weight of p = n objects, e minimum attainable variance for each of e estimated weights in is case is σ n and he also shown at each of e variance of e estimated weights attains e minimum if and only if ( X X ) = ni p. A design satisfying is condition is called an optimum chemical balance weighing design.. Variance Limit of Estimated Weights Cerana et al. (see [8]) studied e problem of estimating individual weights of objects, using a chemical balance weighing design under e restriction on e number of times in which each object is weighed. A lower bound for e variance of each of e estimated weights from is chemical balance weighing design is obtained and a necessary and sufficient condition for is lower bound to be attained was given. Then Cerana et al. (see [8]) proved e following eorem: Theorem.. For any n p matrix X, of a nonsingular chemical balance weighing design, in which maximum number of elements equal to and in columns is equal to m, where m= max m, m,, m p (where m j be e number of elements equal to and in j column of matrix X). Then each of e variances of e estimated weights attains e minimum if and only if X X = mi (5) ( ) p Also a nonsingular chemical balance weighing design is said to be optimal for e estimating individual 39

4 weights of objects; if e variances of eir estimators attain e lower bound given by, ( ) σ Var wˆ = m; j =,,, p (6) Preece [4] introduced a class of nested BIB designs. Using is concept Banerjee; (see [7]-[9]) constructed e nested EB as well as VB designs, where e sub-blocs form ternary design D wi parameters (, b, ρ i, ρ i, r,, Λ ) while e super-blocs form generalized binary design D wi parameters (, b, r,, Λ ); where i =,. Proposition.. Existence of BIB design D wi parameters (, br,,, λ ) implies e existence of a nested EB as well as VB design. The sub-blocs form an EBT as well as VBT design wi parameters =, b = λ, ( )( ) ρ = r, ρ = r( ), r r ( ) Λ = λ ( + )( ), µ = ( + ) ( ) ( ) ( ) =, =,, ψ = Λ while e super-blocs form a generalized binary EB as well as VB design wi parameters =, b = λ =,, r ( ) r =, ( ) λ Λ =, ( ) ( ), ψ = [ Λ ] µ = Proposition.3. Existence of BIB design D wi parameters (, br,,, ) λ implies e existence of a nested EB as well as VB design. The sub-blocs form an EBT as well as VBT design wi parameters =, b = 3λ, ρ = r( )( 3 4), ( ) ρ = r, r r ( ) ( 3 Λ = λ 3 4), µ = ( ) 3( ) ( ) = 3, =,, ψ = Λ while e super-blocs form a generalized binary EB as well as VB design wi parameters b =, = λ, r r ( ) = 3, 3 =, Λ = λ( ) ( 3 ) ( ), ψ = [ Λ ] µ = 3. Construction of Design Matrix: Meod I 9, Consider a SBIB design D wi e parameters (,, λ ); each pair of treatments occurs togeer in λ blocs. Tae any pair of treatments, say, (θ, φ ) from is design. Then mae two blocs from e design which contains e pair (θ, φ ).. Give e negative sign to e treatment θ and eliminate e treatment φ while e oer ( ) remaining treatments of e same bloc remain as it is.. Give e negative sign to e treatment φ and eliminate e treatment θ while e oer ( ) remaining treatments of e same bloc remain as it is. The matrix N of design D is obtained. Now doing e same procedure for all possible pairs of treatments, we obtain matrix N i ; i =,,,. Then e incidence matrix N of e new design D so formed is e matrix having e elements, and 0; given as follows by juxtaposition 40

5 = (7) N N N N Then combining e incidence matrix N of SBIB design repeated s-times wi N we get e matrix X of a chemical balance weighing design as s-times X = N N N (8) Under e present construction scheme, we have n = λ + sb = λ ( ) + sb and p =. Thus e each column of X will contain δ = r ( )( ) + sr elements equal to, δ = r( ) elements equal to and r( )( + ) elements equal to zero. Clearly such a design implies at each object is weighted ( ) m = δ+ δ = r + sr times in n = λ + sb weighing operations. Lemma 3.4. A design given by X of e form (8) is non singular if and only if λ ( 3) ( 6λ 7) + + s( r λ) 0. Proof. For e design matrix X given by (8), we have and { ( )( 3) } { ( )( 5) } ( )( 5) XX = r + sr λ + sλ I + λ + sλj { ( 3) ( 6 7) } ( ) {( )( 5) } = λ λ+ + s r λi + λ + s J 3 {( 7 3 7) } λ { ( 3) ( 6λ 7) } ( λ) X X = r + + s + + s r e determinant (0) is equal to zero if and only if { + + } but 3 ( ) r s ( ) ( ) s( r ) ( )( 3) λ( )( 5) r + sr = + sλ ( ) ( ) s( r ) λ 3 6λ+ 7 + λ = 0 or 3 ( ) r s = 0 is positive and en det ( X X ) = 0 if and only if λ 3 6λ+ 7 + λ = 0. So e lemma is proved. Theorem 3.5. The non-singular chemical balance weighing design wi matrix X given by (8) is optimal if and only if ( )( ) (9) (0) λ 5 + s = 0. () Proof. From e conditions (5) and (9) it follows at a chemical balance weighing design is optimal if and only if e condition () holds. Hence e eorem. If e chemical balance weighing design given by matrix X of e form (8) is optimal en σ Var ( wˆ j ) = ; j =,,, p r ( ) + s Example 3.6. Consider a SBIB design wi parameters = b = 4, r = = 3, λ = ; whose blocs are given by (,,3), (,,4), (,3,4), (,3,4). 4

6 Theorem 3.5 yields a design matrix X of optimum chemical balance weighing design as X =

7 Clearly such a design implies at each object is weighted m = 8 times in n = 3 weighing operations and Var ( wˆ ) = σ 8 for each j =,, 3, 4. Corollary 3.7. If e SBIB design exists wi parameters (,, λ ); en e design matrix X so formed in (8) is optimum chemical balance weighing design iff < < 5 and s. Remar: In SBIB design wi parameters (,, λ ); if = 0 en e design matrix given in (8) is perfectly optimum and s = 0 in is case. Corollary 3.8. If in e design D ; is replaced by zero en e new design D so formed is a BIB design wi parameters V =, B =, R= r( )( ), K =, Λ= λ. Then e struc- ture form a pairwise VB and EB design = V, b = B + sb, r = R + sr, sλ = ( ) + and sλ µ = ( λ ) r +. ψ λ D s-times N N N N = () wi parameters = λ, =, λ 4. Construction of Design Matrix: Meod II sλ =Λ+, Consider a SBIB design D wi e parameters (,, λ ); each pair of treatments occurs togeer in λ blocs. Tae any pair of treatments, say, (θ, φ ) from is design. Then mae ree blocs from e design which contains e pair (θ, φ ).. Give e negative sign to e treatment θ and eliminate e treatment φ while e oer ( ) remaining treatments of e same bloc remain as it is.. Give e negative sign to e treatment φ and eliminate e treatment θ while e oer ( ) remaining treatments of e same bloc remain as it is. 3. Give e negative sign to bo e treatments θ and φ while e oer remaining treatments of e same bloc remain as it is. The matrix N of design D is obtained. Now doing e same procedure for all possible pairs of treatments, we obtain matrix N i ; i =,,,. Then e incidence matrix N of e new design D so formed is e matrix having e elements, and 0; given as follows juxtaposition: = (3) N N N N Then combining e incidence matrix N of SBIB design repeated s-times wi N we get e matrix X of a chemical balance weighing design as: Under e present construction scheme, we have n = 3λ + sb s-times X = N N N (4) and p =. Thus e each column of X 43

8 will contain { 3 ( )( ) } δ = r + sr δ = r elements equal to and n δ δ elements equal to zero. Clearly such a design implies at each object is weighted r m = δ+ δ = ( 3 ) + sr times in n = 3λ + sb weighing operations. Lemma 4.9. A design given by X of e form (4) is non singular if and only if r λ ( 3 0) + sr ( ) + sλ. Proof. For e design matrix X given by (4), we have and ( )( 3 0) elements equal to, ( ) r λ λ XX = + sr ( ) + sλ I + ( ) + sλ J r λ λ = ( 3 0) + sr ( ) + sλ I + ( ) + sλ J (5) r λ X X = ( 3 0) + sr + ( ) ( ) + sλ r λ ( 3 0) + sr ( ) + sλ (6) e determinant (6) is equal to zero if and only if r λ + sr = + + sλ ( 3 0) ( ) r λ + sr = + + sλ or ( 3 0) ( ) ( ) r λ + sr sλ r λ ( 3 0) + sr = ( ) + sλ. So e lemma is proved. Theorem 4.0. The non-singular chemical balance weighing design wi matrix X given by (4) is optimal if and only if but ( 3 0) ( ) ( ) is positive and en det ( X X ) = 0 if and only if λ ( ) + sλ = 0. (7) Proof. From e conditions (5) and (5) it follows at a chemical balance weighing design is optimal if and only if e condition (7) holds. Hence e eorem. If e chemical balance weighing design given by matrix X of e form (4) is optimal en σ Var ( wˆ j ) = ; j =,,, p r ( 3 ) + sr Example 4.. Consider a SBIB design wi parameters = b = 4, r = = 3, λ = ; whose blocs are given by (,,3), (,,4), (,3,4), (,3,4). 44

9 Theorem 4.0 yields a design matrix X of optimum chemical balance weighing design as X =

10 Clearly such a design implies at each object is weighted m = 30 times in n = 48 weighing operations and Var ( wˆ ) = σ 30 for each j =,, 3, 4. Corollary 4.. If e SBIB design exists wi parameters (,, λ ); en e design matrix X of e form (4) is optimum chemical balance weighing design iff 5 and s 4. Corollary 4.3. If in e design D ; is replaced by zero en e new design D so formed is a BIB design wi parameters V =, B = 3, R= 3r( )( ), K =, Λ= 3λ. Then e structure form a pairwise VB and EB design =, b = B + sb, r = R + sr, ( ) 3 3 s ψ = λ + µ ( ) and λ 3 3 s = +. r 5. Result and Discussion D s-times N N N N = (8) wi parameters =, =, λ =Λ+ sλ, The following Table and Table provide e list of pairwise variance and efficiency balanced bloc designs for Meods I and II respectively, which can be obtained by using certain nown SBIB designs. Table. For Meod I. S. No. b r λ ψ µ Reference No. ** R (4) R () R (37), MH (3) Table. For Meod II. S. No. b r λ ψ µ Reference No. ** R (4) R (0), MH () R () R (37), MH (3) ** The symbols R(α) and MH(α) denote e reference number α in Raghavrao [30] and Marshal Halls [3] list. 6. Conclusion In is research, we have significantly shown at e obtained designs are pairwise balanced as well as efficiency balanced. The only limitation of is research is at e obtained pairwise balanced designs are all have large number of replications. Acnowledgements We are grateful to e anonymous referees for eir constructive comments and valuable suggestions. 46

11 References [] Yates, F. (935) Complex Experiments. Journal of e Royal Statistical Society,, [] Hotelling, H. (944) Some Improvements in Weighing and Oer Experimental Techniques. Annals of Maematical Statistics, 5, [3] Banerjee, K.S. (948) Weighing Designs and Balanced Incomplete Blocs. Annals of Maematical Statistics, 9, [4] Banerjee, K.S. (975) Weighing Designs for Chemistry, Medicine, Economics, Operations Research, Statistics. Marcel Deer Inc., New Yor. [5] Dey, A. (969) A Note on Weighing Designs. Annals of e Institute of Statistical Maematics,, [6] Dey, A. (97) On Some Chemical Balance Weighing Designs. Aust. J. Stat., 3, [7] Raghavarao, D. (959) Some Optimum Weighing Designs. Annals of Maematical Statistics, 30, [8] Cerana, B. and Graczy, M. (00) Optimum Chemical Balance Weighing Designs under e Restriction on e Number in Which Each Object Is Weighed. Discussiones Maematica Probability and Statistics,, 3-0. [9] Cerana, B. and Graczy, M. (00) Optimum Chemical Balance Weighing Designs Based on Balanced Incomplete Bloc Designs and Balanced Bipartite Bloc Designs. Maematica,, 9-7. [0] Cerana, B. and Graczy, M. (004) Ternary Balanced Bloc Designs Leading to Chemical Balance Weighing Designs For v + Objects. Biometrica, 34, [] Cerana, B. and Graczy, M. (00) Some Construction of Optimum Chemical Balance Weighing Designs. Acta Universitatis Lodziensis, Folia Economic, 35, [] Awad, R. and Banerjee, S. (03) Some Construction Meods of Optimum Chemical Balance Weighing Designs I. Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS), 4, [3] Awad, R. and Banerjee, S. (04) Some Construction Meods of Optimum Chemical Balance Weighing Designs II. Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS), 5, [4] Awad, R. and Banerjee, S. (04) Some Construction Meods of A-Optimum Chemical Balance Weighing Designs. Journal of Applied Maematics and Physics (JAMP),, [5] Billington, E.J.B. and Robinson, P.T. (983) A List of Balanced Ternary Designs wi R 5 and Some Necessary Existence Conditions. Ars Combinatoria, 0, [6] Angelis, L., Moyssiadis, C. and Kageyama, S. (994) Constructions of Generalized Binary Proper Efficiency Balanced Bloc Designs wi Two Different Replication Numbers. Sanhya, 56, [7] Calisi, T. (977) On e Notation of Balance Bloc Designs. In: Barra, J.R., Brodeau, F., Romier, G. and Van Cutsem, B., Eds., Recent Developments in Statistics, Nor-Holland Publishing Company, Amsterdam, [8] Puri, P.D. and Nigam, A.K. (975) On Patterns of Efficiency Balanced Designs. Journal of e Royal Statistical Society, B37, [9] Rao, V.R. (958) A Note on Balanced Designs. The Annals of Maematical Statistics, 9, [0] Calisi, T. (97) On Some Desirable Patterns in Bloc Designs. Biometria, 7, [] Calisi, T. and Kageyama, S. (003) Bloc Designs: A Randomized Approach, Volume I: Analysis. Springer, New Yor. [] Calisi, T. and Kageyama, S. (003) Bloc Designs: A Randomized Approach, Volume II: Design. Springer, New Yor. [3] Kageyama, S. (980) On Properties of Efficiency-Balanced Designs. Communications in Statistics Theory and Meods, 9, [4] Preece, D.A. (967) Nested Balanced Incomplete Bloc Designs. Biometria, 54, [5] Ghosh, D.K. and Karmaar, P.K. (988) Some Series of Efficiency Balanced Designs. Australian Journal of Statistics, 30, [6] Ghosh, D.K., Shah, A. and Kageyama, S. (994) Construction of Variance Balanced and Efficiency Balanced Bloc 47

12 Designs. Journal of e Japan Statistical Society, 4, [7] Banerjee, S. (985) Some Combinatorial Problems in Incomplete Bloc Designs. Unpublished PhD Thesis, Devi Ahilya University, Indore. [8] Banerjee, S., Kageyama, S. and Rai, S. (003) Nested Balanced Equireplicate Bloc Designs. Discussion Maematicae: Probability and Statistics, 3, [9] Banerjee, S., Kageyama, S. and Rudra, S. (005) Constructions of Nested Pairwise Efficiency and Variance Balanced Designs. Communications in Statistics Theory and Meods, 37, [30] Raghavarao, D. (97) Constructions and Combinatorial Problems in Designs of Experiments. John Wiley, New Yor. [3] Hall Jr., M. (986) Combinatorial Theory. John Wiley, New Yor. 48

Some Construction Methods of Optimum Chemical Balance Weighing Designs II

Some Construction Methods of Optimum Chemical Balance Weighing Designs II Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) 5(): 39-44 Scholarlin Research Institute Journals, 4 (ISS: 4-76) jeteas.scholarlinresearch.org Journal of Emerging Trends in Engineering

More information

Some Construction Methods of Optimum Chemical Balance Weighing Designs I

Some Construction Methods of Optimum Chemical Balance Weighing Designs I Journal of Emerging Trends in Engineering and Applied Sciences (JETEAS) 4(6): 778-783 Scholarlin Research Institute Journals, 3 (ISS: 4-76) jeteas.scholarlinresearch.org Journal of Emerging Trends in Engineering

More information

REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS

REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS REVSTAT Statistical Journal Volume 10, Number 3, November 01, 33 333 REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS Author: Ma lgorzata Graczyk Department of Mathematical and Statistical Methods, Poznań

More information

X -1 -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs

X -1 -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs DOI:.55/bile-5- Biometrical Letters Vol. 5 (5), No., - X - -balance of some partially balanced experimental designs with particular emphasis on block and row-column designs Ryszard Walkowiak Department

More information

NESTED BLOCK DESIGNS

NESTED BLOCK DESIGNS NESTED BLOCK DESIGNS Rajender Parsad I.A.S.R.I., Library Avenue, New Delhi 0 0 rajender@iasri.res.in. Introduction Heterogeneity in the experimental material is the most important problem to be reckoned

More information

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION CHAPTER 3 CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION 3.1 Introduction 3.2 Historical Review 3.3 Preliminary Results 3.4 Construction of RG Designs using a BIB design with b

More information

Construction of Partially Balanced Incomplete Block Designs

Construction of Partially Balanced Incomplete Block Designs International Journal of Statistics and Systems ISS 0973-675 Volume, umber (06), pp. 67-76 Research India Publications http://www.ripublication.com Construction of Partially Balanced Incomplete Block Designs

More information

Root-Patterns to Algebrising Partitions

Root-Patterns to Algebrising Partitions Advances in Pure Maematics, 015, 5, 31-41 Published Online January 015 in SciRes. http://www.scirp.org/journal/apm http://dx.doi.org/10.436/apm.015.51004 Root-Patterns to Algebrising Partitions Rex L.

More information

NOTES ON THE REGULAR E-OPTIMAL SPRING BALANCE WEIGHING DESIGNS WITH CORRE- LATED ERRORS

NOTES ON THE REGULAR E-OPTIMAL SPRING BALANCE WEIGHING DESIGNS WITH CORRE- LATED ERRORS REVSTAT Statistical Journal Volume 3, Number 2, June 205, 9 29 NOTES ON THE REGULAR E-OPTIMAL SPRING BALANCE WEIGHING DESIGNS WITH CORRE- LATED ERRORS Authors: Bronis law Ceranka Department of Mathematical

More information

Weighing matrices and their applications

Weighing matrices and their applications University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1997 Weighing matrices and their applications Christos Koukouvinos Jennifer

More information

CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS

CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS CHAPTER 4 CONSTRUCTION OF SEMI-REGULAR GRAPH DESIGNS 4.1 Introduction 4.2 Historical Review 4.3 Preliminary Results 4.4 Methods of Construction of SRG Designs 4.4.1 Construction using BIB Designs with

More information

arxiv: v1 [math.co] 27 Jul 2015

arxiv: v1 [math.co] 27 Jul 2015 Perfect Graeco-Latin balanced incomplete block designs and related designs arxiv:1507.07336v1 [math.co] 27 Jul 2015 Sunanda Bagchi Theoretical Statistics and Mathematics Unit Indian Statistical Institute

More information

New Lower Bounds for the Number of Blocks in Balanced Incomplete Block Designs

New Lower Bounds for the Number of Blocks in Balanced Incomplete Block Designs New Lower Bounds for the Number of Blocs in Balanced Incomplete Bloc Designs MUHAMMAD A KHAN ABSTRACT: Bose [1] proved the inequality b v+ r 1 for resolvable balanced incomplete bloc designs (RBIBDs) and

More information

MATHEMATICAL ENGINEERING TECHNICAL REPORTS

MATHEMATICAL ENGINEERING TECHNICAL REPORTS MATHEMATICAL ENGINEERING TECHNICAL REPORTS Combinatorial Relaxation Algorithm for the Entire Sequence of the Maximum Degree of Minors in Mixed Polynomial Matrices Shun SATO (Communicated by Taayasu MATSUO)

More information

CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS

CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS Journal of Research (Science), Bahauddin Zakariya University, Multan, Pakistan. Vol. 8, No., July 7, pp. 67-76 ISSN - CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS L. Rasul and I. Iqbal Department

More information

The matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.

The matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0. ) Find all solutions of the linear system. Express the answer in vector form. x + 2x + x + x 5 = 2 2x 2 + 2x + 2x + x 5 = 8 x + 2x + x + 9x 5 = 2 2 Solution: Reduce the augmented matrix [ 2 2 2 8 ] to

More information

On Co-Positive Approximation of Unbounded Functions in Weighted Spaces

On Co-Positive Approximation of Unbounded Functions in Weighted Spaces On Co-Positive Approximation of Unbounded Functions in Weighted Spaces Alaa A Auad 1 and Alaa M FAL Jumaili 2 1 Department of Maematics, College of Education for pure Science, University of Anbar, Al-Ramadi

More information

Balanced Nested Designs and Balanced n-ary Designs

Balanced Nested Designs and Balanced n-ary Designs Balanced Nested Designs and Balanced n-ary Designs Ryoh Fuji-Hara a, Shinji Kuriki b, Ying Miao a and Satoshi Shinohara c a Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki

More information

ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS

ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS Hacettepe Journal of Mathematics and Statistics Volume 31 (2002), 57 62 ON THE CONSTRUCTION OF 2-SYMBOL ORTHOGONAL ARRAYS Hülya Bayra and Aslıhan Alhan Received 22. 01. 2002 Abstract The application of

More information

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are

More information

A Note on Cochran Test for Homogeneity in Two Ways ANOVA and Meta-Analysis

A Note on Cochran Test for Homogeneity in Two Ways ANOVA and Meta-Analysis Open Journal of Statistics, 05, 5, 787-796 Published Online December 05 in SciRes. http://www.scirp.org/journal/ojs http://dx.doi.org/0.436/ojs.05.57078 A Note on Cochran Test for Homogeneity in Two Ways

More information

ON HIGHLY D-EFFICIENT DESIGNS WITH NON- NEGATIVELY CORRELATED OBSERVATIONS

ON HIGHLY D-EFFICIENT DESIGNS WITH NON- NEGATIVELY CORRELATED OBSERVATIONS ON HIGHLY D-EFFICIENT DESIGNS WITH NON- NEGATIVELY CORRELATED OBSERVATIONS Authors: Krystyna Katulska Faculty of Mathematics and Computer Science, Adam Mickiewicz University in Poznań, Umultowska 87, 61-614

More information

Some applications of weighing designs

Some applications of weighing designs Biometrical Letters Vol. 50 (203), No., 5-26 DOI:0.2478/bile-203-004 Some applications of weighing designs Małgorzata Graczyk Department of Mathematical and Statistical Methods, Poznań University of Life

More information

FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES

FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most

More information

Department of Economics. Working Papers

Department of Economics. Working Papers 10ISSN 1183-1057 SIMON FRASER UNIVERSITY Department of Economics Working Papers 08-07 "A Cauchy-Schwarz inequality for expectation of matrices" Pascal Lavergne November 2008 Economics A Cauchy-Schwarz

More information

ON THE QR ITERATIONS OF REAL MATRICES

ON THE QR ITERATIONS OF REAL MATRICES Unspecified Journal Volume, Number, Pages S????-????(XX- ON THE QR ITERATIONS OF REAL MATRICES HUAJUN HUANG AND TIN-YAU TAM Abstract. We answer a question of D. Serre on the QR iterations of a real matrix

More information

Testing a Normal Covariance Matrix for Small Samples with Monotone Missing Data

Testing a Normal Covariance Matrix for Small Samples with Monotone Missing Data Applied Mathematical Sciences, Vol 3, 009, no 54, 695-70 Testing a Normal Covariance Matrix for Small Samples with Monotone Missing Data Evelina Veleva Rousse University A Kanchev Department of Numerical

More information

On the Cauchy Problem for Von Neumann-Landau Wave Equation

On the Cauchy Problem for Von Neumann-Landau Wave Equation Journal of Applie Mathematics an Physics 4 4-3 Publishe Online December 4 in SciRes http://wwwscirporg/journal/jamp http://xoiorg/436/jamp4343 On the Cauchy Problem for Von Neumann-anau Wave Equation Chuangye

More information

An Algorithm to Solve the Games under Incomplete Information

An Algorithm to Solve the Games under Incomplete Information Annals of Pure and Applied Maematics Vol. 10, No.2, 2015, 221-228 ISSN: 2279-087X (P), 2279-0888(online) Published on 30 October 2015 www.researchmasci.org Annals of An Algorim to Solve e Games under Incomplete

More information

The generalized order-k Fibonacci Pell sequence by matrix methods

The generalized order-k Fibonacci Pell sequence by matrix methods Journal of Computational and Applied Mathematics 09 (007) 33 45 wwwelseviercom/locate/cam The generalized order- Fibonacci Pell sequence by matrix methods Emrah Kilic Mathematics Department, TOBB University

More information

ON THE CONSTRUCTION OF REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS

ON THE CONSTRUCTION OF REGULAR A-OPTIMAL SPRING BALANCE WEIGHING DESIGNS Colloquium Biometricum 43 3, 3 9 ON THE CONSTRUCTION OF REGUAR A-OPTIMA SPRING BAANCE WEIGHING DESIGNS Bronisław Ceranka, Małgorzata Graczyk Department of Matematical and Statistical Metods Poznań Uniersity

More information

Chapter 10 Combinatorial Designs

Chapter 10 Combinatorial Designs Chapter 10 Combinatorial Designs BIBD Example (a,b,c) (a,b,d) (a,c,e) (a,d,f) (a,e,f) (b,c,f) (b,d,e) (b,e,f) (c,d,e) (c,d,f) Here are 10 subsets of the 6 element set {a, b, c, d, e, f }. BIBD Definition

More information

On the adjacency matrix of a block graph

On the adjacency matrix of a block graph On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit

More information

Application of Independent Variables Transformations for Polynomial Regression Model Estimations

Application of Independent Variables Transformations for Polynomial Regression Model Estimations 3rd International Conference on Applied Maematics and Pharmaceutical Sciences (ICAMPS'03) April 9-30, 03 Singapore Application of Independent Variables Transformations for Polynomial Regression Model Estimations

More information

Tibor ILLèS. Katalin MèSZêROS

Tibor ILLèS. Katalin MèSZêROS Yugoslav Journal of Operations Research 11 (2001), Numer 1 15-30 A NEW AND CONSRUCIVE PROOF OF WO ASIC RESULS OF LINEAR PROGRAMMING * ior ILLèS Department of Operations Research E tv s LorÃnd University

More information

An Efficient Algorithm for the Numerical Computation of the Complex Eigenpair of a Matrix

An Efficient Algorithm for the Numerical Computation of the Complex Eigenpair of a Matrix Journal of Applied Mathematics and Physics, 2017, 5, 680-692 http://www.scirp.org/journal/jamp ISSN Online: 2327-4379 ISSN Print: 2327-4352 An Efficient Algorithm for the Numerical Computation of the Complex

More information

--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------

More information

B. L. Raktoe* and W. T. Federer University of Guelph and Cornell University. Abstract

B. L. Raktoe* and W. T. Federer University of Guelph and Cornell University. Abstract BALANCED OPTIMAL SA'IURATED MAIN EFFECT PLANS OF 'IHE 2n FACTORIAL AND THEIR RELATION TO (v,k,'x.) CONFIGURATIONS BU-406-M by January, 1S72 B. L. Raktoe* and W. T. Federer University of Guelph and Cornell

More information

1 Determinants. 1.1 Determinant

1 Determinants. 1.1 Determinant 1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to

More information

Theoretical Properties of Weighted Generalized. Rayleigh and Related Distributions

Theoretical Properties of Weighted Generalized. Rayleigh and Related Distributions Theoretical Mathematics & Applications, vol.2, no.2, 22, 45-62 ISSN: 792-9687 (print, 792-979 (online International Scientific Press, 22 Theoretical Properties of Weighted Generalized Rayleigh and Related

More information

Construction of Pair-wise Balanced Design

Construction of Pair-wise Balanced Design Journal of Modern Applied Statistical Methods Volume 15 Issue 1 Article 11 5-2016 onstruction of Pair-wise Balanced Design Rajarathinam Arunachalam Manonmaniam Sundaranar University, arrathinam@yahoo.com

More information

On V-orthogonal projectors associated with a semi-norm

On V-orthogonal projectors associated with a semi-norm On V-orthogonal projectors associated with a semi-norm Short Title: V-orthogonal projectors Yongge Tian a, Yoshio Takane b a School of Economics, Shanghai University of Finance and Economics, Shanghai

More information

Stochastic Design Criteria in Linear Models

Stochastic Design Criteria in Linear Models AUSTRIAN JOURNAL OF STATISTICS Volume 34 (2005), Number 2, 211 223 Stochastic Design Criteria in Linear Models Alexander Zaigraev N. Copernicus University, Toruń, Poland Abstract: Within the framework

More information

{ ϕ(f )Xt, 1 t n p, X t, n p + 1 t n, { 0, t=1, W t = E(W t W s, 1 s t 1), 2 t n.

{ ϕ(f )Xt, 1 t n p, X t, n p + 1 t n, { 0, t=1, W t = E(W t W s, 1 s t 1), 2 t n. Innovations, Sufficient Statistics, And Maximum Lielihood In ARM A Models Georgi N. Boshnaov Institute of Mathematics, Bulgarian Academy of Sciences 1. Introduction. Let X t, t Z} be a zero mean ARMA(p,

More information

Manoj K. Keshari 1 and Satya Mandal 2.

Manoj K. Keshari 1 and Satya Mandal 2. K 0 of hypersurfaces defined by x 2 1 +... + x 2 n = ±1 Manoj K. Keshari 1 and Satya Mandal 2 1 Department of Mathematics, IIT Mumbai, Mumbai - 400076, India 2 Department of Mathematics, University of

More information

APPLICATIONS OF THE HYPER-POWER METHOD FOR COMPUTING MATRIX PRODUCTS

APPLICATIONS OF THE HYPER-POWER METHOD FOR COMPUTING MATRIX PRODUCTS Univ. Beograd. Publ. Eletrotehn. Fa. Ser. Mat. 15 (2004), 13 25. Available electronically at http: //matematia.etf.bg.ac.yu APPLICATIONS OF THE HYPER-POWER METHOD FOR COMPUTING MATRIX PRODUCTS Predrag

More information

Some Reviews on Ranks of Upper Triangular Block Matrices over a Skew Field

Some Reviews on Ranks of Upper Triangular Block Matrices over a Skew Field International Mathematical Forum, Vol 13, 2018, no 7, 323-335 HIKARI Ltd, wwwm-hikaricom https://doiorg/1012988/imf20188528 Some Reviews on Ranks of Upper Triangular lock Matrices over a Skew Field Netsai

More information

Bias Correction in the Balanced-half-sample Method if the Number of Sampled Units in Some Strata Is Odd

Bias Correction in the Balanced-half-sample Method if the Number of Sampled Units in Some Strata Is Odd Journal of Of cial Statistics, Vol. 14, No. 2, 1998, pp. 181±188 Bias Correction in the Balanced-half-sample Method if the Number of Sampled Units in Some Strata Is Odd Ger T. Slootbee 1 The balanced-half-sample

More information

CONSTRUCTION OF RECTANGULAR PBIB DESIGNS

CONSTRUCTION OF RECTANGULAR PBIB DESIGNS Journal of Scientific Research Vol. 55, 2011 : 103-110 Banaras Hindu University, Varanasi ISSN : 0447-9483 CONSTRUCTION OF RECTANGULAR PBIB DESIGNS Hemant Kr. Singh *, J.S. Parihar **, R.D. Singh * & Vipul

More information

Journal of Multivariate Analysis. Sphericity test in a GMANOVA MANOVA model with normal error

Journal of Multivariate Analysis. Sphericity test in a GMANOVA MANOVA model with normal error Journal of Multivariate Analysis 00 (009) 305 3 Contents lists available at ScienceDirect Journal of Multivariate Analysis journal homepage: www.elsevier.com/locate/jmva Sphericity test in a GMANOVA MANOVA

More information

An Incomplete Block Change-Over Design Balanced for First and Second-Order Residual Effect

An Incomplete Block Change-Over Design Balanced for First and Second-Order Residual Effect ISSN 66-0379 03, Vol., No. An Incomplete Block Change-Over Design Balanced for First and Second-Order Residual Effect Kanchan Chowdhury Professor, Department of Statistics, Jahangirnagar University Savar,

More information

A-optimal diallel crosses for test versus control comparisons. Summary. 1. Introduction

A-optimal diallel crosses for test versus control comparisons. Summary. 1. Introduction A-otimal diallel crosses for test versus control comarisons By ASHISH DAS Indian Statistical Institute, New Delhi 110 016, India SUDHIR GUPTA Northern Illinois University, Dekal, IL 60115, USA and SANPEI

More information

SOME IMPROVED ESTIMATORS IN MULTIPHASE SAMPLING ABSTRACT KEYWORDS

SOME IMPROVED ESTIMATORS IN MULTIPHASE SAMPLING ABSTRACT KEYWORDS Pak. J. Statist. 010, Vol. 61 195-0 SOME IMPROVED ESTIMATORS IN MULTIPHASE SAMPLING Muhammad Hanif 1, Muhammad Qaiser Shahbaz, and Zahoor Ahmad 3 1 Lahore University of Management Sciences, Lahore, Pakistan

More information

Some Congruences for the Partial Bell Polynomials

Some Congruences for the Partial Bell Polynomials 3 47 6 3 Journal of Integer Seuences, Vol. 009), Article 09.4. Some Congruences for the Partial Bell Polynomials Miloud Mihoubi University of Science and Technology Houari Boumediene Faculty of Mathematics

More information

Designs for Multiple Comparisons of Control versus Treatments

Designs for Multiple Comparisons of Control versus Treatments Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 14, Number 3 (018), pp. 393-409 Research India Publications http://www.ripublication.com Designs for Multiple Comparisons of Control

More information

Combinatorial Designs: Balanced Incomplete Block Designs

Combinatorial Designs: Balanced Incomplete Block Designs Combinatorial Designs: Balanced Incomplete Block Designs Designs The theory of design of experiments came into being largely through the work of R.A.Fisher and F.Yates in the early 1930's. They were motivated

More information

Complete Semigroups of Binary Relations Defined by Semilattices of the Class Σ X,10

Complete Semigroups of Binary Relations Defined by Semilattices of the Class Σ X,10 Applied Mathematics 05 6 74-4 Published Online February 05 in SciRes. http://www.scirp.org/journal/am http://dx.doi.org/0.46/am.05.606 Complete Semigroups of Binary Relations efined by Semilattices of

More information

Welsh s problem on the number of bases of matroids

Welsh s problem on the number of bases of matroids Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University

More information

The Greatest Common Divisor of k Positive Integers

The Greatest Common Divisor of k Positive Integers International Mathematical Forum, Vol. 3, 208, no. 5, 25-223 HIKARI Ltd, www.m-hiari.com https://doi.org/0.2988/imf.208.822 The Greatest Common Divisor of Positive Integers Rafael Jaimczu División Matemática,

More information

Math 60. Rumbos Spring Solutions to Assignment #17

Math 60. Rumbos Spring Solutions to Assignment #17 Math 60. Rumbos Spring 2009 1 Solutions to Assignment #17 a b 1. Prove that if ad bc 0 then the matrix A = is invertible and c d compute A 1. a b Solution: Let A = and assume that ad bc 0. c d First consider

More information

Estimating the parameters of hidden binomial trials by the EM algorithm

Estimating the parameters of hidden binomial trials by the EM algorithm Hacettepe Journal of Mathematics and Statistics Volume 43 (5) (2014), 885 890 Estimating the parameters of hidden binomial trials by the EM algorithm Degang Zhu Received 02 : 09 : 2013 : Accepted 02 :

More information

On the existence of nested orthogonal arrays

On the existence of nested orthogonal arrays Discrete Mathematics 308 (2008) 4635 4642 www.elsevier.com/locate/disc On the existence of nested orthogonal arrays Rahul Mueree a, Peter Z.G. Qian b, C.F. Jeff Wu c a Indian Institute of Management Calcutta,

More information

Optimization under Ordinal Scales: When is a Greedy Solution Optimal?

Optimization under Ordinal Scales: When is a Greedy Solution Optimal? Optimization under Ordinal Scales: When is a Greedy Solution Optimal? Aleksandar Pekeč BRICS Department of Computer Science University of Aarhus DK-8000 Aarhus C, Denmark pekec@brics.dk Abstract Mathematical

More information

Some matrices of Williamson type

Some matrices of Williamson type University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1973 Some matrices of Williamson type Jennifer Seberry University of Wollongong,

More information

S Abelman * Keywords: Multivariate analysis of variance (MANOVA), hypothesis testing.

S Abelman * Keywords: Multivariate analysis of variance (MANOVA), hypothesis testing. S Afr Optom 2006 65 (2) 62 67 A p p l i c a t i o n o f m u l t i v a r i a t e a n a l y s i s o f v a r i - a n c e ( M A N O VA ) t o d i s t a n c e r e f r a c t i v e v a r i - a b i l i t y a n

More information

On the number of representations of n by ax 2 + by(y 1)/2, ax 2 + by(3y 1)/2 and ax(x 1)/2 + by(3y 1)/2

On the number of representations of n by ax 2 + by(y 1)/2, ax 2 + by(3y 1)/2 and ax(x 1)/2 + by(3y 1)/2 ACTA ARITHMETICA 1471 011 On the number of representations of n by ax + byy 1/, ax + by3y 1/ and axx 1/ + by3y 1/ by Zhi-Hong Sun Huaian 1 Introduction For 3, 4,, the -gonal numbers are given by p n n

More information

A Questionable Distance-Regular Graph

A Questionable Distance-Regular Graph A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection

More information

11 Block Designs. Linear Spaces. Designs. By convention, we shall

11 Block Designs. Linear Spaces. Designs. By convention, we shall 11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,

More information

Balanced Treatment-Control Row-Column Designs

Balanced Treatment-Control Row-Column Designs International Journal of Theoretical & Applied Sciences, 5(2): 64-68(2013) ISSN No. (Print): 0975-1718 ISSN No. (Online): 2249-3247 Balanced Treatment-Control Row-Column Designs Kallol Sarkar, Cini Varghese,

More information

A note on orthogonal designs

A note on orthogonal designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1987 A note on orthogonal designs J Hammer D G. Sarvate Jennifer Seberry

More information

Asymptotic Properties of Turing s Formula in Relative Error

Asymptotic Properties of Turing s Formula in Relative Error Asymptotic Properties of Turing s Formula in Relative Error Michael Grabcha and Zhiyi Zhang University of North Carolina Charlotte November 24, 2016 Abstract Turing s formula allows one to estimate the

More information

Every SOMA(n 2, n) is Trojan

Every SOMA(n 2, n) is Trojan Every SOMA(n 2, n) is Trojan John Arhin 1 Marlboro College, PO Box A, 2582 South Road, Marlboro, Vermont, 05344, USA. Abstract A SOMA(k, n) is an n n array A each of whose entries is a k-subset of a knset

More information

Standard Ideals in BCL + Algebras

Standard Ideals in BCL + Algebras Journal of Mathematics Research; Vol. 8, No. 2; April 2016 SSN 1916-9795 E-SSN 1916-9809 Published by Canadian Center of Science and Education Standard deals in BCL + Algebras Yonghong Liu School of Automation,

More information

Efficient algorithms for finding the minimal polynomials and the

Efficient algorithms for finding the minimal polynomials and the Efficient algorithms for finding the minimal polynomials and the inverses of level- FLS r 1 r -circulant matrices Linyi University Department of mathematics Linyi Shandong 76005 China jzh108@sina.com Abstract:

More information

Multivariate Process Control Chart for Controlling the False Discovery Rate

Multivariate Process Control Chart for Controlling the False Discovery Rate Industrial Engineering & Management Systems Vol, No 4, December 0, pp.385-389 ISSN 598-748 EISSN 34-6473 http://dx.doi.org/0.73/iems.0..4.385 0 KIIE Multivariate Process Control Chart for Controlling e

More information

MEASURES OF CENTRAL TENDENCY

MEASURES OF CENTRAL TENDENCY INTRODUCTION: MEASURES OF CENTRAL TENDENCY Often, one encounters e term Measures of central tendency in a book on statistics (or an examination). One may also find mention of e term in a description of

More information

FERMENTATION BATCH PROCESS MONITORING BY STEP-BY-STEP ADAPTIVE MPCA. Ning He, Lei Xie, Shu-qing Wang, Jian-ming Zhang

FERMENTATION BATCH PROCESS MONITORING BY STEP-BY-STEP ADAPTIVE MPCA. Ning He, Lei Xie, Shu-qing Wang, Jian-ming Zhang FERMENTATION BATCH PROCESS MONITORING BY STEP-BY-STEP ADAPTIVE MPCA Ning He Lei Xie Shu-qing Wang ian-ming Zhang National ey Laboratory of Industrial Control Technology Zhejiang University Hangzhou 3007

More information

UTILIZING PRIOR KNOWLEDGE IN ROBUST OPTIMAL EXPERIMENT DESIGN. EE & CS, The University of Newcastle, Australia EE, Technion, Israel.

UTILIZING PRIOR KNOWLEDGE IN ROBUST OPTIMAL EXPERIMENT DESIGN. EE & CS, The University of Newcastle, Australia EE, Technion, Israel. UTILIZING PRIOR KNOWLEDGE IN ROBUST OPTIMAL EXPERIMENT DESIGN Graham C. Goodwin James S. Welsh Arie Feuer Milan Depich EE & CS, The University of Newcastle, Australia 38. EE, Technion, Israel. Abstract:

More information

Use of α-resolvable designs in the construction of two-factor experiments of split-plot type

Use of α-resolvable designs in the construction of two-factor experiments of split-plot type Biometrical Letters Vol. 53 206, No. 2, 05-8 DOI: 0.55/bile-206-0008 Use of α-resolvable designs in the construction of two-factor experiments of split-plot type Kazuhiro Ozawa, Shinji Kuriki 2, Stanisław

More information

2.1 Gaussian Elimination

2.1 Gaussian Elimination 2. Gaussian Elimination A common problem encountered in numerical models is the one in which there are n equations and n unknowns. The following is a description of the Gaussian elimination method for

More information

arxiv: v1 [math.gr] 16 Dec 2012

arxiv: v1 [math.gr] 16 Dec 2012 arxiv:1212.3740v1 [math.gr] 16 Dec 2012 Linear non-homogenous patterns and prime power generators in numerical semigroups associated to combinatorial configurations Klara Stoes and Maria Bras-Amorós October

More information

Interaction balance in symmetrical factorial designs with generalized minimum aberration

Interaction balance in symmetrical factorial designs with generalized minimum aberration Interaction balance in symmetrical factorial designs with generalized minimum aberration Mingyao Ai and Shuyuan He LMAM, School of Mathematical Sciences, Peing University, Beijing 100871, P. R. China Abstract:

More information

A new visual cryptography scheme for STS based access structures

A new visual cryptography scheme for STS based access structures A new visual cryptography scheme for STS based access structures Sucheta Chakrabarti R. K. Khanna Scientific Analysis Group DRDO Metcalfe House Complex Delhi 110 054 India Abstract Visual Cryptography

More information

PAIRED COMPARISON DESIGNS FOR TESTING CONCORDANCE BE.'TWEEN JUDGES

PAIRED COMPARISON DESIGNS FOR TESTING CONCORDANCE BE.'TWEEN JUDGES PARED COMPARSON DESGNS FOR TESTNG CONCORDANCE BE.'TWEEN JUDGES by R. C. Bose University of North Carolina and Division ot Research Techniques, London School of Economics and Political Sciences This research

More information

5 Operations on Multiple Random Variables

5 Operations on Multiple Random Variables EE360 Random Signal analysis Chapter 5: Operations on Multiple Random Variables 5 Operations on Multiple Random Variables Expected value of a function of r.v. s Two r.v. s: ḡ = E[g(X, Y )] = g(x, y)f X,Y

More information

Product distance matrix of a tree with matrix weights

Product distance matrix of a tree with matrix weights Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian

More information

EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES

EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES EQUIVALENCE OF TOPOLOGIES AND BOREL FIELDS FOR COUNTABLY-HILBERT SPACES JEREMY J. BECNEL Abstract. We examine the main topologies wea, strong, and inductive placed on the dual of a countably-normed space

More information

The spectra of super line multigraphs

The spectra of super line multigraphs The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology

More information

The Restricted Edge-Connectivity of Kautz Undirected Graphs

The Restricted Edge-Connectivity of Kautz Undirected Graphs The Restricted Edge-Connectivity of Kautz Undirected Graphs Ying-Mei Fan College of Mathematics and Information Science Guangxi University, Nanning, Guangxi, 530004, China Jun-Ming Xu Min Lü Department

More information

Bose's method of differences applied to construct Bhaskar Rao designs

Bose's method of differences applied to construct Bhaskar Rao designs University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1998 Bose's method of differences applied to construct Bhaskar Rao designs

More information

Binary codes of t-designs and Hadamard matrices

Binary codes of t-designs and Hadamard matrices Binary codes of t-designs and Hadamard matrices Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University November 8, 2013 JSPS-DST Asian Academic Seminar 2013 Discrete Mathematics

More information

Anale. Seria Informatică. Vol. XII fasc Annals. Computer Science Series. 12 th Tome 2 nd Fasc. 2014

Anale. Seria Informatică. Vol. XII fasc Annals. Computer Science Series. 12 th Tome 2 nd Fasc. 2014 Anale. Seria Informatică. Vol. XII fasc. 2 24 Annals. Computer Science Series. 2 th Tome 2 nd Fasc. 24 49 AN ALGORITHM FOR CONSTRUCTING SYMMETRIC ((r+)v, kr, kλ) BIBDs FROM AFFINE RESOLVABLE (v, b, r,

More information

Research Article Almost Sure Central Limit Theorem of Sample Quantiles

Research Article Almost Sure Central Limit Theorem of Sample Quantiles Advances in Decision Sciences Volume 202, Article ID 67942, 7 pages doi:0.55/202/67942 Research Article Almost Sure Central Limit Theorem of Sample Quantiles Yu Miao, Shoufang Xu, 2 and Ang Peng 3 College

More information

Eigenvectors and Reconstruction

Eigenvectors and Reconstruction Eigenvectors and Reconstruction Hongyu He Department of Mathematics Louisiana State University, Baton Rouge, USA hongyu@mathlsuedu Submitted: Jul 6, 2006; Accepted: Jun 14, 2007; Published: Jul 5, 2007

More information

LINEAR SPACES. Define a linear space to be a near linear space in which any two points are on a line.

LINEAR SPACES. Define a linear space to be a near linear space in which any two points are on a line. LINEAR SPACES Define a linear space to be a near linear space in which any two points are on a line. A linear space is an incidence structure I = (P, L) such that Axiom LS1: any line is incident with at

More information

Counting Permutations by their Rigid Patterns

Counting Permutations by their Rigid Patterns Counting Permutations by their Rigid Patterns A. N. Myers anmyers@math.upenn.edu University of Pennsylvania Philadelphia, PA 19104-6395 September 20, 2002 1 Abstract In how many permutations does the pattern

More information

The maximal determinant and subdeterminants of ±1 matrices

The maximal determinant and subdeterminants of ±1 matrices Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,

More information

Received 24 November 2015; accepted 17 January 2016; published 20 January 2016

Received 24 November 2015; accepted 17 January 2016; published 20 January 2016 Applied Mathematics, 06, 7, 40-60 Published Online January 06 in SciRes. http://www.scirp.org/journal/am http://d.doi.org/0.436/am.06.7004 The Formulas to Compare the Convergences of Newton s Method and

More information

Weak max-sum equivalence for dependent heavy-tailed random variables

Weak max-sum equivalence for dependent heavy-tailed random variables DOI 10.1007/s10986-016-9303-6 Lithuanian Mathematical Journal, Vol. 56, No. 1, January, 2016, pp. 49 59 Wea max-sum equivalence for dependent heavy-tailed random variables Lina Dindienė a and Remigijus

More information

ON VARIANCE COVARIANCE COMPONENTS ESTIMATION IN LINEAR MODELS WITH AR(1) DISTURBANCES. 1. Introduction

ON VARIANCE COVARIANCE COMPONENTS ESTIMATION IN LINEAR MODELS WITH AR(1) DISTURBANCES. 1. Introduction Acta Math. Univ. Comenianae Vol. LXV, 1(1996), pp. 129 139 129 ON VARIANCE COVARIANCE COMPONENTS ESTIMATION IN LINEAR MODELS WITH AR(1) DISTURBANCES V. WITKOVSKÝ Abstract. Estimation of the autoregressive

More information