Julien FaivreNantes, 16 July 2002  V0/XiFinder, what is it ?  Writing a new code  Status  The V0Finder  The xiFinder, results of the tests V0/XiFinder.

Slides:



Advertisements
Similar presentations
Lower Bounds for Local Search by Quantum Arguments Scott Aaronson (UC Berkeley) August 14, 2003.
Advertisements

15-Apr-15 Muon HLT Meeting C. Diez L2 Muon Trigger Status Report: L2 seeding study B. de la Cruz, C. Diez (CIEMAT, Madrid) Muon HLT Meeting 17th April,
Chapter 4: Trees Part II - AVL Tree
Code Review Offline Week Piotr Krzysztof Skowroński 10 March 2004.
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.
Combined tracking based on MIP. Proposal Marian Ivanov.
1 Program Design Language (PDL) Slides by: Noppadon Kamolvilassatian Source: Code Complete by Steve McConnell, Chapter 4.
Taikan Suehara et al, ILC Tokusui Workshop, 17 Dec page 1 Taikan Suehara (Kyushu) Tomohiko Tanabe (Tokyo) LCFIPlus status and plan.
1 Vertex fitting Zeus student seminar May 9, 2003 Erik Maddox NIKHEF/UvA.
Elze de Groot1 Parameter estimation for HMMs, Baum-Welch algorithm, Model topology, Numerical stability Chapter
Hashing The Magic Container. Interface Main methods: –Void Put(Object) –Object Get(Object) … returns null if not i –… Remove(Object) Goal: methods are.
Software Construction. Implementation System Specification Requirements Analysis Architectural Design Detailed Design Coding & Debugging Unit Testing.
CSE 486/586 CSE 486/586 Distributed Systems PA Best Practices Steve Ko Computer Sciences and Engineering University at Buffalo.
1 Naïve Bayes Models for Probability Estimation Daniel Lowd University of Washington (Joint work with Pedro Domingos)
THE BIG PICTURE. How does JavaScript interact with the browser?
Green Bay Area Public School District Jenny VandenPlas May 2010.
9/26/11HFT soft meeting, BNL1 Chain analysis fz file MuDst.root minimc.root geant.root event.root McEvent.root StMiniMcMaker StAssociationMaker : STAR.
Some notes on ezTree and EMC data in MuDst Marco van Leeuwen, LBNL.
08/10/ Iteration Loops For … To … Next. 208/10/2015 Learning Objectives Define a program loop. State when a loop will end. State when the For.
Today  Table/List operations  Parallel Arrays  Efficiency and Big ‘O’  Searching.
Procedures and Functions Computing Module 1. What is modular programming? Most programs written for companies will have thousands of lines of code. Most.
Level 3 Muon Software Paul Balm Muon Vertical Review May 22, 2000.
Arrays and ArrayLists in Java L. Kedigh. Array Characteristics List of values. A list of values where every member is of the same type. Each member in.
Learning to Use Root for STAR Gene Van Buren (UCLA) for the STAR Collaboration Accessing STAR Data Programming for STAR (Makers) Star => Computing => Tutorials.
Elementary Sorting Algorithms Many of the slides are from Prof. Plaisted’s resources at University of North Carolina at Chapel Hill.
NuGen III K.Hoshina May IceCube spring collaboration meeting in Madison.
1 Compiler Construction (CS-636) Muhammad Bilal Bashir UIIT, Rawalpindi.
Q and A for Chapter 7 Students of CS104, and me, your benevolent professor, Victor T. Norman, PhD.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
STAR Sti, main features V. Perevoztchikov Brookhaven National Laboratory,USA.
Pure D0 : 950 MuDst files (400 possibles D0 per file) |Zvertex| < 20 cm NHitsFit > 15 histos in 2-d to investigate possible cuts Cuts in MuKpi-update HF.
Making Python Pretty!. How to Use This Presentation… Download a copy of this presentation to your ‘Computing’ folder. Follow the code examples, and put.
Algorithm Analysis Data Structures and Algorithms (60-254)
STAR Collaboration Meeting, BNL, Feb 2005 Alexandre A. P. Suaide University of Sao Paulo Slide 1 BEMC software update L3 display 200 GeV February.
Y.Fisyak, BNL - STAR Upgrade workshop, 12/2/ Integrated Tracker – STAR tracking framework of the future update on  status and  perspective IT(TF)
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
ITTF Status STAR Analysis Meeting Dec 5, 04 Claude Pruneau Wayne State University.
12/7/20151 Vertex characteristics J. Bouchet 12/7/20151.
ALICE Offline Week, CERN, Andrea Dainese 1 Primary vertex with TPC-only tracks Andrea Dainese INFN Legnaro Motivation: TPC stand-alone analyses.
LM Feb SSD status and Plans for Year 5 Lilian Martin - SUBATECH STAR Collaboration Meeting BNL - February 2005.
Louis Nicolas – LPHE-EPFL T-Alignment: Track Selection December 11, 2006 Track Selection for T-Alignment studies Louis Nicolas EPFL Monday Seminar December.
Secondary Vertex reconstruction for the D + Elena Bruna University of Torino ALICE Physics Week Erice, Dec. 6 th 2005.
Photon reconstruction and matching Prokudin Mikhail.
CSC High Pileup Sumulations Vadim Khotilovich Alexei Safonov Texas A&M University June 15, 2009.
STAR J/  Trigger in dA Manuel Calderon for the Heavy-Flavor Group Trigger Workshop at BNL October 21, 2002.
Week 12 - Monday.  What did we talk about last time?  Defining classes  Class practice  Lab 11.
Development of the parallel TPC tracking Marian Ivanov CERN.
25th Nov, 1999 LHCb Event Data Model Pavel Binko, LHCb / CERN 1 LHCb Software Week LHCb Event Data Model Pavel Binko LHCb / CERN.
I. BelikovALICE Offline Week, CERN, 12 June ESD Classes and the Combined Reconstruction What is the ESD ? Two new classes AliESD and AliESDtrack.
P latform stability and track-fit problems M. Moulson, T. Spadaro, P. Valente Tracking Meeting, 18 Jul 2001.
STAR SVT Self Alignment V. Perevoztchikov Brookhaven National Laboratory,USA.
STAR Simulation. Status and plans V. Perevoztchikov Brookhaven National Laboratory,USA.
BEACH 04J. Piedra1 SiSA Tracking Silicon stand alone (SiSA) tracking optimization SiSA validation Matthew Herndon University of Wisconsin Joint Physics.
AliRoot survey: Calibration P.Hristov 11/06/2013.
GSI, December 7 th, 2009 Status of the Pattern Recognition with the STT system alone. Gianluigi Boca 1.
How to Cover Your Book.
Post production TECM 4180 Dr. Lam.
Machine code Recall that all a computer recognises is binary code.
Yi Bao Supervisor: Rolf Oldeman July 19th,
Error Handling Summary of the next few pages: Error Handling Cursors.
Autumn Term Year 10 Slides
Making a Little Book on the Computer
Looping III (do … while statement)
Sorin Manolache, Petru Eles, Zebo Peng {sorma, petel,
Game Over Module 4 Lesson 2.
Current Status of the VTX analysis
Basic Local Alignment Search Tool
CSE 206 Course Review.
CSE 326: Data Structures Lecture #14
Presentation transcript:

Julien FaivreNantes, 16 July 2002  V0/XiFinder, what is it ?  Writing a new code  Status  The V0Finder  The xiFinder, results of the tests V0/XiFinder progress : Outline : Strangeness group

Julien FaivreNantes, 16 July 2002  K 0   +  : 2 tracks V0 vertex    + p : 2 tracks V0 vertex    +  : 3 tracks Xi Vertex    + K : 3 tracks Xi Vertex  V0 vertex : Loop over all pairs of tracks If close enough : found a V0  Xi Vertex : Loop over all pairs of (V0, track) If close enough : found a Xi(-vertex) 2/11 V0/XiFinder, what is it ?

Julien FaivreNantes, 16 July 2002  My naive (basic user’s ;-) ) view of the reco chain : 3/11 V0/XiFinder, what is it ? Data (raw data) Get hitsTrackingFind primary vtx Find V0 verticesFind Xi verticesFind Kink vertices Fill StEvent Data Strangeness (tracks and vertices) Tables all the way long

