### TABLE 1 Protein name conversion table and modules used for each organism In Fig. 1 Budding yeast Fission yeast Xenopus embryo Mammalian cells Function

2006

Cited by 3

### Table IV shows, in a summarized way, the data of Vector I, with respect to the two first items introduced in Table I.

### Table 7 Error introduced for using only the first n terms for B(afii9838; H)

2007

"... In PAGE 10: ... Thus, we define Error (n, N ) = Bn:N (afii9838; H) B1:N (afii9838; H),N?n, (30) as the error introduced for taking into consideration only the n-first terms of (2). Table7 shows the value of Error (n, 105) for afii9838 = afii9843/2. From this table, we see that for values of H close to 1, fewer terms are required than for values of H close to 0.... ..."

### Table 8 gives the number of variables necessary to achieve the minimum mean error for all the datasets, with and without bootstrap. Note that for Lymphoma and Prostate we have first introduced the variables by ten in the stepwise procedure to localize the minimum, and then we worked with one variable introduction.

### Table 4.2: gray-value resolutions for experiments of Kalman ltering. First, we introduce two matrix inversion lemmas, which will be used here.

### (Table 3). The parallel shift instructions shift the subwords in a register to the left or to the right by any amount specified either in an immediate field or in a register. The shift right pair instruction, first introduced in PA-RISC processors, is very useful for bit fields spanning two registers [5,7]. This instruction concatenates two source registers and shifts this value to the right. The lower half of the shifted value is placed in the destination register. Rotation is achieved when both source operands are the same register.

in PLX: A Fully Subword-Parallel Instruction-Set Architecture for Fast Scalable Multimedia Processing

2002

Cited by 9

### Table 1: Validation of the prefetch performance model introduced in secion 3. The profile parameters and the actual values are taken from the first Thursday of the measurement period.

1999

"... In PAGE 17: ...iss bandwidth peaks are completely cut off. The highest peak on Thursday is reduced by 10.5% using a non-boosted strategy (left graph) and nearly 15% using the boosted strategy (right graph). Table1 shows that the observed smoothing effect matches the prediction of the model in section 3. The peak bandwidth of misses to all servers during Thursday is around 200M Byte/15 mins.... ..."

Cited by 1

### Table 6 Introduction and Enforcement of the Insider Trading Law The first column reports the year legislation to curb insider trading was introduced, the second one the year the first case of prosecution took place. No means there has been no case of prosecution. Source: Bhattacharya and Daouk (2002).

"... In PAGE 10: ...ress.4 This is not simple cheap talk. Disclosure standards have improved throughout the Continent as have laws to protect minority shareholders. For example, in Table6 , we report the year of introduction of a law to prosecute insider trading and the year this law was applied for the first time. Before 1980 no EU country, except France and Sweden, had an anti insider trading law.... ..."

### Table 1. 3.3.2 Global Forbidden and border Sets Based on the sets Ii;loc(Ei); Fi;loc(Ei) and F i (Ei) that can be locally computed, we now define the global weak forbidden set of states as well as the global border set. In a first step, we consider a product set E = E1 En. We first introduce Iloc(:) as the set of global states that may lead by a sequence of local uncontrollable events to E. This set can be computed on G as follows: Iloc(E) = P reG

2003

"... In PAGE 22: ...een done. So we only need to perform the computations for E3. The results are summarized in the next table. E3 1 E3 2 E3 3 Ii;loc fx1 3g fx2 2g fx3 1; x3 3g Fi;loc fx1 1; x1 6g fx2 01g fx3 01; x3 4g F uc i ; ; ; F i ; fx2 3g fx3 2g At this stage, it is easy to see that (E) = (E). Hence, S can be deduced from the Table1 and 2 following Theorem 3. 4 Conclusion In this paper, we investigated the State Avoidance Control Problem for loosely synchronous systems.... ..."

Cited by 2

### Table 1 gives an overview of possible values and combinations for those four dimensions. The approach was first introduced by Specht (Specht, 1998) and allows for new adaptive methods. As a classical example quot;Adaptive Sequencing quot; was described in the literature (Brusilovsky, 1996) where the sequence of learning object or learning units is adapted to the learner apos;s knowledge, skills, or preferences. As the possible combinations from table 1 show the classification system allows describing a wide variety of possible adaptive methods, which use different adaptation means, targets and goals, and apply different methods for information collection.

"... In PAGE 2: ... Table1 : A classification schema for adaptive methods Specht (1998) describes and experiments with different examples for adaptive methods that can be found in different research areas as Intelligent Tutoring Systems (Carbonell, 1970; Clancey, 1987; Anderson, Conrad et al., 1989), Adaptive User Interfaces (Carroll, 1984; Brusilovsky, Specht et al.... ..."