### Table 2: Linear mapping algorithm

2004

Cited by 1

### Table 1: Transformation rules for linear mappings defined on a dual system.

### Table 1. Linear kernel with machine cycle mappings

"... In PAGE 3: ... 1. Linear dot product kernel Java method The linear kernel in Figure 1 is compiled to Java bytecodes [18] as is shown in Table1 , which forms the basis of the WCET analysis. To deal with the bytecodes, we have divided them into basic blocks [19].... In PAGE 4: ... See ifeq at addr. 21 in Table1 . Accordingly, we save cycles in those cases where the data sets are multi-dimensional.... ..."

### TABLE I OVERALL ACCURACIES OF THE MRF SEGMENTATION WITH LINEAR MAPPING, AND THE RESULTS FROM [3], USING THE COMPLETE TRAINING SET.

### TABLE VIII LINEAR MAPPINGS OF OTHER LPC BASED METRICS D TO THE CEPSTRAL DISTANCE Dcep. THE SYMBOLS ARE USED IN THE SCATTER PLOT FIGURE 12.

in Voice Quality Evaluation for Wireless Transmission with ROHC (extended version and software code)

2003

Cited by 7

### Table 2.1: A table of linearly equivalent eigenspaces and associated eigenvalue transforma- tions. Where A is taken to be the weighted adjacency, D the weighted degree of G. Each generalized Rayleigh quotient is followed by its symmeterized form, and linear map from the eigenspace of L, D.

2006

### Table 1 with the resulting map b apos; linearized about some steady state. Now b apos; = ekXb H = C is linear and hence is the time-k map of some autonomous linear Hamiltonian b H which can

1994

"... In PAGE 7: ... Particular schemes are given in Table 1. A fourth- order scheme which has been rediscovered many times (Candy and Rozmus (1991), Suzuki (1991), Yoshida (1990)) is LF4a, which has s = 1 (see Table1 ). However, this method takes a large backwards step of 1:70k, leading to poor accuracy and stability.... In PAGE 10: ... Then ekXL is given by trigonometric functions, and ekXN can also be solved exactly: _ q =0 _ p =(jEj2)x i _ E =qE 9 gt; gt; = gt; ; ) 8 gt; gt; lt; gt; : qn+1 =qn pn+1 =pn + k(jEnj2)x En+1 = exp(?iqnk)En If ekXN cannot be found, or if H is not separable into parts which can be conveniently integrated, then an explicit symplectic integrator is usually not available. Instead one turns to the midpoint rule M2 (see Table1 ). A generalization of M2 is that the Gaussian Runge- Kutta (GRK) methods (which have s intermediate unknowns and order 2s) are also symplec- tic.... ..."

Cited by 21

### Table 1 with the resulting map b apos; linearized about some steady state. Now b apos; = ekXb H = C is linear and hence is the time-k map of some autonomous linear Hamiltonian b H which can

1994

"... In PAGE 7: ... Particular schemes are given in Table 1. A fourth- order scheme which has been rediscovered many times (Candy and Rozmus (1991), Suzuki (1991), Yoshida (1990)) is LF4a, which has s = 1 (see Table1 ). However, this method takes a large backwards step of 1:70k, leading to poor accuracy and stability.... In PAGE 10: ... Then ekXL is given by trigonometric functions, and ekXN can also be solved exactly: _ q =0 _ p =(jEj2)x i _ E =qE 9 gt; gt; = gt; ; ) 8 gt; gt; lt; gt; : qn+1 =qn pn+1 =pn + k(jEnj2)x En+1 = exp(?iqnk)En If ekXN cannot be found, or if H is not separable into parts which can be conveniently integrated, then an explicit symplectic integrator is usually not available. Instead one turns to the midpoint rule M2 (see Table1 ). A generalization of M2 is that the Gaussian Runge- Kutta (GRK) methods (which have s intermediate unknowns and order 2s) are also symplec- tic.... ..."

Cited by 21

### Table 2.1: The Mapping Between Linear Logic Operators and Lolli Syntax

2002

### TABLE II GAIN DEFINITIONS FOR DIFFERENT METRICS AND LINEAR MAPPINGS OF LPC BASED METRICS D TO THE CEPSTRAL DISTANCE Dcep. THE SYMBOLS ARE USED IN THE SCATTER PLOT FIGURE 6. Metric Gain [dB] Mapping function Symbol

2004

Cited by 1