"... In PAGE 2: ... 2 Overall Performance Comparisons The comparison between the performance of simi- lar hardware and software implementations of the ge- netic algorithm can be done in two interesting fash- ions. First, Table1 compares the absolute execution times of the two implementations. The performance advantage of the hardware was initially surprising to us for a number of reasons.... ..."

"... In PAGE 4: ... For each document Di, the scoring algorithm pro- duces a set of k documents, {Dj}, where j varies from 1 to k. Given the scores of the top-k matches of each document Di, Table3 describes the actions that may be taken for each matched pair during cluster for- mation. Documents are examined in a pairwise fash- ion, starting with the first document and its top-k matches.... ..."

"... In PAGE 11: ... Therefore, the complete aspect decomposition model is obtained in an incremental fash- ion since each identification of new aspects possibly trig- gers both first and second degree refactoring. Table3 sum- marizes our decomposition process of the aforementioned aspects retrospectively, where we list our implementation stages of aspects in a chronological order. For instance, our initial refactoring (Stage 1) starts with aspects Portable In- terceptors (PI), Dynamic Programming Interface (DPI), and Collocated Server (CO) listed in Column A while the other aspects (Column B) are yet to be identified.... ..."

"... In PAGE 26: ... the parts of the simulation that have already been evaluated can be discarded. Table3 compares the memory requirements of the offline and incre- mental procedure. For the offline procedure we take the total number of intervals generated by the tool after the evaluation of the property.... In PAGE 26: ... Hence, we take the maximum number of intervals that was needed to keep in memory by the procedure during the evaluation. As we can see from the fourth column of the Table3 , the memory required by the incremental pro- cedure with respect to what is needed in the offline mode, varies a lot from one property to another. When the property compares signals in the pointwise fash- ion, the incremental procedure is very efficient, as it can immediately update new values and discard the rest.... ..."

"... In PAGE 11: ...Table8 shows the means and standard deviations of the four cells for the mediating and outcome variables. Preliminary Analyses ANOVAs were used to determine that boys and girls did not differ on any outcome variables and that gender did not interact with goal-content or learning climate, so gender was not included in further analyses.... In PAGE 11: ...001, as well as an interaction, F(3, 218) H11005 11.09, p H11021 .01. We then conducted univariate two-way ANOVAs for each mediating and dependent variable, and, as hypothesized, we found main effects for both independent variables on all three mediating and dependent variables (see Table8 ). Framing the task in terms of intrinsic (relative to extrinsic) goals and providing those differ- ent goals in an autonomy-supportive rather than controlling fash- ion both led to more autonomous motivation, better performance, and more persistence, fully replicating Study 2 results.... In PAGE 11: ... Framing the task in terms of intrinsic (relative to extrinsic) goals and providing those differ- ent goals in an autonomy-supportive rather than controlling fash- ion both led to more autonomous motivation, better performance, and more persistence, fully replicating Study 2 results. Table8 also shows the effect sizes, which varied from .09 to .... ..."

"... In PAGE 9: ... The old in- verted index, the bit map, the array of new postings, and the sorted update operations are merged (in a fash- ion similar to mergesort) into an updated inverted index on disk (see Figure 7). This partial rebuild using landmark-di method is ap- plied on data set I and the results are summarized in Table4 . The partial rebuild using landmark-di method results in a speedup of 2 over a complete rebuild of the index using k-way mergesort even for two samples that are 71 hours apart and thus have a large number of changed common documents and inserted documents.... In PAGE 9: ...1) compared with a complete rebuild. We have showed in Table4 that the array-based partial rebuild using landmark-di is twice as fast as complete rebuild for a relatively large update interval of 71 hours. As the update interval gets smaller, the speedup will be more signi cant and even more dramatic if we use a B-tree implementation of the inverted index.... ..."

"... In PAGE 2: ... The design of the TAME TIOA tem- plate is especially aimed at supporting TAME proof steps (which are implemented as PVS strategies) for reasoning about trajectories. Table1 describes the new TAME strate- gies for reasoning about trajectories. Example proofs using apply traj evolve and deadline reason can be seen in Section 4.... In PAGE 5: ...This method of representation, adapted from a technique of Luchangco [21], allows trans to be represented as a func- tion from states and actions to states while allowing the re- sult of a nu traj action to be nondeterministic. The new TAME strategies in Table1 , combined with the existing TAME strategies, provide a set of proof steps that allow the fischer invariants shown in Figure 3 to be proved interactively in PVS in a clear, high-level fash- ion. The TIOA-to-TAME translator transforms the six in- variants in Figure 3 into TAME invariants and lemmas num- bered starting from 0.... ..."

"... In PAGE 17: ... As explicit analytical equations are not available for this problem, to confirm the adequacy of the response model in predicting the mean and variance of system performance, random simulations are used. In Table3 , the results are compared to those from 100 random simulations and 500 random simulations. For these simulations, the values of the control factors are fixed at their solution point and the values of the noise factors vary within the given range.... In PAGE 17: ... It can be noted that the estimations for the mean of power, mean of efficiency and mean of savings are quite accurate. For variance, in column 2 of Table3 , the estimated values are provided when assuming the noise factors are normally distributed or uniformly distributed. Random simulations yield values which are close to those obtained when assuming the noise factors are uniformly distributed.... In PAGE 17: ... Note that the accuracy is satisfactory. - INSERT TABLE 3 HERE - Table3 . Confirmation of the Results When considering multiple aspects of quality, designers may have different preferences... ..."