Preliminary Results 3

From BemlarGroup

2008/05/04

Great Circle distance is used to obtain distance between two points on sphere. Areas are computed by 2-D Approximattion, since Annie had not got the 3-D polygon implementation completed at this moment.

854 cases were extracted from 26973 cases. So far, all my tests are still based on rectangle regions. One big region is selected:

rectangle area:

Minimum Longitude = 69.99999
Maximum Longitude = 110.00001
Minimum Latitude  = 20.00001
Maximum Latitude  = 50.00001

In side the above big region, 4 smaller regions are selected and allowed to have different background rates. Events in one different region may affect those in another, based on the implementation of Veen's algorithm (in statistical tool R).

--------------------------------
(70.99999, 34.99999)
(75.00001, 34.99999)
(75.00001, 39.00001)
(70.99999, 39.00001)
--------------------------------
(90.99999, 20.99999)
(95.00001, 20.99999)
(95.00001, 25.00001)
(90.99999, 25.00001)
--------------------------------
(89.99999, 31.99999)
(93.00001, 31.99999)
(93.00001, 36.00001)
(89.99999, 36.00001)
--------------------------------
(99.99999, 20.99999)
(110.00001, 20.99999)
(110.00001, 29.00001)
(99.99999, 29.00001)
--------------------------------

Number of iterations = 133

Final Result:

a = 0.9430167613085361
c = 9.517218168173509
d = 0.02558352443069646
k = 4.842648158998489E-4
p = 1.4275688519710887
q = 1.5433257007980803
m[0] = 2.045521894435866E-5
m[1] = 1.6961580139000375E-4
m[2] = 2.583122257097742E-4
m[3] = 9.775766562632185E-5
m[4] = 2.172266593415317E-5

m[0]: estimated background rate of the "big region."

m[1] -- m[4]: estimated background rate of the 4 smaller regions inside.