SAX allows for time series distance measures, which lower bound the corresponding distance measures of the original real-valued series.
To bound the TV distance, we may use another probability metric, the Hellinger distance [21].
Consequently, one can argue that a cryptosystem with d TV(p 1,p 2) closer to zero would be more secure in terms of the indistinguishability. Since computing d TV(p 1,p 2) directly is difficult [53], we compute two probability metrics instead to bound the TV distance, which ultimately examines the indistinguishability of our CS-based cryptosystem.
The beacon message should include: (i) a unique key space id, (ii) the public key, where and is the corresponding private key preloaded before deployment, and (iii) the coverage area of the service sensor, which is determined in LKE by a grid size, and specified in iPAK and SBK by a forwarding bound, the maximum distance in hop count over which the existence of a key space can be announced.
The serving area of a service node is predetermined by the forwarding bound, the utmost hop distance from the service node that the keying information can be disseminated.
We can be certain, however, that search cannot succeed without contrast detection; thus our model provides a lower bound on the contrast required, or an upper bound on the distance at which detection is possible.
We also find the maximum error bound of the approximation in the model space R3; and the bound on the distance, in model space, between the approximations which come from the domain of each surface.
In particular, a bound on the position errors can be found in terms of a bound on the distance errors.
Note that when the lower bound on the distance estimate error ρ 1 i tends to zero, the bound obtained in (15) covers the one in [9] as a special case.
