Vignette to package samplingdatacrt

Size: px
Start display at page:

Download "Vignette to package samplingdatacrt"

Transcription

1 Vigntt to packag samplingdatacrt Diana Trutschl Contnts 1 Introduction 1 11 Objctiv 1 1 Diffrnt study typs 1 Multivariat normal distributd data for multilvl data 1 Fixd ffcts part Random part 9 3 Manual Dsign matrics 11 3 Covarianc-Varianc-Matrics Sampl data undr a givn study dsign Powr calculations 18 4 Summary 19 1 Introduction 11 Objctiv To valuat for xampl th match of diffrnt statistical modl oftn simulation studis ar usd In simulations th undrlying data can b from a ral study, but also from simulatd data givn a spcific distribution For this purpos w provid a packag to sampling data from normal distribution to mimic data of clustr randomisd trials within diffrnt study dsigns, namly paralll, cross-ovr and stppd wdg dsign Bsids a traditional dsign collcts sampling units within diffrnt groups, which should b compard, in th past yars multilvl dsign, which collct additional units nstd within th original sampling units, bcoms vry popular Masurmnts of diffrnt patints nstd within hospitals, also assignd as clustrs, is on xampl of a two-lvl nstd data Anothr xampl of nstd structurs ar th rpatd masurmnts of patints Furthrmor, thr-lvl nstd data is obtaind for xampl by th combination of both nsting xampls Th complt data of such xampls is thn multivariat distributd Th aim of this packag is to provid a asy implmntation of sampling multivariat normal distributd data for furthr invstigations Additionally, th rquirs powr calculation for a spcial studi dsign, th stppd wdg dsing, is givn 1 Diffrnt study typs Paralll, cross-ovr and stppd wdg dsigns With this packag w provid data sampling within thr common usd study dsign typs: paralll, cross-ovr an stppd wdg dsigns (SWD) Tabl 1 shows xampls of ths kind of typs, ach with C = 6 clustr, followd ovr T = 4 tim points A paralll dsign is prsnt, whn two groups of tratmnts ar givn so that on group rcivs only th first tratmnt whil anothr group rcivs only th scond In contrast to th paralll dsign in a crossovr dsign trail ach xprimntal unit (patint) rcivs diffrnt tratmnts during th diffrnt tim points Hnc, it is 1

2 a rpatd masurmnts dsign An altrnativ and mor popular bcoming dsign is th stppd wdg dsign Hr, th intrvntion is rollout to diffrnt units squntial but random ovr diffrnt tim points A T 1 T T 3 T 4 Cntr Cntr Cntr Cntr Cntr Cntr B T 1 T T 3 T C T 1 T T 3 T Tabl 1: Exampls of diffrnt study dsign typs: A) paralll, B) cross-ovr, and C) stppd wdg dsign Cross-sctional vrsus longitudinal In trials oftn subjcts within clustrs ar followd ovr a priod of tim and masurd to svral masurmnt points Two kinds of data collction is thn possibl: 1) crosssctional data, if at ach tim point th masurmnt units (subjcts) ar diffrnt to th units at anothr timpoints, or ) longitudinal data, th masurmnt units (subjcts) ar th sam to all timpoints (known as rpatd masurmnts) Hnc, if it is a trail with C clustrs and a clustrsiz of N ach, which ar follwd ovr T timpoints, thn th total numbr of includd subjcts is C T N in a cross-sctional and C N in a longitudinal study Multivariat normal distributd data for multilvl data For th situation of a clustr-randomizd trail with T numbr of tim points, C numbr of clustrs and N numbr of patints pr clustr (and tim point, whn it is a cross-sctional) th complt datast can b writtn as th vctor of rsponss Y = {Y ijk } of lngth T C N, which is sampld from a multidimnsional normal distribution: Y N (Zb, V ), whr Zb is thn th fixd ffcts full rank dsign matrix multiplid by th rgrssion fixd ffcts cofficints and V th varianc-covarianc matrix Y ijk is thn th obsrvation in clustr i to tim point k for th subjct j in th cross-sctional cas or th k-th masurmnt of th subjct j in clustr i in th longitudinal cas, rspctivly Th form of th random part (varianc-covarianc matrix) dpnds on th sampling of ithr cross-sctional or longitudinal study dsign, whras th form of th fixd part dpnds on th study dsign typ (paralll, cross-ovr an stppd wdg dsigns) 1 Fixd ffcts part Th rgrssion fixd ffcts cofficints within th providd dsigns ar dfind as b = (, β 1,, β I, θ), whr is th ovrall man, θ is th intrvntion ffct, β k is th fixd tim ffct for tim point k, k = (1,, I) Th dsign matrix X of th modl for such dsigns has th form X = tim point 1 tim point k tim point T clustr 1 x 11 x 1T clustr i clustr C x C1 x CT

3 Th fixd ffcts full rank dsign matrix Z is thn a concatnation of all matrics Z i of all clustrs, which in turn ar a concatnation of N rplications of matrics Z ij (hnc for all j th Z ij is th sam) and which ar cratd out of th dsign matrix X of th SWD modl Thn is Z ij for on subjct in clustr i a column wis bindd matrix of 1 a vctor of ons (th sam for all clustr) a matrix A (th sam for all clustr) 3 a vctor, which is th corrsponding row of th dsign matrix X to clustr i Each row of Z ij corrsponds thn to a idntify ntry of a fixd ffcts in rgrssion fixd ffcts cofficints vctor b Z ij = β 1 β β I 1 θ tim point x i1 0 tim point k 1 xik 1 tim point I x it Hnc, Z i is build by row wis bindd N rplicats of Z ij Z i = subjct 1 subjct N Z ij Z ij and Z by row wis bindd C matrics Z i Z = clustr 1 Z i clustr C Hnc, ach row corrsponds to on subjct j of a clustr i to timpoint k and multiplid with th vctor of rgrssion fixd ffcts cofficints b rsult in th fixd ffct part of th linar quation for this obsrvation Hnc, it is th man vctor of th multivariat normal distribution and it is prformd by th matrix multiplication Zb Paralll dsign For xampl with I = 4 clustr and K = 3 masurmnts, hnc only two clustr for ithr control or tratmnt arm, th dsign matrix X is dfind as X = tim point 1 tim point tim point 3 tim point 4 clustr clustr clustr clustr and th matrix Z i for clustr 1 and is thn Z i (1,) = Z i β 1 β β 3 θ tim point tim point tim point tim point

4 and for clustr 3 and 4 Z i (3,4) = β 1 β β 3 θ tim point tim point tim point tim point thn, if N = subjcts ar within ach clustr th fixd ffcts full rank dsign matrix Z is Z = clustr 1 Z 1 clustr Z clustr 3 Z 3 = clustr 4 Z 4 clustr 1 subjct 1 clustr 1 subjct clustr subjct 1 clustr subjct clustr 3 subjct 1 clustr 3 subjct clustr 4 subjct 1 clustr 4 subjct Z 1j Z 1j Z j Z j Z 3j Z 3j Z 4j Z 4j = β 1 β β 3 θ clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct tim point clustr subjct tim point clustr subjct tim point clustr subjct tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 4 subjct 1 tim point clustr 4 subjct 1 tim point clustr 4 subjct 1 tim point clustr 4 subjct 1 tim point clustr 4 subjct tim point clustr 4 subjct tim point clustr 4 subjct tim point clustr 4 subjct tim point

5 and th fixd part, hnc th man vctor of th multivariat normal distribution, is thn = Z β 1 β β 3 θ = + β 1 + β + β 3 + β 1 + β + β 3 + β 1 + β + β 3 + β 1 + β + β 3 + β 1 + θ + β + θ + β 3 + θ + θ + β 1 + θ + β + θ + β 3 + θ + θ + β 1 + θ + β + θ + β 3 + θ + θ + β 1 + θ + β + θ + β 3 + θ + θ Cross-ovr dsign For xampl with I = 4 clustr and K = 4 masurmnts, two clustr ach switchs tratmnt and control aftr tim point, th dsign matrix X is dfind as X = tim point 1 tim point tim point 3 tim point 4 clustr clustr clustr clustr and th matrix Z i for clustr 1 and is thn Z i (1,) = β 1 β β 3 θ tim point tim point tim point tim point

