in the present paper we study convolution properties for subclasses of univalent harmonic functions in the open unit disc and obtain some basic properties such as coefficient characterization and extreme points.

by using generalized salagean differential operator a newclass of univalent holomorphic functions with fixed finitely manycoefficients is defined. coefficient estimates, extreme points,arithmetic mean, and weighted mean properties are investigated.

The property that an optimal solution to the problem of minimizing a continuous concave function over a compact convex set in IRn is attained at an extreme point is generalized by the Bauer Minimum Principle to the infinite dimensional context. The problem of approximating and characterizing infinite dimensional extreme points thus becomes an important problem. Consider now an infinite dimensio...

The main aim of this paper is to introduce three classes $H^0_{p,q}$, $H^1_{p,q}$ and $TH^*_p$ of $p$-harmonic mappings and discuss the properties of mappings in these classes. First, we discuss the starlikeness and convexity of mappings in $H^0_{p,q}$ and $H^1_{p,q}$. Then establish the covering theorem for mappings in $H^1_{p,q}$. Finally, we determine the extreme points of the class $TH^*_{p}$.

Nonstationary infinite-horizon Markov decision processes (MDPs) generalize the most well-studied class of sequential decision models in operations research, namely, that of stationaryMDPs, by relaxing the restrictive assumption that problem data do not change over time. Linearprogramming (LP) has been very successful in obtaining structural insights and devising solutionmeth...

This paper develops a combinatorial description of the extreme points of the core of a necessity measure on a finite space. We use the ingredients of Dempster-Shafer theory to characterize a necessity measure and the extreme points of its core in terms of the Möbius inverse, as well as an interpretation of the elements of the core as obtained through a transfer of probability mass from non-elem...

The performance of an iris recognition algorithm depends greatly on its classification ability as well as speed. In this paper, an iris recognition algorithm using local extreme points is proposed. It first detects the local extreme points along the angular direction as key points. Then, the sample vector along the angular direction is encoded into a binary feature vector according to the surfa...

Let N be the set of natural numbers and let a: N -* N be an injection having no periodic points. Let M0 be the set of o-invariant means on lx. When / G lx let da(f) = sup X(/), where the supremum is taken over all X G M„. It is shown that when/ e lx, there is a sequence (\)TM=2 of extreme points of M„ which has no extreme weak* limit points and such that \s(f) = dQ(f) for s = 2, 3, .... As a co...