ATLAS Offline Software
Loading...
Searching...
No Matches
Public Member Functions | Private Member Functions | Private Attributes | List of all members
TileCorrelation Class Reference

#include <TileCorrelation.h>

Inheritance diagram for TileCorrelation:
Collaboration diagram for TileCorrelation:

Public Member Functions

 TileCorrelation ()
 ~TileCorrelation ()
void setCorrelationZero (int dignum)
void setCorrelationDelta (int dignum)
void sum (std::vector< double > &digits, int ros, int drawer, int channel, int gain, int &dignum)
void runningCorrelation (std::vector< double > &digits, int ros, int drawer, int channel, int gain, int &dignum, int chthres)
void calculateCorrelation (int dignum)
void calculateRunningCorrelation (int dignum, int chthres, bool is7to9)
void printCorrelation (int dignum)
void saveCorrelationSumm (bool deltaCorrelation, const std::string &correlationSummOptFilterFile, const TileHWID *tileHWID, int dignum)
void saveCorrelationMatrix (bool deltaCorrelation, const std::string &correlationMatrixOptFilterFile, const TileHWID *tileHWID, int dignum)
void calculateWeights (bool deltaCorrelation, const std::vector< double > &shapeFormLG, const std::vector< double > &shapeFormHG, const std::vector< double > &shapeFormDerivativeLG, const std::vector< double > &shapeFormDerivativeHG, const std::string &aiLoOptFilterFile, const std::string &biLoOptFilterFile, const std::string &aiHiOptFilterFile, const std::string &biHiOptFilterFile, const TileHWID *tileHWID, int dignum)
void buildPulseShape (std::vector< double > &pulseShape, std::vector< double > &pulseShapeY, std::vector< double > &pulseShapeT, int dignum)
bool msgLvl (const MSG::Level lvl) const
 Test the output level.
MsgStream & msg () const
 The standard message stream.
MsgStream & msg (const MSG::Level lvl) const
 The standard message stream.
void setLevel (MSG::Level lvl)
 Change the current logging level.

Private Member Functions

void initMessaging () const
 Initialize our message level and MessageSvc.

Private Attributes

double m_SS [4][64][48][2][9][9]
double m_S [4][64][48][2][9]
double m_R [4][64][48][2][9][9]
double m_corr [9]
double m_corrSum [4][64][48][2][9]
double m_corrSum2 [4][64][48][2][9]
double m_nCorr
int m_N [4][64][48][2]
int m_jEntry
int m_lag
int m_nPairs [4][64][48][2][9]
double m_nD
double m_S1 [4][64][48][2][9]
double m_S2 [4][64][48][2][9]
double m_S11 [4][64][48][2][9]
double m_S12 [4][64][48][2][9]
double m_S22 [4][64][48][2][9]
std::string m_nm
 Message source name.
boost::thread_specific_ptr< MsgStream > m_msg_tls
 MsgStream instance (a std::cout like with print-out levels)
std::atomic< IMessageSvc * > m_imsg { nullptr }
 MessageSvc pointer.
std::atomic< MSG::Level > m_lvl { MSG::NIL }
 Current logging level.
std::atomic_flag m_initialized ATLAS_THREAD_SAFE = ATOMIC_FLAG_INIT
 Messaging initialized (initMessaging)

Detailed Description

Definition at line 28 of file TileCorrelation.h.

Constructor & Destructor Documentation

◆ TileCorrelation()

TileCorrelation::TileCorrelation ( )

Definition at line 37 of file TileCorrelation.cxx.

38 : AthMessaging ("TileCorrelation")
39 , m_SS()
40 , m_S()
41 , m_R()
42 , m_corr()
43 , m_corrSum()
44 , m_corrSum2()
45 , m_nCorr(0.0)
46 , m_N()
47 , m_jEntry(0)
48 , m_lag(0)
49 , m_nPairs()
50 , m_nD(0.0)
51 , m_S1()
52 , m_S2()
53 , m_S11()
54 , m_S12()
55 , m_S22()
56{
57}
AthMessaging::AthMessaging
AthMessaging()
Default constructor:
TileCorrelation::m_nPairs
int m_nPairs[4][64][48][2][9]
Definition TileCorrelation.h:80
TileCorrelation::m_R
double m_R[4][64][48][2][9][9]
Definition TileCorrelation.h:70
TileCorrelation::m_S22
double m_S22[4][64][48][2][9]
Definition TileCorrelation.h:86
TileCorrelation::m_corrSum2
double m_corrSum2[4][64][48][2][9]
Definition TileCorrelation.h:75
TileCorrelation::m_S
double m_S[4][64][48][2][9]
Definition TileCorrelation.h:69
TileCorrelation::m_S2
double m_S2[4][64][48][2][9]
Definition TileCorrelation.h:83
TileCorrelation::m_S1
double m_S1[4][64][48][2][9]
Definition TileCorrelation.h:82
TileCorrelation::m_corrSum
double m_corrSum[4][64][48][2][9]
Definition TileCorrelation.h:74
TileCorrelation::m_N
int m_N[4][64][48][2]
Definition TileCorrelation.h:77
TileCorrelation::m_S11
double m_S11[4][64][48][2][9]
Definition TileCorrelation.h:84
TileCorrelation::m_S12
double m_S12[4][64][48][2][9]
Definition TileCorrelation.h:85
TileCorrelation::m_SS
double m_SS[4][64][48][2][9][9]
Definition TileCorrelation.h:68

◆ ~TileCorrelation()

TileCorrelation::~TileCorrelation ( )

Definition at line 61 of file TileCorrelation.cxx.

61 {
62}

Member Function Documentation

◆ buildPulseShape()

void TileCorrelation::buildPulseShape ( std::vector< double > & pulseShape,
std::vector< double > & pulseShapeY,
std::vector< double > & pulseShapeT,
int dignum )

Definition at line 741 of file TileCorrelation.cxx.

