Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Bernoulli AASs AASc Poisson PPT

m
1X N X X yk tX X yki
t̂π = yk t̂π = yk t̂p = N ȳSr t̂π = t̂p =
π n πk m i=1 xki
k∈S k∈S m k∈S
1 X
2
  X xk
1 N  ȳSr = ȳS = yki
X X 1
n 2 tX = xk ; p k =
V ar(t̂π ) = −1 yk 2 V ar(t̂π ) = 1− SyU m i=1 V ar(t̂π ) = − 1 yk2 tX
π n N πk k∈U
k∈U k∈U
 1 X N N  2
(yk − ȳU )2 V ar(t̂p ) = (N − 1)Sy2U  2
1 1 1 X yk
X
Sy2U = m X yk
V ar(t̂π ) =
d −1 yk 2 N −1 ar(t̂π ) =
Vd (1 − πk ) V ar(t̂p ) = pk − ty
π π k∈U m pk
k∈S N πk k=1
1 X k∈S
N2  n 2 Sy2U = (yk − ȳN )2 m  2
Vdar(t̂π ) = 1− SyS N −1 1 X yki
n N k=1 ar(t̂p ) =
Vd − t̂p
1 X m2 − m i=1 pki
Sy2S = (yk − ȳS )2 N2 2
n−1 Vdar(t̂p ) = S
k∈S m ySr
n − nk m
ck = 1 X
N −k+1 Sy2Sr = (yki − ȳSr )2
m − 1 i=1

AS AS Estratificado Conglomerado
X H
X X ty
i
t̂π = a.tSr ; tSr = yk V ar(t̂π ) = t̂y = t̂ySh tˆπ =
 a πIi
k∈Sr  X 2 h=1 i∈SI
a

 = a tSr − t̄
 H X X tyi tyj
1 1X 1 X 
 r=1 X
V ar(tˆπ ) = ∆Iij . .
a
t̄ = ty = yk = tSr 

 X V ar(t̂y ) = V ar(t̂ySh ) πIi πIj
a a a r=1
 i∈UI j∈UI
k∈U

 = Nn (ȳSr − ȳU )2 = N.SCE h=1

n SCD r=1   H
X X ∆Iij ty tyj
ρ=1− .


 N −1 X ar(tˆπ ) =
Vd . i.
n − 1 SCT 

 = V arAASs (t̂π ). .[1 + (n − 1)p] ar(t̂y ) =
Vd Vd
ar(t̂ySh ) πIij πIi πIj
i∈UI j∈UI
h=1

 N − n 
N − 1 SCD 
 N (n − 1) ∆Iij = πIij − πIi .πIj
δ =1− . 
 = V arAASs (t̂π ). 1 + .δ - Alocação por estrato
N − a SCT N −n
SCT N2  n 2 n
Sy2U = Vdar(t̂π ) = 1− nh =
N −1 n N
SySr H
X
(yk − ȳU )2 = - Algoritmo de Seleção Nh
nh = n.
k∈U  N
N n + 1, se r ≤ c
a N= .a + c ; n(s) = txk
X
a X X a n, se c < r ≤ a nh = n.
= (yk − ȳSr )2 + n. (ȳSr − ȳU )2 tX
r=1 k∈Sr r=1 Sr = {k; k = r + (j − 1).a ≤ N, j = 1, ..., n(a)}
Nh .Sh .Uh
SCT = SCD + SCE MIF1: k − 1 < uj = u + (j − 1).a ≤ k nh = n. H
X
- Algoritmo de Seleção ASC Nh .Sh .Uh
MIF2: (k − 1).n < rj = r + (j − 1).N ≤ k.n
 h=1
cj , se cj ≤ N
k=
cj − N, se cj > N ≤ a
cj = r + (j − 1).a, j = 1, ..., n

You might also like