Technical Note—Dynamic Generalized Upper Bounding

Upper-bounding $\ell_1$-optimization sectional thresholds

In this paper we look at a particular problem related to under-determined linear systems of equations with sparse solutions. l1-minimization is a fairly successful polynomial technique that can in certain statistical scenarios find sparse enough solutions of such systems. Barriers of l1 performance are typically referred to as its thresholds. Depending if one is interested in a typical or worst...

Upper-bounding $\ell_1$-optimization weak thresholds

In our recent work [49] we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved that if the number of equations in the system is proportional to the length of the unknown vector then there is a sparsity (number of non-zero elements of the unknown vector) also proportional to the length of the unknown vect...

Technical Note - Generalized Upper Bounds and Triangular Decomposition in the Simplex Method

Upper Bounding Fault Coverage by Structural Analysis and Signal Monitoring

A new algorithm for determining stuck faults in combinational circuits that cannot be detected by a given input sequence is presented in this paper. Other than pre and postprocessing steps, certain signal conditions are monitored during logic simulation. These signal conditions are determined by dominator and signal reconvergence analysis. After simulation, a post-processing step determines fau...

Upper-bounding Program Execution Time with Extreme Value Theory

In this paper we discuss the limitations of and the precautions to account for when using Extreme Value Theory (EVT) to compute upper bounds to the execution time of programs. We analyse the requirements placed by EVT on the observations to be made of the events of interest, and the conditions that render safe the computations of execution time upper bounds. We also study the requirements that ...