742 {
743
744 ATH_MSG_DEBUG("BuildPulseShape");
745
746 //1: set m_pulseShape
747 pulseShape.resize(dignum * 25);
748 ATH_MSG_DEBUG("Set dimension of m_pulseShape to dignum*25=" << dignum * 25);
749
750 //2: scan m_pulseShapeT for: tmin, tmax, nt0 and size: m_pulseShapeX[nt0]=1.0;
751 int nt0 = 0, size;
752 double tmin = 10000., tmax = -10000.;
753 size = pulseShapeT.size();
754 for (int i = 0; i < size; ++i) {
755 if (pulseShapeT[i] < tmin) tmin = pulseShapeT[i];
756 if (pulseShapeT[i] > tmax) tmax = pulseShapeT[i];
757 if (pulseShapeT[i] == 0) nt0 = i;
758 }
759
760 ATH_MSG_DEBUG("pulseShapeY & pulseShapeT size =" << size
761 << ", tmin=" << tmin
762 << ", tmax=" << tmax
763 << " central point=" << nt0
764 << " pulseShapeT[nt0]=" << pulseShapeT[nt0]
765 << " pulseShapeY[nt0]=" << pulseShapeY[nt0]);
766
767
768 //3: fill m_pulseShape
769 bool exact;
770 int nminn, nminp;
771 double minn, minp, tdist;
772 pulseShape[dignum * 25 / 2] = pulseShapeY[nt0];
773 for (int i = 1; i < dignum * 25 / 2 + 1; ++i) {
774 // negative times: 0->dignum*25/2
775 if (-i < tmin)
776 pulseShape[dignum * 25 / 2 - i] = 0.;
777 else {
778 exact = false;
779 minn = -10000.;
780 minp = 10000.;
781 nminn = 0;
782 nminp = size - 1;
783 for (int j = 0; j < nt0 + 1 && !exact; ++j) {
784 if (pulseShapeT[j] == double(-i)) {
785 pulseShape[dignum * 25 / 2 - i] = pulseShapeY[j];
786 exact = true;
787 } else {
788 tdist = pulseShapeT[j] - double(-i);
789 if (tdist < 0. && tdist > minn) {
790 minn = tdist;
791 nminn = j;
792 }
793 if (tdist > 0. && tdist < minp) {
794 minp = tdist;
795 nminp = j;
796 }
797 }
798 }
799
800 if (exact) {
801 ATH_MSG_VERBOSE("exact value found for time=" << -i
802 << " pulseShape=" << pulseShape[dignum * 25 / 2 - i]);
803
804 } else {
805
806 ATH_MSG_VERBOSE("exact value NOT found for time=" << -i
807 << " nminn=" << nminn
808 << " pulseShapeT=" << pulseShapeT[nminn]
809 << " pulseShapeY=" << pulseShapeY[nminn] << std::endl
810 << " nminp=" << nminp
811 << " pulseShapeT=" << pulseShapeT[nminp]
812 << " pulseShapeY=" << pulseShapeY[nminp]);
813
814
815 pulseShape[dignum * 25 / 2 - i] = pulseShapeY[nminn]
816 + (pulseShapeY[nminp] - pulseShapeY[nminn]) / (pulseShapeT[nminp] - pulseShapeT[nminn])
817 * (-i - pulseShapeT[nminn]);
818 }
819
820 }
821
822 // positive times: dignum*25/2->dignum*25
823 if (i > tmax)
824 pulseShape[dignum * 25 / 2 + i] = 0.;
825 else {
826 exact = false;
827 minn = -10000.;
828 minp = 10000.;
829 nminn = 0;
830 nminp = size;
831 for (int j = nt0; j < size && !exact; ++j) {
832 if (pulseShapeT[j] == double(i)) {
833 pulseShape[dignum * 25 / 2 + i] = pulseShapeY[j];
834 exact = true;
835 } else {
836 tdist = pulseShapeT[j] - double(i);
837 if (tdist < 0) if (tdist > minn) {
838 minn = tdist;
839 nminn = j;
840 }
841 if (tdist > 0) if (tdist < minp) {
842 minp = tdist;
843 nminp = j;
844 }
845 }
846 }
847 if (exact) {
848 ATH_MSG_VERBOSE("exact value found for time=" << i
849 << " pulseShape=" << pulseShape[dignum * 25 / 2 + i]);
850
851 } else {
852 ATH_MSG_VERBOSE("exact value NOT found for time=" << i
853 << " nminn=" << nminn
854 << " pulseShapeT=" << pulseShapeT[nminn]
855 << " pulseShapeY=" << pulseShapeY[nminn] << std::endl
856 << " nminp=" << nminp
857 << " pulseShapeT=" << pulseShapeT[nminp]
858 << " pulseShapeY=" << pulseShapeY[nminp]);
859
860
861 pulseShape[dignum * 25 / 2 + i] = pulseShapeY[nminn]
862 + (pulseShapeY[nminp] - pulseShapeY[nminn]) / (pulseShapeT[nminp] - pulseShapeT[nminn])
863 * (i - pulseShapeT[nminn]);
864 }
865 }
866 }
867}
ATH_MSG_VERBOSE
#define ATH_MSG_VERBOSE(x)
Definition AthMsgStreamMacros.h:28
ATH_MSG_DEBUG
#define ATH_MSG_DEBUG(x)
Definition AthMsgStreamMacros.h:29

◆ calculateCorrelation()

void TileCorrelation::calculateCorrelation ( int dignum)

Definition at line 162 of file TileCorrelation.cxx.

162 {
163
164 ATH_MSG_DEBUG("CalcCorrelation");
165
166 for (int ros = 0; ros < 4; ++ros)
167 for (unsigned int drawer = 0; drawer < TileCalibUtils::MAX_DRAWER ; ++drawer)
168 for (unsigned int channel = 0; channel < TileCalibUtils::MAX_CHAN; ++channel)
169 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain) {
170 double N_d = double(m_N[ros][drawer][channel][gain]);
171 if (N_d > 0.)
172 ATH_MSG_VERBOSE(" CalcCorrelation, ros=" << ros
173 << " drawer=" << drawer
174 << " channel=" << channel
175 << " gain=" << gain
176 << " N_d=" << N_d);
177
178 for (int i = 0; i < dignum; ++i)
179 // for (int j=0;j<i+1;j++)
180 for (int j = 0; j < dignum; ++j) {
181 if (N_d > 0.) {
182 // std::cout<<"b i="<<i<<" j="<<j<<std::endl
183 // <<" R[ros][drawer][channel][gain][i][j]="<<R[ros][drawer][channel][gain][i][j]<<std::endl
184 // <<" N_d="<<N_d<<std::endl
185 // <<" S[ros][drawer][channel][gain][i]="<<S[ros][drawer][channel][gain][i]<<std::endl
186 // <<" S[ros][drawer][channel][gain][j]="<<S[ros][drawer][channel][gain][j]<<std::endl
187 // <<" SS[ros][drawer][channel][gain][i][j]="<<SS[ros][drawer][channel][gain][i][j]<<std::endl
188 // <<" SS[ros][drawer][channel][gain][i][i]="<<SS[ros][drawer][channel][gain][i][i]<<std::endl
189 // <<" SS[ros][drawer][channel][gain][j][j]="<<SS[ros][drawer][channel][gain][j][j]<<std::endl
190 //<<" S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][j]="<<S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][j]<<std::endl
191 //<<" N_d*SS[ros][drawer][channel][gain][i][j]="<<N_d*SS[ros][drawer][channel][gain][i][j]<<std::endl
192 // <<" N_d*SS[ros][drawer][channel][gain][i][j]-S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][j]="<<N_d*SS[ros][drawer][channel][gain][i][j]-S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][j]<<std::endl
193 // <<" N_d*SS[ros][drawer][channel][gain][j][j]-S[ros][drawer][channel][gain][j]*S[ros][drawer][channel][gain][j])="<<N_d*SS[ros][drawer][channel][gain][j][j]-S[ros][drawer][channel][gain][j]*S[ros][drawer][channel][gain][j]<<std::endl
194 // <<" N_d*SS[ros][drawer][channel][gain][i][i]-S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][i]="<<N_d*SS[ros][drawer][channel][gain][i][i]-S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][i]<<std::endl
195 // <<" sqrt((N_d*SS[ros][drawer][channel][gain][i][i]-S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][i])*(N_d*SS[ros][drawer][channel][gain][j][j]-S[ros][drawer][channel][gain][j]*S[ros][drawer][channel][gain][j]))="<< sqrt((N_d*SS[ros][drawer][channel][gain][i][i]-S[ros][drawer][channel][gain][i]*S[ros][drawer][channel][gain][i])*(N_d*SS[ros][drawer][channel][gain][j][j]-S[ros][drawer][channel][gain][j]*S[ros][drawer][channel][gain][j]))
196 // <<std::endl;
197 m_R[ros][drawer][channel][gain][i][j] = (N_d * m_SS[ros][drawer][channel][gain][i][j]
198 - m_S[ros][drawer][channel][gain][i] * m_S[ros][drawer][channel][gain][j])
199 / sqrt(
200 (N_d * m_SS[ros][drawer][channel][gain][i][i]
201 - m_S[ros][drawer][channel][gain][i] * m_S[ros][drawer][channel][gain][i])
202 * (N_d * m_SS[ros][drawer][channel][gain][j][j]
203 - m_S[ros][drawer][channel][gain][j] * m_S[ros][drawer][channel][gain][j]));
204 // std::cout<<"R[ros][drawer][channel][gain][i][j]="<<R[ros][drawer][channel][gain][i][j]<<std::endl;
205 } else
206 m_R[ros][drawer][channel][gain][i][j] = -1234.;
207 }
208 }
209}
TileCalibUtils::MAX_GAIN
static const unsigned int MAX_GAIN
Number of gains per channel.
Definition TileCalibUtils.h:142
TileCalibUtils::MAX_DRAWER
static const unsigned int MAX_DRAWER
Number of drawers in ROS 1-4.
Definition TileCalibUtils.h:139
TileCalibUtils::MAX_CHAN
static const unsigned int MAX_CHAN
Number of channels in drawer.
Definition TileCalibUtils.h:141
CaloCondBlobAlgs_fillNoiseFromASCII.gain
gain
Definition CaloCondBlobAlgs_fillNoiseFromASCII.py:109
Example_ReadSampleNoise.drawer
drawer
Definition Example_ReadSampleNoise.py:39
plotting.yearwise_efficiency.channel
channel
Definition yearwise_efficiency.py:24

