### Table 2 (continued)

1999

"... In PAGE 8: ...X Shi, A G O Yeh Table2 . An example of representation of the tabular features of a planning application case.... ..."

Cited by 1

### TABLE 15: (continued)

1999

"... In PAGE 35: ...0. TABLE15 : Contents of SLICOT: user-callable routines. Routine Function AB01MD Orthogonal controllability form for single-input system.... In PAGE 36: ... TABLE15 : (continued) Routine Function AB06MD Minimal block Hessenberg realization for a state-space rep- resentation. AB07MD Dual of a given state-space representation.... In PAGE 38: ... TABLE15 : (continued) Routine Function MC01ND Computation of the value of the real polynomial P(x) at a given complex point x = x0 using Horner apos;s algorithm. MC01OD Computation of the coe cients of a complex polynomial from its zeros.... In PAGE 39: ... TABLE15 : (continued) Routine Function SB02OD Solution of either the continuous-time algebraic Riccati equation Q+AT X+XA?XBR?1BT X = 0 or the discrete- time algebraic Riccati equation X = AT XA ? AT XB(R + BT XB)?1BT XA + Q using the method of de ating sub- spaces, where Q = CT C, R = DT D and CT D = 0. SB03MD Solution of either the continuous-time Lyapunov equation AT X + XA = C or the discrete-time Lyapunov equation AT XA ? X = C using Bartels/Stewart or Barraud apos;s meth- ods, respectively.... In PAGE 40: ... TABLE15 : (continued) Routine Function TB01ND Upper/lower observer Hessenberg form. TB01QD Transfer matrix of a state-space representation.... ..."

Cited by 53

### TABLE 15: (continued)

1999

"... In PAGE 35: ...0. TABLE15 : Contents of SLICOT: user-callable routines. Routine Function AB01MD Orthogonal controllability form for single-input system.... In PAGE 36: ... TABLE15 : (continued) Routine Function AB06MD Minimal block Hessenberg realization for a state-space rep- resentation. AB07MD Dual of a given state-space representation.... In PAGE 37: ... TABLE15 : (continued) Routine Function MB03MD Computation of an upper bound using a bisection method such that a bidiagonal matrix has precisely ` singular values greater than or equal to plus a given tolerance. MB03ND Computation of the number of singular values of a bidiago- nal matrix which are smaller than or equal to a given value .... In PAGE 39: ... TABLE15 : (continued) Routine Function SB02OD Solution of either the continuous-time algebraic Riccati equation Q+AT X+XA?XBR?1BT X = 0 or the discrete- time algebraic Riccati equation X = AT XA ? AT XB(R + BT XB)?1BT XA + Q using the method of de ating sub- spaces, where Q = CT C, R = DT D and CT D = 0. SB03MD Solution of either the continuous-time Lyapunov equation AT X + XA = C or the discrete-time Lyapunov equation AT XA ? X = C using Bartels/Stewart or Barraud apos;s meth- ods, respectively.... In PAGE 40: ... TABLE15 : (continued) Routine Function TB01ND Upper/lower observer Hessenberg form. TB01QD Transfer matrix of a state-space representation.... ..."

Cited by 53

### Table 1: Qualitative comparison of 3-D digital curve representation schemes.

1998

"... In PAGE 8: ...he projection property is that QRijl = RijQl, i.e., the projection of a 3-D chain onto a plane perpendicular to any one of the coordinate system axes should be identical to the 2-D digital representation of the projection of the continuous curve onto that plane. Table1 compares Grid Intersect Quantization (GIQ), Thinned Cube Quantization (TCQ)... ..."

Cited by 7

### TABLE 15: (continued)

1999

"... In PAGE 35: ...0. TABLE15 : Contents of SLICOT: user-callable routines. Routine Function AB01MD Orthogonal controllability form for single-input system.... In PAGE 36: ... TABLE15 : (continued) Routine Function AB06MD Minimal block Hessenberg realization for a state-space rep- resentation. AB07MD Dual of a given state-space representation.... In PAGE 37: ... TABLE15 : (continued) Routine Function MB03MD Computation of an upper bound using a bisection method such that a bidiagonal matrix has precisely ` singular values greater than or equal to plus a given tolerance. MB03ND Computation of the number of singular values of a bidiago- nal matrix which are smaller than or equal to a given value .... In PAGE 38: ... TABLE15 : (continued) Routine Function MC01ND Computation of the value of the real polynomial P(x) at a given complex point x = x0 using Horner apos;s algorithm. MC01OD Computation of the coe cients of a complex polynomial from its zeros.... In PAGE 40: ... TABLE15 : (continued) Routine Function TB01ND Upper/lower observer Hessenberg form. TB01QD Transfer matrix of a state-space representation.... ..."

Cited by 53

