نتایج جستجو برای: convex contaction
تعداد نتایج: 54795 فیلتر نتایج به سال:
in this paper, generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions. also, we show that there are examples which show that our main theorems are genuine generalizations of theorem 3.1 and 3.2 of cite{r}[ m.a. miandaragh, m. postolache, s. rezapour, textit{approximate fixed points of generalizedconvex contractions},...
In this paper, generalized convex contractions on orthogonal metric spaces are stablished in whath might be called their definitive versions. Also, we show that there are examples which show that our main theorems are genuine generalizations of Theorem 3.1 and 3.2 of [M.A. Miandaragh, M. Postolache and S. Rezapour, {it Approximate fixed points of generalized convex contractions}, Fixed Poi...
abstract: in this thesis, we focus to class of convex optimization problem whose objective function is given as a linear function and a convex function of a linear transformation of the decision variables and whose feasible region is a polytope. we show that there exists an optimal solution to this class of problems on a face of the constraint polytope of feasible region. based on this, we dev...
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 group has captured the technical details of the paper on “Graph indexing of road networks for shortest path queries with label restrictions” in their review. The reviewers have identified the problem, author is trying to solve in this paper and the challenges involved in it. The reviewers have presented the importance of this problem by some good real life examples related to logistics and...
The fundamental correlations between solubility and solvation structure for the electrolyte system comprising N-(ferrocenylmethyl)-N,N-dimethyl-N-ethylammonium bistrifluoromethylsulfonimide (Fc1N112-TFSI) dissolved in a ternary carbonate solvent mixture is analyzed using combined NMR relaxation and computational methods. Probing the evolution of the solvent−solvent, ion−solvent and ion−ion inte...
In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...
let $x$ be a real normed space, then $c(subseteq x)$ is functionally convex (briefly, $f$-convex), if $t(c)subseteq bbb r $ is convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$ is functionally closed (briefly, $f$-closed), if $t(k)subseteq bbb r $ is closed for all bounded linear transformations $tin b(x,r)$. we improve the krein-milman theorem ...
Pulmonary valve movement and the related acoustic phenomena were investigated using high speed strip-chart echoand phonocardiographic recording. The opening of the pulmonary valve had no definite relationship to the acoustic phenomena, whereas the pulmonary ejection sound was closely related in time to the early systolic maximal opening of the valve. The concomitant pulmonary ejection systolic ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید