In this paper we show the rst polynomial-time algorithm for the problem of minimizing submodular functions on the product of diamonds of nite size. This submodular function minimization problem is reduced to the membership problem for an associated polyhedron, which is equivalent to the optimization problem over the polyhedron, based on the ellipsoid method. The latter optimization problem is a...

Gordon and Jeffrey developed a type system for checking correspondence assertions. The correspondence assertions, proposed by Woo and Lam, state that when a certain event (called an “end” event) happens, the corresponding “begin” event must have occurred before. They can be used for checking authenticity in communication protocols. In this paper, we refine Gordon and Jeffrey’s type system and d...

This report considers a discrete fractional quadratic optimization problem motivated by a recent application in blind maximum-likelihood (ML) detection of higher-order QAM orthogonal spacetime block codes (OSTBCs) in wireless multiple-input multiple-output (MIMO) communications. Since this discrete fractional quadratic optimization problem is NP-hard in general, we present a suboptimal approach...

This paper sets out to implement the Bayesian paradigm for fractional polynomial models under the assumption of normally distributed error terms. Fractional polynomials widen the class of ordinary polynomials and offer an additive and transportable modelling approach. The methodology is based on a Bayesian linear model with a quasi-default hyper-g prior and combines variable selection with para...

In this paper, we integrate goal programming (GP), Taylor Series, Kuhn-Tucker conditions and Penalty Function approaches to solve linear fractional bi-level programming (LFBLP)problems. As we know, the Taylor Series is having the property of transforming fractional functions to a polynomial. In the present article by Taylor Series we obtain polynomial objective functions which are equivalent to...

Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice and it is a major open question is to explain why this is true. We give a natural condition under which we can provably perform MAP inference in polynomial time—we require tha...

We discuss a variant of multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem asks all vehicles in a group to arrive at a same destination. It can also be viewed as to maximize every processor’s average profit, given n tasks, and each task’s consumetime and profit. Meanwhile, we propose a new kind of partition problem i...

With the Lv’s distribution (LVD), the chirp rates of linear frequency modulated (LFM) signals can be more accurately estimated for the local polynomial periodogram (LPP). Comparing to the estimation methods based on the polynomial Fourier transform (PFT) and fractional Fourier transform (FrFT), it is shown that LPP with the chirp rate estimated by LV’s distributioneffectively obtains better per...

In this work, higher-order moving average polynomials are defined by straightforward generalization of the standard moving average. The self-similarity of the polynomials is analyzed for fractional Brownian series and quantified in terms of the Hurst exponent H by using the detrending moving average method. We prove that the exponent H of the fractional Brownian series and of the detrending mov...