◆ calculateRunningCorrelation()

void TileCorrelation::calculateRunningCorrelation ( int dignum,
int chthres,
bool is7to9 )

Definition at line 283 of file TileCorrelation.cxx.

283 {
284
285 ATH_MSG_VERBOSE("CalcRunningCorrelation");
286
287 for (int ros = 0; ros < 4; ++ros)
288 for (unsigned int drawer = 0; drawer < TileCalibUtils::MAX_DRAWER ; ++drawer)
289 for (unsigned int channel = 0; channel < TileCalibUtils::MAX_CHAN; ++channel)
290 for (unsigned int gain = 0; TileCalibUtils::MAX_GAIN < 2; ++gain) {
291 m_jEntry = m_N[ros][drawer][channel][gain];
292 m_nCorr = double(m_jEntry - chthres);
293
294 if (m_jEntry > 0) {
295 if (is7to9 && dignum == 7) {
296 for (int i = 0; i < 9; ++i)
297 m_R[ros][drawer][channel][gain][i][i] = 1.;
298
299 for (m_lag = 1; m_lag < 9; ++m_lag)
300 for (int i = 0; i < 9 - m_lag; ++i) {
301 if (m_lag < 7) {
302 m_R[ros][drawer][channel][gain][i][i + m_lag] = m_corrSum[ros][drawer][channel][gain][m_lag - 1]
303 / m_nCorr;
304 m_R[ros][drawer][channel][gain][i + m_lag][i] = m_corrSum[ros][drawer][channel][gain][m_lag - 1]
305 / m_nCorr;
306 } else {
307 m_R[ros][drawer][channel][gain][i][i + m_lag] = 0.;
308 m_R[ros][drawer][channel][gain][i + m_lag][i] = 0.;
309 }
310
311 if (-1. > m_R[ros][drawer][channel][gain][i][i + m_lag]
312 || m_R[ros][drawer][channel][gain][i][i + m_lag] > 1.)
313 m_R[ros][drawer][channel][gain][i][i + m_lag] = 0.;
314 if (-1. > m_R[ros][drawer][channel][gain][i + m_lag][i]
315 || m_R[ros][drawer][channel][gain][i + m_lag][i] > 1.)
316 m_R[ros][drawer][channel][gain][i + m_lag][i] = 0.;
317
318 }
319 } else {
320 for (int i = 0; i < dignum; i++)
321 m_R[ros][drawer][channel][gain][i][i] = 1.;
322
323 for (m_lag = 1; m_lag < dignum; ++m_lag)
324 for (int i = 0; i < dignum - m_lag; ++i) {
325 m_R[ros][drawer][channel][gain][i][i + m_lag] = m_corrSum[ros][drawer][channel][gain][m_lag - 1]
326 / m_nCorr;
327 m_R[ros][drawer][channel][gain][i + m_lag][i] = m_corrSum[ros][drawer][channel][gain][m_lag - 1]
328 / m_nCorr;
329 if (-1. > m_R[ros][drawer][channel][gain][i][i + m_lag]
330 || m_R[ros][drawer][channel][gain][i][i + m_lag] > 1.)
331 m_R[ros][drawer][channel][gain][i][i + m_lag] = 0.;
332 if (-1. > m_R[ros][drawer][channel][gain][i + m_lag][i]
333 || m_R[ros][drawer][channel][gain][i + m_lag][i] > 1.)
334 m_R[ros][drawer][channel][gain][i + m_lag][i] = 0.;
335 }
336 }
337 }
338 }
339}

◆ calculateWeights()

void TileCorrelation::calculateWeights ( bool deltaCorrelation,
const std::vector< double > & shapeFormLG,
const std::vector< double > & shapeFormHG,
const std::vector< double > & shapeFormDerivativeLG,
const std::vector< double > & shapeFormDerivativeHG,
const std::string & aiLoOptFilterFile,
const std::string & biLoOptFilterFile,
const std::string & aiHiOptFilterFile,
const std::string & biHiOptFilterFile,
const TileHWID * tileHWID,
int dignum )

Definition at line 495 of file TileCorrelation.cxx.

