LetK be a nonempty closed convex subset of a real Hilbert space H , and assume that Ti : K → H, i = 1, 2...N be a finite family of ki-strictly pseudo-contractive mappings for some 0 ≤ ki ≤ 1 such that ⋂N i=1 F (Ti) = {x ∈ K : x = Tix, i = 1, 2...N} = ∅. For the following iterative algorithm in K, for x1, x ′ 1 ∈ K and u ∈ K, { yn = PK [kxn + (1− k)Σi=1λiTixn] xn+1 = βnxn + (1− βn)yn and { y′ n ...

Let K be a compact subset of the complex n-space and A(K) the algebra of all continuous functions on K which are holomorphic on the interior of K. In this paper we show that under some hypotheses on K, there exists no linear isometry of finite codimension on A(K). Several compact subsets including the closure of strictly pseudoconvex domain and the product of the closure of plane domains which ...

let r be a ring, m a right r-module and (s,≤) a strictly ordered monoid. in this paper we will show that if (s,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ s, then the module [[ms,≤]] of generalized power series is a uniserial right [[rs,≤]] ]]-module if and only if m is a simple right r-module and s is a chain monoid.

Let R be a ring, M a right R-module and (S,≤) a strictly ordered monoid. In this paper we will show that if (S,≤) is a strictly ordered monoid satisfying the condition that 0 ≤ s for all s ∈ S, then the module [[MS,≤]] of generalized power series is a uniserial right [[RS,≤]] ]]-module if and only if M is a simple right R-module and S is a chain monoid.

We consider the problem F = f(ν) for strictly convex, closed hypersurfaces in H and solve it for curvature functions F the inverses of which are of class (K).

We determine, asymptotically in n, the distribution of the weight of a minimum-weight k-clique (or any strictly balanced graph H) in a randomly edge-weighted complete graph Kn.

We consider the problem F = f(ν) for strictly convex, closed hypersurfaces in S and solve it for curvature functions F the inverses of which are of class (K).

‎a full nesterov-todd (nt) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using euclidean jordan algebra‎. ‎two types of‎ ‎full nt-steps are used‎, ‎feasibility steps and centering steps‎. ‎the‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

BACKGROUND Melanoma is a heterogeneous tumor in which phenotype-switching and CD133 marker have been associated with metastasis promotion and chemotherapy resistance. CD133 positive (CD133+) subpopulation has also been suggested as putative cancer stem cell (CSC) of melanoma tumor. Human endogenous retrovirus type K (HERV-K) has been described to be aberrantly activated during melanoma progress...