[b443089] | 1 | /*
|
---|
| 2 | * Delphes: a framework for fast simulation of a generic collider experiment
|
---|
| 3 | * Copyright (C) 2012-2014 Universite catholique de Louvain (UCL), Belgium
|
---|
[1fa50c2] | 4 | *
|
---|
[b443089] | 5 | * This program is free software: you can redistribute it and/or modify
|
---|
| 6 | * it under the terms of the GNU General Public License as published by
|
---|
| 7 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 8 | * (at your option) any later version.
|
---|
[1fa50c2] | 9 | *
|
---|
[b443089] | 10 | * This program is distributed in the hope that it will be useful,
|
---|
| 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 13 | * GNU General Public License for more details.
|
---|
[1fa50c2] | 14 | *
|
---|
[b443089] | 15 | * You should have received a copy of the GNU General Public License
|
---|
| 16 | * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 17 | */
|
---|
| 18 |
|
---|
[a0431dc] | 19 |
|
---|
| 20 | /** \class TrackCountingBTagging
|
---|
| 21 | *
|
---|
[e4c3fef] | 22 | * b-tagging algorithm based on counting tracks with large impact parameter
|
---|
[a0431dc] | 23 | *
|
---|
| 24 | * \author M. Selvaggi - UCL, Louvain-la-Neuve
|
---|
| 25 | *
|
---|
| 26 | */
|
---|
| 27 |
|
---|
| 28 | #include "modules/TrackCountingBTagging.h"
|
---|
| 29 |
|
---|
| 30 | #include "classes/DelphesClasses.h"
|
---|
| 31 | #include "classes/DelphesFactory.h"
|
---|
| 32 | #include "classes/DelphesFormula.h"
|
---|
| 33 |
|
---|
| 34 | #include "TMath.h"
|
---|
| 35 | #include "TString.h"
|
---|
| 36 | #include "TFormula.h"
|
---|
| 37 | #include "TRandom3.h"
|
---|
| 38 | #include "TObjArray.h"
|
---|
| 39 | #include "TLorentzVector.h"
|
---|
| 40 |
|
---|
[e4c3fef] | 41 | #include <algorithm>
|
---|
[a0431dc] | 42 | #include <stdexcept>
|
---|
| 43 | #include <iostream>
|
---|
| 44 | #include <sstream>
|
---|
| 45 |
|
---|
| 46 | using namespace std;
|
---|
| 47 |
|
---|
| 48 | //------------------------------------------------------------------------------
|
---|
| 49 |
|
---|
| 50 | TrackCountingBTagging::TrackCountingBTagging() :
|
---|
| 51 | fItTrackInputArray(0), fItJetInputArray(0)
|
---|
| 52 | {
|
---|
| 53 | }
|
---|
| 54 |
|
---|
| 55 | //------------------------------------------------------------------------------
|
---|
| 56 |
|
---|
| 57 | TrackCountingBTagging::~TrackCountingBTagging()
|
---|
| 58 | {
|
---|
| 59 | }
|
---|
| 60 |
|
---|
| 61 | //------------------------------------------------------------------------------
|
---|
| 62 |
|
---|
| 63 | void TrackCountingBTagging::Init()
|
---|
| 64 | {
|
---|
| 65 | fBitNumber = GetInt("BitNumber", 0);
|
---|
[e4c3fef] | 66 |
|
---|
[6cdc544] | 67 | fPtMin = GetDouble("TrackPtMin", 1.0);
|
---|
| 68 | fDeltaR = GetDouble("DeltaR", 0.3);
|
---|
| 69 | fIPmax = GetDouble("TrackIPMax", 2.0);
|
---|
[e4c3fef] | 70 |
|
---|
[6cdc544] | 71 | fSigMin = GetDouble("SigMin", 6.5);
|
---|
| 72 | fNtracks = GetInt("Ntracks", 3);
|
---|
[e4c3fef] | 73 |
|
---|
[a0431dc] | 74 | // import input array(s)
|
---|
| 75 |
|
---|
| 76 | fTrackInputArray = ImportArray(GetString("TrackInputArray", "Calorimeter/eflowTracks"));
|
---|
| 77 | fItTrackInputArray = fTrackInputArray->MakeIterator();
|
---|
[e4c3fef] | 78 |
|
---|
[a0431dc] | 79 | fJetInputArray = ImportArray(GetString("JetInputArray", "FastJetFinder/jets"));
|
---|
| 80 | fItJetInputArray = fJetInputArray->MakeIterator();
|
---|
| 81 | }
|
---|
| 82 |
|
---|
| 83 | //------------------------------------------------------------------------------
|
---|
| 84 |
|
---|
| 85 | void TrackCountingBTagging::Finish()
|
---|
| 86 | {
|
---|
| 87 | if(fItTrackInputArray) delete fItTrackInputArray;
|
---|
| 88 | if(fItJetInputArray) delete fItJetInputArray;
|
---|
| 89 | }
|
---|
| 90 |
|
---|
| 91 | //------------------------------------------------------------------------------
|
---|
| 92 |
|
---|
| 93 | void TrackCountingBTagging::Process()
|
---|
| 94 | {
|
---|
| 95 | Candidate *jet, *track;
|
---|
[e4c3fef] | 96 |
|
---|
[a0431dc] | 97 | Double_t jpx, jpy;
|
---|
[1dad056] | 98 | Double_t dr, tpt;
|
---|
[632da30] | 99 | Double_t xd, yd, d0, dd0, ip, sip;
|
---|
[e4c3fef] | 100 |
|
---|
[a0431dc] | 101 | Int_t sign;
|
---|
[e4c3fef] | 102 |
|
---|
[a0431dc] | 103 | Int_t count;
|
---|
[e4c3fef] | 104 |
|
---|
[a0431dc] | 105 | // loop over all input jets
|
---|
| 106 | fItJetInputArray->Reset();
|
---|
| 107 | while((jet = static_cast<Candidate*>(fItJetInputArray->Next())))
|
---|
| 108 | {
|
---|
| 109 | const TLorentzVector &jetMomentum = jet->Momentum;
|
---|
| 110 | jpx = jetMomentum.Px();
|
---|
| 111 | jpy = jetMomentum.Py();
|
---|
[e4c3fef] | 112 |
|
---|
[a0431dc] | 113 | // loop over all input tracks
|
---|
| 114 | fItTrackInputArray->Reset();
|
---|
| 115 | count = 0;
|
---|
| 116 | while((track = static_cast<Candidate*>(fItTrackInputArray->Next())))
|
---|
| 117 | {
|
---|
[e4c3fef] | 118 | const TLorentzVector &trkMomentum = track->Momentum;
|
---|
[1dad056] | 119 |
|
---|
[e4c3fef] | 120 | dr = jetMomentum.DeltaR(trkMomentum);
|
---|
[1dad056] | 121 | tpt = trkMomentum.Pt();
|
---|
[6cdc544] | 122 | xd = track->Xd;
|
---|
| 123 | yd = track->Yd;
|
---|
[632da30] | 124 | d0 = TMath::Hypot(xd, yd);
|
---|
| 125 | dd0 = track->ErrorD0;
|
---|
[e4c3fef] | 126 |
|
---|
| 127 | if(tpt < fPtMin) continue;
|
---|
[6cdc544] | 128 | if(dr > fDeltaR) continue;
|
---|
[632da30] | 129 | if(d0 > fIPmax) continue;
|
---|
[e4c3fef] | 130 |
|
---|
[6cdc544] | 131 | sign = (jpx*xd + jpy*yd > 0.0) ? 1 : -1;
|
---|
[e4c3fef] | 132 |
|
---|
[632da30] | 133 | ip = sign*d0;
|
---|
| 134 | sip = ip / TMath::Abs(dd0);
|
---|
[e4c3fef] | 135 |
|
---|
| 136 | if(sip > fSigMin) count++;
|
---|
[a0431dc] | 137 | }
|
---|
[e4c3fef] | 138 |
|
---|
[a0431dc] | 139 | // set BTag flag to true if count >= Ntracks
|
---|
[e4c3fef] | 140 | jet->BTag |= (count >= fNtracks) << fBitNumber;
|
---|
[a0431dc] | 141 | }
|
---|
| 142 | }
|
---|
| 143 |
|
---|
| 144 | //------------------------------------------------------------------------------
|
---|