505 {
506
507 ATH_MSG_DEBUG("CalcWeights");
508
509 CLHEP::HepMatrix correlation(dignum, dignum, 0);
510 CLHEP::HepMatrix inverse(dignum, dignum, 0);
511 CLHEP::HepMatrix zero(dignum, dignum, 0);
512 CLHEP::HepMatrix pulseShape(dignum, 1, 0);
513 CLHEP::HepMatrix pulseShapeDerivative(dignum, 1, 0);
514 CLHEP::HepMatrix a(dignum, 1, 0);
515 CLHEP::HepMatrix b(dignum, 1, 0);
516
517 std::fstream *aiLoFile = new std::fstream(aiLoOptFilterFile.c_str(), std::fstream::out);
518 std::fstream *biLoFile = new std::fstream(biLoOptFilterFile.c_str(), std::fstream::out);
519 std::fstream *aiHiFile = new std::fstream(aiHiOptFilterFile.c_str(), std::fstream::out);
520 std::fstream *biHiFile = new std::fstream(biHiOptFilterFile.c_str(), std::fstream::out);
521
522 //Open Weights files
523 if (aiLoFile->is_open() && aiLoFile->is_open() && aiLoFile->is_open() && aiLoFile->is_open()) {
524 ATH_MSG_INFO(" Weights files open");
525 } else {
526 ATH_MSG_INFO("Weights files didn't open successfully");
527 }
528
529 //pulse shape
530 // std::vector<double> new_shapeForm;
531 // double max=0.;
532 // int nmax=0;
533
534 // for (int i=0; i<int(m_shapeForm.size());i++)
535 // if (m_shapeForm[i]>max)
536 // {
537 // max=m_shapeForm[i];
538 // nmax=i;
539 // }
540 // new_shapeForm.resize(dignum*25,0.);
541
542 // if (lDebug)
543 // log<<MSG::DEBUG<<"m_shapeForm.size()="<<m_shapeForm.size()<<"m_shapeForm nmax="<<nmax<<" new_shapeForm.size()="<<new_shapeForm.size()<<" new_shapeForm nmax="<<dignum*25/2<<endmsg;
544
545 // for (int i=0;i<dignum*25;i++)
546 // {
547 // if (i<(dignum*25/2-nmax)) new_shapeForm[i]=0.;
548 // if (i>=(dignum*25/2-nmax) && i<(dignum*25/2-nmax+int(m_shapeForm.size()))) new_shapeForm[i]=m_shapeForm[i-dignum*25/2 +nmax];
549 // if (i>=(dignum*25/2-nmax+int(m_shapeForm.size()))) new_shapeForm[i]=0.;
550 // }
551
552 if (msgLvl(MSG::VERBOSE)) {
553 msg(MSG::VERBOSE) << "shapeFormLG, shapeFormDerivativeLG, shapeFormHG, shapeFormDerivativeHG" << endmsg;
554 for (int i = 0; i < int(shapeFormLG.size()); ++i)
555 msg(MSG::VERBOSE) << i << " " << std::setw(18) << std::setprecision(10)
556 << shapeFormLG[i] << " " << std::setw(18) << std::setprecision(10)
557 << shapeFormDerivativeLG[i] << " " << std::setw(18) << std::setprecision(10)
558 << shapeFormHG[i] << " " << std::setw(18) << std::setprecision(10)
559 << shapeFormDerivativeHG[i] << " " << endmsg;
560 }
561 //if (lDebug) {
562 // log<<MSG::DEBUG<<"m_HshapeForm"<<endmsg;
563 // for(int i=0;i<int(m_HshapeForm.size());i++) log<<MSG::DEBUG<<" "<<i<<" "<<m_HshapeForm[i]<<endmsg;
564 // log<<MSG::DEBUG<<"m_LdshapeForm"<<endmsg;
565 // for(int i=0;i<int(m_LdshapeForm.size());i++) log<<MSG::DEBUG<<" "<<i<<" "<<m_LdshapeForm[i]<<endmsg;
566 // log<<MSG::DEBUG<<"shapeFormDerivativeHG"<<endmsg;
567 // for(int i=0;i<int(m_HdshapeForm.size());i++) log<<MSG::DEBUG<<" "<<i<<" "<<m_HdshapeForm[i]<<endmsg;
568 //}
569
570 double Q1, Q2, Q3, Delta;
571 int ierr = 0;
572
573 if (deltaCorrelation) {
574 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain)
575 for (int pha = -12; pha < 13; ++pha) {
576 correlation = zero;
577 inverse = zero;
578
579 for (int i = 0; i < dignum; ++i)
580 for (int j = 0; j < dignum; ++j)
581 correlation[i][j] = m_R[0][0][0][0][i][j];
582
583 inverse = correlation.inverse(ierr);
584 if (ierr == 0) {
585 for (int i = 0; i < dignum; ++i) {
586 if (gain == 0) {
587 pulseShape[i][0] = shapeFormLG[i * 25 + 12 + pha];
588 pulseShapeDerivative[i][0] = shapeFormDerivativeLG[i * 25 + 12 + pha];
589 } else {
590 pulseShape[i][0] = shapeFormHG[i * 25 + 12 + pha];
591 pulseShapeDerivative[i][0] = shapeFormDerivativeHG[i * 25 + 12 + pha];
592 }
593 }
594
595 Q1 = ((pulseShape.T()) * inverse * pulseShape).determinant();
596 Q2 = ((pulseShapeDerivative.T()) * inverse * pulseShapeDerivative).determinant();
597 Q3 = ((pulseShapeDerivative.T()) * inverse * pulseShape).determinant();
598 Delta = Q1 * Q2 - Q3 * Q3;
599
600 a = Q2 / Delta * inverse * pulseShape - Q3 / Delta * inverse * pulseShapeDerivative;
601 b = Q3 / Delta * inverse * pulseShape - Q1 / Delta * inverse * pulseShapeDerivative;
602
603 if (gain == 0) {
604 *aiLoFile << std::setw(6) << pha;
605 for (int i = 0; i < dignum; ++i)
606 *aiLoFile << std::setw(18) << std::setprecision(10) << a(i + 1, 1);
607 *aiLoFile << std::endl;
608
609 *biLoFile << std::setw(6) << pha;
610 for (int i = 0; i < dignum; ++i)
611 *biLoFile << std::setw(18) << std::setprecision(10) << b(i + 1, 1);
612 *biLoFile << std::endl;
613 } else {
614 *aiHiFile << std::setw(6) << pha;
615 for (int i = 0; i < dignum; ++i)
616 *aiHiFile << std::setw(18) << std::setprecision(10) << a(i + 1, 1);
617 *aiHiFile << std::endl;
618
619 *biHiFile << std::setw(6) << pha;
620 for (int i = 0; i < dignum; ++i)
621 *biHiFile << std::setw(18) << std::setprecision(10) << b(i + 1, 1);
622 *biHiFile << std::endl;
623 }
624 }
625 }
626 } else {
627 for (int ros = 0; ros < 4; ++ros)
628 for (unsigned int drawer = 0; drawer < TileCalibUtils::MAX_DRAWER ; ++drawer) {
629 int frag = tileHWID->frag(ros + 1, drawer);
630 for (unsigned int channel = 0; channel < TileCalibUtils::MAX_CHAN; ++channel)
631 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain)
632 if (m_N[ros][drawer][channel][gain] > 0) {
633 if (gain == 0) {
634 *aiLoFile << "ros " << ros
635 << " drawer " << drawer << std::hex
636 << " frag0x " << frag << std::dec
637 << " channel " << channel
638 << " N " << m_N[ros][drawer][channel][0] << std::endl;
639
640 *biLoFile << "ros " << ros
641 << " drawer " << drawer << std::hex
642 << " frag0x " << frag << std::dec
643 << " channel " << channel
644 << " N " << m_N[ros][drawer][channel][0] << std::endl;
645 }
646 if (gain == 1) {
647 *aiHiFile << "ros " << ros
648 << " drawer " << drawer << std::hex
649 << " frag0x " << frag << std::dec
650 << " channel " << channel
651 << " N " << m_N[ros][drawer][channel][1] << std::endl;
652
653 *biHiFile << "ros " << ros
654 << " drawer " << drawer << std::hex
655 << " frag0x " << frag << std::dec
656 << " channel " << channel
657 << " N " << m_N[ros][drawer][channel][1] << std::endl;
658 }
659
660 for (int pha = -12; pha < 13; ++pha) {
661 correlation = zero;
662 inverse = zero;
663
664 for (int i = 0; i < dignum; ++i)
665 for (int j = 0; j < dignum; ++j)
666 correlation[i][j] = m_R[ros][drawer][channel][gain][i][j];
667
668 inverse = correlation.inverse(ierr);
669 if (ierr == 0) {
670 for (int i = 0; i < dignum; ++i) {
671 if (gain == 0) {
672 pulseShape[i][0] = shapeFormLG[i * 25 + 12 + pha];
673 pulseShapeDerivative[i][0] = shapeFormDerivativeLG[i * 25 + 12 + pha];
674 } else {
675 pulseShape[i][0] = shapeFormHG[i * 25 + 12 + pha];
676 pulseShapeDerivative[i][0] = shapeFormDerivativeHG[i * 25 + 12 + pha];
677 }
678
679 // PulseShape[i][0]=new_shapeForm[i*25+12+pha];
680 // if ((i*25+12+pha)>0 || (i*25+12+pha)<224)
681 // DPulseShape[i][0]=.5*(new_shapeForm[i*25+13+pha]-new_shapeForm[i*25+11+pha]);
682 // else DPulseShape[i][0]=0.;
683 }
684
685 //HepStd::std::cout<<" correlation "<<Correlation<<Hepstd::endl;
686 //f_weights<<" correlation "<<Correlation<<std::endl;
687 // HepStd::std::cout<<" inverse Matrix "<<Correlation.inverse(ierr)<<Hepstd::endl;
688 //HepStd::std::cout<<" inverse Matrix "<<Inverse<<Hepstd::endl;
689 //f_weights<<" inverse Matrix "<<Inverse<<std::endl;
690 // HepStd::std::cout<<" Product "<<Inverse*Correlation<<Hepstd::endl;
691
692 //std::cout<<" Q1 number of columns="<<((PulseShape.T())*Inverse*PulseShape).num_col()
693 //<<" number of rows="<<((PulseShape.T())*Inverse*PulseShape).num_row()<<std::endl;
694
695 Q1 = ((pulseShape.T()) * inverse * pulseShape).determinant();
696 Q2 = ((pulseShapeDerivative.T()) * inverse * pulseShapeDerivative).determinant();
697 Q3 = ((pulseShapeDerivative.T()) * inverse * pulseShape).determinant();
698 Delta = Q1 * Q2 - Q3 * Q3;
699
700 //std::cout<<" Coeffs: Q1="<<Q1<<" Q2="<<Q2<<" Q3="<<Q3<<" Delta="<<Delta<<std::endl;
701 a = Q2 / Delta * inverse * pulseShape - Q3 / Delta * inverse * pulseShapeDerivative;
702 b = Q3 / Delta * inverse * pulseShape - Q1 / Delta * inverse * pulseShapeDerivative;
703
704 //HepStd::std::cout<<" a Weights= "<<a<<Hepstd::endl;
705 //HepStd::std::cout<<" b Weights= "<<b<<Hepstd::endl;
706
707 if (gain == 0) {
708 *aiLoFile << std::setw(6) << pha;
709 for (int i = 0; i < dignum; ++i)
710 *aiLoFile << std::setw(18) << std::setprecision(10) << a(i + 1, 1);
711 *aiLoFile << std::endl;
712
713 *biLoFile << std::setw(6) << pha;
714 for (int i = 0; i < dignum; ++i)
715 *biLoFile << std::setw(18) << std::setprecision(10) << b(i + 1, 1);
716 *biLoFile << std::endl;
717 } else {
718 *aiHiFile << std::setw(6) << pha;
719 for (int i = 0; i < dignum; ++i)
720 *aiHiFile << std::setw(18) << std::setprecision(10) << a(i + 1, 1);
721 *aiHiFile << std::endl;
722
723 *biHiFile << std::setw(6) << pha;
724 for (int i = 0; i < dignum; ++i)
725 *biHiFile << std::setw(18) << std::setprecision(10) << b(i + 1, 1);
726 *biHiFile << std::endl;
727 }
728 }
729 }
730 }
731 }
732 }
733
734 aiLoFile->close();
735 biLoFile->close();
736 aiHiFile->close();
737 biHiFile->close();
738}
endmsg
#define endmsg
Definition AnalysisConfig_Ntuple.cxx:63
ATH_MSG_INFO
#define ATH_MSG_INFO(x)
Definition AthMsgStreamMacros.h:31
a
static Double_t a
Definition LArPhysWaveHECTool.cxx:38
AthMessaging::msg
MsgStream & msg() const
The standard message stream.
Definition AthMessaging.h:163
AthMessaging::msgLvl
bool msgLvl(const MSG::Level lvl) const
Test the output level.
Definition AthMessaging.h:151
TileHWID::frag
int frag(const HWIdentifier &id) const
extract frag field from HW identifier
Definition TileHWID.h:181
zero
void zero(TH2 *h)
zero the contents of a 2d histogram
Definition comparitor.cxx:438

