### Table 2. Joint IDM values for Practical Approach and Optimization Method

"... In PAGE 8: ... As the IDM is a criterion based on the distance measurement, that is, based on distortion, then it is natural that the LBG algorithm results have a higher IDM value. Table2 presents a comparison of the IDM values resulting of the application of the practical approach, selecting S0 = fPx v ; Py v g, and the correspondent results obtained by the optimization method using the CombNET-II training algorithm. Table 2.... In PAGE 8: ...The values presented in Table2 suggest that the practical approach does not de ne the best space division for the T-CombNET model. Table 3 shows the obtained nal recognition rates for the networks trained by approaches presented by Fig.... ..."

### Table 1: Test network commodities and paths

"... In PAGE 6: ...Table 1: Test network commodities and paths 5. Numerical Results The optimization and auction algorithms have been implemented in AMPL/CPLEX [6] and tested on a network with 10 nodes, 17 links and 8 commodities (see Figure 3 and Table1 ). The distributed auctions at the edges are simulated: the sessions created with Poisson arrival rate have uniformly distributed duration, bid and bandwidth demand.... ..."

### Table 1: Transport Traffic and Schedule Length Scaling Laws Strategy TT SL

"... In PAGE 6: ... 4.2 Performance Comparison In this section, we compare the scaling laws associated with var- ious cooperation strategies addressed in this paper and summarized in Table1 . This is of paramount importance to judge their rela- tive performance, their advantages and limitations, and finally po- tential avenues for extending this work.... In PAGE 6: ... This, in turn, motivated us to exam- ine the entire space of strategies bounded by the two extremes, via varying the cooperation set size i, using the two-phase cooperation framework. Although the linear SL scaling law still persists under two-phase cooperation, Table1 shows that varying the parameter i from 1 to N varies the scaling laws between the two extreme strategies. This, in turn, suggests that the parameter i creates room for optimizing the TT and SL for a given network size.... ..."

### Table 1: Transport Traffic and Schedule Length Scaling Laws Strategy TT SL

"... In PAGE 6: ... 4.2 Performance Comparison In this section, we compare the scaling laws associated with var- ious cooperation strategies addressed in this paper and summarized in Table1 . This is of paramount importance to judge their rela- tive performance, their advantages and limitations, and finally po- tential avenues for extending this work.... In PAGE 6: ... This, in turn, motivated us to exam- ine the entire space of strategies bounded by the two extremes, via varying the cooperation set size i, using the two-phase cooperation framework. Although the linear SL scaling law still persists under two-phase cooperation, Table1 shows that varying the parameter i from 1 to N varies the scaling laws between the two extreme strategies. This, in turn, suggests that the parameter i creates room for optimizing the TT and SL for a given network size.... ..."

### Table 6: CTH Solution to the Sandia Wave-Shaper Optimization Problem: Solution 1

"... In PAGE 50: ...415 cm) as a good starting value. Using the coarse mesh, DAKOTA selected the path shown in Figure 21, and found the locally optimum solution (denoted solution 1) given in Table6 . Starting from this solution and using the normal mesh, DAKOTA verified that the solution is locally optimal (Table 6).... ..."

### Table 2. Transport Services

"... In PAGE 14: ...3 Transport Service The transport service is represented by a class that includes abstract operations for allocating network resources and establishing communication paths. The ex- tension modules currently include the concrete transport service implementa- tions listed in Table2... ..."

### Table II Comparison between standard metal detectors and millimeter wave technology

2007

### Table 2: Algorithm to Compute Critical Path Length.

"... In PAGE 42: ... The heart of PERT is a network of tasks needed to complete a project, showing the order in which the tasks need to be completed and their dependencies between them. As shown in Table2 , PERT scheduling reduces to a derivate of Dijkstra apos;s single shortest path algorithm within acyclic graphs (Cormen, Leiserson, amp;Rivest, 1990). In the algorithm, e(O i ) is the tentative earliest end time of operator O i , i 2f1;;:::;;kg, while the earliest starting times t i for all operators in the optimal plan are given by t i = e(O i );d(O i ).... In PAGE 93: ... Additionally, if we have to cope with reactive scheduling then feasible solutions and user interaction will become more important. Table2 . Evaluation of the results solution late orders lateness transport costs 1 2 (1 product) 12 24 2 3 (2 products) 8 22 3 2 (2 products) 9 23 4 4 (3 products) 14 21 For a solution approach it is necessary to describe what information is needed to model the problem and how it is used.... ..."

### Table 2: Technology Mapping results

"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

### Table 5: Transportation Tableau

in Jagu P. Aiyer Management Science Associates, 6565 Penn Avenue, Pittsburgh, PA 15232 Jayant Rajgopal

"... In PAGE 20: ...ields values of 5.87, 8.80, 1.95 and 0.98 for target programs 2, 3, 4 and 5 respectively. Finally, we compute the distance measures between each vp and each vh to use as costs in the transportation model; in cases where a host program airs after a target program we use a large value M for the cost. The resulting transportation tableau is shown in Table5 and the optimal promotions schedule is shown in Table 6. --------------------------------------------- Insert Tables 5 amp; 6 about here --------------------------------------------- Finally, even though this paper does not deal with this issue in depth, a few words on evaluation of the promotion process are in order.... ..."