Abstract We study the weak convergence of infinite products convex combinations operators in complete CAT(0) spaces. provide a new approach to this problem by considering constructive selection spaces that does not depend on order involved elements and retain continuity properties with respect them.

λ1 + . . .+ λm = 1, then we say that y is an affine combination of y1, . . . ,ym ∈Y . If, in addition, λi ≥ 0 for 1 ≤ i ≤ m, then we say that y is a convex combination of y1, . . . ,ym ∈ Y . A convex set is any subset of Rn that is closed under the operation of taking convex combinations. In fact, it can be shown that a subset X is convex if and only if for all x0,x1 ∈ X and 0 ≤ λ ≤ 1, the poin...

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

This article presents a quantitative approach to ganglion cell classification by considering combinations of several geometrical features including fractal dimension, symmetry, diameter, eccentricity and convex hull. Special attention is given to moment and symmetrybased features. Several combinations of such features are fed to two clustering methods (Ward’s hierarchical scheme and K-Means) an...

Abstract Uniform interpolants were largely studied in non-classical propositional logics since the nineties, and their connection to model completeness was pointed out literature. A successive parallel research line inside automated reasoning community investigated uniform quantifier-free (sometimes referred as “covers”) first-order theories. In this paper, we investigate cover transfer theory ...

Several computer algorithms for discovering patterns in groups of protein sequences are in use that are based on fitting the parameters of a statistical model to a group of related sequences. These include hidden Markov model (HMM) algorithms for multiple sequence alignment, and the MEME and Gibbs sampler algorithms for discovering motifs. These algorithms are sometimes prone to producing model...