Event “zero-time” determination with TOF detector

Slides:



Advertisements
Similar presentations
Html version of the presentation For virtual participants in TOFWEB/ALI-Off/venusians.html.
Advertisements

CBM Calorimeter System CBM collaboration meeting, October 2008 I.Korolko(ITEP, Moscow)
Particle identification in ECAL Alexander Artamonov, Yuri Kharlov IHEP, Protvino CBM collaboration meeting
TRACK DICTIONARY (UPDATE) RESOLUTION, EFFICIENCY AND L – R AMBIGUITY SOLUTION Claudio Chiri MEG meeting, 21 Jan 2004.
Muon Identification Antoine Cazes Laboratoire de l’ Accelerateur Lineaire OPERA Collaboration Meeting in Frascatti Physics coordination meeting. October.
Forward Genealogical Simulations Assumptions:1) Fixed population size 2) Fixed mating time Step #1:The mating process: For a fixed population size N, there.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Source Dynamics from Deuteron and Anti-deuteron Measurements in 200 GeV Au+Au Collisions Hugo E Valle Vanderbilt University (For the PHENIX Collaboration)
Algorithms and Methods for Particle Identification with ALICE TOF Detector at Very High Particle Multiplicity TOF simulation group B.Zagreev ACAT2002,
Y. Karadzhov MICE Video Conference Thu April 9 Slide 1 Absolute Time Calibration Method General description of the TOF DAQ setup For the TOF Data Acquisition.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
TOF (and Global) PID F. Pierella for the TOF-Offline Group INFN & Bologna University PPR Meeting, January 2003.
PPR meeting - January 23, 2003 Andrea Dainese 1 TPC tracking parameterization: a useful tool for simulation studies with large statistics Motivation Implementation.
GlueX Particle Identification Ryan Mitchell Indiana University Detector Review, October 2004.
TOF Meeting, 9 December 2009, CERN Chiara Zampolli for the ALICE-TOF.
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
1 Realistic top Quark Reconstruction for Vertex Detector Optimisation Talini Pinto Jayawardena (RAL) Kristian Harder (RAL) LCFI Collaboration Meeting 23/09/08.
Charmonium feasibility study F. Guber, E. Karpechev, A.Kurepin, A. Maevskaia Institute for Nuclear Research RAS, Moscow CBM collaboration meeting 11 February.
TOF, Status of the Code F. Pierella, Bologna University and INFN TOF Offline Group ALICE Offline Week, June 2002.
Status of GlueX Particle Identification Ryan Mitchell September 10, 2004.
Chi square analysis Just when you thought statistics was over!!
Track extrapolation to TOF with Kalman filter F. Pierella for the TOF-Offline Group INFN & Bologna University PPR Meeting, January 2003.
Immune Genetic Algorithms By Jeremy Moreau. References Licheng Jiao, Senior Member, IEEE, and Lei Wang, “A Novel Genetic Algorithm Based on Immunity,”
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
V0 analytical selection Marian Ivanov, Alexander Kalweit.
M. Muniruzzaman University of California Riverside For PHENIX Collaboration Reconstruction of  Mesons in K + K - Channel for Au-Au Collisions at  s NN.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
PID simulations Rikard Sandström University of Geneva MICE collaboration meeting RAL.
CHARM MIXING and lifetimes on behalf of the BaBar Collaboration XXXVIIth Rencontres de Moriond  March 11th, 2002 at Search for lifetime differences in.
I.BelikovCHEP 2004, Interlaken, 30 Sep Bayesian Approach for Combined Particle Identification in ALICE Experiment at LHC. I.Belikov, P.Hristov, M.Ivanov,
Fast Simulation and the Higgs: Parameterisations of photon reconstruction efficiency in H  events Fast Simulation and the Higgs: Parameterisations of.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
FRANCESCO NOFERINI (INFN CNAF – INFN BOLOGNA) 08/12/2009 ALICE TOF - general meeting - F. Noferini - GRID and resonances GRID and  analysis in pp 1.
Particle identification by energy loss measurement in the NA61 (SHINE) experiment Magdalena Posiadala University of Warsaw.
Paolo Massarotti Kaon meeting March 2007  ±  X    X  Time measurement use neutral vertex only in order to obtain a completely independent.
Mendel & Genetic Variation Chapter 14. What you need to know! The importance of crossing over, independent assortment, and random fertilization to increasing.
Genetic Algorithm(GA)
Brunel University London Field-off LiH Energy Loss Rhys Gardener CM45 – July 28th.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithm (Knapsack Problem)
The Chi Square Test A statistical method used to determine goodness of fit Chi-square requires no assumptions about the shape of the population distribution.
Using GA’s to Solve Problems
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Advanced Computing and Networking Laboratory
New TRD (&TOF) tracking algorithm
Yet another approach to the ToF-based PID at PANDA
Physics 114: Lecture 13 Probability Tests & Linear Fitting
F2F Tracking Meeting, Prague 12/12/2013
Marco Incagli – INFN Pisa
Ex1: Event Generation (Binomial Distribution)
Measurement of track length and time-of-flight hypothesis
Evolution strategies and genetic programming
ITS “parallel” tracking
Charles F. Maguire Vanderbilt University
Example: Applying EC to the TSP Problem
Yu-Chi Ho Jonathan T. Lee Harvard University Sep. 7, 2000
Example: Applying EC to the TSP Problem
Nicolo’ Masi, Andrea Tiseni TOF Group Bologna
Geology Geomath Chapter 7 - Statistics tom.h.wilson
Study of dE/dx Performance in TPC at CEPC
Genetic Mapping Linked Genes.
Methods and Materials (cont.)
Boltzmann Machine (BM) (§6.4)
Sudoku.
A population shares a common gene pool.
Reconstruction and calibration strategies for the LHCb RICH detector
Presentation transcript:

