### Table 1. Properties of certain NLFSRs

"... In PAGE 2: ... By a nontrivial output sequence of a type A, B, C, or D shift register we mean any sequence produced by the shift register when any vector appearing in the corresponding long cycle is used to initialize the register. intersectionsq unionsq Table1 contains some properties of N-stage NLFSRs of types A, B, C, and D. Notice that the NLFSRs of type C are the only ones that induce a cycle decomposition in FN 2 consisting of an odd number of cycles.... In PAGE 13: ... We have carried out extensive computer calculations to satisfy our curiosity. It turned out that the maximum possible value for the linear complexity for each shift register type, as displayed in Table1 , is also the typical value for the linear complexity. In analogy to the quoted lower bound for the linear complexity of de Bruijn sequences one is inclined to anticipate a similar lower bound for the linear complexity of the NLFSR sequences treated in this paper.... ..."

### Table 1: Times consumed for executing certain operations

2005

"... In PAGE 3: ... As shown in both figures, expected results are observed on the image queries. The process times for certain operations on the mobile CBIR application are listed in Table1 . The numbers in the table reveals that Jpeg decoding is the most time consuming process affecting the whole performance.... ..."

Cited by 1

### Table 3: Degree of annihilators for certain linear codes

in and

"... In PAGE 11: ... Computer simulations suggest that the best choice is to take d = 1 and then to select the minimum value of r such that (20) is satis ed. The minimum annihilator degree d + r (with d = 1) is given in Table3 for certain input values.... In PAGE 11: ...Table 3: Degree of annihilators for certain linear codes The values in Table3 indicates that increasing the number of outputs substantially de- crease the security of this class of stream ciphers. For the sake of implementation it would be convenient to work on a byte or a word level thus the number of output bits m should be equal to 8b for some small positive integer b.... ..."

### Table 2: Isotopy classes with certain group sizes

2005

"... In PAGE 4: ... By means of the algorithms described in [11], we computed representatives L of all the isotopy classes of Latin squares of order 11 for which the order of the autotopism group Is(L) is divisible by 5, 7, or 11. The numbers of such isotopy classes are listed in Table2 . Since the number of reduced squares in the isotopy class of L is nn!/|Is(L)|, these counts imply that R11 equals 8515 modulo 21175, in agreement with our computations.... ..."

Cited by 2

### Table 7. Properties of Certain Intermediate Languages Summarised

"... In PAGE 7: ... In the sequel, a number of properties of these languages will be pointed out and followed by a discussion on their prevalence among the quintet under consideration. A summary of these results is collected in Table7 . However, certain properties shared/lacked by all formats are not mentioned for space reasons but subsequently discussed in Section 3.... In PAGE 9: ... The remaining two formats are easy to extend by new syntax due to flexibility of their grammars. Interestingly, none of the formats under consideration has all of properties sum- marised in Table7 . The BCSAT format appears to be closest to having them all.... In PAGE 12: ...23 The five items above cover most of the aspects raised in the analysis carried out in Section 3. However, one aspect of the format remains open in view of Table7 , i.e.... ..."

### Table 3. The number of times that an alternative was found at a certain place in the ranking

in A Multiobjective Evolutionary Algorithm for Deriving Final Ranking from a Fuzzy Outranking Relation

"... In PAGE 12: ... Finally, we obtaining a succession in decreasing order of preference, generating of this manner, a recommendation for the decision maker. Table3 suggests the following final ranking 6 1 5 8 9 3 0 7 2 4 A A A A A A A A A A f f f f f f f f f (10) where B A f means that alternative A is preferred to alternative B . The Genetic algorithm of [19] obtains the following results: The number of times that an alternative was found at a certain place in the ranking is given in table 4 with respect to 100 variations in the seed parameter.... ..."

### Table 1. In Table 1 and all of the following tables, h = 2?J and the columns labelled \CG quot; and \PCG quot; list respectively the numbers of iterations needed for the conjugate gradient and preconditioned conjugate gradient methods to obtain the displayed error. For problem (5:2), the preconditioner SSt is exactly A?1. Thus we get exact solutions with one iteration. In the second example, we made up a problem with transcendental coe cients: (5:3)

1992

Cited by 28

### Table 1. In Table 1 and all of the following tables, h = 2?J and the columns labelled \CG quot; and \PCG quot; list respectively the numbers of iterations needed for the conjugate gradient and preconditioned conjugate gradient methods to obtain the displayed error. For problem (5:2), the preconditioner SSt is exactly A?1. Thus we get exact solutions with one iteration. In the second example, we made up a problem with transcendental coe cients: (5:3)

1992

Cited by 28

### Table 1: Asymptotic worst case bounds for certain bin packing algorithms

1996

"... In PAGE 7: ... However, a number of simple approximation algorithms have been proven to provide asymptotic worst case bounds that are within a constant factor of the optimal solution. A few of these are listed in Table1 [14].... ..."

Cited by 1