### Table 1. A compositional table for C4

"... In PAGE 9: ... In this group there are eight rotations: e, R90, R902, R903, H, V, R90H, R90V. Under Table1 we investigated the group of symmetries of a Ruby cell. We look for cyclic subgroups of the group C4.... ..."

### Table 1. The counterexample for r = 0, 2d(1 + 2r) = 2d, and symmetric fault.

2006

"... In PAGE 7: ... The Counterexamples In the counterexamples presented here we show that the BSS-Pulse-Synch protocol [Daliot 03] does not converge. Table1 is an execution trace of a system with parameters n = 4, f = 1, Cycle = C, with no clock drift, r = 0, i.e.... In PAGE 7: ... A row of the table depicts activities of all good nodes, in their corresponding columns, for that time tick. As is shown in Table1 the system starts from a random state where the nodes are 4d apart and reaches the same state within 5 ticks. This process repeats indefinitely.... ..."

### Table 1. Selecting the contraction kernel for hS; Ni.

"... In PAGE 6: ... 3.2 Selecting the Contraction Kernels The rules in Table1 (a) di er slightly from those in [15] in that we now allow *-cells to merge with 0-cells and 2-cells since the geometrical position of the junction is inherited from the base graph. Due to this change faces in the dual graph surrounded by either one (i.... In PAGE 7: ...Table1 (a) are selected in the order presented below: 1. A 1-cell can merge with an adjacent 2-cell (R12) or 0-cell (R10).... In PAGE 7: ... Selecting the contraction kernel for hS; Ni. We apply these rules recursively, as shown in Table1 (b), to dually contract the graphs until no further contraction is possible. The resulting graph has the following properties: there are no 0-cells and no 2-cells present, the number of 1-cells is the same as in the base graph.... ..."

### Table 1 #0C r

"... In PAGE 47: ...Quantitative Results Assuming that #0B = 0 #28logarithmic utility#29 and #0E =0:99, Table1 shows how the average return on equity#28r... In PAGE 47: ...93#25 0.1251#25 Table1 shows that changes in #0C have only a very small e#0Bect on the equity premium: in particular, the equity premium is a slightly decreasing function of #0C. In other words, decreasing #28increasing#29 #0C relative to the time-consistent case #28#0C = 1#29 tends to increase #28decrease#29 the equity premium slightly.... In PAGE 47: ... These results continue to hold for a varietyof values of #0B and #0E. Table1 also documents the well-known equity premium puzzle: when #0C = 1, the model apos;s equity premium is substantially smaller than the historical equity premium of 6.2#25 per year #28as calculated in Mehra and Prescott #281985#29 using annual data for the time period 1889#7B 1978#29.... ..."

### TABLE I11 SYSTEM RELIABILITIES: R, IS THE RELIABILITY OF A DR-BASED NONPARTITIONABLE SYSTEM OF SIZE N + 1. R, IS THE RELIABILITY OF A DR-BASED OR RDR-BASED PARTITIONABLE SYSTEM OF SIZE N + Q

### Table 1: Inference rules for the core of FO IN ?; ? ?! B ?L ? ?! gt; gt;R

1997

"... In PAGE 4: ... We will use sequents of the form ? ?! B, where ? is a nite multiset of formulas and B is a single formula. The basic inference rules for the logic are shown in Table1 . In the 8R and 9L rules, y is an eigenvariable that is not free in the lower sequent of the rule.... ..."

Cited by 42

### Table 1: Values of (r1,n1 2 ) for the communication of messages between two nodes of the same cluster on the SUPRENUM and neighbouring nodes on the Intel iPSC/860 computers. Speci cation Range

1991

"... In PAGE 4: ... The basic per- formance of the Intel iPSC/860 has also been measured and evaluated by Berrendorf and Helin [3]. Table1 gives the values obtained for the communication parameters, in the version of the benchmark using the native SUPRENUM extensions to the Fortran90 language. These include a SEND and RECEIVE language statement with a syntax similar to that of the Fortran READ and WRITE statement.... In PAGE 25: ...Table1 0: Timings and performance measurements for the conjugate gradient bench- mark (QCD2) distributed in one dimension on the SUPRENUM Total problem Processor Problem size Predicted Actual Performance size Con guration per processor Time (s) Time (s) (M op/s) 2 43 12 2 26 0.058 0.... ..."

Cited by 17

### Table 1: A sequent system L for PL

"... In PAGE 4: ...Table 1: A sequent system L for PL . With one exception, the rules in Table1 are the natural generalisations of the rules sug- gested by Girard for the commutative intuitionistic linear logic, cf. [19] and [20, 21], to the non-commutative case, cf [14, 15].... ..."

### Table 1. Selecting the contraction kernel for hS; Ni.

1999

"... In PAGE 9: ... Random selection, as in adaptive pyramids [3], applies whenever the given rules do not determine the contraction kernels completely. The rules ( Table1 (a)) are selected in the order presented below:... In PAGE 10: .... A 0-cell can merge with any adjacent 0-cell and remains a 0-cell (R00). 3.3 Properties Preserved The rules are applied recursively, as shown in Table1 , to dually contract the graphs until no further contraction is possible. The resulting graph has the fol- lowing properties: there are no 0-cells and no 2-cells present, the number of 1-cells and the number of *-cells is the same as in the base graph.... ..."

Cited by 10

### Table 1. Selecting the contraction kernel for hS; Ni.

1999

"... In PAGE 9: ... Random selection, as in adaptive pyramids [3], applies whenever the given rules do not determine the contraction kernels completely. The rules ( Table1 (a)) are selected in the order presented below:... In PAGE 10: .... A 0-cell can merge with any adjacent 0-cell and remains a 0-cell (R00). 3.3 Properties Preserved The rules are applied recursively, as shown in Table1 , to dually contract the graphs until no further contraction is possible. The resulting graph has the fol- lowing properties: there are no 0-cells and no 2-cells present, the number of 1-cells and the number of *-cells is the same as in the base graph.... ..."

Cited by 10