### TABLE 1 Latent Semantic Analysis Matrix for Topmost Care Exemplar Self-Descriptors Self or Other Representations

"... In PAGE 11: ... TABLE1 (continued) Self or Other Representations Self-Descriptor Actual Self Temporal Self Ideal Self Despised Self Social Self Expected Self Mother Father Friend Admired Adult 15.Trytobe something better .... ..."

### Table 22. Continued

in by

2003

"... In PAGE 93: ...ublic java.lang.String toString() Returns the string representation of the part list. Table22 . Attributes and methods contained in packingDataStruct.... ..."

### TABLE 15: (continued)

1999

"... In PAGE 35: ...0. TABLE15 : Contents of SLICOT: user-callable routines. Routine Function AB01MD Orthogonal controllability form for single-input system.... In PAGE 36: ... TABLE15 : (continued) Routine Function AB06MD Minimal block Hessenberg realization for a state-space rep- resentation. AB07MD Dual of a given state-space representation.... In PAGE 37: ... TABLE15 : (continued) Routine Function MB03MD Computation of an upper bound using a bisection method such that a bidiagonal matrix has precisely ` singular values greater than or equal to plus a given tolerance. MB03ND Computation of the number of singular values of a bidiago- nal matrix which are smaller than or equal to a given value .... In PAGE 38: ... TABLE15 : (continued) Routine Function MC01ND Computation of the value of the real polynomial P(x) at a given complex point x = x0 using Horner apos;s algorithm. MC01OD Computation of the coe cients of a complex polynomial from its zeros.... In PAGE 39: ... TABLE15 : (continued) Routine Function SB02OD Solution of either the continuous-time algebraic Riccati equation Q+AT X+XA?XBR?1BT X = 0 or the discrete- time algebraic Riccati equation X = AT XA ? AT XB(R + BT XB)?1BT XA + Q using the method of de ating sub- spaces, where Q = CT C, R = DT D and CT D = 0. SB03MD Solution of either the continuous-time Lyapunov equation AT X + XA = C or the discrete-time Lyapunov equation AT XA ? X = C using Bartels/Stewart or Barraud apos;s meth- ods, respectively.... ..."

Cited by 53

### Table 1 continued

2002

"... In PAGE 10: ... This analysis begins with each statement as its own cluster and tracks the merging of the statements into clusters up to a 20-cluster solution. The out- put from this analysis generates two decision tools3 : (a) a list of the statements in the 20-cluster solution with their bridging values,4 presented in Table1 ; and (b) the merg- ing of clusters for each cluster solution (a list version of a dendogram), presented in Table 2. The two decision tools together provide a statistical basis to guide human judgment about the goodness of fit for the final cluster solution.... In PAGE 12: ...ORGANIZATIONAL RESEARCH METHODS Table1 continued Cluster Statement Statement Number (With Statement Number) Bridging Value (50) We want to have a channel ofopen communication. .... In PAGE 14: ... Original respondents or proxies were not used primarily because of resource con- straints and because the purpose of the analysis was merely to create a heuristic-like representation of how the class described the norms of their team. The final cluster 320 ORGANIZATIONAL RESEARCH METHODS Table1 continued Cluster Statement Statement Number (With Statement Number) Bridging Value (134) Humor is a key. .... ..."

Cited by 1

### TABLE 15: (continued)

1999

"... In PAGE 35: ...0. TABLE15 : Contents of SLICOT: user-callable routines. Routine Function AB01MD Orthogonal controllability form for single-input system.... In PAGE 37: ... TABLE15 : (continued) Routine Function MB03MD Computation of an upper bound using a bisection method such that a bidiagonal matrix has precisely ` singular values greater than or equal to plus a given tolerance. MB03ND Computation of the number of singular values of a bidiago- nal matrix which are smaller than or equal to a given value .... In PAGE 38: ... TABLE15 : (continued) Routine Function MC01ND Computation of the value of the real polynomial P(x) at a given complex point x = x0 using Horner apos;s algorithm. MC01OD Computation of the coe cients of a complex polynomial from its zeros.... In PAGE 39: ... TABLE15 : (continued) Routine Function SB02OD Solution of either the continuous-time algebraic Riccati equation Q+AT X+XA?XBR?1BT X = 0 or the discrete- time algebraic Riccati equation X = AT XA ? AT XB(R + BT XB)?1BT XA + Q using the method of de ating sub- spaces, where Q = CT C, R = DT D and CT D = 0. SB03MD Solution of either the continuous-time Lyapunov equation AT X + XA = C or the discrete-time Lyapunov equation AT XA ? X = C using Bartels/Stewart or Barraud apos;s meth- ods, respectively.... In PAGE 40: ... TABLE15 : (continued) Routine Function TB01ND Upper/lower observer Hessenberg form. TB01QD Transfer matrix of a state-space representation.... ..."

Cited by 53