We construct an algorithm for a cylindrical cell decomposition of a closed cube In ⊂ Rn compatible with a “restricted” sub-Pfaffian subset Y ⊂ In, provided an oracle deciding consistency of a system of Pfaffian equations and inequalities is given. In particular, the algorithm produces the complement Ỹ = In \Y . The complexity bound of the algorithm, the number and formats of cells are doubly ex...

begin{abstract} In this paper, we introduce an iterative method for amenable semigroup of non expansive mappings and infinite family of non expansive mappings in the frame work of Hilbert spaces. We prove the strong convergence of the proposed iterative algorithm to the unique solution of a variational inequality, which is the optimality condition for a minimization problem. The results present...

Estimates of covariances and sire expected progeny differences of additive and nonadditive direct and maternal genetic effects for birth and weaning weights were obtained using records from 1,581 straightbred and crossbred calves from the Angus-Brahman multibreed herd at the University of Florida. Covariances were estimated by Restricted Maximum Likelihood, using a Generalized Expectation-Maxim...

A Mal’tsev operation is a ternary operation φ that satisfies the identities φ(x, y, y) = φ(y, y, x) = x. Constraint satisfaction problems involving constraints invariant under a Mal’tsev operation constitute an important class of constraint satisfaction problems, which includes the affine satisfiability problem, subgroup and near subgroup constraints, and many others. It is also known that any ...

We investigate a variant of the longest common subsequence problem. Given two sequences X, Y and two constrained patterns P , Q of lengths m, n, p, and q, respectively, the hybrid constrained longest common subsequence problem is to find a longest common subsequence of X and Y such that the resulting LCS is both a supersequence of P and a nonsupersequence of Q. Without loss of generality, assum...

A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u in y. The concept generalises the notion of periods of a string. An integer array C is the minimal-cover (resp. maximal-cover) array of y if C [i] is the minimal (resp. maximal) length of covers of y[0 . . i], or zero if no cover exists. In this paper, we present a constructive algorithm checking...

Given a stationary time series X and another stationary time series Y (with a different power spectral density), we describe an algorithm for constructing a stationary time series Z that contains exactly the same values as X permuted in an order such that the power spectral density of Z closely resembles that of Y. We call this method spectral mimicry. We prove (under certain restrictions) that...

We consider random multivariate quadtries obtained from n points independently and uniformly distributed on the unit cube of Rd. Let Nn(y) be the complexity of the standard partial match algorithm for fixed vector y, where y is a vector in Rs, 0 < s < d. We study Nn = supy Nn(y), the worst-case time for partial match. Among other things, we show that partial match is very stable, in the sense t...

This paper presents an algorithm for computing Longest Common Subsequences for two sequences. Given two strings X and Y of length m and n, we present a greedy algorithm, which requires O(n log s) preprocessing time, where s is distinct symbols appearing in string Y and O(m) time to determines Longest Common Subsequences.

A supervised algorithm for computing perceptual groupings in dot patterns is presented. The algorithm uses shape features of the polygons in the Voronoi tessellation of the input pattern. The training patterns identified b y humans are used to obtain an initial noncontextual classification which is then refined b y a probabilistic relaxation labeling.