This appendix provides a more detailed analysis of a parameterized version of the consumer model presented in Section 4.1. We first describe our parameterization of the model. Second, we illustrate some of the theoretical properties of the model and show that the model can incorporate several important features observed in our data. In particular, the model allows for adverse selection (borrowe...

Parameterization of a 3D mesh is a fundamental problem in various applications of meshes. The approaches are widely used for parameterization because of its good properties, but they are almost based on triangle mesh. In this paper, we present a parameterization approach for the quadrilateral open mesh with complex topology. Since mesh simplification and weighted discrete mapping are adapted, t...

Parameterization of a 3D triangular mesh is a fundamental problem in various applications of meshes. The convex combination approach is widely used for parameterization because of its good properties, such as fast computation and one-to-one embedding. However, the approach has a drawback: most boundary triangles have high distortion in the embedding compared with interior ones. In this paper, w...

Gain scheduling controllers are considered in this paper. The gain scheduling problem where the scheduling parameter vector θ cannot be measured directly, but needs to be estimated is considered. An estimation of the scheduling vector θ has been derived by using the Youla parameterization. The use of the Youla parameterization in connection with estimation of θ directly gives a validation metho...

We describe a method to compute conformal parameterizations with a natural boundary based on a simple differentiable expression measuring angles between edges by using complex numbers. The method can be adapted to preserve metric properties or map textures with constrained positions. Some illustrations are shown to assess the efficiency of the algorithms.

We describe a method to compute conformal parameterizations with a natural boundary based on a simple differentiable expression measuring angles between edges by using complex numbers. The method can be adapted to preserve metric properties or map textures with constrained positions. Some illustrations are shown to assess the efficiency of the algorithms.

It is often desirable to evaluate parametric spline curves at points based on their arc-length instead of the curveÕs original parameter. Techniques are presented here for computing a reparameterization curve allowing approximate arc-length evaluation. This reparameterization curve is also expressed as a spline, allowing rapid evaluation as a function of arc-length. Using composition methods de...

This paper studies higher-order processes with the capability of parameterization (or abstraction), which has been proven to be an effective measure of lifting the mere process-passing in expressiveness. We contribute to the understanding of two kinds of parameterization: nameparameterization and process-parameterization, particularly in a secondorder setting (no currying of parameterization). ...