### Table 1 Parameters of the adaptive finite difference scheme.

"... In PAGE 7: ... The initial condition is a non- smooth cone centered in the point B4BDBGBN BDBGB5 D9BCB4DCBN DDB5 BP D1CPDCB4BCBN BGCTA0BDBHB4B4DCA0BD BGB5BEB7B4DDA0BDBGB5BEB5 A0 BFB5 BM The velocity CPB4DCBN DDB5 BP B4A0DDBN DCB5D8 corresponds to a circular rotation around the origin. The parameters of the adaptive scheme are shown in Table1 . In order to avoid very small time steps induced by the CFL-condition, we limited the maximal level of refinement in (8).... ..."

### Table 1: Finite Sample Sizes

2000

"... In PAGE 18: ... For each statistics, we report the minimum, mean, median and maximum of the rejection probabilities under the null and the alternative hypothesis. As can be seen from Table1 ,thefinite sample sizes of the test SN are quite close to the corresponding nominal sizes. The sizes are calculated using the critical values from the standard normal distribution, and therefore the simulation results corroborate the asymptotic normal theory for SN.... ..."

Cited by 2

### Table 1: Number of iterations required to nd an optimal solution using the previous solution as a starting point and using the vector (0; : : : ; 0) as a starting point.

2001

"... In PAGE 24: ... When a new user enters the system, running the MFVA algorithm using as a starting point the optimal solution for the problem prior to the new user apos;s arrival typically results in substantial computational savings. Table1 shows results from a power control problem involving a system of ten by ten cells and approximately nine hundred mobile users. The number of iterations required to nd the optimal solution for an initial problem is given, along with the number of iterations required to nd the optimal solution when additional users enter the system.... ..."

Cited by 10

### Table 1 The generators and the finite points of the ELCP of Example 3.3.

### Table 13: Use of nonfinite be in finite contexts

"... In PAGE 8: ...imes be is used in a finite context, i.e. as an OI, as a percentage of all the fi- nite be contexts. The figures are in Table13 , with corresponding examples in (17); figures for Nina and Adam are from Becker 2000. As can be seen, with the possible exception of Adam (cf.... ..."

### Table 4-3: Finite element. Greedy triangulation. 83 control points and 27 check points.

1996

"... In PAGE 30: ... RMSE for 83 control points and 27 check points for polynomials or orders one to ten. Table4 -1 shows the RMSE for the control points. Higher order polynomials result in a lower RMSE, but not necessarily a better distortion model.... In PAGE 30: ... Higher order polynomials result in a lower RMSE, but not necessarily a better distortion model. This is not merely conjecture as shown by Table4 -2. The excursions which characterize polynomials are minimal with low order polynomials, but increase in magnitude as the polynomial order increases.... In PAGE 31: ...0 0.299 1.554 1.582 Table4 -1: Polynomial registration. 83 control points Polynomial RMSE -- Check Points Degree x y total 1 22.... In PAGE 31: ...0 10.323 68.148 68.925 Table4 -2: Polynomial registration. 27 check points.... In PAGE 32: ....3.2.1 Greedy Triangulation Table4 -3 shows the results from using the Greedy triangulation and three different grid resolutions. The most obvious result is surprising.... In PAGE 32: ... Another interesting observation is with respect to the gridding effect. It is quite evident if the grid is not dense enough as shown in Table4 -4. The transformed image will appear even less smooth than a standard piecewise linear model over triangles.... In PAGE 32: ... Table4... In PAGE 33: ....236 0.992 1.019 Table4 -5: Finite element.... In PAGE 33: ....681 1.787 5.010 Table4 -6: Finite element Delaunay triangulation. 83 control points and 27 check points.... In PAGE 33: ... An unexpected outcome from the gridding process is its potential usefulness for distortion diagnostics. The gridding effect, see Table4 -7, is highly local and given a large RMSE, indicative of the need to collect additional control points for linear piecewise warping. Table 4-8 lists the RMSEs using all of the ground control points.... In PAGE 33: ... The gridding effect, see Table 4-7, is highly local and given a large RMSE, indicative of the need to collect additional control points for linear piecewise warping. Table4 -8 lists the RMSEs using all of the ground control points. Finite Element RMSE -- Grid Points Grid x ytotal 30x30 1.... In PAGE 33: ....165 0.721 0.740 Table4... In PAGE 34: ....135 0.628 0.643 Table4 -8: Finite Element.... In PAGE 34: ...222 2.773 Table4 -9: Multiquadric method.... In PAGE 35: ...089 2.806 Table4 -10: MQ (no polynomial precision), MQ (linear precision) and TPS (linear precision by default). 83 control points and 27 check points.... ..."

Cited by 1

### Table 4-6: Finite element Delaunay triangulation. 83 control points and 27 check points.

1996

