Since Rich wanted some relatively quick info on what detector might be needed to help MuTr pattern recognition, I did a scan on a central HIJING file I.

Slides:



Advertisements
Similar presentations
Filling Algorithms Pixelwise MRFsChaos Mosaics Patch segments are pasted, overlapping, across the image. Then either: Ambiguities are removed by smoothing.
Advertisements

Techniques for Solving Logic Puzzles. Logic Puzzles Logic puzzles operate using deductive logic. Logic puzzles operate using deductive logic. A well-designed.
Math for Liberal Studies. There is a list of numbers called weights These numbers represent objects that need to be packed into bins with a particular.
§4 Open Addressing 2. Quadratic Probing f ( i ) = i 2 ; /* a quadratic function */ 【 Theorem 】 If quadratic probing is used, and the table size is prime,
Beam-plug and shielding studies related to HCAL and M2 Robert Paluch, Burkhard Schmidt November 25,
Beam-plug under M2 and HCAL shielding studies Robert Paluch, Burkhard Schmidt October 9,
S3 Useful Expressions.
Journal 2/12/15 Tell me 1 way you might be able to use all this stuff you're learning about light later in life Objective Tonight’s Homework To learn about.
3-Dimensional Projectile Motion Homework 6. The object we are trying to hit has displacement vector as follows- ( I’m going to use BIG V to represent.
1 Reconstruction of Non-Prompt Tracks Using a Standalone Barrel Tracking Algorithm.
Calculations with significant figures
LHCb PatVeloTT Performance Adam Webber. Why Upgrade?  Currently we de-focus the beams o LHCb Luminosity ~ 2x10 32 cm -2 s -1 o ~ 1 interaction per bunch.
What are “CANDLESTICKS” And How To Use Them.
Mr Barton’s Maths Notes
Cluster Threshold Optimization from TIF data David Stuart, UC Santa Barbara July 26, 2007.
Slow Neutron Background Simulation " Long-lived neutrons created, diffuse around collision hall " They get captured by nuclei, emitting a photon " Compton.
Neutron Background Simulation Long-lived neutrons created, diffuse around collision hall They get captured by nuclei, emitting a photon Compton scattering.
Voice feedback on formative assigments Ian Greener School of Applied Social Sciences.
SIMULATION STUDIES AT SANTA CRUZ Bruce Schumm University of California at Santa Cruz ALCPG Workshop, Vancouver July 19-22, 2006 Special Recognition: Eric.
Lesson 4: Percentage of Amounts.
Chapter 6.7 Determinants. In this chapter all matrices are square; for example: 1x1 (what is a 1x1 matrix, in fact?), 2x2, 3x3 Our goal is to introduce.
The answer really annoys me for 3 reasons: 1.I think the statement is arrogant. It doesn’t take into account any definitions of God but solely focuses.
Unit 1 (Chapter 5): Significant Figures
A TEACHER TRAINING MAZE Gao Yue-qin Jiangsu Yangzhong Senior Middle School.
Simulation issue Y. Akiba. Main goals stated in LOI Measurement of charm and beauty using DCA in barrel –c  e + X –D  K , K , etc –b  e + X –B 
Getting out of the Testing Game By Bill Matthews Test Architect Manager Technical
SWIMMING WITH THE PYTHAGOREAN THEOREM Jeremiah Parker.
BackTracking CS335. N-Queens The object is to place queens on a chess board in such as way as no queen can capture another one in a single move –Recall.
Mark Thomson University of Cambridge  LoI loose ends  New physics studies?  What next... Future Plans… This talk:
Moving Around in Scratch The Basics… -You do want to have Scratch open as you will be creating a program. -Follow the instructions and if you have questions.
ACT Tips Guier Millikan Fall Time Students MUST average 7.5 minutes on the English passage and 9 minutes on the Reading passage Students must remember.
GEM MINIDRIFT DETECTOR WITH CHEVRON READOUT EIC Tracking Meeting 10/6/14 B.Azmoun, BNL.
Science Andrea’s Student Led Conference. Cover Letter This year in science I have learned about many things. We learned a ton of important information.
You can learn how to quickly and knowledgably search with the following information. By: Kataryna Cookman.
M. Deveaux, CBM collaboration meeting, Oct. 2008, Dubna, Russia A revision of the concept of the CBM – MVD Or: Do we need an intermediate pixel.
PHOBOS LRP: Should we fill the holes?! What happens to flow as the silicon gets blasted? J. Hamblen, S. Manly, I.C. Park.
湖南长郡卫星远程学校 2013 年下学期制作 13. 湖南长郡卫星远程学校 2013 年下学期制作 13 Discussion: What words or phrases can we use to describe our negative emotions?
Unit 1 – Improving Productivity
A Pattern Recognition Scheme for Large Curvature Circular Tracks and Its FPGA Implementation Example Using Hash Sorter Jinyuan Wu and Z. Shi Fermi National.
AND/OR - Are MC and Data (in)consistent? - further analysis and new measurements to do - Effects on inefficiency evaluation 1 G. Martellotti 21/05/2015.
Development of a Particle Flow Algorithms (PFA) at Argonne Presented by Lei Xia ANL - HEP.
Ngram models and the Sparcity problem. The task Find a probability distribution for the current word in a text (utterance, etc.), given what the last.
Background Subtraction and Likelihood Method of Analysis: First Attempt Jose Benitez 6/26/2006.
Dmitri Ossetski Obninsk State University Department of Applied Mathematics
AutoPalletP3 Explained An order picker’s guide for Pallet Picklist Planning Copyright © 2000.
Refitting Tracks from DST E. Rodrigues, NIKHEF LHCb Tracking and Alignment Workshop, Lausanne, 8-9th November 2006  Motivations  Step-by-step …  Current.
Sunglasses Sales Excellence Discussion. Sunglasses Identify and describe at least one further feature of this time series data with reasons. – Sunglasses.
THE BALANCE POINT By Julia D’Innocenzo.
PFAs – A Critical Look Where Does (my) SiD PFA go Wrong? S. R. Magill ANL ALCPG 10/04/07.
Marcel Stanitzki 1 More results... SiD PFA Meeting M. Stanitzki.
IMPORTANT MOMENTS This I Believe. Journal (1/2 page minimum) Complete the following phrase: I believe in __________. List as many as you can! Please be.
Sight Words.
Meeting the Grading Criteria Evaluation asks the question 'Is this the best way of doing it?'
22 January 2009 David1 Look at dead material and fake MET in Jx samples mc08 10 TeV simulations, release J0 to J6 are tag s479_r586, ‘ideal geometry’
Forward Trigger Upgrade and AuAu Pattern Recognition V. Cianciolo, D. Silvermyr Forward Upgrade Meeting August 18-19, 2004.
Preliminary results on DT T0s in beam collisions J. Santaolalla, J. Alcaraz (+ help/suggestions from C. Battilana, C. Fouz)
Chapter 27 Project By: J.T. Brown O.D. Quinn B.M. Scapa K.R. Thomas.
Data Link Layer. Data link layer The communication between two machines that can directly communicate with each other. Basic property – If bit A is sent.
Effects of Endcap Staging/Descoping D.Acosta University of Florida.
WALT: find the surface area of cubes and cuboids (Level 5) Unscramble these mathematical words! asurcefbuce uodcbi ephdtglneht uolevm.
WHAT DO YOU THINK OF THESE STUDENT CONCLUSIONS. Conclusions.
Here is a kind of question that you can get on Verbal Reasoning. They might give you three groups of numbers like this: (4 [6] 2) (3 [7] 4) (5 [12] ?)
"When will I ever need algebra?" Click to watch the video.
Data Screening. What is it? Data screening is very important to make sure you’ve met all your assumptions, outliers, and error problems. Each type of.
课标人教实验版 高二 Module 6 Unit 3. Listening on workbook.
The Fine Art of Knowing How Wrong You Might Be. To Err Is Human Humans make an infinitude of mistakes. I figure safety in numbers makes it a little more.
Full Sim Status Estel Perez 27 July 2017.
Some input to the discussion for the design requirements of the GridPixel Tracker and L1thack trigger. Here are some thoughts about possible detector layout.
Clustering-based Studies on the upgraded ITS of the Alice Experiment
Presentation transcript:

Since Rich wanted some relatively quick info on what detector might be needed to help MuTr pattern recognition, I did a scan on a central HIJING file I had to look at some hit occupancies. As an intro just let me say that if we don't solve the issues at station 1 with our current detector, then I believe we would want: 1) a detector which covers the entire active volume of station 1 (partial coverage would leave us with same ambiguities that are now causing us problems) 2) Redundancy (at least two layers of readout I would think), performance at all radii, and a resolution which is better than inter-track distances which we see in the central collisions for the same reasons as (1). Also note that I know that HIJING underestimates the occupancy that we see in real events. However, when looking at HIJING compared to real data in the past it seemed to me that the increased occupancy came from an overall increase in hit rate over the entire detector rather than primarily at the inner radii, for instance, which would definitely imply higher segmentation needed. So it's possible that a HIJING simulation will tell us the segmentation we want fairly well, but we probably want to add some safety factor. So, I scanned the HIJING file, which just had 100 events, and looked at the inter-track distances of tracks at station 1 for these _central_ events. The plot is at: 3% of pairs have inter-track distances of <5 cm and 10% of pairs are <10 cm apart. So, it seems plausible that a detector that has a resolution somewhere between 1 and 5 cm would still work fine, 10 cm is probably too large segmentation. 1 cm should cover everything. I also made a few plots versus occupancy within this centrality bin, versus radii in the chamber, etc. and can post anything like that if you are interested. I'll think about what other quick studies I can do to tell us more about station 1 help and trying to determine if we might want help at station 3 or not. I have another plot which may (?) be more relevant but looks a little less promising. I made a plot of the minimum inter-track distance per event in station 1, assuming that you always want to be able to tag every track that went through the station and got the plot: It might imply the smaller 1 cm segmentation really is needed to help the pattern recognition the majority of the time.

central – delta distance

I have another plot which may (?) be more relevant but looks a little less promising. I made a plot of the minimum inter-track distance per event in station 1, assuming that you always want to be able to tag every track that went through the station and got the plot: PR/min_delr_st1.gifhttps:// PR/min_delr_st1.gif It might imply the smaller 1 cm segmentation really is needed to help the pattern recognition the majority of the time.

min inter-track disktance per event - central

RKS - conclusion 1 cm will certainly work since for the ~ 1% of times when there is a double hit, we can resolve it using techniques (stereo resolution) that are used now Work needs to be done to determine the exact segmentation. I would like to be safe though and design for 1 cm