Algorithm 1.
mSieve: Plausible Substitution Mechanism
| Require: r⃗, 𝕊B, Du, ε | ||
| 1: | s⃗ = getStateSequence(r⃗) | |
| 2: | k ← 1 | |
| 3: | ŝ⃗ ← s⃗ | |
| 4: | for each interval j ∈ {1, 2, …, τ} do | |
| 5: | if isHole(sj, Du, 𝕊B, ε) is true then | |
| 6: | ||
| 7: | ℂk = getPlausibleCandidateSet(Du, s⃗, hk, ε) | |
| 8: | k ← k + 1 | |
| 9: | end if | |
| 10: | end for | |
| 11: | Selected candidate {c1, …, ck} = FillHole({hk}, {ℂk}) | |
| 12: | ||
| 13: | for each hole hk = (․, ts, te), selected candidate ck do | |
| 14: | r̂(ts, te) = getSensorDataFromDB(ck, te − ts) | |
| 15: | end for | |
| 16: |
return
|
|