Liouville theorem for weighted p-Lichnerowicz equation on smooth metric measure space

In this paper, let $(M^n,g,d\mu )$ be n-dimensional noncompact metric measure space which satisfies Poincaré inequality with some Ricci curvature condition. We obtain a Liouville theorem for positive weak solutions to weighted p-Lichnerowicz equation

${△}_{p,f}v+c{v}^{\sigma }=0,$

where $c\le 0,m>n\ge 1,1<p<\frac{m?1+\sqrt{(m?1)(m+3)}}{2},\sigma \le p?1$ are real constants.     

On a result of Ozawa concerning uniqueness of meromorphic functions

In this paper we prove a uniqueness theorem for meromorphic functions sharing three values with some weight which improves some known results.     

矩阵方程AXB=D的最小二乘Hermite解及其加权最佳逼近

本中,我们讨论了矩阵方程AXB=D的最小二乘Hermite解,通过运用广义奇异值分解(GSVD)，获得了解的通式。此外,对于给定矩阵F，也得到了它的加权最佳逼近表达式。     

Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.     

On a question of Gross

Using the notion of weighted sharing of sets we prove two uniqueness theorems which improve the results proved by Fang and Qiu [H. Qiu, M. Fang, A unicity theorem for meromorphic functions, Bull. Malaysian Math. Sci. Soc. 25 (2002) 31-38], Lahiri and Banerjee [I. Lahiri, A. Banerjee, Uniqueness of meromorphic functions with deficient poles, Kyungpook Math. J. 44 (2004) 575-584] and Yi and Lin [H.X. Yi, W.C. Lin, Uniqueness theorems concerning a question of Gross, Proc. Japan Acad. Ser. A 80 (2004) 136-140] and thus provide an answer to the question of Gross [F. Gross, Factorization of meromorphic functions and some open problems, in: Proc. Conf. Univ. Kentucky, Lexington, KY, 1976, in: Lecture Notes in Math., vol. 599, Springer, Berlin, 1977, pp. 51-69], under a weaker hypothesis.     

Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.     

条件泛函及其导数非参数估计的强一致收敛速度

研究了条件泛函及其导数的非参数估计,对随机与固定设计的条件泛函,分别利用核估计和非参数加权估计,在核函数及权函数满足一定条件下,证明了估计一致强收敛于待估函数的速度可达到最优。从而进一步推广和发展了Hrdle,etal.(1988)、Severini,etal.(1992)的许多结果。     

加权Bergman空间上小Hankel算子的Schatten类

讨论了 C\+n 中有界对称域的加权Bergman空间上符号属于 L\+2\-a(Ω, dV\-λ) 的小Hankel算子, 利用符号 Φ 的某种积分变换,给出了小Hankel算子 h\-Φ 属于Schatten理想 S\-p 的特征.     

A note on the complexity and tractability of the heat equation

We wish to solve the heat equation u_t=Δu-qu in I^d×(0,T), where I is the unit interval and T is a maximum time value, subject to homogeneous Dirichlet boundary conditions and to initial conditions u(·,0)=f over I^d. We show that this problem is intractable if f belongs to standard Sobolev spaces, even if we have complete information about q. However, if f and q belong to a reproducing kernel Hilbert space with finite-order weights, we can show that the problem is tractable, and can actually be strongly tractable.