Let $A$ be a Banach ternary algebra over a scalar field $Bbb R$ or $Bbb C$ and $X$ be a ternary Banach $A$--module. Let $sigma,tau$ and $xi$ be linear mappings on $A$, a linear mapping $D:(A,[~]_A)to (X,[~]_X)$ is called a Lie ternary $(sigma,tau,xi)$--derivation, if $$D([a,b,c])=[[D(a)bc]_X]_{(sigma,tau,xi)}-[[D(c)ba]_X]_{(sigma,tau,xi)}$$ for all $a,b,cin A$, where $[abc]_{(sigma,tau,xi)}=ata...

Languages such as High Performance Fortran implement parallel algorithms by distributing large data structures across a multicomputer system. To enhance parallelism and reduce communication, it is sometimes bene cial for a programmer to change the distribution between phases of the algorithm. We introduce a new mapping strategy, called the spiral mapping, that reduces the communication overhead...

The aim of this note is twofold. First, we prove an analogue of the wellknownRobinson–Ursescu Theorem on the relative openness with a linear rate (restrictive metric regularity) of a multivalued mapping. Second, we prove a generalization of Graves Open Mapping Theorem for a class of mappings which can be approximated at a reference point by a bunch of linear mappings. The approximated non-linea...

For object classification and detection, the algorithm pipeline often involves classifying feature vectors extracted from image patches. Existing features such as HOG, fail to map the image patches into a space where a linear hyperplane is suitable for separating the classes, while many non-linear classification methods are too expensive for many tasks. We propose a sparse tree-based mapping me...

Some mixtures, such as colloids like milk, blood, and gelatin, have homogeneous appearance when viewed with the naked eye, however, to observe them at the nanoscale is possible to understand the heterogeneity of its components. The same phenomenon can occur in pattern recognition in which it is possible to see heterogeneous patterns in texture images. However, current methods of texture analysi...

1 Linear algebra and geometry on R, C If m, n are positive integers, we shall denote by L(R,R) the space of reallinear mappings from R to R, and by L(C,C) the space of complexlinear mappings from C to C. In the special case where m = n, we may simply write L(R), L(C), respectively. Also when m = n, we write I for the identity mapping on R or C, as appropriate. Using the standard basis for real ...

We study moments and asymptotic distributions of the construction cost, measured as the total displacement, for hash tables using linear probing. Four different methods are employed for different ranges of the parameters; together they yield a complete description. This extends earlier results by Flajolet, Poblete and Viola. The average cost of unsuccessful searches is considered too.

In this paper, we introduce a new piecewise linear parameterization of 3D surface patches which provides a basis for texture mapping, morphing, remeshing, and geometry imaging. To lower distortion when flatting a 3D surface patch, we propose a new method to locally calculate straightest distances with cutting planes. Our new and simple technique demonstrates competitive results to the current l...