SIMPLE RANDOM SAMPLING

Size: px
Start display at page:

Download "SIMPLE RANDOM SAMPLING"

Transcription

1 UIT IMPL RADOM AMPLIG mple Radom amplg tructure. Itroducto Obectves. Methods of electo of a ample Lottery Method Radom umber Method Computer Radom umber Geerato Method.3 Propertes of mple Radom amplg Merts ad Demerts of mple Radom amplg.4 mple Radom amplg of Attrbutes.5 ample ze for pecfc Precso.6 ummary.7 olutos/aswers. ITRODUCTIO mple radom samplg refers to the samplg techque whch each ad every tem of the populato s havg a equal chace of beg cluded the sample. The selecto s thus free from ay persoal bas because the vestgator does ot make ay preferece the choce of tems. ce selecto of tems the sample, depeds etrely o chace, ths method s also kow as the method of probablty samplg. Radom samplg s sometmes referred to a represetatve samplg. If the sample s chose at radom ad the sze of the sample s suffcetly large, t wll represet all groups the populato. A elemet of radomess s ecessary to be troduced the fal selecto of the tem. If that s ot troduced, bas s lkely to eter ad make the sample urepresetatve. Methods of selecto of a smple radom sample are eplaed ecto.. I ecto.3 the propertes of smple radom samplg are descrbed. mple radom samplg of attrbutes s troduced ecto.4 whereas ecto.5 the sample sze determato for specfc precso s descrbed brefly. Obectves After studyg ths ut, you would be able to descrbe the smple radom samplg; epla the method of RWR ad RWOR; epla ad derve the propertes of smple radom samplg; calculate the varace of the estmate of the sample mea; descrbe the R for attrbute ad ts propertes; ad descrbe ad draw a approprate sample sze for specfc precso. 5

2 tatstcal Techques. MTHOD OF LCTIO OF A AMPL The radom sample obtaed by a method of selecto whch every tem has a equal chace to be selected the sample. The radom sample depeds ot oly o method of selecto but also o the sample sze ad ature of populato. mple Radom amplg If a sample of uts s selected radomly from a populato of sze, ths method s kow as smple radom samplg. As the ame suggest, smple radom samplg s a method whch the requred umber of elemets /uts are selected smply by radom method from the target populato. Oe ca select a smple radom sample by ether of these two methods wth replacemet method ad wthout replacemet method. mple Radom amplg wth Replacemet (RWR) Whe smple radom samples are selected the way that uts whch has bee selected as sample ut s remed or replaced the populato before the selecto of the et ut the sample the the method s kow as smple radom samplg wth replacemet. mple Radom amplg wthout Replacemet (RWOR) Whe smple radom sample are selected the way that a ut s selected as sample ut s ot med or replaced the populato before the selecto of the et ut. Ths method s kow as smple radom samplg wthout replacemet.e. oce a ut s selected the sample wll ever be selected aga the sample. ome procedures are smple for small populato ad s ot so for the large populato. Proper care has to be take to esure that selected sample s radom. Radom sample ca be obtaed by ay of the followg methods: 6. By Lottery method;. By Mechacal Radomzato or Radom umbers method; ad 3. By Computer Radom umber Geerato method... Lottery Method Ths s very popular method of selectg a radom sample uder whch all tems of the populato are umbered or amed o separate slps of paper. These slps of paper should be of detcal sze, color ad shape. These slps are the folded ad med up a cotaer or bo or drum. A bld fold selecto s the made of the umber of slps requred to costtute the desred sze of sample. The selecto of tems thus depeds etrely o chace. For eample f we wat to select caddates out of. We assg the umbers to. Oe umber to each caddate ad wrte these umbers ( to ) o slps whch are made as homogeeous as possble. These slps are the put bag ad thoroughly shuffled ad the slps are draw oe by oe. The the caddates correspodg to umbers o the slp draw wll costtute a radom sample. If we draw a slp ad ote dow the umber wrtte o the slp ad the aga replace the slp the bag ad the draw the et. These umber of slps costtute a sample of requred sze s called a sample of RWR. If we do ot replace the frst slp whch has already bee draw the bag for the subsequet draws the t s called RWOR.

3 The above method s very popular lottery draws where a decso about przes s to be made. However, whle adoptg lottery method, t s absolutely essetal to see that the slps are as homogeeous as possble terms of sze, shape ad color, otherwse there s a lot of possblty of persoal preudce ad bas affects the result. mple Radom amplg.. Radom umber Method The lottery method, dscussed above, become qute cumbersome to use f the sze of the populato s very large. A alteratve method of radom selecto s that of usg the table of radom umbers. The most practcal ad epesve method of selectg a radom sample cossts the use of Radom umber tables whch have bee so costructed that each of the dgts 0,,,, 9 appears wth appromately the same frequecy ad depedetly. If we have to select a sample from a populato of sze ( 99) the the umbers ca be combed two by two to gve pars from 00 to 99. The method of drawg the radom sample cossts the followg steps:. Idetfy the uts the populato wth the umbers from to ;. elect at radom, ay page of the radom umber tables ad pck up the umbers ay row or colum or dagoal at radom ad dscart the umber whch s greater tha ; ad 3. The populato uts correspodg to the umbers selected step-, costtute the radom sample. The sample may be selected wth replacemet or wthout replacemet. I the case of samplg wth replacemet, a umber occurrg more tha oce s accepted. A ut s repeated as may tmes as a radom umber occurs. But the case of samplg wthout replacemet, f a umber radom umber table or remader occurs more tha oce s omtted at ay sequet stage. I the above selecto procedure umberg of uts from 00 owards ad makg use of remaders has a advatage, as o radom umbers s beg wasted durg the selecto procedure. Ths saves tme ad labor. For eample a populato cossts of 0 uts ad a sample of sze 5 s to be selected from ths populato. ce 0 s a two dgt fgure, ut are umbered as 00, 0 9. Fve radom umbers are obtaed from a two dgt radom umber table. They are gve as 85, 63, 5, 34, ad 46. O dvdg 85 by 0 the remader s 5, hece select the ut o seral o. 5. mlarly, dvdg 63, 5, 34 ad 46 by 0, the respectvely remader are 3,, 4 ad 6. Hece selected uts are at seral umbers 05, 03,, 4 ad 06. These selected uts costtute the sample. A umber of radom umber tables are avalable such as:. Tppet s Radom umber Tables These tables cosst of 0,400 four dgts umbers, gvg all 0,400 4.e. 4,600 dgts.. Fsher ad Yate s Radom umber Tables These tables cosst of 5000 dgts arraged two dgts umbers. 3. Kedall ad Babgto mth s Radom Tables These tables cosst of,00,000 dgts grouped to 5,000 sets of 4 dgts radom umbers. 7

4 tatstcal Techques 4. Rad Corporato Radom umber Tables These tables cosst of oe mllo radom dgts cosstg of,00,000 radom umbers of 5 dgts each...3 Computer Radom umber Geerato Method The ma dsadvatage of radom umber method s that f we wat to draw a sample of large sze from the target populato the t wll take a log tme to draw radom umbers from the radom umber table. Thus to save tme ad eergy geerato of large umbers of a radom umbers oe ca opt computer radom umbers geerato method. May kds of methods have bee used for geerato of radom umber from computer but we shall ot dscuss all of them here ad descrbe oly lear cogruetal geerato method. Lear Cogruetal Geerato Method Lear cogruetal method ca take may dfferet forms but the most commoly used form s defed by z = (az + c) mod m for =,, where, a, c ad z are to be the rage (0,,,, m-) ad tegers a - Multpler Iteger c - hft or Icremet Iteger m - Modulus Here, () mod m meas remader term whe s dvded by m. uppose we wat to draw a sample of sze 4 from the populato of sze 8. Take m = 8, a = 5, c =7 ad z 0 = 4 the resultg sequece of radom umbers s calculated as z = ( ) mod 8 = 3 z = ( ) mod 8 = 6 z 3 = ( ) mod 8 = 5 z 4 = ( ) mod 8 = 0 For above calculato we may also make a computer program whch s beyod ths course. We are, therefore, ot gog to dscuss t here..3 PROPRTI OF IMPL RADOM AMPLIG Termologes = Populato sze = ample sze 8 = Value of the character uder study for the th ut the populato

