No abstract uploaded!

The optimal mass transportation problem, proposed by Monge, is dominated by the Monge-Ampere equation. In general, as the Monge-Ampere equation is highly non-linear, this type of partial dierential equations is beyond the solving ability of a conventional nite element method. This diculty led Gu et al. alternatively to the discrete optimal mass transportation problem. They developed variational principles for this problem and reported the calculation for the optimal mapping, based on theorem that among all possible cell decompositions, with constrained measures, the trans- portation cost of the discrete mapping from cells to the corresponding discrete points is minimized by the decomposition induced by a power Voronoi diagram. Their research inspired us to consider a similar discrete optimal mass transportation problem. Here we replace the L2 Euclidean distance by the length of the shortest path connecting two points on a line network. To solve the optimal trans- portation problem on a line network, we study a type of Voronoi diagram on undirected and connected networks and propose an elegant construction algorithm. We further consider weighted distances in a network and develop a method to compute the centroidal Voronoi tessellation (CVT) for a network. By using real geographic data, the method proposed is proved ecient and eective in several practical applications, including charging station distribution in a trac network, and trash can distribution in a park.

No abstract uploaded!

Characterization of homogeneous polynomials with isolated critical point at the origin follows from a study of complex geometry. Yau previously proposed a Numerical Characterization Conjecture. A step forward in solving this Conjecture, the Granville-Lin-Yau Conjecture was formulated, with a sharp estimate that counts the number of positive integral points in ndimensional (n≥3) real right-angled simplices with vertices whose distance to the origin are at least n-1. The estimate was proven for n≤6 but has a counterexample for n = 7. In this project we come up with an idea of forming a new sharp estimate conjecture where we need the distances of the vertices to be n. We have proved this new sharp estimate conjecture for n≤7 and are in the process of proving the general n case.

The aim of this study is to figure out the optimization of survival probability of the generals in the card game "Legends of the Three Kingdoms". First, based on combinatorics and probability theory, the PASCAL program was performed to analyze the probabilities of success when several popular generals perform their special skills in the game. The results are as follows: Second, seven typical generals, including Zhou Tai, Zhang Jiao, Zhen Ji, Lu Xun, Ma Chao, Xiahou Dun, and Guo Jia, were chosen, and their abilities including attacking and defense were arbitrarily quantified according to a model constructed in the present study. The scores are as follows: Card-drawing Changing Attacking Defense Blood-selling Zhen Ji 5.62 Zhou Tai 1.04 Ma Chao 1.68 Xiahou Dun 1.19 Guo Jia 3.36 Lu Xun 3.55 Zhang Jiao 2.55 The abilities of different generals were sorted, and by comparison with the statistical record online, the reliability of the model was proved. Thus, the irrationality of the game is identified in this study, and we recommend the game designer to modify the abilities of some generals and to obtain an optimized value according to the output of the model, by which the game would be more popular.