MuMcPrVKFV2012.C File Reference

#include <map>
#include <utility>
#include <cstdlib>
#include <string>
#include <vector>
#include <boost/algorithm/string/replace.hpp>
#include "TROOT.h"
#include "TSystem.h"
#include "TH1D.h"
#include "TH2D.h"
#include "TTree.h"
#include "TNtuple.h"
#include "TChain.h"
#include "TFile.h"
#include "TString.h"
#include "TObjString.h"
#include "TArrayF.h"
#include "TArrayD.h"
#include "TMath.h"
#include "TMVA/Factory.h"
#include "TMVA/Tools.h"
#include "StMuDSTMaker/COMMON/StMuDst.h"
#include "StMuDSTMaker/COMMON/StMuEvent.h"
#include "StMuDSTMaker/COMMON/StMuTrack.h"
#include "StMuDSTMaker/COMMON/StMuPrimaryVertex.h"
#include "StMuDSTMaker/COMMON/StMuMcVertex.h"
#include "StMuDSTMaker/COMMON/StMuMcTrack.h"
#include "StMuDSTMaker/COMMON/StMuPrimaryTrackCovariance.h"
#include "utils.h"
#include "StMuDSTMaker/COMMON/StMuDstMaker.h"

Go to the source code of this file.

Classes
struct	data_t

Functions
void	FillData (data_t &data, const StMuPrimaryVertex *Vtx)
Bool_t	Accept (const StMuTrack *gTrack=0)
Bool_t	AcceptVX (const StMuPrimaryVertex *Vtx=0)
void	ForceAnimate (unsigned int times=0, int msecDelay=0)
void	MuMcPrVKFV2012 (Long64_t nevent, const char *file, const std::string &outFile, bool fillNtuple)
void	TMVAClassification (TString myMethodList="")

Variables
const Char_t *	vnames = "beam:postx:prompt:cross:tof:notof:EEMC:noEEMC:chi2"

Function Documentation

Bool_t Accept

(

const StMuTrack *

gTrack = 0

)

Definition at line 64 of file MuMcPrVKFV2012.C.

Bool_t AcceptVX

(

const StMuPrimaryVertex *

Vtx = 0

)

Definition at line 78 of file MuMcPrVKFV2012.C.

void FillData	(	data_t &	data,
		const StMuPrimaryVertex *	Vtx
	)

Definition at line 47 of file MuMcPrVKFV2012.C.

void ForceAnimate	(	unsigned int	times = 0,
		int	msecDelay = 0
	)

Definition at line 89 of file MuMcPrVKFV2012.C.

void MuMcPrVKFV2012	(	Long64_t	nevent,
		const char *	file,
		const std::string &	outFile,
		bool	fillNtuple
	)

1. Data sample : pp200 W->e nu with pile-up corresponding to 1 MHz min. bias events, 50 K event y2011, 10 K event y2012.

2. Proof of principal: no pile-up for both PPV and KFV

   a. Reconstructed primary track multiplicity versus corresponding MC "reconstructable" (i.e. in n STAR acceptance,no. TPC MC hits >= 15) tracks multiplicity.

   b. Corrected reconstructed primary track multiplicity (i.e. multiplied by QA/100.) versus corresponding MC "reconstructable" (i.e. in n STAR acceptance,no. TPC MC hits >= 15) tracks multiplicity.

   c. Efficiency primary vertex reconstruction versus MC "reconstructable" tracks multiplicity.

3. With pileup. repeat above (a-c) with old ranking scheme for

   I. Any reconstructed primary vertex which is matched with MC trigger vertex (MC = 1)

   II. The best (in sense of ranking) reconstructed primary vertex which is matched with MC trigger vertex (MC = 1)

   III. The best (in sense of ranking) reconstructed primary vertex which is not matched with MC trigger vertex (MC != 1)

4. With pileup. repeat above (a-c) with new ranking scheme for cases I-III

Definition at line 127 of file MuMcPrVKFV2012.C.

void TMVAClassification

(

TString

myMethodList = ""

)

Definition at line 456 of file MuMcPrVKFV2012.C.

Variable Documentation

const Char_t* vnames = "beam:postx:prompt:cross:tof:notof:EEMC:noEEMC:chi2"

Definition at line 43 of file MuMcPrVKFV2012.C.