Results 1 - 10
of
11,011
Table 1: Evaluated Releases
1998
"... In PAGE 5: ... The security functionality in Oracle7 includes granular privileges for enforcement of least privilege, user-configurable roles for privilege management, flexible auditing, stored procedures and triggers for enhanced access control and alert processing and row-level locking. Evaluated Releases Table1 below lists the products and their release numbers that are covered by this se- curity target. The platform configuration is Microsoft Windows NT 3.... ..."
Table 7: Experimental Setup Parameters. This table lists the average access times and block size in the experimental setup. The average times to fetch a 4 KB block in the local cache, the cache of another client and the server are shown in the rows Local Memory Latency, Remote Memory Latency and Server Access Latency. The average roundtrip time for forwarding a block using kernel-level SunRPC is shown in the row Forward Latency.
2000
"... In PAGE 16: ... The average roundtrip time for forwarding a block using kernel-level SunRPC is shown in the row Forward Latency. The block size and average access times are shown in Table7 . The average times to fetch a 4 KB block in the local cache, the cache of another client and the server are shown in the rows Local Memory Latency, Remote Memory Latency and Server Access Latency.... ..."
Cited by 10
Table 1 Valid security levels
2005
"... In PAGE 7: ... The new activity to be included in stage is Security Analysis, which is composed of the ng tasks: Specification of the valid security levels for the database, according to their properties of confidenti- ality. The left-hand column of Table1 represents the Fig. 7.... In PAGE 11: ...OLS9i only supports it at row level (a coarser granularity access). On the other hand, OLS9i permits the classification of information in security levels, compartment and user groups, and this methodology only considers security levels and that specific (1) (2) causes the enforcement of the write access control the security levels that will be valid for this database (which was initially defined in Table1 ), and Fig. 14 specifies the user roles tree that we defined for this database (which was initially defined in Fig.... ..."
Cited by 1
Table VII reports the total memory access delay time (MADT* NREF ) for each tested program, or in other words the number of clocks spent for accessing the lower level of memory hierarchy; without prefetch- ing (first row), it measures the miss penalty only and in the case of a prefetch technique, the sum of both miss and prefetch penalties. Just as in the previous section we defined the miss- based efficiency (Eq. 1), we can define the MADT efficiency in terms of MADT as:
Cited by 2
Table 3: Number of cache accesses and miss ratios of the NetBench and MediaBench applications. Ratios are given in percentage, il1 stands for first level instruction cache, dl1 stands for first level data cache and L2 is the unified level 2 cache. NetBench Programs MediaBench Programs
2001
"... In PAGE 3: ...1. Table3 gives the first and second level cache accesses and miss ratios. The last row gives the average access numbers and miss ratios.... ..."
Cited by 65
Table 3: Number of cache accesses and miss ratios of the NetBench and MediaBench applications. Ratios are given in percentage, il1 stands for first level instruction cache, dl1 stands for first level data cache and L2 is the unified level 2 cache. NetBench Programs MediaBench Programs
2001
"... In PAGE 3: ...1. Table3 gives the first and second level cache accesses and miss ratios. The last row gives the average access numbers and miss ratios.... ..."
Cited by 65
Table 3: Number of cache accesses and miss ratios of the NetBench and MediaBench applications. Ratios are given in percentage, il1 stands for first level instruction cache, dl1 stands for first level data cache and L2 is the unified level 2 cache. NetBench Programs MediaBench Programs
2001
"... In PAGE 4: ...1. Table3 gives the first and second level cache accesses and miss ratios. The last row gives the average access numbers and miss ratios.... ..."
Cited by 65
Table 3: Number of cache accesses and miss ratios of the NetBench and MediaBench applications. Ratios are given in percentage, il1 stands for first level instruction cache, dl1 stands for first level data cache and L2 is the unified level 2 cache. NetBench Programs MediaBench Programs
2001
"... In PAGE 3: ...1. Table3 gives the first and second level cache accesses and miss ratios. The last row gives the average access numbers and miss ratios.... ..."
Cited by 65
Table 2: Various remote cache access time measurements ( s) in the presence of a xed hot spot on the KSR1.
1995
"... In PAGE 22: ... Before presenting our experimental results of hot spot e ects, we list the standard access times in Table 1 published by the KSR [8], for a comparison and a reference. Table2 reports the average timing results of the xed hot spot experiments. The rst data column lists the results of remote-read of one word; the second, third and fourth data columns list the results of remote-read of one block, two blocks and three blocks respectively.... In PAGE 22: ... These data transactions are under the environment without any hot spots (the 1st data row), the environment with the hot spot generated by cache references in a word unit (the 2nd data block row), and the environment with the hot spot generated by cache references in a block unit (the 3rd data block row). Considering the di erent level accesses and block transfers in the experiments, the remote cache access measurements ( rst data row in Table2 ) in a non-hot-spot environment are quite consistent with the standard results in Table 1. When there was a hot spot present, remote access to cool variables in the cool cache modules were not a ected.... ..."
Cited by 8
Table 4-7: 1-D transform parameters for different iterations (L=32, N=4, N~ =4)
2002
"... In PAGE 8: ...VIII List of Tables Table4 -1: Filter coefficients for N=2.... In PAGE 8: ...able 4-1: Filter coefficients for N=2............................................................................................... 18 Table4 -2: Filter coefficients for N=4.... In PAGE 8: ...able 4-2: Filter coefficients for N=4............................................................................................... 18 Table4 -3: Lifting coefficients for N~ =2 and L=16 .... In PAGE 8: ...able 4-3: Lifting coefficients for N~ =2 and L=16 ......................................................................... 18 Table4 -4: Lifting coefficients for N~ =4 and L=16 .... In PAGE 8: ...able 4-4: Lifting coefficients for N~ =4 and L=16 ......................................................................... 18 Table4 -5: Filter coefficients Fi,j for N=4.... In PAGE 8: ...able 4-5: Filter coefficients Fi,j for N=4......................................................................................... 19 Table4 -6: Lifting coefficients Li,j for N~ =4 .... In PAGE 8: ...able 4-6: Lifting coefficients Li,j for N~ =4 .................................................................................... 19 Table4 -7: 1-D transform parameters for different iterations (L=32, N=4, N~ =4) .... In PAGE 8: ...able 4-7: 1-D transform parameters for different iterations (L=32, N=4, N~ =4) ........................... 22 Table4 -8: Steps taken to transform a 2-D signal (Lx=128, Ly=32, N=4, N~ =4).... In PAGE 25: ... For the filter coefficients, the matrix consists of N/2 + 1 rows of each N columns, so in total it has (N/2 + 1)*N entries, where N is the number of vanishing moments. Table 4-1 shows the filter coefficients for N=2, while Table4 -2 illustrates the filter coefficients in case N=4. These tables contain N+1 rows; one row for each interpolating case.... In PAGE 26: ...18 additions, different iteration levels use different sets of lifting coefficients. Table4 -3 and Table 4-4 depict the lifting coefficients for N~ =2 and N~ =4, respectively. In both cases the signal length is 16 (L=16).... In PAGE 26: ...18 additions, different iteration levels use different sets of lifting coefficients. Table 4-3 and Table4 -4 depict the lifting coefficients for N~ =2 and N~ =4, respectively. In both cases the signal length is 16 (L=16).... In PAGE 26: ... In both cases the signal length is 16 (L=16). Table4 -1: Filter coefficients for N=2 Table 4-2: Filter coefficients for N=4 Table 4-3: Lifting coefficients for N~ =2 and L=16 ... In PAGE 26: ... In both cases the signal length is 16 (L=16). Table 4-1: Filter coefficients for N=2 Table4 -2: Filter coefficients for N=4 Table 4-3: Lifting coefficients for N~ =2 and L=16 ... In PAGE 26: ... In both cases the signal length is 16 (L=16). Table 4-1: Filter coefficients for N=2 Table 4-2: Filter coefficients for N=4 Table4 -3: Lifting coefficients for N~ =2 and L=16 ... In PAGE 26: ... In both cases the signal length is 16 (L=16). Table 4-1: Filter coefficients for N=2 Table 4-2: Filter coefficients for N=4 Table 4-3: Lifting coefficients for N~ =2 and L=16 Table4... In PAGE 27: ...1875 2.1875 Table4 -5: Filter coefficients Fi,j for N=4 The last 2 rows in Table 4-5 are the mirror of the first 2 rows (N/2 + 1 rows of storage area is actually enough for this table). Here all rows are mentioned for clarity.... In PAGE 27: ...1875 2.1875 Table 4-5: Filter coefficients Fi,j for N=4 The last 2 rows in Table4 -5 are the mirror of the first 2 rows (N/2 + 1 rows of storage area is actually enough for this table). Here all rows are mentioned for clarity.... In PAGE 27: ...2663926 -0.2796945 Table4... In PAGE 31: ...nd 32 in x and y directions respectively. As described in Section 4.1, we calculate 5 and 3 for the number of iterations in x and y directions, respectively (N=4, N~ =4). The steps to be taken for the 2-D transform of this image is illustrated in Table4 -8 (the split step is not mentioned). As can be seen, in the forward transform after step 14 and 16, and in the inverse transform before steps 1 and 3, the 1-D transform on the columns is skipped.... In PAGE 32: ...24 Forward Transform Inverse Transform 1 Predict Rows Level 0 - - - 2 Update Rows Level 0 - - - 3 Predict Columns Level 0 1 Update Rows Level 4 4 Update Columns Level 0 2 Predict Rows Level 4 5 Predict Rows Level 1 - - - 6 Update Rows Level 1 - - - 7 Predict Columns Level 1 3 Update Rows Level 3 8 Update Columns Level 1 4 Predict Rows Level 3 9 Predict Rows Level 2 5 Update Columns Level 2 10 Update Rows Level 2 6 Predict Columns Level 2 11 Predict Columns Level 2 7 Update Rows Level 2 12 Update Columns Level 2 8 Predict Rows Level 2 13 Predict Rows Level 3 9 Update Columns Level 1 14 Update Rows Level 3 10 Predict Columns Level 1 - - - 11 Update Rows Level 1 - - - 12 Predict Rows Level 1 15 Predict Rows Level 4 13 Update Columns Level 0 16 Update Rows Level 4 14 Predict Columns Level 0 - - - 15 Update Rows Level 0 - - - 16 Predict Rows Level 0 Table4 -8: Steps taken to transform a 2-D signal (Lx=128, Ly=32, N=4, N~ =4) 4.6 Conclusions In this chapter we described the Lifting scheme implementation of the Wavelet Transform from as implemented in Liftpack software.... ..."
Cited by 4
Results 1 - 10
of
11,011