◆ initMessaging()

void AthMessaging::initMessaging ( ) const
privateinherited

Initialize our message level and MessageSvc.

This method should only be called once.

Definition at line 39 of file AthMessaging.cxx.

40{
41 m_imsg = Athena::getMessageSvc();
42 // If user did not set an explicit level, set a default
43 if (m_lvl == MSG::NIL) {
44 m_lvl = m_imsg ?
45 static_cast<MSG::Level>( m_imsg.load()->outputLevel(m_nm) ) :
46 MSG::INFO;
47 }
48}
AthMessaging::m_nm
std::string m_nm
Message source name.
Definition AthMessaging.h:129
AthMessaging::m_imsg
std::atomic< IMessageSvc * > m_imsg
MessageSvc pointer.
Definition AthMessaging.h:135
AthMessaging::m_lvl
std::atomic< MSG::Level > m_lvl
Current logging level.
Definition AthMessaging.h:138
Athena::getMessageSvc
IMessageSvc * getMessageSvc(bool quiet=false)
Definition getMessageSvc.cxx:20

◆ msg() [1/2]

MsgStream & AthMessaging::msg ( ) const
inlineinherited

The standard message stream.

Returns a reference to the default message stream May not be invoked before sysInitialize() has been invoked.

Definition at line 163 of file AthMessaging.h.

164{
165 MsgStream* ms = m_msg_tls.get();
166 if (!ms) {
167 if (!m_initialized.test_and_set()) initMessaging();
168 ms = new MsgStream(m_imsg,m_nm);
169 m_msg_tls.reset( ms );
170 }
171
172 ms->setLevel (m_lvl);
173 return *ms;
174}
AthMessaging::m_msg_tls
boost::thread_specific_ptr< MsgStream > m_msg_tls
MsgStream instance (a std::cout like with print-out levels)
Definition AthMessaging.h:132
AthMessaging::initMessaging
void initMessaging() const
Initialize our message level and MessageSvc.
Definition AthMessaging.cxx:39

◆ msg() [2/2]

MsgStream & AthMessaging::msg ( const MSG::Level lvl) const
inlineinherited

The standard message stream.

Returns a reference to the default message stream May not be invoked before sysInitialize() has been invoked.

