Marcet and Marimon (1994, revised 1998) developed a recursive saddle point method which can be used to solve dynamic contracting problems that include participation, enforcement and incentive constraints. Their method uses a recursive multiplier to capture implicit prior promises to the agent(s) that were made in order to satisfy earlier instances of these constraints. As a result, their method...

All shape-from-intensity methods assume that points in a scene are only illuminated by sources of light. Most scenes consist of concave surfaces and/orconcavities that result from multipleobjects in the scene. In such cases, points in the scene reflect light between themselves. In the presence of these interreflections, shape-from-intensity methods produce erroneous (pseudo) estimates of shape ...

Spaces of convex and concave functions appear naturally in theory applications. For example, regression log-concave density estimation are important topics nonparametric statistics. In stochastic portfolio theory, on the unit simplex measure concentration capital, their gradient maps define novel investment strategies. The may also be regarded as optimal transport simplex. this paper we constru...

Energetic proton acceleration from concave targets, the fronts of which were irradiated with 40 fs laser pulses with an intensity of 10 W/cm, has been studied as a function of the depth of the concave shape. Three kinds of targets, a triangular concave target, a circular concave target and a parabolic concave target are considered. When the depth of the concave shape was varied, the peak proton...

A concave minimization approach is proposed for classifying unlabeled data based on the following ideas: (i) A small representative percentage (5% to 10%) of the unlabeled data is chosen by a clustering algorithm and given to an expert or oracle to label. (ii) A linear support vector machine is trained using the small labeled sample while simultaneously assigning the remaining bulk of the unlab...

Given a finite set of points S ⊆ R, we define a proximity graph called as shape-hull graph(SHG(S)) that contains all Gabriel edges and a few non-Gabriel edges of Delaunay triangulation of S. For any S, SHG(S) is topologically regular with its boundary (referred to as shape-hull(SH)) homeomorphic to a simple closed curve. We introduce the concept of divergent concavity for simple, closed, planar...

Concave compositions are compositions (i.e. ordered partitions) of a number in which the parts decrease up to the middle summand(s) and increase thereafter. Perhaps the most surprising result is for even length, concave compositions where the generating function turns out to be the quotient of two instances of the pentagonal number theorem with variations of sign. The false theta function disco...

We study a class of left-invertible operators which we call weakly concave operators. It includes the and some subclasses expansive strict $m$ -isometries with $m > 2$ . prove Wold-type decomposition for also obtain Berger–Shaw-type theorem analytic finitely cyclic The proofs these results rely heavily on spectral dichotomy provides fairly close relationship, written in terms reciprocal auto...

A new plant cell image segmentation algorithm is presented in this paper. It is based on the morphological analysis of the cell shapes and on gradient information. The diiculty of the segmentation of plant cells lies in the complex shapes of the cells and their overlapping, often present due to recent cellular division. The algorithm presented tries to imitate the human procedure for segmenting...