Algorithm 1 Resampling algorithm

1: ${\hat{\mathrm{\Theta }}}_{\mathrm{inq},\mathrm{i},\mathrm{j},\mathrm{t}}=\varnothing$, $S_{\mathrm{tr}}=0$

2: $u$ is generated by the uniform probability of (0,1)

3: for n = 1 to $N_{\mathrm{tr}}$ do

4: $S_{\mathrm{tr}}=S_{\mathrm{tr}}+{\overline{I}}_{\mathrm{res},\mathrm{i},\mathrm{n}}$

5: if $S_{\mathrm{tr}}>u$

6: ${\hat{\mathrm{\Theta }}}_{\mathrm{inq},\mathrm{i},\mathrm{m},\mathrm{t}}={\stackrel{⌣}{\mathrm{\Theta }}}_{\mathrm{inq},\mathrm{i},\mathrm{n},\mathrm{t}}$

7: end if

8: end for

9: return ${\hat{\mathrm{\Theta }}}_{\mathrm{inq},\mathrm{i},\mathrm{j},\mathrm{t}}$