This work proposes a new method for computing acceptance regions of exact multinomial tests. From this an algorithm is derived, which finds p-values tests simple hypotheses. Using concepts from discrete convex analysis, the proven to be various popular test statistics, including Pearson’s Chi-square and log-likelihood ratio. The proposed improves greatly on naive approach using full enumeration...

Based on the Bezout approach we propose a simple algorithm to determine gcd of two polynomials that don't need division, like Euclidean algorithm, or determinant calculations, Sylvester matrix algorithm. The needs only n steps for degree n. Formal manipulations give discriminant resultant any without needing division calculation.

There are three domains in living nature: archaea, bacteria and eukarya. It has been shown, trough a number of multivariate tools, that codon usage, a 64 dimensional vector that stablishes how often a given organism makes use of each codon, is related to domain. Another method is proposed here based in rule and tree induction from codon usage of several organisms. It is shown that domain can be...

We introduce an efficient algorithm for mining informative combinations of attribute-values for a given task. We use informative attributevalues to enhance the input representation of data. We apply our approach to coreference resolution using a simple set of attributes like syntactic roles and string match. With the enhanced representation, a simple coreference model outperforms more complex s...

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...