Generalized Incomplete Trojan-Type Designs with Unequal Cell Sizes

Similar documents
Analysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson

Tile Values of Information in Some Nonzero Sum Games

Understanding the Spike Algorithm

A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results

Parameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University

UNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT

Rational Secret Sharing without Broadcast

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht

Control Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart

Adaptive Modulation for Multiple Antenna Channels

Digital Transmission

Walsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter

Research of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b

Fall 2018 #11 Games and Nimbers. A. Game. 0.5 seconds, 64 megabytes

Target Response Adaptation for Correlation Filter Tracking

Graph Method for Solving Switched Capacitors Circuits

Malicious User Detection in Spectrum Sensing for WRAN Using Different Outliers Detection Techniques

Hierarchical Generalized Cantor Set Modulation

MTBF PREDICTION REPORT

Review: Our Approach 2. CSC310 Information Theory

NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION

Uncertainty in measurements of power and energy on power networks

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks

Learning Ensembles of Convolutional Neural Networks

Space Time Equalization-space time codes System Model for STCM

Guidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014

Secure Transmission of Sensitive data using multiple channels

Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling

Fast Code Detection Using High Speed Time Delay Neural Networks

In-system Jitter Measurement Based on Blind Oversampling Data Recovery

Evaluate the Effective of Annular Aperture on the OTF for Fractal Optical Modulator

A NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems

aperture David Makovoz, 30/01/2006 Version 1.0 Table of Contents

A Simple Satellite Exclusion Algorithm for Advanced RAIM

THEORY OF YARN STRUCTURE by Prof. Bohuslav Neckář, Textile Department, IIT Delhi, New Delhi. Compression of fibrous assemblies

California, 4 University of California, Berkeley

A Benchmark for D2D in Cellular Networks: The Importance of Information

Figure 1. DC-DC Boost Converter

Cascaded Bayesian Inferencing for Switching Activity Estimation with Correlated Inputs

Chapter 1. On-line Choice of On-line Algorithms. Yossi Azar Andrei Z. Broder Mark S. Manasse

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems

Optimal Periodic Training Signal for Frequency Offset Estimation in Frequency Selective Fading Channels

State Description of Wireless Channels Using Change-Point Statistical Tests

Range-Based Localization in Wireless Networks Using Density-Based Outlier Detection

To: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel

Efficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques

Passive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Low Switching Frequency Active Harmonic Elimination in Multilevel Converters with Unequal DC Voltages

ph fax

A Predictive QoS Control Strategy for Wireless Sensor Networks

A MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS

Available online at ScienceDirect. IFAC-PapersOnLine (2016)

Joint Rate-Routing Control for Fair and Efficient Data Gathering in Wireless sensor Networks

Figure.1. Basic model of an impedance source converter JCHPS Special Issue 12: August Page 13

RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING

Impact of Interference Model on Capacity in CDMA Cellular Networks. Robert Akl, D.Sc. Asad Parvez University of North Texas

Joint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding

problems palette of David Rock and Mary K. Porter 6. A local musician comes to your school to give a performance

Optimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation

LOCAL DECODING OF WALSH CODES TO REDUCE CDMA DESPREADING COMPUTATION

Inverse Halftoning Method Using Pattern Substitution Based Data Hiding Scheme

Dynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint

Energy Efficiency Analysis of a Multichannel Wireless Access Protocol

Cooperative perimeter surveillance with a team of mobile robots under communication constraints

Algorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov

Multiband Jamming Strategies with Minimum Rate Constraints

High Speed, Low Power And Area Efficient Carry-Select Adder

A New Type of Weighted DV-Hop Algorithm Based on Correction Factor in WSNs

MIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.

A study of turbo codes for multilevel modulations in Gaussian and mobile channels

Power-Constrained Test Scheduling for Multi-Clock Domain SoCs

STATISTICS. is given by. i i. = total frequency, d i. = x i a ANIL TUTORIALS. = total frequency and d i. = total frequency, h = class-size

sensors ISSN

