While machine learning methods for named entity recognition (mention-level detection) have become common, machine learning methods have rarely been applied to normalization (concept-level identification). Recent research introduced a machine learning method for normalization based on pairwise learning to rank. This method, DNorm, uses a linear model to score the similarity between mentions and ...

in this paper, we verify the solvability of free product of finite cyclic groups with topological methods. we use cayley graphs and everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. in particular, using these methods, we prove that the commutator subgroup of $mathbb{z}_{m}*mathbb{z}_{n}$ is free of rank $(m-1)(n-1)$ fo...

in this paper we classify fuzzy subgroups of a rank-3 abelian group $g = mathbb{z}_{p^n} + mathbb{z}_p + mathbb{z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. we present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...

In order to find elliptic curves over Q with large rank, J.-F. Mestre [1991] constructed an infinite family of elliptic curves with rank at least 12. Then K. Nagao [1994] and S. Kihara [1997b] found infinite subfamilies of rank 13 and 14, respectively. By specialization, elliptic curves of rank at least 21 [Nagao and Kouya 1994], 22 [Fermigier 1997], and 23 [Martin and McMillen 1997] have also ...

In this paper we classify fuzzy subgroups of a rank-3 abelian group $G = mathbb{Z}_{p^n} + mathbb{Z}_p + mathbb{Z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. We present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...

In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...

We begin by reviewing the basic goal in the Markov Chain Monte Carlo paradigm. Assume a finite state space Ω and a weight function w : Ω → <. Our goal is to design a sampling process which samples every element x ∈ Ω with the probability w(x) Z where Z = ∑ x∈Ω w(x) is the normalization factor. Often times, we don’t know the normalization factor Z apriori, and in some problems, the real goal is ...

This paper describes the Twitter lexical normalization system submitted by IHS R&D Belarus team for the ACL 2015 workshop on noisy user-generated text. The proposed system consists of two components: a CRFbased approach to identify possible normalization candidates, and a post-processing step in an attempt to normalize words that do not have normalization variants in the lexicon. Evaluation on ...