"... In PAGE 30: ... RMSE for 83 control points and 27 check points for polynomials or orders one to ten. Table4 -1 shows the RMSE for the control points. Higher order polynomials result in a lower RMSE, but not necessarily a better distortion model.... In PAGE 30: ... Higher order polynomials result in a lower RMSE, but not necessarily a better distortion model. This is not merely conjecture as shown by Table4 -2. The excursions which characterize polynomials are minimal with low order polynomials, but increase in magnitude as the polynomial order increases.... In PAGE 31: ...0 0.299 1.554 1.582 Table4 -1: Polynomial registration. 83 control points Polynomial RMSE -- Check Points Degree x y total 1 22.... In PAGE 31: ...0 10.323 68.148 68.925 Table4 -2: Polynomial registration. 27 check points.... In PAGE 32: ....3.2.1 Greedy Triangulation Table4 -3 shows the results from using the Greedy triangulation and three different grid resolutions. The most obvious result is surprising.... In PAGE 32: ... Another interesting observation is with respect to the gridding effect. It is quite evident if the grid is not dense enough as shown in Table4 -4. The transformed image will appear even less smooth than a standard piecewise linear model over triangles.... In PAGE 32: ...788 5.434 Table4 -3: Finite element.... In PAGE 32: ...139 1.177 Table4... In PAGE 33: ....236 0.992 1.019 Table4 -5: Finite element.... In PAGE 33: ... An unexpected outcome from the gridding process is its potential usefulness for distortion diagnostics. The gridding effect, see Table4 -7, is highly local and given a large RMSE, indicative of the need to collect additional control points for linear piecewise warping. Table 4-8 lists the RMSEs using all of the ground control points.... In PAGE 33: ... The gridding effect, see Table 4-7, is highly local and given a large RMSE, indicative of the need to collect additional control points for linear piecewise warping. Table4 -8 lists the RMSEs using all of the ground control points. Finite Element RMSE -- Grid Points Grid x ytotal 30x30 1.... In PAGE 33: ....165 0.721 0.740 Table4... In PAGE 34: ....135 0.628 0.643 Table4 -8: Finite Element.... In PAGE 34: ...222 2.773 Table4 -9: Multiquadric method.... In PAGE 35: ...089 2.806 Table4 -10: MQ (no polynomial precision), MQ (linear precision) and TPS (linear precision by default). 83 control points and 27 check points.... ..."

Cited by 1

### Table 4: Approximation of Blocking in a Finite System with the Corresponding Probability in the In nite System, for Poisson Arrivals.

2000

"... In PAGE 77: ...suitable blocking is in the range of 10?2 to 10?3. Table4 shows the accuracy of the approximation for various values of o ered load. Table 4: Approximation of Blocking in a Finite System with the Corresponding Probability in the In nite System, for Poisson Arrivals.... ..."

### Table 1 The solution space of the subsets for the finite S in Fig. 2 2-Digit binary number Corresponding subset

2003

"... In PAGE 4: ... By doing it this way, all possible subsets of S are transformed into an ensemble of all d-digit binary numbers. Hence, Table1 denotes the solution space of the subsets for the finite set S in Fig. 2.... In PAGE 4: ... 2. The binary number, 00, in Table1 represents the corresponding subset to be empty. The binary numbers, 01 and 10, in Table 1 represent those corresponding subsets {1} and {2}.... In PAGE 4: ... The binary numbers, 01 and 10, in Table 1 represent those corresponding subsets {1} and {2}. The binary number, 11, in Table1 represents the cor- responding subset to be {2, 1}. Though there are four 2-digit binary numbers for representing four possible subsets in Table 1, not every 2-digit binary number corresponds to a legal solution.... In PAGE 4: ... The binary number, 11, in Table 1 represents the cor- responding subset to be {2, 1}. Though there are four 2-digit binary numbers for representing four possible subsets in Table1 , not every 2-digit binary number corresponds to a legal solution. In the next subsection, basic biological operations are used to develop an al- gorithm for removing illegal subsets and determining legal solutions.... ..."

### Table 4-7: Finite Element. Delaunay triangulation. Gridding effect. 83 control points.

1996

"... In PAGE 30: ... RMSE for 83 control points and 27 check points for polynomials or orders one to ten. Table4 -1 shows the RMSE for the control points. Higher order polynomials result in a lower RMSE, but not necessarily a better distortion model.... In PAGE 30: ... Higher order polynomials result in a lower RMSE, but not necessarily a better distortion model. This is not merely conjecture as shown by Table4 -2. The excursions which characterize polynomials are minimal with low order polynomials, but increase in magnitude as the polynomial order increases.... In PAGE 31: ...0 0.299 1.554 1.582 Table4 -1: Polynomial registration. 83 control points Polynomial RMSE -- Check Points Degree x y total 1 22.... In PAGE 31: ...0 10.323 68.148 68.925 Table4 -2: Polynomial registration. 27 check points.... In PAGE 32: ....3.2.1 Greedy Triangulation Table4 -3 shows the results from using the Greedy triangulation and three different grid resolutions. The most obvious result is surprising.... In PAGE 32: ... Another interesting observation is with respect to the gridding effect. It is quite evident if the grid is not dense enough as shown in Table4 -4. The transformed image will appear even less smooth than a standard piecewise linear model over triangles.... In PAGE 32: ...788 5.434 Table4 -3: Finite element.... In PAGE 32: ...139 1.177 Table4... In PAGE 33: ....236 0.992 1.019 Table4 -5: Finite element.... In PAGE 33: ....681 1.787 5.010 Table4 -6: Finite element Delaunay triangulation. 83 control points and 27 check points.... In PAGE 33: ... An unexpected outcome from the gridding process is its potential usefulness for distortion diagnostics. The gridding effect, see Table4 -7, is highly local and given a large RMSE, indicative of the need to collect additional control points for linear piecewise warping. Table 4-8 lists the RMSEs using all of the... In PAGE 33: ... The gridding effect, see Table 4-7, is highly local and given a large RMSE, indicative of the need to collect additional control points for linear piecewise warping. Table4 -8 lists the RMSEs using all of the... In PAGE 34: ....135 0.628 0.643 Table4 -8: Finite Element.... In PAGE 34: ...222 2.773 Table4 -9: Multiquadric method.... In PAGE 35: ...089 2.806 Table4 -10: MQ (no polynomial precision), MQ (linear precision) and TPS (linear precision by default). 83 control points and 27 check points.... ..."

Cited by 1