### Table 1: Sampled AS Topologies

"... In PAGE 7: ... In the experiments here we generate 10 samples for each Nmax and each AS is modeled by a single BGP speaking router. Some characteristics of the sampled topologies are given in Table1 . For comparison, the whole AS topology built from the RIB has an average outdegree of 4.... ..."

### Table 1: Sampled AS Topologies

"... In PAGE 7: ... In the experiments here we generate 10 samples for each Nmax and each AS is modeled by a single BGP speaking router. Some characteristics of the sampled topologies are given in Table1 . For comparison, the whole AS topology built from the RIB has an average outdegree of 4.... ..."

### Table 1: Network Topologies

"... In PAGE 3: ... Network model Two different network topologies have been considered for our study (Figure 2). Table1 reports the number of nodes N, the number of unidirectional links L, the hop count averaged among all node pairs h and the link capacity C (Mb/s). The reason to have two different topologies is that the smaller 7nodes topology could be implemented both in the simulation study and in a testbed (see II.... ..."

### Table 1 - Routing Switch Topologies

in The Stratix

2003

"... In PAGE 5: ... FMT can model routing switches containing any combination of input muxing pass transistors, buffers, and output demux transistors. There are 8 combinations of these features, of which 5 unique types are electrically feasible, as shown in Table1 . These are (a) buffers (b) buffers and output pass transistors (c) pass transistors (d) direct drive muxes (e) pass transistor muxes with buffers and output demuxes.... ..."

Cited by 7

### Table 1 Sequence of topological repair

2004

"... In PAGE 11: ... For models with many non-local prob- lems, the most appropriate course of action is probably to collect more accurate data (or improve the earlier reverse engineering stages). Table1 lists all the cases in which solving a topological problem of a given type may create a further topological problem of a different type. The columns are topo- logical problems to be solved in order, and the rows are new problems which may arise from solving them, assuming the ordering given.... In PAGE 15: ..., this indicates that the data or methods used to construct the raw model need to be improved (as discussed under adjacent sliver faces above). Items above the diagonal in Table1 are all No . Thus if problems are fixed in the sequence given, no repair later in the sequence can cause a problem of a type already fixed earlier in the sequence.... In PAGE 15: ... Thus, certain potential complex interactions between multiple types of topological problem need not be considered, as they cannot arise, simpli- fying the analysis. Table1 shows just one self-consistent ordering in which prob- lems of the various types can be solved sequentially. Other orderings may also be possible.... ..."

Cited by 3

### Table 1 Topological interpretation of the eight base relations of RCC-8. i( ) speci es the topological interior of a spatial region, the topological closure.

1999

"... In PAGE 3: ... Exactly one of these relations holds between any two spatial regions. These relations can be given a straightforward topological interpretation in terms of point-set topology (see Table1 ), which is almost the same as the semantics for the topological rela- tions given by Egenhofer [12] (though Egenhofer places stronger constraints on the domain of regions, e.g.... In PAGE 7: ...oth regions must not be empty, i.e., the complements of both X and Y are not equal to the universe. In the same way all topological constraints corresponding to the RCC-8 relations (see Table1 ) can be written as constraints of the form (m = U) and (e 6 = U), where m and e are set-theoretic expressions, denoted as model constraints and entailment constraints, respectively [2]. In the above example, X \ Y is the model constraint and X and Y are the entailment constraints.... ..."

Cited by 91

### Table 1. Topology configurations and characteristics

2003

"... In PAGE 8: ...onstant for the analysis, i.e. the number of bi-directional ports is 16, one traffic flow is associated with each input port, and the single SDRAM uses separate buses for read and write accesses. Topologies using eight processing elements are listed in Table1 together with static design characteristics. The first four topologies (I - IV) are also shown in Figure 1.... In PAGE 9: ...2. Results from analysis Given the topology configurations in Table1 analy- sis results from abstract benchmarking are given in Figure 5. The arrival rate of packets is fixed to the point where the modeled SDRAM reaches saturation in utiliza- tion.... In PAGE 10: ... The latter configurations more realistically model run-time jitter and arbitration effects as well as effects due to slightly unbalanced task graphs since a fully synchronous design is not feasible in our application domain. Note that the worst-case memory bounds given in Table1 for packet descriptors do not hold in the plain Round-Robin case in Figure 5. We would consider those designs to be unbal- anced for our application scenario since, for instance, in the pure pipeline case, up to 18 packets per flow could be in the network processor concurrently (as opposed to up to nine packets in Table 1).... In PAGE 10: ... Note that the worst-case memory bounds given in Table 1 for packet descriptors do not hold in the plain Round-Robin case in Figure 5. We would consider those designs to be unbal- anced for our application scenario since, for instance, in the pure pipeline case, up to 18 packets per flow could be in the network processor concurrently (as opposed to up to nine packets in Table1 ). Only under ideal assumptions the pure pipeline (con- figuration (1)) is able to match latency values with pool configurations (configuration (IV and V)) by over- provisioning the throughput of point-to-point (P-2-P) connections and thereby decreasing the transport delay.... ..."

Cited by 10

### Table 1 Correlation between unconstrained prehension kinematics as a per- centage of the whole action cycle (including hand retrieval) compar- ing M. nemestrina vs. humans

### Table 1: BRITE Topology Parameters Parameter Values

2006

"... In PAGE 10: ... BRITE provides variety of topology model such as, at router (Waxman and Barabasi) model, at AS (Autonomous System) model, imported flle model, hierarchical top-down and bottom-up models. To implement and validate the performance of the On-demand P2P network model, BRITE has been used to generate a Router Waxman topology with parameters described in Table1 . In Section 4.... ..."