DAClusterizerInZT_vect Class Reference

#include <DAClusterizerInZT_vect.h>

Inheritance diagram for DAClusterizerInZT_vect:

Classes
struct	track_t
struct	vertex_t

Public Member Functions
double	beta0 (const double betamax, track_t const &tks, vertex_t const &y) const
std::vector< std::vector< reco::TransientTrack > >	clusterize (const std::vector< reco::TransientTrack > &tracks) const override
	DAClusterizerInZT_vect (const edm::ParameterSet &conf)
void	dump (const double beta, const vertex_t &y, const track_t &tks, const int verbosity=0) const
track_t	fill (const std::vector< reco::TransientTrack > &tracks) const
bool	find_nearest (double z, double t, vertex_t &y, unsigned int &k_min, double dz, double dt) const
double	get_Tc (const vertex_t &y, int k) const
bool	merge (vertex_t &y, double &beta) const
bool	purge (vertex_t &, track_t &, double &, const double) const
bool	split (const double beta, track_t &t, vertex_t &y, double threshold=1.) const
void	splitAll (vertex_t &y) const
double	update (double beta, track_t &gtracks, vertex_t &gvertices, bool useRho0, const double &rho0) const
std::vector< TransientVertex >	vertices (const std::vector< reco::TransientTrack > &tracks, const int verbosity=0) const
void	zorder (vertex_t &y) const
Public Member Functions inherited from TrackClusterizerInZ
	TrackClusterizerInZ ()
	TrackClusterizerInZ (const edm::ParameterSet &conf)
virtual	~TrackClusterizerInZ ()

Private Attributes
double	betamax_
double	betapurge_
double	betastop_
double	coolingFactor_
double	d0CutOff_
double	dtCutOff_
double	dzCutOff_
int	maxIterations_
double	mintrkweight_
double	tmerge_
double	uniquetrkweight_
bool	useTc_
bool	verbose_
double	vertexSize_
double	vertexSizeTime_
double	zdumpcenter_
double	zdumpwidth_
double	zmerge_

Detailed Description

Description: separates event tracks into clusters along the beam line

Version which auto-vectorizes with gcc 4.6 or newer

Definition at line 22 of file DAClusterizerInZT_vect.h.

Constructor & Destructor Documentation

DAClusterizerInZT_vect::DAClusterizerInZT_vect

(

const edm::ParameterSet &

conf

)

Definition at line 16 of file DAClusterizerInZT_vect.cc.

References gather_cfg::cout, edm::ParameterSet::getParameter(), edm::ParameterSet::getUntrackedParameter(), mps_fire::i, SiStripPI::max, and lumiCalc2::stopT.

                                                                          {

  // hardcoded parameters
  maxIterations_ = 100;
  mintrkweight_ = 0.5; // conf.getParameter<double>("mintrkweight");


  // configurable debug outptut debug output
  verbose_ = conf.getUntrackedParameter<bool> ("verbose", false);
  zdumpcenter_ = conf.getUntrackedParameter<double> ("zdumpcenter", 0.);
  zdumpwidth_ = conf.getUntrackedParameter<double> ("zdumpwidth", 20.);
  
  // configurable parameters
  double minT = conf.getParameter<double> ("Tmin");
  double purgeT = conf.getParameter<double> ("Tpurge");
  double stopT = conf.getParameter<double> ("Tstop");
  vertexSize_ = conf.getParameter<double> ("vertexSize");
  vertexSizeTime_ = conf.getParameter<double> ("vertexSizeTime");
  coolingFactor_ = conf.getParameter<double> ("coolingFactor");
  useTc_=true;
  if(coolingFactor_<0){
    coolingFactor_=-coolingFactor_; 
    useTc_=false;
  }
  d0CutOff_ = conf.getParameter<double> ("d0CutOff");
  dzCutOff_ = conf.getParameter<double> ("dzCutOff");
  dtCutOff_ = conf.getParameter<double> ("dtCutOff");
  uniquetrkweight_ = conf.getParameter<double>("uniquetrkweight");
  zmerge_ = conf.getParameter<double>("zmerge");
  tmerge_ = conf.getParameter<double>("tmerge");

#ifdef VI_DEBUG
  if(verbose_){
    std::cout << "DAClusterizerinZT_vect: mintrkweight = " << mintrkweight_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: uniquetrkweight = " << uniquetrkweight_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: zmerge = " << zmerge_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: tmerge = " << tmerge_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: Tmin = " << minT << std::endl;
    std::cout << "DAClusterizerinZT_vect: Tpurge = " << purgeT << std::endl;
    std::cout << "DAClusterizerinZT_vect: Tstop = " << stopT << std::endl;
    std::cout << "DAClusterizerinZT_vect: vertexSize = " << vertexSize_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: vertexSizeTime = " << vertexSizeTime_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: coolingFactor = " << coolingFactor_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: d0CutOff = " << d0CutOff_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: dzCutOff = " << dzCutOff_ << std::endl;
    std::cout << "DAClusterizerinZT_vect: dtCutoff = " << dtCutOff_ << std::endl;
  }
#endif


  if (minT == 0) {
    edm::LogWarning("DAClusterizerinZT_vectorized") << "DAClusterizerInZT: invalid Tmin" << minT
                           << "  reset do default " << 1. / betamax_;
  } else {
    betamax_ = 1. / minT;
  }


  if ((purgeT > minT) || (purgeT == 0)) {
    edm::LogWarning("DAClusterizerinZT_vectorized") << "DAClusterizerInZT: invalid Tpurge" << purgeT
                           << "  set to " << minT;
    purgeT =  minT;
  }
  betapurge_ = 1./purgeT;
  

  if ((stopT > purgeT) || (stopT == 0)) {
    edm::LogWarning("DAClusterizerinZT_vectorized") << "DAClusterizerInZT: invalid Tstop" << stopT
                           << "  set to  " << max(1., purgeT);
    stopT = max(1., purgeT) ;
  }
  betastop_ = 1./stopT;
  
}

Member Function Documentation

double DAClusterizerInZT_vect::beta0	(	const double	betamax,
		track_t const &	tks,
		vertex_t const &	y
	)		const

Definition at line 525 of file DAClusterizerInZT_vect.cc.

References gather_cfg::cout, dt, DAClusterizerInZT_vect::track_t::dt2_, PVValHelper::dz, DAClusterizerInZT_vect::track_t::dz2_, DAClusterizerInZT_vect::track_t::getSize(), DAClusterizerInZT_vect::vertex_t::getSize(), mps_fire::i, createfilelist::int, gen::k, cmsBatch::log, nt, DAClusterizerInZT_vect::track_t::pi_, funct::pow(), mathSSE::sqrt(), DAClusterizerInZT_vect::track_t::t_, DAClusterizerInZT_vect::vertex_t::t_, w, DAClusterizerInZT_vect::track_t::z_, and DAClusterizerInZT_vect::vertex_t::z_.

                                                                                            {
  
  double T0 = 0; // max Tc for beta=0
  // estimate critical temperature from beta=0 (T=inf)
  const unsigned int nt = tks.getSize();
  const unsigned int nv = y.getSize();
  
  for (unsigned int k = 0; k < nv; k++) {
    
    // vertex fit at T=inf
    double sumwz = 0;
    double sumwt = 0;
    double sumw_z = 0;
    double sumw_t = 0;
    for (unsigned int i = 0; i < nt; i++) {
      double w_z = tks.pi_[i] * tks.dz2_[i];
      double w_t = tks.pi_[i] * tks.dt2_[i];
      sumwz += w_z * tks.z_[i];
      sumwt += w_t * tks.t_[i];
      sumw_z += w_z;
      sumw_t += w_t;
    }
    y.z_[k] = sumwz / sumw_z;
    y.t_[k] = sumwt / sumw_t;
    
    // estimate Tc, eventually do this in the same loop
    double szz = 0, stt = 0, szt = 0;
    double nuz = 0, nut = 0;
    for (unsigned int i = 0; i < nt; i++) {
      double dz = (tks.z_[i] - y.z_[k]) * tks.dz2_[i];
      double dt = (tks.t_[i] - y.t_[k]) * tks.dt2_[i];
      double w = tks.pi_[i];
      szz += w * dz * dz;
      stt += w * dt * dt;
      szt += w * dz * dt;
      nuz += w * tks.dz2_[i];
      nut += w * tks.dt2_[i];
    }
    double Tz = szz/nuz;
    double Tt = stt/nut;
    double Tc = Tz + Tt + sqrt( pow(Tz - Tt, 2) + 4 * szt * szt / nuz / nut);

    if (Tc > T0) T0 = Tc;
  }// vertex loop (normally there should be only one vertex at beta=0)
  
#ifdef VI_DEBUG
  if(verbose_){
    std::cout << "DAClustrizerInZT_vect.beta0:   Tc = " << T0 << std::endl;
    int coolingsteps =  1 - int(std::log(T0 * betamax) / std::log(coolingFactor_));
    std::cout << "DAClustrizerInZT_vect.beta0:   nstep = " << coolingsteps << std::endl;
  }
#endif


  if (T0 > 1. / betamax) {
    return betamax / std::pow(coolingFactor_, int(std::log(T0 * betamax) / std::log(coolingFactor_)) - 1);
  } else {
    // ensure at least one annealing step
    return betamax * coolingFactor_;
  }
}