6 and for clustr 3 and 4 Z i (3,4) = β 1 β β 3 θ tim point tim point tim point tim point thn, if N = subjcts ar within ach clustr th fixd ffcts full rank dsign matrix Z is Z = clustr 1 Z 1 clustr Z clustr 3 Z 3 = clustr 4 Z 4 clustr 1 subjct 1 clustr 1 subjct clustr subjct 1 clustr subjct clustr 3 subjct 1 clustr 3 subjct clustr 4 subjct 1 clustr 4 subjct Z 1j Z 1j Z j Z j Z 3j Z 3j Z 3j Z 3j = β 1 β β 3 θ clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct tim point clustr subjct tim point clustr subjct tim point clustr subjct tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 4 subjct 1 tim point clustr 4 subjct 1 tim point clustr 4 subjct 1 tim point clustr 4 subjct 1 tim point clustr 4 subjct tim point clustr 4 subjct tim point clustr 4 subjct tim point clustr 4 subjct tim point

7 and th fixd part, hnc th man vctor of th multivariat normal distribution, is thn = Z β 1 β β 3 θ = + β 1 + β + β 3 + θ + θ + β 1 + β + β 3 + θ + θ + β 1 + β + β 3 + θ + θ + β 1 + β + β 3 + θ + θ + β 1 + θ + β + θ + β 3 + β 1 + θ + β + θ + β 3 + β 1 + θ + β + θ + β 3 + β 1 + θ + β + θ + β 3 Stppd wdg dsign For xampl with I = 3 clustr and K = 4 masurmnts, hnc only on clustr switchs pr timpoint, th dsign matrix X is dfind as X = tim point 1 tim point tim point 3 tim point 4 clustr clustr clustr and th matrix Z i for clustr 1 is thn Z 1 = β 1 β β 3 θ tim point tim point tim point tim point thn, if N = subjcts ar within ach clustr th fixd ffcts full rank dsign matrix Z is 7

8 Z = clustr 1 Z 1 clustr Z = clustr 3 Z 3 clustr 1 subjct 1 clustr 1 subjct clustr subjct 1 clustr subjct clustr 3 subjct 1 clustr 3 subjct Z 1j Z 1j Z j Z j Z 3j Z 3j = β 1 β β 3 θ clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct 1 tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr 1 subjct tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct 1 tim point clustr subjct tim point clustr subjct tim point clustr subjct tim point clustr subjct tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct 1 tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 3 subjct tim point clustr 3 subjct tim point and th fixd part, hnc th man vctor of th multivariat normal distribution, is thn 8

9 Random part = Z β 1 β β 3 θ = + β 1 + β + θ + β 3 + θ + θ + β 1 + β + θ + β 3 + θ + θ + β 1 + β + β 3 + θ + θ + β 1 + β + β 3 + θ + θ + β 1 + β + β 3 + θ + β 1 + β + β 3 + θ All clustrs ar indpndnt from ach othr, hnc th varianc-covarianc matrix V is a block-diagonal matrix of th matrics V i of all clustrs (and all othrs ar zros), whr for all i th V i ar th sam for all clustr V = clustr 1 clustr C clustr 1 V i clustr C 0 0 V i and V i = subjct 1 subjct N subjct 1 V i1,i1 V i1,i V i1,in V i1,i ViN 1,iN subjct N V i1,in V in 1,iN V in,n Thrfor w dfin V as a submatrix of V ij,i j i for th ntitis corrsponding to th masurmnts of subjct i and th masurmnt of subjct j 9

