### Table IX Tests for nonnegative expected returns

2000

Cited by 20

### Table 4 Chromosome 8, X, and Y Aneuploidies in Peripheral Lymphocytes of 10 Male Donors

### Table 1. A summary of certain non-negative integer parameters

"... In PAGE 24: ... The next lemma involves four of the seven parameters 1{ 5, s, and t. In Table1 , which appears below, these seven parameters are summarized. 11.... In PAGE 26: ...Table 1. A summary of certain non-negative integer parameters In Table1 , for easy reference, we have summarized information about the seven parameters 1{ 5, s, and t each of which must be a non-negative integer. Four of these parameters, t, 1, 4, and 5, change their values according to the case we are in.... ..."

### Table 1. A summary of certain non-negative integer parameters

"... In PAGE 26: ... The next lemma involves four of the seven parameters 1{ 5, s, and t. In Table1 , which appears below, these seven parameters are summarized. 12.... In PAGE 27: ... = 1. By Lemmas 7.1, 7.2, and 7.3, in every case, J2 2 G;(H0 2). In Table1 , for easy reference, we have summarized information about the the seven parameters 1{ 5, s, and t each of which must be a non-negative integer. Four of these parameters, t, 1, 4, and 5, change their values according to the case we are in.... ..."

### Table 1: Minimax thresholds for non-negative garrote.

"... In PAGE 9: ... The minimax thresholds for the soft shrinkage were derived in Donoho and Johnstone (1994); the minimax thresholds for the hard shrinkage were computed by Bruce and Gao (1996b); and the minimax thresholds for the rm shrinkage can be found in Gao and Bruce (1997). The minimax thresholds for the non-negative garrote were computed from (14) and tabulated in Table1 . The values in Table 1 were computed using a grid search over with increments = 0:00001.... In PAGE 9: ... At each grid point, the supremum over was computed using Splus non-linear minimization function nlmin(). The obtained minimax bounds are also listed in Table1 and plotted along with minimax bounds for the soft, the hard and the rm in Figure 2. The minimax bounds for the soft, the hard and the rm are all listed in Table 1 of Gao and Bruce (1997).... In PAGE 9: ... The obtained minimax bounds are also listed in Table 1 and plotted along with minimax bounds for the soft, the hard and the rm in Figure 2. The minimax bounds for the soft, the hard and the rm are all listed in Table1 of Gao and Bruce (1997). From Figure 2, we can see that garrote has tighter minimax bounds than both the hard and the soft shrinkage rules, and comparable to the rm shrinkage rule.... ..."

### Table 1: 2-letter graphs (p and q denote nonnegative integers).

"... In PAGE 8: ...3 An overview of 2-letter graphs Theorem 4 G2 = T [ U [ U. Proof: Table1 gives an overview of the 16 possible classes of 2-letter graphs over = fa; bg, their minimal forbidden induced subgraphs, and their census. As Kp; Kp; Kp +... In PAGE 9: ... 2 Corollary 4 Obs(G2) is nite. Proof: From Theorem 4 and Table1 it follows that the graphs not in G2 have at least one induced subgraph in each of the sets fC4; P4; C4g, fK3; C4; C5g, and fK3; C4; C5g. Check- ing all 27 combinations and discarding redundant ones we see that such graphs contain at least one of the following seven sets of induced subgraphs: fC4; C4g, fK3; C4g, fC4; C5g, fK3; K3; P4g, fP4; C5g, fK3; C4g, fC4; C5g.... ..."

### Table 1: 2-letter graphs (p and q denote nonnegative integers).

"... In PAGE 5: ...3 An overview of 2-letter graphs Theorem 4 G2 = T [ U [ U. Proof: Table1 gives an overview of the 16 possible classes of 2-letter graphs over = fa; bg, their minimal forbidden induced subgraphs, and their census. As Kp; Kp; Kp + qK1; Kp + qK1 2 T , Kp + Kq 2 U, and Kp;q 2 U, the theorem follows.... In PAGE 6: ...Proof: From Theorem 4 and Table1 it follows that the graphs not in G2 have at least one induced subgraph in each of the sets fC4; P4; C4g, fK3; C4; C5g, and fK3; C4; C5g. Checking all 27 combinations and discarding redundant ones we see that such graphs contain at least one of the following seven sets of induced subgraphs: fC4; C4g, fK3; C4g, fC4; C5g, fK3; K3; P4g, fP4; C5g, fK3; C4g, fC4; C5g.... ..."

### Table 1: A doubly infinite array of nonnegative integers.

"... In PAGE 1: ... 1. Introduction Consider a doubly in nite array (matrix) A = fAn j : 0 j; n 1g of nonnega- tive integers whose rst few entries are displayed in Table1 . To de ne its formation rule, we introduce a little notation.... ..."

### Table 1: A doubly infinite array of nonnegative integers.

"... In PAGE 1: ... 1. Introduction Consider a doubly in nite array (matrix) A = fAn j : 0 j; n 1g of nonnega- tive integers whose rst few entries are displayed in Table1 . To de ne its formation rule, we introduce a little notation.... ..."

### Table 1: A doubly infinite array of nonnegative integers.

"... In PAGE 1: ... 1. Introduction Consider a doubly in nite array (matrix) A = fAn j : 0 j; n 1g of nonnega- tive integers whose rst few entries are displayed in Table1 . To de ne its formation rule, we introduce a little notation.... ..."