using the fixed point theorem in a‎ ‎cone‎, ‎the existence and multiplicity of radial convex solutions of‎ ‎singular system of monge-amp`{e}re equations are established‎.‎

The presented paper attempts to establish a generalized approach the development of embedded systems multimedia applications. It is formalized in form framework that defines rules and recommenda- tions for developer on how implement specific pieces software work with data. basis process division system’s func- tionality into stages following each stage. also touch sensor events may be elaborate...

In this paper, we first introduce the notion of $c$-affine functions for $c> 0$. Then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. Moreover, a Hyers–-Ulam stability result for strongly convex functions is shown.

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

This prospec ve study was performed in pa ents aged 65 years or older who underwent hip fracture surgery. The objec ve was to determine the func onal evolu on in a group of pa ents three months a er hospital discharge, to iden fy the variables related to this func onal recovery and to describe the associated mortality and instu onaliza on process. We analyzed demographic variables such as age, ...