Definition at line 178 of file AthMessaging.h.

179{ return msg() << lvl; }

◆ msgLvl()

bool AthMessaging::msgLvl ( const MSG::Level lvl) const
inlineinherited

Test the output level.

Parameters
lvlThe message level to test against
Returns
boolean Indicating if messages at given level will be printed
Return values
trueMessages at level "lvl" will be printed

Definition at line 151 of file AthMessaging.h.

152{
153 if (m_lvl <= lvl) {
154 msg() << lvl;
155 return true;
156 } else {
157 return false;
158 }
159}

◆ printCorrelation()

void TileCorrelation::printCorrelation ( int dignum)

Definition at line 342 of file TileCorrelation.cxx.

342 {
343
344 std::cout << " TileCorrelation::PrintCorrelation()..." << std::endl;
345 for (int ros = 0; ros < 1; ++ros) {
346 std::cout << " ros=" << ros << std::endl;
347 for (int drawer = 31; drawer < 32; ++drawer) {
348 std::cout << " drawer=" << drawer << std::endl;
349 for (int channel = 17; channel < 24; ++channel) {
350 std::cout << " channel=" << channel << std::endl;
351 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain) {
352 std::cout << " gain=" << gain << std::endl;
353 for (int i = 0; i < dignum; ++i) {
354 for (int j = 0; j < dignum; ++j) {
355 std::cout << " " << m_R[ros][drawer][channel][gain][i][j];
356 }
357 std::cout << std::endl;
358 }
359 std::cout << std::endl;
360 }
361 }
362 }
363 }
364
365}

◆ runningCorrelation()

void TileCorrelation::runningCorrelation ( std::vector< double > & digits,
int ros,
int drawer,
int channel,
int gain,
int & dignum,
int chthres )

Definition at line 212 of file TileCorrelation.cxx.

213 {
214
215 ATH_MSG_VERBOSE("RunningCorrelation");
216
217 dignum = digits.size();
218
219 //chthres=10;
220 //update sums
221 m_N[ros][drawer][channel][gain]++;
222 m_jEntry = m_N[ros][drawer][channel][gain];
223 m_nD = double(m_jEntry);
224
225 if (ros == 1 && drawer == 1 && channel == 0 && gain == 1)
226 ATH_MSG_INFO("Computing RunningCorrelation for jentry=" << m_jEntry);
227
228 for (m_lag = 1; m_lag < dignum; ++m_lag) {
229 for (int i = 0; i < dignum - m_lag; ++i) {
230 m_S1[ros][drawer][channel][gain][m_lag - 1] += digits[i];
231 m_S2[ros][drawer][channel][gain][m_lag - 1] += digits[i + m_lag];
232 m_S12[ros][drawer][channel][gain][m_lag - 1] += digits[i] * digits[i + m_lag];
233 m_S11[ros][drawer][channel][gain][m_lag - 1] += digits[i] * digits[i];
234 m_S22[ros][drawer][channel][gain][m_lag - 1] += digits[i + m_lag] * digits[i + m_lag];
235 m_nPairs[ros][drawer][channel][gain][m_lag - 1]++;
236 }
237 if (m_lag == 1 && ros == 1 && drawer == 1 && channel == 0 && gain == 1)
238 ATH_MSG_VERBOSE(" jentry=" << m_jEntry
239 << " N=" << m_nPairs[ros][drawer][channel][gain][m_lag - 1]
240 << " S1=" << m_S1[ros][drawer][channel][gain][m_lag - 1]);
241
242
243 if (m_jEntry > chthres) {
244 m_nCorr = double(m_nPairs[ros][drawer][channel][gain][m_lag - 1]);
245 m_corr[m_lag - 1] = (m_nCorr * m_S12[ros][drawer][channel][gain][m_lag - 1]
246 - m_S1[ros][drawer][channel][gain][m_lag - 1] * m_S2[ros][drawer][channel][gain][m_lag - 1])
247 / sqrt(
248 (m_nCorr * m_S11[ros][drawer][channel][gain][m_lag - 1]
249 - m_S1[ros][drawer][channel][gain][m_lag - 1] * m_S1[ros][drawer][channel][gain][m_lag - 1])
250 * (m_nCorr * m_S22[ros][drawer][channel][gain][m_lag - 1]
251 - m_S2[ros][drawer][channel][gain][m_lag - 1] * m_S2[ros][drawer][channel][gain][m_lag - 1]));
252
253 if (m_lag == 1 && ros == 1 && drawer == 1 && channel == 0 && gain == 1)
254 ATH_MSG_DEBUG(" corr=" << m_corr[m_lag - 1]
255 << " corr_sum=" << m_corrSum[ros][drawer][channel][gain][m_lag - 1]
256 << " corr_sum_sq=" << m_corrSum2[ros][drawer][channel][gain][m_lag - 1]);
257
258
259 m_corrSum[ros][drawer][channel][gain][m_lag - 1] += m_corr[m_lag - 1];
260 m_corrSum2[ros][drawer][channel][gain][m_lag - 1] += m_corr[m_lag - 1] * m_corr[m_lag - 1];
261 // corr_mean=corr_sum[lag-1]/(chthres-jentry);
262 // corr_RMS=sqrt(corr_sum_sq[lag-1]*(chthres-jentry)-corr_sum[lag-1]*corr_sum[lag-1])/(chthres-jentry)
263
264 if (m_lag == 1 && ros == 1 && drawer == 1 && channel == 0 && gain == 1)
265 ATH_MSG_DEBUG(" jentry=" << m_jEntry
266 << " jentry-chthres=" << m_jEntry - chthres
267 << " lag=1, ros=1, drawer=1, channel=0, gain=1"
268 << " corr=" << m_corr[m_lag - 1]
269// <<" corr_mean="<<corr_sum[lag-1]/(jentry-chthres)
270 << " sum corr_mean=" << m_corrSum[ros][drawer][channel][gain][m_lag - 1]
271 << " corr_mean=" << m_corrSum[ros][drawer][channel][gain][m_lag - 1] / (m_jEntry - chthres)
272// <<" RMS="<<sqrt(corr_sum_sq[lag-1]*(jentry-chthres)-corr_sum[lag-1]*corr_sum[lag-1])/(jentry-chthres)
273 << " sum RMS=" << m_corrSum2[ros][drawer][channel][gain][m_lag - 1]
274 << " RMS=" << sqrt( m_corrSum2[ros][drawer][channel][gain][m_lag - 1] * (m_jEntry - chthres)
275 - m_corrSum[ros][drawer][channel][gain][m_lag - 1]
276 * m_corrSum[ros][drawer][channel][gain][m_lag - 1]) / (m_jEntry - chthres));
277
278 }
279 }
280}

◆ saveCorrelationMatrix()

void TileCorrelation::saveCorrelationMatrix ( bool deltaCorrelation,
const std::string & correlationMatrixOptFilterFile,
const TileHWID * tileHWID,
int dignum )

Definition at line 432 of file TileCorrelation.cxx.

