### Table 4: Parameters and distributions for synthetic tri-partite graphs

"... In PAGE 8: ... The synthetic tri-partite graphs are generated similarly to the bi-partite graphs. The distributions and parameters are documented in Table4 . Let V1 denote the central type nodes.... In PAGE 8: ... Let V1 denote the central type nodes. In Table4 , S(12) denotes the true means of distri- butions for generating the links between V1 and V2, and similarly for S(13). The numbers of clusters for each type of nodes are given by dimensions of S(12) and S(13) and each cluster has 100 nodes.... In PAGE 8: ... The numbers of clusters for each type of nodes are given by dimensions of S(12) and S(13) and each cluster has 100 nodes. In Table4 , TP-large is a large graph with 20 clusters of V1, 20 clusters of V2, and 18 clusters of V3 (due to the space limit, the details of parameters are omit-... ..."

### Table 3: The document structure engendered by the partitioned graph.

"... In PAGE 9: ... (Each run took approximately 10 seconds on an HP 9000/735 workstation.) Three of these runs produced the same partitioning, one with a cut-set size of 220 (see Fig- ure 7), which results in the document structure summarized in tabular form in Table3 and depicted graphically in Figure 8. The document structure found for this simple example re- sembles the ones usually used in actual ATMs: the initial page presents the welcome message and contains a menu of all available transactions; the other pages contain the DIs necessary for these transactions, along with a link back to the initial page.... ..."

### Table 3: The document structure engendered by the partitioned graph.

1995

"... In PAGE 11: ... #28Each run took approximately 10 seconds on an HP 9000#2F735 workstation.#29 Three of these runs produced the same partitioning, one with a cut-set size of 220 #28see Fig- ure 7#29, which results in the document structure summarized in tabular form in Table3 and depicted graphically in Figure 8. The document structure found for this simple example re- sembles the ones usually used in actual ATMs: the initial page presents the welcome message and contains a menu of all available transactions; the other pages contain the DIs necessary for these transactions, along with a link back to the initial page.... ..."

Cited by 1

### Table 3: The document structure engendered by the partitioned graph.

1995

"... In PAGE 9: ... #28Each run took approximately 10 seconds on an HP 9000#2F735 workstation.#29 Three of these runs produced the same partitioning, one with a cut-set size of 220 #28see Fig- ure 7#29, which results in the document structure summarized in tabular form in Table3 and depicted graphically in Figure 8. The document structure found for this simple example re- sembles the ones usually used in actual ATMs: the initial page presents the welcome message and contains a menu of all available transactions; the other pages contain the DIs necessary for these transactions, along with a link back to the initial page.... ..."

Cited by 1

### Table 4: Graph Partitioning: Experimental Results

in Localizer

"... In PAGE 33: ...3 Graph Partitioning The problem has been studied experimentally in [3] and, once again, the experiments re- ported here are based on a similar setting. Table4 depicts the experimental results of Localizer. The rst row gives the setting of our parameters: T is the starting tempera- ture, TF is the percentage of reduction of the temperature, SF is the size factor and the remaining two were described previously.... ..."

### Table 2: Summary of the synthetic graphs Graph Parameter n k distribution

"... In PAGE 5: ... We use synthetic data to simulate graphs whose edge weights are under normal and poisson distributions. The dis- tribution parameters to generate the graphs are listed in the second column of Table2 as matrices. In a parameter matrix P, Pij denotes the distribution parameter that generates the edge weights between the nodes in the ith partition and the nodes in the jth partition.... ..."

### Table 3. Optimal distribution on a cluster of eight two way SMPs using graph partitioning

"... In PAGE 4: ...44 To understand the effectiveness of the assignment, it is now attempted to obtain an optimal task assignment on the same cluster using graph partitioning using a standard graph partitioning tool like Metis. Table3 shows the details of the distribution. For this distribution, each module is assumed to be represented by a vertex with a ... ..."

Cited by 1

### Table 1: Reachability Graph Sizes for the Distributed Data Base Model

"... In PAGE 15: ... amp; Gluconeogen., A 7 551 59 524 1 579 Glycolysis C 7 551 7 705 78 Glycolysis amp; A 5 051 42 351 1 070 Citric Acid Cycle C 5 050 5 154 69 Table1 : Performance flgures for models A and C processes. Before presenting performance flgures of a few typical simulation runs, it should be emphasized that the simulations have been performed on a Power Macintosh G3 under OS 8 using Design/CPN 3.... In PAGE 15: ...S 8 using Design/CPN 3.0.5. Hence, we did neither proflt from more powerful computers nor from the improved versions of Design/CPN developed recently by the CPN group in Aarhus. Table1 originates in the simulation of three difierent pathways: { (textbook) glycolysis, { glycolysis, then combination of glycolysis and gluconeogenesis, then again glycolysis, { combined glycolysis and citric acid cycle. Each pathway has been simulated, under identical conditions, with the models A and C.... In PAGE 110: ...4 , several versions of the RSVP model were introduced. Table1 compares these models in terms of the size of the (full) occurrence graphs (number of nodes and arcs), the time it took to generate them, and the size of the strongly connected component (SCC) graphs. Each node of the SCC graph includes all markings, which are mutually reachable from each other [10][13].... In PAGE 111: ... The maximal number of messages is 3 for the Dowstream communication places (SOutgoingMsgs and RIncomingMsgs) and 2 for the upstream communication places (SIncomingMsgs and ROutgoingMsgs). Those results are in alignment with figure 3 except that ResvConf and PathErr OCC graph SCC graph Model Nodes Arcs Secs Nodes Arcs Secs ResvSetup 11 10 0 11 10 0 ResvSetup WithErrors 17 16 0 17 16 0 PathTear 67 105 0 67 105 0 ResvTear 182 400 0 182 400 1 Refresh 613 3584 6 10 379 0 RSVP 13570 96837 536 2601 43493 69 RSVP (with multiple sessions) 24576 199360 18105 1 0 988 Table1 : A comparison of several versions of RSVP model. Home Markings [6] Dead Markings [6] Dead Transitions Instances None Live Transitions Instances None Table 2: Home and liveness properties.... In PAGE 140: ... All interactions among tasks are based on mailbox communications. Table1 lists the acronyms used in the paper for the di erent tasks, and for each task lists howmany copies of that task there are in a LV that serves n applications. The OV behaviour is described by a state diagram in the speci cation document, that basically amounts to a 2-out-of-3 voting.... ..."