### Table 1. Annual 2010 HSR ridership, distance, and fares

"... In PAGE 4: ... These were combined and then apportioned based on the mode choice model. The key variables are for application of the model in 2010 with three modes are travel time, service frequency, and rail fares to be competitive with air travel, as shown in Table1 . These result in forecasts ranging to 5.... In PAGE 16: ... According to Table 5, the energy consumption of an Atlantic TGV trainset cruising at 300 kilometers per hour on the new high-speed line is 20 kwh per kilometer. The maximum speed on the California high-speed line has been assumed to be 320 kph, as shown in Table1 . Moreover, the average number of train stops on the new line is expected to be higher.... In PAGE 17: ... User operating costs are thus the fares users pay to the rail carrier, which can be considered entirely a transfer, and are thus not included in the final calculation of costs. The fares we have assumed are given in Table1 earlier in the paper. User time and con- gestion is worth some discussion.... ..."

### Table 24: One-way ANOVA for Citation.

2004

"... In PAGE 74: ...-Test of difference = 0 (vs not =): T-Value = 1.33 P-Value = 0.201 DF = 17 Both use Pooled StDev = 62.0487 One-way ANOVA: Total Time versus MagStripeUse Table24 shows the results for two vehicle crashes.... ..."

### Table 1. Cost of sending short and long one-way messages between machine at the HP Palo Alto site and several globally-distributed sites. All times in milliseconds.

"... In PAGE 2: ...pdates are propagated only periodically (e.g. nightly); delayed consistency, where notification that the data has changed must be received before the next access occurs, although the actual update may not be complete; strong consistency, where the most recent version of the data must be available before the next access occurs. The begin to quantify the latency costs, Table1 shows the basic costs of communication between a machine at Hewlett-Packard Laboratories in Palo Alto and a number of machines around the globe. Using the ping command to send ICMP datagrams to the destination sites gives the round-trip time for the most basic IP message between those sites.... In PAGE 5: ... In the weakly consistent model, or a model using optimistic concurrency [Amiri00], the key metric is the potential for conflicts given the propagation time of requests to the remote sites. Figure 2 considers both of these factors and shows the number of accesses in our traces that might con- flict given the across-the-world latencies introduced in Table1 . Again, the results are quite promising for all three traces.... ..."

### Table 7: One-Way Optimized SRP

"... In PAGE 12: ...C; A C #28= S s; B C =#29 S M 1 C #28= S M 2 Table 6: Optimized SRP SRP. Table7 shows a three-message, one-and-a-half round trip implementation of SRP that authenticates the client to the server, but not the other way.... ..."

### Table 2. One-way ANOVA results

### Table 1: Our mechanisms compared with public key equivalents

2003

"... In PAGE 12: ... To compare these results to the efficiency of public-key cryptography, we analyzed the functionality provided by each mechanism. A summary of our analysis is shown in Table1 . The tree-authenticated one-way chain essentially provides a signature: given a public key (the root value), private values can be authenticated.... ..."

Cited by 44

### Table 1: Our mechanisms compared with public key equivalents

2003

"... In PAGE 12: ... To compare these results to the ef ciency of public-key cryptography, we analyzed the functionality provided by each mechanism. A summary of our analysis is shown in Table1 . The tree-authenticated one-way chain essentially provides a signature: given a public key (the root value), private values can be authenticated.... ..."

Cited by 44

### Table 1: Our mechanisms compared with public key equivalents

2003

"... In PAGE 12: ... To compare these results to the ef ciency of public-key cryptography, we analyzed the functionality provided by each mechanism. A summary of our analysis is shown in Table1 . The tree-authenticated one-way chain essentially provides a signature: given a public key (the root value), private values can be authenticated.... ..."

Cited by 44

### Table 1: Our mechanisms compared with public key equivalents

2003

"... In PAGE 12: ... To compare these results to the efficiency of public-key cryptography, we analyzed the functionality provided by each mechanism. A summary of our analysis is shown in Table1 . The tree-authenticated one-way chain essentially provides a signature: given a public key (the root value), private values can be authenticated.... ..."

Cited by 44