2,264 research outputs found

    Compression for Smooth Shape Analysis

    Full text link
    Most 3D shape analysis methods use triangular meshes to discretize both the shape and functions on it as piecewise linear functions. With this representation, shape analysis requires fine meshes to represent smooth shapes and geometric operators like normals, curvatures, or Laplace-Beltrami eigenfunctions at large computational and memory costs. We avoid this bottleneck with a compression technique that represents a smooth shape as subdivision surfaces and exploits the subdivision scheme to parametrize smooth functions on that shape with a few control parameters. This compression does not affect the accuracy of the Laplace-Beltrami operator and its eigenfunctions and allow us to compute shape descriptors and shape matchings at an accuracy comparable to triangular meshes but a fraction of the computational cost. Our framework can also compress surfaces represented by point clouds to do shape analysis of 3D scanning data

    Preparation and characterization of albumin-heparin microspheres

    Get PDF
    Albumin-heparin microspheres were prepared by a two-step process which involved the preparation of a soluble albumin-heparin conjugate, followed by formation of microspheres from this conjugate or by a double cross-linking technique involving both coupling of soluble albumin and heparin and microsphere stabilization in one step. The first technique was superior since it allowed better control over the composition and the homogeneity of the microspheres. Microspheres could be prepared with a diameter of 5¿35¿m. The size could be controlled by adjusting the emulsification conditions. The degree of swelling of the microspheres was sensitive to external stimuli, and increased with increasing pH and decreasing ionic strength of the medium

    Preparation for an investigation of the thermal radiation characteristics and thermal conductivity of lunar material Final report, 1968

    Get PDF
    Vacuum system and chamber design, and thermal radiation and conductivity measurement techniques for lunar material investigation

    Understanding Internal Capital Markets and Corporate Policies

    Get PDF
    This study looks inside a large retail-banking group to understand how corporate politics affect internal capital allocation. The group consists of a headquarters organization and about 150 member banks which own the headquarters. Our data is from the firm’s managerial accounting system and covers all cash flows, internal capital transfers, and investments at the local member bank level. We first show that a member bank’s investment (net loan growth) is generally not fully independent from its own cash flow (net deposit growth). Then we show that such constraints are not apparent at more influential member banks, where influence is measured by the divergence of voting rights from ownership rights. The more influential banks are allocated more funds from the headquarters, but also show more restraints in investments when experiencing large deposit inflows. Influence matters more among member banks requiring more information exchanges with the headquarters as a result of more volatile funding requests. Influence also matters more for small business loans, which contain more soft information, than for standardized residential mortgage loans. These results suggest that corporate politics can be used to address allocation inefficiencies resulting from information asymmetries between the headquarters and divisions (member banks in our case).internal capital markets;capital markets;retail banking;corporate politics

    A Combinatorial Solution to Non-Rigid 3D Shape-to-Image Matching

    Get PDF
    We propose a combinatorial solution for the problem of non-rigidly matching a 3D shape to 3D image data. To this end, we model the shape as a triangular mesh and allow each triangle of this mesh to be rigidly transformed to achieve a suitable matching to the image. By penalising the distance and the relative rotation between neighbouring triangles our matching compromises between image and shape information. In this paper, we resolve two major challenges: Firstly, we address the resulting large and NP-hard combinatorial problem with a suitable graph-theoretic approach. Secondly, we propose an efficient discretisation of the unbounded 6-dimensional Lie group SE(3). To our knowledge this is the first combinatorial formulation for non-rigid 3D shape-to-image matching. In contrast to existing local (gradient descent) optimisation methods, we obtain solutions that do not require a good initialisation and that are within a bound of the optimal solution. We evaluate the proposed method on the two problems of non-rigid 3D shape-to-shape and non-rigid 3D shape-to-image registration and demonstrate that it provides promising results.Comment: 10 pages, 7 figure

    Macroeconomic effects of migration

    Get PDF
    Publication written by R.Dekker, edited by Jan Cremers, on the macroeconomic effects of migration in the series INT-AR Papers.
    • …
    corecore