Julien FaivreNantes, 16 July 2002  Getting rid of Fortran inserted in C++ code  ITTF coming : all StEvent-based,  getting rid of tables  Easier to manage 4/11 Writing a new code : Data Get hitsTrackingFind primary vtx Find V0 verticesFind Xi verticesFind Kink vertices Fill StEvent Data ITTF Tables disappear ! Strangeness PAM don’t work anymore !

Julien FaivreNantes, 16 July /11 Writing a new code : Data (raw) Get hits Tracking Find primary vtx V0Finder XiFinder KinkFinder Data (tracks+ vertices) StEvent IS FILLED Gene Van Buren Julien Faivre Lee Barnby ITTF team Background studies Can read muDsts as well (much faster and more convenient)

Julien FaivreNantes, 16 July /11 Status : tests : 1- Current chain + Fortran PAM Current chain + V0/XiFinder 2- Current chain + V0/XiFinder ITTF chain + V0/XiFinder 3- Any chain + V0/XiFinder Any chain + new V0/XiFinder Test of the V0/XiFinder Test of ITTF output Test of new algorithms for the V0/XiFinder Both tests 1 and 2 are on their way Test 1 : all the variables in the code must be identical. Test 2 : the final results must be exactly the same.

Julien FaivreNantes, 16 July /11 Status : Tester Fortran vs C++ V0/XiFinder : Finished Tested (artificial errors introduced) Tester current chain vs ITTF : Not begun KinkFinder : To be begun soon Already C++, but still reads tables V0Finder : Finished Tests of the global behaviour OK Problem with tests value-by-value Being tested plugged on ITTF Speed : a little bit slowlier XiFinder : Nearly finished Tests of the coded part almost completed More or less tested inserted in the V0Finder (see next slide) Speed : faster so far

