### Table 4. Number of abnormal neurotologic fi ndings in each patient group.

"... In PAGE 39: ... 12. Neurotologic tests We examined the 36 patients with common types of migraine, the family with episodic ataxia type 2 (N=12), and the family with familial hemiplegic migraine type 2 (N=9) by a neurotologic test pattern (see Table4 ). The results were compared to those of healthy controls.... In PAGE 39: ...1. Subclinical vestibulocerebellar dysfunction in the common types of migraine In neurotologic tests, 30 of 36 patients (83%) had abnormalities ( Table4 ). Of the 36 pa- tients, 16 (44%) had abnormalities in one, while 14 patients (39%) had abnormalities in more than one test.... ..."

### Table 3: Algorithm G2 for m = 5 with NP = 5000. Each node of the search tree represents a partial permutation [fi1; fi2; : : : ; fik], where 1 i1 lt; i2 lt; lt; ik N. The children of the node [fi1; fi2; : : : ; fik], are given by the set

"... In PAGE 16: ... The tables indicate that the SAC is a very restrictive property. For example in Table3 , from 40,000 functions, only 63 out of 5000 runs failed to result in the greedy algorithm nding a maximally nonlinear permutation. When a maximally nonlinear permutation was found, approximately 9,100 functions from were examined.... In PAGE 17: ... In Table 5, N = 16000 functions were required to nd a 5-bit permutation that satis ed the SAC and was maximally nonlinear on almost every run using the branch-and-bound strategy. From Table3 we see that for... ..."

### Table 7: Random problem instance with coverage 3, 21 clones, 0.7% false positives, 10% false negative. SIR-separation is done with facets fiT x fi 0, \cycles quot; denotes the separation of cycle inequalities, and \integer quot; means that in- feasible 0/1-vectors are cut o .

1998

"... In PAGE 31: ... Nevertheless, cycle separation (and integer vector separation) might be important for nding feasible solutions. Table7 illustrates this on a typical problem instance. The table shows the results of solving this problem by using di erent strategies.... ..."

Cited by 3

### Table 1 FI examples

2004

"... In PAGE 7: ...eaction. To our knowledge, this is a new resolution method the present article introduces. Policy 2, applies on the interactions #1 and #2. In Table1 , the restricted actions are underlined. Notice that, in interaction #2 example, restriction is applied if caller.... ..."

Cited by 1

### Table 1: Key ndings of this paper

### Table 1 Technical constants

2000

"... In PAGE 18: ...mplicit elements, i.e. the bond element, the bonus option, and the possible surrender option. As explained in the previous section, there are also a number of technical constants to be specified before running the algorithm. We shall not dwell on the considerations made in this respect but merely note that a large number of experiments have resulted in the values shown in Table1 being used globally in the implementations. The finite difference scheme was coded in Pascal and run on an HP-9000 Unix machine.... ..."

Cited by 1

### Table 2: Technical Specifications

### Table 1: Technical Workpackages

in Content

1998

"... In PAGE 21: ... E-HFETs in the InP material system are a critical issue because of the low Schottky barriers available. The layer structure of an E-HFET for digital applications is given in Table1 . In the InAlAs Schottky barrier layer 8 ML AlAs are inserted and the sheet doping density is reduced to 2.... ..."