‎The proximal point algorithm‎, ‎which is a well-known tool for finding‎ ‎minima of convex functions‎, ‎is generalized from the classical‎ ‎Hilbert space framework into a nonlinear setting‎, ‎namely‎, ‎geodesic‎ ‎metric spaces of nonpositive curvature‎. ‎In this paper we propose an‎  ‎iterative algorithm for finding the common element of the‎ ‎minimizers of a finite family of convex functions a...

Some algorithms for nding common xed point of a family of mappings isconstructed. Indeed, let C be a nonempty closed convex subset of a uniformlyconvex Banach space X whose norm is Gateaux dierentiable and let {Tn} bea family of self-mappings on C such that the set of all common fixed pointsof {Tn} is nonempty. We construct a sequence {xn} generated by the hybridmethod and also we give the cond...

School Effects and Labor Market Outcomes for Young Adults in the 1980s and 1990s This study examines high school effects on the labor market success of young adults, above and beyond individual and family characteristics. We employ data from two longitudinal, nationally probability samples: the National Longitudinal Study and the High School and Beyond study and the 5th and 4th follow-up studie...

Recently, it has been observed that a new method for generating continuous distributions, T - X family, can be quite effectively used to analyze the data in one dimension. The aim of this study is to generalize this method to two dimensional space so that the marginals would have T - X distributions. So, several examples and properties of this family have been presented. As ...

a watermarking scheme for grayscale image isproposed based on a family of the chaotic maps and discretecosine transform. jacobian elliptic mapis employed to encrypt ofwatermarked logo. piecewise nonlinear chaotic map is also usedto determine the location of dct coefficients for the watermarkembedding. the purpose of this algorithm is to improve theshortcoming of watermarking such as small key s...