Consider the fuzzy sets A and B defined on the interval ,0[ ].5 Their membership functions are:
and
Determine the membership function and graph them for each of the following:
i) Ac ,Bc
ii) A ∪B
iii) A ∩B
iv) (A ∪B)c
v) (A∩B)c
Find the length and order of the following schema:
i) S1 =1** 0 0 *1* *
ii) S2 = *0 0 *1 * *
iii) S * * * 0 * * * *
iv) S4 = *1 * 0 1 *
Solve the network to approximate the function:
g(x)=1+sin
for −1≤ x ≤ ,1 choosing the initial weights and bias as the random numbers.
See Answer →Determine the fuzzy relation T as a composition between the fuzzy relations R and S given below by using max-min and max-product:
Consider the ADALINE filter with three neurons in the input layer having weights 1,3 and − 2and the input sequence ......., ,0,0,0 − 0,0,0,5,4 ,.....}. Find the filter output.
See Answer →Consider the single layer perception given below:
Obtain the output for each of the following input pattern:
| Patterns | p1 | p2 | p3 | p4 |
| x1 | 1 | 0 | 1 | 1 |
| x2 | 0 | 1 | 0 | 1 |
| x3 | 0 | 1 | 1 | 1 |
See Answer →
State whether the following statements are True or False. Give short proof or a counter example in support of your answer.
a) The length of chromosomes to determine the maximum value of the set:
S ={X 0 ≤x ≤ 4096}is 12.
b) In the Hopfield network, the neurons belonging to the same layer receive input from
the neurons of the previous layer and send their value only to the neurons of the next
layer.
c) In a single layer neural network, if x ,0
ω > then the output is −1.
d) The fuzzy relation (R) given below, is an equivalence relation.
e) The Self Organizing Map (SOM) is a supervised learning technique.
See Answer →
Find the convolutional code for the message 11011. The convolutional encoder is given in Fig. 1.
See Answer →Let C = {0000,1113,2222,3331,0202,1313,2020,3131,0022,1131,2200,3313,0220,1333,2002,3111} be the Z4-linear code. Find the Gray image of C.
See Answer →Find the generating idempotents of duadic codes of length n = 23 over F3. (Hint: Mimic example 6.1.7.)
See Answer →Let C be the [5, 2] ternary code generated by
Find the weight enumerator WC (x, y) of C
See Answer →Let C be the ternary [8,3] narrow-sense BCH code of designed distance δ = 5, which has defining set T = {1,2,3,4,6}. Use the primitive root 8th root of unity you chose in 4a) to avoid recomputing the the table of powers. If g(x) = x 5 −x 4 +x 3 +x 2 −1
is the generator polynomial of C and
y(x) = x 7 −x 6 −x 4 −x 3
is the received word, find the transmitted codeword.
See Answer →If C1 has some odd weight codewords, what is the relationship between 1+x and g1(x)?
See Answer →If C1 has only even weight codewords, what is the relationship between (1+x) and g1(x)?
See Answer →Prove that C is the vector space of all vectors in F n 2 with even weight.
See Answer →Let w be subspace of F n 2 containing all the vectors of even weight. Prove that W has dimension n−1. (Hint: Consider the map w: F n 2 → F2 given by w((a1,a2,...,an)) = a1 +a2 +···+an.)
See Answer →What is the dimension of C ?
See Answer →Over F2, (1+x) | (x n −1). Let C be the binary cyclic code (1+x) of length n. Let C1 be any binary cyclic code of length n with generator polynomial g1(x).
See Answer →Let C1 and C2 be cyclic codes over Fq with generator polynomials g1(x) and g2(x), respectively. Prove that C1 ⊆ C2 if and only if g2(x) | g1(x)
See Answer →