### Table 1: Canonical forms of the classical deception techniques.

### Table 3-Classical Approach for Ordering of Fragmentation Techniques

"... In PAGE 9: ... Considering the worst cost for re-grouping makes this order. If no re-grouping is made the orders shown in Table3 -4 will remain unchanged. The third group of the three features includes access to one or more columns for all records in a relation.... In PAGE 9: ... Which technique is the best for your environment? Using the appearing frequency of every database operation and giving regular weight to every feature may then obtain a general order. Order of fragmentation methods by cost is given in Table3 -4. The method with the highest value is the one with the lowest cost.... ..."

### Table 6 Classical component-based summary Approach/technique Classical component-based

2005

"... In PAGE 6: ...able 5 Software refactoring summary ........................................................................................................ 27 Table6 Meta-level programming summary .... ..."

### Table 2. Bandwidth allocations for a 3-node network using classical optimisation techniques in comparison to EP optimisation techniques.

1998

"... In PAGE 3: ... (In [iii] other traffic profiles, such as bursty traffic were also considered). Table2 shows the sum of the objective functions for each case for the CCO and EP methods. For the 3-node problem there was exact agreement between CCO and GENOCOP algorithms.... ..."

Cited by 6

### Table 5. Bandwidth allocations for the 4 node network using classical optimisation techniques in comparison to EP optimisation techniques.

1998

Cited by 6

### Table 3.1 Classical tools and techniques from decision theory 1. Utility theory

2001

### Table Fout! Onbekende schakeloptie-instructie.: Critical analysis of classical survey techniques in DE (Schultz et al., 1997)

### Table 2. Bandwidth allocations for example 1 for the sum of the objective function using.classical optimisatron techniques in comparison to genetic based optimisation techniques.

"... In PAGE 3: ... For ease of comparison the results are tabulated below. Table2 considers the sum of the objective functions and Table 3 the product of the objective function #1 Using MATLAB function constr.m for constrained non linear optimisation; uses a Sequential Quadratic Programming method.... ..."

### Table 2 PSNR values in Db measured over a test pool of digital images between original and zoomed images obtained with classical and proposed technique starting from image reduced by decimation and averaging

2002

Cited by 2

### Table 2 Comparison of signal separation bythe classical ICA approach and the cICA technique using constraints to obtain ICs having unit variances

"... In PAGE 11: ...iven in Eq. (22) with the Lagrange multiplier updating rule given in Eq. (21). The iterative learning algorithm converged in 50 iterations to obtain the demixing matrix. Table2 shows the variances, the values of FFnal row performance indices (rPIs) and column performance indices (cPIs) and the SNR values of separated components. The values were compared with those of the estimated components given bythe classical ICA algorithm.... ..."