Ticket #598 (closed: fixed)
DetectorEfficiencyVariation Diagnotics Algorithm (2)
Reported by: | Nick Draper | Owned by: | Steve Williams |
---|---|---|---|
Priority: | major | Milestone: | Iteration 18 |
Component: | Keywords: | ||
Cc: | Blocked By: | ||
Blocking: | Tester: |
Description
The algorithm should perform an integral over range divided by solid angle and the average counts per steradian.
Code on how the fortan code does this but I suggest.
- Run SolidAngle (SubAlgorithm)
- Intergrate data over the range (SubAlgorithm)
- divide intergral by solid angle (SubAlgorithm)
- calculate average integral value
- for each spectra divide 3/4
- Apply cut off values to create mask list
Change History
comment:2 Changed 11 years ago by Steve Williams
(In [2629]) New algorithm FindProblemDetectors, should we change the name (FindBadDetectors?)?. The algorithm isn't tested yet. From a white beam spectrum it identifies detectors that have unusually high and low count rates (detector efficiency). SolidAngle now throws when it is passed a workspace that doesn't have geometry information. re #598
comment:6 Changed 11 years ago by Steve Williams
- Status changed from assigned to closed
- Resolution set to fixed
More work may be needed because currently this algorthim doesn't differentiate between spectra with high and low counts when writing the ouptut workspace. I did this to maintain compatiablity with methods of masking detectors, which I have not investigated.
I understand the main functionality. My time estimate is only that approximately half the time could be spent looking at the fortran and half the time on the implementation. It depends how hard it is to find the relevent fortran subroutines and how complicated they are.