Therefore, we adopt vector table [SR.sub.i] = ([Tr.sub.i1], [Tr.sub.i2], [Tr.sub.i3], [Tr.sub.in]) to store the summary information that the node [N.sub.i] reports about other nodes.

After the update operation, as shown in Table 3, the trusted routing tables [TRT.sub.i], [TRT.sub.j] of node [N.sub.i] and node [N.sub.j] contain five row vectors [SR.sub.1], [SR.sub.2], [SR.sub.3], [SR.sub.i], [SR.sub.j], and [SR.sub.1] is the latest vector table in node [N.sub.j].

Destination node Vector table TwID Signature information [N.sub.1] [SR.sub.1] 1 [Sig.sub.1] [N.sub.2] [SR.sub.2] 1 [Sig.sub.2] [N.sub.i] [SR.sub.i] 1 [Sig.sub.i] Table 2: Trusted routing table [TRT.sub.j] of node [N.sub.j] before update.

Using a vector table to record each set of exercises.

This record vector table shows that there are 3 kinds of exercises and six kinds of corresponding cognitive skills in this set.

Table 1: Voltage

vector table [psi]S Te [theta](1) [theta](2) [theta](3) [theta](4) 1 -2 V6 V6 V1 V1 -1 V1 V1 V2 V2 0 V7 VO V7 V0 1 V2 V3 V3 V4 2 V2 V2 V3 V3 -1 -2 V5 V5 V6 V6 -1 V5 V6 V6 V1 0 VO V7 VO V7 1 V4 V4 V5 V5 2 V3 V3 V4 V4 [psi]S Te [theta](5) [theta](6) [theta](7) [theta](8) 1 -2 V2 V2 V3 V3 -1 V3 V3 V4 V4 0 V7 VO V7 VO 1 V4 V5 V5 V6 2 V4 V4 V5 V5 -1 -2 V1 V1 V2 V2 -1 V1 V2 V2 V3 0 VO V7 VO V7 1 V6 V6 V1 V1 2 V5 V5 V6 V6 [psi]S Te [theta](9) [theta](10) [theta](11) [theta](12) 1 -2 V4 V4 V5 V5 -1 V5 V5 V6 V6 0 V7 VO V7 VO 1 V6 V1 V1 V2 2 V6 V6 V1 V1 -1 -2 V3 V3 V4 V4 -1 V3 V4 V4 V5 0 VO V7 VO V7 1 V2 V2 V3 V3 2 V1 V1 V2 V2

IP addresses of the connected servers are stored in a

vector table shown in Table 2.

There is a collection by ordering RSSI value in the vector table as follows:

[rho](k) (k = 1, 2, ..., m) is ordered from small to big; then, in vector table R, N vectors which are the most similar to the vector [R.sub.T] = {[RSSI.sub.T1], [RSSI.sub.T2], ..., [RSSI.sub.Tj], ..., [RSSI.sub.Tn]} are satisfied with the relation; it is as follows:

The line-type vector (theme 2), representing the interfluves, will be converted into a point-type vector (for each digitized vertex); this

vector table will contain the associated attribute information of the slope value and the type of relief (interfluve or not--theme 5)--figure 1c).

(Of course, the vectors in the vector table are sorted by expected frequency of occurrence.) The decoder simply decodes a Huffman code and does a lookup into the current table of vectors.

A region in the previous image (located at fractional pixel coordinates) is added to a difference array produced by statistical decoding and vector table lookup to produce a region of the current image being constructed.