10 For all two diffrnt subjcts j and j (j j) this submatrix is dfind by V ij,i j = timpoint 1 timpoint T timpoint 1 timpoint T Th diffrnc in th distributions of th obsrvations within a cross-sctional and longitudinal SWD is in th random part of th modl Thus th varianc-covarianc matrix V of th normal distribution N (Zb, V ) and hnc th form of th V i or V ij,ij rspctivly diffr Varianc-Covarianc matrix within a cross-sctional dsign V ij,ij = timpoint 1 timpoint T timpoint 1 α + timpoint T α + For our xampl of (I = clustr,) K = 3 timpoints and N = subjcts ach clustr th Varianc- Covarianc matrix V i for ach clustr is thn subjct 1 subjct tp 1 tp tp T tp 1 tp tp T subjct 1 subjct {}}{{}}{ tp 1 tp tp 3 tp 1 tp tp 3 α + α + α + α + α + α + Varianc-Covarianc matrix within a longitudinal dsign V ij,ij = timpoint 1 timpoint T timpoint 1 α + γ + γ + γ + γ + γ + timpoint T γ + γ + α + γ + For our xampl of (I = clustr,) K = 3 timpoints and N = subjcts ach clustr th Varianc- Covarianc matrix V i for ach clustr is thn subjct 1 subjct tp 1 tp tp 3 tp 1 tp tp 3 subjct 1 { }} { subjct { }} { tim point 1 tim point tim point 3 tim point 1 tim point tim point 3 α + γ + γ + γ + γ + α + γ + γ + γ + γ + γ + α + α + γ + γ + γ + γ + α + γ + γ + γ + γ + α + γ + 10

11 3 Manual Us th following Packag undr GPL and load to th library: #load th packag library(samplingdatacrt) library(lm4) ## Loading rquird packag: Matrix 31 Dsign matrics In ach study a dsign matrix of valus of xplanatory variabls can b usd to dscrib th study typ Hr, ach row rprsnts an study unit (clustr) and th cll ntitis ar th ncoding of rciving th tratmnt or not (zros and ons) Tabl1 shows such dsign matrics or diffrnt study typs In contrast ach row of th dsign matrix of th complt data of th trail rprsnts a masurmnt with th succssiv columns corrsponding to th variabls (ffcts) and thir spcific valus for that Th dsign matrix of th complt data corrsponds to th fixd part of th multivariat normal distribution All matrics could also b implmntd manually using th function matrix(), but, instad of ordring an amount of zros and ons, th providd functions in this packag mak it asy to rciv this complx matrics for simpl study dsigns using only som paramtrs (for balancd data and qual numbr of clustrs pr switch) dsignmatrix Th dsign matrix for th study typ of th thr typs a) paralll, b) cross-ovr, and c) SWD can b prformd by using th function dsignmatrix(), which rquir four paramtrs: th numbr of clustrs within th trail, th numbr of masurmnt tim points, th numbr of clustr, which switch ovr from control to intrvntion at ach tim point and th study typ ( SWD as dfault) I<-6 #numbr of clustr K<-4 #numbr of timcpoints #Dsign matrix for paralll study, s Tabl 1 sw<-3 #numbr of clustr switchs dsignmatrix(nc=i, nt=k, nsw=sw, dsign="paralll") ## [,1] [,] [,3] [,4] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] #Dsign matrix for cross-ovr study, s Tabl 1 dsignmatrix(nc=i, nt=k, nsw=sw, dsign="cross-ovr") ## [,1] [,] [,3] [,4] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,]

12 #if swp is st, thn th timpoint of switch is sttd manually dsignmatrix(nc=i, nt=k, nsw=sw, swp=1, dsign="cross-ovr") ## [,1] [,] [,3] [,4] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] #Dsign matrix for SWD study, s Tabl 1 sw<- #numbr of clustr switchs dsignmatrix(nc=i, nt=k, nsw=sw) ## [,1] [,] [,3] [,4] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] compltdatadsignmatrix Th function compltdatadsignmatrix() prforms th dsign matrix for complt data within givn study dsign It rquirs a dsign matrix of a study and th numbr of subjct within ach cll K<-4 #numbr of tim points J<- #numbr of subjcts, ach clustr and timpoint ##### for paralll study ##### I<-4 #numbr of clustr sw<- #numbr of clustr switchs # crat a dsign matrix (X<-dsignMatrix(nC=I, nt=k, nsw=sw, dsign="paralll")) ## [,1] [,] [,3] [,4] ## [1,] ## [,] ## [3,] ## [4,] # crat th corrsponding complt data dsign matrix compltdatadsignmatrix(j, X) ## [,1] [,] [,3] [,4] [,5] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] ## [7,]

13 ## [8,] ## [9,] ## [10,] ## [11,] ## [1,] ## [13,] ## [14,] ## [15,] ## [16,] ## [17,] ## [18,] ## [19,] ## [0,] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] ## [7,] ## [8,] ## [9,] ## [30,] ## [31,] ## [3,] ##### for cross-ovr study ##### # crat a dsign matrix (X<-dsignMatrix(nC=I, nt=k, nsw=sw, dsign="cross-ovr")) ## [,1] [,] [,3] [,4] ## [1,] ## [,] ## [3,] ## [4,] # crat th corrsponding complt data dsign matrix compltdatadsignmatrix(j, X) ## [,1] [,] [,3] [,4] [,5] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] ## [7,] ## [8,] ## [9,] ## [10,] ## [11,] ## [1,] ## [13,] ## [14,]

14 ## [15,] ## [16,] ## [17,] ## [18,] ## [19,] ## [0,] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] ## [7,] ## [8,] ## [9,] ## [30,] ## [31,] ## [3,] ##### for SWD study ##### I<-3 #numbr of clustr # crat a dsign matrix (X<-dsignMatrix(nC=I, nt=k, nsw=1)) ## [,1] [,] [,3] [,4] ## [1,] ## [,] ## [3,] # crat th corrsponding complt data dsign matrix compltdatadsignmatrix(j, X) ## [,1] [,] [,3] [,4] [,5] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] ## [7,] ## [8,] ## [9,] ## [10,] ## [11,] ## [1,] ## [13,] ## [14,] ## [15,] ## [16,] ## [17,] ## [18,] ## [19,] ## [0,] ## [1,]

15 ## [,] ## [3,] ## [4,] Covarianc-Varianc-Matrics Covarianc-Varianc matrix ar ndd bsids th man vctor to spcify th kind of multivariat normal distribution Th form dpnds on th kind of multilvl structur In our xampls of clustr randomizd studis with masurmnts ovr tim thr ar two possibilitis: 1) two-lvl data within cross-sctional studis and ) thr-lvl data within longitudinal studis CovMatDsign Th corrsponding covarianc-varianc matrics can b prformd with th providd CovMatDsign() Th function rquird th dsign paramtr K numbr of timpoints, I numbr of clustrs, J numbr of subjcts within ach clustr to ach timpoint, and also th variancs corrsponding to ach lvl If sigmaq is not givn, thn it a cross-sctional, othrwis a longitudinal dsign is prformd #study dsign paramtr K<-3 #numbr of masurmnt (or timpoints) I<- #numbr of clustr J<- #numbr of subjcts ### for cross-sctional data sigma1<-01 sigma3<-09 CovMatDsign(K, J, I, sigma1q=sigma1, sigma3q=sigma3) ## [,1] [,] [,3] [,4] [,5] [,6] [,7] [,8] [,9] [,10] [,11] [,1] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] ## [7,] ## [8,] ## [9,] ## [10,] ## [11,] ## [1,] ### for longitudinal data sigma1<-01 sigma<-04 sigma3<-09 CovMatDsign(K, J, I, sigma1q=sigma1, sigmaq=sigma, sigma3q=sigma3) ## [,1] [,] [,3] [,4] [,5] [,6] [,7] [,8] [,9] [,10] [,11] [,1] ## [1,] ## [,] ## [3,] ## [4,]

16 ## [5,] ## [6,] ## [7,] ## [8,] ## [9,] ## [10,] ## [11,] ## [1,] Sampl data undr a givn study dsign W provid a function to sampl a complt data st from multivariat normal distribution to mimic data of clustr randomisd trials within diffrnt study dsigns, namly paralll, cross-ovr and stppd wdg dsign and diffrnt typ of longitudinal or cross-sctional data sampldata Thrfor, w provid th sampldata(), whr th man vctor and th covarianc-varianc matrix of th distribution undr such studis has to b givn #dsing paramtr K<-4 #numbr of tim points J<-5 #numbr of subjcts, ach clustr and timpoint #variancs of ach lvl sigma1<-01 sigma<-04 sigma3<-09 #rgrssion paramtrs mu0<-0 thta<-1 btas<-rp(0, K-1) paramtrs<-c(mu0, btas, thta) ##### for paralll study ##### I<-4 #numbr of clustr sw<- #numbr of clustr switchs # crat a dsign matrix X<-dsignMatrix(nC=I, nt=k, nsw=sw, dsign="paralll") # crat th corrsponding complt data dsign matrix D<-compltDataDsignMatrix(J, X) #prform covarianc-varianc matrix for longitudinal dsign V<-CovMatDsign(K, J, I, sigma1q=sigma1, sigmaq=sigma, sigma3q=sigma3) #sampl data within th dsign sampldata<-sampldata(typ = "long", K=K,J=J,I=I, D=D, V=V, paramtrs=paramtrs) #nd th lm4 packag for analysis lmr(val~intrvntion+masurmnt + (1 clustr)+(1 subjct), data=sampldata) ## Linar mixd modl fit by REML ['lmrmod'] ## Formula: val ~ intrvntion + masurmnt + (1 clustr) + (1 subjct) ## Data: sampldata ## REML critrion at convrgnc:

17 ## Random ffcts: ## Groups Nam StdDv ## subjct (Intrcpt) 0588 ## clustr (Intrcpt) ## Rsidual 0306 ## Numbr of obs: 400, groups: subjct, 100; clustr, 4 ## Fixd Effcts: ## (Intrcpt) intrvntion masurmnt masurmnt3 masurmnt4 ## # ##### for cross-ovr study ##### # crat a dsign matrix X<-dsignMatrix(nC=I, nt=k, nsw=sw, dsign="cross-ovr") # crat th corrsponding complt data dsign matrix D<-compltDataDsignMatrix(J, X) #prform covarianc-varianc matrix for longitudinal dsign V<-CovMatDsign(K, J, I, sigma1q=sigma1, sigmaq=sigma, sigma3q=sigma3) #sampl data within th dsign sampldata<-sampldata(typ = "long", K=K,J=J,I=I, D=D, V=V, paramtrs=paramtrs) #analysis of th thr-lvl data lmr(val~intrvntion+masurmnt + (1 clustr)+(1 subjct), data=sampldata) ## Linar mixd modl fit by REML ['lmrmod'] ## Formula: val ~ intrvntion + masurmnt + (1 clustr) + (1 subjct) ## Data: sampldata ## REML critrion at convrgnc: ## Random ffcts: ## Groups Nam StdDv ## subjct (Intrcpt) ## clustr (Intrcpt) 0817 ## Rsidual 0954 ## Numbr of obs: 400, groups: subjct, 100; clustr, 4 ## Fixd Effcts: ## (Intrcpt) intrvntion masurmnt masurmnt3 masurmnt4 ## ##### for SWD study ##### I<-3 #numbr of clustr # crat a dsign matrix X<-dsignMatrix(nC=I, nt=k, nsw=1) # crat th corrsponding complt data dsign matrix D<-compltDataDsignMatrix(J, X) #prform covarianc-varianc matrix for cross-sctional dsign V<-CovMatDsign(K, J, I, sigma1=sigma1, sigma3=sigma3) #sampl data within th dsign sampldata<-sampldata(typ = "cross-sc", K=K,J=J,I=I, D=D, V=V, paramtrs=paramtrs) #analysis of th two-lvldata lmr(val~intrvntion+masurmnt + (1 clustr), data=sampldata) 17

18 ## Linar mixd modl fit by REML ['lmrmod'] ## Formula: val ~ intrvntion + masurmnt + (1 clustr) ## Data: sampldata ## REML critrion at convrgnc: ## Random ffcts: ## Groups Nam StdDv ## clustr (Intrcpt) 1370 ## Rsidual ## Numbr of obs: 300, groups: clustr, 3 ## Fixd Effcts: ## (Intrcpt) intrvntion masurmnt masurmnt3 masurmnt4 ## Powr calculations Powr of tsting th intrvntion ffct is providd for SWD Th function nds th stimatd intrvntion ffct and thir varianc calcpowrswd Powr calculation within stppd wdg dsign modl by Hussy & Hughs 1 for crosssctional and Ho & Kim for longitudinal data nocl<-10 not<-6 switchs<- DM<-dsignMatrix(noCl,noT,switchs) sigma <- sigmaalpha <- #Powr for cross-sctional SWD dsign by formula of Hussy&Hughs calcpowrswd(thtaest=1,dsign=dm, sigmaq=sigma^, tauq=sigmaalpha^, tim=false) ## [1] #Powr for longitudinal SWD dsign by formula of Ho&Kim #Exampl Ho&Kim Tabl 1 ###Tabl 1, 1 row dlta<- 03# tratmnt ffct DMnw<-NULL for(i in 1:dim(DM)[]){ DMnw<-cbind(DMnw,DM[,i], DM[,i]) } DMnw ## [,1] [,] [,3] [,4] [,5] [,6] [,7] [,8] [,9] [,10] [,11] [,1] ## [1,] ## [,] ## [3,] ## [4,] ## [5,] ## [6,] Michal A Hussy and Jams P Hughs,Dsign and analysis of stppd wdg clustr randomizd trials, Contmporary Clinical Trials(8),007 Ho M, Kim N, Rink ML, Wyli-Rostt J, Sampl siz dtrminations for stppd-wdg clinical trials from a thr-lvl data hirarchy prspctiv, Stat Mthods Md Rs,

19 ## [7,] ## [8,] ## [9,] ## [10,] sigma <- sqrt(7/10) sigma <- sqrt(/10) sigmaalpha <- sqrt(1/10 ) K<- 10 #numbr of participants within ach 'cll' calcpowrswd(thtaest=dlta, Dsign=DMnw, tauq=sigmaalpha^, sigmaq=sigma^, sigmaqrror =sigma^, nosub=k, typ="longitudinal") ## [1] Summary dsignmatrix dscription crat dsign matrix for a givn stup of a stppd wdg dsign paramtr nc numbr of clustr nt numbr of timpoints nsw numbr of clustr : within paralll rciv th control (nc-nsw rciv th intrvntion), within cross-ovr rciv th pattrn (0, 1) (nc-nsw rciv th pattrn (1,0)) for narly th sam numbr of tim points, within SWD switchs from control to intrvntion pr tim point swp is th tim point th clustr cross ovr th condition in a cross ovr study, if not givn thn it is narly half of th tim past, param dsign is th study typ (paralll, cross-sctional, stppd wdg) rturn dsign matrix for a givn stup of a stppd wdg dsign implmmatrixswd dscription Crats a implmntation matrix for a givn stppd wdg dsign and grad of intrvntion implmntation pattrn paramtr nc Numbr of clustrs nt Numbr of timpoint nsw numbr of clustrs switchs from control to tratmnt at ach timpoint pattrn a vctor for grad of intrvntion implmntation pattrn, which givs th dviation from 100 prcnt ffctivnss ovr tim rturn Dsign matrix for SWD modl undr a grad of intrvntion implmntation pattrn 19

20 compltdatadsignmatrix dscription crat dsign matrix for complt data within dsign paramtr J numbr of subjcts X givn dsign matrix rturn dsign matrix for complt data within dsign CovMatDsign dscription covarianc matrix fof th normal distribution undr clustr randomizd study typ givn a dsign and a typ paramtr K numbr of timpoints or masurmnts (dsign paramtr) J numbr of subjcts I numbr of clustrs (dsign paramtr) sigma1q varianc of th lowst lvl (rror varianc or within subjct varianc) sigmaq scound lvl varianc (g within clustr and btwn subjct varianc) sigma3q third lvl varianc (g btwn clustr varianc) rturn covarianc matrix sampldata dscription Sampl data (rspons) for givn numbrs of individuals by givn a modl (of a paralll, cross-sctional, stppd wdg dsign study) paramtr typ of th dsign is ithr cross-sctional ( cross-sc ) or longitudinal ( longitudinal ) K numbr of timpoints or masurmnts (dsign paramtr) J numbr of subjcts I numbr of clustrs (dsign paramtr) D a complt data dsign matrix corrsponding to th assumd modl A a complt data dsign matrix corrsponding to th tru data, if A is null, thn A is qual to D V covarianc matrix for th normal distribution paramtrs corrsponding to th modl (rgrssion fixd ffcts cofficints) rturn Data of individuals intnsitis corrsponds to th SWD modl and full modl paramtr information 0

21 calcpowrswd dscription Calculation of powr for a lmm with clustr as random ffct, fixd timpoint ffcts, but st to null, TP numbr of timpoints, I numbr of clustr Th dsign matrix has to b codd by zros and ons paramtr ThtaEst xpctd tratmnt ffct alpha singificanc lvl (by dfault 005) Dsign dsign matrix for a givn SWD modl tauq btwn clustr varianc sigmaq within clustr varianc(btwn subjct varianc) sigmaqrror within subjct varianc/rror varianc nosub numbr of subjcts within ach clustr and ach timpoint (for all an qual siz) typ is of cross-sctional (by dfault) or longitudinal assigns th typ of data ( or 3 lvl nstd structur) tim a logical (FALSE, if no tim trnds ar xpctd, othrwis TRUE) is only rlvant for valuation of cross-sctional data rturn Aproximatd powr of two taild tst, although th dsign matrix is fractionatd, thn powr is not valid, formula usd for cross-sctional data providd by Hussy & Hughs 3, and for longitudinal data by Ho & Kim 4 3 Michal A Hussy and Jams P Hughs,Dsign and analysis of stppd wdg clustr randomizd trials, Contmporary Clinical Trials(8),007 4 Ho M, Kim N, Rink ML, Wyli-Rostt J, Sampl siz dtrminations for stppd-wdg clinical trials from a thr-lvl data hirarchy prspctiv, Stat Mthods Md Rs, 016 1

Package samplingdatacrt

Package samplingdatacrt Version 1.0 Type Package Package samplingdatacrt February 6, 2017 Title Sampling Data Within Different Study Designs for Cluster Randomized Trials Date 2017-01-20 Author Diana Trutschel, Hendrik Treutler

More information

CSE 272 Assignment 1

CSE 272 Assignment 1 CSE 7 Assignmnt 1 Kui-Chun Hsu Task 1: Comput th irradianc at A analytically (point light) For point light, first th nrgy rachd A was calculatd, thn th nrgy was rducd by a factor according to th angl btwn

More information

Midterm 2 - Solutions 1

Midterm 2 - Solutions 1 COS 26 Gnral Computr Scinc Spring 999 Midtrm 2 - Solutions. Writ a C function int count(char s[ ]) that taks as input a \ trminatd string and outputs th numbr of charactrs in th string (not including th

More information

Objectives. Two Ways to Implement Lists. Lists. Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues

Objectives. Two Ways to Implement Lists. Lists. Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues Chaptr 24 Implmnting Lists, Stacks, Quus, and Priority Quus CS2: Data Structurs and Algorithms Colorado Stat Univrsity Original slids by Danil Liang Modifid slids by Chris Wilcox Objctivs q To dsign common

More information

Terrain Mapping and Analysis

Terrain Mapping and Analysis Trrain Mapping and Analysis Data for Trrain Mapping and Analysis Digital Trrain Modl (DEM) DEM rprsnts an array of lvation points. Th quality of DEM influncs th accuracy of trrain masurs such as slop and

More information

Systems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point.

Systems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point. 3-5 Systms in Thr Variabls TEKS FOCUS VOCABULARY TEKS (3)(B) Solv systms of thr linar quations in thr variabls by using Gaussian limination, tchnology with matrics, and substitution. Rprsntation a way

More information

TCP Congestion Control. Congestion Avoidance

TCP Congestion Control. Congestion Avoidance TCP Congstion Control TCP sourcs chang th snding rat by modifying th window siz: Window = min {Advrtisd window, Congstion Window} Rcivr Transmittr ( cwnd ) In othr words, snd at th rat of th slowst componnt:

More information

Principles of Programming Languages Topic: Formal Languages II

Principles of Programming Languages Topic: Formal Languages II Principls of Programming Languags Topic: Formal Languags II CS 34,LS, LTM, BR: Formal Languags II Rviw A grammar can b ambiguous i.. mor than on pars tr for sam string of trminals in a PL w want to bas

More information

A New Algorithm for Solving Shortest Path Problem on a Network with Imprecise Edge Weight

A New Algorithm for Solving Shortest Path Problem on a Network with Imprecise Edge Weight Availabl at http://pvamudu/aam Appl Appl Math ISSN: 193-9466 Vol 6, Issu (Dcmbr 011), pp 60 619 Applications and Applid Mathmatics: An Intrnational Journal (AAM) A Nw Algorithm for Solving Shortst Path

More information

Maxwell s unification: From Last Time. Energy of light. Modern Physics. Unusual experimental results. The photoelectric effect

Maxwell s unification: From Last Time. Energy of light. Modern Physics. Unusual experimental results. The photoelectric effect From Last Tim Enrgy and powr in an EM wav Maxwll s unification: 1873 Intimat connction btwn lctricity and magntism Exprimntally vrifid by Hlmholtz and othrs, 1888 Polarization of an EM wav: oscillation

More information

" dx v(x) $ % You may also have seen this written in shorthand form as. & ' v(x) + u(x) '# % ! d

 dx v(x) $ % You may also have seen this written in shorthand form as. & ' v(x) + u(x) '# % ! d Calculus II MAT 146 Mthods of Intgration: Intgration by Parts Just as th mthod of substitution is an intgration tchniqu that rvrss th drivativ procss calld th chain rul, Intgration by parts is a mthod

More information

The Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline PS 6 Ntwork Programming Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du http://www.cs.clmson.du/~mwigl/courss/cpsc6 Th Ntwork Layr: Routing & ddrssing

More information

DO NOW Geometry Regents Lomac Date. due. Similar by Transformation 6.1 J'' J''' J'''

DO NOW Geometry Regents Lomac Date. due. Similar by Transformation 6.1 J'' J''' J''' DO NOW Gomtry Rgnts Lomac 2014-2015 Dat. du. Similar by Transformation 6.1 (DN) Nam th thr rigid transformations and sktch an xampl that illustrats ach on. Nam Pr LO: I can dscrib a similarity transformation,

More information

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1 Advancd Computr Graphics CSE 63 [Spring 207], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 28 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2

More information

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy PS Intrntworking Th Ntwork Layr: Routing & ddrssing Outlin Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du Novmbr, Ntwork layr functions Routr architctur

More information

1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table

1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table 1. Trac th array for Bubbl sort 34, 8, 64, 51, 3, 1. And fill in th following tabl bubbl(intgr Array x, Intgr n) Stp 1: Intgr hold, j, pass; Stp : Boolan switchd = TRUE; Stp 3: for pass = 0 to (n - 1 &&

More information

To Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1

To Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1 Advancd Computr Graphics (Fall 200) CS 283, Lctur 5: Msh Data Structurs Ravi Ramamoorthi http://inst.cs.brkly.du/~cs283/fa0 To Do Assignmnt, Du Oct 7. Start rading and working on it now. Som parts you

More information

Evolutionary Clustering and Analysis of Bibliographic Networks

Evolutionary Clustering and Analysis of Bibliographic Networks Evolutionary Clustring and Analysis of Bibliographic Ntworks Manish Gupta Univrsity of Illinois at Urbana-Champaign gupta58@illinois.du Charu C. Aggarwal IBM T. J. Watson Rsarch Cntr charu@us.ibm.com Jiawi

More information

Problem Set 1 (Due: Friday, Sept. 29, 2017)

Problem Set 1 (Due: Friday, Sept. 29, 2017) Elctrical and Computr Enginring Mmorial Univrsity of Nwfoundland ENGI 9876 - Advancd Data Ntworks Fall 2017 Problm St 1 (Du: Friday, Spt. 29, 2017) Qustion 1 Considr a communications path through a packt

More information

Recorder Variables. Defining Variables

Recorder Variables. Defining Variables Rcordr Variabls Dfining Variabls Simpl Typs Complx Typs List of Rsrvd Words Using Variabls Stting Action Paramtrs Parsing Lists and Tabls Gtting Valu from Lists and Tabls Using Indxs with Lists Using Indxs

More information

FSP Synthesis of an off-set five bar-slider mechanism with variable topology

FSP Synthesis of an off-set five bar-slider mechanism with variable topology FSP Synthsis of an off-st fiv bar-slidr mchanism with variabl topology Umsh. M. Daivagna 1*, Shrinivas. S. Balli 2 1 Dpartmnt of Mchanical Enginring, S.T.J.Institut of Tchnology, Ranbnnur, India 2 Dpt.

More information

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1 Advancd Computr Graphics CSE 63 [Spring 208], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 27 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2

More information

SPECKLE NOISE REDUCTION IN SAR IMAGING USING 2-D LATTICE FILTERS BASED SUBBAND DECOMPOSITION

SPECKLE NOISE REDUCTION IN SAR IMAGING USING 2-D LATTICE FILTERS BASED SUBBAND DECOMPOSITION 7th Europan Signal Procssing Confrnc EUSIPCO 9 Glasgow Scotland August 4-8 9 SPECKLE REDUCTION IN SAR IMAGING USING -D LATTICE FILTERS ASED SUAND DECOMPOSITION Göhan Karasaal N.. Kaplan I. Err Informatics

More information

Gernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents

Gernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents Grnot Hoffmann Sphr Tssllation by Icosahdron Subdivision Contnts 1. Vrtx Coordinats. Edg Subdivision 3 3. Triangl Subdivision 4 4. Edg lngths 5 5. Normal Vctors 6 6. Subdividd Icosahdrons 7 7. Txtur Mapping

More information

Managing Trust Relationships in Peer 2 Peer Systems

Managing Trust Relationships in Peer 2 Peer Systems Managing Trust Rlationships in Pr 2 Pr Systms R.S.SINJU PG STUDENT, DEPARTMENT OF COMPUTER SCIENCE, PONJESLY COLLEGE OF ENGINEERING NAGERCOIL, TAMILNADU, INDIA C.FELSY ASST.PROF, DEPARTMENT OF COMPUTER

More information

Interfacing the DP8420A 21A 22A to the AN-538

Interfacing the DP8420A 21A 22A to the AN-538 Intrfacing th DP8420A 21A 22A to th 68000 008 010 INTRODUCTION This application not xplains intrfacing th DP8420A 21A 22A DRAM controllr to th 68000 Thr diffrnt dsigns ar shown and xplaind It is assumd

More information

8.3 INTEGRATION BY PARTS

8.3 INTEGRATION BY PARTS 8.3 Intgration By Parts Contmporary Calculus 8.3 INTEGRATION BY PARTS Intgration by parts is an intgration mthod which nabls us to find antidrivativs of som nw functions such as ln(x) and arctan(x) as

More information

Introduction to Data Mining

Introduction to Data Mining Introduction to Data Mining Lctur #15: Clustring-2 Soul National Univrsity 1 In Tis Lctur Larn t motivation and advantag of BFR, an xtnsion of K-mans to vry larg data Larn t motivation and advantag of

More information

Workbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O.

Workbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O. Workbook for Dsigning Distributd Control Applications using Rockwll Automation s HOLOBLOC Prototyping Softwar John Fischr and Thomas O. Bouchr Working Papr No. 05-017 Introduction A nw paradigm for crating

More information

The semantic WEB Roles of XML & RDF

The semantic WEB Roles of XML & RDF Th smantic WEB Rols of XML & RDF STEFAN DECKER AND SERGEY MELNIK FRANK VAN HARMELEN, DIETER FENSEL, AND MICHEL KLEIN JEEN BROEKSTRA MICHAEL ERDMANN IAN HORROCKS Prsntd by: Iniyai Thiruvalluvan CSCI586

More information

From Last Time. Origin of Malus law. Circular and elliptical polarization. Energy of light. The photoelectric effect. Exam 3 is Tuesday Nov.

From Last Time. Origin of Malus law. Circular and elliptical polarization. Energy of light. The photoelectric effect. Exam 3 is Tuesday Nov. From Last Tim Enrgy and powr in an EM wav Exam 3 is Tusday Nov. 25 5:30-7 pm, 2103 Ch (hr) Studnts w / schduld acadmic conflict plas stay aftr class Tus. Nov. 18 to arrang altrnat tim. Covrs: all matrial

More information

Installation Saving. Enhanced Physical Durability Enhanced Performance Warranty The IRR Comparison

Installation Saving. Enhanced Physical Durability Enhanced Performance Warranty The IRR Comparison Contnts Tchnology Nwly Dvlopd Cllo Tchnology Cllo Tchnology : Improvd Absorption of Light Doubl-sidd Cll Structur Cllo Tchnology : Lss Powr Gnration Loss Extrmly Low LID Clls 3 3 4 4 4 Advantag Installation

More information

i e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S

i e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S isto C o C or Co r op ra p a py ag yr g ri g g gh ht S S S V V K r V K r M K v M r v M rn v MW n W S r W Sa r W K af r: W K f : a H a M r T H r M rn w T H r Mo ns w T i o S ww c ig on a w c g nd af ww

More information

Type & Media Page 1. January 2014 Libby Clarke

Type & Media Page 1. January 2014 Libby Clarke Nam: 1 In ordr to hlp you s your progrss at th nd of this ntir xrcis, you nd to provid som vidnc of your starting point. To start, draw th a on th lft into th box to th right, dpicting th sam siz and placmnt.

More information

Multihop MIMO Relay Networks with ARQ

Multihop MIMO Relay Networks with ARQ Multihop MIMO Rlay Ntworks with ARQ Yao Xi Dniz Gündüz Andra Goldsmith Dpartmnt of Elctrical Enginring Stanford Univrsity Stanford CA Dpartmnt of Elctrical Enginring Princton Univrsity Princton NJ Email:

More information

Analysis of Influence AS Path Prepending to the Instability of BGP Routing Protocol.

Analysis of Influence AS Path Prepending to the Instability of BGP Routing Protocol. ISSN : 2355-9365 -Procding of Enginring : Vol.5, No.1 Mart 2018 Pag 1112 Analysis of Influnc AS Path Prpnding to th Instability of BGP Routing Protocol. Hirwandi Agusnam 1, Rndy Munadi 2, Istikmal 3 1,2,3,

More information

Register Allocation. Register Allocation

Register Allocation. Register Allocation Rgistr Allocation Jingk Li Portlan Stat Univrsity Jingk Li (Portlan Stat Univrsity) CS322 Rgistr Allocation 1 / 28 Rgistr Allocation Assign an unboun numbr of tmporaris to a fix numbr of rgistrs. Exampl:

More information

Summary: Semantic Analysis

Summary: Semantic Analysis Summary: Smantic Analysis Chck rrors not dtctd by lxical or syntax analysis Intrmdiat Cod Scop rrors: Variabls not dfind Multipl dclarations Typ rrors: Assignmnt of valus of diffrnt typs Invocation of

More information

Tillförlitlig dimensionering mot utmattning UTMIS Vårmöte 2018 på Högskolan i Skövde

Tillförlitlig dimensionering mot utmattning UTMIS Vårmöte 2018 på Högskolan i Skövde Tillförlitlig dimnsionring mot utmattning UTMIS Vårmöt 2018 på Högskolan i Skövd Rami Mansour & Mårtn Olsson KTH Hållfasthtslära mart@kth.s ramimans@kth.s Introduction Ovrviw of rliabl dsign Traditional

More information

The Size of the 3D Visibility Skeleton: Analysis and Application

The Size of the 3D Visibility Skeleton: Analysis and Application Th Siz of th 3D Visibility Sklton: Analysis and Application Ph.D. thsis proposal Linqiao Zhang lzhang15@cs.mcgill.ca School of Computr Scinc, McGill Univrsity March 20, 2008 thsis proposal: Th Siz of th

More information

Spectral sensitivity and color formats

Spectral sensitivity and color formats FirWir camras Spctral snsitivity and color formats At th "input" of a camra, w hav a CCD chip. It transforms photons into lctrons. Th spctral snsitivity of this transformation is an important charactristic

More information

Greedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works.

Greedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works. Algorithm Grdy Algorithm 5- Grdy Algorithm Grd i good. Grd i right. Grd work. Wall Strt Data Structur and Algorithm Andri Bulatov Algorithm Grdy Algorithm 5- Algorithm Grdy Algorithm 5- Intrval Schduling

More information

This module calculates the motor speed based on a rotor position measurement when the direction information is available.

This module calculates the motor speed based on a rotor position measurement when the direction information is available. SPEED_FRQ Spd Calulator Basd on Rotor Angl With Dirtion Information Dsription This modul alulats th motor spd basd on a rotor position masurmnt whn th dirtion information is availabl. thta_l dir_qep SPEED_FRQ

More information

2 Mega Pixel. HD-SDI Bullet Camera. User Manual

2 Mega Pixel. HD-SDI Bullet Camera. User Manual 2 Mga Pixl HD-SDI Bullt Camra Usr Manual Thank you for purchasing our product. This manual is only applicabl to SDI bullt camras. Thr may b svral tchnically incorrct placs or printing rrors in this manual.

More information

Reimbursement Requests in WORKS

Reimbursement Requests in WORKS Rimbursmnt Rqusts in WORKS Important points about Rimbursmnts in Works Rimbursmnt Rqust is th procss by which UD mploys will b rimbursd for businss xpnss paid using prsonal funds. Rimbursmnt Rqust can

More information

A Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 )

A Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 ) A Brif Summary of Draw Tools in MS Word with Exampls! ( Pag 1 ) Click Viw command at top of pag thn Click Toolbars thn Click Drawing! A chckmark appars in front of Drawing! A toolbar appars at bottom of

More information

Comment (justification for change) by the MB

Comment (justification for change) by the MB Editor's disposition s CD2 19763-12 as at 2013-11-03 Srial Annx (.g. 3.1) Figur/ Tabl/t (.g. Tabl 1) 001 CA 00 All All - G Canada disapprovs th draft for th rasons blow. 002 GB 01 Gnral d numbring has

More information

An Agent-Based Architecture for Service Discovery and Negotiation in Wireless Networks

An Agent-Based Architecture for Service Discovery and Negotiation in Wireless Networks An Agnt-Basd Architctur for Srvic Discovry and Ngotiation in Wirlss Ntworks Abstract Erich Birchr and Torstn Braun Univrsity of Brn, Nubrückstrass 10, 3012 Brn, Switzrland Email: braun@iam.unib.ch This

More information

Intersection-free Dual Contouring on Uniform Grids: An Approach Based on Convex/Concave Analysis

Intersection-free Dual Contouring on Uniform Grids: An Approach Based on Convex/Concave Analysis Intrsction-fr Dual Contouring on Uniform Grids: An Approach Basd on Convx/Concav Analysis Charli C. L. Wang Dpartmnt of Mchanical and Automation Enginring, Th Chins Univrsity of Hong Kong E-mail: cwang@ma.cuhk.du.hk

More information

Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8.

Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8. Rviw: Shift-Rduc Parsing Bottom-up parsing uss two actions: Bottom-Up Parsing II Lctur 8 Shift ABC xyz ABCx yz Rduc Cbxy ijk CbA ijk Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur 8 2 Rcall: h Stack

More information

Nimsoft Monitor. ldap_response Guide. v1.3 series

Nimsoft Monitor. ldap_response Guide. v1.3 series Nimsoft Monitor ldap_rspons Guid v1.3 sris Lgal Notics Copyright 2012, Nimsoft Corporation Warranty Th matrial containd in this documnt is providd "as is," and is subjct to bing changd, without notic,

More information

RFC Java Class Library (BC-FES-AIT)

RFC Java Class Library (BC-FES-AIT) RFC Java Class Library (BC-FES-AIT) HELP.BCFESDEG Rlas 4.6C SAP AG Copyright Copyright 2001 SAP AG. All Rcht vorbhaltn. Witrgab und Vrvilfältigung disr Publikation odr von Tiln daraus sind, zu wlchm Zwck

More information

FALSE DYNAMIC EIV MODEL IDENTIFICATION IN THE PRESENCE OF NON-PARAMETRIC DYNAMIC UNCERTAINTY

FALSE DYNAMIC EIV MODEL IDENTIFICATION IN THE PRESENCE OF NON-PARAMETRIC DYNAMIC UNCERTAINTY Intrnational Journal of Application or Innovation in Enginring & Managmnt (IJAIEM) Wb Sit: www.ijaim.org Email: ditor@ijaim.org Volum 3, Issu, May 4 ISSN 39-4847 FALSE DYNAMIC EIV MODEL IDENTIFICATION

More information

Acceleration of the Smith-Waterman Algorithm using Single and Multiple Graphics Processors

Acceleration of the Smith-Waterman Algorithm using Single and Multiple Graphics Processors Acclration of th Smith-Watrman Algorithm using Singl and Multipl Graphics Procssors Ali Khah-Sad, Stphn Pool and J. Blair Prot Abstract Finding rgions of similarity btwn two vry long data strams is a computationally

More information

Lesson Focus: Finding Equivalent Fractions

Lesson Focus: Finding Equivalent Fractions Lsson Plans: Wk of 1-26-15 M o n Bindrs: /Math;; complt on own, thn chck togthr Basic Fact Practic Topic #10 Lsson #5 Lsson Focus: Finding Equivalnt Fractions *Intractiv Larning/Guidd Practic-togthr in

More information

Lightweight Polymorphic Effects

Lightweight Polymorphic Effects Lightwight Polymorphic Effcts Lukas Rytz, Martin Odrsky, and Philipp Hallr EPFL, Switzrland, {first.last}@pfl.ch Abstract. Typ-and-ffct systms ar a wll-studid approach for rasoning about th computational

More information

Ontology and Context. Isabel Cafezeiro Departamento de Ciência da Computação Universidade Federal Fluminense Niterói - RJ, Brazil

Ontology and Context. Isabel Cafezeiro Departamento de Ciência da Computação Universidade Federal Fluminense Niterói - RJ, Brazil Ontology and Contxt Isabl Cafziro Dpartamnto d Ciência da Computação Univrsidad Fdral Fluminns Nitrói - RJ, Brazil isabl@dcc.ic.uff.br dward Hrmann Hauslr, Alxandr Radmakr Dpartamnto d Informática Pontifícia

More information

CC-RANSAC: Fitting Planes in the Presence of Multiple Surfaces in Range Data

CC-RANSAC: Fitting Planes in the Presence of Multiple Surfaces in Range Data CC-RANSAC: Fitting Plans in th Prsnc of Multipl Surfacs in Rang Data Orazio Gallo, Robrto Manduchi Univrsity of California, Santa Cruz Abbas Rafii Cansta, Inc. Abstract Rang snsors, in particular tim-of-flight

More information

EDI Specifications Guide. 850 Supplier Purchase Order Last Updated February 2017

EDI Specifications Guide. 850 Supplier Purchase Order Last Updated February 2017 EDI Spcifications Guid 850 Supplir Purchas Ordr Last Updatd Fbruary 2017 EDI Spcifications Guid 850 Purchas Ordr - Functional Group=PO VER. 4010 FISHER SCIENTIFIC This Standard contains th format and stablishs

More information

Throughput Parameter Optimization of Adaptive ARQ/HARQ Scheme

Throughput Parameter Optimization of Adaptive ARQ/HARQ Scheme 89 Throughput Paramtr Optimization of Adaptiv ARQ/HARQ Schm Ján Poctavk, Kvtoslava Kotuliaková, Jaroslav Polc, Michal Osadský, Sandra Ondrušová Dpt. of Tlcommunications, Slovak Univrsity of Tchnology Bratislava,

More information

AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES

AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES 1 Bassm HAIDAR, 2 Bilal CHEBARO, 3 Hassan WEHBI 1 Asstt Prof., Dpartmnt of Computr Scincs, Faculty

More information

Misbehavior in Nash Bargaining Solution Allocation

Misbehavior in Nash Bargaining Solution Allocation Misbhavior in Nash Bargaining Solution Allocation Ilya Nikolavskiy, Andry Lukyannko, Andri Gurtov Aalto Univrsity, Finland, firstnam.lastnam@aalto.fi Hlsinki Institut for Information Tchnology, Finland,

More information

Heading-determination using the sensor-fusion based maritime PNT Unit

Heading-determination using the sensor-fusion based maritime PNT Unit Hading-dtrmination using th snsor-fusion basd maritim PN Unit Zhn Dai, Ralf Zibold, Alxandr Born, Evlin Englr Grman Arospac Cntr (DLR) Nustrlitz, Grmany Abstract his papr prsnts th hading dtrmination tchniqu

More information

TRIANGULATION OF NURBS SURFACES. Jamshid Samareh-Abolhassani. 1 Abstract

TRIANGULATION OF NURBS SURFACES. Jamshid Samareh-Abolhassani. 1 Abstract TRIANGULATION OF NURBS SURFACES Jamshid Samarh-Abolhassani 1 Abstract A tchniqu is prsntd for triangulation of NURBS surfacs. This tchniqu is built upon an advancing front tchniqu combind with grid point

More information

Probabilistic inference

Probabilistic inference robabilistic infrnc Suppos th agnt has to mak a dcision about th valu of an unobsrvd qury variabl X givn som obsrvd vidnc E = artially obsrvabl, stochastic, pisodic nvironmnt Eampls: X = {spam, not spam},

More information

EE 231 Fall EE 231 Homework 10 Due November 5, 2010

EE 231 Fall EE 231 Homework 10 Due November 5, 2010 EE 23 Fall 2 EE 23 Homwork Du Novmbr 5, 2. Dsign a synhronous squntial iruit whih gnrats th following squn. (Th squn should rpat itslf.) (a) Draw a stat transition diagram for th iruit. This is a systm

More information

Building a Scanner, Part I

Building a Scanner, Part I COMP 506 Ric Univrsity Spring 2018 Building a Scannr, Part I sourc cod IR Front End Optimizr Back End IR targt cod Copyright 2018, Kith D. Coopr & Linda Torczon, all rights rsrvd. Studnts nrolld in Comp

More information

An Enhanced Keystroke Biometric System and Associated Studies

An Enhanced Keystroke Biometric System and Associated Studies Procings of Stunt-Faculty Rsarch Day, CSIS, Pac Univrsity, May 2 n, 2008 An Enhanc Kystrok Biomtric Systm an Associat Stuis Tarjani Buch, Anra Cotoranu, Eric Jsky, Florin Tihon, Mary Villani Sinbrg School

More information

Understanding Patterns of TCP Connection Usage with Statistical Clustering

Understanding Patterns of TCP Connection Usage with Statistical Clustering Th UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Undrstanding Pattrns of TCP Connction Usag with Statistical Clustring Félix Hrnándz-Campos Kvin Jffay Don Smith Dpartmnt of Computr Scinc Andrw Nobl Dpartmnt

More information

Linked Data meet Sensor Networks

Linked Data meet Sensor Networks Digital Entrpris Rsarch Institut www.dri.i Linkd Data mt Snsor Ntworks Myriam Lggiri DERI NUI Galway, Irland Copyright 2008 Digital Entrpris Rsarch Institut. All rights rsrvd. Linkd Data mt Snsor Ntworks

More information

Lec 20 Error and Loss Control I: Network Coding & Coding for Storage

Lec 20 Error and Loss Control I: Network Coding & Coding for Storage CS/EE 5590 / ENG 40 Spcial Topics 7804, 785, 7803 Lc 20 Error and Loss Control I: Ntwork Coding & Coding for Storag Zhu Li Cours Wb: http://l.wb.umkc.du/lizhu/taching/206sp.vido-communication/main.html

More information

Lecture notes on Chi Square & SAS example demonstration

Lecture notes on Chi Square & SAS example demonstration Analysis of Enumrativ Data (p. 281) Exampls m m m m m m Many xprimnts rsult in numrativ (count) data. This is data that cannot b masurd on a continuous scal. Such data is qualitativ or catgorical data

More information

Keywords-- Digital FIR filter, Differential Evolution algorithm, Magnitude response, Pass band ripples and Stop band ripples.

Keywords-- Digital FIR filter, Differential Evolution algorithm, Magnitude response, Pass band ripples and Stop band ripples. Volum 5, Issu 6, Jun 2015 ISSN: 2277 128X Intrnational Journal of Advancd Rsarch in Computr Scinc and Softwar Enginring Rsarch Papr Availabl onlin at: www.iarcss.com High Pass Digital FIR Filtr Dsign Using

More information

EXTENSION OF RCC TOPOLOGICAL RELATIONS FOR 3D COMPLEX OBJECTS COMPONENTS EXTRACTED FROM 3D LIDAR POINT CLOUDS

EXTENSION OF RCC TOPOLOGICAL RELATIONS FOR 3D COMPLEX OBJECTS COMPONENTS EXTRACTED FROM 3D LIDAR POINT CLOUDS Th Intrnational rchivs of th Photogrammtry, mot Snsing and Spatial Information Scincs, Volum XLI-, 016 XXIII ISPS Congrss, 1 19 July 016, Pragu, Czch public EXTENSION OF CC TOPOLOGICL ELTIONS FO D COMPLEX

More information

Revit Architecture ctu

Revit Architecture ctu h pt r2: Chaptr 2 Rvit Architctur ctu BasicsChaptr2: Bfor you bgin to us Rvit Architctur, you nd to bcom rc familiar with th intrfac, th typs of objcts you will b using to crat your dsigns, P sa and basic

More information

Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction

Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Efficint Obstacl-Avoiding Rctilinar Stinr Tr Construction Chung-Wi Lin, Szu-Yu Chn, Chi-Fng Li, Yao-Wn Chang, and Chia-Lin Yang Graduat Institut of Elctronics Enginring Dpartmnt of Elctrical Enginring

More information

Try it out. The Data Table. Inl~roct More.

Try it out. The Data Table. Inl~roct More. What is JMP? JMP Tutoria! SUGI 15 by John SaIL 199 SAS Imtimt. illustrations from th 1MP Usr's Guid 1989 1MP is dsignd as a statistical visualization tool. IMP's goal is to analyz data in as graphical

More information

Robust and Fault Tolerant Clock Synchronization Nikolaus Kerö, Oregano Systems Aneeq Mahmood, ZISS Thomas Kernen, Cisco Felix Ring, ZISS Tobias

Robust and Fault Tolerant Clock Synchronization Nikolaus Kerö, Oregano Systems Aneeq Mahmood, ZISS Thomas Kernen, Cisco Felix Ring, ZISS Tobias Robust and Fault Tolrant Clock Synchronization Nikolaus Krö, Organo Systms Anq Mahmood, ZISS Thomas Krnn, Cisco Flix Ring, ZISS Tobias Müllr, Organo Systms Thomas Biglr, ZISS Rational Common notion of

More information

Design Methodologies and Tools

Design Methodologies and Tools Dsign Mthodologis and Tools Dsign styls Full-custom dsign Standard-cll dsign Programmabl logic Gat arrays and fild-programmabl gat arrays (FPGAs) Sa of gats Systm-on-a-chip (mbddd cors) Dsign tools 1 Full-Custom

More information

An Architecture for Hierarchical Collision Detection

An Architecture for Hierarchical Collision Detection An Architctur for Hirarchical Collision Dtction Gabril Zachmann Computr Graphics, Informatik II Univrsity of Bonn mail: zach@cs.uni-bonn.d Güntr Knittl WSI/GRIS Univrsity of Tübingn mail: knittl@gris.uni-tubingn.d

More information

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION 03-4 Sub : Informatics Practics (065) Tim allowd : 3 hours Maximum Marks : 70 Instruction : (i) All qustions ar compulsory

More information

Mechanism and Machine Theory

Mechanism and Machine Theory Mchanism and Machin Thory 5 (202) 95 26 Contnts lists availal at SciVrs ScincDirct Mchanism and Machin Thory journal hompag: www.lsvir.com/locat/mchmt An invstigation on stiffnss of a 3-PSP spatial paralll

More information

Space Subdivision Algorithms for Ray Tracing

Space Subdivision Algorithms for Ray Tracing Spac Subdivision Algorithms for Ray Tracing by David MacDonald A thsis prsntd to th Univrsity of Watrloo in fulfillmnt of th thsis rquirmnt for th dgr of Mastr of Mathmatics in Computr Scinc Watrloo, Ontario,

More information

Performance Analysis of IEEE MAC Protocol with Different ACK Polices

Performance Analysis of IEEE MAC Protocol with Different ACK Polices Prformanc Analysis of IEEE 82.15.3 MAC Protocol with Diffrnt Polics S. Mhta and K.S. Kwak Wirlss Communications Rsarch Cntr, Inha Univrsity, Kora suryanand.m@gmail.com Abstract. h wirlss prsonal ara ntwork

More information

LAB1: DMVPN Theory. DMVPN Theory. Disclaimer. Pag e

LAB1: DMVPN Theory. DMVPN Theory. Disclaimer. Pag e LAB1: DMVPN Thory Disclaimr This Configuration Guid is dsignd to assist mmbrs to nhanc thir skills in rspctiv tchnology ara. Whil vry ffort has bn mad to nsur that all matrial is as complt and accurat

More information

QuickBird files are courtesy of DigitalGlobe and may not be reproduced without explicit permission from DigitalGlobe.

QuickBird files are courtesy of DigitalGlobe and may not be reproduced without explicit permission from DigitalGlobe. Calibrating Imags Tutorial In this tutorial, you will calibrat a QuickBird Lvl-1 imag to spctral radianc and rflctanc whil larning about th various mtadata filds that ENVI uss to prform calibration. Fils

More information

Lec 20 Error and Loss Control II: Network Coding & Coding for Storage

Lec 20 Error and Loss Control II: Network Coding & Coding for Storage Multimdia Communication Lc 20 Error and Loss Control II: Ntwork Coding & Coding for Storag Zhu Li Cours Wb: http://l.wb.umkc.du/lizhu/ Z. Li, Multimdia Communciation, Spring 207 p. Outlin RCap Lctur 9

More information

2018 How to Apply. Application Guide. BrandAdvantage

2018 How to Apply. Application Guide. BrandAdvantage 2018 How to Apply Application Guid BrandAdvantag Contnts Accssing th Grant Sit... 3 Wlcom pag... 3 Logging in To Pub Charity... 4 Rgistration for Nw Applicants ( rgistr now )... 5 Organisation Rgistration...

More information

FLASHING CHRISTMAS TREE KIT

FLASHING CHRISTMAS TREE KIT R4 FLASHING CHRISTMAS TREE KIT 9 10 8 7 11 6 R3 12 T4 C4 5 T3 R5 R7 13 C3 C2 4 14 R1 T2 R6 3 OWNER S MANUAL T1 R8 15 2 C1 R2 1 16 Cat. No. 277-8001 CUSTOM MANUFACTURED FOR TANDY CORPORATION LTD ASSEMBLY

More information

Diverse Routing in Multi-Domain Optical Networks With Correlated and Probabilistic Multi-Failures

Diverse Routing in Multi-Domain Optical Networks With Correlated and Probabilistic Multi-Failures Divrs Routing in Multi-Domain Optical Ntworks With Corrlatd and Probabilistic Multi-Failurs F. Xu 1, N. Min-Allah, S. Khan 3, N. Ghani 1 1 Univrsity of Nw Mxico, COMSATS Institut of Information Tchnology,

More information

running at 133 MHz bus. A Pentium III 1.26GHz with 512K cache running at 133 MHz bus is an available option. Fits Your Needs

running at 133 MHz bus. A Pentium III 1.26GHz with 512K cache running at 133 MHz bus is an available option. Fits Your Needs 3715 Industrial PCs 15.0" LCD Flat Panl Display DS-371500(E) Xycom Automation's nwst gnration of Industrial PCs is dsignd and tstd for th tough nvironmnts rquird for plant floor us. Our standard PC configurations

More information

Motivation. Synthetic OOD concepts and reuse Lecture 4: Separation of concerns. Problem. Solution. Deleting composites that share parts. Or is it?

Motivation. Synthetic OOD concepts and reuse Lecture 4: Separation of concerns. Problem. Solution. Deleting composites that share parts. Or is it? Synthtic OOD concpts and rus Lctur 4: Sparation of concrns Topics: Complx concrn: Mmory managmnt Exampl: Complx oprations on composit structurs Problm: Mmory laks Solution: Rfrnc counting Motivation Suppos

More information

An Auto-tuned Method for Solving Large Tridiagonal Systems on the GPU

An Auto-tuned Method for Solving Large Tridiagonal Systems on the GPU An Auto-tund Mthod for Solving Larg Tridiagonal Systms on th GPU Andrw Davidson Univrsity of California, Davis aaldavidson@ucdavis.du Yao Zhang Univrsity of California, Davis yaozhang@ucdavis.du John D.

More information

Electronic Supplementary Materials. Contents. Tag Data

Electronic Supplementary Materials. Contents. Tag Data Elctronic Supplmntary Matrials For th manuscript: Titl: First dirct masurmnts of bhavioural rsponss by Cuvir s bakd whals to mid-frquncy activ (MFA) sonar [Short Titl: Ziphius rspons to MFA sonar] Authors:

More information

I - Pre Board Examination

I - Pre Board Examination Cod No: S-080 () Total Pags: 06 KENDRIYA VIDYALAYA SANGATHAN,GUWHATI REGION I - Pr Board Examination - 04-5 Subjct Informatics Practics (Thory) Class - XII Tim: 3 hours Maximum Marks : 70 Instruction :

More information

Base Schedule Aggregation Portal (BSAP) Interface Specification for BSAP Services

Base Schedule Aggregation Portal (BSAP) Interface Specification for BSAP Services Bas Schdul Aggrgation Portal (BSAP) Intrfac Spcification for BSAP Srvics (Businss Ruls v 9.x(Fall 2017) or latr) Vrsion: 1.3 Dcmbr 19, 2017 Rvision History Dat Vrsion By Dscription 12/19/2017 1.3 WT Additional

More information

Reliability Coordinator Base Schedule Aggregation Portal (RC BSAP) Interface Specification for RC BSAP Services

Reliability Coordinator Base Schedule Aggregation Portal (RC BSAP) Interface Specification for RC BSAP Services Rliability Coordinator Bas Schdul Aggrgation Portal (RC BSAP) Intrfac Spcification for RC BSAP Srvics (Businss Ruls v 10.x(Spring 2019) or latr) Vrsion: 1.1 vmbr 6, 2018 Rvision History Dat Vrsion By Dscription

More information

Between Testing and Formal Verification

Between Testing and Formal Verification Btwn Tsting and Formal Vrification Jan Tobias Mühlbrg jantobias.muhlbrg@cs.kuluvn.b imc-distrint, KU Luvn, Clstijnnlaan 200A, B-3001 Blgium ScAppDv, Luvn, March 2017 1 /19 Jan Tobias Mühlbrg Btwn Tsting

More information

Group 2 Mega Crystals Usability Test Report

Group 2 Mega Crystals Usability Test Report Group 2 Mga Crystals Usability Tst Rport Rport Writtn By Katrina Ellis Tam Mmbrs Usr Exprinc Consultants Katrina Ellis Zhitao Qiu HU4628 Julia Wiss Sarah Ingold Jams Staplton CS4760 Kris Gauthir (Android)

More information

Whitepaper: IEEE P1687 Internal JTAG (IJTAG) taps into embedded instrumentation

Whitepaper: IEEE P1687 Internal JTAG (IJTAG) taps into embedded instrumentation Whitpapr: IEEE P1687 Intrnal JAG (IJAG) taps into mbddd instrumntation By Al Crouch Chif chnologist, Cor Instrumntation ASSE Intrch Co-Chairman, IEEE P1687 IJAG Standard Working Group ASSE Intrch, Inc.

More information