in this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/i/etmax). due to the time complexity function, this sequencing problem belongs to a class of np-hard ones. thus, a special design of a simulated annealing (sa) method is applied to solve such a hard problem. to comp...

It is generally thought that space-time block codes (STBCs) can obtain no more than full space diversity. In this paper, we propose a new construction method of joint orthogonal STBCs based onM dimensional lattice constellations for obtaining space and time diversities simultaneously. By deriving the Chernoff bound of error probability, we prove the exact diversity gain of the proposed code is ...

Partition functions arise in a variety of settings, including conditional random fields, logistic regression, and latent gaussian models. In this paper, we consider semistochastic quadratic bound (SQB) methods for maximum likelihood estimation based on partition function optimization. Batch methods based on the quadratic bound were recently proposed for this class of problems, and performed fav...

Branch and bound algorithms are methods for global optimization in nonconvex problems [LW66, Moo91]. They are nonheuristic, in the sense that they maintain a provable upper and lower bound on the (globally) optimal objective value; they terminate with a certificate proving that the suboptimal point found is ǫ-suboptimal. Branch and bound algorithms can be (and often are) slow, however. In the w...

The Kepler problem is perhaps the most well-known physics problem in the last three centuries. The MICZ-Kepler problems are its natural cousins. While the Kepler problem exists obviously in high dimensions, only the 5-dimensional analogues of the MICZ-Kepler problems were discovered previously. In this paper, we demonstrate that the quantum MICZ-Kepler problems do exist in all dimensions greate...

An upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes on the binary symmetr ic channel is derived. The bound is evaluated for rate 1 / 2 codes, and comparisons are made with simulations and with the bounds of Viterbi, Van de Meeberg, and Post. In particular, the new bound is significantly better than Van de Meeberg’s bound for ra...

We study a class of overrelaxed bound optimization algorithms, and their relationship to standard bound optimizers, such as ExpectationMaximization, Iterative Scaling, CCCP and Non-Negative Matrix Factorization. We provide a theoretical analysis of the convergence properties of these optimizers and identify analytic conditions under which they are expected to outperform the standard versions. B...