433 {
434
435 ATH_MSG_DEBUG("SaveCorrelationMatrix");
436
437 CLHEP::HepMatrix correlation(dignum, dignum, 0);
438
439 std::fstream *correlationFile = new std::fstream(correlationMatrixOptFilterFile.c_str(), std::fstream::out);
440 if (correlationFile->is_open()) ATH_MSG_INFO(correlationMatrixOptFilterFile << " file open");
441
442 if (deltaCorrelation) {
443 for (int i = 0; i < dignum; ++i)
444 for (int j = 0; j < dignum; ++j) {
445 if (m_R[0][0][0][0][i][j] > -100000. && m_R[0][0][0][0][i][j] < 100000.)
446 correlation[i][j] = m_R[0][0][0][0][i][j];
447 else
448 correlation[i][j] = 0.0;
449 }
450
451 *correlationFile << correlation << std::endl;
452 } else {
453 for (int ros = 0; ros < 4; ++ros)
454 for (unsigned int drawer = 0; drawer < TileCalibUtils::MAX_DRAWER ; ++drawer) {
455 int frag = tileHWID->frag(ros + 1, drawer);
456 for (unsigned int channel = 0; channel < TileCalibUtils::MAX_CHAN; ++channel)
457 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain) {
458 ATH_MSG_VERBOSE("ros " << ros
459 << " drawer " << drawer << MSG::hex
460 << " frag0x " << frag << MSG::dec
461 << " channel " << channel
462 << " gain " << gain
463 << " N " << m_N[ros][drawer][channel][gain]);
464
465
466 if (m_N[ros][drawer][channel][gain] > 0) {
467 for (int i = 0; i < dignum; ++i)
468 for (int j = 0; j < dignum; ++j) {
469 if (m_R[ros][drawer][channel][gain][i][j] > -100000.
470 && m_R[ros][drawer][channel][gain][i][j] < 100000.)
471 correlation[i][j] = m_R[ros][drawer][channel][gain][i][j];
472 else
473 correlation[i][j] = 0.0;
474 }
475
476 *correlationFile << "ros " << ros
477 << " drawer " << drawer << std::hex
478 << " frag0x " << frag << std::dec
479 << " channel " << channel
480 << " gain " << gain
481 << " N " << m_N[ros][drawer][channel][gain]
482 << correlation << std::endl;
483 // for (int i=0;i<dignum;i++)
484 // for (int j=0;j<dignum;j++)
485 // *f_correlation<<R[ros][drawer][channel][gain][i][j]<< M_correlation[i][j]<<std::endl;
486
487 }
488 }
489 }
490 }
491 correlationFile->close();
492}

◆ saveCorrelationSumm()

void TileCorrelation::saveCorrelationSumm ( bool deltaCorrelation,
const std::string & correlationSummOptFilterFile,
const TileHWID * tileHWID,
int dignum )

Definition at line 368 of file TileCorrelation.cxx.

369 {
370
371 ATH_MSG_DEBUG("SaveCorrelationSumm");
372
373 CLHEP::HepMatrix correlation(dignum, 1, 0);
374
375 std::fstream *correlationFile = new std::fstream(correlationSummOptFilterFile.c_str(), std::fstream::out);
376 if (correlationFile->is_open()) ATH_MSG_INFO(correlationSummOptFilterFile << " file open");
377
378 if (deltaCorrelation) {
379 // for (int i=0;i<dignum;i++)
380 for (int j = 0; j < dignum; ++j) {
381 int i = 0;
382 if (m_R[0][0][0][0][i][j] > -100000. && m_R[0][0][0][0][i][j] < 100000.)
383 correlation[i][j] = m_R[0][0][0][0][i][j];
384 else
385 correlation[i][j] = 0.0;
386 }
387
388 *correlationFile << correlation.T() << std::endl;
389 } else {
390 for (int ros = 0; ros < 4; ++ros)
391 for (unsigned int drawer = 0; drawer < TileCalibUtils::MAX_DRAWER ; ++drawer) {
392 int frag = tileHWID->frag(ros + 1, drawer);
393 for (unsigned int channel = 0; channel < TileCalibUtils::MAX_CHAN; ++channel)
394 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain) {
395 ATH_MSG_VERBOSE("ros " << ros
396 << " drawer " << drawer << MSG::hex
397 << " frag0x " << frag << MSG::dec
398 << " channel " << channel
399 << " gain " << gain
400 << " N " << m_N[ros][drawer][channel][gain]);
401
402 if (m_N[ros][drawer][channel][gain] > 0) {
403 //for (int i=0;i<dignum;i++)
404 for (int j = 0; j < dignum; ++j) {
405 int i = 0;
406 if (m_R[ros][drawer][channel][gain][i][j] > -100000. && m_R[ros][drawer][channel][gain][i][j] < 100000.)
407 correlation[i][j] = m_R[ros][drawer][channel][gain][i][j];
408 else
409 correlation[i][j] = 0.0;
410 }
411
412 *correlationFile << "ros " << ros
413 << " drawer " << drawer << std::hex
414 << " frag0x " << frag << std::dec
415 << " channel " << channel
416 << " gain " << gain
417 << " N " << m_N[ros][drawer][channel][gain]
418 << correlation.T();
419 // <<M_correlation.T()<<std::endl;
420 // for (int i=0;i<dignum;i++)
421 // for (int j=0;j<dignum;j++)
422 // *f_correlation<<R[ros][drawer][channel][gain][i][j]<< M_correlation[i][j]<<std::endl;
423
424 }
425 }
426 }
427 }
428 correlationFile->close();
429}

◆ setCorrelationDelta()

void TileCorrelation::setCorrelationDelta ( int dignum)

Definition at line 102 of file TileCorrelation.cxx.

102 {
103
104 ATH_MSG_DEBUG("SetCorrelationDelta");
105
106 for (int ros = 0; ros < 4; ++ros)
107 for (unsigned int drawer = 0; drawer < TileCalibUtils::MAX_DRAWER ; ++drawer)
108 for (unsigned int channel = 0; channel < TileCalibUtils::MAX_CHAN; ++channel)
109 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain) {
110 m_N[ros][drawer][channel][gain] = 1;
111 for (int i = 0; i < dignum; ++i)
112 for (int j = 0; j < dignum; ++j)
113 if (i == j)
114 m_R[ros][drawer][channel][gain][i][j] = 1.;
115 else
116 m_R[ros][drawer][channel][gain][i][j] = 0.;
117 }
118}

◆ setCorrelationZero()

void TileCorrelation::setCorrelationZero ( int dignum)

Definition at line 65 of file TileCorrelation.cxx.

