### Table 4. Prediction Success Table for Pre-BART Model and Post-BART Data Cell Counts

2000

Cited by 6

### Table 2. Prediction Success Table for Pre-BART Model and Post-BART Data Cell Counts

2000

Cited by 6

### Table 1. Prediction Success Table, Journey-to-Work (Pre-BART Model and Post-BART Choices)

2001

"... In PAGE 5: ... We collected data on the travel behavior of a sample of individuals in 1972, prior to the introduction of BART, and estimated models that were then used to predict the behavior of the same individuals in 1975 after BART began operation. Table1 summarizes results for the journey-to-work. In this table, a MNL model estimated using the pre-BART commuter data was evaluated at the realized attributes of the alternatives, including the new BART alternative, that were available to each of the 631 subjects who were surveyed after BART began operation,.... ..."

Cited by 8

### Table 1. Work Trip Mode Choice Model, Estimated Pre-BART

2000

"... In PAGE 5: ... TDFP used the introduction of BART as a natural experiment to test 2 the ability of disaggregate travel demand models to forecast a new transportation mode. Table1 below, taken from McFadden (1978), gives the work mode choice model that we estimated using data collected in 1972, before BART began operation, and subsequently used to predict BART patronage. The family annual income variable in this model enters as a linear spline with knots at $7.... ..."

Cited by 6

### Table 3. Work Trip Mode Choice Model, Estimated Pre-BART Mode Description Number Percent 1 Auto Alone 429 55.6% 2 Bus with Walk Access 134 17.4%

2000

"... In PAGE 7: ... TDFP used the introduction of BART as a natural experiment to test the ability of 2 disaggregate travel demand models to forecast a new transportation mode. Table3 below, taken from McFadden (1978), gives the work mode choice model that we estimated using data collected in 1972, before BART began operation, and subsequently used to predict BART patronage. The family annual income variable in this model enters as a linear spline with knots at $7.... ..."

Cited by 6

### Table 2: Mutual information for first scenario. The table lists the mutual infor- mation conveyed by the pool of features about the 3 classes (see: Ullman amp; Bart 2004). Also some error rates are given performing 100 nearest-neighbor classifi- cations per approach.

"... In PAGE 15: ... However, in high-dimensional data the approach is computationally too expensive and requires a huge set of samples. For the results in Table2 we used a calculation which is similar to the method applied in (Ullman amp; Bart 2004) to select informative image fragments: First for each feature an optimal threshold is determined. For it the dot product with each sample is calculated.... In PAGE 16: ...we adopted the iterative process proposed by (Ullman amp; Bart 2004) to calculate the values in Table2 . First the feature conveying the most mutual information is chosen, and later the features with the most additional mutual information.... In PAGE 16: ... So in some sense the information is best distributed in the weight coding approach. Table2 also gives some error rates performing nearest-neighbor classifications on the three-class problem. In 100 runs per approach 3 representatives per class were chosen randomly out of the 140 views.... ..."

### Table 3: Mutual information for second scenario. The table lists the mutual in- formation conveyed by the pool of features about the 10 classes (see: Ullman amp; Bart 2004). Also some error rates are given performing 100 nearest-neighbor classifications per approach.

"... In PAGE 18: ... The evaluation of mutual information and classification rate was performed on the four test objects per class keeping the procedure of the first scenario. The results are shown in Table3 . This time 5 representatives per class were chosen randomly out of 240 views that covered the limited rotation of the four objects as described above.... ..."

### Table 1. Time and space costs of polymorphic type analyses. The main contribution of this paper is the application of abstract compilation to polymorphic type inference associating each type with an incarnation of the Prop do- main. It is this view which has led us to a concise and e cient implementation of a type system. Of particular interest is the application of an open semantics and algebraic simpli cation to obtain time and space e cient analyses. Acknowledgments We thank Roberto Giacobazzi, Phuong Lan Nguyen, T.K. Lakshman and Eyal Yardeni for useful discusions on types. Bart Demoen is partially sponsored by contract IT/4 of the Belgian D.W.T.C.

1994

"... In PAGE 10: ... As programs and/or the domain of types grow larger it becomes crucial to maintain a concise representation in the implementation. In fact the polymorphic type analysis for the balance program of Example 6 is already not reasonable following the naive approach (see Table1 below). Instead, we follow an approach in which lub=3 and neq=2 predicates in the bodies of the (abstract) clauses are viewed as open predicates and hence not unfolded in the evaluation of the least xed point.... In PAGE 13: ... 6 Discussion The analyses described in this paper are implemented in Prolog and consist of 150 lines of code for the analyzer which is based on \standard quot; TP semantics and 400 lines for the analyzer which is based on an open semantics. Table1 illustrates the advantage of considering an open semantics in analyses of this type. The rst column of numbers indicates the time (in seconds running on a SPARC1 station) and the space (number of facts) costs for the analyzer based on the TP semantics.... ..."

Cited by 37

### Table 31: MatLab script analysing wave files using the FFT % Marc Bartels 2004; marc.bart@web.de; crami@web.de function fft_wave_file_save_for_c(input_file_name,output_file_name) % input_file_name = to be analysed wave file (name.wav) % output_file_name = any name (e.g. name.txt or name.dat) clc % clear the screen

2004

"... In PAGE 10: ...able 30: Implentation of the DFT for the DSP in C................................................. 111 Table31 : MatLab script analysing wave files using the FFT .... ..."

### Table 2: Standard hash functions in a glance.

2005

"... In PAGE 8: ...iyaguchi-Preneel construction (Section 2.4). Whirlpool does not target any particu- lar architecture, although 32- or 64-bit processors permit some optimizations impossible in 8-bit implementations. We summarize in Table2 parameters of the standard hash functions. Table 3 presents performance of some of the hash functions on selected processors compiled from two studies [P+03, NM02].... ..."