vector< vector< reco::TransientTrack > > DAClusterizerInZT_vect::clusterize ( const std::vector< reco::TransientTrack > &  tracks ) const

overridevirtual

Implements TrackClusterizerInZ.

Definition at line 1023 of file DAClusterizerInZT_vect.cc.

References fastPrimaryVertexProducer_cfi::clusters, gather_cfg::cout, gen::k, MetAnalyzer::pv(), and electrons_cff::vertices.

                                                         {
  
#ifdef VI_DEBUG
  if (verbose_) {
    std::cout  << "###################################################" << endl;
    std::cout  << "# vectorized DAClusterizerInZT_vect::clusterize   nt=" << tracks.size() << endl;
    std::cout  << "###################################################" << endl;
  }
#endif
  
  vector<vector<reco::TransientTrack> > clusters;
  vector<TransientVertex> && pv = vertices(tracks);
  
#ifdef VI_DEBUG
  if (verbose_) {
    std::cout  << "# DAClusterizerInZT::clusterize   pv.size=" << pv.size() << endl;
  }
#endif

  if (pv.empty()) {
    return clusters;
  }

  // fill into clusters, don't merge
   for (auto k = pv.begin(); k != pv.end(); k++) {
     vector<reco::TransientTrack> aCluster = k->originalTracks();
      if (aCluster.size()>1){
    clusters.push_back(aCluster);
      }
   }

   return clusters;

   /* 
   //leaving the merging version here in case we want to turn it back on the future
   // needs optimization and validation
   // fill into clusters and merge
   vector<reco::TransientTrack> aCluster = pv.begin()->originalTracks();
   
   for (auto k = pv.begin() + 1; k != pv.end(); k++) {
   if (  (std::abs(k->position().z() - (k - 1)->position().z()) > (2 * vertexSize_))
   ||(std::abs(k->time() - (k - 1)->time() ) > (2 * vertexSizeTime_)) ){ // still not perfect
   // close a cluster
   if (aCluster.size()>1){
   clusters.push_back(aCluster);
   }else{
   #ifdef VI_DEBUG
   if(verbose_){
   std::cout << " one track cluster at " << k->position().z() << "  suppressed" << std::endl;
   }
   #endif
      }
      aCluster.clear();
      }
      for (unsigned int i = 0; i < k->originalTracks().size(); i++) {
      aCluster.push_back(k->originalTracks()[i]);
      }
      
      }
      clusters.emplace_back(std::move(aCluster));
      
      return clusters;
   */
}

void DAClusterizerInZT_vect::dump	(	const double	beta,
		const vertex_t &	y,
		const track_t &	tks,
		const int	verbosity = 0
	)		const

Definition at line 1091 of file DAClusterizerInZT_vect.cc.

References a, b, pfBoostedDoubleSVAK8TagInfos_cfi::beta, gather_cfg::cout, TauDecayModes::dec, DAClusterizerInZT_vect::track_t::dt2_, DAClusterizerInZT_vect::track_t::dz2_, Measurement1D::error(), JetChargeProducer_cfi::exp, F(), alignBH_cfg::fixed, DAClusterizerInZT_vect::track_t::getSize(), DAClusterizerInZT_vect::vertex_t::getSize(), h, reco::TrackBase::highPurity, mps_fire::i, listHistos::IP, cmsBatch::log, reco::HitPattern::MISSING_OUTER_HITS, nt, AlCaHLTBitMon_ParallelJobs::p, DAClusterizerInZT_vect::track_t::pi_, GeomDetEnumerators::PixelBarrel, DAClusterizerInZT_vect::vertex_t::pk_, mathSSE::sqrt(), DAClusterizerInZT_vect::track_t::t_, DAClusterizerInZT_vect::vertex_t::t_, DAClusterizerInZT_vect::track_t::tt, Measurement1D::value(), DAClusterizerInZT_vect::track_t::z_, DAClusterizerInZT_vect::vertex_t::z_, and DAClusterizerInZT_vect::track_t::Z_sum_.

                                                            {
#ifdef VI_DEBUG
    const unsigned int nv = y.getSize();
    const unsigned int nt = tks.getSize();
    
    std::vector< unsigned int > iz;
    for(unsigned int j=0; j<nt; j++){ iz.push_back(j); }
    std::sort(iz.begin(), iz.end(), [tks](unsigned int a, unsigned int b){ return tks.z_[a]<tks.z_[b];} ); 
    std::cout  << std::endl;
    std::cout  << "-----DAClusterizerInZT::dump ----" <<  nv << "  clusters " << std::endl;
    string h = "                                                                                 ";
    std::cout  << h << " k= ";
    for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex) {
      if (std::fabs(y.z_[ivertex]-zdumpcenter_) < zdumpwidth_){
        std::cout  << setw(8) << fixed << ivertex;
      }
    }
    std::cout  << endl;

    std::cout  << h << " z= ";
    std::cout  << setprecision(4);
    for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex) {
      if (std::fabs(y.z_[ivertex]-zdumpcenter_) < zdumpwidth_){
        std::cout  << setw(8) << fixed << y.z_[ivertex];
      }
    }
    std::cout  << endl;

    std::cout  << h << " t= ";
    std::cout  << setprecision(4);
    for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex) {
      if (std::fabs(y.z_[ivertex]-zdumpcenter_) < zdumpwidth_){
        std::cout  << setw(8) << fixed << y.t_[ivertex];
      }
    }
    std::cout  << endl;

    std::cout  << "T=" << setw(15) << 1. / beta
           << " Tmin =" << setw(10) << 1./betamax_
            << "                                               Tc= ";
    for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex) {
      if (std::fabs(y.z_[ivertex]-zdumpcenter_) < zdumpwidth_){
        double Tc = get_Tc(y, ivertex);
        std::cout  << setw(8) << fixed << setprecision(1) <<  Tc;
      }
    }
    std::cout  << endl;

    std::cout  <<  h << "pk= ";
    double sumpk = 0;
    for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex) {
        sumpk += y.pk_[ivertex];
        if  (std::fabs(y.z_[ivertex] - zdumpcenter_) > zdumpwidth_) continue;
        std::cout  << setw(8) << setprecision(4) << fixed << y.pk_[ivertex];
    }
    std::cout  << endl;

    std::cout << h << "nt= ";
    for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex) {
        sumpk += y.pk_[ivertex];
        if  (std::fabs(y.z_[ivertex] - zdumpcenter_) > zdumpwidth_) continue;
        std::cout  << setw(8) << setprecision(1) << fixed << y.pk_[ivertex]*nt;
    }
    std::cout  << endl;

    if (verbosity > 0) {
        double E = 0, F = 0;
        std::cout  << endl;
        std::cout 
        << "----        z +/- dz          t +/- dt                ip +/-dip       pt    phi  eta   weights  ----"
        << endl;
        std::cout  << setprecision(4);
        for (unsigned int i0 = 0; i0 < nt; i0++) {
          unsigned int i = iz[i0];
            if (tks.Z_sum_[i] > 0) {
                F -= std::log(tks.Z_sum_[i]) / beta;
            }
            double tz = tks.z_[i];

            if( std::fabs(tz - zdumpcenter_) > zdumpwidth_) continue;
            std::cout  << setw(4) << i << ")" << setw(8) << fixed << setprecision(4)
             << tz << " +/-" << setw(6) << sqrt(1./tks.dz2_[i]);

            if( tks.dt2_[i] >0){
              std::cout  <<  setw(8) << fixed << setprecision(4)
                     << tks.t_[i] << " +/-" << setw(6) << sqrt(1./tks.dt2_[i]);
            }else{
              std::cout  <<  "                  ";
            }

            if (tks.tt[i]->track().quality(reco::TrackBase::highPurity)) {
                std::cout  << " *";
            } else {
                std::cout  << "  ";
            }
            if (tks.tt[i]->track().hitPattern().hasValidHitInPixelLayer(PixelSubdetector::SubDetector::PixelBarrel, 1)) {
                std::cout  << "+";
            } else {
                std::cout  << "-";
            }
            std::cout  << setw(1)
             << tks.tt[i]->track().hitPattern().pixelBarrelLayersWithMeasurement(); // see DataFormats/TrackReco/interface/HitPattern.h
            std::cout  << setw(1)
             << tks.tt[i]->track().hitPattern().pixelEndcapLayersWithMeasurement();
            std::cout  << setw(1) << hex
                    << tks.tt[i]->track().hitPattern().trackerLayersWithMeasurement()
                    - tks.tt[i]->track().hitPattern().pixelLayersWithMeasurement()
                    << dec;
            std::cout  << "=" << setw(1) << hex
                    << tks.tt[i]->track().hitPattern().numberOfLostHits(reco::HitPattern::MISSING_OUTER_HITS)
                    << dec;

            Measurement1D IP =
                    tks.tt[i]->stateAtBeamLine().transverseImpactParameter();
            std::cout  << setw(8) << IP.value() << "+/-" << setw(6) << IP.error();
            std::cout  << " " << setw(6) << setprecision(2)
             << tks.tt[i]->track().pt() * tks.tt[i]->track().charge();
            std::cout  << " " << setw(5) << setprecision(2)
             << tks.tt[i]->track().phi() << " " << setw(5)
             << setprecision(2) << tks.tt[i]->track().eta();

            double sump = 0.;
            for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex) {
              if  (std::fabs(y.z_[ivertex]-zdumpcenter_) > zdumpwidth_) continue;

                if ((tks.pi_[i] > 0) && (tks.Z_sum_[i] > 0)) {
                    //double p=pik(beta,tks[i],*k);
                                  double p = y.pk_[ivertex]  * exp(-beta * Eik(tks.z_[i], y.z_[ivertex], tks.dz2_[i],
                                                                               tks.t_[i], y.t_[ivertex], tks.dt2_[i] )) / tks.Z_sum_[i];
                    if (p > 0.0001) {
                        std::cout  << setw(8) << setprecision(3) << p;
                    } else {
                        std::cout  << "    .   ";
                    }
                    E += p * Eik(tks.z_[i], y.z_[ivertex], tks.dz2_[i],
                                                     tks.t_[i], y.t_[ivertex], tks.dt2_[i] );
                    sump += p;
                } else {
                    std::cout  << "        ";
                }
            }
            std::cout  << endl;
        }
        std::cout  << endl << "T=" << 1 / beta << " E=" << E << " n=" << y.getSize()
             << "  F= " << F << endl << "----------" << endl;
    }
