### Table 3.5: Compact dictionary that all faults will be detected by all tests, fewer output sequences need to be stored in the detection dictionary than in the full response dictionary. The detection dictionary is easy to compact|a drop-on-K dictionary is a detection dictionary where the number of detections for each fault is limited to K. The special case K=1 is known as a vector dictionary (Table 3.7). A vector dictionary stores the same information as the pass/fail dictionary. Unlike the full response dictionary, a detection dictionary cannot be stored in a bit-packed format;the full response dictionary apos;s regular array of of ones and zeros is now irregular and interspersed with integers. Fault Detections

### Table 1. Special cases.

2005

Cited by 2

### Table 1: Characteristics of special morphologies.

1999

"... In PAGE 4: ... Mohr et al. (1957) first used the striation thickness (see Table1 ), defined as one-half the spacing between layer midplanes in a lamellar structure, as a measure of mixing. Striation thickness is related to the specific area of a lamellar mixture by = 1 SV (2.... In PAGE 5: ....2.2 Example Area Tensors When the mixture has one discrete and one continuous phase, the area tensor provides information about the shape and size of the discrete-phase domains. Table1 shows the area tensors for three example mixture morphologies. The area tensor is triaxial (isotropic) for spherical domains, biaxial (transversely isotropic) for cylindrical domains, and uniaxial for lamellar structures.... In PAGE 5: ... We can then define a local characteristic length scale Lc for the discrete phase as the ratio of the total volume Vd of the discrete phase within V to the total interfacial area Sd within V Lc Vd=Sd = =SV (2.8) Table1 gives the characteristic length scales for the three example morphologies. The characteris- tic radius of the lamellar structure is related to the striation thickness by r = .... In PAGE 14: ... This approximation is generated by choosing a functional form, constraining the form, and fitting the constrained function to data generated from the exact closure. The constraints force the closure to obey geometric symmetries, give exact results in the three limiting cases of Table1 , and have correct asymptotic behavior near those limits (Wetzel and Tucker, 1997). Exact data for ^ A (1), ^ A (2), and ^ A (3) as a function of ^ A(1) and ^ A(2) were generated using Eqns.... In PAGE 22: ... (2.8) and Table1 with a dispersed-phase volume fraction = 0:10, this tensor represents a lamellar morphology with an average sheet... ..."

Cited by 1

### Table 9: Special Case Operations

"... In PAGE 10: ...ames. These typically involve degenerate cases, such as copying from one register to another. They exploit the fact that integer register $31 is always 0. Table9 lists some typical cases and their translationsinto actual Alpha instructions. No-op instructions nop are commonly used to pad code to meet specified alignment requirements.... In PAGE 10: ... Note that the native C compiler CC makes use of these special names. The GCC compiler, on the other hand, generates the implementation form shown in the right hand column of Table9 , as does the disassembler dis. Understanding these special cases is important to being able to read the code generated by these programs.... ..."

### Table 9: Special Case Operations

"... In PAGE 10: ...ames. These typically involve degenerate cases, such as copying from one register to another. They exploit the fact that integer register $31 is always 0. Table9 lists some typical cases and their translations into actual Alpha instructions. No-op instructions nop are commonly used to pad code to meet specified alignment requirements.... In PAGE 10: ... Note that the native C compiler CC makes use of these special names. The GCC compiler, on the other hand, generates the implementation form shown in the right hand column of Table9 , as does the disassembler dis. Understanding these special cases is important to being able to read the code generated by these programs.... ..."

### Table 2. Comparison for special cases

2004

"... In PAGE 12: ... Table2 illustrates the importance of checking for special cases. These include in- variants, syntactically safe properties, bounded LTL properties, and liveness properties of the form F p, where p is a propositional formula.... In PAGE 12: ...ng properties. The column labeled k has the same meaning as in Table 1. If the value of k is 0, the corresponding property is an inductive invariant. In Table2 , the general method is slower. There are two reasons for that: The rst is that using the termination criteria of Theorem 1 and (3a00) generate more clauses for a given value of k.... ..."

Cited by 10

### Table 1: Special cases of processes.

1996

Cited by 4

### Table 2. Applications of Theorem 2 3. The critical case Theorem 2. Let F be an algebraic-logarithmic function: F(t) = (1?t)? log [1=(1?t)]. Suppose that C(z) has an algebraic aperiodic singularity C(z) = 1 ? (1 ? z=r) + ; with 0 lt; lt; 1: Then we have a special continuous limit distribution Pr(Xn = xn ) x ?1

### Table 2. Applications of Theorem 2 3. The critical case Theorem 2. Let F be an algebraic-logarithmic function: F(t) = (1?t)? log [1=(1?t)]. Suppose that C(z) has an algebraic aperiodic singularity C(z) = 1 ? (1 ? z=r) + ; with 0 lt; lt; 1: Then we have a special continuous limit distribution Pr(Xn = xn ) x ?1

1994