Julien FaivreNantes, 16 July /11 V0Finder : New structure : xiFinder is put inside the V0Finder Current way : Loop over (track1,track2) if (cuts) keep V0 Store V0 Loop over (kept_V0,track) if (cuts) keep Xi Store Xi Loop over kept V0’s if (not used in a Xi nor points to Pvx) remove it New way : Loop over (track1,track2) if (cuts) keep V0 Loop over tracks if (cuts) keep Xi Store Xi Store V0

Julien FaivreNantes, 16 July /11 XiFinder : Not the same parameters in tables and in StEvent  some algorithms change  some subroutines become unnecessary Tested… OK ! Cheking the variables : e.g. var : comparing value var Fortran with var C++. Distributions checked : Expected max. error due to quantification :  = mean of the distribution of var Fortran var  (log)

Julien FaivreNantes, 16 July /11 XiFinder : Check distributions of absoluteError/mean (log-log) Check that no overflows Check distributions of absolute error If problem : check if variables using the « bad » one are bad too check if next iterations are worse Good Bad ? 3 candidates over Always check, even if distrib. looks nice Possibly  500 variables !

Julien FaivreNantes, 16 July /11 The future : Finish the xiFinder (2 days) Test the xiFinder (> 1 week ?) Test the V0Finder (> 1 week) Insert the xiFinder inside the V0Finder (1 day) KinkFinder (> 1 week) Plug the code on ITTF Clean the code and improve it That was in ‘98, not 2002… but you had probably noticed ;-) Doing like… Brazil !!!