Event “zero-time” determination with TOF detector F. Pierella for the TOF-Offline Group INFN & Bologna University PPR Meeting, January 2003

Overview Previous results Present results Summary of algorithms and conclusion Plan

Statistical algorithm By assigning a mass configuration to n selected tracks in a given event, we can require a best fit condition thus deriving the most probable mass configuration for the n tracks, out of the possible N=3n and the corresponding most probable zero-time for the event.

Previous results

Reminder Previous result has been obtained with a smearing on MC momentum in order to take into account the momentum resolution (no reconstructed momentum used); with a gaussian smearing on track length given by GEANT (=30ps); with a gaussian smearing on MC time-of-flight; matching contamination was not included.

Present results Included full simulation Tracks assigned to a “wrong time” are now included in the statistical (combinatorial) method (so contamination is now included); in order to minimize this effect, we select tracks with momentum 1.25GeV/c<p<1.75GeV/c which is the best range for track matching; No (coarse) Gaussian Smearing on MC time-of-flight is used but full TOF detector simulation (edge effect, efficiency, and resolution simulation) is now considered; Reconstructed momenta are now used for zero-time calculation.

Present Results

CPU Timing for the statistical method Considering the combinatorial character of the algorithm, the CPU computing time for the zero-time determination is reported in the following table Number of tracks per set CPU computing time n=10 5 n=15 50

Summary of the algorithms and conclusion Statistical method: no dependence from particle ratios event zero-time resolution of the order of 30ps The pion mass assumption for all tracks has been suggested as an alternative –and faster- method to calculate the event zero-time, but in this case a dependence from particle ratios occurs

Dependence from particle ratio Simplified case with only pions and kaons

Dependence from particle ratio

Plan Plan is to use a GA (Genetic Algorithm) for event “zero-time” determination; The architecture of GA systems allow for a solution to be reached quicker since “better” solutions have a better chance of “surviving” and “procreating”, as opposed to randomly throwing out solutions and seeing which ones work

“Definition” of the problem In the GA dictionary of the “zero-time” problem the “chromosome” corresponds to a mass configuration of the n selected tracks in the event; a “chromosome allele” corresponds to a mass assignment to a given track; the “fitness value” of a given “chromosome” corresponds to the chi-square of the mass configuration; the “parent selection” is done according to the “fitness value”;

Strategy “offspring chromosomes” are obtained “crossing-over” the “father” and “mother” “chromosomes”; generally, the fitness values of the “offspring chromosome” are better than those of the “parent chromosomes”; “mutation” corresponds to a random change of a mass assignment in a given mass configuration; mutations can occur leading to “more performing chromosomes” for systems where the population is larger (say 50) the fitness levels should more steadily and stably approach the desired level.