### Table 1: Various algebras built using Albert.

1992

"... In PAGE 6: ... This command merely causes Albert to check if the polynomial expands to zero in the free algebra. Testing The results of several experiments are shown in Table1 . All times re ect computations made on a Sun SPARCstation1+, and are approximate.... In PAGE 6: ... A theorem of Hall apos;s [4] describes a basis for free Lie rings in terms of a set of \standard monomials quot;. The dimensions for Lie algebras, shown in Table1 , are precisely the numbers predicted by Hall apos;s theorem. Another test we employed was to make use of Artin apos;s theorem ([14], p 29) that states that any alternative algebra generated bytwo elements is associative.... In PAGE 10: ... In fact, these problems are beyond the scope of Albert, given the speed and memory sizes of present computers. The computations in Table1 were performed done on a computer with 12 mb memory. Albert can do useful work, however, with much less than this.... In PAGE 10: ... Albert can do useful work, however, with much less than this. As Table1 demonstrates, the system tends to do well when the number of generators is kept small, usually two or three. (For example note that the dimension of the degree 8 Lie algebra with 4 a apos;s and 4 b apos;s is only 39, and yet the degree 7 Lie algebra having 3 a apos;s, 2 b apos;s, 1 c,and1d is 232.... ..."

Cited by 7

### Table 1: Various algebras built using Albert.

"... In PAGE 6: ... This command merely causes Albert to check if the polynomial expands to zero in the free algebra. Testing The results of several experiments are shown in Table1 . All times re ect computations made on a Sun SPARCstation1+, and are approximate.... In PAGE 6: ... A theorem of Hall apos;s [4] describes a basis for free Lie rings in terms of a set of \standard monomials quot;. The dimensions for Lie algebras, shown in Table1 , are precisely the numbers predicted by Hall apos;s theorem. Another test we employed was to make use of Artin apos;s theorem ([14], p 29) that states that any alternative algebra generated by two elements is associative.... In PAGE 10: ... In fact, these problems are beyond the scope of Albert, given the speed and memory sizes of present computers. The computations in Table1 were performed done on a computer with 12 mb memory. Albert can do useful work, however, with much less than this.... In PAGE 10: ... Albert can do useful work, however, with much less than this. As Table1 demonstrates, the system tends to do well when the number of generators is kept small, usually two or three. (For example note that the dimension of the degree 8 Lie algebra with 4 a apos;s and 4 b apos;s is only 39, and yet the degree 7 Lie algebra having 3 a apos;s, 2 b apos;s, 1 c, and 1 d is 232.... ..."

### Table 5 Two Examples Of The Alberts Pattern in Organizations Organization Number of

"... In PAGE 26: .... S. Defense Acquisition System, using design and process contributions from the Structure-Based School (Warfield amp; Staley, 1996). Table5 describes three levels in a vertically-integrated (inclusion) structure relevant to the problematic situation. The three levels are here 46 Issues in Integrative Studies Table 4 Formalisms As The Basis For Applying Science Third Example: Computation of Structure 1.... In PAGE 27: ... Notably, the higher genus is included here, but only as the overarching component; while extensive detail at lower levels in the hierarchy of information amplifies and elucidates the higher levels. In the Operational Level, as indicated in Table5 , 678 problems relative to system acquisition were collectively identified (by more than 300 program managers who were active in defense acquisition management). In the Tactical Level, these 678 problems were placed in 20 tactical categories.... ..."

### Table 1 Exponents and correlation co-efficients for BRITE Barabasi-Albert topologies

### TABLE II SIMULATION RESULTS FOR ROUTER BARABASI-ALBERT TOPOLOGY. PRUNING REMOVES THE NODES AND LINKS THAT ARE NOT ON THE OVERLAY PATHS. MMR IS MEASUREMENT REDUCTION RATIO. FP IS FALSE POSITIVE.

2003

Cited by 21

### Table 3: Simulation results with model LLRD2.Use the same Barabasi-Albert topologies as in Table 7. Refer to Table 7 for statistics like rank. FP is the false positive rate. OL means overlay network.

2004

"... In PAGE 9: ... Given space limitations, we only show the lossy path inference with the Barabasi-Albert topology model and the Gilbert loss model in Table 3. The running time for LLRD1 and LLRD2 are similar, as in Table3 . All speed results in this paper are based on a 1.... ..."

Cited by 35

### Table 4: Simulation results with model LLRD2.Use the same Barabasi-Albert topologies as in Table 2. Refer to Table 2 for statistics like rank. FP is the false positive rate. OL means overlay network.

2004

"... In PAGE 9: ... Given space limitations, we only show the lossy path inference with the Barabasi-Albert topology model and the Gilbert loss model in Table 4. The running time for LLRD1 and LLRD2 are similar, as in Table4 . All speed results in this paper are based on a 1.... ..."

Cited by 35

### Table 4: Simulation results with model LLRD2.Use the same Barabasi-Albert topologies as in Table 2. Refer to Table 2 for statistics like rank. FP is the false positive rate. OL means overlay network.

2004

"... In PAGE 9: ... Given space limitations, we only show the lossy path inference with the Barabasi-Albert topology model and the Gilbert loss model in Table 4. The running time for LLRD1 and LLRD2 are similar, as in Table4 . All speed results in this paper are based on a 1.... ..."

Cited by 35

### Table 4.1: Boolean model as proposed by Albert et al. [94]. Here is the simplified version used for the determination of steady states in which time indices are not considered. The index i refers to the cell number within the parasegment

2007