### Table 1: The transfer function for the and C function for strings of one bit. The empty slots indicate cases which can never arise.

2000

"... In PAGE 5: ... To compute on longer strings we apply it bitwise. Table1 gives the definition for individual bits. To apply the and function to arbitrary strings in L, the shorter string is sign- extended to the length of the longer one before we apply the operation bitwise.... ..."

Cited by 43

### Table 4. Maximum number of allowed speech connectionsand average number of unused VI- slots as a function of N_D. N_D

1991

### Table 1: An illustrative list of HTML parsing functions. HTML tag Function Comments

"... In PAGE 2: ... Hence parsing functions have been drafted to accommodate single-slot as well as multi-slot/pattern functions. A subset of the single-slot functions is listed in Table1 . Multi-slot functions would be prefixed by pat_.... ..."

### Table 1: An illustrative list of HTML parsing functions. HTML tag Function Comments

"... In PAGE 2: ... Hence parsing functions have been drafted to accommodate single-slot as well as multi-slot/pattern functions. A subset of the single-slot functions is listed in Table1 . Multi-slot functions would be prefixed by pat_.... ..."

### Table 5: The Take Out Method The unfold tactic rewrites recursively de ned functions using their step equations. Unfolding is illustrated in gures 1 and 3. The speci cation of the unfold tactic is given in table 6. The preconditions slot speci es that the input must be an expression containing a primitive recursive function whose recursive argument has s as its dominant function. The e ects slot asserts that the output will be an expression obtained by rewriting the input expression using the step equation of the recursive function. The tactic slot gives the de nition of a program, unfold, which takes a position and a formula and returns that formula with the term at that position rewritten using the step equation. Name unfold([NjPosn]) Declarations 8Exp1 2 exprs; 8Exp2 2 exprs; 8N 2 nums; 8Posn 2 posns: Input

1988

Cited by 258

### Table 3.1: The above table shows which issue slot can access which functional unit and the latency and recovery time of each functional unit.

1997

Cited by 4

### Table 2: Templates within the repository. Template Slots Input of

2003

"... In PAGE 6: ... The mapping between conceptual and operational descriptions (normally an issue within the AF) is therefore trivial: it is not only one-to-one and structure preserving, it is pre-defined. The templates used in this scenario are summarised in Table2 . The names of the slots are stating the required functionality of the building blocks to be inserted.... ..."

Cited by 11

### Table 2: Fragment of command knowledge obligatory slots

"... In PAGE 4: ...f (sentence-concept is of the form sequence(c1, c2, ...)) operation-part := operation-part [ Normalize(c1) [ Normalize(c2) [ : : : else if (sentence-concept is of the form condition(c1, c2) or elaboration(c1, c2)) condition-part := condition-part [ Normalize(c1) operation-part := operation-part [ Normalize(c2) else /* simple sentence */ operation-part := operation-part [ Normalize(sentence-concept) return hcondition-part, operation-part, loop-range, loop-elementi end function Normalize(concept) while (true) f c := Check-Executability(concept) if (c != null) return c concept := get-next-paraphrase(concept); if (concept = null) return null; g end function Check-Executability(concept) if (concept is a concrete value or a known object) return concept if (no information for concept is found in command knowledge) return null for each obligatory slot of concept f if (slot has no value) return null v = Normalize(slot-value) if (v != null) slot := v else if (slot can have multiple values and a default-loop-range exists) if (slot-value has a slot2 with slot-value2) w = Normalize(equal(slot-value2, slot2(qualified(slot-value)))) if (w != null) condition-part := condition-part [ w else return null loop-range := default-loop-range, loop-element := slot-value else return null g return concept end Figure 5: Text normalization algorithm tween operations. Table2 shows a fragment of command knowledge. Table 2: Fragment of command knowledge obligatory slots... ..."

### Table 1: Minimum Slot Time Computation

1993

