In this paper we will find optimal lower bound for the first eigenvalue of the fourth order equation with integrable potentials when the L1norm of potentials is known. We establish the minimization character-ization for the first eigenvalue of the measure differential equation, which plays an important role in the extremal problem of ordinary differential equation. The conclusion of this paper will illustrate a new and very interesting phenomenon that the minimizing measures will no longer be located at the center of the interval when the norm is large enough.

We prove that any constant mean curvature embedded torus in the three dimensional sphere is axially symmetric, and use this to give a complete classification of such surfaces for any given value of the mean curvature.

Global geometrical optics method is a new semi-classical approach for the high frequency linear waves proposed by the author in [13]. In this paper, we rederive it in a more concise way. It is shown that the right candidate of solution ansatz for the high frequency wave equations is the extended WKB function, other than the WKB function used in the classical geometrical optics approximation. A new and main contribution of this paper is an interface analysis for the Helmholtz equation when the incident wave is of extended WKB-type. We derive asymptotic expressions for the reflected and/or transmitted propagating waves in the general case. These expressions are valid even when the incident rays include caustic points.

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among all feasible choices. This novel problem is motivated by various real-world application scenarios. We discuss the computational complexity and algorithms for various settings of this problem. In particular, we show that if there is only one machine with an arbitrary number of linear constraints, or there is an arbitrary number of machines with no more than two linear constraints, or both the number of machines and the number of linear constraints are fixed constants, then the problem is polynomial-time solvable via solving a series of linear programming problems. If both the number of machines and the number of constraints are inputs of the problem instance, then the problem is NP-Hard. We further propose several approximation algorithms for the latter case.

No abstract uploaded!