5 = Value of the character uder study for the th ut the sample mple Radom amplg Populato mea amplemea Populato mea square s σ ample mea square Populato varace Theorem : Prove that the probablty of selectg a specfed ut of the populato at ay gve draw s equal to the probablty of ts beg selected at the frst draw. Proof: I smple radom samplg method a equal probablty of selecto s assged to each ut of the populato at the frst draw. Thus, R from a populato of uts, the probablty of drawg ay ut at the frst draw s, the probablty of drawg ay ut the secod draw from amog the avalable s ad so o. Let, r be the evet that ay specfed ut s selected at the r th draw. P ( r ) = Prob.{A specfc ut s ot selected at ay oe of prevous P ( r ) = P ( r ) = That meas r r r P ( It s (r-) draws ad the selected at the r th draw} ot selected at th draw) P (It s selected at r th draw that s ot selected at the prevous (r-) draw) r r P ( r ) = P ( r ) = P ( r ) = = P( ) 3... r r r 9

6 tatstcal Techques Theorem : The probablty that a specfed ut s selected the sample of sze s Proof: ce a specfed ut ca be selected the sample of sze mutually eclusve ways, vz. t ca be selected the sample at the r th draw (r =,,, ) ad sce the probablty that t s selected at r th draw s P ( r ) = ; r,, 3,..., Therefore, the probablty that a specfed ut s cluded the sample would be the sum of the probabltes of cluso the sample at st draw, d draw,, th draw. Thus, by addto theorem of probablty, we get P ( r r ) = r Theorem 3: The possble umbers of sample of sze from a populato of sze f samplg s doe wth replacemet s. Proof: The frst ut ca be draw from uts ways. mlarly, secod ut ca also be draw ways because the frst selected ut aga med wth the populato. o o up to the selecto of th ut. Thus, the total umber of ways are C. C. C... C ( tmes) C Theorem 4: I RWOR the sample mea s a ubased estmator of populato mea. Proof: We have a where, a = f th ut s cluded the sample ce, a takes oly two values ad 0 0 f th ut s ot cluded the sample a =.P a 0.P(a 0) =.P ( th ut s cluded a sample of sze ) + 0.P ( th ut s ot cluded the sample) Hece, = ()

7 Theorem 5: I RWR, the sample mea s a ubased estmator of populato mea. mple Radom amplg Proof: We have ( ). = Theorem 6: I RWOR, the sample mea square s a ubased estmate of the populato mea square,.e. Proof: We have s s = ( ) s We have a a where, a = f th ut s cluded the sample () () 0 f th ut s ot cluded the sample (3) 3

8 3 tatstcal Techques Therefore, (4) ad a a a a (5) where, a ad a are defed equato (3) Therefore, a a.p a a 0.P a a 0 P a a a P a.p a ) ( ) ( (6) Because th a P ut s cluded the sample ad sample the cluded s ut that gve sample the cluded s ut P a a P th th ubsttutg equato (5), we get (7) ubsttutg from equatos (4) ad (7) equato (), we get ) ( s

9 33 mple Radom amplg (s ) = Theorem 7: I RWOR, the varace of the sample mea s gve by Var Proof: We have Var (8) ow (9) From equato (4), we have But Therefore, (0) Also from equato (7), we have ( ) ()

10 tatstcal Techques ubsttutg from equatos (0) ad () equato (9), we get... () ubsttutg from equato () equato (8), we get Var Var Theorem 8: I RWR, varace of sample mea s gve by Var Proof: We have Aga, Var Var Var Var ( ) ce case of RWR each observato s depedet, therefore Var σ. (3) But (4) ubsttutg from equato (4) equato (3) we get Var Theorem 9: The varace of the sample mea s more RWR comparso to ts varace RWOR,.e. RWR RWOR Var Var 34 Proof: We have VarRWR

11 Var ad RWOR Therefore, Var RWR Var RWOR ) Var 0 That mples VarRWR RWOR That meas varace of the sample mea s more RWR as compared wth ts varace the case of RWOR. I other words RWOR provdes a more effcet estmate of sample mea relatve to RWR..3. Merts ad Demerts of mple Radom amplg Merts mple radom samplg has the followg merts:. I smple radom samplg each ut of the populato has equal chace to be cluded the sample; ad. ffcecy of the estmates ca be foud out smple radom samplg because all the estmates are calculated by usg the probablty theory. mple Radom amplg Demerts Despte merts, smple radom samplg has some demerts too vz.. A up-to-date frame of populato s requred smple radom samplg;. ome admstratve coveece arses smple radom samplg f some of the uts are spreaded a wde area. o collectg formato from these related uts may be problem; ad 3. R requred larger sample sze tha ay other samplg for a f level of precso. ample : A populato have 7 uts,, 3, 4, 5, 6, 7. Wrte dow all possble samples of sze (wthout replacemet) whch ca be draw from the gve populato ad verfy that sample mea s a ubased estmate of the populato mea. Also calculate ts sample varace ad verfy that Var RWR Var RWOR oluto: We have =,, 3, 4, 5, 6,

12 tatstcal Techques All possble samples of sze are as follows: ample o. ample values ample Mea (,) (,3) (,4) (,5) (,6) (,7) (,3) (,4) (,5) (,6) (,7) (3,4) (3,5) (3,6) (3,7) (4,5) (4,6) (4,7) (5,6) (5,7) (6,7) Total From the table, we have k 84.0 ad C C 84 4 c Var C

13 Verfcato: I RWOR the varace of sample mea s gve by mple Radom amplg Var I RWR the varace of sample mea s gve by Var Var Var Hece, RWR RWOR ) Draw all possble samples of sze from the populato {, 3, 4} ad verfy that also fd varace. ) How may radom samples of sze 5 ca be draw from a populato of sze 0 f samplg s doe wth replacemet? 3) From a populato of 50 uts, a radom sample of sze 0 s draw wthout replacemet. From the sample followg result are obtaed. 48, 36 Calculate the sample mea ad ts varace. 4) Draw all possble samples of sze from the populato {8,, 6} ad verfy that ad fd varace of estmate of the populato mea. 5) From a populato of sze =00, a radom sample of sze 0 s draw wthout replacemet. From the sample followg results are obtaed. 45 Calculate the varace of sample mea..4 IMPL RADOM AMPLIG OF ATTRIBUT A qualtatve characterstc whch caot be measured umercally s kow as a attrbute.e. hoesty, tellgece, beauty, etc. I may stuatos, t s ot possble to measure the characterstc uder study but possble to classfy the populato to varous classes accordg to the attrbutes uder study. For eample, we ca dvde a populato of a coloy to two classes oly say lterate ad llterate wth respect to attrbute lteracy. Hece the uts the populato ca be dstrbuted these two classes accordgly as t possesses or does ot possess the gve attrbute. After takg a sample of sze, we may be terested estmatg the total umber of proporto of the defed attrbute. 37

14 tatstcal Techques otatos ad Termologes Let us suppose that a populato havg uts,,, s classfed to k mutually dsot ad ehaustve classes. The = The proporto of uts processg the gve attrbute populato A/ = The proporto of uts ot processg the gve attrbute populato A / = - Let us cosder RWOR sample of sze. From ths populato f a s the umber of uts a sample possessg the gve attrbute the p = proporto of sampled uts possessg the gve attrbute = a / q = proporto of sampled uts ot possessg the gve attrbute = a / Let be the th ut of the populato, where =,,,. The, = f th ut possesses the gve attrbute = 0 f t does ot possess the gve attrbute mlarly, deote th ut the sample The, =, f th sampled ut possesses the gve attrbute = 0, f th sampled ut does ot possess the gve attrbute The = A, the umber of uts the populato possessg the gve attrbute. ad = a, the umber of sampled uts possessg the gve attrbutes. Thus, A ad mlarly, A π a p ad a p 38 ( )

