### Table 1. Efficiency comparison

2005

"... In PAGE 11: ...tion schemes, implemented according to their original descriptions. Table1 sum- marises the number of relevant basic operations underlying several identity-based signcryption and signature schemes, namely, GT exponentiations, scalar point multiplications, and pairing evaluations, and compares the observed processing times (in milliseconds) for a supersingular curve of embedding degree k = 6 over F397, using implementations written in C++ and run on an Athlon XP 2 GHz. Subtleties in the algorithms determine somewhat different running times even when the operation counts for those algorithms are equal.... ..."

Cited by 10

### Table 2. Summary of the Crowding Factors and Quenching Efficiencies of the Fluorophores in the Presence of TNTa

"... In PAGE 4: ... Using the diffusion coefficients of the fluorophores previously determined in this laboratory and estimating the radius of TNT to be about 1 nm, k0 was calculated, and the results are shown in Table 1. The two rate constants, kq and ko, are related by the quenching efficiency, fq: Values of the quenching efficiency are presented in Table2 where it can be ascertained that whereas [Ru- (bpy)3]2+ had the lowest value at 0.014, the value maximized at 0.... ..."

### Table 1. Experimental results for the BIST embedding and BIST methodology based on TCCs

1999

"... In PAGE 6: ... Experimental results The proposed BIST hardware insertion algorithm based on TCCs has been implemented on SUN SPARC 20 workstation using 6000 lines of C++ code. Table1 shows a comparison of experimental results in terms of test application time (TAT) and BIST area overhead obtained for the BIST embedding methodology and the proposed BIST methodology based on TCCs. The results for the BIST embedding methodology are obtained by considering nmod=nres.... In PAGE 6: ... In the case of 8DCT_11, both TAT and BIST area overhead are reduced. The number of LFSRs (represented by L in Table1 ) is reduced from 8 to 6 whilst the number of MISRs (represented by M in Table 1) is reduced from 7 to 2. In the proposed BIST methodology a single 3 input 8 bit comparator (C3) and a single 4 input 8 bit comparator (C4) are introduced.... In PAGE 6: ... In the case of 8DCT_11, both TAT and BIST area overhead are reduced. The number of LFSRs (represented by L in Table 1) is reduced from 8 to 6 whilst the number of MISRs (represented by M in Table1 ) is reduced from 7 to 2. In the proposed BIST methodology a single 3 input 8 bit comparator (C3) and a single 4 input 8 bit comparator (C4) are introduced.... In PAGE 6: ... For the last two 8 point DCT designs the proposed BIST methodology reduces the BIST area overhead by 27% and 12% respectively which clearly outlines the efficiency of the second order BIST area optimization goal. The last 6 rows of Table1 show that the proposed methodology is capable of dealing with complex DSP circuits such as 32 point DCT. Due to a very high number of registers the minimal TAT is achieved by both methodologies.... In PAGE 6: ... The reductions in BIST area overhead are significant varying from 35% up to 48%. The algorithm has low computational time as shown in the last column of Table1 . For 8 point DCT the computational time varies from 1s to 3s.... ..."

Cited by 3

### Table 2: Spreads obtained using difierent -values for original crowding distance calculations and for globally and locally based normalization of crowding distances. Crowding method = 0:2 = 1 = 5

2004

Cited by 1

### Table 1. Coder efficiency comparison between an em- bedded coder (Tarp), non-embedded coder (ML), and non- embedded coder conditioned on the quantization step-sizes (MLjQ).

2005

"... In PAGE 2: ... When cre- ating compressed images at threshold, this maneuver (non- embedding + conditioning) can save over half the rate spent on coding the side information. Table1 compares the rate required to code the quantized data with (1) an embedded bit-plane coder, (2) a non-embedded coder (similar to the coder above, which codes the significance map without any conditioning) and (3) the proposed coder. An embedded Tarp-filter based coder is chosen as a basis for a comparison with the state-of-the-art, and the coder without conditioning is used to accurately illustrate the effect of the condition- ing.... ..."

Cited by 1

### TABLE II COMPARISON OF EFFICIENT CIPHERS BASED ON GATE COUNT, CLOCK CYCLES, AND CURRENT CONSUMPTION

Cited by 1

### Table 1: OTA-based CNN model parameters.

"... In PAGE 22: ... As before, templates for connected com- ponent detection are employed. Table1 shows the values assigned to each variable and param- eter, extracted from HSPICE models of the CMOS devices and the analysis of the circuits implementing the algorithm. Level 3 models for the MOS devices have been used for HSPICE simulation.... ..."

### Table 3. Sporulation and spore viability in BR2495 strains

"... In PAGE 5: ...t al., 1993; Roeder, 1997). Deletion of DOT1 completely alleviates the zip1 meiotic arrest; the kinetics and frequency of sporulation in zip1 dot1 are similar to wild type (Table 3 and Figure 2A). However, spore viability is reduced to ;37% ( Table3 ), suggesting that some or all of the defects Figure 2. Dot1 is required for checkpoint-induced meiotic ar- rest (or delay) of zip1 and dmc1 mutants.... In PAGE 7: ...re like zip1 dot1 (i.e., no Rad51 foci coexist with the spindle; Table 4; our unpublished results), whereas ;56% nuclei still contain a few Rad51 in conjunction with a spindle (Table 4 and Figure 4, C and D). Consistent with the small number of unrepaired DSBs present in zip1 dot1 rad54 (Table 4), the triple mutant exhibits a further decrease in spore viability compared with zip1 dot1 ( Table3 ) and loss of the distinctive 4-, 2-, and 0-spore-viable pattern of spore death (Figure 4E). Thus, unlike the situation in dmc1 dot1, only a minor fraction of the DSBs accumulated by zip1 requires Rad54 for repair when meiotic arrest is relieved by a dot1 mutation.... ..."

Cited by 1

### Table 6: Performance of the GA using determinis- tic crowding with early termination on the task of finding multiple good solutions. Problem Solutions Fitness PCS Cost

"... In PAGE 7: ... Therefore, we employed the same early termina- tion criteria to halt the GA before all subpopulations were lost. Table6 presents the results of these experiments with the Deterministic Crowding algorithm. To determine the number of distinct solutions found, the final population was sorted and the best solutions which assigned at least 15% of... ..."

### Table 1: Clusters by Algorithm on http://www.cnn.com

1996

"... In PAGE 11: ...s categorized as a TECH document, i.e. it is clustered with other documents about technology. Table1 shows the clustering result obtained by run- ning the term-based, link-based, and content-link clus- tering algorithms on a collection of documents from the www.... ..."

Cited by 92