soil slopes are sometimes curved in plan rather than being straight. this curvature,especially when it is convex, decreases the bearing capacity of the slope. finite element methodhas been used here in this research to investigate the reducing effect of curvature on bearingcapacity of a slope. failure of soil has been assumed to be according to mohr-coulomb criteria;but the flow rule of the soi...

‎We use of two notions functionally convex (briefly‎, ‎F--convex) and functionally closed (briefly‎, ‎F--closed) in functional analysis and obtain more results‎. ‎We show that if $lbrace A_{alpha} rbrace _{alpha in I}$ is a family $F$--convex subsets with non empty intersection of a Banach space $X$‎, ‎then $bigcup_{alphain I}A_{alpha}$ is F--convex‎. ‎Moreover‎, ‎we introduce new definition o...

in this paper, the gradual real numbers are considered and the notion of the gradual normed linear space is given. also some topological properties of such spaces are studied, and it is shown that the gradual normed linear space is a locally convex space, in classical sense. so the results in locally convex spaces can be translated in gradual normed linear spaces. finally, we give an examp...

this paper uses integrated data envelopment analysis (dea) models to rank all extreme and non-extreme efficient decision making units (dmus) and then applies integrated dea ranking method as a criterion to modify genetic algorithm (ga) for finding pareto optimal solutions of a multi objective programming (mop) problem. the researchers have used ranking method as a shortcut way to modify ga to d...

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...

In this paper, the gradual real numbers are considered and the notion of the gradual normed linear space is given. Also some topological properties of such spaces are studied, and it is shown that the gradual normed linear space is a locally convex space, in classical sense. So the results in locally convex spaces can be translated in gradual normed linear spaces. Finally, we give an examp...