CNG Method for Authorship Attribution. The Common N-Grams (CNG) classification method for authorship attribution (AATT) was described in [2]. The method is based on extracting the most frequent byte n-grams of size n from the training data. The n-grams are sorted by their normalized frequency, and the first L most-frequent n-grams define an author profile. Given a test document, the test profil...

An iterative method for finding the center of a linear programming polytope is presented. The method assumes that we start at a feasible interior point and each iterate is obtained as a convex combination of the orthogonal projection on the half spaces defined by the linear inequalities plus a special projections on the same half spaces. The algorithm is particularly suitable for implementation...

We present a framework that yields a variety of weighted and vector-valued estimates for maximally modulated Calderón-Zygmund singular (and maximal singular) integrals from a single a priori weak type unweighted estimate for the maximal modulations of such operators. We discuss two approaches, one based on the good-λ method of Coifman and Fefferman [CF] and an alternative method employing the s...

It has been shown by Batyrev and Borisov that nef partitions of reflexive polyhedra can be used to construct mirror pairs of complete intersection Calabi–Yau manifolds in toric ambient spaces. We construct a number of such spaces and compute their cohomological data. We also discuss the relation of our results to complete intersections in weighted projective spaces and try to recover them as sp...

In this inequality, ∇ denotes the full gradient in R + : ∇ = (∂/∂x1, . . . , ∂/∂xd, ∂/∂y); R + is the usual upper half space Rd×(0,∞); μ is a positive Borel measure defined on R + ; and v is a non-negative function in Lloc(R d). We studied this inequality primarily for p and q in the range 1 < p ≤ q < ∞. For the case in which q ≥ 2, we proved sufficient conditions on μ and v (depending on p, q,...

This paper presents a new method for calculating operational-space inertia matrices, and other related quantities, for branched kinematic trees. It is based on the exploitation of branch-induced sparsity in the joint-space inertia matrix and the task Jacobian. Detailed cost figures are given for the new method, and its efficacy is demonstrated by means of a realistic example based on the ASIMO ...