### Table 2 Expansion of Interworking Capability Set 4

"... In PAGE 10: ... A more computational view of these interfaces is shown in Figure 3. The numbers in Figure 3 refer to the lists of information categories in the in Table2 . The categories are intended to represent conceptual domains for which a common language must be agreed.... ..."

### Table 1. Classification of change detection capabilities

2000

"... In PAGE 10: ... We claim that this classification is too imprecise to be used in policy selection. Instead, we suggest three change detection capabilities which a source may have, shown in Table1 , each affecting its ability to participate in view maintenance. ... In PAGE 21: ....4.3. Od1 - On-demand Incremental The cost of on-demand incremental maintenance is shown in appendix ( Table1 0) and each component is motivated below. Staleness cost is given by: e(vL)+d(vL)+s(vL)+i(M,vL) not-daw: r+a(M,vL)+e(vL)+d(vL)+s(vL)+i(M,vL) remote/not-daw: r+e(M)+d(M)+s(M)+a(M,vL) remote/not-daw/not-va: e(N)+d(N)+s(N)+r+a(M,vL) If the source is remote and not delta or view aware, the whole source has to be extracted and sent.... In PAGE 22: ....4.4. Im2 - Immediate Recompute The cost of immediate recompute maintenance is shown in appendix ( Table1 1) and each component is motivated below. Staleness cost is given by: r+e(M)+d(M)+s(M) remote/not-va: e(N)+d(N)+s(N)+r The staleness for Im2 is caused by the delay to recompute, extract, send and store the view.... In PAGE 23: ....4.5. P2 - Periodic Recompute The cost of periodic recompute maintenance is shown in appendix ( Table1 2) and each component is motivated below. Staleness cost is given by: 1/p+r+e(M)+d(M)+s(M) remote/not-va:1/p+e(N)+d(N)+s(N)+r Staleness is as for Im2 except for an additional worst case delay of 1/p caused by non-immediate maintenance.... In PAGE 24: ....4.6. Od2 - On-demand Recompute The cost of on-demand recompute maintenance is shown in appendix ( Table1 3) and each component is motivated below. Staleness cost is given by: r+e(M)+d(M)+s(M) remote/not-va: e(N)+d(N)+s(N)+r Whenever the view needs to be updated there is a cost to recompute the view, send it to the warehouse and store it.... ..."

Cited by 2

### Table 4 Example of arithmetic coding with incremental trans- mission, interval expansion, and small integer arithmetic. Full interval is [0;8), so in e ect subinterval endpoints are constrained to be multiples of 18.

1992

"... In PAGE 4: ... Development of binary quasi-arithmetic coding We have seen that doing arithmetic coding with large in- tegers instead of real or rational numbers hardly degrades compression performance at all. In Table4 we show the en- coding of the same le using small integers: the full interval [0;N) is only [0;8). The number of possible states (after applying the interval expansion procedure) of an arithmetic coder using the inte- ger interval [0;N) is 3N2=16.... ..."

Cited by 32

### Table 4 Example of arithmetic coding with incremental trans- mission, interval expansion, and small integer arithmetic. Full interval is [0;8), so in e ect subinterval endpoints are constrained to be multiples of 18.

1992

"... In PAGE 5: ... Development of binary quasi-arithmetic coding We have seen that doing arithmetic coding with large in- tegers instead of real or rational numbers hardly degrades compression performance at all. In Table4 we show the en- coding of the same le using small integers: the full interval [0;N) is only [0;8). The number of possible states (after applying the interval expansion procedure) of an arithmetic coder using the inte- ger interval [0;N) is 3N2=16.... ..."

Cited by 32

### Table 3 Example of arithmetic coding with incremental trans- mission, interval expansion, and integer arithmetic. Full interval is [0;1024), so in e ect subinterval endpoints are constrained to be multiples of 1 1024.

1992

Cited by 32

### Table 3 Example of arithmetic coding with incremental trans- mission, interval expansion, and integer arithmetic. Full interval is [0;1024), so in e ect subinterval endpoints are constrained to be multiples of 1 1024.

1992

Cited by 32

### Table 5. Impact of IT and Dynamic Capabilities on Firm Financial Performance

"... In PAGE 24: ... We regressed the firm-level financial measures against dependent variables such as IT usage, the dynamic capabilities of effectiveness and efficiency, and organizational and process variables. Our regression results are shown in Table5 . In a manner similar to our approach described in the previous section, the odd-numbered columns denote results where we regressed the relevant financial performance measure in year t (FPt) against the dynamic capabilities, firm control variables, and past firm performance in year t-1 represented by Fin.... In PAGE 25: ... To compare the two models, we once again compare the R2 values of the mediation and direct models. Clearly, the F-test results in Table5 show that the incremental direct impact of IT on firm performance is not statistically significant. These results confirm that the impact of IT on firm performance is mediated through effectiveness and efficiency, but through firm-level data.... ..."

### Table 6. Tableau expansion rule schemata for free variable tableau.

"... In PAGE 15: ...) Let T be a theory and let R be a background reasoner for T , a free variable tableau proof for a first-order sen- tence consists of a sequence ff: gg = T0; T1; : : :; Tn?1; Tn = ; (n 0) of tableaux such that, for 1 i n, the tableau Ti is constructed from Ti?1 1. by applying one of the free variable expansion rules from Table6 , that is, there is a branch B 2 Ti?1 and a formula 2 B (that is not a literal) such that Ti =... In PAGE 18: ... A universal formula tableau proof for a first-order sentence consists of a sequence ff: gg = T0; T1; : : :; Tn?1; Tn = ; (n 0) of tableaux such that, for 1 i n, the tableau Ti is constructed from Ti?1 1. by applying one of the free variable expansion rules from Table6 (see The- orem 38 for a formal definition); 2. by applyingthe universal formulatheory expansion rule to a branch B 2 Ti?1, that is,... In PAGE 54: ... 96), an incremental theory reasoning tableau proof for a first-order sentence consists of a sequence ff: gg = T0; T1; : : :; Tn?1; Tn = ; (n 0) of tableaux such that, for 1 i n, the tableau Ti is constructed from Ti?1 1. by applying one of the expansion rules from Table6 , i.e.... ..."

### Table 1: Comparison of the (a) combined dynamic quantitative and qualitative and (b) pure quantitative load balancing capabilities of different schemes for nine MIP problems corresponding to different number of essential nodes W and node- expansion times texp in terms of their execution time TP on P processors.

1996

Cited by 8

### Table IV: Incremental Costs

1991

Cited by 606