1. Hot Cell Algorithms

2. Threshold – hot if recHit energy > certain value NADA – hot if recHit energy large compared to sum of neighbor cells Digi – hot if sum of ADC counts > 3 sigma above pedestals

3. Threshold Values Cells hot if > threshold energy HB Threshold: 3 GeV HE Threshold: 3 GeV HO Threshold: 2 GeV HF Threshold: 9 GeV

4. NADA (neighboring cell) algorithm Cell < EnergyThreshold1 not considered hot EnergyThreshold1 <Cell <EnergyThreshold2: – Hot if sum of neighbors < 0.1 GeV Energy Threshold2 < Cell <EnergyThreshold3: – Hot if sum of neighbors < (fraction of Cell energy) Cell > EnergyThreshold3: – Always Hot

5. NADA HB Not hot if < 1.5 GeV Hot if: 1.5 GeV<Cell<2.25 GeV and sum of neighbors < 0.1 GeV Hot if: 2.25 GeV<Cell< 10 GeV and sum of neighbors < 33% * Cell Hot if: Cell > 10 GeV HOT NOT HOT

6. NADA HF Not Hot if: – Cell < 1.5 GeV Hot if: – Cell > 1.5 GeV and neighbor sum < 57%Cell Hot if: – Cell > 20 GeV HOT

7. Digi Pedestal Algorithm Find time slice T with largest ADC count – Sum ADC counts over 4 time slices from [T-1] to [T+2] – Sum pedestals over time slices – Add pedestal widths, assuming pedestals uncorrelated Cell hot if (ADC – pedestal) > 3 

8. HB, HF digi distributions “Digi Energy” refers to sum (ADC – pedestal) HF HB

9. Caveats Algorithms used on event-by-event basis; in order to be considered hot, cell must pass algorithm in some minimum fraction (5%) of events Parameters here are by no means final – Tuned to find small number (but not necessarily zero) of hot cells each event.