### Table XIa. Referrer sources in 2000.

2002

Cited by 4

### Table 2. The returns to computer skills in the United Kingdom in 1997

in Luc Soete

"... In PAGE 8: ... One of the few studies based on direct measures of computer skills, by Borghans and Ter Weel (2000a), using evidence from a survey carried out in the United Kingdom in 1997, groups people by computer skills (from very high to very low). It turns out that everyone appears to receive approximately the same computer wage premium (see Table2 ). As a matter of fact, individuals with average computer skills receive the highest computer wage premium.... ..."

### Table 6 gives a translation of the hygienic primitives to the core calculus. The primitives only mark objects that are declared part of the protocol. The end of the protocol triggers a collection. Note that the translation has been set up to prevent a process from calling the collector with an arbitrary name. It enforces static scoping of protocol names. An example of a small protocol is (newprot a)?out h` : xia j in h` : ?i y : endprot a

1999

Cited by 3

### Table 1 Combined summary of transcriptome and both isotopic peak height analysis and spectral counting analysis for the proteome for S40/S2 expression ratios. The number of ORFs in each category are shown: up = significantly higher expression in S40 compared to S2; down = significantly lower expression in S40 compared to S2.; no change = no significant difference; NP = not probed in microarrays; ND = not detected using proteomics. The total number of ORFs in the annotated M. maripaludis genome25 is 1722. Portions of this table have been reproduced from Xia et al.8 with permission of the ASBMB

2006

"... In PAGE 5: ... Using the 95% significance cutoff, 33 M. maripaludis proteins were found to be differentially expressed between S2 and S40 ( Table1 and Fig. 2).... ..."

### Table 1 shows the numbers of iterations required to attain di erent relative residual norms (i.e., ATXi + XiA + BBT F = BBT F tol with tol = 10?4; 10?6; : : :). It reveals two facts. First, the convergence is very slow for l = 1, which corresponds to the Smith method, but a moderate increase of l (say l = 4) accelerates it to a high degree. Second, the speed of convergence is hardly improved by a further increase of l. In fact, this experiment and a number of further tests not reported here indicate that a relatively small number of di erent ADI parameters is su cient to achieve rapid convergence of ADI.

1998

"... In PAGE 4: ... After that we compute sets of optimal shift parameters for several values of l by an algorithm due to Wachspress [Wac63, Section 2]. Table1 : ADI applied to Example 1. Numbers of iterations required to attain di erent relative residual norms depending on the number of di erent shift parameters.... ..."

Cited by 44

### Table 2: Results and Comparisons (t: reported based on transformed formulation; o: recounted based on original formulation; *: Sun Ultra station-1 ; **: HP-C160 workstation)

"... In PAGE 5: ... The MILP problems are solved using CPLEX, a branch and bound method. Table2 shows the results of the proposed formulation compared with the results found in literature. Xia and Macchietto (1997) transformed the formulation they presented into an alternative one without giving the necessary details of the transformation.... ..."

Cited by 2

### Table 1: Chinese Financial System

"... In PAGE 8: ... Some operated at a national level, others in regional niches. None presently threaten the dominance of the four major banks ( Table1 ).14 Additional entrants included three smaller national banks (Everbright, Hua Xia, and Min Sheng) and a number of regional banks that opened in 1987-88.... ..."

### Table 7 assesses the signal compression of the three noiseless signal functions using the ve di erent preprocessing methods. The measure of compression used was to count the number of non-zero coe cient elements in the wavelet decomposition, arbitrarily regarding any coe cient element less than 10?5 as zero. The repeated signal gives many more nonzero coe cients than any of the pre lters since the decomposition has twice as many coe cients. The best overall performance is attained by the Minimal and interpolation pre lters. Because the identity pre lter has degree 0 it gives very poor signal compression.

1998

"... In PAGE 27: ...Table7 : Signal compression using di erent preprocessing methods No. of elements with magnitude gt; 10?5 Signal Blocks Bumps Heavisine Interpolation 258 1145 1180 Repeated Signal 1610 3501 4086 Minimal 246 1200 1238 Xia 246 1596 2034 Identity 856 1736 2003 Pre lters can be categorised according to their length and degree.... ..."

Cited by 23

### Table 2: MSE for the TI multiwavelet bivariate thresholding with di erent pre lters Bumps SNR

1998

"... In PAGE 10: ... The pre lters used in our experiments are Identity, Xia, Minimal, and Repeated row. From Table2 one can see that the repeated row pre lter yields the smallest MSE for all four signals. We also test the TI multiwavelet bivariate de-noising for di erent SNR apos;s.... ..."

Cited by 5

### Table 1: Diversity product comparison Constellations 4-QAM 8-QAM 32-QAM

2005

"... In PAGE 27: ... The corresponding diversity products are listed in Table 1. In Table1 , we also listed the optimal diversity products using the optimal rotations of half complex symbols obtained in Su-Xia [26] where only complex symbol pair-wise ML decoding is possible. The numbers of trials of their ML decodings are listed in Table 2.... ..."

Cited by 4