#endif
}

DAClusterizerInZT_vect::track_t DAClusterizerInZT_vect::fill

(

const std::vector< reco::TransientTrack > &

tracks

)

const

Definition at line 107 of file DAClusterizerInZT_vect.cc.

References DAClusterizerInZT_vect::track_t::addItem(), TSGForRoadSearchIOpxl_cfi::atIP, reco::BeamSpot::BeamWidthX(), reco::BeamSpot::BeamWidthY(), gather_cfg::cout, geometryDiff::epsilon, Measurement1D::error(), DAClusterizerInZT_vect::track_t::extractRaw(), DAClusterizerInZT_vect::track_t::getSize(), edm::isNotFinite(), LogTrace, min(), funct::pow(), AlignmentPI::t_z, and Measurement1D::value().

                                                                            {

  // prepare track data for clustering
  track_t tks;
  for( const auto& tk : tracks ) {
    if (!tk.isValid()) continue;
    double t_pi=1.;
    double t_z = tk.stateAtBeamLine().trackStateAtPCA().position().z();
    double t_t = tk.timeExt();
    if (std::fabs(t_z) > 1000.) continue;
    auto const & t_mom = tk.stateAtBeamLine().trackStateAtPCA().momentum();
    //  get the beam-spot
    reco::BeamSpot beamspot = tk.stateAtBeamLine().beamSpot();
    double t_dz2 = 
      std::pow(tk.track().dzError(), 2) // track errror
      + (std::pow(beamspot.BeamWidthX()*t_mom.x(),2)+std::pow(beamspot.BeamWidthY()*t_mom.y(),2))*std::pow(t_mom.z(),2)/std::pow(t_mom.perp2(),2) // beam spot width
      + std::pow(vertexSize_, 2); // intrinsic vertex size, safer for outliers and short lived decays
    t_dz2 = 1./ t_dz2;
    if (edm::isNotFinite(t_dz2) || t_dz2 < std::numeric_limits<double>::min() ) continue;


    double t_dt2 =std::pow(tk.dtErrorExt(),2.) + std::pow(vertexSizeTime_,2.); // the ~injected~ timing error, need to add a small minimum vertex size in time
    if (tk.dtErrorExt()>0.3){ 
      t_dt2 = 0; // tracks with no time measurement
    }else{
      t_dt2 = 1./t_dt2;
      if (edm::isNotFinite(t_dt2) || t_dt2 < std::numeric_limits<double>::min() ) continue;
    }


    if (d0CutOff_ > 0) {
      Measurement1D atIP =
    tk.stateAtBeamLine().transverseImpactParameter();// error contains beamspot
      t_pi = 1. / (1. + local_exp(std::pow(atIP.value() / atIP.error(), 2) - std::pow(d0CutOff_, 2))); // reduce weight for high ip tracks
      if (edm::isNotFinite(t_pi) ||  t_pi < std::numeric_limits<double>::epsilon())  continue; // usually is > 0.99
    }
    LogTrace("DAClusterizerinZT_vectorized") << t_z << ' ' << t_t <<' '<< t_dz2 << ' ' << t_dt2 <<' '<< t_pi;
    tks.addItem(t_z, t_t, t_dz2, t_dt2, &tk, t_pi);
  }
  tks.extractRaw();
  
#ifdef VI_DEBUG
  if (verbose_) {
    std::cout << "Track count " << tks.getSize() << std::endl;
  }
#endif
  
  return tks;
}

bool DAClusterizerInZT_vect::find_nearest	(	double	z,
		double	t,
		vertex_t &	y,
		unsigned int &	k_min,
		double	dz,
		double	dt
	)		const

Definition at line 354 of file DAClusterizerInZT_vect.cc.

References funct::abs(), delta, DAClusterizerInZT_vect::vertex_t::getSize(), gen::k, reco::ParticleMasses::k0, funct::pow(), DAClusterizerInZT_vect::vertex_t::t_, DAClusterizerInZT_vect::vertex_t::z, and DAClusterizerInZT_vect::vertex_t::z_.

                                                                                                                           {
  // find the cluster nearest to (z,t)
  // distance measure is   delta = (delta_z / dz )**2  + (delta_t/ d_t)**2
  // assumes that clusters are ordered n z
  // return value is false if o neighbour with distance < 1 is found

  unsigned int nv = y.getSize();

  // find nearest in z, binary search later
  unsigned int k = 0;
  for(unsigned int k0 = 1; k0 < nv; k0++){
    if (std::abs( y.z_[k0]-z ) < std::abs( y.z_[k]-z )){
      k = k0;
    }
  }

  double delta_min = 1.;

  //search left
  unsigned int k1 = k;
  while( ( k1 > 0) && ((y.z[k] - y.z[--k1]) < dz ) ){
    auto delta = std::pow( (y.z_[k] - y.z_[k1]) / dz, 2)
                +std::pow( (y.t_[k] - y.t_[k1]) / dt, 2);
    if (delta < delta_min){
      k_min = k1;
      delta_min = delta;
    }
  }      

  //search right
  k1 = k;
  while( ((++k1) < nv) && ((y.z[k1] - y.z[k]) < dz ) ){
    auto delta = std::pow( (y.z_[k1] - y.z_[k]) / dz, 2)
                +std::pow( (y.t_[k1] - y.t_[k]) / dt, 2);
    if (delta < delta_min){
      k_min = k1;
      delta_min = delta;
    }
  }      
    
  return (delta_min < 1.);
}

