Skip to main content
. Author manuscript; available in PMC: 2017 Jan 3.
Published in final edited form as: Proc ACM Int Conf Ubiquitous Comput. 2016 Sep;2016:706–717. doi: 10.1145/2971648.2971753

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:     sj=hk=(,sj.ts,sj.te)
7:     ℂk = getPlausibleCandidateSet(Du, s⃗, hk, ε)
8:     kk + 1
9:   end if
10: end for
11: Selected candidate {c1, …, ck} = FillHole({hk}, {ℂk})
12:
r^r
13: for each hole hk = (․, ts, te), selected candidate ck do
14:   (ts, te) = getSensorDataFromDB(ck, tets)
15: end for
16: return
r^