Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of a sum of squares optimization and SDP (semidefinite programming) relaxation of polynomial optimization problems. We disscuss effective methods to get a simpler representation of a “sparse” polynomial as a sum of squares of sparse pol...

Representation of a given nonnegative multivariate polynomial in terms of a sum of squares of polynomials has become an essential subject in recent developments of sums of squares optimization and SDP (semidefinite programming) relaxation of polynomial optimization problems. We disscuss effective methods to obtain a simpler representation of a “sparse” polynomial as a sum of squares of sparse p...

the redundancy allocation problem can be described as selecting the components and system configuration in order to optimize some objective function(s) without violating the system constraints. operating conditions are not constant in many advanced engineering systems. mostly, in the engineering applications selection, the number of redundancy components must be balanced among the constraints (...

This work presents Perfect Window Memoization; a high-level processing model that gives an estimation (upper-bound) of performance gain for an image processed in software or hardware, obtained by eliminating the computational redundancy of the image. We show mathematically, supported by experimental data, that the computational redundancy of an image is, in fact, inherited from two basic data r...

We propose an analytical framework that optimizes the performance of various Hybrid Automatic Repeat reQuest (HARQ) schemes in wireless packet data systems. The optimization framework lends itself to maximizing the user throughput while the redundancy size per retransmission, the packet error rate, and the mapping of signal to interference plus noise ratios (SINR) into modulation and coding sch...