recently, cho et al. [y. j. cho, r. saadati, s. h. wang, common xed point theorems on generalized distance in ordered cone metric spaces, comput. math. appl. 61 (2011) 1254-1260] de ned the concept of the c-distance in a cone metric space and proved some xed point theorems on c-distance. in this paper, we prove some new xed point and common xed point theorems by using the distance in ordere...

Overlap fermions have the following desirable features: • Exact chiral symmetry on the lattice. • No additive quark mass renormalization. • No flavor symmetry breaking. • No O(a) error. • The O(ma) and O(ΛQCDma) errors are also small, from dispersion relation and renormalization constants. The first two features are especially significant for light quarks. Many exciting results at low quark mas...

BACKGROUND Most HIV infections are transmitted across mucosal epithelium. Understanding the role of innate and specific mucosal immunity in susceptibility or protection against HIV infection, as well as the effect of HIV infection on mucosal immunity, are of fundamental importance. HLA-G is a powerful modulator of the immune response. The aim of this study was to investigate whether soluble HLA...

We review the extension of modern techniques for the calculation of helicity amplitudes in QCD to massive particles. The focus is on the use of supersymmetric Ward identites that relate amplitudes with massive quarks to those with massive scalars, the application of on-shell recursion relations to amplitudes with massive quarks and an extension of the CSW rules to massive scalars.

We formulate clustering aggregation as a special instance of Maximum-Weight Independent Set (MWIS) problem. For a given dataset, an attributed graph is constructed from the union of the input clusterings generated by different underlying clustering algorithms with different parameters. The vertices, which represent the distinct clusters, are weighted by an internal index measuring both cohesion...

We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of loopy max-product belief propagation. We show that, if it converges, the quality of the estimate is closely related to the tightness of an LP relaxation of the MWIS problem. We use this relationship to obtain sufficient conditions f...

Various axiomatic set theories (ZF, NBG, NF, and KPU) are studied with a critical eye. The basic mathematical and philosophical reasons behind their axioms are given, as well as their review from the commonsense point of view. An introduction to a \commonsense set theory" is attempted at the end.

The number of weighted random patterns depends on the sampling probability of the corresponding deterministic test pattern . Therefore if the weight set is extracted from the deterministic pattern set with high sampling probabilities, the test length can be shortened. In this paper we present a new multiple weight set generation algorithm that generates high performance weight sets by removing ...

Given an ensemble of distinct, low-level segmentations of an image, our goal is to identify visually “meaningful” segments in the ensemble. Knowledge about any specific objects and surfaces present in the image is not available. The selection of image regions occupied by objects is formalized as the maximum-weight independent set (MWIS) problem. MWIS is the heaviest subset of mutually non-adjac...