This paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   The main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

In this paper, using 2-D theory of elasticity, a closed-form solution is presented for stressdistributions and displacements of a FG curved beam under shear force at its free end. The materialproperties are assumed to vary continuously through the radial direction based on a simple power lawmodel and Poisson’s ratio is supposed to be constant. In order to verify the solution, it is shown that a...

Power flow optimization is generally nonlinear and non-convex, and a second-order cone relaxation has been proposed recently for convexification. We prove several sufficient conditions under which the relaxation is exact. One of these conditions seems particularly realistic and suggests guidelines on integrating distributed generations.

Based on credibilistic value-at-risk (CVaR) of regularfuzzy variable, we introduce a new CVaR reduction method fortype-2 fuzzy variables. The reduced fuzzy variables arecharacterized by parametric possibility distributions. We establishsome useful analytical expressions for mean values and secondorder moments of common reduced fuzzy variables. The convex properties of second order moments with ...

‎Radial basis functions (RBFs) are a powerful tool for approximating the solution of high-dimensional problems‎. ‎They are often referred to as a meshfree method and can be spectrally accurate‎. ‎In this paper, we analyze a new stable method for evaluating Gaussian radial basis function interpolants based on the eigenfunction expansion‎. ‎We develop our approach in two-dimensional spaces for so...

In this paper we study the classification of ancient convex solutions to the mean curvature flow in R n+1. An open problem related to the classification of type II singularities is whether a convex translating solution is k-rotationally symmetric for some integer 2 ≤ k ≤ n, namely whether its level set is a sphere or cylinder S k−1 × R n−k. In this paper we give an affirmative answer for entire...

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 papers presents a convex approximation method for the solution of nonconvex optimal control problems involving input-affine dynamic models. The method relies in the availability of full reference state trajectories. By using these states references as real states trajectories, the dynamic model is approximated such that the resulting problem becomes convex. The convexified problem is solve...