### TABLE IV RESULTS FOR THE TWO-LINK FLEXIBLE MANIPULATOR PROBLEM

### Table 1 Physical parameters of two-link arm.

"... In PAGE 8: ... where lcl is the mass center of gravity coordinate of the link 1, and lc2 is the mass center of gravity coordinate of the link 2. The values of the manipulator parameters are given in Table1 (Lee K.... ..."

### Table 11 Parameter values for the GP part of the HGEP for two-link ma- nipulator

2002

"... In PAGE 15: ... Then, initial GP trees are generated using a ramped half-and-half method. The GP parameters are shown in Table11 . The CGEP parameters are set to exactly the same values as those used in regression analysis, and are tabulated in Table 4.... ..."

### TABLE I a31a33a32 WITH DIFFERENT a50 IN TWO-LINK NETWORK WITH a34 a49 a36a35a38a37a7a39a41a40a16a40a16a40

### Table 1 summarizes the performance of the value-passing model checker and the propositional model checker on the property shown in Figure 5. The mea- surements were taken on a 600MHz Pentium III with 256MB running Linux 2.2. We checked the validity of that property for di erent values of domain size (n in that gure) on a speci cation of a two-link alternating bit protocol (ABP). The two-link version of the protocol is obtained by cascading two ABP speci cations, connecting the receiver process of one link to the sender of the next. We chose the two-link version since the single-link ABP is too small for any meaningful performance measurement. The space and time performance from the table shows that the value-passing model checker performs as well as the propositional one; the di erence in speeds can be attributed to encoding used in the propositional formula, where a modal- ity with a variable is expanded to a sequence of explicit conjunctions or disjunc- tions. More experiments are needed to determine whether the succinctness of value-passing formula does indeed have an impact on performance.

2000

"... In PAGE 11: ... Table1 . Performance of propositional and value-passing model checkers 4 Conclusions and Future Work We showed how the power of logic programming for handling variables and sub- stitutions can be used to implement model checkers for value-passing property logics with very little additional e ort and performance penalty.... ..."

Cited by 4

### TABLE I CFA3 WITH DIFFERENT AD IN TWO-LINK NETWORK WITH AMBD BP BHBNBCBCBC PACKETS/S, AMBE BP BHBCBNBCBCBC PACKETS/S AND AS BP BGBC MS

### Table 1: System Parameters (Timing parameters are in processor clock cycles) tional ring has two links for each direction. On the bidirectional ring, each link connects a pair of adjacent PE apos;s with a minimum wire length. Therefore, it is not di cult to keep tr constant for larger N. Thus, we use the same tr = 1; : : : ; 5 for all N.

1998

"... In PAGE 3: ... On the other hand, the crossbar network is assumed to have the multicast functionality to send invalidate messages simultaneously to all the PE apos;s that have copies of the block. Interconnection Network (Bidirectional Ring or Crossbar Switch) L1 P M NI PE PE PE PE P: Processor L1, L2: Cache M: Private/Global Memory D: Directory NI: Network Interface D L2 Figure 1: DSM Multiprocessor Architecture The parameters that de ne the con guration of the system are listed in Table1 . tL2, ts, tr, tm, and tc are no-contention timing parameters, and they are represented in terms of processor clock cycles.... In PAGE 5: ... These components of miss latency appear di erent number of times per miss depending on the access mode and the state of the memory block. Note that M includes contention delay while tm in Table1 does not. P is constant ts on the crossbar while it is the average message traversal length extracted from the traces on the bidirectional ring.... ..."

Cited by 2

### Table 4. Enumeration of free choices for a two-link SDCSC mechanism for the PF problem with kinetostatic speci cations for i 6 = i for increasing numbers of precision points.

"... In PAGE 7: ... It should be noted that the value of the optimal peak torque is reduced by almost an order of magnitude from the case without the springs. Springs Assembled in the General Con guration ( i 6 = i) Table4 shows the number of equations, variables, and free choices for up to ve precision points. The increase in the number of maximum precision points is a result of addi- tional four unknowns related to the springs.... ..."

### Table 3. Enumeration of free choices for a two-link SDCSC mechanism for the PF problem with kinetostatic speci cations for i = i for increasing numbers of precision points.

### Table 18: Performance of generalized searching for various assignments of edge criticality.

2005

"... In PAGE 125: ...6.5 Edge criticality and searching with weights In Table18 we give some statistics of the performance of generalized searching in topologies with clusters.... In PAGE 126: ... The relative weight that a node assigns to its incident edges depends on the number of shortest-hop paths that use these edges. Assuming that r is this ratio, then, in Table18 , we experiment with different assignments of the weights that are proportional to various powers of that ratio ri. By increasing the power i, we increase the priority we give to the critical edges, and, as indicated in the table, the performance of searching increases.... ..."