### Table 6 . The Effect of Good and Consistent Processes on Financial Performance

1998

"... In PAGE 32: ... Using these dummy variables instead of the continuous measures, the question of which matter more (in terms of financial performance) continuous processes or good processes could be addressed. By comparing the coefficients on good and consistent processes in Table6 , it was found that the coefficient on consistent is significantly greater than the coefficient on good . This analysis reinforced the analytical model presented in Frei et al (1997) by showing that when analyzing the relation between the process measures and firm performance, there tends to be a stronger financial return for banks with consistent processes than for banks with good processes.... ..."

### Table 4. First hash function

"... In PAGE 7: ... Indeed, for the second relation in Table 5, feature 5 is stored on both node 1 and node 2. Also for the second relation in Table4 , feature 4 is stored on both nodes. With the first hashing function, if the answers of the spatial join request are concentrated geographically on one part of the universe, then these answers will be computed by fewer compute nodes, leading to data distribution skew.... ..."

### TABLE 2. HASH FUNCTIONS FOR INTEGRITY

### TABLE II FUNCTIONS OF THE CLASS hash.

2005

### Table 5. Second hash function

"... In PAGE 7: ... It can be observed from the two tables that there is no replication for the first relation, but there is replication for the second relation. Indeed, for the second relation in Table5 , feature 5 is stored on both node 1 and node 2. Also for the second relation in Table 4, feature 4 is stored on both nodes.... ..."

### Table 1. Hash Functions Used for Integrity

"... In PAGE 4: ... This can be accomplished by using a variety of hash functions [5]. Nine commonly used hash functions and their performance (evaluated on a 90 MHz Pentium machine) are shown in Table1 . Based on their performance, each hash function is assigned a corresponding security level in the range from 0.... ..."

### Table 6.1: Two Practical One-Way Hash Functions Hashing Hashing

### Table 2. The collision profile of hash functions. Packing

"... In PAGE 3: ... After training the network, NH25 has 460 hidden nodes and NH50 has 430 hidden nodes. Table2 shows the collision profile of each hash function: the figures under the hash function column correspond to the number of hash table slots to which a certain number of records, in the first column in the same row, are hashed. As can be seen in Table 2, the Mid-square performed the worst among the hash functions; NH25 has a similar result to that of the Division; and NH50 performed the best: it has the least number of unassigned slots and most slots with only one hash value assigned.... In PAGE 3: ... Table 2 shows the collision profile of each hash function: the figures under the hash function column correspond to the number of hash table slots to which a certain number of records, in the first column in the same row, are hashed. As can be seen in Table2 , the Mid-square performed the worst among the hash functions; NH25 has a similar result to that of the Division; and NH50 performed the best: it has the least number of unassigned slots and most slots with only one hash value assigned. Another criterion for judging the performance of a hash function is degradation of the collision rate as the packing density increases.... ..."

### Table 1. Comparison of the Multiset Hash Functions

2003

"... In PAGE 11: ...Conclusion We have introduced incremental multiset hash functions which can be efficiently updated, and for which the ordering of inputs is not important. Table1 sum- marizes our comparison of the multiset hash functions introduced in this paper. In the table, we indicate whether the security is based on pseudorandom family of hash functions (PRF), the random oracle model (RO), the discrete log as- sumption (DL), or/and the hardness of the worst case shortest vector problem (SV).... ..."

Cited by 18