10 - H1 - Desy
10 - H1 - Desy
10 - H1 - Desy
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
8.2 Unfolding application <strong>10</strong>5<br />
8.2.1.3 Background bins<br />
Every single Reconstructed bin and Side bin in real data contains an a priori unknown<br />
fraction of background (see chapter 6). Migration matrix definition includes one<br />
Background bin defined on the Output direction for each of the Input bins. In the<br />
example of figure 8.2, there are eight Background bins corresponding to six Reconstructed<br />
Bins and two Side bins. Due to special usage of the discriminator, there is<br />
a high correlation between Background bins and the lower discriminator bins of the<br />
corresponding Input bins. Signal bins and Migration bins couple to the high discriminator<br />
values, so adding Background bins does not introduce any ambiguity to the<br />
unfolding problem.<br />
8.2.2 Selection efficiency correction<br />
Events generated in the studied phase space, but not fulfilling the selection criteria are<br />
accommodated in a special underflow bin of the migration matrix. For every Signal bin<br />
the efficiency correction factor is defined as a ratio between the sum of weights of all<br />
the events generated in the particular Signal bin to the sum of weights of the events<br />
reconstructed either in one of the Reconstructed bins or in one of the Side bins. After<br />
the calculation of the output vector, the solution is appropriately corrected.<br />
The trigger efficiency correction needs a special treatment, as the MC simulation differs<br />
in this respect significantly from the measured one in data. The correction factor w Trigger ,<br />
defined with the equation 4.4 is used to artificially decrease the simulated trigger efficiency.<br />
For each MC event the original event weight w is modified according to the formula:<br />
w ′ = w · w Trigger . Such modified w ′ weight is used to fill the migration matrix. In the<br />
same time, the corresponding underflow bin, responsible for the detector inefficiency is<br />
filled using the weight w ′′ = w ·(1 −w Trigger ). Since w ′ +w ′′ = w, and taking into account<br />
that the detector inefficiency bin does not participate directly in the unfolding procedure,<br />
the second paradigm holds and the unambiguity of the solution is preserved.<br />
The final migration matrix A is normalised in a following way:<br />
∑<br />
A ij = 1, (8.15)<br />
i<br />
where the sum runs over every Input bin i and the independent normalisation is performed<br />
for every Output bin j.<br />
8.2.3 Regularisation<br />
The multidimensional output binning prevents the usage of the derivative or curvature<br />
regularisation schemes, as neighboring bins should not always remain connected. For<br />
example the highest E γ T bin stays next to the lowest Eγ T bin of the next ηγ bin. Therefore,<br />
this analysis is using the regularisation on the size of the output. As explained earlier,<br />
the only applicable regularisation parameter τ choice method is the L-curve method (see