平行机半在线排序问题研究(Ⅰ)

对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。文章给出半在线排序问题的背景、定义、分类和求解。介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类，以及第一类半在线模型的近似算法的设计及其竞争比分析。     

解线性约束凸规划的次最优化方法和改进

1.引 言 关于线性约束下的非线性规划,很多人进行了研究,Zangwill[3] 于1967年提出了次最优化方法,该方法的原理是将原规划问题化为一系列只含有等式约束的子问题求解,最后找到最优解所在的流形,在此流形上使用无约束规划的各种方法求解原问题即可.薛声家[2]1983     

基于L~1度量分析的图象分解与重构算法

Mallat‘s decompositon and reconstruction algorithms are very important in the the field of wavelet theory and its applications to signal processing.Wavelet Anal-ysis,which is based on L^2(R) space,can eliminate redundancy of signals with the help of orthogonality and characterize the processing precision with the meansquare error.In the recent years,it is understood that the mean square measuredoes not match human visual sensitivity well.From the point of view,R.DeVore studied L^1 measure instead.Similarly,considering the principles of image com-pression,Yang introduced and dealt with orthogonality in L^1 space based on thebest approximation theory,and consequently established the corresponding decom-position and reconstruction algorithms for signals.In this paper,error analyses for the algorithms above are taken and the selection of the best parameters in the algorithms are discussed in detail.Finally,the algorithms are compared with the classical Haar and Daubechies‘‘s orthogonal wavelets based on the singal-to-noiseratio data computed.     

Speeding up the FMMR perfect sampling algorithm: A case study revisited

In a previous paper by the second author, two Markov chain Monte Carlo perfect sampling algorithms—one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling—are compared using as a case study the move‐to‐front (MTF) self‐organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user‐chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

关于整系数多项式有理根求法的注记

现行高等代数教材给出了求整系数多项式有理根的经典方法 ,周仲旺近日撰文又给出了一个新方法 ,称其“要比经典的方法有趣简捷”,但没有给出两个方法运算量的定量分析与比较 .本文先对经典方法从数学原理和算法设计两个方面作较详细明确的描述 ;再给出经典算法与周方法运算量的定量分析 ,比较的结果是周方法运算量比经典算法运算量多得多 .     

基于组合权重的系统评价模型

提出了基于组合权重的系统评价新模型 ( CWSE) ,即 :直接根据评价指标样本数据集 ,用基于加速遗传算法的投影寻踪方法确定各评价指标的分类权重 ,用基于加速遗传算法的层次分析法确定各评价指标的排序权重 ,用加速遗传算法对各评价指标的分类权重和排序权重进行综合得到组合权重 ,然后以这些组合权重与各评价对象相应评价指标的标准化值进行加权平均 ,得到系统评价的综合指标值 ,据此可对各评价对象进行分类排序 .用 CW SE模型评价中国 30个区域 1995年开发度的结果表明 ,根据开发度的强弱可把这些区域分成 3个强开发区域、6个较强开发区域、10个中等开发区域和 11个弱开发区域 ;CWSE模型简便、通用 ,计算结果较为客观和稳定 ,为系统工程理论和实践提供了新的研究方法 .     

关于可达矩阵的求法探讨

在《离散数学》、《图论》课程中 ,用矩阵表示图时 ,涉及到一类重要的矩阵——可达矩阵 ,它是判别图中任意两点是否有通路的重要手段 ,也是求强分图的重要方法 ,但是可达矩阵的求法比较复杂 .本文针对这一问题 ,对可达矩阵的求法进行了改进 ,提出了一种简单可行的算法 .     

On computation of the greatest common divisor of several polynomials over a finite field

We propose a probabilistic algorithm to reduce computing the greatest common divisor of m polynomials over a finite field (which requires computing m−1 pairwise greatest common divisors) to computing the greatest common divisor of two polynomials over the same field.     

Computing homotopic shortest paths in the plane

We address the problem of computing homotopic shortest paths in the presence of obstacles in the plane. Problems on homotopy of paths received attention very recently [Cabello et al., in: Proc. 18th Annu. ACM Sympos. Comput. Geom., 2002, pp. 160–169; Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. We present two output-sensitive algorithms, for simple paths and non-simple paths. The algorithm for simple paths improves the previous algorithm [Efrat et al., in: Proc. 10th Annu. European Sympos. Algorithms, 2002, pp. 411–423]. The algorithm for non-simple paths achieves O(log²n) time per output vertex which is an improvement by a factor of O(n/log²n) of the previous algorithm [Hershberger, Snoeyink, Comput. Geom. Theory Appl. 4 (1994) 63–98], where n is the number of obstacles. The running time has an overhead O(n²⁺) for any positive constant . In the case k<n²⁺, where k is the total size of the input and output, we improve the running to O((n+k+(nk)^2/3)log^O(1)n).     

AN ALGORITHM FOR JORDAN CANONICAL FORM OF A QUATERNION MATRIX

In this paper, we first introduce a concept of companion vector, and study the Jordan canonical forms of quaternion matrices by using the methods of complex rep resentation and companion vector, not only give out a practical algorithm for Jordan canonical form J of a quaternion matrix A, but also provide a practical algorithm for corresponding nonsingular matrix P with P-1AP = J.