In general, the problem of computing a maximum a posteriori (MAP) assignment in a Markov random field (MRF) is computationally intractable. However, in certain subclasses of MRF, an optimal or close-to-optimal assignment can be found very efficiently using combinatorial optimization algorithms: certain MRFs with mutual exclusion constraints can be solved using bipartite matching, and MRFs with ...

We analyze two and three-dimensional variants of Hotelling’s model of differentiated products. In our setup, consumers can place different importance on each product attribute; this is measured by a weight in the disutility of distance in each dimension. Two firms play a two-stage game; they choose locations in stage 1 and prices in stage 2. We seek subgame-perfect equilibria. We find that all ...

We investigate the question of tightness of linear programming (LP) relaxation for finding a maximum weight independent set (MWIS) in sparse random weighted graphs. We show that an edge-based LP relaxation is asymptotically tight for Erdos-Renyi graph G(n, c/n) for c ≤ 2e and random regular graph G(n, r) for r ≤ 4 when node weights are i.i.d. with exponential distribution of mean 1. We establis...

We defined the nonlinear Jain operators of max-product type. studied approximation properties these operators.

      In this study, the pharmacokinetic parameters of two marketed tablet formulations of ketoconazole were studied, and the relative bioavailability of the test formulation was compared with a reference formulation. A single dose (12x2) double blind randomized cross-over study of a generic formulation of ketoconazole tablet (2x200 mg), and a commercial brand, Nizoral tablet (2x200 mg, Janssen...

Investigations into probabilistic graphical models for decision making have predominantly centered on influence diagrams (IDs) and decision circuits (DCs) for representation and computation of decision rules that maximize expected utility. Since IDs are typically handcrafted and DCs are compiled from IDs, in this paper we propose an approach to learn the structure and parameters of decision-mak...

Tree-reweighted max-product (TRW) message passing [9] is a modified form of the ordinary max-product algorithm for attempting to find minimal energy configurations in Markov random field with cycles. For a TRW fixed point satisfying the strong tree agreement condition, the algorithm outputs a configuration that is provably optimal. In this paper, we focus on the case of binary variables with pa...

Theoretical models of multidimensional product differentiation predict that in duopoly firms differentiate maximally along one dimension and minimally along the other dimensions. We experimentally reproduce a market in which firms can differentiate their products along two horizontal dimensions. The main result is that subjects do not differentiate their products and locate near the center cons...

Spatial modulation (SM) is a particularly important form of multiple-input multiple-output (MIMO), which uses both symbols and antenna indices to carry information. In this paper, avoid the high cost circuit complexity SM, we consider hybrid SM system with precoding transmitter architecture, combining digital precoder an analog precoder. such system, carried out secure transmit subarray selecti...