### Table 3. Parameter values for training the RNNs on kddcup network intrusion data.

2002

"... In PAGE 7: ... Summary counts of the five KDD Cup data subsets used to train each of the RNNs. Training of the RNN The training parameters used to train the five RNNs are listed in Table3 . The choices in the training parameters were made empirically to guarantee the convergence of the mean reconstruction error to a lowest possible... ..."

Cited by 16

### Table 2: Test matrices for the singular value decomposition

1997

"... In PAGE 25: ...14 Tests for the ScaLAPACK SVD routines The following tests will be performed on PDGESVD. A number of matrix #5Ctypes quot; are speci#0Ced, as denoted in Table2 . For each type of matrix, and for the minimal workspace as well as for larger than minimal workspace an M-byN matrix #5CA quot; with known singular... In PAGE 26: ....14.1 Test Matrices for the Singular Value Decomposition Routines Six di#0Berenttypes of test matrices may be generated for the singular value decomposition routines. Table2 shows the types available, along with the numbers used to refer to the matrix types. Except as noted, all matrix types other than the random bidiagonal matrices have O#281#29 entries.... ..."

### (Table 2) by a singular value decomposition. For the comparison of the singular

### Table 6.1 Comparison of centroid decomposition and singular value decomposition.

2002

Cited by 10

### Table 1. Singular Value Decomposition of global design matrix as given by their singular eigenvalues.

165

### Table 5.2 Example 5.2: Approximate solutions xj determined by truncated singular value and generalized singular value decompositions.

### Table 2. Time breakdown for the computation of 500 singular values and singular vectors.

"... In PAGE 6: ... A similar strategy is used for V, which is also full. Table2 shows the number of steps, the total wall-clock time (in seconds) and the time breakdown (in %) for the computation of 500 singular values and singular vectors of model 1 using Algorithm 1, for five values of p. We used 32 processors and required .... ..."

### Table 2. Time breakdown for the computation of 500 singular values and singular vectors.

"... In PAGE 6: ... A similar strategy is used for V, which is also full. Table2 shows the number of steps, the total wall-clock time (in seconds) and the time breakdown (in %) for the computation of 500 singular values and singular vectors of model 1 using Algorithm 1, for five values of p. We used 32 processors and required .... ..."

### Table 1*: Singular bers of type I*{IV*

"... In PAGE 8: ... For example I2 = and I5 = . These graphs are reproduced in the rst column of Table1 below; note that all components have multiplicity one in these types of bers. The second column in the table gives natural framed link descriptions for regular neighborhoods of these bers, following [7].... In PAGE 9: ... (In section 3 we will give explicit models for these neighborhoods in which the projection of the elliptic surface is evident.) type graph framed link monodromy I1 0 V In (n 2) ?2 ?2 ?2 V n II 0 UV III ?2 ?2 UV U IV ?2 ?2 ?2 (UV )2 Table1 : Singular bers of type I{IV The nal column in the table gives the monodromy of the torus bundle around each singular ber with respect to a suitably chosen basis for the rst homology of a regular ber,y given in terms of the generators U = 1 0 ?1 1 and V = 1 1 0 1 yMore precisely, if we pick a base point b0 in B and a basis for the rst homology of the ber over b0, choose paths connecting b0 to each critical value pi of , and choose small loops i around each pi, then we get a well de ned 2 2{matrix for each singular ber, representing the monodromy of the torus bundle over the associated i. 241 The E_8-manifold, singular fibers and handlebody decompositions Geometry and Topology Monographs, Volume 2 (1999)... In PAGE 10: ...1 Now it is well known that any simple singular ber in an elliptic surface breaks up into nitely many shtails under a generic perturbation of the projection near the ber. To show this explicitly for the bers of type I{IV (the argument for the other types will be given later) observe that the factorization of the monodromy given in Table1 suggests a pattern of vanishing cycles. For the necklace ber In with monodromy V n one expects n longitudes.... In PAGE 13: ... Regular neighborhoods of these bers are the associated plumbings of the cotan- gent disk bundle of S2 (see section 3 for explicit models which explain why these plumbings appear) and can all (with the exception of I 0) be represented by grapes as in section 1, in fact in a variety of ways. We choose one, and record it in Table1 * along with the associated weighted tree and monodromy.... In PAGE 14: ... For singular bers of type I* (Figure 2.6a,b) a single slip of grape A over grape B does the job, recovering the handlebodies given in Table1 *. For types II*{IV*, the sequence of slips shown in Figure 2.... ..."

### Table 2 Primitive gate model-

2005

"... In PAGE 7: ... Logic 0, 1 and X values are encoded in 2 bits as in Table 1 to enable emulation of unknown values: 01 for logic 0, 10 for logic 1, and 11 for X. In accordance with this encoding, the basic logic gates are remodeled as described in Table2 . For example, an AND gate in the original circuit is represented with one AND gate and one OR gate.... ..."