### Table 1. Analytical bounds.

1996

"... In PAGE 5: ... [15, 16], we place a superscript A on any variable related to the sender-initiated protocol, N1 and N2 on variables related to the receiver-initiated and RINA protocols, respectively, and H2 on tree-NAPP proto- cols. Table1 summarizes the bounds on maximum throughput for all the known classes of reliable multicast protocols. The results for sender-initiated, receiver-initiated, and tree-NAPP protocols are taken from the analysis presented by these authors [11] and Pingali et al.... ..."

Cited by 56

### Table 1. Analytical bounds.

1996

"... In PAGE 5: ... [15, 16], we place a superscript A on any variable related to the sender-initiated protocol, N1 and N2 on variables related to the receiver-initiated and RINA protocols, respectively, and H2 on tree-NAPP proto- cols. Table1 summarizes the bounds on maximum throughput for all the known classes of reliable multicast protocols. The results for sender-initiated, receiver-initiated, and tree-NAPP protocols are taken from the analysis presented by these authors [11] and Pingali et al.... ..."

Cited by 56

### Table 2. Analytical Methods

"... In PAGE 28: ...As noted in Table2 , some of the reference methods were modified to accommodate the specific contaminants of concern at the site. These modifications were designed by the project team that included an analytical chemist and were conducted in accordance with the performance-based measurement... In PAGE 29: ...ndividual compound (e.g., dieldrin or endrin) had been exceeded. These values (5 ppm and 0.086 ppm) became the site-specific field action levels associated with the DDT IA test kit and the cyclodiene IA test kit, respectively, at the start of field work. Final Method Selection The analytical methods used for cleanup phases of the project were based on the methods modified for the pilot study (see Table2 ). The sensitivities of the analytical methods selected for the field IA testing and fixed laboratory confirmation analyses were evaluated relative to the MTCA Method B cleanup levels established for this project.... ..."

### Table 1 Analytic Centers

"... In PAGE 12: ... The iteration stops when the 2-norm of the di erence between consecutive iterates is less than kSk where is the machine dependent oating point relative accuracy and is 2:2204 10 ;16 in our case. In Table1 we list the column indices used to generate the matrix S, the analytic centers and the number of iterations needed for convergence. So as to t the data comfortably in the running text, we display all the numbers with only four decimal digits.... ..."

Cited by 1

### Table 1 Analytic Centers

"... In PAGE 12: ... The iteration stops when the 2-norm of the di erence between consecutive iterates is less than kSk where is the machine dependent oating point relative accuracy and is 2:2204 10?16 in our case. In Table1 we list the column indices used to generate the matrix S, the analytic centers and the number of iterations needed for convergence. So as to t the data comfortably in the running text, we display all the numbers with only four decimal digits.... ..."

### Table 1.1: Research on floating-point to fixed-point transformation. (SPW: Signal Processing Worksystem, HDS: Hardware Design System, FRIDGE: Fixed-point Programming Design Environment, MATCH: Matlab Compiler for Heterogeneous Computing Systems, MILP: Mixed Integer Linear Program- ming, CDM: Complexity-and-Distortion Measure) Paper Fixed-point Conversion Wordlength Optimization Range Environment Error Search Search

in Copyright by

2006

### Table 3 Analytical Simulation

in Performance Evaluation and Optimization of Open Zero-Buffer Abstract Multi-Server Queueing Networks

"... In PAGE 10: ..., 2001). Table3 is based on the simulation results. In the column labeled analytical, we 260 give the throughput result from the GEM for each of the cases.... In PAGE 10: ... Based on the simulation output, we conclude that the 265 analytical results are reliable. 266 Table3 goes around here 5.... In PAGE 18: ...481 Figure 1: The three difierent blocking mechanisms 482 Figure 2: A zero-bufier queueing network representation 483 Figure 3: The generalized expansion method 484 Figure 4: Series topology 485 Figure 5: Split topology 486 Figure 6: Merge topology 487 Figure 7: GA optimization for earmarked symmetrical settings 488 Figure 8: GA optimization for earmarked asymmetrical settings 489 Figure 9: Queueing network structure 490 Figure 11: GA optimization for the fruit juice plant 491 Figure 10: Plot of throughput for difierent arrival rates 492 Figure 12: New queueing network structure 493 Table Legends 494 Table 1: Variables used in this paper 495 Table 2: Throughput for the symmetrical cases 496 Table3 : Simulation results for the symmetrical cases 497 Table 4: Throughput for the asymmetrical cases. 498 Table 5: Simulation results for the asymmetrical cases 499 Table 6: Processing rates used in the complex topology 500 Table 7: Data used in the complex topology 501 Table 8: Throughput rates for difierent conflgurations 502... ..."

### Table 2. Analytical results

2000

Cited by 10

### TABLE 1 Analytical Frameworks

2000

Cited by 1