This paper addresses the task of finding acronym-definition pairs in text. Most of the previous work on the topic is about systems that involve manually generated rules or regular expressions. In this paper, we present a supervised learning approach to the acronym identification task. Our approach reduces the search space of the supervised learning system by putting some weak constraints on the...

We generalize the notions of F-regular and F-pure rings to those for a pair (R, a) of a ring R and an ideal a ⊂ R with real exponent t > 0, and investigate those properties. Those “F-singularities of pairs” correspond to singularities of pairs of arbitrary codimension in birational geometry. Via this correspondence, we prove Inversion of Adjunction of arbitrary codimension, which states that fo...

The polygons arising from a planar Poisson line process have an exponential distribution of their side lengths and are known to be more regular as their area, perimeter or number of sides increase. Local regions with higher line density have smaller polygon side lengths and conversely. Numerical analysis of computer generated Poisson line processes shows that when pairs of adjacent polygon side...

An oriented graph dominates pairs if for every pair of vertices u, v, there exists a vertex w such that the edges ~ wu and ~ wv both lie in G. We construct regular oriented triangle free graphs with this property, and thereby we disprove a conjecture of Myers. We also construct oriented graphs for which each pair of vertices is dominated by a unique vertex.

This note proves a generalisation to inverse semigroups of Anisimov's theorem that a group has regular word problem if and only if it is finite, answering a question of Stuart Margolis. The notion of word problem used is the two-tape word problem – the set of all pairs of words over a generating set for the semigroup which both represent the same element.

We present a dialogue annotation scheme for both spoken and written interaction, and use it in a telephone transaction corpus and an email corpus. We train classifiers, comparing regular SVM and structured SVM against a heuristic baseline. We provide a novel application of structured SVM to predicting relations between instance pairs.

Free-form deformation (FFD) is widely used in deformable image registration. FFD uses a regular grid of control points to generate image deformation. Accurate optimization of the control-point displacement relies on an appropriate initial-deformation of the regular grid. In this work, a hybrid registration of landmark-based and free-form deformation is proposed and applied to lung CT images. Co...

Let S be a closed oriented surface of genus at least two. Labourie and the author have independently used the theory of hyperbolic affine spheres to find a natural correspondence between convex RP structures on S and pairs (Σ, U) consisting of a conformal structure Σ on S and a holomorphic cubic differential U over Σ. The pairs (Σ, U), for Σ varying in moduli space, allow us to define natural h...

Let [Formula: see text] be a text]-dimensional quantum polynomial algebra, and central regular element. The quotient algebra is called noncommutative conic. For conic text], there finite-dimensional which determines the singularity of text]. In this paper, we mainly focus on such that its quadratic dual commutative, equivalent to say, determined by symmetric superpotential. We classify these co...

A new relation between morphisms in a category is introduced – roughly speaking (accurately in the categories Set and Top), f ‖ g iff morphisms w : dom(f) → dom(g) never map subobjects of fibres of f non-constantly to fibres of g. (In the algebraic setting replace fibre with kernel.) This relation and a slight weakening of it are used to define “connectedness” versus “disconnectedness” for morp...