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

We prove a classification theorem of the “Glimm–Effros” type for Borel order relations: a Borel partial order on the reals either is Borel linearizable or includes a copy of a certain Borel partial order ≤0 which is not Borel linearizable. Notation. A binary relation 4 on a set X is a partial quasi-order , or p.q.-o. in brief, on X, iff x 4 y∧y 4 z ⇒ x 4 z, and x 4 x for any x ∈ X. In this case...

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

Let H be a quasi-Hopf algebra. We show that any H-bimodule coalgebra C for which there exists an H-bimodule coalgebra morphism ν : C → H is isomorphic to what we will call a smash product coalgebra. To this end, we use an explicit monoidal equivalence between the category of two-sided two-cosided Hopf modules over H and the category of left Yetter-Drinfeld modules over H. This categorical metho...

A basis B of a finite dimensional Hopf algebra H is said to be positive if all the structure constants of H relative to B are non-negative. A quasi triangular structure R ∈ H ⊗ H is said to be positive with respect to B if it has non-negative coefficients in the basis B ⊗ B of H ⊗ H. In our earlier work, we have classified all finite dimensional Hopf algebras with positive bases. In this paper,...

If H is a quasi-Hopf algebra and B is a right H-comodule algebra such that there exists v : H → B a morphism of right H-comodule algebras, we prove that there exists a left Hmodule algebra A such that B ≃ A#H . The main difference comparing to the Hopf case is that, from the multiplication of B, which is associative, we have to obtain the multiplication of A, which in general is not; for this w...

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