### Table 1: Architectures analyzed

"... In PAGE 4: ... The only architectures with these characteristics for the access network in Fig. 1 are those listed in Table1 , where we have also indicated the number of switches for each level. Given that, as is easy to argue, there is no optimal architecture for all types of mobility, we will study the averaged rerouting time by varying the user mobility in terms of T Cell ( ) .... ..."

### Table 2: Hurst parameter (H) estimates for the three distinct tra c processes, and theoretical values for the corresponding idealized Fractional Brownian Motion processes.

"... In PAGE 88: ...23 58.75 Table2 : Bandwidth gains ( ) in large realistic net- works In this part, in order to further investigate the algorithms in larger and more realistic networks, we use a famous topology generator, BRITE10, to generate more realistic topologies with larger number of nodes (up to 500 nodes), in which we compare the performance of the three algorithms. We con gure the BRITE as shown in Table 1 to generate our simulating topologies, where HS means \size of the main plane quot; [19] and it simulates the geometrical size of a network.... In PAGE 88: ... Totally, 4 topologies are generated and they consist of 200, 300, 400, and 500 nodes, respectively. Table2 shows the detailed simulation results. It is clearly demonstrated that all three algorithms, WSP, BSP, and EBSP, perform better than the SP algorithm in all 4 cases (i.... ..."

### Table I Parameters for Brownian Motion

### Table I Parameters for Brownian Motion

### Table 5: The average queue lengths of the queueing network

2002

"... In PAGE 28: ... The iterations, along with the refined Brownian estimates, are given in Table 8 to 10. The case n = 1 corresponds the original Brownian model whose results are shown in Table5 to 7. By observing the numerical results in Table 8 to 10, we can see that the above iterative procedure provides a slightly better Brownian model for performance evaluation compared to the original Brownian model, especially in System No.... ..."

Cited by 3

### Table 1 The numbers of proteins and interactions to obtain protein-protein interaction networks and residual networks with network analyzing features in 7 organisms in DIP.

"... In PAGE 9: ... The residual network has 1078 nodes and 2778 edges. All 7 protein-protein interaction networks we use in this research are presented in Table1 . The rst rows for each organism are about the original networks and the second rows have the information for their residual networks.... ..."

### Table 2: Parameters for Correlated Brownian Motions

2003

"... In PAGE 22: ...Valuation Under Different Price Models We first examine the effects of price model specification on power plant valuation for two different price processes: a geometric Brownian motion (GBM) process and a mean-reverting process in which the logarithm of the underlying price is represented by an Ornstein-Uhlenbeck (O-U) process. The assumed parameter values for the two models are given in Table2 and Table 3. A discrete-... In PAGE 22: ...Table 2: Parameters for Correlated Brownian Motions time trinomial price lattice is constructed according to (3) and (4) with the parameters specified in Table2 to approximate two correlated GBMs and a quadrinomial lattice is constructed according to (6) and (9) with the parameters in Table 3 to approximate two correlated O-U processes. The initial prices of electricity and natural gas are assumed to be $21:7 per MWh and $3:16 per MMBtu, which are sampled from historical market prices.... In PAGE 23: ...0% GBM Valuation MRVT Valuation ABS(MRVT-GBM)/MRVT Figure 2: Value of a NG fired Power Plant under Alternative Price Models: GBM vs. Mean- reversion The parameters specified in Table2 and Table 3 were selected so that the asset values VGBM and Vmrvt would match if the power plant has a heat rate of Hr = 9:5 (which is typical for a NG fired plant) and it is operated at the maximum capacity level. Figure 2 illustrates the sensitivity of plant value to the assumed price process.... In PAGE 25: ... The time horizon is set to be 10 years. Again we use the parameter values given in Table2 and 3. 4.... ..."

Cited by 1

### Table 1. Details of selected data sets analyzed.

2005

"... In PAGE 12: ... (Packets travelling from our network to the Internet were not analyzed, but only downstream ones.) For this paper, we report analysis of four days of captured traffic, the details of which are listed in Table1 ; graphs presented, however, are based on the traffic of August 17, 2004. Data from other days shows a similar level of variability.... ..."

Cited by 3

### Table 2: Logic Analyzer Instrumentation Times

"... In PAGE 7: ... Lastly, FOA[18] has some control logic, image delay lines, and a deep, linear pipeline of processors which perform morpho- logical image operations. Design Description Virtex V1000 Name Slice Usage Packet Emulated network 1% packet analyzer CDI SAR Automatic Target 30% Recognition subroutine FOA Deep Morphological 73% Pipeline Table 1: Test Designs In Table2 we provide the run-time comparisons for six different debugging instrumentation scenarios for each of the designs. In all six cases, the logic analyzers were con- figured identically for each design, meaning that 128 new net connections had to be made for each design and all 20 trigger logic LUTs had to be modified.... ..."

### Table 1: Summary statistics for the three coauthorship networks analyzed here. After Newman [13] and Grossman [10].

2004

"... In PAGE 6: ... The cutoff may be produced by the finite time window used in the study, a hypothesis that could in principle be tested by varying the size of that window, although we do not do this here. Table1 also gives the size of the largest component in each of the networks. A component is a set of network nodes connected via coauthorship such that any node in the set can be reached from any other by traversing a suitable path of intermediate collaborators.... ..."

Cited by 35