Results

**1 - 9**of**9**### Table 4.1: Spending on Maintenance of Social Assets by the Vladimir Tractor Plantin

"... In PAGE 17: ... But the attitude towards din0berent kinds of social activ- ities is the same. As one can see from Table4 , social functions associated with holding social assets are considered byenterprise managers as the most din0ecult ones. Social func- tions associated with provision of non-wage benen0cts including those in kind but which... In PAGE 18: ...transportation subsidies, direct distribution of commodities produced by the enterprise itself or received through barter at subsidized pricesn29 constitute a much less burden than the former ones. For example, Table4 shows that in general it is much more easy for en- terprises to compensate their workers for resort recreation in cash than to hold recreation facilities themselves. In addition, there is a din0berent attitude towards two din0berent groups of social assets.... In PAGE 52: ...Table4 : The Most and the Least Problematic Types of Benen0cts as Assessed byEnterprise Managers Among 3 of the Most Among 3 of the Most Din0ecult Benen0cts Easy Benen0cts to to Provide Provide Type of Benen0ct n28Number of Responsesn29 n28Number of Responsesn29 Kindergartens 15 0 Housing 10 0 Dormitories 7 0 Recreation facilities 5 0 Canteen with subsidized prices 5 3 Compensation for resort recreation 2 3 Sport facilities 2 4 Cultural center 1 0 Healthcare facilities 1 5 Food shop with subsidized prices 0 2 Transportation subsidy 0 2 Commodities on subsidized prices 0 6 Total number of responses: 24. Source: Enterprise survey.... ..."

### Table 1: A sample of the 84;694 word pairs from

1997

"... In PAGE 4: ... For a concrete example, if s i =Vladimir and t i =Gennady, then f i = 1 if and only if Vladimir appeared in the past N words and the currentword w is Gennady. Consulting Table1 , we see that in the BN corpus, the presence of Vladimir will boost the probabilityofGennady by a factor of 19:6 for the next N = 500 words. 3.... ..."

Cited by 42

### Table 2. Summary of MHCPEP contents

1994

"... In PAGE 3: ... For queries and comments regarding the MHCPEP database contact Vladimir Brusic (preferably by electronic mail) at the address given at the start of this paper. FURTHER DEVELOPMENTS A summary of MHCPEP contents is given in Table2 . The growing numbers of peptides known to bind to a specific MHC molecule facilitates building of predictive models for determina- tion of novel T-cell epitope candidate peptides.... ..."

Cited by 4

### Table 1: Author ranking result in network 2. marginalized ran-

2006

"... In PAGE 7: ....2.2. Ranking in Citation Networks Table1 lists the ranking results of authors with respect to Vladimir Vapnik in the second citation network. The information from the citation links moves some authors|Chris Burges, Bernhard Scholkopf, Olivier Chapelle and Alex Smola|to higher ranking positions than only using author-paper relationships.... ..."

Cited by 1

### Table 3. Author ranking result in network 2.

2006

"... In PAGE 10: ... With the help of author-paper relationships, the relationship between the labeled paper and other papers become more clear thus lead more accurate ranking results. For problem (2b), Table3 lists the ranking results of authors with respect to Vladimir Vapnik in the second citation network. The information from the citation links moves some authors|Chris Burges, Bernhard Scholkopf, Olivier Chapelle and Alex Smola|to higher ranking positions than only using author- paper relationships.... ..."

Cited by 1

### Table 2: Simulation Experiment Parameters The results of the ten experiments, summarized in Tables 3{21, show that there are substantial performance di erences among the algorithms. Many of these di erences are accentuated under particular circumstances. The worst correlation between two algorithms was a rank correlation coe cient of 0.28 in experiments 3 and 10, in both cases between SOK1 and LSI. The highest correlation between LSI and another algorithm was 0.73 in experiment 8. Typical correlations between LSI and the other three algorithms were in the neighborhood of 0.4. The correlations among the SOKx algorithms and DCB tended to be higher, which is not surprising given that the SOKx approaches are perturbations on the DCB algorithm, rather than an entirely di erent ap- proach as is LSI. Although these positive correlations are encouraging, given 16

"... In PAGE 17: ....2.2 Results We varied three parameters in the simulations: the number of rows and columns in the K matrix, the density of ones in the K matrix, and the number of singular values retained in the LSI calculations. Table2 show the ten experiments we performed and the associated parameter values.... In PAGE 22: ...37 LSI 1.0 Table2 0: Simulation Experiment 9: Correlations part of the Coast Guard project, uses the DCB algorithm on the associated texts in order to perform ranked retrieval (with semantic latency) for users apos; queries. Operation of the PIRS software is described in [14].... In PAGE 32: ...4 LSI 1.0 Table2 1: Simulation Experiment 10: Correlations [19] Eric W. Stein and Vladimir Zwass.... ..."

