- Jan 23, 2019
-
-
Kipp Cannon authored
- a bunch of code was added related to the alphabet soup approach, and then commented out. this patch removes it. it can be reverted later if somebody wants to resurrect it
-
- Jan 22, 2019
-
-
Madeline Wade authored
-
- Jan 21, 2019
-
-
Madeline Wade authored
-
Madeline Wade authored
-
Duncan Meacher authored
-
Duncan Meacher authored
-
Kipp Cannon authored
-
- Jan 19, 2019
-
-
Aaron Viets authored
-
Kipp Cannon authored
- define a stand-alone method to implement the ranking statistic's fast-path cut, and use that method for both the cut itself *and* the coinc sieve passed to thinca to ensure the two are always identical. - this is the first step in making this cut much *MUCH* more agressive.
-
Cody Messick authored
-
Cody Messick authored
-
- add option to cluster after coincidence. Note the biggest SNR and biggest LR (if available) trigger is kept - fix bug in max over lr and snr - optionally limit the far of single candidates by live time for online analysis - make online 'clustering' before LR computation - fix clustering
-
-
-
-
-
-
-
-
-
-
-
-
-
-
consolidate DAG classes from inspiral_pipe.py + dagparts.py (e.g. generic_node) into dagparts.py, move non-specific inspiral functions from inspiral_pipe.py to dagparts.py, changes reflected in several dag generation execs
-
-
-
-
-
-
-
-
-
-
Kipp Cannon authored
-
-
-
-
-