Information Technology Reference
In-Depth Information
template does not match any self individual. Actually, a template is regarded as a
candidate detector.
For example, if
l
=4,
r
=3 and the self set is {0010, 1001}, template “111*” is a
valid detector.
Obviously, this definition of the detector can enlarge the coverage of a detector and
decrease the number of detectors needed for a given detection rate.
Definition 2. A candidate detector template of a self string:
Given a self string
x
lc
) can be
constructed as follows. Select
c
bits of
s
randomly and flip these
c
bits, and let
other
s
=
x
x
x
L
, a candidate detector template
T
with order
c
(
=
−
r
+
1
1
2
3
r
−
1
bits as “blanks”.
For example,
T
can be one of the following templates:
x
x
L
x
*
*
L
*
,
1
2
L
L
x
x
x
*
x
*
*
,
*
1
2
c
−
1
c
+
1
x
x
L
x
*
*
x
*
L
,
1
2
c
−
2
c
+
1
……,
or
LL
.
Template
T
has
r-
1 “blanks” and
c
determinate bits. Each bit of
c
determinate bits
is set by flipping the corresponding bit of
S
. Therefore, the possible number of
*
*
*
x
x
x
r
l
−
1
l
T
is
⎛
l
⎞
⎜
⎜
⎝
⎟
⎟
⎠
.
r
−
1
Definition 3. A candidate detector template of both a self string and a template:
Given a self string
s
=
y
y
y
L
y
and a candidate detector template
t
with order
c
,
1
2
3
l
one candidate detector template
T
,
with order
c
+
k
, is constructed by the following
s
method. If
“blank” bits randomly and set the val-
ues of the selected bits by flipping the corresponding bits of
S
, while other
k
≤
l
−
c
, select k-bits of the
l
−
c
l
−
c
−
k
bits remain “blank”. On the other side, if
k
>
l
−
c
, such candidate detector template
T
,
does not exist.
s
For example, if
t
=
x
x
L
c
x
*
*
L
*
, then
T
,
with order
c
+
k
can be one of the
1
2
s
following templates:
x
x
L
x
y
L
y
*
L
*
,
1
2
c
c
+
1
c
+
k
x
x
L
x
y
L
y
*
y
*
L
*
,
*
1
2
c
c
+
1
c
+
k
−
1
c
+
k
x
x
L
x
y
L
y
*
*
y
*
L
,
1
2
c
c
+
1
c
+
k
−
1
c
+
k
……,
or
x
x
L
x
*
*
L
*
y
L
y
x
.
1
2
c
l
−
k
+
1
l
−
1
l
