### Table 2. Errors for the Gegenbauer approximation of the function f( ; ) using 36 longitudinal points

1997

"... In PAGE 12: ... The results shown in Figure 2 show that the Gegenbauer polynomial harmonic expansion approximation simultaneously eliminates the oscillations at both bound- aries (for each subinterval). The L1 errors of the Gegenbauer expansion where N is the number of latitu- dinal points, is the order of the Gegenbauer polynomial, and m is the number of Gegenbauer polynomials is seen in Figure 3 and in Table2 . (The number of longitudinal points remains constant.... ..."

Cited by 11

### Table 5* Low Openness Cluster Nahar-Inder Tests for Output Convergence to the Leader, USA

2003

"... In PAGE 15: ... Accordingly, it is redundant to report p-values when these calculated t-statistics are negative. The low openness group results in Table5 are again based on the United States being taken as the group leader. Here we see that there are only two instances where there is significant evidence of convergence, namely between the United States and each of Canada and Japan.... ..."

### Table 1. Some linear and non-linear approximations for LOKI91. box input output |bias|

1996

"... In PAGE 8: ... We will show that it is straightforward to use non-linear approximations in the first two rounds and in the last round of LOKI91 simultaneously, thereby improving the basic linear cryptanalytic attack. The polynomials we will use in our attack are given in Table1 , where we denote the input to the 12-bit S-box by x11 .... ..."

Cited by 13

### Table 1. Some linear and non-linear approximations for LOKI91. box input output jbiasj X S2

"... In PAGE 8: ... We will show that it is straightforward to use non-linear approximations in the rst two rounds and in the last round of LOKI91 simultaneously, thereby improving the basic linear cryptanalytic attack. The polynomials we will use in our attack are given in Table1 , where we denote the input to the 12-bit S-box by x11 : : :x0 and the output by y7 : : :y0. Tokita et al.... ..."

### Table 4: Builtin Chebyshev Polynomials: Approximation of Tn(1)

1998

"... In PAGE 3: ... Tables 3{4 show the calculation times of Tn(1) in exact and approximate modes, respectively. Note that REDUCE with on rounded did not calculate accurate approximations for large n, indicated in Table4 by the symbol 3. This bug is xed by now.... ..."