15 mlarly, mple Radom amplg s p p pq Theorem 0: ample proporto p s a ubased estmate of populato proporto π,.e. (p) = Proof: We have a p A π We kow that smple radom samplg the sample mea provdes o ubased estmate of the populato mea Therefore (p) = Theorem : I RWOR, show that Var (p) = Proof: We have, Var (p) = Var =. ( ).. ( ) =. ( )..5 AMPL IZ FOR PCIFIC PRCIIO A very frst problem faced by a statstca ay sample survey s to determe the sample sze so that the populato parameters may be estmated wth a specfed precso. The degree of precso ca be determed terms of. The level of sgfcace the estmate; ad. The cofdece terval wth whch ths estmate le wth respect to gve level of sgfcace. Let us cosder the parameter the populato mea of the populato of sze. We kow that sample mea based o uts s ubased estmate of. Let the dfferece betwee estmate value ad the populato mea s d ad level of cofdece s (-), the the sample sze s determed by the equato. 39

16 tatstcal Techques P d α or P d (5)... (6) where, s very small preassged probablty ad s ow as the level of sgfcace.. If s suffcetly large ad we cosder RWOR, the the statstc Var (7) where, Z s a stadard ormal varate. Accordgly, f we take = 0.05, the we have P Z P P Comparg wth equato (6), we get d.96 d.96 d d (8) Ths formula gves the sample sze RWOR for estmatg populato mea wth cofdece level 95 % ad marg of error d, provded s large. mlarly, f s small the statstcs z follows the studet s t dstrbuto wth (-) degree of freedom s gve by t 40

17 If t s the crtcal value of t for ( ) df ad at level of sgfcace the s gve by the equato mple Radom amplg P. t (9) Comparg wth equato (6) we get d. t d t.6 UMMARY t t d t t d I ths ut, we have dscussed:. The smple radom samplg;. The method of RWR ad RWOR; 3. The propertes of smple radom samplg; 4. Method of fdg the varace of the estmate of the sample mea; 5. The smple radom samplg for attrbute ad ts propertes; ad 6. The sample sze determato for specfc precso..7 OLUTIO / AWR ) I RWOR the umber of sample s 3 C C 3 The samples wth ther meas are as follows: r. o ample Mea,3.5, ,

18 tatstcal Techques Therefore, C C Aga V = Therefore, Var ) The frst ut ca be draw from 0 uts 0 C = 0 ways. ce samplg s doe wth replacemet so the secod ut ca be draw 0 C = 0 ways so o upto the selecto of 5 th Ut. Thus the total ways are = 0 5 ways. 4 3) We have o s s whch s the estmate value of.

19 Therefore, Varace mple Radom amplg 4) I RWOR the umber of samples s C = 3 C = 3 ad samples wth ther meas are Therefore, Aga Therefore,. o. ample Mea (8, ) 0 (8, 6) 3 (, 6) 4 Total C, C Aga estmator of populato mea s sample mea ad so ts varace Var where, Therefore, Var

20 tatstcal Techques 5) We have, ad Var s ( ) Whch s the estmate value of. Therefore, Var

Sixth Edition. Chapter 7 Point Estimation of Parameters and Sampling Distributions Mean Squared Error of an 7-2 Sampling Distributions and

Sixth Edition. Chapter 7 Point Estimation of Parameters and Sampling Distributions Mean Squared Error of an 7-2 Sampling Distributions and 3//06 Appled Statstcs ad Probablty for Egeers Sth Edto Douglas C. Motgomery George C. Ruger Chapter 7 Pot Estmato of Parameters ad Samplg Dstrbutos Copyrght 04 Joh Wley & Sos, Ic. All rghts reserved. 7

More information

Descriptive Statistics

Descriptive Statistics Math 3 Lecture I Descrptve tatstcs Descrptve statstcs are graphcal or umercal methods utlsed to summarze data such a way that mportat features of the sample ca be depcted. tatstcs: tatstcs s cocered wth

More information

Short Note: Merging Secondary Variables for Geophysical Data Integration

Short Note: Merging Secondary Variables for Geophysical Data Integration Short Note: Mergg Secodary Varables for Geophyscal Data Itegrato Steve Lyster ad Clayto V. Deutsch Departmet of Cvl & Evrometal Egeerg Uversty of Alberta Abstract Multple secodary data from geophyscal

More information

K-Map 1. In contrast, Karnaugh map (K-map) method provides a straightforward procedure for simplifying Boolean functions.

K-Map 1. In contrast, Karnaugh map (K-map) method provides a straightforward procedure for simplifying Boolean functions. K-Map Lesso Objectves: Eve though Boolea expressos ca be smplfed by algebrac mapulato, such a approach lacks clear regular rules for each succeedg step ad t s dffcult to determe whether the smplest expresso

More information

On the Techniques for Constructing Even-order Magic Squares using Basic Latin Squares

On the Techniques for Constructing Even-order Magic Squares using Basic Latin Squares Iteratoal Joural of Scetfc ad Research Publcatos, Volume, Issue 9, September 0 ISSN 50-353 O the Techques for Costructg Eve-order Magc Squares usg Basc Lat Squares Tomba I. Departmet of Mathematcs, Mapur

More information

Lecture6: Lossless Compression Techniques. Conditional Human Codes

Lecture6: Lossless Compression Techniques. Conditional Human Codes ecture6: ossless Compresso Techques Codtoal uma Codes -Cosder statoary dscrete arov process, = { s, s, s } wth codtoal pmfs P P s s wth,, tates o Ps/so.9.5.5 Ps/s.5.8.5 Ps/s.5.5.6 -The margal probabltes

More information

A CONTROL CHART FOR HEAVY TAILED DISTRIBUTIONS. K. Thaga. Department of Statistics University of Botswana, Botswana

A CONTROL CHART FOR HEAVY TAILED DISTRIBUTIONS. K. Thaga. Department of Statistics University of Botswana, Botswana A CONTROL CHART FOR HEAVY TAILED DISTRIBUTIONS K. Thaga Departmet of Statstcs Uversty of Botswaa, Botswaa thagak@mopp.ub.bw ABSTRACT Stadard cotrol charts wth cotrol lmts determed by the mea ad stadard

More information

Assignment#4 Due: 5pm on the date stated in the course outline. Hand in to the assignment box on the 3 rd floor of CAB.

Assignment#4 Due: 5pm on the date stated in the course outline. Hand in to the assignment box on the 3 rd floor of CAB. MATH Assgmet#4 Due: 5pm o the date stated the course outle. Had to the assgmet box o the 3 rd floor of CAB.. Let deote the umber of teror regos of a covex polygo wth sdes, dvded by all ts dagoals, f o

More information

The Institute of Chartered Accountants of Sri Lanka

The Institute of Chartered Accountants of Sri Lanka The Isttute of Chartered Accoutats of Sr Laka Executve Dploma Accoutg, Busess ad Strategy Quattatve Methods for Busess Studes Hadout 0: Presetato ad Aalyss of data Presetato of Data Arragg Data The arragemet

More information

LECTURE 4 QUANTITATIVE MODELS FOR FACILITY LOCATION: SERVICE FACILITY ON A LINE OR ON A PLANE

LECTURE 4 QUANTITATIVE MODELS FOR FACILITY LOCATION: SERVICE FACILITY ON A LINE OR ON A PLANE LECTUE 4 QUANTITATIVE MODELS FO FACILITY LOCATION: SEVICE FACILITY ON A LINE O ON A PLANE Learg objectve 1. To demostrate the quattatve approach to locate faclt o a le ad o a plae 6.10 Locatg Faclt o a

More information

Geometric Distribution as a Randomization Device: Implemented to the Kuk s Model