double DAClusterizerInZT_vect::get_Tc	(	const vertex_t &	y,
		int	k
	)		const

Definition at line 587 of file DAClusterizerInZT_vect.cc.

References gen::k, DAClusterizerInZT_vect::vertex_t::nut_, DAClusterizerInZT_vect::vertex_t::nuz_, funct::pow(), mathSSE::sqrt(), DAClusterizerInZT_vect::vertex_t::stt_, DAClusterizerInZT_vect::vertex_t::szt_, and DAClusterizerInZT_vect::vertex_t::szz_.

                                                                   {
  double Tz = y.szz_[k]/y.nuz_[k];  // actually 0.5*Tc(z)
  double Tt = y.stt_[k]/y.nut_[k];
  double mx = y.szt_[k]/y.nuz_[k]*y.szt_[k]/y.nut_[k];  
  return Tz + Tt + sqrt(pow(Tz - Tt, 2) + 4 * mx);
}

bool DAClusterizerInZT_vect::merge	(	vertex_t &	y,
		double &	beta
	)		const

Definition at line 400 of file DAClusterizerInZT_vect.cc.

References gather_cfg::cout, delta, DAClusterizerInZT_vect::vertex_t::extractRaw(), alignBH_cfg::fixed, DAClusterizerInZT_vect::vertex_t::getSize(), DAClusterizerInZT_vect::vertex_t::pk_, funct::pow(), DAClusterizerInZT_vect::vertex_t::removeItem(), DAClusterizerInZT_vect::vertex_t::t_, DAClusterizerInZT_vect::vertex_t::z, and DAClusterizerInZT_vect::vertex_t::z_.

                                                                  {
  // merge clusters that collapsed or never separated,
  // return true if vertices were merged, false otherwise
  const unsigned int nv = y.getSize();

  if (nv < 2)
    return false;

  // merge the smallest distance clusters first
  unsigned int k1_min = 0, k2_min = 0;
  double delta_min = 0;

  for (unsigned int k1 = 0; (k1 + 1) < nv; k1++) {
    unsigned int k2 = k1;
    while( (++k2 < nv) && ( std::fabs(y.z[k2] - y.z_[k1] ) < zmerge_ ) ){
      auto delta = std::pow( (y.z_[k2] - y.z_[k1]) / zmerge_, 2)
              +std::pow( (y.t_[k2] - y.t_[k1]) / tmerge_, 2);
      if ( (delta < delta_min)  || (k1_min == k2_min) ){
    k1_min = k1;
        k2_min = k2;
    delta_min = delta;
      }
    }
  }

  if( (k1_min  == k2_min) || (delta_min > 1) ){
    return false;
  }


  double rho = y.pk_[k1_min] + y.pk_[k2_min];
#ifdef VI_DEBUG
  if(verbose_){ std::cout << "merging (" << setw(8) << fixed  << setprecision(4) << y.z_[k1_min] << ',' << y.t_[k1_min] << ") and (" <<  y.z_[k2_min] << ',' << y.t_[k2_min] << ")" <<  "  idx=" << k1_min << "," << k2_min << std::endl;}
#endif
  if(rho > 0){
    y.z_[k1_min] = (y.pk_[k1_min] * y.z_[k1_min] + y.pk_[k2_min] * y.z_[k2_min])/rho;
    y.t_[k1_min] = (y.pk_[k1_min] * y.t_[k1_min] + y.pk_[k2_min] * y.t_[k2_min])/rho;
  }else{
    y.z_[k1_min] = 0.5 * (y.z_[k1_min] + y.z_[k2_min]);
    y.t_[k1_min] = 0.5 * (y.t_[k1_min] + y.t_[k2_min]);
  }
  y.pk_[k1_min] = rho;
  y.removeItem(k2_min);
  y.extractRaw();
  return true;
}

bool DAClusterizerInZT_vect::purge	(	vertex_t &	y,
		track_t &	tks,
		double &	rho0,
		const double	beta
	)		const

Definition at line 448 of file DAClusterizerInZT_vect.cc.

References constexpr, gather_cfg::cout, DAClusterizerInZT_vect::track_t::dt2_, DAClusterizerInZT_vect::track_t::dz2_, DAClusterizerInZT_vect::track_t::getSize(), DAClusterizerInZT_vect::vertex_t::getSize(), mps_fire::i, gen::k, reco::ParticleMasses::k0, nt, AlCaHLTBitMon_ParallelJobs::p, DAClusterizerInZT_vect::track_t::pi_, DAClusterizerInZT_vect::vertex_t::pk_, DAClusterizerInZT_vect::vertex_t::removeItem(), DAClusterizerInZT_vect::track_t::t_, DAClusterizerInZT_vect::vertex_t::t_, DAClusterizerInZT_vect::track_t::z_, DAClusterizerInZT_vect::vertex_t::z_, and DAClusterizerInZT_vect::track_t::Z_sum_.

                                                                                                 {
  constexpr double eps = 1.e-100;
  // eliminate clusters with only one significant/unique track
  const unsigned int nv = y.getSize();
  const unsigned int nt = tks.getSize();
  
  if (nv < 2)
    return false;
  
  double sumpmin = nt;
  unsigned int k0 = nv;
  
  int nUnique = 0;
  double sump = 0;

  std::vector<double> inverse_zsums(nt), arg_cache(nt), eik_cache(nt);
  double * pinverse_zsums;
  double * parg_cache;
  double * peik_cache;
  pinverse_zsums = inverse_zsums.data();
  parg_cache = arg_cache.data();
  peik_cache = eik_cache.data();
  for(unsigned i = 0; i < nt; ++i) {
    inverse_zsums[i] = tks.Z_sum_[i] > eps ? 1./tks.Z_sum_[i] : 0.0;
  }

  for (unsigned int k = 0; k < nv; ++k) {
    
    nUnique = 0;
    sump = 0;

    const double pmax = y.pk_[k] / (y.pk_[k] + rho0 * local_exp(-beta * dzCutOff_* dzCutOff_));
    const double pcut = uniquetrkweight_ * pmax;
    for(unsigned i = 0; i < nt; ++i) {
      const auto track_z = tks.z_[i];
      const auto track_t = tks.t_[i];
      const auto botrack_dz2 = -beta*tks.dz2_[i];
      const auto botrack_dt2 = -beta*tks.dt2_[i];
      
      const auto mult_resz = track_z - y.z_[k];
      const auto mult_rest = track_t - y.t_[k];
      parg_cache[i] = botrack_dz2 * ( mult_resz * mult_resz ) + botrack_dt2 * ( mult_rest * mult_rest );
    }
    local_exp_list(parg_cache, peik_cache, nt);
    for (unsigned int i = 0; i < nt; ++i) {
      const double p = y.pk_[k] * peik_cache[i] * pinverse_zsums[i];
      sump += p;
      nUnique += ( ( p > pcut ) & ( tks.pi_[i] > 0 ) );
    }

    if ((nUnique < 2) && (sump < sumpmin)) {
      sumpmin = sump;
      k0 = k;
    }

  }
  
  if (k0 != nv) {
#ifdef VI_DEBUG
    if (verbose_) {
      std::cout  << "eliminating prototype at " << std::setw(10) << std::setprecision(4) << y.z_[k0] << "," << y.t_[k0] 
         << " with sump=" << sumpmin
         << "  rho*nt =" << y.pk_[k0]*nt
         << endl;
    }
#endif
    y.removeItem(k0);
    return true;
  } else {
    return false;
  }
}

bool DAClusterizerInZT_vect::split	(	const double	beta,
		track_t &	t,
		vertex_t &	y,
		double	threshold = 1.
	)		const

Definition at line 595 of file DAClusterizerInZT_vect.cc.

