background: appropriate endurance exercise can change bone mass density and strength of weight-bearing bones in both animals and humans, but its effects on the microstructure are not known. this study aimed to determine skeletal changes induced by the treadmill running endurance in ovariectomized adult mice. methods: twenty-seven adult female rats were divided into experimental and control grou...

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

In this paper, we present some common fixed point theorems for two generalized nonexpansive multivalued mappings in CAT(0) spaces as well as in UCED Banach spaces. Moreover, we prove the existence of fixed points for generalized nonexpansive multivalued mappings in complete geodesic metric spaces with convex metric for which the asymptotic center of a bounded sequence in a bounded closed convex...

In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

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

The reasonable design of biomimetic non-smooth surfaces is a novel and effective way to solve problems such as the poor lubricity serious friction wear pairs seawater axial piston pumps. Inspired by cross-scale, second-order compound microstructures on some living organisms, hydrodynamic lubrication model slipper pair with surface featuring spherical pits containing convex hulls was built. This...

nonnegative matrix factorization (nmf) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. methods in alternating least square (als) approach usually used to solve this non-convex minimization problem.  at each step of als algorithms two convex least square problems should be solved, which causes high com...