- scalar_t *edge_lengths = new scalar_t[nb_edges];
- int *vertex_from = new int[nb_edges];
- int *vertex_to = new int[nb_edges];
- int *result_edge_occupation = new int[nb_edges];
-
- for(int e = 0; e < nb_edges; e++) {
- (*file) >> vertex_from[e] >> vertex_to[e] >> edge_lengths[e];
+ int la, lb;
+ scalar_t sa, sb;
+ for(int t = 0; t < nb_time_steps; t++) {
+ // Target a moves from location 0 to the middle and comes back,
+ // and is strongly detected on the first half, target b moves from
+ // location nb_locations-1 to the middle and comes back, and is
+ // strongly detected on the second half
+ if(t < nb_time_steps/2) {
+ la = t;
+ lb = nb_locations - 1 - t;
+ sa = detection_score(10.0, -1.0, score_noise, flip_noise);
+ sb = detection_score( 1.0, -1.0, score_noise, flip_noise);
+ } else {
+ la = nb_time_steps - 1 - t;
+ lb = t - nb_time_steps + nb_locations;
+ sa = detection_score( 1.0, -1.0, score_noise, flip_noise);
+ sb = detection_score(10.0, -1.0, score_noise, flip_noise);