改进的PROMETHEE方法在招标中的应用研究

针对 PROMETHEE方法的局限性 ,对 PROMETHEE方法进行了改进 ,用效用函数取代了优先函数 ,提出了属性权重的确定方法 .应用改进的 PROMETHEE方法 ,对某装备招标中的 6个方案进行了评价 ,取得了较好的效果     

求解非线性方程重根的平方收敛迭代法

研究了具有重根的非线性方程的迭代方法,对基于动力系统的新牛顿类方法作了修改,改进方法仍保持了牛顿方法的二阶收敛性.数值实验结果验证了方法的有效性.     

基于关键链方法的多项目共享人力资源均衡问题及其遗传算法

通过对多项目管理瓶颈的分析,结合关键链方法,设置了瓶颈缓冲,建立了基于关键链方法的多项目管理,为多项目管理提供了一种新的管理方法.将基于关键链方法的多项目管理方法应用于并行多项目共享人力资源冲突管理,建立了基于遗传算法的多项目共享人力资源均衡模型,为缓解多项目共享人力资源供求矛盾提供了一种具体的量化管理方法,并进行了算例分析,证明了模型的有效性、实用性.     

一个无约束有限内存信赖域方法及其实现

本文针对大规模无约束优化问题研究了一个新的有限内存信赖域实现方法,提出了一个在有限维（维数≤2m＋1）子空间上精确求解信赖域子问题的方法,大大减少了计算量;分析了方法的收敛性,并详细给出了数值计算方法,最后通过数值实验验证了方法的有效性.     

传统隐式Runge-Kutta方法的转换方法

多级隐式Runge-Kutta(RK)方法簇中,除Gauss类方法是s级2s阶的辛方法以外,Radau类方法和Lobatto类方法既不是s级2s阶的方法也不是辛方法.基于隐式RK方法是一类转换RK方法这一特征,利用V-变换和Pade对角逼近,提出了构造高阶RK方法的转换定理.依据转换定理,导出了s级2s阶的Radau方法和s级2s阶的Lobatto方法.利用V-变换和待定系数法,导出了辛Radau方法和辛Lobatto方法.在此基础上,发现并证明了辛Radau方法是s级2s阶的方法.     

一阶微分方程数值解的一种误差估计方法

针对于微分方程数值解,介绍了一种新的误差估计方法.方法证实了伪谱方法具有精度高速度快的优点,进而引出了修正的伪谱方法.     

基于FA-DEA聚类的模式分析方法及在我国软件园研究中的应用

模式分析方法日益成为现代经济管理研究的主流方法之一,但是目前关于模式分析的结构化方法的研究还不多见.本文提出了基于FA-DEA聚类的模式研究结构化方法,这个方法区别于以往文献的是采用了混合聚类方法,综合运用关键因素的绝对量信息和效率的相对量信息.基于上述方法,本文确定了我国软件园发展的三种发展模式.并对三个模式的条件、特征以及它们之间的分界与演进做了详细的描述.最后,给出了若干建议.     

基于广义最大熵原理和遗传算法的多指标权重确定方法研究

本文探讨了多目标评价的实现过程,针对评价过程的权重确定问题,提出了基于广义最大熵原理和遗传算法的赋权方法,该方法把不同赋权方法有机地集成在一起,并可以对各种赋权方法进行优劣比较。最后用实例验证了该方法的准确性、可靠性和有效性。     

基于模糊结构元表述的模糊数排序

讨论了如何利用结构元理论来解决模糊数的排序问题.首先,给出了四种经典的模糊数排序方法,并证明了这四种方法都可以利用结构元理记来表述;进而,提出了一种基于结构元理论的排序方法,给出了该方法的性质,并同传统方法进行了比较.     

页岩气藏渗流模型的特征混合有限元数值模拟

将特征有限元方法和混合有限元方法进行耦合,对页岩气藏渗流模型进行了数值模拟,给出了详细的误差分析,得到了最优的L~2模误差估计,并用数值实验验证了方法的有效性.     

有资格限制的指派问题的求解方法

在实际的指派工作中，常会遇到某个人有没有资格去承担某项工作的问题，因此，本建立了有资格限制的指派问题的数学模型。在此数学模型中，将效益矩阵转化为判定矩阵，由此给出了判定此种指派问题是否有解的方法；在有解的情况下，进一步将效益矩阵转化为求解矩阵，从而将有资格限制的指派问题化为传统的指派问题来求解。最后给出了一个数值例子来说明这样的处理方法是有效的。     

Admissibility of estimators of the probability of unobserved outcomes

