namespace rime{ static const double dr=0.16510; // DOM radius static const double pmin=1e-9; // minimum hit probability static const double logn=1.0; // 100% systematic error belt. Set to 0 to disable static const double dura=2.e3; // typical event duration [ns] static const double nois=0.5e-6; // noise hit rate [1/ns] static const double umin=nois*dura;// number of noise hits per DOM in an event // efficiency correction: SPE charge mean static const double efcr=0.75*0.9; // approx. equal to 1-discriminator losses // times (1-losses, e.g., cable shadowing) static const double rho=0.9216; // ice density static const double arho=0.26*rho, brho=0.36e-3*rho; static const double C=2450.08*(M_PI*dr*dr), F=5.21*0.924/rho; struct dir{ double n[3]; dir(){} dir(const double n[]){ for(int i=0; i<3; i++) this->n[i]=n[i]; } bool operator!= (const dir& rhs) const { return n[0] != rhs.n[0] || n[1] != rhs.n[1] || n[2] != rhs.n[2]; } bool operator== (const dir& rhs) const { return n[0] == rhs.n[0] && n[1] == rhs.n[1] && n[2] == rhs.n[2]; } bool operator< (const dir& rhs) const { return n[0] < rhs.n[0] || (n[0] == rhs.n[0] && (n[1] < rhs.n[1] || (n[1] == rhs.n[1] && n[2] < rhs.n[2]))); } }; struct vert:dir{ double f; vert(){} vert(const dir n) : dir(n){ f=NAN; } vert(const dir n, double f) : dir(n){ this->f=f; } vert(const double n[], double f) : dir(n){ this->f=f; } }; ostream& operator<<(ostream& out, const dir& n){ out<a[i]=a[i]; double sum=a[0]; for(int i=2; i<=10; i+=2){ sum+=a[i]/(i+1); } ave=sum; // average sensitivity } } asens; void check(double & x){ if(!isfinite(x) || x<0) x=0; } struct Ice{ double wv; // light wavelength double np; // phase refractive index double ng; // group refractive index double c, cm; // speed of light in vacuum and in medium double na; // average propagation refractive index double le; // scattering length double la; // absorption length private: bool kurt; // whether kurt table is used int size; // size of kurt table double dh, hmin, hmax; // step, min and max depth double *abs, *sca; // arrays of absorption and scattering values double *abs_sum, *sca_sum; // arrays of absorption and scattering depth-integrated values public: double coschr, sinchr, tanchr; // cos, sin, and tan of the cherenkov angle Ice() : kurt(false), wv(0.4), c(0.299792458), le(20.), la(100.){ if(wv<0.3) wv=0.3; else if(wv>0.6) wv=0.6; double wv2=wv*wv; double wv3=wv*wv2; double wv4=wv*wv3; np=1.55749-1.57988*wv+3.99993*wv2-4.68271*wv3+2.09354*wv4; ng=np*(1+0.227106-0.954648*wv+1.42568*wv2-0.711832*wv3); na=(np*ng-1)/sqrt(np*np-1); cm=c/ng; coschr=1/np; sinchr=sqrt(1-coschr*coschr); tanchr=sinchr/coschr; double A, B, D, E, a, k; double Ae, Be, De, Ee, ae, ke; bool flag=true; ifstream inFile; inFile.open("icemodel.par", ifstream::in); if(flag=!inFile.fail()){ if(flag) flag=(inFile >> a >> ae); if(flag) flag=(inFile >> k >> ke); if(flag) flag=(inFile >> A >> Ae); if(flag) flag=(inFile >> B >> Be); if(flag) flag=(inFile >> D >> De); if(flag) flag=(inFile >> E >> Ee); if(!flag) cerr << "File icemodel.par found, but is corrupt, falling back to bulk ice" << endl; inFile.close(); if(!flag) return; } else{ cerr<<"Using homogeneous ice"< dp, be, ba, td; inFile.open("icemodel.dat", ifstream::in); if(!inFile.fail()){ size=0; double dpa, bea, baa, tda; while(inFile >> dpa >> bea >> baa >> tda){ dp.push_back(dpa); be.push_back(bea); ba.push_back(baa); td.push_back(tda); size++; } if(size<2){ cerr << "File icemodel.dat found, but is corrupt, falling back to bulk ice" << endl; return; } inFile.close(); } else{ cerr<<"Using homogeneous ice"<1) if(fabs(dp[i]-dp[i-1]-dh)>dh*1.e-10) { cerr << "Ice table does not use uniform depth spacing, falling back to bulk ice" << endl; return; } sca[i]=be[i]*l_a; abs[i]=(D*ba[i]+E)*l_k+ABl*(1+0.01*td[i]); if(sca[i]<=0 || abs[i]<=0){ cerr << "Invalid value of ice parameter, falling back to bulk ice" << endl; return; } if(1450=size) i=size-1; this->le=1/sca[i]; this->la=1/abs[i]; } } // calculates average ice parameters between given depths using prescription by G. Japaridze and M. Ribordy void ll(double x1, double x2){ if(kurt){ double zz, rsca, rabs; if(x2=size) i=size-1; if(x1==x2){ rsca=sca[i]; rabs=abs[i]; } else{ int f=(int) floor((x2-hmin)/dh); if(f<0) f=0; else if(f>=size) f=size-1; rsca=((sca_sum[f]-sca_sum[i])*dh-((hmin+(f+1)*dh)-x2)*sca[f]+((hmin+(i+1)*dh)-x1)*sca[i])/(x2-x1); rabs=((abs_sum[f]-abs_sum[i])*dh-((hmin+(f+1)*dh)-x2)*abs[f]+((hmin+(i+1)*dh)-x1)*abs[i])/(x2-x1); } this->le=1/rsca; this->la=1/rabs; } } void set(double le, double la){ this->le=le, this->la=la; } double flux(double d, double coseta, int freco){ static const double dlam=1.07; // fitted propagation length static const double dnrm=1.26; // and normalization corrections if(d1?gsl_sf_lngamma(Q+1):0; } double gaus(double x, double sig){ x/=sig; return exp(-x*x/2)/(SQRT2PI*sig); } struct cpdf{ // holds the pdf parameterization cpdf(double ita, double sig, double ef, double es, double af, double as){ this->ita=ita, this->sig=sig; this->ef=ef, this->es=es, this->af=af, this->as=as; } double addn(double x, double t){ return log(x*(1-umin)+umin*gaus(t, dura)); } double lnscat(double d, double t, double Q){ set(d); return get_rmsk()&32 ? addn(npandel(t, Q), t) : Q*addn(cpandel(t), t)-lnfact(Q); } double lnp(double d, double t, double Q){ set(d); return get_rmsk()&32 ? addn(npandel(t, Q), t) : addn(cpandel(t), t); } pair avt(double d){ set(d); return make_pair(xi/rho, sig*sig+xi/(rho*rho)); } private: double ita; // cpandel 1/tau double sig; // cpandel jitter double ef, es; // multiplicative factor: pandel lambda/eff scattering length=ef+es*d double af, as; // multiplicative factor: pandel absorption/absorption length=af+as*d double xi, rho; // common pandel parameters void set(double d){ // must be called before pandel functions double le=(ef+es*d)*ice.le, la=(af+as*d)*ice.la; xi=d/le, rho=ita+ice.cm/la; } double pandel(double t){ if(xi<=0 || t<=0) return 0; else{ double trho=t*rho; return rho*exp((xi-1)*log(trho)-trho-gsl_sf_lngamma(xi)); } } double cpandel(double t){ // cpandel parameterization according to G. Japaridze double result; if(sig<=0) result=pandel(t); else if(xi>30 || t<-150 || t>3500) result=0; else if(xi<=0.1*rho*sig){ // Zero distance result=gaus(t, sig); } /* else if(t0 double eta=rho*sig-t/sig; result=pow(rho*sig, xi)*exp(-t*t/(2*sig*sig))/(M_SQRTPI*sig)* gsl_sf_hyperg_U(xi/2, 0.5, eta*eta/2)/pow(2, (xi+1)/2); } */ else if(xi<5 && -5*sig0){ // Region 2 double trho=t*rho, rhosig=rho*sig; result=exp(rhosig*rhosig/2)* (rho*exp((xi-1)*log(trho)-trho-gsl_sf_lngamma(xi))); } else{ // Region 5 result=pow(1-t/(rho*sig*sig), -xi)*gaus(t, sig); } } else{ double eta=rho*sig-t/sig, xi2=2*xi-1; double z=fabs(eta)/sqrt(4*xi-2); double sqrz=sqrt(1+z*z); double k=0.5*(z*sqrz+log(z+sqrz)); double b=0.5*(z/sqrz-1); double b2=b*b, b12=b/12; double N1=b12*(20*b2+30*b+9); double N2=0.5*b12*b12*(6160*b2*b2+18480*b2*b+19404*b2+8028*b+945); if(eta<0){ // Region 3 double Phi=1-N1/xi2+N2/(xi2*xi2); double alpha=-0.5*(t*t/(sig*sig)+xi+log(sqrz))+0.25*(eta*eta+1)+ k*xi2-xi*M_LN2/2+(xi-1)/2*log(xi2)+xi*log(rho)+(xi-1)*log(sig); result=exp(alpha)*Phi/gsl_sf_gamma(xi); } else{ // Region 4 double Psi=1+N1/xi2+N2/(xi2*xi2); result=rho*pow(rho*sig, xi-1)* exp(-t*t/(2*sig*sig)+0.25*(eta*eta-1)+xi/2-k*xi2)* Psi*pow(2, (xi-1)/2)/(pow(xi2, xi/2)*SQRT2PI*sqrt(sqrz)); } } check(result); return result; } double cf(double t){ if(xi<=0) return t<0?1:0; return t>0?gsl_sf_gamma_inc_Q(xi, rho*t):1; } double dcf(double t, double s){ if(s<0.1*t) return pandel(t); else return (cf(t-s/2)-cf(t+s/2))/s; } double dcf(double t, double s, double Q){ if(s<0.1*t) return Q*pandel(t)*pow(cf(t), Q-1); else return (pow(cf(t-s/2), Q)-pow(cf(t+s/2), Q))/s; } double npandel(double t, double Q){ if(Q>1){ // convoluted MPE pandel by DIMA if(sig<=0) return Q*cpandel(t)*pow(cf(t), Q-1); else if(xi<=0.1*rho*sig) return gaus(t, sig); else{ double s=2*M_SQRT3*sig, r=rho; double sum=dcf(t, s, Q); rho=r*pow(Q, 1/xi); sum+=cpandel(t)-dcf(t, s); rho=r; check(sum); return sum; } } else return cpandel(t); } }; static cpdf ppf[2] = { // cpandel structures cpdf(0, 4, 2.0, 0.0, 1.0, 0.0), // track cpdf(0, 4, 2.0, 0.0, 1.0, 0.0) // cascade }; void test(){ cpdf c(0, 4, 2.0, 0.0, 0.5, 0.0); for(double t=-50; t<950; t+=0.1) cout<t=t, this->q=q; } bool operator< (const hit& rhs) const { return t < rhs.t || (t == rhs.t && (q < rhs.q)); } }; struct set{ double x, y, z, q, eff; set(const mydom& dom) : q(0.){ x=dom.x, y=dom.y, z=dom.z; eff=dom.eff; } double rn, dd, tdel, coseta, le, la; void loc() const { ice.set(le, la); } double deff() const { return dd; } pair avt(cpdf * pdf) const { loc(); return pdf->avt(deff()); } }; struct sett:set{ vector h; double t, ave; sett(const mydom& dom):set(dom), ave(0.){ } }; struct setq:set{ double p; bool sat; setq(const set& dom, bool sat):set(dom){ this->sat=sat; } setq(const mydom& dom):set(dom), sat(false){ } }; Miniball<3> ball; map hits; map hnhs; // hit/no-hits double step; int nhits, hitdoms, strings; vtemp(const multe& e, int freco, gsl_rng * g = NULL) : step(15.){ this->freco=freco; pdf=&ppf[freco-1]; rmsk=get_rmsk(); lcsp=nlc(); xc=0, yc=0, zc=0, qtot=0; for(vector::const_iterator i = e.events.begin(); i!=e.events.end(); ++i){ const mydom& dom = idoms().find(i->id)->second; int om = dom.om, str=dom.str; if(i->Q>=0 && i->fi>=0 && om>=1 && om<=60){ double q=round(i->Q); if(q<=0) q=1; if(g!=NULL){ q=gsl_ran_poisson(g, q); if(q<=0) continue; } { xc+=q*dom.x, yc+=q*dom.y, zc+=q*dom.z, qtot+=q; } { mykey key=mykey(str, om); map::iterator it=hits.find(key); if(it==hits.end()) hits.insert(make_pair(key, sett(dom))); sett & dom = hits.find(key)->second; vector & h = dom.h; double t=((long long)(i->gt-e.t0))/10.; h.push_back(hit(t, q)); dom.q+=q; dom.ave+=q*t; } } } nhits=0; map strs; for(map::iterator i=hits.begin(); i!=hits.end(); ++i){ sett & dom = i->second; vector & h = dom.h; const mykey & key = i->first; nhits+=h.size(); strs[key.str]++; const double pre=1.e-4; // pre-pulse probability sort(h.begin(), h.end()); dom.ave/=dom.q; dom.t=h.front().t; double q=0, qpre=dom.q*pre; for(vector::const_iterator j=h.begin(); j!=h.end(); j++){ q+=j->q; if(q>qpre) break; dom.t=j->t; } if(rmsk&32){ h.clear(); h.push_back(hit(dom.t,dom.q)); } } strings=strs.size(); hitdoms=hits.size(); norm=rmsk&32?hitdoms:qtot; if(qtot>0) xc/=qtot, yc/=qtot, zc/=qtot; if(rmsk&16){ for(map::const_iterator i=hits.begin(); i!=hits.end(); ++i){ const mykey & key = i->first; const sett & dom = i->second; Point<3> p; p[0]=dom.x, p[1]=dom.y, p[2]=dom.z; ball.check_in(p); map::const_iterator it=mykeys().find(key); if(it!=mykeys().end()){ map::const_iterator cdom = idoms().find(it->second); hnhs.insert(make_pair(key, setq(dom, dom.q>cdom->second.st))); } } ball.build(); Point<3> c=ball.center(); double cx=c[0], cy=c[1], cz=c[2]; double r2=ball.squared_radius(); for(map::const_iterator cdom = idoms().begin(); cdom!=idoms().end(); ++cdom){ const mydom& dom = cdom->second; if(dom.hv>0){ double dx=dom.x-cx, dy=dom.y-cy, dz=dom.z-cz; if(dx*dx+dy*dy+dz*dz::iterator i=hnhs.find(key); if(i==hnhs.end()) hnhs.insert(make_pair(key, setq(dom))); } } } int str=0, om=0, pad=1; for(map::const_iterator i = hnhs.begin(); i!=hnhs.end(); ++i){ const mykey& key = i->first; if(key.str>str){ for(int i=1; i<=pad; i++){ const mykey newkey(str, om+i); map::const_iterator it=mykeys().find(newkey); if(it!=mykeys().end()){ map::const_iterator cdom = idoms().find(it->second); const mydom& dom = cdom->second; if(dom.hv>0) hnhs.insert(make_pair(newkey, setq(dom))); } } str=key.str; for(int i=1; i<=pad; i++){ const mykey newkey(str, om-i); map::const_iterator it=mykeys().find(newkey); if(it!=mykeys().end()){ map::const_iterator cdom = idoms().find(it->second); const mydom& dom = cdom->second; if(dom.hv>0) hnhs.insert(make_pair(newkey, setq(dom))); } } } else if(key.str>0){ for(int i=om+1; i::const_iterator it=mykeys().find(newkey); if(it!=mykeys().end()){ map::const_iterator cdom = idoms().find(it->second); const mydom& dom = cdom->second; if(dom.hv>0) hnhs.insert(make_pair(newkey, setq(dom))); } } } om=key.om; } } } void ini(set& dom){ double dx=dom.x-x0, dy=dom.y-y0, dz=dom.z-z0, ze; if(freco==1){ double rn=nx*dx+ny*dy+nz*dz; dx-=rn*nx, dy-=rn*ny, dz-=rn*nz; dom.rn=rn-this->rn; ze=dom.z-dz; dom.dd=sqrt(dx*dx+dy*dy+dz*dz); dom.tdel=(rn+dom.dd*ice.na)/ice.c; rn=max(dr, dom.dd)/ice.tanchr; dx+=rn*nx, dy+=rn*ny, dz+=rn*nz; dom.coseta=dz/sqrt(dx*dx+dy*dy+dz*dz); } else if(freco==2){ dom.rn=0; ze=z0; dom.dd=sqrt(dx*dx+dy*dy+dz*dz); dom.tdel=dom.dd/ice.cm; dom.coseta=dz/max(dr, dom.dd); } ice.ll(-dom.z, -ze); dom.le=ice.le, dom.la=ice.la; } double llt(double t, bool reset = false){ double result=0; for(map::iterator i=hits.begin(); i!=hits.end(); ++i){ sett & dom = i->second; if(reset) ini(dom); dom.loc(); const vector & h = dom.h; for(vector::const_iterator j=h.begin(); j!=h.end(); ++j) result+=pdf->lnscat(dom.deff(), j->t-(t+dom.tdel), j->q); if(!(rmsk&32)) result+=lnfact(dom.q); } return -result; } double dllt(const multe& e){ gsl_rng * g = gsl_rng_alloc(gsl_rng_default); const int num=50; double ave=0, rms=0; for(int i=0; i::iterator i=hits.begin(); i!=hits.end(); ++i){ sett& dom=i->second; ini(dom); double q=dom.q; double w=q/dom.avt(pdf).second; sum+=w*(dom.t-dom.tdel); num+=w; } if(num>0) sum/=num; if(rmsk&4) return result=llt(t0=sum); { bool verbose=false; int iter=0, max_iter=100; const gsl_min_fminimizer_type *T; gsl_min_fminimizer *s; gsl_function F; const double step=100; double a=sum-step, m=sum, b=sum+step; double fa=llt(a), fm=llt(m), fb=llt(b); for(int i=0; i<10; ){ if(verbose) printf("i a(%g)=%g m(%g)=%g b(%g)=%g\n", a, fa, m, fm, b, fb); if(fa q; vector > p; const double dtrs=50; // max. distance to the closest DOM at ends const double dpad=100; // padding to the segment of track with hits double dmin=0, dmax=0; // fit end points for(map::iterator i = hnhs.begin(); i!=hnhs.end(); ++i){ setq& dom=i->second; if(flag){ ini(dom); dom.p=ice.flux(dom.deff(), dom.coseta, freco)*dom.eff*efcr*exp(-brho*dom.rn); } if(dom.q>0 && dom.dddmax) dmax=dom.rn; } } int jmin=(int) round((dmin-dpad)/step); int jmax=(int) round((dmax+dpad)/step); int jnum=jmax-jmin+1; for(map::iterator i = hnhs.begin(); i!=hnhs.end(); ++i){ setq& dom=i->second; if(dom.sat) continue; vector aux; for(int j=jmin; j<=jmax; j++){ double rn=this->rn+step*j; double dx=dom.x-x0, dy=dom.y-y0, dz=dom.z-z0; dx-=rn*nx, dy-=rn*ny, dz-=rn*nz; dom.dd=sqrt(dx*dx+dy*dy+dz*dz); dom.coseta=dz/max(dr, dom.dd); double ze=dom.z-dz; ice.ll(-dom.z, -ze); double cospsi=(nx*dx+ny*dy+nz*dz)/max(dr, dom.dd); double p=ice.flux(dom.deff(), dom.coseta, 2)*dom.eff*efcr; p*=ice.aprof(cospsi, dom.dd); aux.push_back(p); } aux.push_back(dom.p/step); p.push_back(aux); q.push_back(dom.q); } if(!p.empty()){ const int n=jnum+1, m=q.size(); int mda=m, nsetp, index[n]; double A[m*n], B[m], rnorm, w[n], zz[m], x[n]; for(int i=0; iEc=max(dl/(1-exp(-brho*dx))-arho/brho, dl); track->qtot=qtot, track->qrec=qrec; track->set(jmin); for(int j=0; jlosses.push_back(x[j]); } // result=-f(qrec, qtot, 0.1); } return result; } double rllx(bool flag, preco * track = NULL){ return rmsk&8 ? ille(false, track)/hitdoms : 0; } // calculates energy likelihood double ille(){ if(!(rmsk&16)) return nn=na=0; double result=0, sum=0, num=0; for(map::iterator i = hnhs.begin(); i!=hnhs.end(); ++i){ setq& dom=i->second; ini(dom); dom.p=ice.flux(dom.deff(), dom.coseta, freco)*dom.eff*efcr*exp(-brho*dom.rn); sum+=dom.q; num+=max(pmin, dom.p); } if(num>0) sum/=num; na=sum; { bool verbose=false; int iter=0, max_iter=100; const gsl_min_fminimizer_type *T; gsl_min_fminimizer *s; gsl_function F; const double step=2; double a=sum/step, m=sum, b=sum*step; double fa=lle(a), fm=lle(m), fb=lle(b); for(int i=0; i<10; ){ if(verbose) printf("e a(%g)=%g m(%g)=%g b(%g)=%g\n", a, fa, m, fm, b, fb); if(fanx, ny=v->ny, nz=v->nz; x0=v->x0, y0=v->y0, z0=v->z0; t0=v->t0; set_ini(); return llc(); } double llc(double x, double y, double z=0){ t0=0; transf(x, y, z); return llc(); } double llh(double n[], bool reset=true, bool full=false, double old=NAN){ // reset=true; full=true; bool verbose=false; double result=0; set_ini(n, reset); if(full){ pbasis(); int num=freco==1?2:3; int iter=0, max_iter=100; double size; gsl_vector * x = gsl_vector_alloc(num); if(reset) gsl_vector_set_all(x, 0); else{ double dx=x0-xc, dy=y0-yc, dz=z0-zc; gsl_vector_set(x, 0, dx*p1[0]+dy*p1[1]+dz*p1[2]); gsl_vector_set(x, 1, dx*p2[0]+dy*p2[1]+dz*p2[2]); if(num>2) gsl_vector_set(x, 2, dx*nx+dy*ny+dz*nz); } gsl_vector * ss = gsl_vector_alloc(num); gsl_vector_set_all(ss, 1); gsl_multimin_function F; F.n = num; F.f = fllc; F.params = this; const gsl_multimin_fminimizer_type * T = gsl_multimin_fminimizer_nmsimplex; gsl_multimin_fminimizer * s = gsl_multimin_fminimizer_alloc(T, num); gsl_multimin_fminimizer_set(s, &F, x, ss); for(; iter2) printf("%5d %10.3e %10.3e %10.3e f() = %7.3f size = %.3f\n", iter, gsl_vector_get(s->x, 0), gsl_vector_get(s->x, 1), gsl_vector_get(s->x, 2), s->fval, size); else printf("%5d %10.3e %10.3e f() = %7.3f size = %.3f\n", iter, gsl_vector_get(s->x, 0), gsl_vector_get(s->x, 1), s->fval, size); } if(GSL_SUCCESS==gsl_multimin_test_size(size, 0.05)){ if(verbose) printf("Converged!\n"); break; } } gsl_vector * z; if(reset || isnan(old) || s->fvalx; result=s->fval; } else{ if(verbose) cout<<"Re-using previoius best: "<abs(n0)){ i0=i; n0=n[i]; } int i1=(i0+1)%3, i2=(i0+2)%3; double n1=n[i1], n2=n[i2], nq=n0*n0; double r1=1/sqrt(nq+n1*n1), r2=1/sqrt(nq+n2*n2); p1[i0]=-n1*r1; p1[i1]=n0*r1; p1[i2]=0; p2[i0]=-n2*r2; p2[i1]=0; p2[i2]=n0*r2; } { double q1[3], q2[3], r1=0, r2=0; for(int i=0; i<3; i++){ double a1=p1[i]-p2[i]; q1[i]=a1; r1+=a1*a1; double a2=p1[i]+p2[i]; q2[i]=a2; r2+=a2*a2; } r1=1/sqrt(r1); r2=1/sqrt(r2); for(int i=0; i<3; i++){ p1[i]=q1[i]*r1; p2[i]=q2[i]*r2; } } } double llh(vert& v, map& cache){ map::const_iterator i = cache.find(v); if(i != cache.end()) v.f = i->second; else{ v.f = llh(v.n, false); cache.insert(make_pair(v, v.f)); } return v.f; } }; double fllt(double t, void *p){ return ((vtemp *)p)->llt(t); } double flle(double n, void *p){ return ((vtemp *)p)->lle(n); } double fllc(const gsl_vector *x, void *p){ return ((vtemp *)p)->llc(gsl_vector_get(x, 0), gsl_vector_get(x, 1), x->size>2?gsl_vector_get(x, 2):0); } template struct Face{ vert v[3]; Face(const vert & x, const vert & y, const vert & z){ v[0]=x, v[1]=y, v[2]=z; } void half(vert h[]){ for(int i=0; i<3; i++){ h[0].n[i]=v[1].n[i]+v[2].n[i]; h[1].n[i]=v[2].n[i]+v[0].n[i]; h[2].n[i]=v[0].n[i]+v[1].n[i]; } double r[3]={0, 0, 0}; for(int i=0; i<3; i++) for(int j=0; j<3; j++) r[i]+=h[i].n[j]*h[i].n[j]; for(int i=0; i<3; i++){ r[i]=1/sqrt(r[i]); for(int j=0; j<3; j++) h[i].n[j]*=r[i]; } } }; typedef Face dface; typedef Face face; struct Ico{ int vn, fn; vector v; vector< vector > f; Ico(int num) : vn(0), fn(0){ vector set; { const double t=(1+sqrt(5))/2; const double r=sqrt(1+t*t); const double a=t/r, b=1/r; const int vn=12, fn=20; double v[vn][3]; int f[fn][3]; for(int i=0; i0) for(int k=j+1; k0 && v[k][0]*v[i][0]+v[k][1]*v[i][1]+v[k][2]*v[i][2]>0) f[n][0]=i, f[n][1]=j, f[n++][2]=k; if(false){ for(int i=0; i add; for(vector::iterator i=set.begin(); i!=set.end(); i++){ dface & one = *i; dir * w = one.v; dir u[3]; one.half(u); add.push_back(dface(w[0], u[1], u[2])); add.push_back(dface(w[1], u[2], u[0])); add.push_back(dface(w[2], u[0], u[1])); add.push_back(dface(u[0], u[1], u[2])); } set=add; } { map dirs; for(vector::const_iterator i=set.begin(); i!=set.end(); i++){ const dir * w = i->v; for(int i=0; i<3; i++){ const dir & wi = w[i]; if(dirs.find(wi)==dirs.end()) dirs.insert(make_pair(wi, 0)); } } for(map::iterator i=dirs.begin(); i!=dirs.end(); i++) v.push_back(i->first), i->second=vn++; for(vector::const_iterator i=set.begin(); i!=set.end(); i++){ vector tmp; for(int j=0; j<3; j++) tmp.push_back(dirs[i->v[j]]); f.push_back(tmp); fn++; } } cerr<<"Icosahedral mesh("<0 || get_icsn()>0) for(int r=1; r<=2; r++) if(r&get_rmsk()){ vtemp v(e, r); vert best; vector set; double sigma=NAN; { int imin; double fmin, f[ico.vn]; for(int i=0; i cw; cw[best]=v.llh(best.n, false, true, best.f); for(vector::iterator i=set.begin(); i!=set.end(); i++){ face & one = *i; vert * w = one.v; for(int i=0; i<3; i++){ double ff=v.llh(w[i], cw); if(ff add; for(vector::iterator i=set.begin(); i!=set.end(); i++) if(best==i->v[0] || best==i->v[1] || best==i->v[2]) add.push_back(*i); set=add; } if(verbose) cout<<"best("< add; map cu; for(vector::iterator i=set.begin(); i!=set.end(); i++){ face & one = *i; vert * w = one.v; vert u[3]; one.half(u); for(int i=0; i<3; i++){ double ff=v.llh(u[i], cu); if(ff x, y, f; { v.set_ini(cent.n, false); std::set tmp; for(vector::iterator i=add.begin(); i!=add.end(); i++){ vert * w = i->v; for(int i=0; i<3; i++){ vert & wi = w[i]; if(tmp.find(wi)==tmp.end()){ tmp.insert(wi); x.push_back(v.p1[0]*wi.n[0]+v.p1[1]*wi.n[1]+v.p1[2]*wi.n[2]); y.push_back(v.p2[0]*wi.n[0]+v.p2[1]*wi.n[1]+v.p2[2]*wi.n[2]); f.push_back(wi.f); } } } } { const int siz=6, num=f.size(); double q[num][siz], R=0; for(int i=0; iR) R=r; q[i][0]=x2; q[i][1]=2*xi*yi; q[i][2]=y2; q[i][3]=xi; q[i][4]=yi; q[i][5]=1; } R=sqrt(R); if(isnan(sigma)) sigma=R; gsl_matrix * A = gsl_matrix_alloc(siz, siz); gsl_vector * B = gsl_vector_alloc(siz); for(int i=0; i2*chi){ double c=-2*(p[0]*p[2]-p[1]*p[1]); double x0=p[2]*p[3]-p[1]*p[4]; double y0=p[0]*p[4]-p[1]*p[3]; if(x0*x0+y0*y00){ sigma=sqrt(1/(b-D)+1/(b+D))/2; x0/=c, y0/=c; double z0=sqrt(1-x0*x0-y0*y0); for(int i=0; i<3; i++) result.n[i]=x0*v.p1[i]+y0*v.p2[i]+z0*cent.n[i]; result.f=p[0]*x0*x0+2*p[1]*x0*y0+p[2]*y0*y0+p[3]*x0+p[4]*y0+p[5]; } } } v.set_ini(result.n, false); if(verbose) cout<<"Result: "<R || mean-result.f<0.5){ count=cmax; break; } } } set.clear(); for(vector::iterator i=add.begin(); i!=add.end(); i++) if(best==i->v[0] || best==i->v[1] || best==i->v[2]) set.push_back(*i); add.clear(); if(verbose) cout<<"best("< u; for(vector::iterator i=set.begin(); i!=set.end(); i++) for(int j=0; j<3; j++){ dir & v = i->v[j]; if(v!=best) u[v]++; } switch(set.size()){ case 2: { vector x, y, z; for(map::const_iterator i=u.begin(); i!=u.end(); i++){ const dir & w = i->first; int k = i->second; dir n; { double dot=0; for(int j=0; j<3; j++) dot+=w.n[j]*best.n[j]; for(int j=0; j<3; j++) n.n[j]=2*dot*best.n[j]-w.n[j]; } switch(k){ case 1: x.push_back(w); y.push_back(n); break; case 2: z.push_back(n); break; default: problem(1); } } if(x.size()!=2 || y.size()!=2 || z.size()!=1) problem(2); else{ set.push_back(face(best, x[0], y[1])); set.push_back(face(best, y[1], z[0])); set.push_back(face(best, z[0], y[0])); set.push_back(face(best, y[0], x[1])); } } break; case 3: { vector x, y; for(map::const_iterator i=u.begin(); i!=u.end(); i++){ const dir & w = i->first; int k = i->second; dir n; { double dot=0; for(int j=0; j<3; j++) dot+=w.n[j]*best.n[j]; for(int j=0; j<3; j++) n.n[j]=2*dot*best.n[j]-w.n[j]; } switch(k){ case 1: x.push_back(w); break; case 2: y.push_back(n); break; default: problem(-1); } } if(x.size()!=2 || y.size()!=2) problem(-2); else{ double dot=0; for(int i=0; i<3; i++) dot+=(x[0].n[i]-x[1].n[i])*(y[0].n[i]-y[1].n[i]); set.push_back(face(best, x[dot>0?0:1], y[0])); set.push_back(face(best, y[0], y[1])); set.push_back(face(best, y[1], x[dot>0?1:0])); } } break; default: problem(0); } } } const double cf=M_PI/180; double th=acos(max(-1., min(1., v.nz)))/cf, ph=atan2(v.ny, v.nx)/cf; if(ph<0) ph+=360; preco track; track.subevent=e.subevent; track.gt=e.t0; track.type=r; track.hits=v.nhits; track.charge=(int) v.qtot; track.hitdoms=v.hitdoms; track.strings=v.strings; track.en=get_rmsk()&16?1:0; track.sp=get_rmsk()&8?1:0; track.rllh=v.rllt(); track.rlle=v.rlle(); double scale=v.dllt(e); cout<<"SCALE="<0){ tn=tne.tf?e.tf:tn; double totE=0, sumE=0; for(vector< pair >::const_iterator i=e.tE.begin(); i!=e.tE.end(); i++){ double ti=i->first; if(ti>=e.ti && ti<=e.tf){ totE+=i->second; if(tisecond; } } double sl0=e.tf>e.ti?((e.Ei-e.Ef-totE)/(e.tf-e.ti)):0; double slmax=(0.21+8.8e-3*log(e.Ei)/log(10.))*ice.c; // for ice only at Ecut=500 MeV double sl=min(sl0, slmax); track.Ec=e.Ei-sumE-sl*max(tn-e.ti, 0.); if(get_rmsk()&16 && get_rmsk()&8){ double s=v.step/ice.c; int jmin=(int) round((e.ti-tc)/s); int jmax=(int) round((e.tf-tc)/s); int jnum=jmax-jmin+1, j; double t0=tc+(jmin-0.5)*s, t; double losses[jnum]; for(j=0, t=t0; j >::const_iterator i=e.tE.begin(); i!=e.tE.end(); i++){ double ti=i->first; if(ti>=e.ti && ti<=e.tf) losses[(int) round((ti-tc)/s)-jmin]+=i->second; } track.set(jmin); for(int j=0; j::const_iterator i=it.losses.begin(); i!=it.losses.end(); i++) cout<<" "<<*i; cout<