References funct::abs(), pfBoostedDoubleSVAK8TagInfos_cfi::beta, constexpr, funct::cos(), gather_cfg::cout, DAClusterizerInZT_vect::track_t::dt2_, DAClusterizerInZT_vect::track_t::dz2_, MillePedeFileConverter_cfg::e, alignBH_cfg::fixed, DAClusterizerInZT_vect::track_t::getSize(), DAClusterizerInZT_vect::vertex_t::getSize(), mps_fire::i, DAClusterizerInZT_vect::vertex_t::insertOrdered(), gen::k, nt, DAClusterizerInZT_vect::vertex_t::nut_, DAClusterizerInZT_vect::vertex_t::nuz_, AlCaHLTBitMon_ParallelJobs::p, p1, p2, DAClusterizerInZT_vect::track_t::pi_, DAClusterizerInZT_vect::vertex_t::pk_, funct::pow(), q1, DAClusterizerInZT_vect::vertex_t::removeItem(), edm::second(), funct::sin(), split, mathSSE::sqrt(), DAClusterizerInZT_vect::vertex_t::stt_, DAClusterizerInZT_vect::vertex_t::szt_, DAClusterizerInZT_vect::vertex_t::szz_, lumiQTWidget::t, DAClusterizerInZT_vect::track_t::t, DAClusterizerInZT_vect::track_t::t_, DAClusterizerInZT_vect::vertex_t::t_, DAClusterizerInZT_vect::track_t::z_, DAClusterizerInZT_vect::vertex_t::z_, and DAClusterizerInZT_vect::track_t::Z_sum_.

                                                                                                    {
  // split only critical vertices (Tc >~ T=1/beta   <==>   beta*Tc>~1)
  // an update must have been made just before doing this (same beta, no merging)
  // returns true if at least one cluster was split
  
  constexpr double epsilonz=1e-3;      // minimum split size z
  constexpr double epsilont=1e-2;      // minimum split size t
  unsigned int nv = y.getSize();
  const double twoBeta = 2.0*beta;
  
  // avoid left-right biases by splitting highest Tc first
  
  std::vector<std::pair<double, unsigned int> > critical;
  for(unsigned int k=0; k<nv; k++){    
    double Tc= get_Tc(y, k);                                                                                         
    if (beta*Tc > threshold){
      critical.push_back( make_pair(Tc, k));
    }
  }
  if (critical.empty()) return false;


  std::stable_sort(critical.begin(), critical.end(), std::greater<std::pair<double, unsigned int> >() );

  bool split=false;
  const unsigned int nt = tks.getSize();

  for(unsigned int ic=0; ic<critical.size(); ic++){
    unsigned int k=critical[ic].second;

    // split direction in the (z,t)-plane
    
    double Mzz = y.nuz_[k] - twoBeta*y.szz_[k];
    double Mtt = y.nut_[k] - twoBeta*y.stt_[k];
    double Mzt =           - twoBeta*y.szt_[k];
    const double twoMzt = 2.0*Mzt;
    double D = sqrt( pow(Mtt-Mzz, 2) + twoMzt*twoMzt);    
    double q1 = atan2(-Mtt+Mzz+D, -twoMzt);
    double l1 = 0.5*(-Mzz-Mtt+D);
    double l2 = 0.5*(-Mzz-Mtt-D);
    if( (std::abs(l1) < 1e-4)&&(std::abs(l2) < 1e-4) ){
      edm::LogWarning("DAClusterizerInZT_vect") << "warning, bad eigenvalues!  idx=" << k << " z= " << y.z_[k] << " Mzz=" << Mzz << "   Mtt=" << Mtt << "  Mzt=" << Mzt << endl; 
    }
    
    double qsplit = q1;
    double cq = cos(qsplit);
    double sq = sin(qsplit);
    if(cq < 0){ cq=-cq; sq=-sq; } // prefer cq>0 to keep z-ordering

    // estimate subcluster positions and weight
    double p1=0, z1=0, t1=0, wz1=0, wt1=0;
    double p2=0, z2=0, t2=0, wz2=0, wt2=0;
    for(unsigned int i=0; i<nt; ++i){
      if (tks.Z_sum_[i] > 1.e-100) {
    double lr = (tks.z_[i]-y.z_[k]) * cq + (tks.t[i] - y.t_[k]) * sq;
    // winner-takes-all, usually overestimates splitting
    double tl = lr < 0 ? 1.: 0.;
    double tr = 1. - tl;

    // soften it, especially at low T   
    double arg = lr * std::sqrt(beta * ( cq*cq*tks.dz2_[i] + sq*sq*tks.dt2_[i] ) ); 
    if(std::abs(arg) < 20){
      double t = local_exp(-arg);
      tl = t/(t+1.);
      tr = 1/(t+1.);
    }

    double p = y.pk_[k] * tks.pi_[i] * local_exp(-beta * Eik(tks.z_[i], y.z_[k], tks.dz2_[i], 
                                                                 tks.t_[i], y.t_[k], tks.dt2_[i])) / tks.Z_sum_[i];
    double wz = p*tks.dz2_[i];
    double wt = p*tks.dt2_[i];
    p1 += p*tl;  z1 += wz*tl*tks.z_[i]; t1 += wt*tl*tks.t_[i]; wz1 += wz*tl; wt1 += wt*tl;
    p2 += p*tr;  z2 += wz*tr*tks.z_[i]; t2 += wt*tr*tks.t_[i]; wz2 += wz*tr; wt2 += wt*tr;
      }
    }

    if(wz1 > 0){z1 /= wz1;} else {z1 = y.z_[k] - epsilonz * cq; edm::LogWarning("DAClusterizerInZT_vect") << "warning, wz1 = " << scientific << wz1 << endl;}
    if(wt1 > 0){t1 /= wt1;} else {t1 = y.t_[k] - epsilont * sq; edm::LogWarning("DAClusterizerInZT_vect") << "warning, w11 = " << scientific << wt1 << endl;}
    if(wz2 > 0){z2 /= wz2;} else {z2 = y.z_[k] + epsilonz * cq; edm::LogWarning("DAClusterizerInZT_vect") << "warning, wz2 = " << scientific << wz2 << endl;}
    if(wt2 > 0){t2 /= wt2;} else {t2 = y.t_[k] + epsilont * sq; edm::LogWarning("DAClusterizerInZT_vect") << "warning, wt2 = " << scientific << wt2 << endl;}

    unsigned int k_min1 = k, k_min2 = k;
    while(   (find_nearest(z1, t1, y, k_min1, epsilonz, epsilont) && (k_min1 != k))
         || (find_nearest(z2,t2, y, k_min2, epsilonz, epsilont) && (k_min2 !=k)) ){
      z1 = 0.5*( z1 + y.z_[k]);      t1 = 0.5*( t1 + y.t_[k]);
      z2 = 0.5*( z2 + y.z_[k]);      t2 = 0.5*( t2 + y.t_[k]);
    }
    
#ifdef VI_DEBUG
    if(verbose_){
      if (std::fabs(y.z_[k] - zdumpcenter_) < zdumpwidth_){
    std::cout << " T= " << std::setw(10) << std::setprecision(1) << 1./beta 
          << " Tc= " << critical[ic].first 
              << " direction =" << std::setprecision(4) << qsplit 
          << "    splitting (" << std::setw(8) <<  std::fixed << std::setprecision(4) << y.z_[k] <<"," << y.t_[k] << ")"
          << " --> (" << z1 << ',' << t1<< "),(" << z2 << ',' << t2 
          << ")     [" << p1 << "," << p2 << "]" ;
    if (std::fabs(z2-z1) > epsilonz || std::fabs(t2-t1) > epsilont){
      std::cout << std::endl;
    }else{
      std::cout <<  "  rejected " << std::endl;
    }
      }
    }
#endif

    if(z1>z2){
      edm::LogInfo("DAClusterizerInZT") << "warning   swapping z in split  qsplit=" << qsplit << "   cq=" << cq << "  sq=" << sq << endl;
      auto ztemp = z1;
      auto ttemp = t1;
      auto ptemp = p1;
      z1 = z2; t1=t2; p1=p2;
      z2 = ztemp; t2=ttemp; p2=ptemp; 
    }




    // split if the new subclusters are significantly separated
    if( std::fabs(z2-z1) > epsilonz || std::fabs(t2-t1) > epsilont){
      split = true;
      double pk1 = p1*y.pk_[k]/(p1+p2);
      double pk2 = p2*y.pk_[k]/(p1+p2);

      // replace the original by (z2,t2)
      y.removeItem(k);
      unsigned int k2 = y.insertOrdered(z2, t2, pk2);
      // adjust pointers if necessary
      if( !(k == k2) ){
    for(unsigned int jc=ic; jc < critical.size(); jc++){
      if (critical[jc].second > k ) {critical[jc].second--;}
      if (critical[jc].second >= k2) {critical[jc].second++;}
    }
      }
      
      // insert (z1,t1) where it belongs
      unsigned int k1 = y.insertOrdered(z1, t1, pk1);
      nv++;

     // adjust remaining pointers
      for(unsigned int jc=ic; jc < critical.size(); jc++){
        if (critical[jc].second >= k1) {critical[jc].second++;} // need to backport the ">-"?
      }

    }else{
#ifdef VI_DEBUG
      std::cout << "warning ! split rejected, too small." << endl;
#endif
    }

  }
  return split;
}

