Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
14,797
TABLE I. EXECUTION TIME FOR THE OPTIMIZATION ALGORITHMS.
2004
Cited by 7
Table 1: Throughput and network latency of some injection con gurations when the applied load is equal to the network capacity. The con gurations used in the experiments are separated with double horizontal lines.
1996
"... In PAGE 12: ... For this reason, the network latency is often preferred to analyze the network performance. Table1 reports the performance of several injection con gurations mea- sured at the network capacity. When we use a single adaptive channel (we recall that there are two deterministic channels that must be added to the number of adaptive channels to obtain the total number of virtual channels multiplexed on each physical link) the minimal injection mechanism com- posed of a single injection and a single source throttling channel provides an acceptable throughput, with 46% of the network capacity, even if it is pos- sible to get a better performance by furtherly limiting the injection of new packets.... ..."
Cited by 10
Table 7. Reservoirs and flood-control structures in the Great and Little Miami River Basins, Ohio and Indiana, with a normal capacity of at least 5,000 acre-feet or a maximum capacity of at least 25,000 acre-feet [Normal capacity equals total volume at normal retention level; maximum capacity equals total volume at maximum attainable water-surface elevation; mi2, square mile; C, flood control; R, recreation; S, water supply. Data from Ruddy and Hitt, 1990, and Miami Conservancy District, 1998]
2000
Table 2 depicts the protection rings and demand capacities when DSH demand ratio is equal to 0.38. At the design of the DSH sub-network, an issue of protection channel assignment is developed in order to assign the spare capacity on the remaining working one, which otherwise cannot be restored by the shared self-healing rings using as core algorithm the ant colony cycle. Taking the above into account, Table 3 presents the SSR working
TABLE I. Number of triangles in a convenient set of lattice-commensurate triangles with longest side equal to l units. The cumulative total for all cases with longest side less than or equal to l determines the required storage capacity Tl. Note that, for a single image with 512 512 pixels, triangle size has been restricted in the text to l 64 to avoid storing more values of S3 than the total number of pixels in the original image.
1988
Cited by 2
Table 3: Memory capacity and bandwidth for the
1999
"... In PAGE 9: ... The size of a #0Celd memory therefore becomes 832 #01 288 #01 2=0:48MB; #7B Clock frequency of the background memory is 96 MHz which implies a maximum available memory bandwidth of 384 MB#2Fs #2832-bit bus#29; #7B Graphics generation is not taken into account. In Table3 , the requirements for the amount of mem- ory and the memory bandwidth are calculated. The calculations are performed for the worst case in which the horizontal and vertical conversion factors #28S v and S h #29 equal unity.... ..."
Cited by 6
Table 3 for a single run. Driven intra-technology handovers are equal to 92.28% of the total driven handovers and equal to 73.91% of the total handovers. As expected, most handovers occur within RAT1, which has the largest capacity. On the other hand, driven inter- technology handovers are equal to 7.72% of the total driven handovers and equal to 6.18% of the total handovers; 2. overlapping between the coverage areas of different RATs is high enough to keep the failure probability of inter-technology handover attempts sufficiently low as not to degrade the performance of the overall procedure.
in Work performed under co-financing by the MIUR within the project FIRB-PRIMO. Corresponding Author:
"... In PAGE 29: ... Table3 : Handover distribution: dense coverage case. Consequently, if we consider a coverage with an amount of resources lower than those in the dense coverage, a deterioration of the performance of the procedure is to be expected.... ..."
Table 1 that an image like Baboon, which contains signifi- cant texture and is characterized by large f 2 kg and a large just-noticeable noise threshold D1, has considerably larger data-hiding capacity than simpler images such as Lena. Ta- ble 1 also displays spike approximations to capacity (here using a threshold equal to 2:5D2 to separate strong from weak signals). The approximation is quite accurate.
2000
"... In PAGE 3: ... Similar experiments were conducted for other images. Table1 gives the data-hiding capacity for variances f 2 kg computed from Baboon, Lena and Peppers. It is seen from Table 1 that an image like Baboon, which contains signifi- cant texture and is characterized by large f 2 kg and a large just-noticeable noise threshold D1, has considerably larger data-hiding capacity than simpler images such as Lena.... In PAGE 3: ... Table1 : Total data-hiding capacities (in bits) for images of size N = 5122, for just noticeable D1, and wavelet EQ model. The first estimate NC uses a fine quantization of variances (K = 256 channels), and the second NC(spike) uses a coarse quantization (two channels).... ..."
Cited by 18
Table 2: Total Spare Capacity for link restoration
"... In PAGE 9: ... For SCAPE, in order to minimize the spare capacity of each network, the link cost parameter and distance parameter for each link in each network is taken to be equal to 1 unit. The results are shown in Table2 and Table 3. The running time of the SCAPE for spare capacity planning of these four network is shown in Table 4.... In PAGE 9: ...Table 3: Total Spare Capacity for Path Restoration Running time of Link Restoration (ms) Running time of Path Restoration (ms) Network Basic SCAPE Improved SCAPE Basic SCAPE Improved SCAPE 1 20 110 100 2054 2 40 16 17 3635 3 50 260 271 6440 4 60 461 56 25296 Table 4: The running time of the SCAPE In Table2 , the total spare network capacity for 100% restoration for any single link failure as determined by different algorithms is given. From the result shown in Table 2, Table 3 and Table 4, we observe the following: 1.... In PAGE 9: ...Table 3: Total Spare Capacity for Path Restoration Running time of Link Restoration (ms) Running time of Path Restoration (ms) Network Basic SCAPE Improved SCAPE Basic SCAPE Improved SCAPE 1 20 110 100 2054 2 40 16 17 3635 3 50 260 271 6440 4 60 461 56 25296 Table 4: The running time of the SCAPE In Table 2, the total spare network capacity for 100% restoration for any single link failure as determined by different algorithms is given. From the result shown in Table2 , Table 3 and Table 4, we observe the following: 1. When we compare the result obtained in Basic SCAPE and Improved SCAPE, we see that Improved SCAPE can outperform Basic SCAPE from 15% to 30% in all the cases.... ..."
Table 6: key-size for equal security
2005
"... In PAGE 12: ...able 5: Changes from WEP to TKIP................................................................................................................... 25 Table6 : key-size for equal security .... In PAGE 58: ... This performance improvement is an important advantage, if that security algorithm has to be implemented on a wireless device, where computation capacities and battery power are limited. Table6 compares the different key lengths of ECC ... ..."
Results 1 - 10
of
14,797
