### Table 4: Number of incircle-tests used by both algorithms 6 Conclusion We presented a new method to compute orders for a Delaunay triangulation that allow reconstruction of the triangulation in linear time. We can guarantee that in a single phase of our algorithm 13 of the points are removed (when the degree of the removed points is restricted to at most 6). This is a signi cant improvement to the algorithm of Snoeyink and van Kreveld (which guarantees that 1 10 of the points of degree 6 can always be removed). Our algorithm is well-suited for 9

2005

Cited by 2

### Table 9: List of restrictive policies built for preventing malicious vulnerability exploits in new executed paths Restricted-execution instruction Restrictive policies

in Virtualization-assisted Framework for Prevention of Software Vulnerability Based Security Attacks

"... In PAGE 11: ... At that point, signal Match is asserted and the monitor resumes execution in S2. During instrumentation of the new path, a set of highly-restrictive policies (listed in Table9 ) is enforced at run-time before any instruction completes execution. (This part of our work uses a similar concept to the one in [13]).... In PAGE 12: ...43 28.11 P8 13881 and performing various checks against behavioral model M and the list of restrictive security policies given in Table9 . For evaluation purposes, we divided the testing procedure into two scenarios: (1) application is executed with user inputs already tested in the Testing environment, (2) application is executed with user inputs not tested in the Testing environ- ment and which exercise new execution paths.... In PAGE 13: ... C. Detection and false alarm rates in the Real Environment: Behavioral models extracted in the detection mode, in addition to the restrictive security policies of Table9 , successfully halted the exploit of any code vulnerabilities in the Real environment or prevention mode. We have tested our approach in the Real environment using a set of input vectors that was used in the detection mode and another set of inputs that was not tested.... ..."

### Table 7: Exclusion Restrictions

"... In PAGE 15: ... We estimated each of the five possible versions of this modification of the model (one for each policy variable), and tested the joint exclusion of the policy variables included in the GROWTH equation. The results of this exercise mirror those reported in Table7 , thus we do not report them in detail here. The second restriction of interest is the exclusion of GROWTH from the NEWENT equation (1).... In PAGE 15: ... Using IO and DEFENSE as instruments for GROWTH, we estimated this modification of (1) using 2SLS. The estimates of the coefficient on GROWTH we obtained are reported in Table7 ; they are statistically insignificant in all eight cases. Taken together, our results broadly support the importance of new-enterprise formation in generating economic growth in Russia.... ..."

### Table 8. Logit Model Parameter Estimates and Variable Means

2000

### Table 3: Original New York and Norwegian Problems - Multicommodity Formulation

1998

"... In PAGE 23: ...7 0.00 2626 Table 2: Original New York and Norwegian Problems { Capacity Formulation Multicommodity Formulation: In Table3 below, LP denotes the value of the rst linear program (which includes the degree constraints) XLP is the value after adding cutting planes, cut is the total time spent by the cutting plane algorithm, UB-H is the value of the upper bound found by the heuristic, P-GAP is the percent gap between the best upper and lower bounds for the restricted problem, heur is the time spent by the heuristic, BLB, BUB, and bb are the best lower and upper bound found and time obtained by branch-and-bound on all the columns. GAP is the percent gap between the best upper and lower bounds found by the overall algorithm, and Total is the overall running time.... ..."

Cited by 43

### Table 2: Throughput optimization of non-linear real-life designs with unrestricted amount of unfolding used: ICPL - initial critical path length, ! 0 - arbitrary speed-up

"... In PAGE 4: ... Table 1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table2 shows throughput improvement achieved for non-restricted amount of unfolding. When no unfolding is used, our approach reduces the critical path lengths from the technique of [2] by 35 % on average.... ..."

### Table 2: Throughput optimization of non-linear real-life designs with unrestricted amount of unfolding used: ICPL - initial critical path length, ! 0 - arbitrary speed-up

"... In PAGE 4: ... Table 1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table2 shows throughput improvement achieved for non-restricted amount of unfolding. When no unfolding is used, our approach reduces the critical path lengths from the technique of [2] by 35 % on average.... ..."

### Table 1: Throughput optimization of non-linear real-life designs with no unfolding: ICPL - initial critical path length

"... In PAGE 4: ... 6 Experimental Results We have used several Volterra filters of different orders, several Noise Sharpers, Echo Canceller, Vocoder, NEC DAC (digital-to- analog converter), and ADPCM (adaptive delta pulse code mod- ulation) for experimental results. Table1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table 2 shows throughput improvement achieved for non-restricted amount of unfolding.... ..."

### Table 1: Throughput optimization of non-linear real-life designs with no unfolding: ICPL - initial critical path length

"... In PAGE 4: ... 6 Experimental Results We have used several Volterra filters of different orders, several Noise Sharpers, Echo Canceller, Vocoder, NEC DAC (digital-to- analog converter), and ADPCM (adaptive delta pulse code mod- ulation) for experimental results. Table1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table 2 shows throughput improvement achieved for non-restricted amount of unfolding.... ..."

### Table 1: The rules of the classical system KE. The applications of the only branching rule can be restricted to subformulae and further controlled by sys- tematic procedures.

in A Generalization of Analytic Deduction via Labelled Deductive Systems I: Basic Substructural Logics

1994

"... In PAGE 4: ... In [DM94] these ideas lead to the formulation of a new system of analytic deduction for classical logic, the system KE, which is proved to be essentially more e cient than the tableau method3. The rules of the classical KE system are listed in Table1 . Notice that all the operational rules have a linear format and the only branching rule is a rule expressing the classical Principle of Bivalence.... ..."

Cited by 53