CalTask Force Workshop VLIMANT Jean-RochLPNHE10 feb 2003 T42 algorithm dedicated webpage :

Slides:



Advertisements
Similar presentations
More about Ruby Maciej Mensfeld Presented by: Maciej Mensfeld More about Ruby dev.mensfeld.pl github.com/mensfeld.
Advertisements

Chapter 2.2 – More about Ruby Maciej Mensfeld Presented by: Maciej Mensfeld More about Ruby dev.mensfeld.pl github.com/mensfeld senior.
Intermediate Code Generation
File Systems.
Program Slice Program slice was a concept first discussed by Mark Weiser in the early 1980’s –He especially noticed that when people debug, they trace.
ITEC 320 Lecture 12 Higher level usage of pointers.
Conveners Oct G. Bernardi LPNHE - Paris Why do we need Jet-id ? Because there are noise/fake jets What are the Noise/Fake jets ? 1)Noise jets (partly.
Automatic Identification of ROIs (Regions of interest) in fMRI data.
Lecture 4 Edge Detection
Search and Recursion CS221 – 2/23/09. List Search Algorithms Linear Search: Simple search through unsorted data. Time complexity = O(n) Binary Search:
A Package For Tracking Validation Chris Meyer UC Santa Cruz July 6, 2007.
G Robert Grimm New York University Sprite LFS or Let’s Log Everything.
Simulation Work at Nevis Jovan Mitrevski Columbia University DØ Workshop July 10, 2002.
1Calice-UK Cambridge 9/9/05D.R. Ward David Ward Compare Feb’05 DESY data with Geant4 and Geant3 Monte Carlos. Work in progress – no definitive conclusions.
Reinforcement Learning Rafy Michaeli Assaf Naor Supervisor: Yaakov Engel Visit project’s home page at: FOR.
Video Google: Text Retrieval Approach to Object Matching in Videos Authors: Josef Sivic and Andrew Zisserman ICCV 2003 Presented by: Indriyati Atmosukarto.
1 ES 314 Advanced Programming Lec 3 Sept 8 Goals: complete discussion of pointers discuss 1-d array examples Selection sorting Insertion sorting 2-d arrays.
Ray Tracing Outline For each pixel { Shoot ray r from eye to center of pixel with trace( r ) } function trace( r ) For each object { Find object with closest.
G Robert Grimm New York University Sprite LFS or Let’s Log Everything.
IMPROVING THE PERFORMANCE OF JPEG-LS Michael Syme Supervisor: Dr. Peter Tischer.
M. Lefebvre, 6 June 2006Noise and correlation monitoring1 Noise and correlation monitoring using LArNoiseMonToolBase M. Lefebvre University of Victoria.
Memory Allocation CS Introduction to Operating Systems.
Image segmentation by clustering in the color space CIS581 Final Project Student: Qifang Xu Advisor: Dr. Longin Jan Latecki.
DETECTING NEAR-DUPLICATES FOR WEB CRAWLING Authors: Gurmeet Singh Manku, Arvind Jain, and Anish Das Sarma Presentation By: Fernando Arreola.
JavaScript Form Validation
Scheduling Instructions- Elementary Working in the Mainframe to schedule students for the Esembler Grade Book Program If you wish to view a printable version.
Preliminary comparison of ATLAS Combined test-beam data with G4: pions in calorimetric system Andrea Dotti, Per Johansson Physics Validation of LHC Simulation.
15 Dec 2010 CERN Sept 2010 beam test: Sensor response study Chris Walmsley and Sam Leveridge (presented by Paul Dauncey) 1Paul Dauncey.
Chapter 13 Query Processing Melissa Jamili CS 157B November 11, 2004.
TPC online reconstruction Cluster Finder & Conformal Mapping Tracker Kalliopi Kanaki University of Bergen.
Executable Unpacking using Dynamic Binary Instrumentation Shubham Bansal (iN3O) Feb 2015 UndoPack 1.
Hardware process When the computer is powered up, it begins to execute fetch-execute cycle for the program that is stored in memory at the boot strap entry.
19/07/20061 Nectarios Ch. Benekos 1, Rosy Nicolaidou 2, Stathes Paganis 3, Kirill Prokofiev 3 for the collaboration among: 1 Max-Planck-Institut für Physik,
Data Extraction using Image Similarity CIS 601 Image Processing Ajay Kumar Yadav.
CAT plenary meeting VLIMANT Jean-RochLPNHE13 may 2003 T42 algorithm dedicated webpage :
8/26/02 D0 Calorimeter Task Force Stephanie Beauceron LPNHE - Paris 1 Offline zero suppression Aim: Understand the huge value of Missing E T at 1.5  Principally.
Automated Musical Part Writing Kevin Deisz. Input  Positive integer - dictates the number of chords to be created  Instrument file (python) - file that.
AMB HW LOW LEVEL SIMULATION VS HW OUTPUT G. Volpi, INFN Pisa.
PSI - 11 Feb The Trigger System of the MEG Experiment Marco Grassi INFN - Pisa On behalf of D. Nicolò F. Morsani S. Galeotti.
D. Cavalli, S. Resconi 2 Dec 2008 EtMiss Software updates Jet/EtMiss Meeting D. Cavalli, S. Resconi.
7 December SLHC Calo Trigger Simulation Status Report Kevin Flood, Michail Bachtis University of Wisconsin, Madison.
HACR at Virgo: implementation and results Gabriele Vajente 12 th ILIAS WG1 meeting Geneva, March 29 th -30 th 2007.
Hardware process When the computer is powered up, it begins to execute fetch-execute cycle for the program that is stored in memory at the boot strap entry.
M. Pilar Casado 1 Optimization of Tau Menus: L1 & L2 Trigger & Physics week (19-22 March 2007) M. Pilar Casado (IFAE & UAB) on behalf of the Tau Trigger.
CALOR April Algorithms for the DØ Calorimeter Sophie Trincaz-Duvoid LPNHE – PARIS VI for the DØ collaboration  Calorimeter short description.
Missing Et Before and After Shutdown Yuri Gershtein.
Anatoli Romaniouk TRT Test manual Some important information p. 2-3Some important information p. 2-3 Noise studies p.4-7Noise studies p.4-7 Operation with.
Study on search of a SM Higgs (120GeV) produced via VBF and decaying in two hadronic taus V.Cavasinni, F.Sarri, I.Vivarelli.
Lecture 8: Advanced OOP Part 2. Overview Review of Subtypes Interfaces Packages Sorting.
A New Class of High Performance FFTs Dr. J. Greg Nash Centar ( High Performance Embedded Computing (HPEC) Workshop.
FE-I4 irradiated chip tests at low temperature M. Menouni, P. Breugnon, A. Rozanov (CPPM - Aix-Marseille Université)
What is a Process ? A program in execution.
N. Saoulidou, Fermilab1 Study of the QIE Response & Calibration (Current Injection CalDet & Development of diagnostic tools for NearDet N.Saoulidou,
Update 2 on Noise Clusters Hardeep Bansil University of Birmingham 23/04/2013.
A. SarratILC TPC meeting, DESY, 15/02/06 Simulation Of a TPC For T2K Near Detector Using Geant 4 Antony Sarrat CEA Saclay, Dapnia.
BEACH 04J. Piedra1 SiSA Tracking Silicon stand alone (SiSA) tracking optimization SiSA validation Matthew Herndon University of Wisconsin Joint Physics.
EVT61 EVAPOTRANSPIRATION PACKAGE. EVT62 EVAPOTRANSPIRATION PACKAGE The Evapotranspiration (ET) Package simulate the effects of plant transpiration and.
File-System Management
Calling Conventions, Caching
DREAM TEAM 2 Roto, Holiano, Chaka
Chapter 11: File System Implementation
Data Compression.
Advanced information retreival
VLIMANT Jean-Roch LPNHE 13 may 2003
Modeling Page Replacement Algorithms
Practical TULIP lecture next Tues 12th Feb. Wed 13th Feb 11-1 am.
Jean-Roch Vlimant LPNHE november 6, 2002
CS Introduction to Operating Systems
Preliminary results on depolarization due to beam-beam interaction at SuperB Cecile Rimbault LAL - Orsay.
Modeling Page Replacement Algorithms
Presentation transcript:

CalTask Force Workshop VLIMANT Jean-RochLPNHE10 feb 2003 T42 algorithm dedicated webpage :  Principale  Implementation  Effect on data  To come

T42 Principale : reject isolated medium cells Named after an algorithm used in H1  Select high signal cells (4 sigma)  Keep their significant neighbours (2 sigma)  Thresholds to be tuned

cal_t42 Package using same frame as cal_nada Classes :  Calt42 : container for cell lists  Calt42Chunk : container for Calt42 object  Calt42Reco : –does the cleaning and chunks managment. –Get the neighbourhood info from a Calt42Struct object which allows a linear algorithm complexity.

Calt42Reco

Calt42Struct Class content  Objects –spine : array[81600] of structured object  Mapped to ieta, iphi, layer by : INDEX = iphi + 64( layer - 1 ) ( ieta + 37 ) - 1 –Structured object fields  sigma : tells the noise rms of the cell  pointers to all possible neighbours within the array  single pointer to be assigned to a CalCell available in data  lots of methods user-friendly  method to read neighbourhood information from a text file (rather than doing awfull, uncheckable code)

Calt42Struct Neighbourhood information  How to check ? –Standalone executable return neighbours for a given cell (exist as a method) –Check cell_files and pictures for exceptions descriptions (webpage) –Check the code of the four executables (simple algorithms)  Regular cells –normal –out of fine layers (3,4,5,6) –near fine layers (2,7)  Exceptions cells –Neighbours above or below splited into different layers –Intercryostat and nearby cells

Study effects on data  Data sets –Debugging (preliminary result ) with  recoT_all_ _mrg_ raw_p –MET test (sophie) 1000 evts of  recoT_all_ _mrg_ raw_p output : /work/coco-clued0/vlimant/TK2/runsophie/Recoanalyze.root –W, Z tests (WZ) evts of  WZskim-emStream-*-*.raw_p under the project name WZstreamTMBp13.04

Population report overall result for evts processing (WZ) Before 1815 After 1265 At second(4) 840 At first(0) 1815

Population report Region result

Isolated cells Clustered cells

 Isolation decreases and tightens by 10%  EM fraction tightens by 25%  Hmatrix8 decrease by 5%  EMIds increases by 10% EM changes

 MET increase (in mean)  W transverse mass with more entries  MEx centered (- 30%)  MEx made more even  fewer noise MET changes

T42 conclusions Remains to do  Ultimatetly cross check neighbours  Study thresholds for reasonnable loss of cells  More studies on effect on physics –Rootuple with dedicated data block available, help is welcome