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

This paper proposes mathematical modeling and analysis of ferrofluid lubricated newly designed slider bearing having convex pad (surface or plate) stator with two porous layers attached to the slider. The problem considers the effect of slip velocity proposed by Sparrow et. al.[1] and modified by Shah et. al.[2] at the film-porous interface. The squeeze velocity V=−which appears when the upper ...

The lubrication performance of journal bearings with different sorts of uniformly distributed micro-spherical textures are studied in this paper. Geometries and dynamic models of journal bearings with pure concave/convex textures are developed. The validity of the proposed models is verified against the oil film pressure distribution from the literature. The effects of geometry parameters (the ...

Correlated multi-paths may cause a biased bearing estimation in shallow water, so most existing methods make fully use of the multi-path nature and the underwater channel property to provide an unbiased bearing estimation. However, an imprecise knowledge of the underwater channel parameters or the array model mismatches will cause performance degradation, especially for the high-resolution meth...

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

Convex 1-D first-order total variation (TV) denoising is an effective method for eliminating signal noise, which can be defined as convex optimization consisting of a quadratic data fidelity term and a non-convex regularization term. It not only ensures strict convex for optimization problems, but also improves the sparseness of the total variation term by introducing the non-convex penalty fun...