### Table 3: Data Parameters ories). For the above selected parameter values every segment of the multiprogrammed main memory is equal to 200 pages (main memory=mpl). 4.3 RAD{UNIFY Model

1993

"... In PAGE 11: ... Therefore, the deadlock overhead is proportional to the number of active jobs. The database parameters (applicable to all three models) are described by the set of parameters shown in Table3 . Each relation of the database consists of the following information: a unique name (rel name), the number of its tuples (card), and the size of each of those tuples (rel size).... ..."

Cited by 21

### Table 1. Summary of the assessment of three theories as candidates for a unified theory of software engineering. * denotes low and *** high quality satisfaction.

### Table 2: Local Distribution as Function of Influence Counts

2004

"... In PAGE 14: ...5 below that specifies a probability distribution over interpretations of theories in first-order logic. Table2 shows an example of a local distribution for the engine status MFrag. The conditioning constraints imply there can be at most one RomTemp parent that satisfies the context constraint MachineLocation(m) = r.... ..."

Cited by 8

### Table 3. Negation/Complement Example using the Unified Fusion Theories rule regarding a mixed redistribution of partial conflicting masses (Part 1).

"... In PAGE 11: ...r 0.14 0.07 0.07 0.04 0.035, 0.035 mUFT 0 0 0 0 0 0 mlower (closed world) mlower (open world) mmiddle (default) mupper Table3 . Negation/Complement Example using the Unified Fusion Theories rule regarding a mixed redistribution of partial conflicting masses (Part 2).... In PAGE 11: ...14 0.11 mupper Table3 . Negation/Complement Example using the Unified Fusion Theories rule regarding a mixed redistribution of partial conflicting masses (Part 3).... ..."

Cited by 1

### Table 3-2: Average Percent Conflicts in a Unified Cache

"... In PAGE 7: ...ith the currently used LRE. Phase four analyzes the performance of our new algorithm. Besides the parameters we have already discussed, we also varied the main cache size, the main cache block size, and the victim cache size. Table3 -1 illustrates all the variables and their ranges. Every possible combination of the parameters was run on each of the eighteen trace files.... In PAGE 10: ... We also note that the data conflicts in graph 3-2 are more sensitive to changes than the instruction conflicts. Table3 -1 shows the averages for all program and all cache sizes. As can be seen from the table, a significant number (25% to 28%) of cache misses in a direct mapped cache are due to conflicts.... In PAGE 10: ...0% 2-Way Set Associative, Data Conflicts 13.1% Table3 -1: Average Percent Conflicts in a Separate Data and Instruction Cache A similar analysis of a unified main cache shows that it exhibits similar, but slightly higher trends, resulting in more cache misses due to conflicts as shown in graphs 3-3 and 3-4 and summarized in table 3-2. Graph 3-3: Cache Misses Due to Conflicts (Unified Cache) by Program.... ..."

### Table 6: Unified TLB

1999

"... In PAGE 10: ...55 MB), yet go has a higher mpi, as illustrated in Figure 6. Table6 displays the reference stream in greater detail. The first column contains the percentage of all code references that are to the kernel space.... In PAGE 28: ....38E-04 1.60E-04 3.31E-04 1.18E-03 2.87E-05 5.56E-05 3.48E-04 3.77E-05 7.29E-04 1.15E-03 1.15E-03 3.08E-04 1.19E-03 Table6... ..."

Cited by 2

### Table 1. Runtimes and sizes of complete sets of unifiers: size denotes the size of the returned complete set of unifiers; vi opt stands for variable identification optimization ; x, y, z, u, xi are variables and a, b, c, d, e are constants. Runtime tests obtained on a 1.5 GHz Intel Pentium M processor.

2006

"... In PAGE 4: ... Hence, Estd can easily be replaced by other theories. 4 Experimental Results Table1 summarizes some of our experimental results (see [13] for more). It contains runtimes and sizes of complete sets of unifiers both with the optimization for variable identification turned on and off.... In PAGE 4: ... (However, we have no proof that this is always the case.) Problem 1 in Table1 is a unification problem that occurs in the analysis of the recursive authentication protocol [12]. Interestingly, while our algorithm quickly returns an mgu, the version of the algorithm with the optimization for variable optimization turned off does not come back with a solution within 30 minutes.... ..."

### Table 1. Runtimes and sizes of complete sets of unifiers: size denotes the size of the returned complete set of unifiers; vi opt stands for variable identification optimiza- tion ; x, y, z, u, xi are variables and a, b, c, d, e are constants. Runtime tests obtained on a 1.5 GHz Intel Pentium M processor.

2006

"... In PAGE 4: ... Hence, Estd can easily be replaced by other theories. 4 Experimental Results Table1 summarizes some of our experimental results (see [13] for more). It con- tains runtimes and sizes of complete sets of unifiers both with the optimization for variable identification turned on and off.... In PAGE 4: ... (However, we have no proof that this is always the case.) Problem 1 in Table1 occurs in the analysis of the recursive authentication protocol [12]. Interestingly, while our algorithm quickly returns an mgu, the ver- sion of the algorithm with the optimization for variable optimization turned off does not come back with a solution within 30 minutes.... ..."

### Table 1: Tumor Counts across Treatment Groups: Subscript indicates the order in which the mice entered the study. NA means not available. Group Tumor Count

"... In PAGE 6: ... That the analysis should re ect the design is a cornerstone of Fisher apos;s theory of signi cance testing (Fisher, 1971, page 41). As an example, Table1 records tumour counts resulting from the aforementioned chemoprevention trial. The null hypothesis of no treatment e ect can be tested exactly, conditional on the observed counts, using the randomization distribution of the one-way F ?statistic.... ..."

### Table 1: Tumor Counts across Treatment Groups: Subscript indicates the order in which the mice entered the study. NA means not available. Group Tumor Count

"... In PAGE 6: ... That the analysis should re ect the design is a cornerstone of Fisher apos;s theory of signi cance testing (Fisher, 1971, page 41). As an example, Table1 records tumour counts resulting from the aforementioned chemoprevention trial. The null hypothesis of no treatment e ect can be tested exactly, conditional on the observed counts, using the randomization distribution of the one-way F ?statistic.... ..."