### Table 3 shows the many-to-many relationship for one Key Practice. In order to ensure the absence of ambiguity and to simplify the task of translation of results, it may be necessary to explore the possibility of further decomposing the key practices, ideally to arrive at a one-to-many relationship to the elements of the reference model.

"... In PAGE 10: ... Thus, individual key practices may relate to multiple elements of the reference model; in addition, more than one key practice is frequently found to be related to a single 15504 element. Table3 - Relationship between CMM and 15504 basic elements... In PAGE 11: ... Table3 will demonstrate the possibilities. 6.... ..."

### Table schemes are connected with lines, which express many-to-many

1999

Cited by 1

### TABLE I COMPARISON OF SECURE MANY-TO-MANY MULTICAST PROTOCOLS

### Table 2: One-to-One, Many-to-One, and Many-to-Many CBR Traffic Flows

2003

"... In PAGE 8: ... These flows are chosen to mimic periodic point-to-point communication expected in such systems. The details of these flows, including sending and receiving nodes, flow rates, the number of packets sent, and the state space of exploration, are provided in Table2 . For each configuration we average 60 runs with different random seeds to ensure adequate confidence of our results.... In PAGE 9: ... This traditional scenario shows that IGF performs as well or better than GF, DSR, and LAR, even when mobility and energy conserving sleep cycles are not considered. In these tests the aforementioned flows ( Table2 ) are simulated, increasing the rate of transmission until sufficient congestion is seen. Because the One-to-One, Many-to-One, and Many-to-Many configurations all produce similar results, we only show graphs for the more complex and interesting Many-to-Many flows.... ..."

Cited by 20

### Table 2 - Objective Characteristics of Media

"... In PAGE 10: ... While objective characteristics, of course, do not enable the media to be compared with respect to psychological dimensions such as communication needs, social presence, or control, they do permit a relatively error free classification. Thus, Table2 characterizes 35 traditional and new media with respect to seven objective characteristics. We have already discussed person-interaction and machine- interaction, and the distinction between the one-to-many/one-to-few (Figure 1), one-to-one/few to few (Figure 2) and many-to-many (Figure 3) communication models.... In PAGE 13: ... email telephone face-to-face (group) town meeting CU See Me MUDs/multi-party chat IRC WWW forms WWW Radio videotex online services videophone voicemail face-to-face Usenet/talk/ mailing lists magazines billboards newspapers direct mail satellite TV 500 channel TV broadcast TV cable TV ITV CDI local hypermedia IMPERSONAL PERSONAL DYNAMIC STATIC WWW (+video) fax/mail Figure 5 - Media Typology Based Upon Objective Characteristics resulting from a nonlinear principal components analysis (NPCA) (Gifi 1990) of the data from Table2 . NPCA is equivalent to multiple correspondence analysis (Hoffman and de Leeuw 1992) with ordinal restrictions imposed upon category quantification of variables assumed to have a known underlying ordering of categories3.... In PAGE 13: ... NPCA is equivalent to multiple correspondence analysis (Hoffman and de Leeuw 1992) with ordinal restrictions imposed upon category quantification of variables assumed to have a known underlying ordering of categories3. To simplify presentation, only the object scores for the rows of Table2 , and not the category quantifications for the columns of Table 2, are plotted. Following orthogonal rotation of axes, Figure 5 has a clear interpretation.... ..."

### Table 4 Mean Correlations Between the Latent Change and the Latent Third Variable

2000

"... In PAGE 13: ...change variable for the six conditions can be found in Table4 . The results for the proposed model were similar to the results found for the change score cor- relations; namely, the relationship between the third variables and change was unaffected by the relationship between the third variables and baseline.... ..."

### Table 4: Execution times (in msec) of the Scatter-and- Gather Algorithm on various images on T3D. permits portability of the code to various platforms. We believe modeling the features of parallel machines, designing data partitioning techniques, and mapping the computations to balance the load using explicit message passing is a feasible approach to solve vi- sion problems on distributed memory parallel machines [Lin et al., 1995, Prasanna and Wang, 1994]. Our algo- rithm can be ported to other models such as the shared memory model [Wang, 1995].

1994

"... In PAGE 5: ..., 1995]. The execution times of the scatter-and-gather algo- rithm on various partition sizes of CM-5 and T3D using 1-stage, 2-stage, and 5-stage communication algorithms are tabulated in Table 3 and Table4 . For many-to-many data communication with bounded tra c, our 5-stage al- gorithm can smooth the variance in message length and also reduce the total startup cost.... ..."

Cited by 2

### Table 4: Execution times (in msec) of the Scatter-and- Gather Algorithm on various images on T3D. permits portability of the code to various platforms. We believe modeling the features of parallel machines, designing data partitioning techniques, and mapping the computations to balance the load using explicit message passing is a feasible approach to solve vi- sion problems on distributed memory parallel machines [Lin et al., 1995, Prasanna and Wang, 1994]. Our algo- rithm can be ported to other models such as the shared memory model [Wang, 1995].

1994

"... In PAGE 5: ..., 1995]. The execution times of the scatter-and-gather algo- rithm on various partition sizes of CM-5 and T3D using 1-stage, 2-stage, and 5-stage communication algorithms are tabulated in Table 3 and Table4 . For many-to-many data communication with bounded tra c, our 5-stage al- gorithm can smooth the variance in message length and also reduce the total startup cost.... ..."

Cited by 2