SCORE-BASED ADAPTIVE TRAINING FOR P300 SPELLER BRAIN-COMPUTER INTERFACE Yuan Zou, Omid Dehzangi, Roozbeh Jafari

Fault Classification and Location on 220kV Transmission line Hoa Khanh Hue Using Anfis Net

Uplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment

A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION

Index Terms Adaptive modulation, Adaptive FEC, Packet Error Rate, Performance.

On Sensor Fusion in the Presence of Packet-dropping Communication Channels

Optimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples

Modelling Service Time Distribution in Cellular Networks Using Phase-Type Service Distributions

Decomposition Principles and Online Learning in Cross-Layer Optimization for Delay-Sensitive Applications

Performance of Some Ridge Parameters for Probit Regression:

Calculation of the received voltage due to the radiation from multiple co-frequency sources

N( E) ( ) That is, if the outcomes in sample space S are equally likely, then ( )

arxiv: v1 [cs.it] 30 Sep 2008

N- and P-Channel 2.5-V (G-S) MOSFET

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 5, NO. 3, MARCH Transactions Letters

Spectrum Auction Framework for Access Allocation in Cognitive Radio Networks

A thesis presented to. the faculty of. the Russ College of Engineering and Technology of Ohio University. In partial fulfillment

An Algorithm Forecasting Time Series Using Wavelet

Electricity Network Reliability Optimization

Revision of Lecture Twenty-One

RC Filters TEP Related Topics Principle Equipment

Application of Linear Discriminant Analysis to Doppler Classification

Quantifying Content Consistency Improvements Through Opportunistic Contacts

On Interference Alignment for Multi-hop MIMO Networks

On Channel Estimation of OFDM-BPSK and -QPSK over Generalized Alpha-Mu Fading Distribution

Discussion on How to Express a Regional GPS Solution in the ITRF

Transcription:

Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese, Seema Jagg and Eldho Varghese Indan Agrcultural Statstcs Research Insttute Lbrary Avenue, New Delh, INDIA (Correspondng author Cn Varghese) (Receved 15 December 2013, Accepted 21 March, 2014) ABSTRACT: Generalzed Incomplete Trojan-Type Desgns are row-column desgns n whch each cell, correspondng to the ntersecton of row and column, contans more than one treatment and the rows are ncomplete. In some expermental stuatons, t s not possble for the expermenter to have the row-column ntersectons of equal sze. Generalzed ncomplete Trojan-type desgns wth unequal cell szes are to be obtaned for such stuatons. In ths paper, a method of constructon of a seres of generalzed ncomplete Trojan-type desgn wth unequal cell szes has been developed. Key Words: Row-column desgn, Trojan-type desgn, Sem-Latn square, Unequal cell sze I. INTRODUCTION Row-column desgns (RCDs) are used n expermental stuatons when the heterogenety n the expermental materal s due to two cross classfed sources. Most commonly, the row-column desgns have only one unt correspondng to the ntersecton of each row and column. However, there may be nstances when the number of treatments s substantally large and a more general class of row-column desgns s requred wheren there s more than one unt n each row-column ntersecton. For example, consder a sensory tral to make a comparatve ratng of 12 food products that are presented to 3 panel members. The constrant here s that each member can assess a maxmum of 4 products n a sesson, more than whch may cause assessor fatgue. The ratng may vary from member to member and sesson to sesson and hence the panel members and sessons can be treated as row as well as column classfcatons. There are 3 rows and 3 columns, but the number of products to be rated s 12 and hence each row-column ntersecton has to be further dvded nto 4 sub-sessons or cells. Sem-Latn square, a generalzed row-column desgn wth n rows and n columns wheren the ntersecton of each row and each column contans a cell of k subdvons resultng n nk cells each row and each column, s approprate for such an expermental stuaton. Thus, each row and each column s complete. Darby and Glbert [1] descrbed Trojan squares based on sets of mutually orthogonal supermposed Latn squares as a specal class of sem-latn squares. These desgns are shown to be maxmally effcent desgns for par-wse treatment comparsons n the plots-wthnblocks stratum by Baley [2]. Some combnatoral propertes of sem-latn squares and related desgns were dscussed by Preece and Freeman [3]. Baley [4, 2] obtaned a range of sem- Latn and Trojan square desgns and showed that the Trojan squares are the optmal choce of sem-latn squares for par-wse comparsons of treatment means. Incomplete Trojan squares obtaned by omttng a sngle row from a complete Trojan square have been dscussed by Edmondson [5], whch are of consderable practcal utlty, when there s a lmtaton of resources. Edmondson [6] constructed generalzed ncomplete Trojan square desgns based on a set of cyclc generators. Some methods of constructon of sem-latn squares were gven by Bedford and Whtaker [7]. Further, Baley and Monod [8] gave some effcent sem-latn rectangles useful for plant dsease experments. Subsequently, Dharmalngam [9] used Trojan square desgn to obtan partal trallel crosses. Jagg et al. [10] defned Generalzed Incomplete Trojan-Type Desgns n whch each cell, correspondng to the ntersecton of row and column, contans more than one treatment and the rows are ncomplete. They have developed a method of constructng these desgns. These desgns are avalable for any number of treatments 6 wth flexblty n choosng the cell sze dependng on the expermental resources avalable. Many tmes, t s not possble for the expermenter to have the row-column ntersectons of equal sze. Generalzed ncomplete Trojan-type desgns wth unequal cell szes are sutable for such stuatons. Here, a method of constructon of a seres of generalzed ncomplete Trojan-type desgn wth dfferent cell szes has been developed.