void DAClusterizerInZT_vect::splitAll

(

vertex_t &

y

)

const

Definition at line 751 of file DAClusterizerInZT_vect.cc.

References DAClusterizerInZT_vect::vertex_t::addItem(), constexpr, gather_cfg::cout, DAClusterizerInZT_vect::vertex_t::debugOut(), MillePedeFileConverter_cfg::e, DAClusterizerInZT_vect::vertex_t::extractRaw(), DAClusterizerInZT_vect::vertex_t::getSize(), gen::k, DAClusterizerInZT_vect::vertex_t::pk, DAClusterizerInZT_vect::vertex_t::pk_, DAClusterizerInZT_vect::vertex_t::t, DAClusterizerInZT_vect::vertex_t::t_, DAClusterizerInZT_vect::vertex_t::z, and DAClusterizerInZT_vect::vertex_t::z_.

                                                         {

  const unsigned int nv = y.getSize();
  
  constexpr double epsilonz = 1e-3; // split all single vertices by 10 um
  constexpr double epsilont = 1e-2; // split all single vertices by 10 ps
  constexpr double zsep = 2 * epsilonz; // split vertices that are isolated by at least zsep (vertices that haven't collapsed)
  constexpr double tsep = 2 * epsilont; 
  vertex_t y1;
  
#ifdef VI_DEBUG
  if (verbose_) {
    std::cout << "Before Split "<< std::endl;
    y.debugOut();
  }
#endif

  for (unsigned int k = 0; k < nv; k++) {
    if (
    ( ( (k == 0)        || ( y.z_[k - 1]    < (y.z_[k] - zsep)) ) &&
          ( ((k + 1) == nv) || ( y.z_[k + 1]    > (y.z_[k] + zsep)) )    ) )
      {
    // isolated prototype, split
    double new_z = y.z[k] - epsilonz;
        double new_t = y.t[k] - epsilont;
    y.z[k] = y.z[k] + epsilonz;
        y.t[k] = y.t[k] + epsilont;
    
    double new_pk = 0.5 * y.pk[k];
    y.pk[k] = 0.5 * y.pk[k];
    
    y1.addItem(new_z, new_t, new_pk);
    y1.addItem(y.z_[k], y.t_[k], y.pk_[k]); 
      }
    else if ( (y1.getSize() == 0 ) ||
          (y1.z_[y1.getSize() - 1] <  (y.z_[k] - zsep)  ) ||
              (y1.t_[y1.getSize() - 1] <  (y.t_[k] - tsep)  ))
      {
    y1.addItem(y.z_[k], y.t_[k], y.pk_[k]);
      }
    else
      {
    y1.z_[y1.getSize() - 1] = y1.z_[y1.getSize() - 1] - epsilonz;
        y1.t_[y1.getSize() - 1] = y1.t_[y1.getSize() - 1] - epsilont;
    y.z_[k] = y.z_[k] + epsilonz;
        y.t_[k] = y.t_[k] + epsilont;
    y1.addItem( y.z_[k], y.t_[k] , y.pk_[k]);
      }
  }// vertex loop

  y = y1;
  y.extractRaw();
  
#ifdef VI_DEBUG
  if (verbose_) {
    std::cout << "After split " << std::endl;
    y.debugOut();
  }
#endif
}

double DAClusterizerInZT_vect::update	(	double	beta,
		track_t &	gtracks,
		vertex_t &	gvertices,
		bool	useRho0,
		const double &	rho0
	)		const

Definition at line 165 of file DAClusterizerInZT_vect.cc.

References pfBoostedDoubleSVAK8TagInfos_cfi::beta, gather_cfg::cout, delta, DAClusterizerInZT_vect::vertex_t::ei_, DAClusterizerInZT_vect::vertex_t::ei_cache_, DAClusterizerInZT_vect::track_t::getSize(), DAClusterizerInZT_vect::vertex_t::getSize(), edm::isNotFinite(), gen::k, nt, DAClusterizerInZT_vect::vertex_t::nut_, DAClusterizerInZT_vect::vertex_t::nuz_, DAClusterizerInZT_vect::track_t::pi_, funct::pow(), DAClusterizerInZT_vect::vertex_t::se_, DAClusterizerInZT_vect::vertex_t::stt_, DAClusterizerInZT_vect::vertex_t::swt_, DAClusterizerInZT_vect::vertex_t::swz_, DAClusterizerInZT_vect::vertex_t::szt_, DAClusterizerInZT_vect::vertex_t::szz_, DAClusterizerInZT_vect::track_t::t_, l1t::tracks, mitigatedMETSequence_cff::U, electrons_cff::vertices, w, and DAClusterizerInZT_vect::track_t::Z_sum_.

