this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

the purpose of this paper is to propose a compositeiterative scheme for approximating a common solution for a finitefamily of m-accretive operators in a strictly convex banach spacehaving a uniformly gateaux differentiable norm. as a consequence,the strong convergence of the scheme for a common fixed point ofa finite family of pseudocontractive mappings is also obtained.

The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...

The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in addition, the game is succinct, i.e., the c...

Commonly-preserved radial convolution is a prominent characteristic of the mammalian cerebral cortex. Endeavors from multiple disciplines have been devoted for decades to explore the causes for this enigmatic structure. However, the underlying mechanisms that lead to consistent cortical convolution patterns still remain poorly understood. In this work, inspired by prior studies, we propose and ...

This paper discusses a connection between scalar convex conservation laws and Pontryagin’s minimum principle. For flux functions for which an associated optimal control problem can be found, a minimum value solution of the conservation law is proposed. For scalar space-independent convex conservation laws such a control problem exists and the minimum value solution of the conservation law is eq...

It was proved that a blow-up solution to the mean curvature flow with positive mean curvature is an ancient convex solution, that is a convex solution which exists for time t from −∞. In this paper we study the geometry of ancient convex solutions. Our main results are contained in Theorems 1-3 below. Theorem 1 asserts that after normalization, the solution converges to a sphere or cylinder as ...

It is known that interpolation with radial basis functions of the same shape can guarantee a non-singular interpolation matrix, whereas little is known when one uses various shapes. In this paper, we prove that a class of compactly supported radial basis functions are convex on a certain region; based on this local convexity and ready local geometrical property of the interpolation points, we c...

Let G be a finite set in the plane. A point x / ∈ G is called a radial point of G, if every line through x and a point from G includes at least two points of G. In this paper we show that for any line l not passing through the convex hull of G there are at most ( 9 10 + o(1))|G| radial points separated from G by l. As a consequence we prove two nice geometric applications in the plane.

The convex–concave rule is considered an important theory during treatment decision-making (Kirby et al., 2007). According to this rule (Fig. 1) the therapist moves a bone with a convex joint surface opposite to the direction of restricted movement of the distal aspect of the bone (e.g. the head of humerus inferiorly for restricted shoulder abduction). However, a concave joint surface is mobili...