EXACT BOUNDS OF THE MODIFIED LPT ALGORITHMS APPLYING TO PARALLEL MACHINES SCHEDULING WITH NONSIMULTANEOUS MACHINE AVAILABLE TIMES

ＥＸＡＣＴＢＯＵＮＤＳＯＦＴＨＥＭＯＤＩＦＩＥＤＬＰＴＡＬＧＯＲＩＴＨＭＳＡＰＰＬＹＩＮＧＴＯＰＡＲＡＬＬＥＬＭＡＣＨＩＮＥＳＳＣＨＥＤＵＬＩＮＧＷＩＴＨＮＯＮＳＩＭＵＬＴＡＮＥＯＵＳＭＡＣＨＩＮＥＡＶＡＩＬＡＢＬＥＴＩＭＥＳＬＩＮＧＵＯＨＵＩ，Ｈ...     

THERMODYNAMIQUE DES ENSEMBLES DE CANTOR AUTOSIMILAIRES（THERMODYNAMICS OF SELF-SIMILAR CANTOR SETS）

ＴＨＥＲＭＯＤＹＮＡＭＩＱＵＥＤＥＳＥＮＳＥＭＢＬＥＳＤＥＣＡＮＴＯＲＡＵＴＯＳＩＭＩＬＡＩＲＥＳ（ＴＨＥＲＭＯＤＹＮＡＭＩＣＳＯＦＳＥＬＦ－ＳＩＭＩＬＡＲＣＡＮＴＯＲＳＥＴＳ）￥Ｇ．ＭＩＣＨＯＮ;Ｊ．ＰＥＹＲＩＥＲＥ（ＵｎｉｖｅｒｓｉｔｙｄｅＢｏｕ...     

TWO-DIMENSIONAL SINGULAR INTEGRAL EQUATIONS OF THE HYPERCOMPLEX FUNCTIONS

ＴＷＯ－ＤＩＭＥＮＳＩＯＮＡＬＳＩＮＧＵＬＡＲＩＮＴＥＧＲＡＬＥＱＵＡＴＩＯＮＳＯＦＴＨＥＨＹＰＥＲＣＯＭＰＬＥＸＦＵＮＣＴＩＯＮＳ（刘春根）￥ＬｉｕＣｈａｎｇｅｎ（Ｄｅｐｔ．ｏｆＭａｔｈＮａｎｋａｉＵｎｉｖ．，Ｔｉａｎｊｉｎ５００７１，Ｃｈｉｎａ．...     

THE MAXIMUM AND MINIMUM SOLUTIONS OF NONLINEAR INTEGRODIFFERENTIAL EQUATIONS OF MIXED TYPE WITH IMPULSES IN BANACH SPACES

ＴＨＥＭＡＸＩＭＵＭＡＮＤＭＩＮＩＭＵＭＳＯＬＵＴＩＯＮＳＯＦＮＯＮＬＩＮＥＡＲ　ＩＮＴＥＧＲＯＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳＯＦＭＩＸＥＤＴＹＰＥＷＩＴＨＩＭＰＵＬＳＥＳＩＮＢＡＮＡＣＨＳＰＡＣＥＳＬｉｕＷｅｉａｎ（刘伟安）（Ｗｕｈａｎ...     

OPTIMAL AND SUPERCONVERGENCE ESTIMATES OF THE FIMITE ELEMENT METHOD FOR A SCALAR HYPERBOLIC EQUATION

ＯＰＴＩＭＡＬＡＮＤＳＵＰＥＲＣＯＮＶＥＲＧＥＮＣＥＥＳＴＩＭＡＴＥＳＯＦＴＨＥＦＩＭＩＴＥＥＬＥＭＥＮＴＭＥＴＨＯＤＦＯＲＡＳＣＡＬＡＲＨＹＰＥＲＢＯＬＩＣＥＱＵＡＴＩＯＮＺｈｏｕＡｉｈｕｉ（周爱辉）ＬｉｎＱｕｎ（林群）（Ｉｎｓｔ．ｏｆＳｙｓ．Ｓｃ...     

WORD PROBLEMS AND THE CENTERS OF ABEL DIFFERENTIAL EQUATIONS

