Information Technology Reference
In-Depth Information
12. What is the major limitation of the random generation approach in the origi-
nal description of the NSA?
13. What are the two phases of the NS dynamic programming approach described
in the chapter?
14. Given l
=
=
2 and S 1 = 0 0 0 0, S 2
=
1 0 0 1, S 3 =
=
4, r
0 1 1 0, and S 4
0 1 0 1? Could you list the nonself strings as possible detectors?
15. What are the time and space complexity of the dynamic programming
approach in negative detector generation?
16. What are the advantages of the greedy algorithm over the dynamic program-
ming approach?
17. What does the following statement mean?
“obtain a better coverage of the string space”
18. Analyze the following statements:
Generating detectors at random will take exponential time in the set of the
size of the sample self-set ( S ) and r matching
h e dynamic programming approach will run in linear time in the size of
S and the number of detectors, but grows exponentially in r
h e greedy approach will also run in linear time in the size of S and the
number of detectors, and grows exponentially in r
19. Explain the notion of immunological hole. Why is it an important concept in
detector generation?
Illustrate with examples (self-set) where holes exist?
Illustrate how the holes can be generated using crossover closure for a
given set of self-strings.
20. Explain the main idea behind RNS algorithms.
21. Explain the main ideas behind the following approaches:
Detector generation using an evolutionary algorithm
Randomized NS
Fuzzy NS
V-detector NS
NSA
Multishaped NS
Combining NS and classifi cation techniques
22. Mention some applicability issues of binary NSA. Mention some applicability
issues of real-valued NSA.
23. What is an NDB? Mention diff erent NDB algorithms and compare them.
24. Illustrate with an example to show the equivalence between the NDB and
CNF. How does it relate to SAT problem?
25. Mention diff erent operations used in NDB. Illustrate with an example
negative algebra, for example, negative union and negative join.
26. What are the desired properties of an NDB design to use as a privacy-preserving
storage system?
Search WWH ::




Custom Search