II. GENERALIZED INCOMPLETE TROJAN- TYPE DESIGNS Defnton (Jagg et al., [10]): Consder an array wth m rows and n columns n whch each ntersecton of row and column s dvded nto k sub-unts formng a total of mnk sub-unts n all. A Generalzed Incomplete Trojan-Type desgn s an arrangement of v treatments n mnk sub-unts, such that each treatment occurs n every column α ( 2) tmes, n every row β tmes (β = 0 or 1) and on every sub-unt γ tmes (γ = 0 or 1). A general method of constructng generalzed ncomplete Trojan-Type desgns wth unequal cell szes s explaned n the subsequent secton. III. METHOD OF CONSTRUCTION OF GENERALIZED INCOMPLETE TROJAN-TYPE DESIGN Let there be v treatments (v > 5) denoted by 1,2,, v. Arrange the frst s treatments 5 s (v-1) n the frst row of the desgn. Varghese, Jagg and Varghese 51 1 2 3 4 5 6 7 2 3 4 5 6 7 8 3 4 5 6 7 8 1 v 4 5 6 7 8 1 2 v 6 7 8 1 2 3 4 v 7 8 1 2 3 4 5 v 8 1 2 3 4 5 6 Group these s treatments nto n groups (n 2) of szes n k, = 1, 2,, n, ( k = s ) such that at least one or = 1 all of the groups are of dfferent sze. Each group of treatments belongs to a cell n the frst row of the desgn. Now develop (v-1) more rows of the desgn cyclcally, column-wse, by addng 1 to the treatment n the prevous row (reduced mod v). Thus, we get a generalzed ncomplete Trojan-type desgn wth cell szes k for v treatments n m = v rows of sze s and n columns of sze vk. There are several ways to form the n cells n the frst row and hence one can obtan a number of desgns wth dfferent set of parameters for a gven number of treatments, v. Example 3.1: Let there be v = 8 treatments. Further let s = 7 and n = 2. Takng k 1 = 5 and k 2 = 2, the generalzed ncomplete Trojan-type desgn s obtaned n 8 rows and 2 columns as: The nformaton matrx C = - 0.6 - - - - 0.6 The nformaton matrx of treatment effects and the varances pertanng to estmated elementary treatment contrasts under a four-way classfed model were computed by wrtng a SAS code. The elementary treatment contrasts are estmated wth three types of varances, vz., 0.3231, 0.3685 and 0.3885. The average varance s calculated as 0.3646.

