We consider the single-user computational cut-off rate for the complex Rayleigh flat fading spatio-temporal channel under a peak power constraint. Determination of the cutoff rate requires maximization of an average error exponent over all possible space-time codeword probability distributions. This error exponent is monotone decreasing in a measure of dissimilarity between pairs of codeword ma...

On-chip automatic tuning circuit with proposed integration level approximation technique, designed in a 0.65m 3.3V CMOS process for tuning of the variation passive component. To verify tunning efficiency of proposed circuit, three types of 2nd-order biquad RC active filters were used. The cut-off frequency (fc) error of filter with proposed tuning circuit can be reduced by new algorithm that co...

An Adaptative Neuro-Fuzzy Inference System (ANFIS), new flexible tool, is applied to predict the cut-off frequencies of the symmetric and the anti-symmetric circumferential waves (Si and Ai, i=1,2) propagating around an elastic aluminum cylindrical shell of various radius ratio b/a (a: outer radius and b: inner radius). The time-frequency of WignerVille and the proper modes theory are used in t...

We have developed a CMOS-compatible, in-situ micro-device to measure three important fabrication, material, and actuation parameters characterizing planarprocessed microelectromechanical (MEMS) structures: uniform in-plane overor under-cut (cut error), effective Young’s Modulus, and actuation comb-drive forces. Our only measurements are of voltage and capacitance. The device fits in a 1 mm by 1...

2 Classification Error Suppose that we cut off the growing process at various points over the growing processs, and we evaluate the error of the tree at that point and time. This would lead to a graph of size vs. error (where error is the probability of making a mistake). There are two error rates to be considered: • training error (i.e. fraction of mistakes made on the training set) • testing ...

This paper describes components of a branch-and-cut algorithm for solving integer linear programs having a large symmetry group. It describes an isomorphism pruning algorithm and variable setting procedures using orbits of the symmetry group. Pruning and orbit computations are performed by backtracking procedures using a Schreier-Sims table for representing the symmetry group. Applications to h...

We study the Max k-Cut problem and its dual, the Abstract-1 Min k-Partition problem. In the Min k-Partition problem, given a graph G = (V, E) and positive edge weights, we want to find an edge set of minimum weight whose removal makes G k-colorable. For the Max k-Cut problem we show that, if P 6= NP, no polynomial time approximation algorithm can achieve a relative error better than 1/(34k). It...

A cut-cell adaptive method is presented for high-order discontinuous Galerkin discretizations in two and three dimensions. The computational mesh is constructed by cutting a curved geometry out of a simplex background mesh that does not conform to the geometry boundary. The geometry is represented with cubic splines in two dimensions and with a tesselation of quadratic patches in three dimensio...

We consider low-rank semidefinite programming (LRSDP) relaxations of unconstrained {−1, 1} quadratic problems (or, equivalently, of Max-Cut problems) that can be formulated as the nonconvex nonlinear programming problem of minimizing a quadratic function subject to separable quadratic equality constraints. We prove the equivalence of the LRSDP problem with the unconstrained minimization of a ne...