No abstract uploaded!

This paper presents a novel algorithm to obtain landmark-based genus-1 surface registration via a special class of quasi-conformal maps called the Teichmüller maps. Registering shapes with important features is an important process in medical imaging. However, it is challenging to obtain a unique and bijective genus-1 surface matching that satisfies the prescribed landmark constraints. In addition, as suggested by [11], conformal transformation provides the most natural way to describe the deformation or growth of anatomical structures. This motivates us to look for the unique mapping between genus-1 surfaces that matches the features while minimizing the maximal conformality distortion. Existence and uniqueness of such optimal diffeomorphism is theoretically guaranteed and is called the Teichmüller extremal mapping. In this work, we propose an iterative algorithm, called the Quasi-conformal (QC) iteration, to find the Teichmüller extremal mapping between the covering spaces of genus-1 surfaces. By representing the set of diffeomorphisms using Beltrami coefficients (BCs), we look for an optimal BC which corresponds to our desired diffeomorphism that matches prescribed features and satisfies the periodic boundary condition on the covering space. Numerical experiments show that our proposed algorithm is efficient and stable for registering genus-1 surfaces even with large amount of landmarks. We have also applied the algorithm on registering vertebral bones with prescribed feature curves, which demonstrates the usefulness of the proposed algorithm.

In Berenstein and Rupel (2015), the authors defined algebra homomorphisms from the dual Ringel-Hall algebra of certain hereditary abelian category \mathcal{A} to an appropriate q-polynomial algebra. In the case that \mathcal{A} is the representation category of an acyclic quiver, we give an alternative proof by using the cluster multiplication formulas in (Ding and Xu, Sci. China Math. 55(10) 2045–2066, 2012). Moreover, if the underlying graph of Q associated with \mathcal{A} is bipartite and the matrix B associated to the quiver Q is of full rank, we show that the image of the algebra homomorphism is in the corresponding quantum cluster algebra.

This paper focuses on pricing and vertical cooperative advertising decisions in a two-tier supply chain. Using a Stackelberg game model where the manufacturer acts as the game leader and the retailer acts as the game follower, we obtain closed-form equilibrium solution and explicitly show how pricing and advertising decisions are made. When market demand decreases exponentially with respect to the retail price and increases with respect to national and local advertising expenditures in an additive way, the manufacturer benefits from providing percentage reimbursement for the retailer’s local advertising expenditure when demand price elasticity is large enough. Whether the manufacturer benefits from cooperative advertising is also closely related to supply chain member’s relative advertising efficiency. In the decision for adopting coop advertising strategy, it is critical for the manufacturer to identify how market demand depends on national and local advertisements. The findings from this research can enhance our understanding of cooperative advertising decisions in a two-tier supply chain with price-dependent demand.

The main object of this paper is to find a criterion for comparison of two tests for non-parametric hypotheses, taking advantage of the qualitative information that may exist. After a detailed analysis of the problem and some earlier suggestins for its solution (sections 2–4), a criterion is suggested in section 5. In order to apply it to a concrete case, a location problem is specified in section 6. The rank tests to be compared are analyzed in section 7, and the comparison by way of the criterion is carried out in section 8. It turns out that sign tests, sometimes slightly modified, are very often optimal according to the criterion used.