Referenced by progressbar.ProgressBar::__next__(), MatrixUtil.Matrix::__setitem__(), MatrixUtil.Steps::__setitem__(), Vispa.Gui.VispaWidget.VispaWidget::autosize(), Vispa.Views.LineDecayView.LineDecayContainer::createObject(), Vispa.Views.LineDecayView.LineDecayContainer::deselectAllObjects(), Vispa.Gui.VispaWidgetOwner.VispaWidgetOwner::deselectAllWidgets(), Vispa.Gui.VispaWidget.VispaWidget::enableAutosizing(), progressbar.ProgressBar::finish(), Vispa.Gui.MenuWidget.MenuWidget::leaveEvent(), Vispa.Gui.VispaWidgetOwner.VispaWidgetOwner::mouseMoveEvent(), Vispa.Gui.MenuWidget.MenuWidget::mouseMoveEvent(), Vispa.Views.LineDecayView.LineDecayContainer::mouseMoveEvent(), Vispa.Gui.VispaWidgetOwner.VispaWidgetOwner::mouseReleaseEvent(), Vispa.Views.LineDecayView.LineDecayContainer::objectMoved(), MatrixUtil.Steps::overwrite(), Vispa.Views.LineDecayView.LineDecayContainer::removeObject(), Vispa.Gui.ConnectableWidget.ConnectableWidget::removePorts(), Vispa.Gui.FindDialog.FindDialog::reset(), Vispa.Gui.PortConnection.PointToPointConnection::select(), Vispa.Gui.VispaWidget.VispaWidget::select(), Vispa.Views.LineDecayView.LineDecayContainer::select(), Vispa.Gui.VispaWidget.VispaWidget::setText(), Vispa.Gui.VispaWidget.VispaWidget::setTitle(), Vispa.Gui.ZoomableWidget.ZoomableWidget::setZoom(), Vispa.Views.LineDecayView.LineDecayContainer::setZoom(), and Vispa.Gui.PortConnection.PointToPointConnection::updateConnection().

                                                                                    {

  //update weights and vertex positions
  // mass constrained annealing without noise
  // returns the squared sum of changes of vertex positions
  
  const unsigned int nt = gtracks.getSize();
  const unsigned int nv = gvertices.getSize();
  
  //initialize sums
  double sumpi = 0.;
  
  // to return how much the prototype moved
  double delta = 0.;
  

  // intial value of a sum
  double Z_init = 0;
  // independpent of loop
  if ( useRho0 )
    {
      Z_init = rho0 * local_exp(-beta * dzCutOff_ * dzCutOff_); // cut-off
    }
  
  // define kernels
  auto kernel_calc_exp_arg = [ beta, nv ] ( const unsigned int itrack,
                         track_t const& tracks,
                         vertex_t const& vertices ) {
    
    const auto track_z = tracks.z_[itrack];
    const auto track_t = tracks.t_[itrack];
    const auto botrack_dz2 = -beta*tracks.dz2_[itrack];
    const auto botrack_dt2 = -beta*tracks.dt2_[itrack];

    // auto-vectorized
    for ( unsigned int ivertex = 0; ivertex < nv; ++ivertex) {
      const auto mult_resz = track_z - vertices.z_[ivertex];
      const auto mult_rest = track_t - vertices.t_[ivertex];
      vertices.ei_cache_[ivertex] = botrack_dz2 * ( mult_resz * mult_resz ) + botrack_dt2 * ( mult_rest * mult_rest );
    }
  };
  
  auto kernel_add_Z = [ nv, Z_init ] (vertex_t const& vertices) -> double
    {
      double ZTemp = Z_init;
      for (unsigned int ivertex = 0; ivertex < nv; ++ivertex) { 
    ZTemp += vertices.pk_[ivertex] * vertices.ei_[ivertex];
      }
      return ZTemp;
    };

  auto kernel_calc_normalization = [ beta, nv ] (const unsigned int track_num,
                          track_t & tks_vec,
                          vertex_t & y_vec ) {
    auto tmp_trk_pi = tks_vec.pi_[track_num];
    auto o_trk_Z_sum = 1./tks_vec.Z_sum_[track_num];
    auto o_trk_err_z = tks_vec.dz2_[track_num];
    auto o_trk_err_t = tks_vec.dt2_[track_num];
    auto tmp_trk_z = tks_vec.z_[track_num];
    auto tmp_trk_t = tks_vec.t_[track_num];


    // auto-vectorized
    for (unsigned int k = 0; k < nv; ++k) {
      // parens are important for numerical stability
      y_vec.se_[k] +=  tmp_trk_pi*( y_vec.ei_[k] * o_trk_Z_sum );      
      const auto w = tmp_trk_pi * (y_vec.pk_[k] * y_vec.ei_[k] * o_trk_Z_sum);  // p_{ik}
      const auto wz = w * o_trk_err_z; 
      const auto wt = w * o_trk_err_t; 
      y_vec.nuz_[k] += wz;
      y_vec.nut_[k] += wt;
      y_vec.swz_[k] += wz * tmp_trk_z;
      y_vec.swt_[k] += wt * tmp_trk_t;
      /* this is really only needed when we want to get Tc too, mayb better to do it elsewhere? */
      const auto dsz = (tmp_trk_z - y_vec.z[k]) * o_trk_err_z;
      const auto dst = (tmp_trk_t - y_vec.t[k]) * o_trk_err_t;
      y_vec.szz_[k] += w * dsz * dsz;
      y_vec.stt_[k] += w * dst * dst;
      y_vec.szt_[k] += w * dsz * dst;
    }
  };
  
  
  for (auto ivertex = 0U; ivertex < nv; ++ivertex) {
    gvertices.se_[ivertex] = 0.0;
    gvertices.nuz_[ivertex] = 0.0;
    gvertices.nut_[ivertex] = 0.0;
    gvertices.swz_[ivertex] = 0.0;
    gvertices.swt_[ivertex] = 0.0;
    gvertices.szz_[ivertex] = 0.0;
    gvertices.stt_[ivertex] = 0.0;
    gvertices.szt_[ivertex] = 0.0;
  }
  
   
  // loop over tracks
  for (auto itrack = 0U; itrack < nt; ++itrack) {
    kernel_calc_exp_arg(itrack, gtracks, gvertices);
    local_exp_list(gvertices.ei_cache_, gvertices.ei_, nv);
        
    gtracks.Z_sum_[itrack] = kernel_add_Z(gvertices);
    if (edm::isNotFinite(gtracks.Z_sum_[itrack])) gtracks.Z_sum_[itrack] = 0.0;
    // used in the next major loop to follow
    sumpi += gtracks.pi_[itrack];
    
    if (gtracks.Z_sum_[itrack] > 1.e-100){
      kernel_calc_normalization(itrack, gtracks, gvertices);
    }
  }
  
  // now update z, t, and pk
  auto kernel_calc_zt = [  sumpi, nv, this, useRho0 ] (vertex_t & vertices ) -> double {
    
    double delta=0;

    // does not vectorizes
    for (unsigned int ivertex = 0; ivertex < nv; ++ ivertex ) {

      if (vertices.nuz_[ivertex] > 0.) {
    auto znew = vertices.swz_[ ivertex ] / vertices.nuz_[ ivertex ];
    // prevents from vectorizing if 
    delta += std::pow( vertices.z_[ ivertex ] - znew, 2 );
    vertices.z_[ ivertex ] = znew;
      }

      if(vertices.nut_[ivertex] > 0.) {
        auto tnew = vertices.swt_[ ivertex ] / vertices.nut_[ ivertex ];
    // prevents from vectorizing if 
    delta += std::pow( vertices.t_[ ivertex ] - tnew, 2 );
        vertices.t_[ ivertex ] = tnew;
      }         

#ifdef VI_DEBUG
      else {
    edm::LogInfo("sumw") << "invalid sum of weights in fit: " << endl;//vertices.sw_[ivertex] << endl;
    if (this->verbose_) {
      std::cout  << " a cluster melted away ?  pk=" << vertices.pk_[ ivertex ] << " sumw="
             << /*vertices.sw_[ivertex] << */ endl;
    }
      }
#endif
    }

    auto osumpi = 1./sumpi;
    for (unsigned int ivertex = 0; ivertex < nv; ++ivertex )
      vertices.pk_[ ivertex ] = vertices.pk_[ ivertex ] * vertices.se_[ ivertex ] * osumpi;

    return delta;
  };
  
  delta += kernel_calc_zt(gvertices);
  
  // return how much the prototypes moved
  return delta;
}

vector< TransientVertex > DAClusterizerInZT_vect::vertices	(	const std::vector< reco::TransientTrack > &	tracks,
		const int	verbosity = 0
	)		const

Definition at line 815 of file DAClusterizerInZT_vect.cc.