The problem of estimating the probability of unobserved outcomes or, as it is sometimes called, the conditional probability of a new species, is studied. Good's estimator, which is essentially the same as Robbins' estimator, namely the number of singleton species observed divided by the sample size, is studied from a decision theory point of view. The results obtained are as follows: (1) When the total number of different species is assumed bounded by some known number, Good's and Robbins' estimators are inadmissible for squared error loss. (2) If the number of different species can be infinite, Good's and Robbins' estimators are admissible for squared error loss. (3) Whereas Robbins' estimator is a UMVUE for theunconditional probability of a new species obtained in one extra sample point, Robbins' estimator is not a uniformly minimum mean squared error unbiased estimator of the conditional probability of a new species. This answers a question raised by Robbins. (4) It is shown that for Robbins' model and squared error loss, there are admissible Bayes estimators which do not depend only on a minimal sufficient statistic. A discussion of interpretations and significance of the results is offered. Research supported by NSF Grant DMS-88-22622.     

有限子集系的Sperner系

1９８０年，Ｋｏ-Ｗｅｉ Ｌｉｈ提出如下猜想：如果Ｆ是由Ｂ^ｎ中固定秩的不同元素生成的序理想，那么Ｆ是Ｓｐｅｒｎｅｒ系．本文证实了当Ｆ是由Ｘ的子集Ｙ的所有相同秩的元素生成的序理想，猜想是正确的     

Stabilizability of two classes of contraction semigroups

This paper studies the strong stabilizability of two classes of Hilbert space contraction semigroups: (i) strict contraction semigroups, which include those with strictly dissipative generators; and (ii) isometric or unitary semigroups. The former class is already weakly stable, while the latter is not strongly stable over the whole space. Our tool is the functional model of Hilbert space contractions; hence, strong stability of the semigroup is studied via stability of its cogenerator. It is shown that a strict contraction semigroup is, in general, not strongly stabilized by the feedback –B*, while an isometric or a unitary semigroup is strongly stabilized by the same feedback, providedB is not compact.     

On estimating of the number of constituents of a finite mixture of continuous distributions

Summary Suppose thatH is a mixture of distributions for a given familyF A necessary and sufficient condition is obtained under whichH is, in fact, a finite mixture. An estimator of the number of distributions constituting the mixture is proposed assuming that the mixture is finite and its asymptotic properties are investigated.     

分形空间的局部紧性及网极限

对于完备度量空间 (X ,d) ,研究了X的局部紧性与相应分形空间 (H(X) ,h)的局部紧性之间的关系 ,得到结论 :(H(X) ,h)是局部紧的当且仅当X是局部紧的 .另一方面 ,给出了 (H(X) ,h)中收敛网的极限通过并、交及闭包运算的表示 .     

22号初等元胞自动机的极限语言复杂性

§1Introduction Thetaskofthispaperistosolvetheproblemproposedin[1],i.e.,toexplorethe complexityoflimitset,orequivalently,limitlanguageoftheelementarycellularautomaton ofrule22bythetoolsofformallanguagetheory.Cellularautomata(abbreviatedasCA),asmathematicalmodelsforcomplexnatural systemscontaininglargenumbersofsimpleidenticalcomponentswithlocalinteractions,havebeenwidelyusedinphysical,biological,chemicalandcomputationalsystems[2].Despitetheirsimpleconstruction,someCAcandisplayveryrichandcompl…     

The method of determining all real nonmultiple roots of systems of nonlinear equations

A method for determining all nonmultiple roots of the system of nonlinear equations in an n-dimensional parallelepiped is proposed. The main idea of the method is that the original set, in which the roots are sought, is divided into subsets where either the system of equations does not have solutions or its Jacobian matrix is nonsingular. A partition algorithm is presented and its convergence is proved. The application of the method is demonstrated using several examples.     

一类柔性臂机器人的稳定性

本文研究了一类柔性臂机器人的控制问题,且柔性臂的弯曲振动与扭转振动的耦合作用表现在边界方程中。本文运用算子谱理论、算子半群理论等,得到系统的主算子生成的C0-半群的具体表示式,并证明了半群的解析性、非紧性及非一致指数稳定性。     

Dependence of polynomial chaos on random types of forces of KdV equations

In this study, one-dimensional stochastic Korteweg–de Vries equation with uncertainty in its forcing term is considered. Extending the Wiener chaos expansion, a numerical algorithm based on orthonormal polynomials from the Askey scheme is derived. Then dependence of polynomial chaos on the distribution type of the random forcing term is inspected. It is numerically shown that when Hermite (Laguerre or Jacobi) polynomial chaos is chosen as a basis in the Gaussian (Gamma or Beta, respectively) random space for uncertainty, the solution to the KdV equation converges exponentially. If a proper polynomial chaos is not used, however, the solution converges with slower rate.