### Table 8 Scale-free properties of the ToscanaJ software package (numbers in brackets are the correlation s) Version N

"... In PAGE 12: ...1070 0.5625 Refer to Table8 for N, the numbe r of classes. S.... In PAGE 13: ...5. The final package of this study, Toscan aJ is a similar size to JEdit but the higher values of cout given in Table8 as comp ared with Tabl e 6 reflect the faster rate of grow th of Tos canaJ over JEdit. This faster grow th is also apparent in the increased hub- like charact er of the former packag e as given by the smal ler values of Qlim.... ..."

### Table 2. Reference categories for scale-free networks and general aviation.

2003

"... In PAGE 15: ... (A maximum of 24 for Lederer and Nambimadom [47] and only 7 for Yang and Kornfeld [65]). We close with Table2 , a broad category summary of our literature review of scale-free networks... ..."

### Table 4 Comparison of different caching strategies on the class of scale-free networks with 100 nodes

2006

"... In PAGE 7: ... We therefore focus primarily a non- parametric measure, namely the rank the caching strategy achieved when compared to the other strategies tested (with 1 being the best rank, and 6 being the worst rank), averaged over all test cases. The results depicted in Table4 show that both evolved strategies (GPfinal and RUDF) work very well over the randomly generated range of networks in the considered class of scale-free networks. They significantly outperformed all the other strategies tested, with a slight advantage of RUDF over GPfinal.... ..."

### Table 5 Comparison of different caching strategies on the class of scale-free networks with 30 nodes

2006

### Table 6 Comparison of different caching strategies on the class of scale-free networks with 300 nodes

2006

### Table 3 Correlation between low-level parameters and average of measured MSE of the NARMA task for Scale-free networks. Each parameter is measured for each network size and then averaged.

"... In PAGE 20: ... Since the models which were considered for small-world and random networks may give disconnected networks, some of mentioned parameters could not be calculated for all such graphs. Table3 presents the correlation between average of measured MSE of the NARMA task and calculated low-level parameters for scale-free reservoirs. The result for small-world and random reservoirs are presented in table 4.... ..."

### Table 2. Number of trust paths found for scale free topology for different TTL values. Target is 4 hops away.

"... In PAGE 7: ... Discovery of the first trust path. Table 1 and Table2 show the number of trust paths found, for different values of TTL, for the random and scale-free topology, respectively. The graphs in Figure 2 and Figure 3 show the number of messages propagated through the network for each algorithm, for different values of TTL.... In PAGE 7: ... Moreover, these messages can be redundant, because they forward a query to a node that earlier received that same query (see [14] for an in-depth discussion). However, Table 1 and Table2 demonstrate the benefit of this higher number of messages in the scale-free topology: the trust path is found within only a few hops for all algorithms. More precisely, the trust path is found in the minimum number of hops (TTL=3 for a target 4 hops away), except for K-walker with 10% forwarding.... ..."

### Table 7 Comparison of different caching strategies on the class of scale-free networks with 100 nodes, depending on whether metadata is maintained only for cached documents (standard) or all documents (all metadata) Caching strategy 1 Latency 1 Rank

2006

"... In PAGE 8: ... In other words, when a document is deleted from the cache, the information collected about it (size, last time accessed, access frequency and so on), called metadata,is kept in a small record so it is available for use in future caching decisions. Table7 shows the results. As one might expect, GDSF benefits from the more accurate information contained in the metadata, and moves from the worst rank (5.... ..."

### Table 3.2: The values for the exponents of the scale-free degree distri- butions of some network models. For directed models, the values for the in-degree and out-degree distributions are given individually. If the reference provides only n = |V | and k, we take m = |E| = nk/2 and round.

2003