Related papers: Low Correlation Sequences from Linear Combinations…
We formulate a mean-field-like theory of long-range correlated $L$-alphabets sequences, which are actually systems with $(L-1)$ independent parameters. Depending on the values of these parameters, the variance on the average number of any…
In this paper we express the difference of two complementary Beatty sequences, as the sum of two Beatty sequences closely related to them. In the process we introduce a new Algorithm that generalizes the well known Minimum Excluded…
In this paper, we propose a computationally simple estimator of the asymptotic covariance matrix of the Principal Components (PC) factors valid in the presence of cross-correlated idiosyncratic components. The proposed estimator of the…
We estimate multiplicative character sums taken on the values of a non-homogeneous Beatty sequence $\{[\alpha n + \beta] : n =1,2,... \}$, where $\alpha,\beta\in\R$, and $\alpha$ is irrational. Our bounds are nontrivial over the same short…
We define two a priori tests of pseudo-random number generators for the class of linear matrix-recursions. The first desirable property of a random number generator is the smallness of serial or lagged correlations between generated…
A superposition of a matrix ensemble refers to the ensemble constructed from two independent copies of the original, while a decimation refers to the formation of a new ensemble by observing only every second eigenvalue. In the cases of the…
Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show…
The interpretation of defect models heavily relies on software metrics that are used to construct them. However, such software metrics are often correlated to defect models. Prior work often uses feature selection techniques to remove…
Words in some natural languages can have a composite structure. Elements of this structure include the root (that could also be composite), prefixes and suffixes with which various nuances and relations to other words can be expressed.…
In a controlled experiment of sequence-to-sequence approaches for the task of sentence correction, we find that character-based models are generally more effective than word-based models and models that encode subword information via…
We consider the problem of embedding character-entity relationships from the reduced semantic space of narratives, proposing and evaluating the assumption that these relationships hold under a reflection operation. We analyze this…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
Minimum Bayes Risk (MBR) decoding is a text generation technique that has been shown to improve the quality of machine translations, but is expensive, even if a sampling-based approximation is used. Besides requiring a large number of…
We consider an ensemble of constant composition codes that are subsets of linear codes: while the encoder uses only the constant-composition subcode, the decoder operates as if the full linear code was used, with the motivation of…
The analysis of correlations of amino acid occurrences in globular proteins has led to the development of statistical tools that can identify native contacts -- portions of the chains that come to close distance in folded structural…
In this paper, we describe minimal string attractors (of size two) of pseudopalindromic prefixes of standard complementary-symmetric Rote sequences. Such a class of Rote sequences forms a subclass of binary generalized pseudostandard…
Many real-world systems give rise to a time series of symbols. The elements in a sequence can be generated by agents walking over a networked space so that whenever a node is visited the corresponding symbol is generated. In many situations…
Three measures of pseudorandomness of finite binary sequences were introduced by Mauduit and S\'ark\"ozy in 1997 and have been studied extensively since then: the normality measure, the well-distribution measure, and the correlation measure…
Previous work has modeled the compositionality of words by creating character-level models of meaning, reducing problems of sparsity for rare words. However, in many writing systems compositionality has an effect even on the…
In this work, we propose an ensemble of classification trees (CT) and artificial neural networks (ANN). Several statistical properties including universal consistency and upper bound of an important parameter of the proposed classifier are…