SUMMARY Given the positions of protein-coding genes along genomic sequence and probability values for protein alignments between genes, DAGchainer identifies chains of gene pairs sharing conserved order between genomic regions, by identifying paths through a directed acyclic graph (DAG). These chains of collinear gene pairs can represent segmentally duplicated regions and genes within a single ...

Traditionally, research into circuit-switched (C-S) networks has been divided into two areas, reliability and performance, each making little reference to the other. More recently, however, research has focused on unification of the two. One possible choice for a combined performance and reliability measure is the overall network grade-of-service (NGOS), i.e. the overall probability of blocking...

Motivated by applications in online dating and kidney exchange, we study a stochastic matching problem in which we have a random graph G given by a node set V and probabilities p(i, j) on all pairs i, j ∈ V representing the probability that edge (i, j) exists. Additionally, each node has an integer weight t(i) called its patience parameter. Nodes represent agents in a matching market with dicho...

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...

Traditionally, research into circuit-switched (C-S) networks has been divided into two areas, reliability and performance, each making little reference to the other. More recently, however, research has focused on unification of the two. One possible choice for a combined performance and reliability measure is the overall network grade-of-service (NGOS), i.e. the overall probability of blocking...

In this paper, we extend the concept of classical f -divergence (for a pair of measures) to mixed f -divergence (for multiple pairs of measures). Mixed f -divergence provides a way to measure the difference between multiple pairs of probability distributions. Properties for mixed f -divergence are established, such as permutation invariance and symmetry in distributions. We also provide an Alex...

We consider the dynamics of diffusing particles in one space dimension with annihilation on collision and nucleation (creation of particles) with constant probability per unit time and length. The cases of nucleation of single particles and nucleation in pairs are considered. A new method of analysis permits exact calculation of the steady state density and its time evolution in terms of the th...

We propose to score phrase translation pairs for statistical machine translation using term weight based models. These models employ tf.idf to encode the weights of content and non-content words in phrase translation pairs. The translation probability is then modeled by similarity functions defined in a vector space. Two similarity functions are compared. Using these models in a statistical mac...