NA60 Group meeting, 31 March 2005, Markus Keil1 Update on the pixel efficiencies in the Indium run 2003.

Slides:



Advertisements
Similar presentations
Probability Distributions CSLU 2850.Lo1 Spring 2008 Cameron McInally Fordham University May contain work from the Creative Commons.
Advertisements

FTKSim Status: Ghost Busting part. II The Hit Warrior F. Crescioli, M. Dell'Orso, P. Gianetti G. Punzi, G. Volpi FTK Meeting 10/19/2006.
For Explaining Psychological Statistics, 4th ed. by B. Cohen
Statistical Techniques I EXST7005 Lets go Power and Types of Errors.
June 6 th, 2011 N. Cartiglia 1 “Measurement of the pp inelastic cross section using pile-up events with the CMS detector” How to use pile-up.
Chapter 10: Hypothesis Testing
The Binomial Probability Distribution and Related Topics
Introduction to Computers and Programming Lecture 4: Mathematical Operators New York University.
Point and Confidence Interval Estimation of a Population Proportion, p
Cluster Threshold Optimization from TIF data David Stuart, UC Santa Barbara July 26, 2007.
Probability Distributions
Vectors Sections 6.6.
C4: DISCRETE RANDOM VARIABLES CIS 2033 based on Dekking et al. A Modern Introduction to Probability and Statistics Longin Jan Latecki.
Standard Form The standard form of any quadratic trinomial is a=3 b=-4
“Teach A Level Maths” Statistics 1
Examples of continuous probability distributions: The normal and standard normal.
Construction Engineering 221 Statistics and Probability Binomial Distribution Part II.
Geometric Sequences and Series Part III. Geometric Sequences and Series The sequence is an example of a Geometric sequence A sequence is geometric if.
Craft09 Visual Summary and Efficiency Trackermaps Giuseppe Zito : Infn Bari Italy Giuseppe Zito, Infn Bari.
Sullivan – Fundamentals of Statistics – 2 nd Edition – Chapter 9 Section 1 – Slide 1 of 39 Chapter 9 Section 1 The Logic in Constructing Confidence Intervals.
Normal Curve with Standard Deviation |  + or - one s.d.  |
FCAT MATH Jeopardy! Chapters Add and Subtract Mixed Fractions Chapter
Sampling distributions - for counts and proportions IPS chapter 5.1 © 2006 W. H. Freeman and Company.
Introduction to Pharmaceutical Calculation
+ Recitation 3. + The Normal Distribution + Probability Distributions A probability distribution is a table or an equation that links each outcome of.
880.P20 Winter 2006 Richard Kass Binomial Probability Distribution For the binomial distribution P is the probability of m successes out of N trials. Here.
Binomial Experiment A binomial experiment (also known as a Bernoulli trial) is a statistical experiment that has the following properties:
Binomial Probability Distribution
VOCABULARY CHECK Prerequisite Skills Copy and complete using a review word from the list: data, mean, median, range, outcome, probability of an event.
March 13, 2002 Daniel Whiteson L3 tracking - muons! Daniel Whiteson LBL.
Solve a Simpler Problem Lesson 5-6. Strategy When a problem contains difficult numbers (like fractions or mixed numbers), then imagine the problem with.
 Here are a few review concepts before we start solving equations!