Geometric Distribution as a Randomization Device: Implemented to the Kuk s Model It. J. Cotem. Math. Sceces, Vol. 8, 03, o. 5, 43-48 HIKARI Ltd, www.m-hkar.com Geometrc Dstrbuto as a Radomzato Devce: Imlemeted to the Kuk s Model Sarjder Sgh Deartmet of Mathematcs Texas A&M Uversty-Kgsvlle

More information

5. Random Processes. 5-3 Deterministic and Nondeterministic Random Processes

5. Random Processes. 5-3 Deterministic and Nondeterministic Random Processes 5. Radom Processes 5- Itroducto 5- Cotuous ad Dscrete Radom Processes 5-3 Determstc ad Nodetermstc Radom Processes 5-4 Statoary ad Nostatoary Radom Processes 5-5 rgodc ad Noergodc Radom Processes 5-6 Measuremet

More information

Module 6. Channel Coding. Version 2 ECE IIT, Kharagpur

Module 6. Channel Coding. Version 2 ECE IIT, Kharagpur Module 6 Chael Codg Lesso 36 Coded Modulato Schemes After readg ths lesso, you wll lear about Trells Code Modulato; Set parttog TCM; Decodg TCM; The modulated waveform a covetoal ucoded carrer modulato

More information

A New Mathematical Model for a Redundancy Allocation Problem with Mixing Components Redundant and Choice of Redundancy Strategies

A New Mathematical Model for a Redundancy Allocation Problem with Mixing Components Redundant and Choice of Redundancy Strategies Appled Mathematcal Sceces, Vol, 2007, o 45, 222-2230 A New Mathematcal Model for a Redudacy Allocato Problem wth Mxg Compoets Redudat ad Choce of Redudacy Strateges R Tavakkol-Moghaddam Departmet of Idustral

More information

Applied Statistics and Probability for Engineers, 6 th edition December 31, 2013 CHAPTER 6. Section 6-1

Applied Statistics and Probability for Engineers, 6 th edition December 31, 2013 CHAPTER 6. Section 6-1 Appled Statstcs ad Probablty for Egeers, 6 th edto December 31, 013 CHAPTER 6 Secto 6-1 6-1. No, usually ot. For eample, f the sample s {, 3} the mea s.5 whch s ot a observato the sample. 6-3. No, usually

More information

Performance Comparison of Two Inner Coding Structures in Concatenated Codes for Frequency-Hopping Spread Spectrum Multiple-Access Communications

Performance Comparison of Two Inner Coding Structures in Concatenated Codes for Frequency-Hopping Spread Spectrum Multiple-Access Communications Iteratoal Joural o Recet ad Iovato Treds Computg ad Commucato IN: 31-8169 Volume: 3 Issue: 741-745 erformace Comparso of Two Ier Codg tructures Cocateated Codes for Frequecy-Hoppg pread pectrum Multple-Access

More information

Block-based Feature-level Multi-focus Image Fusion

Block-based Feature-level Multi-focus Image Fusion Block-based Feature-level Mult-focus Image Fuso Abdul Bast Sddqu, M. Arfa Jaffar Natoal Uversty of Computer ad Emergg Sceces Islamabad, Paksta {bast.sddqu,arfa.affar}@u.edu.pk Ayyaz Hussa, Awar M. Mrza

More information

An ANOVA-Based GPS Multipath Detection Algorithm Using Multi-Channel Software Receivers

An ANOVA-Based GPS Multipath Detection Algorithm Using Multi-Channel Software Receivers A ANOVA-Based GPS Multpath Detecto Algorthm Usg Mult-Chael Software Recevers M.T. Breema, Y.T. Morto, ad Q. Zhou Dept. of Electrcal ad Computer Egeerg Mam Uversty Oxford, OH 4556 Abstract: We preset a

More information

New Difference Estimator in Two-phase Sampling using Arbitrary Probabilities

New Difference Estimator in Two-phase Sampling using Arbitrary Probabilities IN 1684-8403 Joural o tatstcs olume 15, 008,. 7-16 Abstract New Derece Estmator Two-hase amlg usg Arbtrar Probabltes Asa Kamal 1 ad Muhammad Qaser hahbaz A ew derece estmator has bee costructed two-hase

More information

The optimization of emergency resource-mobilization based on harmony search algorithm

The optimization of emergency resource-mobilization based on harmony search algorithm Avalable ole www.ocpr.com Joural of Chemcal ad Pharmaceutcal Research, 04, 6(7):483-487 Research Artcle ISS : 0975-7384 CODE(USA) : JCPRC5 The optmzato of emergecy resource-moblzato based o harmoy search

More information

DISTRIBUTION VOLTAGE MONITORING AND CONTROL UTILIZING SMART METERS

DISTRIBUTION VOLTAGE MONITORING AND CONTROL UTILIZING SMART METERS 4 th Iteratoal Coferece o Electrcty Dstrbuto Glasgow, -5 Jue 07 DISTRIBUTION VOLTAGE MONITORING AND CONTROL UTILIZING SMART METERS Yoshhto. KINOSHITA Kazuor. IWABUCHI Yasuyuk. MIYAZAKI Toshba Japa Toshba

More information

OPTIMAL DG PLACEMENT FOR MAXIMUM LOSS REDUCTION IN RADIAL DISTRIBUTION SYSTEM USING ABC ALGORITHM

OPTIMAL DG PLACEMENT FOR MAXIMUM LOSS REDUCTION IN RADIAL DISTRIBUTION SYSTEM USING ABC ALGORITHM teratoal Joural of Revews Computg 009-00 JRC & LLS. All rghts reserved. JRC SSN: 076-338 www.jrc.org E-SSN: 076-3336 OPTMAL PLACEMENT FOR MAXMUM LOSS REDUCTON N RADAL DSTRBUTON SYSTEM USNG ABC ALGORTHM

More information

A New Aggregation Policy for RSS Services

A New Aggregation Policy for RSS Services A New Aggregato Polcy for RSS Servces Youg Geu Ha Sag Ho Lee Jae Hw Km Yaggo Km 2 School of Computg, Soogsl Uversty Seoul, Korea {youggeu,shlee99,oassdle}@gmal.com 2 Dept. of Computer ad Iformato Sceces,

More information

A Spectrally Efficient Frequency Division Multiplexing Based Communications System M. R. D. Rodrigues and I. Darwazeh

A Spectrally Efficient Frequency Division Multiplexing Based Communications System M. R. D. Rodrigues and I. Darwazeh IOWo'03, 8th Iteratoal OFDM-Workshop, Proceedgs, Hamburg, DE, Sep 24-25, 2003 (Prepublcato draft) A Spectrally Effcet Frequecy Dvso Multplexg Based Commucatos System M. R. D. Rodrgues ad I. Darwazeh Laboratory

More information

Short Term Load Forecasting using Multiple Linear Regression

