Algorithm - PowerPoint PPT Presentation

1 / 2
About This Presentation
Title:

Algorithm

Description:

Remove all the muon tracks, and K tracks (used ... If no candidates are available, B candidate is 'untagged' ... Extract yield for each case and do arithmatic ... – PowerPoint PPT presentation

Number of Views:41
Avg rating:3.0/5.0
Slides: 3
Provided by: stude1022
Category:

less

Transcript and Presenter's Notes

Title: Algorithm


1
Algorithm
  • Candidate tag track selection
  • Choose all tracks which are inside dR lt 0.7 cone
    around B-meson direction
  • Remove all the muon tracks, and K? tracks (used
    to make B? vertex
  • Apply track quality cut, i.e. track must have at
    least 2 SMT and 3 CFT hits
  • If no candidates are available, B candidate is
    untagged
  • Among candidate tracks, select track with e.g.
    highest pT
  • Returning the charge of the tagged track, say Qt
  • If Qt -QK ? correctly tagged B
  • If Qt QK ? wrong tagged B
  • Extract yield for each case and do arithmatic
  • Fill B mass histograms for all Bs, untagged,
    correct tags and wrong tags
  • Fit all Bs histogram to get NT use B mass and s
    from this for other fits
  • Fit other 3 plots to get NU, NC and NW,
    respectively
  • Dilution(D) (NC NW) / (NC NW)
  • Efficiency(?) 1-(NU/ NT)
  • Tagging Power(TP) ?D2

2
Same Side Tagging Results for B? J/? K
  • Using a cone size of 0.7 in dhxdf
  • Tag method selection highest pT track in cone
  • Efficiency 79.2 ? 2.1
  • Dilution 26.4 ? 4.8
  • eD2 5.5 ? 2.0
Write a Comment
User Comments (0)
About PowerShow.com