ＷＯＲＤ　ＰＲＯＢＬＥＭＳ　ＡＮＤ　ＴＨＥ　ＣＥＮＴＥＲＳ　ＯＦ　ＡＢＥＬ　ＤＩＦＦＥＲＥＮＴＩＡＬ　ＥＱＵＡＴＩＯＮＳＷＯＲＤＰＲＯＢＬＥＭＳＡＮＤＴＨＥＣＥＮＴＥＲＳＯＦＡＢＥＬＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳ￥Ｍ．Ａ．Ｍ．Ａｌｗａｓｈ...     

扩散系数反问题正则化数值方法的收敛性分析

扩散系数反问题正则化数值方法的收敛性分析朝红阳（中山大学计算机科学系）ＣＯＮＶＥＲＧＥＮＣＥＡＮＡＬＹＳＩＳＯＦＡＲＥＧＵＬＡＲＩＺＥＤＮＵＭＥＲＩＣＡＬＭＥＴＨＯＤＦＯＲＳＯＬＶＩＮＧＴＨＥＤＩＦＦＵＳＩＶＥＣＯＥＦＦＩＣＩＥＮＴＩＮＶＥＲＳＥＰＲ...     

GEOMETRIC METHOD OF SEQUENTIAL ESTIMATION RELATED TO MULTINOMIAL DISTRIBUTION MODELS

ＧＥＯＭＥＴＲＩＣＭＥＴＨＯＤＯＦＳＥＱＵＥＮＴＩＡＬＥＳＴＩＭＡＴＩＯＮＲＥＬＡＴＥＤＴＯＭＵＬＴＩＮＯＭＩＡＬＤＩＳＴＲＩＢＵＴＩＯＮＭＯＤＥＬＳ￥ＷＥＩＢＯＣＨＥＮＧ；ＬＩＳＨＯＵＹＥ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｓｏｕｔｈ...     

双参数法的一些扩展及其在矩形板元中的应用

双参数法的一些扩展及其在矩形板元中的应用卜小明（天津大学）ＡＭＯＤＩＦＩＥＤＤＯＵＢＬＥＳＥＴＰＡＲＡＭＥＴＥＲＭＥＴＨＯＤＡＮＤＩＴＳＡＰＰＬＩＣＡＴＩＯＮＩＮＣＯＮＳＴＲＵＣＴＩＮＧＴＨＥＲＥＣＴＡＮＧＵＬＡＲＥＬＥＭＥＮＴＯＦＴＨＩＮＰＬＡＴＥ...     

THE LIMIT CIRCLE CRITERION OF THE SECOND ORDER NONHOMOGENEOUS FUNCTIONAL DIFFERENTIAL EQUATIONS

ＴＨＥＬＩＭＩＴＣＩＲＣＬＥＣＲＩＴＥＲＩＯＮＯＦＴＨＥＳＥＣＯＮＤＯＲＤＥＲＮＯＮＨＯＭＯＧＥＮＥＯＵＳＦＵＮＣＴＩＯＮＡＬＤＩＦＦＥＲＥＮＴＩＡＬＥＱＵＡＴＩＯＮＳ￥ＸｕＺｈｉｔｉｎｇ（徐志庭）＆ＸｉｎｇＨｏｎｇｙａｎ（邢鸿雁）（Ｇｕａｎｇｄｏｎ...     

Improved algorithms for several network location problems with equality measures

We consider single facility location problems with equity measures, defined on networks. The models discussed are, the variance, the sum of weighted absolute deviations, the maximum weighted absolute deviation, the sum of absolute weighted differences, the range, and the Lorenz measure. We review the known algorithmic results and present improved algorithms for some of these models.     

带扰动项的FR共轭梯度法

本文提出了两种搜索方向带有扰动项的Fletcher-Reeves (abbr. FR)共轭梯度法.其迭代公式为xk 1=xk αk(sk ωk),其中sk由共轭梯度迭代公式确定,ωk为扰动项,αk采用线搜索确定而不是必须趋于零.我们在很一般的假设条件下证明了两种算法的全局收敛性,而不需要目标函数有下界或水平集有界等有界性条件.     

Weighted least absolute deviations estimation for periodic ARMA models

This paper investigates the weighted least absolute deviations estimator (WLADE) for causal and invertible periodic autoregressive moving average (PARMA) models. Asymptotic normality of the estimator is derived under a fractional moment condition. A simulation study is given to assess the performance of the proposed WLADE.     

Minimizing weighted mean absolute deviation of job completion times from their weighted mean