References a, DAClusterizerInZT_vect::vertex_t::addItem(), pfBoostedDoubleSVAK8TagInfos_cfi::beta, fastPrimaryVertexProducer_cfi::clusters, gather_cfg::cout, DAClusterizerInZT_vect::track_t::dt2_, FrontierConditions_GlobalTag_cff::dump, DAClusterizerInZT_vect::track_t::dz2_, MillePedeFileConverter_cfg::e, DAClusterizerInZT_vect::track_t::extractRaw(), lumiContext::fill, DAClusterizerInZT_vect::track_t::getSize(), DAClusterizerInZT_vect::vertex_t::getSize(), mps_fire::i, edm::isNotFinite(), gen::k, MatrixUtil::merge(), min(), nt, AlCaHLTBitMon_ParallelJobs::p, DAClusterizerInZT_vect::track_t::pi_, DAClusterizerInZT_vect::vertex_t::pk_, split, mathSSE::sqrt(), DAClusterizerInZT_vect::track_t::t_, DAClusterizerInZT_vect::vertex_t::t_, electronIdCutBased_cfi::threshold, DAClusterizerInZT_vect::track_t::tt, update, findQualityFiles::v, DAClusterizerInZT_vect::track_t::z_, DAClusterizerInZT_vect::vertex_t::z_, and DAClusterizerInZT_vect::track_t::Z_sum_.

                                                                                                     {
  track_t && tks = fill(tracks);
  tks.extractRaw();
  
  unsigned int nt = tks.getSize();
  double rho0 = 0.0; // start with no outlier rejection
  
  vector<TransientVertex> clusters;
  if (tks.getSize() == 0) return clusters;
  
  vertex_t y; // the vertex prototypes
  
  // initialize:single vertex at infinite temperature
  y.addItem( 0, 0, 1.0);
  
  int niter = 0; // number of iterations
  
  
  // estimate first critical temperature
  double beta = beta0(betamax_, tks, y);
#ifdef VI_DEBUG
  if ( verbose_) std::cout << "Beta0 is " << beta << std::endl;
#endif
  
  niter = 0;
  while ((update(beta, tks, y, false, rho0) > 1.e-6) && 
     (niter++ < maxIterations_)) {}

  // annealing loop, stop when T<minT  (i.e. beta>1/minT)

  double betafreeze = betamax_ * sqrt(coolingFactor_);

  while (beta < betafreeze) {
    if(useTc_){
      update(beta, tks,y, false, rho0);
      zorder(y);
      while(merge(y, beta)){update(beta, tks, y, false, rho0);}
      split(beta, tks, y);
      beta=beta/coolingFactor_;
    }else{
      beta=beta/coolingFactor_;
      splitAll(y);
    }
    
    // make sure we are not too far from equilibrium before cooling further
    niter = 0;
    while ((update(beta, tks, y, false, rho0) > 1.e-6) && 
       (niter++ < maxIterations_)) {}

#ifdef VI_DEBUG
   if(verbose_){ dump( beta, y, tks, 0); }
#endif
  }
  

  if(useTc_){
    //last round of splitting, make sure no critical clusters are left
#ifdef VI_DEBUG
    if(verbose_){ std::cout << "last spliting at " << 1./beta << std::endl; }
#endif
    update(beta, tks,y, false, rho0);// make sure Tc is up-to-date
    zorder(y);
    while(merge(y,beta)){update(beta, tks,y, false, rho0);}
    unsigned int ntry=0;
    double threshold = 1.0;
    while( split(beta, tks, y, threshold) && (ntry++<10) ){
      niter=0; 
      while((update(beta, tks,y, false, rho0)>1.e-6)  && (niter++ < maxIterations_)){}
      zorder(y);
#ifdef VI_DEBUG
      if(verbose_) dump(beta, y, tks, 2); 
#endif

      while(merge(y,beta)){update(beta, tks,y, false, rho0);}
#ifdef VI_DEBUG
      if(verbose_){ 
    std::cout << "after final splitting,  try " <<  ntry << std::endl; 
    dump(beta, y, tks, 2); 
      }
#endif
      // relax splitting a bit to reduce multiple split-merge cycles of the same cluster
      threshold *= 1.1; 
    }
  }else{
    // merge collapsed clusters 
    while(merge(y,beta)){update(beta, tks,y, false, rho0);}  
  }
  
#ifdef VI_DEBUG
  if (verbose_) {
    update(beta, tks,y, false, rho0);
    std::cout  << "dump after 1st merging " << endl;
    dump(beta, y, tks, 2);
  }
#endif
  
  
  // switch on outlier rejection at T=minT
  if(dzCutOff_ > 0){
    rho0 = 1./nt;
    for(unsigned int a=0; a<10; a++){ update(beta, tks, y, true, a*rho0/10);} // adiabatic turn-on
  }

  niter=0;
  while ((update(beta, tks, y, true, rho0) > 1.e-8) && (niter++ < maxIterations_)) {};
#ifdef VI_DEBUG
  if (verbose_) {
    std::cout  << "dump after noise-suppression, rho0=" << rho0  << "  niter = " << niter << endl;
    dump(beta, y, tks, 2);
  }
#endif

  // merge again  (some cluster split by outliers collapse here)
  zorder(y);
  while (merge(y, beta)) {update(beta, tks, y, true, rho0); }
#ifdef VI_DEBUG
  if (verbose_) {
    std::cout  << "dump after merging " << endl;
    dump(beta, y, tks, 2);
  }
#endif

  // go down to the purging temperature (if it is lower than tmin)
  while( beta < betapurge_ ){
    beta = min( beta/coolingFactor_, betapurge_);
    niter = 0;
    while ((update(beta, tks, y, false, rho0) > 1.e-8) && (niter++ < maxIterations_)) {}
  }


  // eliminate insigificant vertices, this is more restrictive at higher T
  while (purge(y, tks, rho0, beta)) {
    niter = 0;
    while (( update(beta, tks, y, true, rho0) >  1.e-6 ) && (niter++ < maxIterations_)) {
      zorder(y);
    }
  }

#ifdef VI_DEBUG
  if (verbose_) {
    update(beta, tks,y, true, rho0);
    std::cout  << " after purging " << std:: endl;
    dump(beta, y, tks, 2);
  }
#endif

  // optionally cool some more without doing anything, to make the assignment harder
  while( beta < betastop_ ){
    beta = min( beta/coolingFactor_, betastop_);
    niter =0;
    while ((update(beta, tks, y, true, rho0) > 1.e-8) && (niter++ < maxIterations_)) {}
    zorder(y);
  }

#ifdef VI_DEBUG
  if (verbose_) {
    std::cout  << "Final result, rho0=" << std::scientific << rho0 << endl;
    dump(beta, y, tks, 2);
  }
#endif


  // new, merge here and not in "clusterize"
  // final merging step
  double betadummy = 1;
  while( merge(y, betadummy) );

  // select significant tracks and use a TransientVertex as a container
  GlobalError dummyError(0.01, 0, 0.01, 0., 0., 0.01);
  
  // ensure correct normalization of probabilities, should makes double assignment reasonably impossible
  const unsigned int nv = y.getSize();
  for (unsigned int k = 0; k < nv; k++)
     if ( edm::isNotFinite(y.pk_[k]) || edm::isNotFinite(y.z_[k]) ) { y.pk_[k]=0; y.z_[k]=0;}

  for (unsigned int i = 0; i < nt; i++) // initialize
    tks.Z_sum_[i] = rho0 * local_exp(-beta * dzCutOff_ * dzCutOff_);

  // improve vectorization (does not require reduction ....)
  for (unsigned int k = 0; k < nv; k++) {
     for (unsigned int i = 0; i < nt; i++)  
       tks.Z_sum_[i] += y.pk_[k] * local_exp(-beta * Eik(tks.z_[i], y.z_[k],tks.dz2_[i], tks.t_[i], y.t_[k],tks.dt2_[i]));
  }


  for (unsigned int k = 0; k < nv; k++) {
    GlobalPoint pos(0, 0, y.z_[k]);
    
    vector<reco::TransientTrack> vertexTracks;
    for (unsigned int i = 0; i < nt; i++) {
      if (tks.Z_sum_[i] > 1e-100) {
    
    double p = y.pk_[k] * local_exp(-beta * Eik(tks.z_[i], y.z_[k], tks.dz2_[i],
                                                    tks.t_[i], y.t_[k], tks.dt2_[i] )) / tks.Z_sum_[i];
    if ((tks.pi_[i] > 0) && (p > mintrkweight_)) {
      vertexTracks.push_back(*(tks.tt[i]));
      tks.Z_sum_[i] = 0; // setting Z=0 excludes double assignment
    }
      }
    }
    TransientVertex v(pos, y.t_[k], dummyError, vertexTracks, 0);
    clusters.push_back(v);
  }

  return clusters;

}

void DAClusterizerInZT_vect::zorder

(

vertex_t &

y

)

const

Definition at line 327 of file DAClusterizerInZT_vect.cc.

References DAClusterizerInZT_vect::vertex_t::extractRaw(), DAClusterizerInZT_vect::vertex_t::getSize(), gen::k, DAClusterizerInZT_vect::vertex_t::pk, DAClusterizerInZT_vect::vertex_t::t, and DAClusterizerInZT_vect::vertex_t::z.

                                                    {
  const unsigned int nv = y.getSize();

  if (nv < 2) return;


  bool reordering = true;
  bool modified = false;

  while(reordering){
    reordering = false;
    for (unsigned int k = 0; (k + 1) < nv; k++) {
      if ( y.z[k + 1] < y.z[k] ) {
    auto ztemp =  y.z[k];   y.z[k] = y.z[k+1];    y.z[k+1] = ztemp;
    auto ttemp =  y.t[k];   y.t[k] = y.t[k+1];    y.t[k+1] = ttemp;
    auto ptemp =  y.pk[k];  y.pk[k] = y.pk[k+1];  y.pk[k+1] = ptemp;
    reordering = true;
      }
    }
    modified |= reordering;
  }
  
  if( modified ) y.extractRaw();
}

Member Data Documentation

double DAClusterizerInZT_vect::betamax_

private

Definition at line 255 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::betapurge_

private

Definition at line 266 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::betastop_

private

Definition at line 256 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::coolingFactor_

private

Definition at line 254 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::d0CutOff_

private

Definition at line 258 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::dtCutOff_

private

Definition at line 259 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::dzCutOff_

private

Definition at line 257 of file DAClusterizerInZT_vect.h.

int DAClusterizerInZT_vect::maxIterations_

private

Definition at line 253 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::mintrkweight_

private

Definition at line 262 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::tmerge_

private

Definition at line 265 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::uniquetrkweight_

private

Definition at line 263 of file DAClusterizerInZT_vect.h.

bool DAClusterizerInZT_vect::useTc_

private

Definition at line 260 of file DAClusterizerInZT_vect.h.

bool DAClusterizerInZT_vect::verbose_

private

Definition at line 247 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::vertexSize_

private

Definition at line 251 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::vertexSizeTime_

private

Definition at line 252 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::zdumpcenter_

private

Definition at line 248 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::zdumpwidth_

private

Definition at line 249 of file DAClusterizerInZT_vect.h.

double DAClusterizerInZT_vect::zmerge_

private

Definition at line 264 of file DAClusterizerInZT_vect.h.