sddm - Code for the self-destructing dark matter search in SNO

diff options

author	tlatorre <tlatorre@uchicago.edu>	2018-10-18 10:13:54 -0500
committer	tlatorre <tlatorre@uchicago.edu>	2018-10-18 10:13:54 -0500
commit	4f1c77fb1dcc1c1a927c0ee6b7571aebcff71495 (patch)
tree	427fb1ab4017868cf0d228750d812c0e1bb85940
parent	93f4b97a553998ac8fb59005c3d99b303afb6f60 (diff)
download	sddm-4f1c77fb1dcc1c1a927c0ee6b7571aebcff71495.tar.gz sddm-4f1c77fb1dcc1c1a927c0ee6b7571aebcff71495.tar.bz2 sddm-4f1c77fb1dcc1c1a927c0ee6b7571aebcff71495.zip

update path_init() to check for a divide by zero

This commit updates path_init() to check that beta > 0 before dividing by it to compute the time. Previously when fitting electrons it would occasionally divide by zero which would cause the inf to propagate all the way through the likelihood function.

Diffstat

-rw-r--r--

src/path.c

1 files changed, 4 insertions, 1 deletions

/* Copyright (c) 2019, Anthony Latorre <tlatorre at uchicago> * * This program is free software: you can redistribute it and/or modify it * under the terms of the GNU General Public License as published by the Free * Software Foundation, either version 3 of the License, or (at your option) * any later version. * This program is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for * more details. * You should have received a copy of the GNU General Public License along with * this program. If not, see <https://www.gnu.org/licenses/>. */ #include <stdio.h> #include "sno_charge.h" #include <unistd.h> #include <stdlib.h> #include <errno.h> /* for errno */ #include <string.h> /* for strerror() */ void usage(void) { fprintf(stderr,"Usage: ./test-charge\n"); fprintf(stderr," -n number of PE\n"); fprintf(stderr," -b number of bins\n"); fprintf(stderr," --xmin Lowest value of charge\n"); fprintf(stderr," --xmax Highest value of charge\n"); fprintf(stderr," -h Display this help message\n"); exit(1); } int main(int argc, char **argv) { size_t i, j, nq, n; double *x; double qlo, qhi; n = 10; nq = 1000; qlo = -1.0; qhi = 1.0; for (i = 1; i < argc; i++) { if (!strncmp(argv[i], "--", 2)) { if (!strcmp(argv[i]+2,"xmin")) { qlo = strtod(argv[++i],NULL); continue; } else if (!strcmp(argv[i]+2,"xmax")) { qhi = strtod(argv[++i],NULL); continue; } } else if (argv[i][0] == '-') { switch (argv[i][1]) { case 'n': n = atoi(argv[++i]); break; case 'b': nq = atoi(argv[++i]); break; case 'h': usage(); default: fprintf(stderr, "unrecognized option '%s'\n", argv[i]); exit(1); } } } init_charge(); x = malloc(nq*sizeof(double)); for (i = 0; i < nq; i++) { x[i] = qlo + (qhi-qlo)*i/(nq-1); } FILE *pipe = popen("graph -T X --bitmap-size 2000x2000 -X 'Charge (PE)' -Y Probability", "w"); if (!pipe) { fprintf(stderr, "error running graph command: %s\n", strerror(errno)); exit(1); } for (i = 1; i <= n; i++) { for (j = 0; j < nq; j++) { fprintf(pipe, "%.10f %.10f\n", x[j], get_pq(x[j],i)); } fprintf(pipe, "\n\n"); } if (pclose(pipe)) { fprintf(stderr, "error closing graph command: %s\n", strerror(errno)); exit(1); } free(x); return 0; }


context:
space:
mode: