### Table 1: Algebraic Laws and Rules Summation

"... In PAGE 23: ... Theorem 3.3 The formal equations/inequations and rules in Table1 are sound for fair bisimilarity and forti cation. Proof: 1-12 are immediate and the proofs for 13-16 are the subject of Section 3.... In PAGE 23: ...2. We will prove the xpoint theorems 14 and 15 of Table1 by ordinal induction on approximations for the relations of fair bisimilarity and forti cation de ned in the next subsection. Fixpoint Theorems and the Soundness of First we observe that the basic substitutivity laws of equational reasoning and the mono- tonicity rules for hold.... ..."

### Table 2. Preventive cryptographic countermeasures.

2005

"... In PAGE 7: ... In terms of authentication, P2P means that the generation and verification of an authentication code are performed by every forwarding router; while E2E means that the generation of an authentication code is performed only at the originating router, all the forwarding routers and termination routers are part of the end system, and they only perform verification. In Table2 , we summarize two main preventive cryptographic countermeasures needed for link-state routing protocols; the table also includes labeling currently available approaches. ... ..."

### TABLE 4. Algebraic expressions for L and B for the Enhancements

### Table 11: Analysis of Average Memory Reference Activity - Improved Dynamic 2-bit Counter Scheme ulululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululul Instruction Number of Percent Memory Refs. Post-Trans. Refs.

1995

"... In PAGE 18: ... Results of simulations using the Improved Dynamic 2-bit miss predic- tion table are shown in Table 11. As can be seen in Table11 , the number of instructions that are placed in the C/NA category is much smaller when compared with those in Table 10. This results in reducing the number of memory references such that there is only a 0.... ..."

### Table 11: Analysis of Average Memory Reference Activity - Improved Dynamic 2-bit Counter Scheme ulululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululululul Instruction Number of Percent Memory Refs. Post-Trans. Refs.

1995

"... In PAGE 18: ... Results of simulations using the Improved Dynamic 2-bit miss predic- tion table are shown in Table 11. As can be seen in Table11 , the number of instructions that are placed in the C/NA category is much smaller when compared with those in Table 10. This results in reducing the number of memory references such that there is only a 0.... ..."

### Table 1: Various algebras built using Albert.

1992

"... In PAGE 6: ... This command merely causes Albert to check if the polynomial expands to zero in the free algebra. Testing The results of several experiments are shown in Table1 . All times re ect computations made on a Sun SPARCstation1+, and are approximate.... In PAGE 6: ... A theorem of Hall apos;s [4] describes a basis for free Lie rings in terms of a set of \standard monomials quot;. The dimensions for Lie algebras, shown in Table1 , are precisely the numbers predicted by Hall apos;s theorem. Another test we employed was to make use of Artin apos;s theorem ([14], p 29) that states that any alternative algebra generated bytwo elements is associative.... In PAGE 10: ... In fact, these problems are beyond the scope of Albert, given the speed and memory sizes of present computers. The computations in Table1 were performed done on a computer with 12 mb memory. Albert can do useful work, however, with much less than this.... In PAGE 10: ... Albert can do useful work, however, with much less than this. As Table1 demonstrates, the system tends to do well when the number of generators is kept small, usually two or three. (For example note that the dimension of the degree 8 Lie algebra with 4 a apos;s and 4 b apos;s is only 39, and yet the degree 7 Lie algebra having 3 a apos;s, 2 b apos;s, 1 c,and1d is 232.... ..."

Cited by 7

### Table 1: Various algebras built using Albert.

"... In PAGE 6: ... This command merely causes Albert to check if the polynomial expands to zero in the free algebra. Testing The results of several experiments are shown in Table1 . All times re ect computations made on a Sun SPARCstation1+, and are approximate.... In PAGE 6: ... A theorem of Hall apos;s [4] describes a basis for free Lie rings in terms of a set of \standard monomials quot;. The dimensions for Lie algebras, shown in Table1 , are precisely the numbers predicted by Hall apos;s theorem. Another test we employed was to make use of Artin apos;s theorem ([14], p 29) that states that any alternative algebra generated by two elements is associative.... In PAGE 10: ... In fact, these problems are beyond the scope of Albert, given the speed and memory sizes of present computers. The computations in Table1 were performed done on a computer with 12 mb memory. Albert can do useful work, however, with much less than this.... In PAGE 10: ... Albert can do useful work, however, with much less than this. As Table1 demonstrates, the system tends to do well when the number of generators is kept small, usually two or three. (For example note that the dimension of the degree 8 Lie algebra with 4 a apos;s and 4 b apos;s is only 39, and yet the degree 7 Lie algebra having 3 a apos;s, 2 b apos;s, 1 c, and 1 d is 232.... ..."

### TABLE IV AVERAGE EXECUTION TIME FOR THE BIT-PLANE ENCODING OF AN ENHANCEMENT-LAYER FRAME ON P4 2GHZ MACHINE Sequences Straightforward Implementation Dynamic Memory Organization Improvement Ratio

### Table 3: Google-Enhanced Improvements

"... In PAGE 5: ... We exper- imented with five different configurations of this process and one process (S2) yielded particularly successful results. In Table3 , as can be seen from the three most recent years of TREC, as compared to the baseline, the S2 system in preliminary tests yielded a 6.4% relative improvement in factoid performance and a 4.... ..."

### Table 5. Enhanced system throughput and memory requirements

1994

Cited by 15