One of the most important advantages of constraint databases is their ability to represent and to manipulate data in arbitrary dimension within a uniform framework. Although the complexity of querying such databases by standard means such as rst-order queries has been shown to be tractable for reasonable constraints (e.g. polynomial), it depends badly (roughly speaking exponentially) upon the d...

Abstract Polynomial splines are ubiquitous in the fields of computer-aided geometric design and computational analysis. Splines on T-meshes, especially, have potential to be incredibly versatile since local mesh adaptivity enables efficient modeling approximation features. Meaningful use such for requires construction a suitable spanning set linearly independent splines, theoretical understandi...

The basic idea behind LBP is that an image is composed of micropatterns. A histogram of these micropatterns contains information about the local features in an image. These micropatterns can be divided into two types: uniform and non-uniform. In standard applications using LBP, only the uniform patterns are used. The non-uniform patterns are considered in only a single bin of the histogram that...

The authors consider the generalized airfoil equation in some weighted Hölder–Zygmund spaces with uniform norms. Using a projection method based on the de la Vallée Poussin interpolation, they find an approximate polynomial solution which converges to the original solution like the best uniform weighted polynomial approximation. The proposed numerical procedure leads to solve a tridiagonal line...

In this article, we give a partial description of the sandpile group of the cone of the cartesian product of graphs in function of the sandpile group of the cone of their factors. Also, we introduce the concept of uniform homomorphism of graphs and prove that every surjective uniform homomorphism of graphs induces an injective homomorphism between their sandpile groups. As an application of the...

We present an algorithm for solving stochastic heat equations, whose key ingredient is a non-uniform time discretization of the driving Brownian motion W . For this algorithm we derive an error bound in terms of its number of evaluations of onedimensional components of W . The rate of convergence depends on the spatial dimension of the heat equation and on the decay of the eigenfunctions of the...

Recently Hochstättler and Nešetřil [3] introduced the flow lattice of an oriented matroid as generalization of the lattice of all integer flows of a digraph or more general a regular matroid. This lattice is defined as the integer hull of the characteristic vectors of signed circuits. We describe the structure and the dimension of the flow lattice for uniform and rank 3 oriented matroids and co...

The main result is that, for any projective compact analytic subset Y of dimension q > 0 in a reduced complex space X , there is a neighborhood Ω of Y such that, for any covering space Υ: X̂ → X in which Ŷ ≡ Υ(Y ) has no noncompact connected analytic subsets of pure dimension q with only compact irreducible components, there exists a C∞ exhaustion function φ on X̂ which is strongly q-convex on Ω̂ ...

The experiment compared reversal shift, wherein the assignment of stimuli to categories changed but the relevant dimension did not change, to extradimensional shift, wherein a different dimension was made relevant after training. Chronic schizophrenics were trained to the same consecutive correct response criterion in a three-choice form or color discrimination and shifted to one of four possib...

The prior statistics of object colors is of much interest because extensive statistical investigations of reflectance spectra reveal highly non-uniform structure in color space common to several very different databases. This common structure is due to the visual system rather than to the statistics of environmental structure. Analysis involves an investigation of the proper sample space of spe...