带准备时间的自由作业排序问题—最坏性能比分析

本文研究了一类自然的排序问题，带准备时间的自由作业排序。在机器台数任意的情况下，证明了一个简单的贪婪算法的最坏性能比不超过２，并猜想该算法的临界为２－１／ｍ，其中ｍ为机器台数。特别当ｍ＝２时，证明了该算法的最坏性能比恰为３／２。     

一种组装线排序问题的启发式算法及其性能分析

本文引进了工作带有准备时间的组装线排序问题。在第一阶段用ｍ台机器来生产带有准备时间的工件的零部件。第二阶段用一台机器来组装这些零部件。目标是使总完工时间最小。我们给出了一个启发式算法，并证明了其最差情况性能比等于或小于８／３－１／ｍ。     

可拆分平行机排序问题研究

平行机排序问题是把n个产品安排到m台机器上加工，使其总费用最小．通常的平行机排序问题都假设（C1）：任何产品不能在不同机器上同时加工．但是，如果把产品的加工时间看成一个产品量的需求，就可以假设（C2）：允许同一产品拆分在不同机器上同时加工．本文首先回顾了C1假设下平行机排序问题已有的结果，然后基于假设C2，讨论了各种费用目标下问题的算法及其复杂性．在没有生产准备时间的情况下，给出了一些问题的多项式算法和线性规划方法．在有独立生产准备时间的情况下，给出了P／split／Cmax问题的启发式算法及其算法分析．     

一类指数型整函数值算子的逼近性质

设（Ｕσｆ）（ｘ）＝Σ↓ｋ∈Ｚｆ（Ｘｋ）Ａσ（Ｘ－Ｘｋ），Ｘｋ＝２ｋπ／σ，ｋ∈Ｚ，σ〉０，ｆ是Ｒ上的有界函数，而Ａσ（ｙ）＝２／σ∫σ０ｓｉｎ＾ｍ（σ－Ｘ）ｈ／ｓｉｎ＾ｍ（σ－Ｘ）ｈ＋ｓｉｎ＾ｍｘｈｃｏｓｘｙｄｘ，ｍ为奇自然数，０〈ｈ〈π／σ，本文研究了此插值算子的收敛与饱和问题。     

相依样本下非参数回归函数递推型核估计的渐近分布

设（Ｘｉ，Ｙｉ）１≤ｉ≤ｎ为来自二元总体（Ｘ，Ｙ）的平稳，φ－混合样本，记ｍ（ｘ）△Ｅ（Ｙ│Ｘ＝ｘ），ｍ（ｘ）的一种递推型核估计为ｍｎ（ｘ）＝ｎ∑ｉ＝１ｈｉ＾－１Ｙｉｋ（（ｘ－Ｘｉ）／ｈｉ）／ｎ∑ｊ＝１ｈ＾－１ｊｋ（ｘ－Ｘｊ）／ｈｊ）。本文在一定的条件下证明了（ｎ／（ｎ∑ｊ＝１ｈ＾－１ｊ）＾１／２）（ｍｎ（ｘ１）－ｍ（ｘ１），ｍｎ（ｘ２）－ｍ（ｘ２），．．．ｍｎ（ｘｒ０）－ｍ（ｘｒ０））′依分布收     

循环图的连通度

设Ｇ＝Ｇｎ（ｉ１,ｉ２,…,ｉｒ）是连通循环图,且ｘ（Ｇ）〈δ（Ｇ）,本文得到了其连通度的明确表达式：ｘ（Ｇ）＝ｍｉｎ（ｍ／Ｍ（ｎ／ｍ,Ｋ）／：ｍ是ｎ的真因子,且／Ｍ（ｎ／ｍ,Ｋ）／〈ｎ／ｍ－１）。     

Banach函数空间上的Bessel(Riesz)位势及其应用(I)理论

本文首先引入Ｂｅｓｅｌ（Ｒｉｅｓｚ）位势Ｋ¨ｏｔｈｅ函数空间Ｘｓ（Ｘｓ）的概念，然后讨论一类算子在Ｌｅｂｅｓｇｕｅ－位势Ｋ¨ｏｔｈｅ函数空间Ｌｑ（－Ｔ，Ｔ；Ｘｓ）上的对偶估计．由此我们得到半群ｅｘｐ（ｉｔ（－Δ）ｍ／２）和算子Ａ：＝∫ｔ０ｅｘｐ（ｉ（ｔ－τ）（－Δ）ｍ／２）·ｄτ在Ｌｅｂｅｓｇｕｅ－Ｂｅｓｏｖ空间Ｌｑ－Ｔ，Ｔ；·Ｂｓｐ，２中的一些时间－－空间Ｌｐ－Ｌｐ′估计．本文的系列文将给出这些估计的应用     

两台平行机的实时到达在线排序

本文考虑一的的在线平行机排序模型－－实时到达在线问题,该模型中,工件是陆续到达的,工件的个数及到达时间是事先未知的,而且只有当工件到达,才知其加工时间,所求目标是使所有工件都加工完的时间达到最小,对两台平行机的情形,Ｃｈｅｎ与Ｖｅｓｔｊｅｎｓ给出近似比为３／２的线ＬＰＴ算法,并证明了不存在近似小于（５－√５）／２的算法,我们利用黄金分割数设计了一个 算法,其近似比不超过（１８－√５）／１１。     