Finding the fraction of a whole number WALT : find calculate a fraction of a whole number Example : To find of
Thursday August 29, 2013 The Z Transformation. Today: Z-Scores First--Upper and lower real limits: Boundaries of intervals for scores that are represented.
How can we solve fractional equations? Do now: Solve for x What steps did you use to solve?
Two Main Uses of Statistics: 1)Descriptive : To describe or summarize a collection of data points The data set in hand = the population of interest 2)Inferential.
There are only 6 arithmetic operations tested on the SAT: Addition Subtraction Multiplication Division Exponents Square.
40S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Statistics Lesson: ST-5 The Binomial Distribution The Binomial Distribution Learning Outcome.
Study of neutrino oscillations with ANTARES J. Brunner.
Study of neutrino oscillations with ANTARES J. Brunner.
MuID LL1 Study (update) 09/02/2003 Muon Trigger Upgrade Meeting.
Prob and Stats, Oct 28 The Binomial Distribution III Book Sections: N/A Essential Questions: How can I compute the probability of any event? How can I.
Statistical Techniques
Binomial Distributions Chapter 5.3 – Probability Distributions and Predictions Mathematics of Data Management (Nelson) MDM 4U.
Muon detection in NA60  Experiment setup and operation principle  Coping with background R.Shahoyan, IST (Lisbon)
Detector alignment Stefania and Bepo Martellotti 20/12/10.
COURSE 2 LESSON Find , or 4 Estimate 21 Add the fractions. Add the whole numbers = Write.
Search for High-Mass Resonances in e + e - Jia Liu Madelyne Greene, Lana Muniz, Jane Nachtman Goal for the summer Searching for new particle Z’ --- a massive.
RF background, update on analysis Rikard Sandström, Geneva University MICE Analysis phone conference, October 30, 2007.
COURSE: JUST 3900 INTRODUCTORY STATISTICS FOR CRIMINAL JUSTICE Test Review: Ch. 4-6 Peer Tutor Slides Instructor: Mr. Ethan W. Cooper, Lead Tutor © 2013.
1 M2-M5 Efficiency and Timing checks on 7TeV beam data Alessia, Roberta R.Santacesaria, April 23 rd, Muon Operation
Geo597 Geostatistics Ch11 Point Estimation. Point Estimation  In the last chapter, we looked at estimating a mean value over a large area within which.
Muons at CalDet Introduction Track Finder Package ADC Corrections Drift Points Path Length Attenuation Strip-to-Strip Calibration Scintillator Response.
Psy B07 Chapter 3Slide 1 THE NORMAL DISTRIBUTION.
Binomial Distributions Chapter 5.3 – Probability Distributions and Predictions Mathematics of Data Management (Nelson) MDM 4U Authors: Gary Greer (with.
MuID Twopack Efficiencies: Measurements with Cosmic Rays & High Voltage inforamtion.
Basic Business Statistics, 11e © 2009 Prentice-Hall, Inc. Chap 8-1 Chapter 8 Confidence Interval Estimation Business Statistics: A First Course 5 th Edition.
Tau31 Tracking Efficiency at BaBar Ian Nugent UNIVERSITY OF VICTORIA Sept 2005 Outline Introduction  Decays Efficiency Charge Asymmetry Pt Dependence.
I'm concerned that the OS requirement for the signal is inefficient as the charge of the TeV scale leptons can be easily mis-assigned. As a result we do.
Limitations on the Design of the CEDAR Light-guide Calculations of the light-collection efficiency indicate a severe limitation in the possible collection.
Status of the measurement of K L lifetime - Data sample (old): ~ 440 pb -1 ( ) - MC sample: ~125 pb -1 ( mk0 stream ) Selection: standard tag (|
Direct Photon v 2 Study in 200 GeV AuAu Collisions at RHIC Guoji Lin (Yale) For STAR Collaboration RHIC & AGS Users’ Meeting, BNL, June 5-9.
-8 5 INTERESTING INTEGERS!
Factoring when a=1 and c > 0.
Bernard Andrieu (LPNHE,Paris)
The Variable-Increment Counting Bloom Filter
Mean Absolute Deviation
J/   analysis: results for ICHEP
Samples and MC Selection
Mean Absolute Deviation
Presentation transcript:

NA60 Group meeting, 31 March 2005, Markus Keil1 Update on the pixel efficiencies in the Indium run 2003

NA60 Group meeting, 31 March 2005, Markus Keil2 Same behaviour for all planes, but more pronounced for the planes close to the target Pixel efficiency seems to depend on the instantaneous occupancy in the analysed event (expressed by the number of VT tracks) Reminder: status collaboration meeting Fake tracks? Use matched muons to get best possible tracks

NA60 Group meeting, 31 March 2005, Markus Keil3 Matched muon tracks Use only matched muon tracks for efficiency measurement Problem: low statistics –Average over whole plane –Don’t exclude any pixel Same result as for all tracks: –Stable up to ~100 VT tracks –Then decrease of efficiency by several %

NA60 Group meeting, 31 March 2005, Markus Keil4 How is the efficiency calculated? (very schematic!) 1. Extrapolate track 2. Define surrounding (GetChi2Distance()) 3. Count all hits (clusters) (i.e. the real hit and fakes) 4. To determine number of fakes, do the same for mixed event

NA60 Group meeting, 31 March 2005, Markus Keil5 Fake subtraction (very schematic) → (3 – 2) / 1 = 100% Of course these values have to be considered as averages The real values are rather 1.2 and 0.3 than 3 and 2…

NA60 Group meeting, 31 March 2005, Markus Keil6 At high occupancy? Possibility of the following case: Two tracks close to each other → merged cluster Fake subtraction: (4 – 4) / 1 = 0 Question: How close are the tracks to each other? Question: How close do they have to be to cause trouble?

NA60 Group meeting, 31 March 2005, Markus Keil7 How close do the tracks have to be? Depends on orientation w.r.t. to the pixel orientation: (consider only 1-pixel clusters) Case 1: Distance ~60  m, 2 clusters Case 2: Distance ~850  m, 1 cluster → Below ~60  m always merged, up to 850  m possibly merged

NA60 Group meeting, 31 March 2005, Markus Keil8 How close are the tracks? Distance to closest track, integrated in percent → Non-negligible effect in the critical range

NA60 Group meeting, 31 March 2005, Markus Keil9 Calculating efficiencies I – Binomial Binomial distribution: Distribution for events with two possible outcomes (flipping a coin, detector does (not) detect a given track…) If the probability for a positive result is p, then in N tries one expects pN positive results ± sqrt(Np(1-p)) For the efficiency  and N Tracks tracks: =  N Tracks With a measured number of hits (counting only 1 hit!):  measured = N Hits / N Tracks However: Only 2 allowed result: Hit(s) / No Hits

NA60 Group meeting, 31 March 2005, Markus Keil10 Calculating efficiencies II – Fake subtraction If allowing (and counting) more than 1 hit per track, one cannot use the binomial distribution Instead we sum up all the hits (fake + real) and all the fakes, and subtract them, applying a poissonian error to both numbers Then we divide them by the total number of tracks Obviously the subtraction is the problem. Is there another possibility?

NA60 Group meeting, 31 March 2005, Markus Keil11 Calculating efficiencies III – Binomial with fakes Consider the binomial case of success/no success: –Is there a (1,2,3…) hit in the surrounding of the track? If the efficiency is , in how many cases will the answer be “yes”? –A) no fakes: N Yes =  N Tracks –B) with fakes: N Yes =  N Tracks + p Fake (1-  )N Tracks Instead of solving A for , we solve B: –  = (N Yes - p Fake N Tracks ) / (1-p Fake ) This method does avoid subtraction N Hits - N Fakes N.B.: Here p Fake is the probability to have ANY number of fakes in the surrounding

NA60 Group meeting, 31 March 2005, Markus Keil12 Summary Lower efficiency at high occupancy: –Obviously no problem of fake tracks –Most likely a problem of merged clusters and the way fakes are subtracted Change the efficiency calculation method to check…