Gradients in free energies are the driving forces of physical and biochemical systems. To predict energy differences with high accuracy, Molecular Dynamics (MD) other methods based on atomistic Hamiltonians conduct sampling simulations intermediate thermodynamic states that bridge configuration space densities between two interest ('alchemical transformations'). For uncorrelated sampling, recen...

Our system treats coreference resolution as an integer linear programming (ILP) problem. Extending Denis and Baldridge (2007) and Finkel andManning (2008)’s work, we exploit loose transitivity constraints on coreference pairs. Instead of enforcing transitivity closure constraints, which brings O(n3) complexity, we employ a strategy to reduce the number of constraints without large performance d...

Abstract: In this paper, we analyze the pairwise error probability (PEP) of distributed space-time codes, in which the source and the relay generate Alamouti space-time code in a distributed fashion. We restrict our attention to the space-time code construction for Protocol III in Nabar et al. (IEEE Journal on Selected Areas Communications 22(6): 1099-1109, 2004). In particular, we derive two c...

In this paper a novel transmission scheme that combines non-orthogonal multiple access (NOMA) and multi-carrier index keying (MCIK) is proposed. This scheme is proposed as a mechanism to enable multiple access for dense wireless device-to-device (D2D) systems that require high energy efficiency and effective interference management. The performance of the proposed scheme is analyzed in terms of...

Given a set V of n elements we wish to linearly order them using pairwise preference labels which may be non-transitive (due to irrationality or arbitrary noise). The goal is to linearly order the elements while disagreeing with as few pairwise preference labels as possible. Our performance is measured by two parameters: The number of disagreements (loss) and the query complexity (number of pai...

This paper aims to develop simple statistical methods for indexing line patterns. The application vehicle used in this study involves indexing into an aerial image database using a cartographic model. The images contained in the database are of urban and semi-urban areas. The cartographic model represents a road network known to appear in a subset of the images contained within the database. Th...

This paper presents the performance of Space-Time (ST) codes over rapid fading channels. A tight upper bound on the pairwise error probability (PWEP) of ST codes over rapid fading channels is derived. Also, an upper bound on the bit error probability (BEP) is evaluated using the derived PWEP. The existing and new bounds are evaluated for different QPSK ST codes and compared to the simulation re...

Jackson and Watts (J Econ Theory 71: 44–74, 2002) have examined the dynamic formation and stochastic evolution of networks. We provide a refinement of pairwise stability, p-pairwise stability, which allows us to characterize the stochastically stable networks without requiring the “tree construction” and the computation of resistance that may be quite complex. When a 1 2 -pairwise stable networ...

in the present paper we introduce and study the notion of pairwise weakly lindelof bitopological spaces and obtain some results. further, we also study the pairwise weakly lindelof subspaces and subsets, and investigate some of their properties. it was proved that a pairwise weakly lindelof property is not a hereditary property.

In a previous paper we showed that, for any , most sets of points in are determined (up to rotations, reflections, translations and relabeling of the points) by the distribution of their pairwise distances. But there are some exceptional point configurations which are not reconstructible from the distribution of distances in the above sense. In this paper, we concentrate on the planar case and ...