"... In PAGE 7: ....a. 10 #16s slot time must be longer than the sum of the round trip propagation time, the collision detection time, and the jam time. For a 2BASE5 network, these times are given in Table1 . Table 2 de#0Cnes the MAC sublayer packet format and Table 3 de#0Cnes the protocol parameters used in the simulations.... In PAGE 42: ...Table1 0: ActivityParameters for TransientFault Model Activity Rate Probability case 1 case n Tf arrival exp#28#15#29 - - Tf id a determ#28#0F#29 1 n 1 n RR a determ#28#20#29 1 n,1 1 n,1 Left a determ#28DIST#29 - - Right a determ#28DIST#29 - - Tf jam n determ#28 apos;#29 - - Tf duration n determ#2810 ms#29 - - Exc S R n inst - - Exc re que n determ#28#18#29 - - Exc re que S inst - - Tf clr a inst - - Table 11: Output Gate Parameters for TransientFault Generator Gate Function Tf id n MARK#28Left#29=n MARK#28Right#29=n MARK#28Tf station n#29=1 MARK#28Tf clr n#29=1 RR n MARK#28RR n#29=n;... In PAGE 42: ...Activity Rate Probability case 1 case n Tf arrival exp#28#15#29 - - Tf id a determ#28#0F#29 1 n 1 n RR a determ#28#20#29 1 n,1 1 n,1 Left a determ#28DIST#29 - - Right a determ#28DIST#29 - - Tf jam n determ#28 apos;#29 - - Tf duration n determ#2810 ms#29 - - Exc S R n inst - - Exc re que n determ#28#18#29 - - Exc re que S inst - - Tf clr a inst - - Table1 1: Output Gate Parameters for TransientFault Generator Gate Function Tf id n MARK#28Left#29=n MARK#28Right#29=n MARK#28Tf station n#29=1 MARK#28Tf clr n#29=1 RR n MARK#28RR n#29=n;... In PAGE 43: ...Table1 2: Input Gate Parameters for TransientFault Generator Gate Enabling Predicate Function Enable tf i MARK#28Enable tf p#29==1 NULL Function Left i MARK#28Left#29 #3E 0 SWITCH#28Left#29 case n : Tf station n =1; Left ,,; Right i MARK#28Right#29 #3E 0 if #28Right#29 #3E MAX STATIONS Right =0 else SWITCH#28Right#29 case n : Tf station n =1; Left ++; Tf jam i n MARK#28Channel n#29==n and Channel n = 1; Collision MARK#28Tf station n#29==1 Determ S R n MARK#28RR#29==n and RR =0;R = n; S = Channel; MARK#28Channel n#29 #3E n switch #28S#29 MARK#28Tf station n#29==n case n : C D type = D type n; BREAK; Re que S R n #28#28MARK#28R N#29==n#29 and if #28Channel n == 1#29 R =0;C D type =0; #28#28MARK#28Channel N#29==0#29or else switch#28C D type#29 #28MARK#28Channel N#29 == 1#29#29 case 1: switch#28R#29 switch #28R#29 case i: if #28q t1 n #3C 20#29 q t1 n ++; R =0;Re queue =1; case 2: switch#28R#29 switch #28R#29 case i: if #28q t2 n #3C 20#29 q t2 n ++; R =0;Re queue =1; case 3: #28R =0;C D type = 0;#29 Re que s MARK#28Re queue#29 #3E 0 and switch#28C D type#29 case 1: switch#28S#29 switch #28S#29 case i: if #28q t1 n #3C 20#29 q t1 n ++; S =0;Re queue =0; case 2: switch#28S#29 switch #28S#29 case i: if #28q t2 n #3C 20#29 q t2 n ++; S =0;Re queue =0; case 3: #28S =0;C D type = 0;#29... ..."

Cited by 5

### Tables 3.4 and 3.5 show the mean of the virtual transmission time E[T] (cf. Equation (3.29)) as a function of the number of stations for slotted ALOHA and binary exponential backofi, respectively, in the wireless LAN in overload conditions. We see that the analytical results are very accurate compared with the simulation results; the analytical results practically coincide with the simulation results. Comparing slotted ALOHA and binary exponential backofi, observe that for a small number of stations slotted ALOHA leads to a slightly smaller virtual transmission time as a consequence of the lower number of idle slots per successful packet transmission. In contrast as the number of stations increases, the value of E[T] slightly increases for slotted ALOHA whereas it remains almost constant for binary exponential backofi. These observations agree with simulation results of Bianchi [18] and [19] showing that the

2004

Cited by 3