Short Term Load Forecasting using Multiple Linear Regression Short Term Load Forecastg usg Multple Lear Regresso N. Amral, C.S. Özvere, D Kg Uversty of Abertay Dudee, UK Abstract I ths paper we preset a vestgato for the short term (up 4 hours load forecastg of the

More information

Switching Angle Design for Pulse Width Modulation AC Voltage Controller Using Genetic Algorithm and Distributed Artificial Neural Network

Switching Angle Design for Pulse Width Modulation AC Voltage Controller Using Genetic Algorithm and Distributed Artificial Neural Network Swtchg Agle Desg for Pulse Wdth Modulato AC Voltage Cotroller Usg Geetc Algorthm ad Dstrbuted Artfcal Neural Network Pattarapor Jtta, Somyot Katwadvla ad Atthapol Ngaoptakkul Abstract. Ths paper proposes

More information

Simulation of rainfall-runoff process by artificial neural networks and HEC-HMS model (case study Zard river basin)

Simulation of rainfall-runoff process by artificial neural networks and HEC-HMS model (case study Zard river basin) Proceedgs of The Fourth Iteratoal Ira & Russa Coferece 43 Smulato of rafall-ruoff process by artfcal eural etworks ad HEC-HMS model (case study Zard rver bas Mehrdad Akbarpour MSc. Graguate, Water Structures

More information

DYNAMIC BROADCAST SCHEDULING IN ASYMMETRIC COMMUNICATION SYSTEMS: PUSH AND PULL DATA BASED ON SCHEDULING INDEX AND OPTIMAL CUT-OFF POINT YUFEI GUO

DYNAMIC BROADCAST SCHEDULING IN ASYMMETRIC COMMUNICATION SYSTEMS: PUSH AND PULL DATA BASED ON SCHEDULING INDEX AND OPTIMAL CUT-OFF POINT YUFEI GUO DYNAMIC BROADCAST SCHEDULING IN ASYMMETRIC COMMUNICATION SYSTEMS: PUSH AND PULL DATA BASED ON SCHEDULING INDEX AND OPTIMAL CUT-OFF POINT by YUFEI GUO Preseted to the Faculty of the Graduate School of The

More information

Handbook on precision requirements and variance estimation for ESS households surveys

Handbook on precision requirements and variance estimation for ESS households surveys ISSN 977-0375 Methodologes ad Workg papers Hadbook o precso requremets ad varace estmato for ESS households surveys 03 edto Methodologes ad Workg papers Hadbook o precso requremets ad varace estmato for

More information

OPTIMAL BUS DISPATCHING POLICY UNDER VARIABLE DEMAND OVER TIME AND ROUTE LENGTH

OPTIMAL BUS DISPATCHING POLICY UNDER VARIABLE DEMAND OVER TIME AND ROUTE LENGTH OPTIMAL BUS DISPATCHING POLICY UNDER VARIABLE DEMAND OVER TIME AND ROUTE LENGTH Amal S. Kumarage, Professor of Cvl Egeerg, Uversty of Moratuwa, Sr Laka H.A.C. Perera, Cetral Egeerg Cosultacy Bureau, Sr

More information

Evolutionary Algorithm With Experimental Design Technique

Evolutionary Algorithm With Experimental Design Technique Evolutoary Algorthm Wth Expermetal Desg Techque Qgfu Zhag Departmet of Computer Scece Uversty of Essex Wvehoe Park Colchester, CO4 3SQ Uted Kgdom Abstract: - Major steps evolutoary algorthms volve samplg

More information

THE FOURIER SERIES USED IN ANALYSE OF THE CAM MECHANISMS FOR THE SHOEMAKING MACHINES (PART I)

THE FOURIER SERIES USED IN ANALYSE OF THE CAM MECHANISMS FOR THE SHOEMAKING MACHINES (PART I) ANNALS OF HE UNIVERSIY OF ORADEA FASCICLE OF EXILES, LEAHERWORK HE FOURIER SERIES USED IN ANALYSE OF HE CAM MECHANISMS FOR HE SHOEMAKING MACHINES (PAR I) IOVAN-DRAGOMIR Ala, DRIȘCU Maraa, Gheorghe Asach

More information

CHAPTER-4 WIDE BAND PASS FILTER DESIGN 4.1 INTRODUCTION

CHAPTER-4 WIDE BAND PASS FILTER DESIGN 4.1 INTRODUCTION CHAPTER-4 WIDE BAND PASS FILTER DESIGN 4. INTRODUCTION The bad pass flters suested last chapter are hav the FBW less tha the 2%. I cotrast of that ths chapter deals wth the des of wde bad pass flter whch

More information

Comparison of Estimators of Extreme Value Distributions for Wind Data Analysis

Comparison of Estimators of Extreme Value Distributions for Wind Data Analysis Bofrg Iteratoal Joural of Data g, Vol., o. 3, September 0 6 Comparso of Estmators of Extreme Value Dstrbutos for d Data Aalyss. Vvekaada Abstract--- Estmato of extreme wd speed potetal at a rego s of mportace

More information

Long Number Bit-Serial Squarers

Long Number Bit-Serial Squarers Log Number Bt-Seral Squarers E. Chaotaks, P. Kalvas ad K. Z. Pekmestz are th the Natoal Techcal Uversty of Athes, 7 73 Zographou, Athes, Greece. E-mal: lchaot, paraskevas, pekmes@mcrolab.tua.gr Abstract

More information

Research Journal of Mathematical and Statistical Sciences ISSN

Research Journal of Mathematical and Statistical Sciences ISSN esearch Joural o athematcal ad tatstcal ceces I 0 60 stmato o ato o two Populato meas a lass o ato-cum egresso tpe estmators usg ular character wth double amplg the presece o o-respose bstract KPatel ad

More information

A HIGH ACCURACY HIGH THROUGHPUT JITTER TEST SOLUTION ON ATE FOR 3GBPS AND 6GBPS SERIAL-ATA

A HIGH ACCURACY HIGH THROUGHPUT JITTER TEST SOLUTION ON ATE FOR 3GBPS AND 6GBPS SERIAL-ATA A HIGH ACCURACY HIGH THROUGHPUT JITTER TEST SOLUTION ON ATE FOR 3GBPS AND 6GBPS SERIAL-ATA Yogqua Fa, Y Ca ad Zeljko Zlc LSI Corporato 0 Amerca Parkway NE, Alletow, Pesylvaa 809 Emal: y.ca@ls.com Departmet

More information

Information Theory and Coding

Information Theory and Coding Iformato heory ad Codg Itroducto What s t all aout? Refereces: C..hao, A Mathematcal heory of Commucato, he Bell ystem echcal Joural, Vol. 7, pp. 379 43, 63 656, July, Octoer, 948. C..hao Commucato the

More information

K-sorted Permutations with Weakly Restricted Displacements

K-sorted Permutations with Weakly Restricted Displacements K-sorted Permutatos wth Weakly Restrcted Dsplacemets Tg Kuo Departmet of Marketg Maagemet, Takmg Uversty of Scece ad Techology Tape 5, Tawa, ROC tkuo@takmg.edu.tw Receved February 0; Revsed 5 Aprl 0 ;

More information

FUZZY IMAGE SEGMENTATION USING LOCATION AND INTENSITY INFORMATION

FUZZY IMAGE SEGMENTATION USING LOCATION AND INTENSITY INFORMATION FUZZY AGE SEGENTATON USNG OCATON AND NTENSTY NFOATON Ameer Al, aurece S Dooley ad Gour C Karmakar Gppslad School of Computg & formato Techology, oash Uversty, Australa Emal: {AmeerAl, aurecedooley ad GourKarmakar}@fotechmoasheduau

More information

Frequency Assignment for IEEE Wireless Networks

Frequency Assignment for IEEE Wireless Networks Frequecy Assgmet for IEEE 8 Wreless Networks K K Leug Bell Labs, Lucet Techologes Murray Hll, NJ 7974 k@bell-labscom Byoug-Jo J Km AT&T Labs Research Mddletow, NJ 7748 macsbug@researchattcom Abstract The

More information

Measures of variation or measures of spread: is a descriptive measure that describes how much variation or spread there is in a data set.

Measures of variation or measures of spread: is a descriptive measure that describes how much variation or spread there is in a data set. Secto.6 Meaure o Dpero Meaure o varato or meaure o pread: a decrptve meaure that decrbe how much varato or pread there a data et. Wh th mportat? Whch Catheter IV mauacturer would ou preer to ue or purchag

More information

Distributed Online Matching Algorithm For Multi-Path Planning of Mobile Robots

Distributed Online Matching Algorithm For Multi-Path Planning of Mobile Robots Proect Paper for 6.854 embers: Seugkook Yu (yusk@mt.edu) Sooho Park (dreameo@mt.edu) Dstrbuted Ole atchg Algorthm For ult-path Plag of oble Robots 1. Itroducto Curretly, we are workg o moble robots whch

More information

Logarithms APPENDIX IV. 265 Appendix

Logarithms APPENDIX IV. 265 Appendix APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult

More information

Advances in SAR Change Detection

Advances in SAR Change Detection Lesle M. ovak Scetfc Sstems Compa, Ic. 500 West Cummgs Park, Sute 3000 Wobur, MA 080 UITED STATES E-mal: lovak@ssc.com, ovakl@charter.et ABSTRACT SAR chage detecto performace usg coheret chage detecto

More information

An ID-based Proxy Authentication Protocol Supporting Public Key Infrastructure

An ID-based Proxy Authentication Protocol Supporting Public Key Infrastructure A ID-based Proxy Authetcato Protocol Supportg Publc Key Ifrastructure Shuh-Pyg Sheh, Shh-I Huag ad Fu-She Ho Departmet of Computer Scece ad Iformato Egeerg, ABSTRACT The advatage of the ID-based authetcato

More information

Multiset Permutations in Lexicographic Order

Multiset Permutations in Lexicographic Order Webste: www.jetae.com ISSN 2250-2459, ISO 9001:2008 Certfed Joural, Volume 4, Issue 1, Jauary 2014 Multset Permutatos Lexcographc Order Tg Kuo Departmet of Marketg Maagemet, Takmg Uversty of Scece ad Techology,

More information

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule Chapter 3 Combiatorics 3.1 Permutatios Readig questios 1. Defie what a permutatio is i your ow words. 2. What is a fixed poit i a permutatio? 3. What do we assume about mutual disjoitedess whe creatig

More information

Reliability Allocation

Reliability Allocation Relablty Allocato Yashwat K. Malaya omputer Scece Dept. olorado State Uversty Fort olls O 80523 USA malaya@cs.colostate.edu Phoe: 970-49-703, 970-49-2466 Abstract---A system s geerally desged as a assembly

More information

Optimal Power Allocation in Zero-forcing MIMO-OFDM Downlink with Multiuser Diversity

Optimal Power Allocation in Zero-forcing MIMO-OFDM Downlink with Multiuser Diversity Optmal Power Allocato Zero-forcg IO-OFD Dowl wth ultuser Dversty Peter W. C. Cha ad oger S.. Cheg Abstract hs paper cosders the optmal power allocato for a multuser IO-OFD dowl system usg zero-forcg multplexg

More information

Characterization and Construction of Permutation Graphs

Characterization and Construction of Permutation Graphs Ope Joural of Dscrete Mathematcs, 03, 3, 33-38 http://dxdoorg/036/odm033007 Publshed Ole Jauary 03 (http://wwwscrporg/oural/odm) Characterzato ad Costructo of Permutato Graphs Seero V Geraco, Teofa A Rapaut,

More information

A Participation Incentive Market Mechanism for Allocating Heterogeneous Network Services

A Participation Incentive Market Mechanism for Allocating Heterogeneous Network Services A Partcpato Icetve Maret Mechasm for Allocatg Heterogeeous Networ Servces Juog-S Lee ad Boleslaw K. Szymas * Noa Research Ceter, Palo Alto, CA 94304 USA * Resselaer Polytechc Isttute, Troy, NY 280, USA

More information

Static games: Coordination and Nash equilibrium

Static games: Coordination and Nash equilibrium Statc game: Coordato ad Nah equlbrum Lecture Game Theory Fall 204, Lecture 2 3.0.204 Dael Spro, ECON3200/4200, Lecture 2 Ratoalzablty about Narrowg dow the belef I have ad the other player may have by

More information

Time-Frequency Entropy Analysis of Arc Signal in Non-Stationary Submerged Arc Welding

Time-Frequency Entropy Analysis of Arc Signal in Non-Stationary Submerged Arc Welding Egeerg, 211, 3, 15-19 do:1.4236/eg.211.3213 Publshed Ole February 211 (http://www.scrp.org/joural/eg) Tme-Frequecy Etropy Aalyss of Arc Sgal o-statoary Submerged Arc Weldg Abstract Kuafag He 1, Swe Xao

More information

Math 140 Introductory Statistics

Math 140 Introductory Statistics 6. Probability Distributio from Data Math Itroductory Statistics Professor Silvia Ferádez Chapter 6 Based o the book Statistics i Actio by A. Watkis, R. Scheaffer, ad G. Cobb. We have three ways of specifyig

More information

Optimal Reliability Allocation

Optimal Reliability Allocation Optmal Relablty Allocato Wley Ecyclopeda of Operatos Research ad Maagemet Scece Yashwat K. Malaya Computer Scece Dept. Colorado State Uversty, Fort Colls CO 80523 malaya@cs.colostate.edu Phoe: 970-49-703,

More information

BER ANALYSIS OF V-BLAST MIMO SYSTEMS UNDER VARIOUS CHANNEL MODULATION TECHNIQUES IN MOBILE RADIO CHANNELS

BER ANALYSIS OF V-BLAST MIMO SYSTEMS UNDER VARIOUS CHANNEL MODULATION TECHNIQUES IN MOBILE RADIO CHANNELS 202 Iteratoal Coferece o Computer Techology ad Scece (ICCTS 202) IPCSIT vol. 47 (202) (202) IACSIT Press, Sgapore DOI: 0.7763/IPCSIT.202.V47.24 BER ANALYSIS OF V-BLAST MIMO SYSTEMS UNDER VARIOUS CANNEL

More information

On the Development of an Intelligent Computer Player for CLUE : a Case Study on Preposterior Decision Analysis

On the Development of an Intelligent Computer Player for CLUE : a Case Study on Preposterior Decision Analysis Proceedgs of the 2006 Amerca Cotrol Coferece Meapols, Mesota, USA, Jue 14-16, 2006 FrA05.2 O the Developmet of a Itellget Computer Player for CLUE: a Case Study o Preposteror Decso Aalyss Cheghu Ca ad

More information

Exam. Real-time systems, basic course, CDT315. Grading: Swedish grades: ECTS grades:

Exam. Real-time systems, basic course, CDT315. Grading: Swedish grades: ECTS grades: 6 Exam eal-tme systems, basc course, 35 eacher: amr Isovc Phoe: 0 3 73 Exam durato: 08:30 3:30 Help alloed: Pots: calculator ad a laguage dctoary 48 p Gradg: Sedsh grades: ES grades: Importat formato:

More information

Chapter 3. Geographical Data Broadcast Cost Models

Chapter 3. Geographical Data Broadcast Cost Models Chapter Geographcal ata Broadcast Cost Models s dscussed Secto. T s further dvded to to compoets amel Probe Wat ad Bcast Wat. We argue that t mght be more approprate to dvde T to four compoets: Ide-Probe

More information

Infinite Series Forms of Double Integrals

Infinite Series Forms of Double Integrals Iteratoal Joural of Data Evelopmet Aalyss ad *Operatos Research*, 4, Vol., No., 6- Avalable ole at http://pubs.scepub.com/jdeaor/// Scece ad Educato Publshg DOI:.69/jdeaor--- Ifte Seres Forms of Double

More information

Deinterleaving of Interfering Radars Signals in Identification Friend or Foe Systems

Deinterleaving of Interfering Radars Signals in Identification Friend or Foe Systems 8 Telecommucatos forum TEFOR Serba, Belgrade, ovember -5, Deterleavg of Iterferg Radars Sgals Idetfcato Fred or Foe Systems Youes Ahmad amal Mohamedpour Moe Ahmad Abstract I a dese moder electroc warfare

More information

A New Method for Detection and Evaluation of Winding Mechanical Faults in Transformer through Transfer Function Measurements

A New Method for Detection and Evaluation of Winding Mechanical Faults in Transformer through Transfer Function Measurements [Dowloaded from www.aece.ro o Wedesday, Jue 0, 20 at 6:04:09 (UTC) by 27.28.226.42. Redstrbuto subject to AECE lcese or copyrght. Ole dstrbuto s expressly prohbted.] Advaces Electrcal ad Computer Egeerg

More information

FUZZY MEASURES FOR STUDENTS MATHEMATICAL MODELLING SKILLS

FUZZY MEASURES FOR STUDENTS MATHEMATICAL MODELLING SKILLS Iteratoal Joural of uzzy Logc Systems (IJLS) Vol., No., Aprl 0 UZZY MEASURES OR STUDENTS MATHEMATICAL MODELLING SKILLS Mchael Gr. Voskoglou School of Techologcal Applcatos Graduate Techologcal Educatoal

More information

SVD-based Collaborative Filtering with Privacy

SVD-based Collaborative Filtering with Privacy SVD-based Collaboratve Flterg wth Prvacy Husey Polat Departmet of Electrcal Egeerg ad Computer Scece Syracuse Uversty, 121 L Hall Syracuse, NY 13244-1240, USA Phoe: +1 315 443 4124 hpolat@ecs.syr.edu Welag

More information

Chapter 1 Introduction to Stochastic Processes

Chapter 1 Introduction to Stochastic Processes haper Iroduco o Sochasc rocesses Sochasc rocesses A radom varale s a mappg fuco whch assgs oucomes of a radom eperme o real umers see Fg.. Occurrece of he oucome follows cera proaly dsruo. Therefore a

More information

CONSTRUCTION OF AN OPTIMAL MATHEMATICAL MODEL OF FUNCTIONING OF THE MANUFACTURING INDUSTRY OF THE REPUBLIC OF KAZAKHSTAN

CONSTRUCTION OF AN OPTIMAL MATHEMATICAL MODEL OF FUNCTIONING OF THE MANUFACTURING INDUSTRY OF THE REPUBLIC OF KAZAKHSTAN CONSTRUCTION OF AN OPTIMAL MATHEMATICAL MODEL OF FUNCTIONING OF THE MANUFACTURING INDUSTRY OF THE REPUBLIC OF KAZAKHSTAN SEILKHAN N. BORANBAYEV, ASKAR B. NURBEKOV L.N. Gumlyov Eurasa Natoal Uversty, Satpayev

More information

A New and Efficient Proposed Approach to Find Initial Basic Feasible Solution of a Transportation Problem

A New and Efficient Proposed Approach to Find Initial Basic Feasible Solution of a Transportation Problem Amerca Joural of Appled Mathematcs ad Statstcs, 27, Vol., No. 2, 4-6 Avalable ole at http://pubs.scepub.com/ajams//2/3 Scece ad Educato Publshg DOI:.269/ajams--2-3 A New ad Effcet Proposed Approach to

More information

Speculative Completion for the Design of High-Performance Asynchronous Dynamic Adders

Speculative Completion for the Design of High-Performance Asynchronous Dynamic Adders I: 1997 IEEE Iteratoal Symposum o Advaced Research Asychroous Crcuts ad Systems ( Asyc97 Symposum), Edhove, The Netherlads Speculatve Completo for the Desg of Hgh-Performace Asychroous Dyamc Adders Steve

More information

A Two Stage Methodology for Siting and Sizing of DG for Minimum Loss in Radial Distribution System using RCGA

A Two Stage Methodology for Siting and Sizing of DG for Minimum Loss in Radial Distribution System using RCGA teratoal Joural of Computer Applcatos (0975 8887) Volume 5 No., July 0 A Two Stage Methodology for Stg ad Szg of for Mmum Loss adal Dstrbuto System usg CGA Dr.M.adma ltha EEE Member rofessor & HOD Dept.

More information

Generation Reliability Evaluation in Deregulated Power Systems Using Game Theory and Neural Networks

Generation Reliability Evaluation in Deregulated Power Systems Using Game Theory and Neural Networks Smart Grd ad Reewable Eergy, 212, 3, 89-95 http://dx.do.org/1.4236/sgre.212.3213 Publshed Ole May 212 (http://www.scrp.org/joural/sgre) 1 Geerato Relablty Evaluato Deregulated Power Systems Usg Game Theory

More information

On the Robustness of Next Generation GNSS Phase-only Real-Time Kinematic Positioning

On the Robustness of Next Generation GNSS Phase-only Real-Time Kinematic Positioning O the Robustess of Next Geerato GNSS Phase-oly Real-Tme Kematc Postog Leard HUISMAN 1, Peter J.G. TEUNISSEN 1,2, Des ODIJK 1 1 Curt Uversty of Techology GNSS Research Lab Ket Street, Betley WA 6845, Perth,

More information

Comparison of Measurement and Prediction of ITU-R Recommendation P.1546

Comparison of Measurement and Prediction of ITU-R Recommendation P.1546 Comparso of Measuremet ad Predcto of ITU-R Recommedato P.546 Chag-Hoo Lee *, Nam-Ryul Jeo *, Seog-Cheol Km *, Jug-m Lm * Isttute of New Meda ad Commucatos, Seoul Natoal Uversty, Cosoldated Mateace Depot,

More information

Design of an Elevator Group Supervisory Controller using Ordinal Structure Fuzzy Logic with Context Adaptation

Design of an Elevator Group Supervisory Controller using Ordinal Structure Fuzzy Logic with Context Adaptation Desg of a Group Supervsory Cotroller usg Ordal Structure Fuzzy Logc wth Cotext Adaptato Kumeresa A. Daapalasgam ad Marzuk Khald Cetre for Artfcal Itellgece ad Robotcs Faculty of Electrcal Egeerg Uverst

More information

20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE

20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE 20. CONFIDENCE INTERVALS FOR THE MEAN, UNKNOWN VARIANCE If the populatio tadard deviatio σ i ukow, a it uually will be i practice, we will have to etimate it by the ample tadard deviatio. Sice σ i ukow,

More information

The Use of Genetic Algorithms in Validating the System Model and Determining Worst-case Transients in Capacitor Switching Simulation Studies

The Use of Genetic Algorithms in Validating the System Model and Determining Worst-case Transients in Capacitor Switching Simulation Studies The Use of Geetc Algorthms Valdatg the System Model ad Determg Worst-case Trasets Capactor Swtchg Smulato Studes Mlade Kezuovc, Fellow, IEEE Yua Lao, Studet Member, IEEE Texas A&M Uversty Departmet of

More information

Enhancing Topology Control Algorithms in Wireless Sensor Network using Non-Isotropic Radio Models

Enhancing Topology Control Algorithms in Wireless Sensor Network using Non-Isotropic Radio Models IJCSNS Iteratoal Joural of Computer Scece ad Network Securty, VOL.6 No.8B, August 6 5 Ehacg Topology Cotrol Algorthms Wreless Sesor Network usg No-Isotropc Rado Models Ma.Vctora Que ad Wo-Joo Hwag Departmet

More information

Robust Location Tag Generation from Noisy Location Data for Security Applications

Robust Location Tag Generation from Noisy Location Data for Security Applications Robust Locato Tag Geerato from Nosy Locato Data for Securty Applcatos D Qu, Da Boeh, Sherma Lo, Per Ege, Staford Uversty BIOGRAPHY D Qu s a Ph.D. caddate Aeroautcs ad Astroautcs workg the Global Postog

More information

Unit 5: Estimating with Confidence

Unit 5: Estimating with Confidence Uit 5: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Uit 5 Estimatig with Cofidece 8.1 8.2 8.3 Cofidece Itervals: The Basics Estimatig a Populatio

More information

Implementing wavelet packet transform for valve failure detection using vibration and acoustic emission signals

Implementing wavelet packet transform for valve failure detection using vibration and acoustic emission signals Joural of Physcs: Coferece Seres Implemetg wavelet packet trasform for valve falure detecto usg vbrato ad acoustc emsso sgals To cte ths artcle: H Y Sm et al 1 J. Phys.: Cof. Ser. 364 186 Vew the artcle

More information

Voltage Contingency Ranking for IEEE 39-Bus System using Newton- Raphson Method

Voltage Contingency Ranking for IEEE 39-Bus System using Newton- Raphson Method WSEAS TRANSACTIONS o OWER SSTEMS Haer m, Asma Meddeb, Souad Chebb oltage Cotgecy Rag for IEEE 39-Bus System usg Newto- Raphso Method HAER MII, ASMA MEDDEB ad SOUAD CHEBBI Natoal Hgh School of Egeers of

More information

x 1 + x x n n = x 1 x 2 + x x n n = x 2 x 3 + x x n n = x 3 x 5 + x x n = x n

x 1 + x x n n = x 1 x 2 + x x n n = x 2 x 3 + x x n n = x 3 x 5 + x x n = x n Sectio 6 7A Samplig Distributio of the Sample Meas To Create a Samplig Distributio of the Sample Meas take every possible sample of size from the distributio of x values ad the fid the mea of each sample

More information

An Enhanced Posterior Probability Anti-Collision Algorithm Based on Dynamic Frame Slotted ALOHA for EPCglobal Class1 Gen2

An Enhanced Posterior Probability Anti-Collision Algorithm Based on Dynamic Frame Slotted ALOHA for EPCglobal Class1 Gen2 Joural of Commucatos Vol. 9,. 0, October 204 A Ehaced Posteror Probablty At-Collso Algorthm Based o Dyamc Frame Slotted ALOHA for EPCglobal Class Ge2 Lta Dua,Wewe Pag 2, ad Fu Dua 2 College of Iformato

More information

Permutation Enumeration

Permutation Enumeration RMT 2012 Power Roud Rubric February 18, 2012 Permutatio Eumeratio 1 (a List all permutatios of {1, 2, 3} (b Give a expressio for the umber of permutatios of {1, 2, 3,, } i terms of Compute the umber for

More information

CS519K: M ULTIMEDIA SYSTEMS STUDENT PROJECTS DATE ANNOUNCED: OCTOBER 25, 2002 DUE DATE:

CS519K: M ULTIMEDIA SYSTEMS STUDENT PROJECTS DATE ANNOUNCED: OCTOBER 25, 2002 DUE DATE: CS519K: M ULTIMEDIA SYSTEMS STUDENT PROJECTS DATE ANNOUNCED: OCTOBER 25, 2002 DUE DATE: DECEMBER 5, 2002, 11:59PM Basc gropg: Groups of 2 studets each; (or dvdual 1-member groups) There are 6 projects.

More information

Provded by the author(s) ad Uversty College Dubl Lbrary accordace wth publsher polces. Please cte the publshed verso whe avalable. Ttle Gaussa Pulse-Based Two-Threshold Parallel Scalg Toe Reservato for

More information

Pivot Language Approach for Phrase-Based Statistical Machine Translation

Pivot Language Approach for Phrase-Based Statistical Machine Translation Pvot Laguage Approach for Phrase-Based Statstcal Mache Traslato Hua Wu ad Hafeg Wag Toshba (Ch Research ad Developmet Ceter 5/F., Tower W2, Oretal Plaza, No., East Chag A Ave., Dog Cheg Dstrct Bejg, 00738,

More information

Dual-Module Data Fusion of Infrared and Radar for Track before Detect

Dual-Module Data Fusion of Infrared and Radar for Track before Detect JOURAL OF COMPUTERS, VOL. 7, O. 2, DECEMBER 22 286 Dual-Module Data Fuso of Ifrared ad Radar for Trac before Detect Afu ZHU orth Cha Uversty of Water Resources ad Electrc Power Uversty,Zhegzhou, P.R.Cha

More information

Lesson 6: Queues and Markov Chains

Lesson 6: Queues and Markov Chains lde supportg materal Lesso 6: Queues ad Markov Chas Gova Gambee Queug Theor ad Telecommucatos: Networks ad Applcatos d edto, prger All rghts reserved 3 Queug Theor ad Telecommucatos: Networks ad Applcatos

More information

A Signal Driven Adaptive Resolution Short-Time Fourier Transform

A Signal Driven Adaptive Resolution Short-Time Fourier Transform Iteratoal Joural of Iformato ad Commucato Egeerg 5:3 009 A Sgal Drve Adaptve Resoluto Short-Tme Fourer Trasform Saeed Ma Qasar, Lauret Fesquet ad Marc Reaud Abstract The frequecy cotets of the o-statoary

More information

Contributions to Collaborative Filtering Research

Contributions to Collaborative Filtering Research Cotrbutos to Collaboratve Flterg Research Shuzhe Nog Major Professor: Jo Herlocer Commttee Members: Margaret Burett Fracsco Mart ABSTRACT I ths report, I frst troduced the three areas that of terest to

More information

Measuring Correlation between Microarray Time-series Data Using Dominant Spectral Component

Measuring Correlation between Microarray Time-series Data Using Dominant Spectral Component Measurg Correlato betwee Mcroarray Tme-seres Data Usg Domat Spectral Compoet Lap Ku Yeug 1, Hog Ya 1, 2, Ala Wee-Chug Lew 1, Lap Keug Szeto 1, Mchael Yag 3 ad Rchard Kog 3 1 Departmet of Computer Egeerg

More information

Thermometer-to-binary Encoder with Bubble Error Correction (BEC) Circuit for Flash Analog-to-Digital Converter (FADC)

Thermometer-to-binary Encoder with Bubble Error Correction (BEC) Circuit for Flash Analog-to-Digital Converter (FADC) Thermometer-to-bary Ecoder wth Bubble Error Correcto (BEC) Crcut for Flash Aalog-to-Dgtal Coverter (FADC) Bu Va Heu, Seughyu Beak, Seughwa Cho +, Jogkook Seo ±, Takyeog Ted. Jeog,* Dept. of Electroc Egeerg,

More information

An Anycast Routing Algorithm Based on Genetic Algorithm

An Anycast Routing Algorithm Based on Genetic Algorithm A Aycast Routg Algorthm Based o Geetc Algorthm CHUN ZHU, MIN JIN Computer Scece ad Iformato Techology College Zhejag Wal Uversty No.8, South Q ahu Road, Ngbo P.R.CHINA http://www.computer.zwu.edu.c Abstract:

More information

VISION-GUIDED DYNAMIC PART PICKUP LEARNING ALGORITHM

VISION-GUIDED DYNAMIC PART PICKUP LEARNING ALGORITHM Preseted at the IEEE/ASME AIM 97, Tokyo, Japa Jue 6-, 997 VISION-GUIDED DYNAMIC PART PICKUP LEARNING ALGORITHM Kok-Meg Lee ad James Dows The George W. Woodruff School of Mechacal Egeerg Georga Isttute

More information

Automatic Construction of Semantic Dictionary for Question Categorization

Automatic Construction of Semantic Dictionary for Question Categorization Automatc Costructo of Sematc Dctoary for Questo Categorzato Tayog HAO Departmet of Computer Scece, Cty Uversty of Hog Kog Hog Kog, Cha Xglag NI Departmet of Computer Scece ad Techology, Uversty of Scece

More information

COVERAGE ESTIMATION FOR MOBILE CELLULAR NETWORKS FROM SIGNAL STRENGTH MEASUREMENTS. Kanagalu R. Manoj, BE and MS DISSERTATION

COVERAGE ESTIMATION FOR MOBILE CELLULAR NETWORKS FROM SIGNAL STRENGTH MEASUREMENTS. Kanagalu R. Manoj, BE and MS DISSERTATION COVERAGE ESTIMATION FOR MOBILE CELLULAR NETWORKS FROM SIGNAL STRENGTH MEASUREMENTS by Kaagalu R. Maoj, BE ad MS DISSERTATION Preseted to the Faculty of The Uversty of Texas at Dallas Partal Fulfllmet of

More information

Generalized Incomplete Trojan-Type Designs with Unequal Cell Sizes

Generalized Incomplete Trojan-Type Designs with Unequal Cell Sizes 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,

More information

8. Combinatorial Structures

8. Combinatorial Structures Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 8. Combiatorial Structures The purpose of this sectio is to study several combiatorial structures that are of basic importace i probability. Permutatios

More information

The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic

The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic Sesors 205, 5, 954-9559; do:0.3390/s508954 Artcle OPEN ACCESS sesors ISSN 424-8220 www.mdp.com/joural/sesors The Balaced Cross-Layer Desg Routg Algorthm Wreless Sesor Networks Usg Fuzzy Logc Ng L *, José-Ferá

More information