Let us consider four pairs of associated patterns as described below.

 (i) s (1) = [−1, −1, −1], and t (1) = [−1, −1]

(ii) s (2) = [−1, −1, 1], and t (2) = [−1, 1]

 (iii) s (3) = [−1, 1, −1], and t (3) = [1, −1]

 (iv) s (4) = [1, −1, −1], and t (4) = [1, 1] Construct a hetero-associative net to store these associated vectors carry out the following tasks with the net thus constructed.

 (I) Test the net with s (1), s (2), s (3) and s (4) as inputs.

 (ii) Set the middle element of each of the vectors s (1), s (2), s (3) and s (4) to 0s. Then test if the net is able to tolerate these noisy inputs and recall the correct associations.

 (iii) Carry out the task mentioned above with two, instead of one, arbitrarily chosen missing elements.

(iv) Flip the middle element of each of the vectors s (1), s (2), s (3) and s (4), i.e., replace a 1 by −1 and vice versa. Then test if the net is able to tolerate these erroneous inputs and recall the correct associations.