In the transformation semigroup (X, S) we introduce the height of a closed nonempty invariant subset of X, define the transformed dimension of nonempty subset S of X and obtain some results and relations.

It is proved that there are precisely 4204 pairwise non-isomorphic Steiner systems S(5, 6, 72) invariant under the group PSL2(71) and which can be constructed using only short orbits. It is further proved that there are precisely 38717 pairwise non-isomorphic Steiner systems S(5, 6, 84) invariant under the group PSL2(83) and which can be constructed using only short orbits.

Fullerene graphs are mathematical models of fullerene molecules. The Wiener (r,s)-complexity a graph G with vertex set V(G) is the number pairwise distinct values (r,s)-transmiss...

In this paper, we describe a coreference solver based on the extensive use of lexical features and features extracted from dependency graphs of the sentences. The solver uses Soon et al. (2001)’s classical resolution algorithm based on a pairwise classification of the mentions. We applied this solver to the closed track of the CoNLL 2011 shared task (Pradhan et al., 2011). We carried out a syst...

At every point, a smooth plane curve can be approximated, to second order, by a circle; this circle is called osculating. One may think of the osculating circle as passing through three infinitesimally close points of the curve. A vertex of the curve is a point at which the osculating circle hyper-osculates: it approximates the curve to third order. Equivalently, a vertex is a critical point of...

A partially ordered Abelian group M is algebraically (existentially) closed in a class C M of such structures just in case any finite system of weak inequalities (and negations of weak inequalities), defined over M, is solvable in M if solvable in some N ⊇ M in C. After characterizing existentially closed dimension groups this paper derives amalgamation properties for dimension groups, dimensio...

In this paper, we derive the exact pairwise error probabilities (PEPs) of various quasi-orthogonal space– time block codes (QO-STBCs) using the moment generating function. By classifying the exact PEPs of QO-STBCs into three types, we derive the closed-form expression for each type of PEP. Based on these closed-form expressions, we obtain the union bounds on the symbol error probability and bit...

Gauss words are finite sequences of letters associated with self-intersecting closed curves in the plane. (These curves have no “triple” self-intersection). These sequences encode the order of intersections on the curves. We characterize, up to homeomorphism, all curves having a given Gauss word. We extend this characterization to the n-tuples of closed curves having a given n-tuple of words, t...

We prove that the number of near-coherence classes of non-principal ultrafilters on the natural numbers is either finite or 2c. Moreover, in the latter case the Stone-Čech compactification βω of ω contains a closed subset C consisting of 2c pairwise non-nearly-coherent ultrafilters. We obtain some additional information about such closed sets under certain assumptions involving the cardinal cha...

 This paper presents a description of the MIT Lincoln Laboratory (MITLL) language recognition system developed for the NIST 2011 Language Recognition Evaluation (LRE). The submitted system consisted of a fusion of four core classifiers, three based on spectral similarity and one based on tokenization. Additional system improvements were achieved following the submission deadline. In a major de...