65 {
66
67 ATH_MSG_DEBUG("SetCorrelationZero");
68
69 for (int ros = 0; ros < 4; ++ros)
70 for (unsigned int drawer = 0; drawer < TileCalibUtils::MAX_DRAWER ; ++drawer)
71 for (unsigned int channel = 0; channel < TileCalibUtils::MAX_CHAN; ++channel)
72 for (unsigned int gain = 0; gain < TileCalibUtils::MAX_GAIN; ++gain) {
73 m_N[ros][drawer][channel][gain] = 0;
74 //N[ros][drawer][channel][gain]=0;
75 for (int i = 0; i < dignum; ++i) {
76 m_S[ros][drawer][channel][gain][i] = 0.;
77 for (int j = 0; j < dignum; ++j) {
78 m_SS[ros][drawer][channel][gain][i][j] = 0.;
79 m_R[ros][drawer][channel][gain][i][j] = 0.;
80 }
81 }
82
83 for (m_lag = 0; m_lag < 9; ++m_lag) {
84 m_S1[ros][drawer][channel][gain][m_lag] = 0.;
85 m_S2[ros][drawer][channel][gain][m_lag] = 0.;
86 m_S11[ros][drawer][channel][gain][m_lag] = 0.;
87 m_S12[ros][drawer][channel][gain][m_lag] = 0.;
88 m_S22[ros][drawer][channel][gain][m_lag] = 0.;
89 m_nPairs[ros][drawer][channel][gain][m_lag] = 0;
90 m_corrSum[ros][drawer][channel][gain][m_lag] = 0.;
91 m_corrSum2[ros][drawer][channel][gain][m_lag] = 0.;
92 }
93 }
94
95 for (m_lag = 0; m_lag < 9; ++m_lag) {
96 m_corr[m_lag] = 0.;
97 }
98
99}

◆ setLevel()

void AthMessaging::setLevel ( MSG::Level lvl)
inherited

Change the current logging level.

Use this rather than msg().setLevel() for proper operation with MT.

Definition at line 28 of file AthMessaging.cxx.

29{
30 m_lvl = lvl;
31}

◆ sum()

void TileCorrelation::sum ( std::vector< double > & digits,
int ros,
int drawer,
int channel,
int gain,
int & dignum )

Definition at line 121 of file TileCorrelation.cxx.

121 {
122
123 ATH_MSG_VERBOSE("Sum");
124
125 double N_d = 0.;
126 dignum = digits.size();
127
128 m_N[ros][drawer][channel][gain]++;
129 N_d = double(m_N[ros][drawer][channel][gain]);
130 for (int i = 0; i < dignum; ++i) {
131 m_S[ros][drawer][channel][gain][i] += digits[i];
132 for (int j = 0; j < dignum; ++j)
133 m_SS[ros][drawer][channel][gain][i][j] += digits[i] * digits[j];
134 //for (int j=0;j<i+1;j++) SS[ros][drawer][channel][gain][i][j]+=digits[i]*digits[j];
135 }
136
137 ATH_MSG_DEBUG(" Sum, ros=" << ros
138 << " drawer=" << drawer
139 << " channel=" << channel
140 << " gain=" << gain
141 << " N=" << m_N[ros][drawer][channel][gain]
142 << " Sum[1]=" << m_S[ros][drawer][channel][gain][1]
143 << " Sum[2]=" << m_S[ros][drawer][channel][gain][2]
144 << " Sum[1][2]=" << m_SS[ros][drawer][channel][gain][1][2]
145 << " Sum[1][1]=" << m_SS[ros][drawer][channel][gain][1][1]
146 << " Sum[2][2]=" << m_SS[ros][drawer][channel][gain][2][2]
147 << " B[1][2]=" << m_SS[ros][drawer][channel][gain][1][2] / N_d
148 - m_S[ros][drawer][channel][gain][1] / N_d * m_S[ros][drawer][channel][gain][2] / N_d
149 << " Correlation[1][2]=" << (N_d * m_SS[ros][drawer][channel][gain][1][2]
150 - m_S[ros][drawer][channel][gain][1] * m_S[ros][drawer][channel][gain][2])
151 / sqrt((N_d * m_SS[ros][drawer][channel][gain][1][1]
152 - m_S[ros][drawer][channel][gain][1]
153 * m_S[ros][drawer][channel][gain][1])
154 * (N_d * m_SS[ros][drawer][channel][gain][2][2]
155 - m_S[ros][drawer][channel][gain][2]
156 * m_S[ros][drawer][channel][gain][2]))
157 );
158
159}

Member Data Documentation

◆ ATLAS_THREAD_SAFE

std::atomic_flag m_initialized AthMessaging::ATLAS_THREAD_SAFE = ATOMIC_FLAG_INIT
mutableprivateinherited

Messaging initialized (initMessaging)

Definition at line 141 of file AthMessaging.h.

◆ m_corr

double TileCorrelation::m_corr[9]
private

Definition at line 73 of file TileCorrelation.h.

◆ m_corrSum

double TileCorrelation::m_corrSum[4][64][48][2][9]
private

Definition at line 74 of file TileCorrelation.h.

◆ m_corrSum2

double TileCorrelation::m_corrSum2[4][64][48][2][9]
private

Definition at line 75 of file TileCorrelation.h.

◆ m_imsg

std::atomic<IMessageSvc*> AthMessaging::m_imsg { nullptr }
mutableprivateinherited

MessageSvc pointer.

Definition at line 135 of file AthMessaging.h.

135{ nullptr };

◆ m_jEntry

int TileCorrelation::m_jEntry
private

Definition at line 78 of file TileCorrelation.h.

◆ m_lag

int TileCorrelation::m_lag
private

Definition at line 79 of file TileCorrelation.h.

◆ m_lvl

std::atomic<MSG::Level> AthMessaging::m_lvl { MSG::NIL }
mutableprivateinherited

Current logging level.

Definition at line 138 of file AthMessaging.h.

138{ MSG::NIL };

◆ m_msg_tls

boost::thread_specific_ptr<MsgStream> AthMessaging::m_msg_tls
mutableprivateinherited

MsgStream instance (a std::cout like with print-out levels)

Definition at line 132 of file AthMessaging.h.

◆ m_N

int TileCorrelation::m_N[4][64][48][2]
private

Definition at line 77 of file TileCorrelation.h.

◆ m_nCorr

double TileCorrelation::m_nCorr
private

Definition at line 76 of file TileCorrelation.h.

◆ m_nD

double TileCorrelation::m_nD
private

Definition at line 81 of file TileCorrelation.h.

◆ m_nm

std::string AthMessaging::m_nm
privateinherited

Message source name.

Definition at line 129 of file AthMessaging.h.

◆ m_nPairs

int TileCorrelation::m_nPairs[4][64][48][2][9]
private

Definition at line 80 of file TileCorrelation.h.

◆ m_R

double TileCorrelation::m_R[4][64][48][2][9][9]
private

Definition at line 70 of file TileCorrelation.h.

◆ m_S

double TileCorrelation::m_S[4][64][48][2][9]
private

Definition at line 69 of file TileCorrelation.h.

◆ m_S1

double TileCorrelation::m_S1[4][64][48][2][9]
private

Definition at line 82 of file TileCorrelation.h.

◆ m_S11

double TileCorrelation::m_S11[4][64][48][2][9]
private

Definition at line 84 of file TileCorrelation.h.

◆ m_S12

double TileCorrelation::m_S12[4][64][48][2][9]
private

Definition at line 85 of file TileCorrelation.h.

◆ m_S2

double TileCorrelation::m_S2[4][64][48][2][9]
private

Definition at line 83 of file TileCorrelation.h.

◆ m_S22

double TileCorrelation::m_S22[4][64][48][2][9]
private

Definition at line 86 of file TileCorrelation.h.

◆ m_SS

double TileCorrelation::m_SS[4][64][48][2][9][9]
private

Definition at line 68 of file TileCorrelation.h.

The documentation for this class was generated from the following files:
Generated on for ATLAS Offline Software by doxygen 1.14.0