[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 |
|
---|
[d7d2da3] | 19 | /** \class PileUpMerger
|
---|
| 20 | *
|
---|
| 21 | * Merges particles from pile-up sample into event
|
---|
| 22 | *
|
---|
| 23 | * \author M. Selvaggi - UCL, Louvain-la-Neuve
|
---|
| 24 | *
|
---|
| 25 | */
|
---|
| 26 |
|
---|
| 27 | #include "modules/PileUpMerger.h"
|
---|
| 28 |
|
---|
| 29 | #include "classes/DelphesClasses.h"
|
---|
| 30 | #include "classes/DelphesFactory.h"
|
---|
[22dc7fd] | 31 | #include "classes/DelphesTF2.h"
|
---|
[d7d2da3] | 32 | #include "classes/DelphesPileUpReader.h"
|
---|
| 33 |
|
---|
| 34 | #include "ExRootAnalysis/ExRootResult.h"
|
---|
| 35 | #include "ExRootAnalysis/ExRootFilter.h"
|
---|
| 36 | #include "ExRootAnalysis/ExRootClassifier.h"
|
---|
| 37 |
|
---|
| 38 | #include "TMath.h"
|
---|
| 39 | #include "TString.h"
|
---|
| 40 | #include "TFormula.h"
|
---|
| 41 | #include "TRandom3.h"
|
---|
| 42 | #include "TObjArray.h"
|
---|
| 43 | #include "TDatabasePDG.h"
|
---|
| 44 | #include "TLorentzVector.h"
|
---|
| 45 |
|
---|
| 46 | #include <algorithm>
|
---|
| 47 | #include <stdexcept>
|
---|
| 48 | #include <iostream>
|
---|
| 49 | #include <sstream>
|
---|
| 50 |
|
---|
| 51 | using namespace std;
|
---|
| 52 |
|
---|
| 53 | //------------------------------------------------------------------------------
|
---|
| 54 |
|
---|
| 55 | PileUpMerger::PileUpMerger() :
|
---|
[22dc7fd] | 56 | fFunction(0), fReader(0), fItInputArray(0)
|
---|
[d7d2da3] | 57 | {
|
---|
[22dc7fd] | 58 | fFunction = new DelphesTF2;
|
---|
[d7d2da3] | 59 | }
|
---|
| 60 |
|
---|
[22dc7fd] | 61 |
|
---|
[d7d2da3] | 62 | //------------------------------------------------------------------------------
|
---|
| 63 |
|
---|
| 64 | PileUpMerger::~PileUpMerger()
|
---|
| 65 | {
|
---|
[22dc7fd] | 66 | delete fFunction;
|
---|
[d7d2da3] | 67 | }
|
---|
| 68 |
|
---|
| 69 | //------------------------------------------------------------------------------
|
---|
| 70 |
|
---|
| 71 | void PileUpMerger::Init()
|
---|
| 72 | {
|
---|
| 73 | const char *fileName;
|
---|
| 74 |
|
---|
[76d3973] | 75 | fPileUpDistribution = GetInt("PileUpDistribution", 0);
|
---|
| 76 |
|
---|
[d7d2da3] | 77 | fMeanPileUp = GetDouble("MeanPileUp", 10);
|
---|
[0ed696f] | 78 |
|
---|
[22dc7fd] | 79 | fZVertexSpread = GetDouble("ZVertexSpread", 0.15);
|
---|
| 80 | fTVertexSpread = GetDouble("TVertexSpread", 1.5E-09);
|
---|
| 81 |
|
---|
[2d494a6] | 82 | fInputBeamSpotX = GetDouble("InputBeamSpotX", 0.0);
|
---|
| 83 | fInputBeamSpotY = GetDouble("InputBeamSpotY", 0.0);
|
---|
| 84 | fOutputBeamSpotX = GetDouble("OutputBeamSpotX", 0.0);
|
---|
| 85 | fOutputBeamSpotY = GetDouble("OutputBeamSpotY", 0.0);
|
---|
| 86 |
|
---|
[22dc7fd] | 87 | // read vertex smearing formula
|
---|
[0ed696f] | 88 |
|
---|
[22dc7fd] | 89 | fFunction->Compile(GetString("VertexDistributionFormula", "0.0"));
|
---|
[0ed696f] | 90 | fFunction->SetRange(-fZVertexSpread, -fTVertexSpread, fZVertexSpread, fTVertexSpread);
|
---|
| 91 |
|
---|
[d7d2da3] | 92 | fileName = GetString("PileUpFile", "MinBias.pileup");
|
---|
| 93 | fReader = new DelphesPileUpReader(fileName);
|
---|
| 94 |
|
---|
| 95 | // import input array
|
---|
| 96 | fInputArray = ImportArray(GetString("InputArray", "Delphes/stableParticles"));
|
---|
| 97 | fItInputArray = fInputArray->MakeIterator();
|
---|
| 98 |
|
---|
| 99 | // create output arrays
|
---|
[d07e957] | 100 | fParticleOutputArray = ExportArray(GetString("ParticleOutputArray", "stableParticles"));
|
---|
| 101 | fVertexOutputArray = ExportArray(GetString("VertexOutputArray", "vertices"));
|
---|
[d7d2da3] | 102 | }
|
---|
| 103 |
|
---|
| 104 | //------------------------------------------------------------------------------
|
---|
| 105 |
|
---|
| 106 | void PileUpMerger::Finish()
|
---|
| 107 | {
|
---|
| 108 | if(fReader) delete fReader;
|
---|
| 109 | }
|
---|
| 110 |
|
---|
| 111 | //------------------------------------------------------------------------------
|
---|
| 112 |
|
---|
| 113 | void PileUpMerger::Process()
|
---|
| 114 | {
|
---|
| 115 | TDatabasePDG *pdg = TDatabasePDG::Instance();
|
---|
| 116 | TParticlePDG *pdgParticle;
|
---|
[2118a6a] | 117 | Int_t pid, nch, nvtx = -1;
|
---|
[8d601b7] | 118 | Float_t x, y, z, t, vx, vy;
|
---|
[2118a6a] | 119 | Float_t px, py, pz, e, pt;
|
---|
[50edcdbf] | 120 | Double_t dz, dphi, dt, sumpt2, dz0, dt0;
|
---|
[2d494a6] | 121 | Int_t numberOfEvents, event, numberOfParticles;
|
---|
[d7d2da3] | 122 | Long64_t allEntries, entry;
|
---|
[2d494a6] | 123 | Candidate *candidate, *vertex;
|
---|
[d7d2da3] | 124 | DelphesFactory *factory;
|
---|
[0ed696f] | 125 |
|
---|
[22dc7fd] | 126 | const Double_t c_light = 2.99792458E8;
|
---|
[d7d2da3] | 127 |
|
---|
| 128 | fItInputArray->Reset();
|
---|
[0ed696f] | 129 |
|
---|
[2d494a6] | 130 | // --- Deal with primary vertex first ------
|
---|
[0ed696f] | 131 |
|
---|
| 132 | fFunction->GetRandom2(dz, dt);
|
---|
| 133 |
|
---|
[50edcdbf] | 134 | dz0 = -1.0e6;
|
---|
| 135 | dt0 = -1.0e6;
|
---|
[8d601b7] | 136 |
|
---|
[0ed696f] | 137 | dt *= c_light*1.0E3; // necessary in order to make t in mm/c
|
---|
| 138 | dz *= 1.0E3; // necessary in order to make z in mm
|
---|
[50edcdbf] | 139 |
|
---|
[8d601b7] | 140 | //cout<<dz<<","<<dt<<endl;
|
---|
| 141 |
|
---|
[2d494a6] | 142 | vx = 0.0;
|
---|
| 143 | vy = 0.0;
|
---|
[6fbd089] | 144 |
|
---|
[2d494a6] | 145 | numberOfParticles = fInputArray->GetEntriesFast();
|
---|
[2118a6a] | 146 | nch = 0;
|
---|
| 147 | sumpt2 = 0.0;
|
---|
[8d601b7] | 148 |
|
---|
[d7d2da3] | 149 | while((candidate = static_cast<Candidate*>(fItInputArray->Next())))
|
---|
| 150 | {
|
---|
[2d494a6] | 151 | vx += candidate->Position.X();
|
---|
| 152 | vy += candidate->Position.Y();
|
---|
[00078bc] | 153 | z = candidate->Position.Z();
|
---|
| 154 | t = candidate->Position.T();
|
---|
[2118a6a] | 155 | pt = candidate->Momentum.Pt();
|
---|
[8d601b7] | 156 |
|
---|
[50edcdbf] | 157 | // take postion and time from first stable particle
|
---|
| 158 | if (dz0 < -999999.0)
|
---|
| 159 | dz0 = z;
|
---|
| 160 | if (dt0 < -999999.0)
|
---|
| 161 | dt0 = t;
|
---|
| 162 |
|
---|
| 163 | // cancel any possible offset in position and time the input file
|
---|
| 164 | candidate->Position.SetZ(z - dz0 + dz);
|
---|
| 165 | candidate->Position.SetT(t - dt0 + dt);
|
---|
| 166 |
|
---|
[d07e957] | 167 | fParticleOutputArray->Add(candidate);
|
---|
[2118a6a] | 168 |
|
---|
| 169 | if(TMath::Abs(candidate->Charge) > 1.0E-9)
|
---|
| 170 | {
|
---|
| 171 | nch++;
|
---|
| 172 | sumpt2 += pt*pt;
|
---|
| 173 | }
|
---|
[d7d2da3] | 174 | }
|
---|
[8d601b7] | 175 |
|
---|
[2d494a6] | 176 | if(numberOfParticles > 0)
|
---|
| 177 | {
|
---|
[8d601b7] | 178 | vx /= sumpt2;
|
---|
| 179 | vy /= sumpt2;
|
---|
[2d494a6] | 180 | }
|
---|
[8d601b7] | 181 |
|
---|
[2118a6a] | 182 | nvtx++;
|
---|
[d7d2da3] | 183 | factory = GetFactory();
|
---|
[0ed696f] | 184 |
|
---|
[2d494a6] | 185 | vertex = factory->NewCandidate();
|
---|
[8d601b7] | 186 | vertex->Position.SetXYZT(vx, vy, dz, dt);
|
---|
[2118a6a] | 187 | vertex->ClusterIndex = nvtx;
|
---|
| 188 | vertex->ClusterNDF = nch;
|
---|
| 189 | vertex->SumPT2 = sumpt2;
|
---|
[6fbd089] | 190 | vertex->GenSumPT2 = sumpt2;
|
---|
[2118a6a] | 191 |
|
---|
[2d494a6] | 192 | fVertexOutputArray->Add(vertex);
|
---|
[0ed696f] | 193 |
|
---|
[22dc7fd] | 194 | // --- Then with pile-up vertices ------
|
---|
[0ed696f] | 195 |
|
---|
[76d3973] | 196 | switch(fPileUpDistribution)
|
---|
| 197 | {
|
---|
| 198 | case 0:
|
---|
| 199 | numberOfEvents = gRandom->Poisson(fMeanPileUp);
|
---|
| 200 | break;
|
---|
| 201 | case 1:
|
---|
| 202 | numberOfEvents = gRandom->Integer(2*fMeanPileUp + 1);
|
---|
| 203 | break;
|
---|
[76c2a3b] | 204 | case 2:
|
---|
| 205 | numberOfEvents = fMeanPileUp;
|
---|
| 206 | break;
|
---|
[76d3973] | 207 | default:
|
---|
| 208 | numberOfEvents = gRandom->Poisson(fMeanPileUp);
|
---|
| 209 | break;
|
---|
| 210 | }
|
---|
[d7d2da3] | 211 |
|
---|
| 212 | allEntries = fReader->GetEntries();
|
---|
[0ed696f] | 213 |
|
---|
[76d3973] | 214 | for(event = 0; event < numberOfEvents; ++event)
|
---|
[d7d2da3] | 215 | {
|
---|
| 216 | do
|
---|
| 217 | {
|
---|
| 218 | entry = TMath::Nint(gRandom->Rndm()*allEntries);
|
---|
| 219 | }
|
---|
| 220 | while(entry >= allEntries);
|
---|
| 221 |
|
---|
| 222 | fReader->ReadEntry(entry);
|
---|
[0ed696f] | 223 |
|
---|
| 224 | // --- Pile-up vertex smearing
|
---|
| 225 |
|
---|
| 226 | fFunction->GetRandom2(dz, dt);
|
---|
| 227 |
|
---|
| 228 | dt *= c_light*1.0E3; // necessary in order to make t in mm/c
|
---|
| 229 | dz *= 1.0E3; // necessary in order to make z in mm
|
---|
| 230 |
|
---|
[b68a60f] | 231 | dphi = gRandom->Uniform(-TMath::Pi(), TMath::Pi());
|
---|
[d7d2da3] | 232 |
|
---|
[2d494a6] | 233 | vx = 0.0;
|
---|
| 234 | vy = 0.0;
|
---|
[2118a6a] | 235 |
|
---|
[2d494a6] | 236 | numberOfParticles = 0;
|
---|
[2118a6a] | 237 | sumpt2 = 0.0;
|
---|
| 238 |
|
---|
[d7d2da3] | 239 | while(fReader->ReadParticle(pid, x, y, z, t, px, py, pz, e))
|
---|
| 240 | {
|
---|
| 241 | candidate = factory->NewCandidate();
|
---|
| 242 |
|
---|
| 243 | candidate->PID = pid;
|
---|
| 244 |
|
---|
| 245 | candidate->Status = 1;
|
---|
| 246 |
|
---|
| 247 | pdgParticle = pdg->GetParticle(pid);
|
---|
| 248 | candidate->Charge = pdgParticle ? Int_t(pdgParticle->Charge()/3.0) : -999;
|
---|
| 249 | candidate->Mass = pdgParticle ? pdgParticle->Mass() : -999.9;
|
---|
| 250 |
|
---|
| 251 | candidate->IsPU = 1;
|
---|
[0ed696f] | 252 |
|
---|
[d7d2da3] | 253 | candidate->Momentum.SetPxPyPzE(px, py, pz, e);
|
---|
[b68a60f] | 254 | candidate->Momentum.RotateZ(dphi);
|
---|
| 255 |
|
---|
[2d494a6] | 256 | x -= fInputBeamSpotX;
|
---|
| 257 | y -= fInputBeamSpotY;
|
---|
[00078bc] | 258 | candidate->Position.SetXYZT(x, y, z + dz, t + dt);
|
---|
[b68a60f] | 259 | candidate->Position.RotateZ(dphi);
|
---|
[2d494a6] | 260 | candidate->Position += TLorentzVector(fOutputBeamSpotX, fOutputBeamSpotY, 0.0, 0.0);
|
---|
| 261 |
|
---|
| 262 | vx += candidate->Position.X();
|
---|
| 263 | vy += candidate->Position.Y();
|
---|
[2118a6a] | 264 |
|
---|
[2d494a6] | 265 | ++numberOfParticles;
|
---|
[2118a6a] | 266 | if(TMath::Abs(candidate->Charge) > 1.0E-9)
|
---|
| 267 | {
|
---|
| 268 | nch++;
|
---|
| 269 | sumpt2 += pt*pt;
|
---|
| 270 | }
|
---|
| 271 |
|
---|
[d07e957] | 272 | fParticleOutputArray->Add(candidate);
|
---|
[d7d2da3] | 273 | }
|
---|
[2d494a6] | 274 |
|
---|
| 275 | if(numberOfParticles > 0)
|
---|
| 276 | {
|
---|
| 277 | vx /= numberOfParticles;
|
---|
| 278 | vy /= numberOfParticles;
|
---|
| 279 | }
|
---|
[2118a6a] | 280 |
|
---|
| 281 | nvtx++;
|
---|
[2d494a6] | 282 |
|
---|
| 283 | vertex = factory->NewCandidate();
|
---|
| 284 | vertex->Position.SetXYZT(vx, vy, dz, dt);
|
---|
[2118a6a] | 285 |
|
---|
| 286 | vertex->ClusterIndex = nvtx;
|
---|
| 287 | vertex->ClusterNDF = nch;
|
---|
| 288 | vertex->SumPT2 = sumpt2;
|
---|
| 289 | vertex->GenSumPT2 = sumpt2;
|
---|
| 290 |
|
---|
[2d494a6] | 291 | vertex->IsPU = 1;
|
---|
| 292 |
|
---|
| 293 | fVertexOutputArray->Add(vertex);
|
---|
[2118a6a] | 294 |
|
---|
[d7d2da3] | 295 | }
|
---|
| 296 | }
|
---|
| 297 |
|
---|
| 298 | //------------------------------------------------------------------------------
|
---|