Interstring Geometry [2006]

Flasher Data

Global fit[A]

Global fit[B]

Global fit[C]

Global fit[A+]

This is exactly same as Global fit[A]. But now it takes only subset of all avaialble string pairs. The total number of string pairs (flashing and receiving strings) is found to be 92. The number of string pairs is randomly chosen, and the chosen number of string pairs are randomly selected. Then Global fit[A] is done for those selected string pairs. This procedure has been done ~300 times. Distributions of the depth shift relative to the nominal depth in the DB are shown below for the strings deployed in 2005/2006.

String # Mean [m]Sigma [m]
21 -0.2 0.1
29 1.7 0.1
30 -0.2 0.2
38 0.3 0.1
40 -0.7 0.1
49 -0.2 0.1
50 0.2 0.2
59 0.0 0.3