Varghese, Jagg and Varghese 52 For 8 treatments, takng s = 6, n = 2, k 1 = 4 and k 2 = 2, the followng desgn s obtaned: 1 2 3 4 5 6 2 3 4 5 6 7 3 4 5 6 7 8 v 4 5 6 7 8 1 v 5 6 7 8 1 2 v 6 7 8 1 2 3 v 7 8 1 2 3 4 v 8 1 2 3 4 5 The nformaton matrx C = - 0.5-0.3-0.3-0.5 The varances are 0.3976, 857, 0.5405 and 0.5714 and average varance s 884. Agan, one can have a generalzed ncomplete Trojan-type desgn n 8 rows and 2 columns havng two dfferent cell szes k 1 = 4 and k 2 = 3 as gven below: 1 2 3 4 5 6 7 2 3 4 5 6 7 8 3 4 5 6 7 8 1 v 4 5 6 7 8 1 2 v 6 7 8 1 2 3 4 v 7 8 1 2 3 4 5 v 8 1 2 3 4 5 6

Varghese, Jagg and Varghese 53 The nformaton matrx C = - 0.8-0.3-0.3-0.8 The varances pertanng to estmated elementary treatment contrasts are 0.3221, 0.3744, 268 and 489 and the average varance s 0.3851. Another arrangement of 8 treatments s gven below n 8 rows and 3 columns havng three dfferent cell szes k 1 = k 2 = 2 and k 3 = 3: 1 2 3 4 5 6 7 2 3 4 5 6 7 8 3 4 5 6 7 8 1 v 4 5 6 7 8 1 2 v 6 7 8 1 2 3 4 v 7 8 1 2 3 4 5 v 8 1 2 3 4 5 6 The nformaton matrx C = - 0.3-0.3 The varances are 055, 0.5972, 0.7247 and 0.7660 gvng an average varance of 0.6030.A generalzed ncomplete Trojan-type desgn n 8 rows and 2 columns havng cell szes k 1 = 3 and k 2 = 2 can be obtaned for 8 treatments as: 1 2 3 4 5 2 3 4 5 6 3 4 5 6 7 v 4 5 6 7 8 v 5 6 7 8 1 v 6 7 8 1 2 v 7 8 1 2 3 v 8 1 2 3 4

Varghese, Jagg and Varghese 54 The nformaton matrx C = - 0.3 There are 4 types of varances, vz., 0.5355, 0.7506, 0.9072 and 0.9558 and the average varance had turned out to be 0.7632. It can be seen that for a fxed total row sze, f the cells are formed such that there are less number of cells wth bgger cell szes, the varance s less. The more the number of cells, the more s the varance for a gven row sze. REFERENCES [1]. L.A. Darby and N. Glbert, The Trojan Square. Euphytca, 7, 183-188(1958). [2]. R.A. Baley, Effcent sem-latn squares. Statstca Snca, 2, 413-43(1992). [3]. D.A. Preece and G.H. Freeman, Sem-Latn squares and related desgns. J. R. Statst. Soc., B45, 267-277(1983). [4]. R.A. Baley, Sem-Latn squares. J. Statst. Plan. Inf., 18, 299 312(1988). [5]. R.N. Edmondson, Trojan square and ncomplete Trojan square desgn for crop research. J. Agrc. Scences, 131, 135-142(1998). [6]. R.N. Edmondson, Generalsed ncomplete Trojan desgns. Bometrka, 89(4), 877-891(2002). [7]. D. Bedford and R.M. Whtaker, A new constructon for effcent sem Latn squares. J. Statst. Plan. Inf., 98, 287-292(2001). [8]. R.A. Baley and H. Monod, Effcent sem-latn rectangles: Desgns for plant dsease experments. Scand. J. Statst., 28, 257-270(2001). [9]. M. Dharmalngam, Constructon of partal trallel crosses based on Trojan square desgn. J. Appled Statst., 29(5), 675-702(2002). [10]. S. Jagg, C. Varghese, E. Varghese and V.K. Sharma, Generalzed ncomplete Trojan-type desgns. Statstcs and Probablty Letters, 80, 706-710 (2010).