UrduAI: Writeprints for Urdu Authorship Identification

The authorship identification task aims at identifying the original author of an anonymous text sample from a set of candidate authors. It has several application domains such as digital text forensics and information retrieval. These application domains are not limited to a specific language. However, most of the authorship identification studies are focused on English and limited attention has been paid to Urdu. However, existing Urdu authorship identification solutions drop accuracy as the number of training samples per candidate author reduces and when the number of candidate authors increases. Consequently, these solutions are inapplicable to real-world cases. Moreover, due to the unavailability of reliable POS taggers or sentence segmenters, all existing authorship identification studies on Urdu text are limited to the word n-grams features only. To overcome these limitations, we formulate a stylometric feature space, which is not limited to the word n-grams feature only. Based on this feature space, we use an authorship identification solution that transforms each text sample into a point set, retrieves candidate text samples, and relies on the nearest neighbors classifier to predict the original author of the anonymous text sample. To evaluate our solution, we create a significantly larger corpus than existing studies and conduct several experimental studies that show that our solution can overcome the limitations of existing studies and report an accuracy level of 94.03%, which is higher than all previous authorship identification works.

3D Reconstruction with Coronary Artery Based on Curve Descriptor and Projection Geometry-Constrained Vasculature Matching

This paper presents a novel method based on a curve descriptor and projection geometry constrained for vessel matching. First, an LM (Leveberg–Marquardt) algorithm is proposed to optimize the matrix of geometric transformation. Combining with parameter adjusting and the trust region method, the error between 3D reconstructed vessel projection and the actual vessel can be minimized. Then, CBOCD (curvature and brightness order curve descriptor) is proposed to indicate the degree of the self-occlusion of blood vessels during angiography. Next, the error matrix constructed from the error of epipolar matching is used in point pairs matching of the vascular through dynamic programming. Finally, the recorded radius of vessels helps to construct ellipse cross-sections and samples on it to get a point set around the centerline and the point set is converted to mesh for reconstructing the surface of vessels. The validity and applicability of the proposed methods have been verified through experiments that result in the significant improvement of 3D reconstruction accuracy in terms of average back-projection errors. Simultaneously, due to precise point-pair matching, the smoothness of the reconstructed 3D coronary artery is guaranteed.

A Note on the Abelian Complexity of the Rudin-Shapiro Sequence

Let {r(n)}n≥0 be the Rudin-Shapiro sequence, and let ρ(n):=max{∑j=ii+n−1r(j)∣i≥0}+1 be the abelian complexity function of the Rudin-Shapiro sequence. In this note, we show that the function ρ(n) has many similarities with the classical summatory function Sr(n):=∑i=0nr(i). In particular, we prove that for every positive integer n, 3≤ρ(n)n≤3. Moreover, the point set {ρ(n)n:n≥1} is dense in [3,3].

Counting Non-Convex 5-Holes in a Planar Point Set

Let S be a set of n points in the general position, that is, no three points in S are collinear. A simple k-gon with all corners in S such that its interior avoids any point of S is called a k-hole. In this paper, we present the first algorithm that counts the number of non-convex 5-holes in S. To our best knowledge, prior to this work there was no known algorithm in the literature except a trivial brute force algorithm. Our algorithm runs in time O(T+Q), where T denotes the number of 3-holes, or empty triangles, in S and Q that denotes the number of non-convex 4-holes in S. Note that T+Q ranges from Ω(n2) to O(n3), while its expected number is Θ(n2logn) when the points in S are chosen uniformly and independently at random from a convex and bounded body in the plane.

2-Point set domination in separable graphs

In a graph [Formula: see text], a set [Formula: see text] is a [Formula: see text]-point set dominating set (in short 2-psd set) of [Formula: see text] if for every subset [Formula: see text] there exists a nonempty subset [Formula: see text] containing at most two vertices such that the induced subgraph [Formula: see text] is connected in [Formula: see text]. The [Formula: see text]-point set domination number of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality of a 2-psd set of [Formula: see text]. The main focus of this paper is to find the value of [Formula: see text] for a separable graph and thereafter computing [Formula: see text] for some well-known classes of separable graphs. Further we classify the set of all 2-psd sets of a separable graph into six disjoint classes and study the existence of minimum 2-psd sets in each class.

Computational approach to solving problems of spatial processing of point sets on two-dimensional regular grids

The paper presents an approach to solving problems of spatial processing on sets of points on a plane. The presented method consists in plotting regions of an arbitrary geometric shape near given points of the set on a regular grid and determining the intersection points of the regions using spatial hash tables to improve the efficiency of operations. The proposed approach is implemented in the form of software for determining the spatial relationships between points as a sequence of operations with discretized sets and allows visualization of research results. Figs.: 2. Refs.: 13. Keywords: spatial processing task; point set; plane; regular grid; spatial hash table.

Magnifying Elements in Semigroups of Fixed Point Set Transformations Restricted by an Equivalence Relation

Let X be a nonempty set and ρ be an equivalence relation on X . For a nonempty subset S of X , we denote the semigroup of transformations restricted by an equivalence relation ρ fixing S pointwise by E F S X , ρ . In this paper, magnifying elements in E F S X , ρ will be investigated. Moreover, we will give the necessary and sufficient conditions for elements in E F S X , ρ to be right or left magnifying elements.

Groups \(S_n \times S_m\) in construction of flag-transitive block designs

In this paper, we observe the possibility that the group \(S_{n}\times S_{m}\) acts as a flag-transitive automorphism group of a block design with point set \(\{1,\ldots ,n\}\times \{1,\ldots ,m\},4\leq n\leq m\leq 70\). We prove the equivalence of that problem to the existence of an appropriately defined smaller flag-transitive incidence structure. By developing and applying several algorithms for the construction of the latter structure, we manage to solve the existence problem for the desired designs with \(nm\) points in the given range. In the vast majority of the cases with confirmed existence, we obtain all possible structures up to isomorphism.