We address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the maximum admissible level of service equity. It has been shown earlier that the unweighted version of this problem is NP-hard in the ordinary sense. For that version, a pseudo-polynomial time dynamic program and a 2-approximate algorithm are available. However, not much (except for an important solution property) exists for the weighted version. In this paper, we establish the relationship between the optimal solution to the weighted problem and a related one in which the deviations are measured from the weighted median (rather than the mean) of the job completion times; this generalizes the 2-approximation result mentioned above. We proceed to give a pseudo-polynomial time dynamic program, establishing the ordinary NP-hardness of the problem in general. We then present a fully-polynomial time approximation scheme as well. Finally, we report the findings from a limited computational study on the heuristic solution of the general problem. Our results specialize easily to the unweighted case; they also lead to an approximation of the set of schedules that are efficient with respect to both the weighted mean absolute deviation and the weighted mean completion time.     

Linear programming for weighted deviation problems using compact basis techniques

Weighted deviation problems are linear programs in which weights (or penalties) are attached to deviations from upper and lower bounds on particular linear expressions. In turn the deviations may be bracketed by secondary bounds. These problems include statistical problems of minimizing weighted sums of absolute deviations, standard and extended “goal programming” problems, problems with upper bounds on absolute values of linear affine functions, problems with arbitrarily bounded variables, and combinations of these.Previous specialized linear programming methods for related problems have been restricted to specialized cases that involve only a single basis configuration, or else, by means of “extended GUB” techniques, accommodate a diverse variety of basis structures at the cost of substantially increased computation. We show that, of the several basis configurations that can arise for this problem, precisely three are essential. Special rules are identified to allow transitions between these three structures, to yield valid compact versions of both the primal and the dual simplex methods. Finally, we show how these results lead to improved efficiency as well as reduced problem size.     

Bound on deviations of continuous periodic functions from their de la Vallée-Poussin sums

We show that $$|f(x) - V_{n,m} (f,x)| \leqslant \frac{C}{{m + 1}}\sum\nolimits_{h = n - m}^n {E_k [1 + In\left( {\frac{{n - m}}{{h - n + m + 1}}} \right)],}$$ for every continuous function with period 2Μ, where C is an absolute constant and 0 ≤ m ≤ n, and we then apply this bound.     

IMPROVING EIGENVECTORS IN ARNOLDI''''S METHOD

1. IntroductionArnoldi's method [1, 12] is used for computing.,a few selected eigenpairs of largeunsymmetric matrices. It hajs been investigated since the 1980s; see, e-g., [3--15].It is well known that the m--step Arnoldi processt as described in detail in Section 2,generates an orthonormal basis {yi}7=1 of the Krylov subspace Km(vi, A) spanned byvil Avi,... 5 Am--'v,. Here yi is an initial unit norm vector. The projected matrix ofA onto Km(vi, A) is represented by an m x m upper Hessenb…     

Some Identities Involving the Cesàro Average of the Goldbach Numbers

Mathematical Notes - Let Λ(n) be the von Mangoldt function, and let rG(n):= ∑m1+m2=n Λ (m1)Λ(m2) be the weighted sum for the number of Goldbach representations which also...     

关于A+,A+MN的表达式及其应用

For A ∈ Cm×nr, let M and N be Hermitian positive definite matrices oforder m and n respectively. We derived the representation of the Moore-PenroseA+MN in terms of maximal nonsin-inverse A+ and weighted Moore-Penrose inverse +gular submatrices of A. In our notation,A+ = | detA[plq]|2A+pq1/vol2(A) (p,q)∈N(A)AM+N = 1/vol2(A)(p,q)∈N(A) |detA[p|q]|2N-1/2A+pqM1/2where A=M1/2 AN -1/2. From this, we propose a new method to calculate A+A+MN. The results generalize that of Moore-Penrose inverse in [2][3].     

具有奇点的Laplace方程边值问题的原始能量-有限元结合法

在用变分原理离散数理方程时,可取函数在部分求解区域内,取成解析函数或奇异函数类;而在其余求解区域内取成分片低阶插值多项式.在两区域交界的结点上,可取函数连续.我们称此法为原始能量一有限元结合法.[3,p135]中提到过这种方法,但缺少理论分析.[4]曾给出初步的分析.本文与[5,6]就此方法给出较严格的理论分析.