### Table 2. Average Meteorological Statistics During Accumulation Period of Expeditionary Observations in 1990 at 3400 m, Hailougou Glacier

1996

"... In PAGE 8: ...Vladimir Aizen and Elena Aizen, John Melack, Tonu Martma 9192 According to meteorological data from the Hailougou glacier the summer accumulation period could be divided into two periods: before and after October 8. The wind direction changed from SE to SW and S on October 8 (Figure 6a), and this was accompanied by some changes in meteorological characteristics ( Table2 ). During the first period when the southeastern component of wind direction prevailed, a continuous uplift of air from the valley along the glacier took place day and night (Figure 8a).... In PAGE 8: ...3 m.s-1 ( Table2 ). The diurnal changes of day-night wind speed was muted (Figure 8b).... In PAGE 8: ... In the second period the intensity of short-wave radiation increased because of less cloudiness (Figure 8f). However, the total radiation balance decreased in the second period ( Table2 ). Mean humidity was about the same during these two periods (Table 2), but variations were more pronounced during the first period (Figure 8e).... ..."

Cited by 1

### Table 1: Minimal length f2(K) of any [N; K; D] binary intersecting code. The entries for K 6 are exact while the remaining entries give upper bounds on f2(K). Explicit codes are known in every case.

"... In PAGE 7: ...issing, the following entry should be used. Explicit arrays are known in every case. It follows from (12) that the entries in Table 3 for n 11 are exact. However, the author expects that most of the other entries (as well as those in Table1 ) can be considerably improved, and o ers these tables as a challenge to the reader. Acknowledgements I should like to thank David Applegate, Aart Blokhuis, Andries Brouwer, G erard Cohen, John Conway, Bill Cook, J anos Korner, Donald Kreher, Simon Litsyn, Colin Mallows, Klaus Metsch and Vladimir Tonchev, all of whom have contributed to this paper.... In PAGE 12: ...[49] shows that f(K) = c2K(1+o(1)) can be achieved by Goppa codes (although his argument is also nonconstructive). Table1 gives the best upper bounds presently known on f2(K) for small values of K. For K 6 the values of f2(K) are easily proved to be optimal, using Theorems 1(i), 2(ii), 2(iii), and the bounds on the minimal distance of binary linear codes given in [58].... In PAGE 12: ...Two of the best codes in Table1 are duals of BCH codes. It seems likely that the duals of some longer BCH codes will also provide good intersecting codes.... In PAGE 12: ... 280) to guarantee that the weights satisfy condition (iii), but unfortunately the resulting codes are quite weak. Generator matrices for some of the other codes mentioned in Table1 are given in Table 2. If the generator matrix has the form [A I] then Table 2 gives the rows of A in hexadecimal.... In PAGE 12: ... If the generator matrix has the form [A I] then Table 2 gives the rows of A in hexadecimal. The remaining codes in Table1 may be obtained from the author.... ..."

### Table 1: Minimal length f2(K) of any [N; K; D] binary intersecting code. The entries for K 6 are exact while the remaining entries give upper bounds on f2(K). Explicit codes are known in every case.

"... In PAGE 7: ...issing, the following entry should be used. Explicit arrays are known in every case. It follows from (12) that the entries in Table 3 for n 11 are exact. However, the author expects that most of the other entries (as well as those in Table1 ) can be considerably improved, and o ers these tables as a challenge to the reader. Acknowledgements I should like to thank David Applegate, Aart Blokhuis, Andries Brouwer, G erard Cohen, John Conway, Bill Cook, J anos Korner, Donald Kreher, Simon Litsyn, Colin Mallows, Klaus Metsch and Vladimir Tonchev, all of whom have contributed to this paper.... In PAGE 12: ...[49] shows that f(K) = c2K(1+o(1)) can be achieved by Goppa codes (although his argument is also nonconstructive). Table1 gives the best upper bounds presently known on f2(K) for small values of K. For K 6 the values of f2(K) are easily proved to be optimal, using Theorems 1(i), 2(ii), 2(iii), and the bounds on the minimal distance of binary linear codes given in [58].... In PAGE 12: ...Two of the best codes in Table1 are duals of BCH codes. It seems likely that the duals of some longer BCH codes will also provide good intersecting codes.... In PAGE 12: ... 280) to guarantee that the weights satisfy condition (iii), but unfortunately the resulting codes are quite weak. Generator matrices for some of the other codes mentioned in Table1 are given in Table 2. If the generator matrix has the form [A I] then Table 2 gives the rows of A in hexadecimal.... In PAGE 12: ... If the generator matrix has the form [A I] then Table 2 gives the rows of A in hexadecimal. The remaining codes in Table1 may be obtained from the author.... ..."

**1 - 9**of

**9**