Information Technology Reference
In-Depth Information
0 0 0 1 0 1 0
1 1 0 0 0 1 1
1 0 1 1 0 1 0
=2, the first two address bits in the first example are 00, showing
that the output value of the data bits is 0. For the second example, its data bits are
11, so the bit 3 must be considered and the output value is 1. The disjunctive
normal form of the function is expressed in the following form:
F
Because
k
a'
0
a'
1
d
0
+ a'
0
a
1
d
1
+ a
0
a'
1
d
2
+ a
0
a
1
d
3
The 6-path multiplexer is as follows:
0 0 0 # # # / 0
0 0 1 # # # / 1
0 1 # 0 # # / 0
0 1 # 1 # # / 1
1 0 # # 0 # / 0
1 0 # # 1 # / 1
1 1 # # # 0 / 0
1 1 # # # 1 / 1
6
=
6
]. Boole can find multiple members of a particular
classifier. On trial, profit-punishment policy is adopted, where
This set is denoted by [
S
e
= 0.1
R
=
1000
R
= 4.0
Ⱥ
= 0.001
χ
= 0.12
Ⱦ
= 1.0
t
= 0.1. The
results of 13,000 tests are presented in Table 13.1. The top 8 classifiers in Table
13.1 are the members of [
' = 0
p
= 0.8
G
S
6
].
13.9 Rule Discovery System
In rule discovery system, the first task is to evaluate the quality of the existing
rules in the system, and then improve them. Grefenstette had developed a rule
discovery system: RUDI(Grefenstette,1988). Figure 13.10 presents its control
structure. The levels of problem solving consist of simplified classifier system. In
learning level, genetic operators are used to operate population of knowledge
structure, which is expressed as a set of rule table. The whole behavior of
knowledge structure is used to control these structures' reproduction.
In RUDI, credit-valuating method, profit-sharing plan(PSP) and bucket brigade
algorithm(BBA) are used to provide each rule with mutually complementary
effective information. According to expected exterior reward, PSP-intensity
provides rule effectiveness with even more accurate evaluation. During problem
solving, it is used to solve confliction. On the contrary, BBA-intensity evaluates