一个加强的Carleman不等式

建立如下权系数的不等式：１＋１ｍｍ≤ｅ１－１－２／ｅｍ（ｍ＝１，２，…），这里，１－２／ｅ＝０．２６４２４１１＋为最佳值．从而得到一个加强的Ｃａｒｌｅｍａｎ不等式．     

关于分圆多项式的Schinzel等式

对一无平方因子的奇数ｎ＞１，　分圆多项式φｎ（ｘ）　　满足Ｓｃｈｉｎｚｅｌ等式，　φｎ（ｘ）＝Ｐ２ｎ，ｍ（ｘ）－（－１／ｍ）ｍｘＱ２ｎ，ｍ（ｘ），　　这里Ｐｎ，ｍ（ｘ）和　Ｑｎ，ｍ（ｘ）是整系数多项式且　ｍ｜ｎ．本文给出两个简明的公式来计算　Ｐｎ，ｍ（ｘ）　和　Ｑｎ，ｍ（ｘ）　　．     

RECENT PROGRESS ON SPHERICAL HARMONIC APPROXIMATION MADE BY BNU RESEARCH GROUP ——In memory of Professor Sun Yongsheng

As early as in 1990, Professor Sun Yongsheng, suggested his students at Beijing Normal University to consider research problems on the unit sphere. Under his guidance and encouragement his students started the research on spherical harmonic analysis and approximation. In this paper, we incompletely introduce the main achievements in this area obtained by our group and relative researchers during recent 5 years （2001-2005）. The main topics are： convergence of Cesaro summability, a.e. and strong summability of Fourier-Laplace series; smoothness and K-functionals; Kolmogorov and linear widths.     

A REPRESENTATION FORMULA RELATED TO SCHR(O)DINGER OPERATORS

Schr(o)dinger operator is a central subject in the mathematical study of quantum mechanics.Consider the Schrodinger operator H = -△ V on R, where △ = d2/dx2 and the potential function V is real valued. In Fourier analysis, it is well-known that a square integrable function admits an expansion with exponentials as eigenfunctions of -△. A natural conjecture is that an L2 function admits a similar expansion in terms of "eigenfunctions" of H, a perturbation of the Laplacian (see [7], Ch. Ⅺ and the notes), under certain condition on V.     

CONTENTS OF VOLUME 30

正~~     

Instructions for contributions

正Applied Mathematics-A Journal of Chinese Universities,Series B(Appl.Math.J.Chinese Univ.,Ser.B)is a comprehensive applied mathematics journal jointly sponsored by Zhejiang University,China Society for Industrial and Applied Mathematics,and Springer-Verlag.It is a quarterly journal with     

Journal of Mathematical Research with Applications Guide for Authors

正Journal overview:Journal of Mathematical Research with Applications(JMRA),formerly Journal of Mathematical Research and Exposition(JMRE)created in 1981,one of the transactions of China Society for Industrial and Applied Mathematics,is a home for original research papers of the highest quality in all areas of mathematics with applications.The target audience comprises:pure and applied mathematicians,graduate students in broad fields of sciences and technology,scientists and engineers interested in mathematics.     

Staircase transportation problems with superadditive rewards and cumulative capacities

A cumulative-capacitated transportation problem is studied. The supply nodes and demand nodes are each chains. Shipments from a supply node to a demand node are possible only if the pair lies in a sublattice, or equivalently, in a staircase disjoint union of rectangles, of the product of the two chains. There are (lattice) superadditive upper bounds on the cumulative flows in all leading subrectangles of each rectangle. It is shown that there is a greatest cumulative flow formed by the natural generalization of the South-West Corner Rule that respects cumulative-flow capacities; it has maximum reward when the rewards are (lattice) superadditive; it is integer if the supplies, demands and capacities are integer; and it can be calculated myopically in linear time. The result is specialized to earlier work of Hoeffding (1940), Fréchet (1951), Lorentz (1953), Hoffman (1963) and Barnes and Hoffman (1985). Applications are given to extreme constrained bivariate distributions, optimal distribution with limited one-way product substitution and, generalizing results of Derman and Klein (1958), optimal sales with age-dependent rewards and capacities.To our friend, Philip Wolfe, with admiration and affection, on the occasion of his 65th birthday.Research was supported respectively by the IBM T.J. Watson and IBM Almaden Research Centers and is a minor revision of the IBM Research Report [6].     

Boundedness for commutators of multipliers on Hardy type spaces

In this paper, we study the commutators generalized by multipliers and a BMO function. Under some assumptions, we establish its boundedness properties from certain atomic Hardy space Hb^p（R^n） into the Lebesgue space L^p with p 〈 1.     

A unified approach to certain problems of best local approximation

In this paper we study best local quasi-rational approximation and best local approximation from finite dimensional subspaces of vectorial functions of several variables. Our approach extends and unifies several problems concerning best local multi-point approximation in different norms.