### Table 2. Finding all solutions to Langford apos;s problem.

2000

"... In PAGE 3: ... Table 1 shows the number of backtracks (fails) and approximate running time, on a dual processor 666MHz PIII, in nding all non-symmetric solutions to the n-queens problems with 10 n 15. Table2 gives the same data for nding all solutions to Langford apos;s problem (or proving that there is no solution, for the (3,11) and (3,12) instances) on a 166MHz Pentium PC. The `combined apos; model in each table is the minimal combined model.... In PAGE 4: ... Table 3 shows the results of using the pi variables, the dj variables or both, as the search variables in Langford apos;s problem. The number of fails in the second row is the same as in the last row of Table2 : as shown in [6], adding the channelling constraints to an allDi erent constraint gives no bene t, and the additional overhead leads to increased running time. Clearly, if the dual variables are used as search variables, the channelling constraints are needed to link the two sets of variables, even with the allDi erent constraint.... ..."

Cited by 29

### Table 1. Variables defined and used at the nodes of the data flow digraph shown in Fig. 1.

"... In PAGE 5: ... For example, at node o2, the variable ReqQos is used in the output statement Output connect(ReqQos). Table1 lists the variables defined and used in Fig. 1.... In PAGE 6: ... For example, consider Fig. 1 and Table1 . The variable ReqQos and nodes a4 and o2 form a du-pair du(a4, o2, ReqQos) because the variable can be traced by the de- fine-clear- use path [a4, p2, o2], where the variable ReqQos is defined exclusively at node a4 and used at node o2.... In PAGE 7: ...ONreq.qosdef) is added to nodes i11 and i12 in Fig. 2 because the variable CONreq.qos is defined at node i1 in Fig. 1 (see Table1 ). The second step involves finding executable test paths in Fig.... In PAGE 7: ...s defined at node i1 in Fig. 1 (see Table 1). The second step involves finding executable test paths in Fig. 2 that can trace the du-pairs in Table1 , as indicated in Table 2. Consider the du-pair du(J, K, X), where variable X is defined at node J and used at node K.... In PAGE 9: ... For example, to trace the du-pair du(i1, a4, CONreq.qos) in Table1 , where CONreq is defined at node i1 and used at node a4, we find the specific shortest paths which start at nodes i11 and i12 and end at nodes a41 and a42 in Fig. 2.... In PAGE 10: ... The Selecting Chinese Postman Tour in Fig. 3, [s1, a1, a2, a3, s2, i11, 1, a41, 11, o1, s2, i11, 2, p1, o1, s2, i12, 1, a42, 10, a6, (13, 12), o6, s4, i4, o4, s1, a1, a2, a3, s2, i12, 3, p2, o21, s31, i3, 4, a6, 12, o5, s4, i4, o4, s1, a1, a2, a3, s2, i12, 1, a42, 9, o22, s32, i22, p32, a52, o23, s33, i23, p4, o3, s1, a1, (6, 5), a51, 7, p32, a52, 8, p4, o3, s1, a1, a2, a3, s2, i12, 3, p2, o21, s31, i3, 4, a6, 12, o5, s4, i4, o4, s1] is used to generate the minimum-length executable test sequence [i11, o1, i11, o1, i12, o21, i3, o5, i5, o6, i4, o4, i12, o21, i3, o5, i4, o4, i12, o21, i21, o22, i22, o22, i23, o3, i12, o21, i21, o22, i22, o23, i23, o3, i12, o21, i3, o5, i4, o5], which traces all the du-pairs in Table1 . Formally, the algorithm for steps 2 to 4 is described as follows.... ..."

### Table 2: Programming score correlations with digraph type, Java students

2005

"... In PAGE 4: ...Table2 gives the results of the correlations of latency with programming scores, and a scatter diagram for the E digraph is in Figure 3. We chose a significance factor of p=0.... In PAGE 4: ... For the other types, it appears that a reasonably large sample has been obtained. Turning to the correlations in Table2 , hypothesis 2 is supported by the result for browsing, B, digraphs. There is no case to reject the null hypothesis that they are independent.... ..."

Cited by 1

### Table 3. The io-chains for the data flow digraph in Fig. 1.

"... In PAGE 13: ... 1 obtained from these specific shortest paths in Fig. 3 are shown in Table3 , where each io-chain is given a label. Table 3.... In PAGE 13: ...The second step involves constructing the SelectIO Digraph in Fig. 4 by embedding the executable test paths in Table3 into the Behavior Machine Digraph in Fig. 2.... In PAGE 13: ... 2. Gener- ally, an executable test path listed in Table3 which starts from input node J and ends at output node K is embedded as a bold edge from vertex J to vertex K. The label which ... In PAGE 13: ...he executable test paths in Table 3 into the Behavior Machine Digraph in Fig. 2. Gener- ally, an executable test path listed in Table 3 which starts from input node J and ends at output node K is embedded as a bold edge from vertex J to vertex K. The label which represents the io-chain traced by the executable path is put on the edge (see Table3... In PAGE 14: ...ig. 4. The SelectIO digraph constructed from the behavior machine digraph in Fig. 2 by embed- ding the io-chains in Table3 as bold edges. Fig.... ..."

### Table 2: Number of unlabeled acyclic digraphs on n = 1, : : : , 9 vertices

2000

"... In PAGE 8: ... Robinson also looked at the problem of enumerating unlabeled acyclic digraphs [21]. Randomly generating unlabeled acyclic digraphs would perfectly t the needs of Graph Drawing, since the labels serve no particular purpose here; moreover, the number of unlabeled struc- tures are way below those stated in Table 1 (see Table2 below). However, this is in general a more di cult problem since it involves dealing with the symmetry group of the underlying structures.... ..."

### Table 4. component relationship among digraph, block, and digcell models component of

"... In PAGE 25: ... Differences among digraph, block, and digraph-cell models Digraph Block Digcell Addressing scheme Port based Address based mixed (port + address) Children information Variable: components Variable: components Variable: components Boundary Information None Variable size None Coupling information Variable: Coupling Variable: Coupling Variable: Coupling Coupling method One-to-one add_coupling(d1,p1 ,d2,p2) One-to-many add_coupling(p1,p2) One-to-one add_coupling(d1,p1,d2,p2) One-to-many add_coupling(p1,p2) In terms of Coupling relationship between influencees and receivers, both digraph and digcell models map one source to one destination, while block models support many-to-many coupling. As shown in Table4 , both digraph and digcell models can keep atomic models, block models, and digraph models as their components in hierarchical fashion; while cell, block and digcell models, each having its own address (location), can become components of a block model. Table 4.... ..."

### Table B.2: Largest known symmetric ( , D) digraphs built from semi-direct products of cyclic groups.

1991

Cited by 8

### TABLE 4. PCR product lengths of STR loci in various isolates

2003

### Table 1 Oligonucleotides for determining Rb LOH Primer no. Locus Polymorphism type Product size (bp) Primer sequence

"... In PAGE 2: ... PCR-based RFLP Analysis of Rb Allelic Status. The primer sets used in this study are listed in Table1 . PCRs were carried out in a reaction volume of 25 ml with 800 nM each primer, 250 mM dNTP, 1.... ..."