In this paper, we use the block orthogonal matching pursuit (BOMP) algorithm to recover block sparse signals x from measurements y = Ax+v, where v is a l2 bounded noise vector (i.e., ‖v‖2 ≤ ǫ for some constant ǫ). We investigate some sufficient conditions based on the block restricted isometry property (block-RIP) for exact (when v = 0) and stable (when v 6= 0) recovery of block sparse signals ...

This note studies the empirical content of a simple marriage matching model with transferable utility, based on Becker (1973). Under Becker’s conditions, the equilibrium matching is unique and assortative. However, this note shows that, when the researcher only observes a subset of relevant characteristics, the unique assortative matching does not uniquely determine a distribution of observed c...

In this short paper, we present some new results for the problem of motion estimation under orthographic projection. We refine some basic results obtained by previous researchers and provide more detailed and precise results. We shbw that, in the two-view problem, when the rotation is around the optical axis, the motion (but not the structure) is uniquely determined. We show that, in the three-...

In this paper, we apply matching theory to supply chain coordination. We present mathematical optimization models similar to the newsvendor problem to provide appropriate conditions for retailer-supplier matching. In particular, our matching algorithm, compared to the general matching theory, has uniquely been affected by contract sizes and ordering sequences. We also study that our matching ap...

In this paper, we prove that if E is an uniquely remotal subset of a real normed linear space such has Chebyshev center c ∈ and the farthest point map F : → restricted to [c, (c)] p...

Consider the family of all finite graphs with maximum degree ∆(G) < d and matching number ν(G) < m. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all the cases when the maximal graph is unique. We also provide a new proof of Gallai’s lemma concerning factor critical graphs.

We explore the training and usage of the Restricted Boltzmann Machine for unsupervised feature extraction. We investigate the many different aspects involved in their training, and by applying the concept of iterate averaging we show that it is possible to greatly improve on state of the art algorithms. We also derive estimators based on the principles of pseudo-likelihood, ratio matching, and ...