### Table 1: Milestones in extractors constructions: Reference min-entropy threshold seed length output length

"... In PAGE 8: ...Explicit constructions: state of the art A substantial e ort has been spent in recent years trying to explicitly construct optimal extractors. Table1 reports many such extractor constructions. For simplicity all the results in the table are stated for constant error .... ..."

### Table 2: Extractors comparison reference min-entropy k output length m additional randomness d

2006

### Table 1: Extracting a constant fraction: m = (1 )k for arbitrary gt; 0 reference min-entropy k seed length d

2000

Cited by 39

### Table 2: Optimizing the seed length: d = O(log n) reference min-entropy k output length m

2000

Cited by 39

### Table 2: Independent-symbol extractors for sources on [d]n that extract 99% of the min-entropy. In this table c and C represent sufficiently small and large constants, respectively.

### Table 1. Milestones in building explicit extractors. The error is a constant; is an arbitrary constant.

"... In PAGE 2: ... Often, constructions work well for only certain values of k, and obtaining a construction that works for all min-entropies k has been a challenge. The progress on this problem is summarized in Table1 for the case of constant error .... In PAGE 3: ...onstruction. Reingold, et al. [24] improved their result by combining the old hashing techniques with the new extractors, together with new ideas. The actual parameters achieved are stated in Table1 . There was still a tradeo however: if one insisted on an extractor that extracted a constant fraction of the min-entropy using the asymptotically optimal O(log n) truly random bits, the situation was not good.... In PAGE 21: ... As a corollary (Corollary 5.8 below), we obtain the extractors listed in Table1 . The second extractor we produce obtains constant entropy loss, and for that we need the following slight strengthening of a lemma of [40].... ..."

### Table 3: A Chaining KB

"... In PAGE 12: ...5 A Chaining Example We now extend the simple example introduced in Section 2.3 with additional chaining rules as shown in Table3 . The training case is also adapted to utilise these additional rules: we want a recommendation for someone who likes a French-style, red wine to drink with chicken in a red wine sauce for $3.... ..."

### Table 3.1. Chains of Recurrences simplification rules. Expression Rewrite

### Table 3.2. Chains of Recurrences inverse simplification rules.

### Table 1: Applications of RFID in the Supply Chain by Function

2006

"... In PAGE 16: ... While it is difficult to enumerate all of the potential supply chain applications of RFID, the discussion below illustrates extensive examples derived from recent literature of how RFID might be implemented within the supply chain. The examples and subsequent benefits are organized by supply chain area (buy, make, store, ship, and sell), and Table1 presents these and other examples with citations for reader reference. Buy RFID can enable a procurement/materials management system to track consumption of parts and materials inventory, initiating automated reordering based on established replenishment rules (Karkkainen and Holstrom 2002; Angeles 2005).... ..."