基于Hausdauff度量的模糊TOPSIS方法研究

针对模糊多属性决策中的模糊 TOPSIS方法 ,提出了一种基于 Hausdauff度量的模糊 TOPSIS方法 .首先由模糊极大集与模糊极小集确定模糊多属性决策问题的理想解与负理想解 ,进而由 Hausdauff度量获得不同备选方案到理想解与负理想解的距离及其贴近度 ,根据贴近度指标对方案进行排序 ,为决策者提供决策支持 .最后以 L-R梯形模糊数为例进行了实例研究 .     

基于不同距离的TOPSIS油田开发方案组合优选

为了衡量TOPSIS方法中不同距离函数对油田开发最优决策方案的影响,综合考虑技术、经济和效益等指标,分别采用曼哈顿距离、欧式距离、切比雪夫距离和垂面距离来探究油田开发方案排序之间的差异性.同时,为解决这种差异,通过计算4种距离函数下方案排序对理想开发方案的隶属度,并采用加权组合决策的方法对4种优选结果进行综合决策.     

基于区间数的TOPSIS方法在水驱油田开发效果评价上的应用

针对目前油田高含水期水驱开发效果评价难度大、评价方法多集中在模糊综合评价方法上,提出应用区间数的TOPSIS方法(逼近理想点排序)对油田水驱开发效果进行评价.首先对区间数多指标决策问题和区间数的相关运算进行了描述,给出了区间数TOPSIS方法的计算步骤.然后根据水驱开发效果指标评价标准及待评价区块生产数据建立评价对象区间数决策矩阵,进而确定最优方案(正理想点)和最劣方案(负理想点),并计算待评价方案与最优方案的相对贴近度,再结合[0,1]语言标度区间确定评价结果.最后,给出实例验证该方法的可行性和有效性.     

基于TOPSIS的属性关联直觉模糊多属性决策方法

针对属性值为直觉模糊数,已知部分属性偏好关系及属性交互类型的属性关联多属性决策问题给出决策方法.首先定义方案到正(负)理想方案的距离及各方案与正理想方案相对贴近度.然后以极大化各方案与相对贴近度为目标建立优化模型,确定出属性集的模糊测度.进而基于直觉模糊Choquet积分算子计算各方案的直觉模糊综合评价值,再根据直觉模糊数的得分值及精确度得到方案的排序.最后通过实例验证了方法的有效可行性.     

基于区间直觉梯形模糊数的改进TOPSIS多属性决策方法

研究了属性权重完全未知的区间直觉梯形模糊数的多属性决策问题,结合TOPSIS方法定义了相对贴近度及总贴近度公式.首先由区间直觉梯形模糊数的Hamming距离给出了每个方案的属性与正负理想解的距离,基于此,给出了相对贴近度矩阵,根据所有决策方案的综合贴近度最小化建立多目标规划模型,从而确定属性的权重值,然后根据区间直觉梯形模糊数的加权算数平均算子求出各决策方案的总贴近度,根据总贴近度的大小对方案进行排序;最后,通过实例分析说明该方法的可行性和有效性.     

多指标区间决策的理想点贴近法

研究了指标的权重不能完全确定但知道其所在区域的条件下的多指标决策问题 ,给出了方案与理想解的贴近度及其算法 ,按贴近度的大小可以对方案进行排序 .它同传统的决策方法相比较 ,具有需要信息量少 ,简单可靠等特点 .最后用该决策方法分析了一个实际问题 .     

模糊多属性格序决策的冗余指标的消除策略

在模糊多属性决策中,属性权重的确定对于整个评价工作有十分重要的意义.如果评价属性数量过多,指标间的相关性将影响评价的科学性和公平性.本文建立了评价值为梯形模糊数的"相似"概念和模糊相似评价模型,并基于格序决策的理论,得到了一种新的模糊格序决策方法.结合传统的TOPSIS方法,通过计算将各方案的属性值的中心进行加权后与正负理想中心的贴近度的大小,实现备选方案的格序化排序.实例分析的结果表明:方法合理、易行.     

不完全信息下的区间直觉模糊数的多属性决策方法

针对属性权重信息不完全的区间直觉模糊的多属性决策问题,提出灰色关联分析的决策方法.该方法首先确定各属性下的最佳和最劣方案,确定各方案与理想方案的灰色关联系数,然后在属性权重信息不完全的情况下,建立基于理想点的最优决策模型,求出属性权重,进而根据与理想方案的相对贴近度对各方案进行排序,最后用实例对该方法进行了说明,理论分析和数据结果表明了方法的可行性和有效性.     

基于区间数贴近度的不确定多属性决策模型

针对只有部分权重信息且属性值以区间数形式给出的多属性决策问题,提出了一种基于区间数贴近度的决策方法.首先讨论了区间数贴近度的定义和性质;然后给出了解决不确定多属性决策问题的一般步骤.并依据传统的逼近理想解的基本思路,以实际评价值与理想解之间的贴近度最大化为目标建立优化模型,从而得到指标权重.进而计算出每个方案与正理想解的相对贴近度,即可得到所有方案的排序结果.方法能充分利用规范化评价的先验信息,评价结果客观可靠,不具有主观随意性.最后通过实例分析验证了该方法的有效性和实用性.     

基于灰关联分析和相对熵的多属性决策排序方法

在灰关联分析和相对熵决策方法的基础上,结合各自的优点,提出了一种解决多属性决策问题排序的新方法.首先利用改进熵对评价属性进行赋权,其次计算被评方案与理想方案和负理想方案的灰色关联度和相对熵,最后根据相对贴近度的大小对被评方案进行排序,案例说明了决策方法的有效性和实用性.     

Estimation of the number of components of finite mixtures of multivariate distributions

An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.     

Eigenvector p-Bases of Rings of Constants of Derivations

Let A be a UFD of characteristic p > 0, let 𝒵 be a set of some eigenvectors of a derivation of A. We prove, under some additional assumptions, a necessary and sufficient condition for 𝒵 to be a p-basis of the minimal ring of constants containing 𝒵. The main preparatory result is the unique decomposition theorem with respect to a factor from a given subalgebra containing A^p.     

Galois Structure of K-Groups of Rings of Integers

N/Kbe a Galois extension of number fields with finite Galois group G.We describe a new approach for constructing invariants of the G-module structure of the K groups of the ring of integers of N in the Grothendieck group of finitely generated projective Z[G]modules. In various cases we can relate these classes, and their function field counterparts, to the root number class of Fröhlich and Cassou-Noguès.     

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

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

On Sums of Coefficients of Products of Polynomials

We study the nilpotency of the sums of all coefficients of some sorts of products of polynomials over reversible, IFP, and NI rings, and introduce an SCN ring as a generalization. We characterize SCN rings in relation with related ring properties, and also provide several useful properties and ring extensions of SCN rings.     

Convergence of sequences of sets of associated primes

It is a well-known result of M. Brodmann that if is an ideal of a commutative Noetherian ring , then the set of associated primes of the -th power of is constant for all large . This paper is concerned with the following question: given a prime ideal of which is known to be in for all large integers , can one identify a term of the sequence beyond which will subsequently be an ever-present? This paper presents some results about convergence of sequences of sets of associated primes of graded components of finitely generated graded modules over a standard positively graded commutative Noetherian ring; those results are then applied to the above question.

     

Rates of Convergence of Means of Euclidean Functionals

Let L be the Euclidean functional with p-th power-weighted edges. Examples include the sum of the p-th power-weighted lengths of the edges in minimal spanning trees, traveling salesman tours, and minimal matchings. Motivated by the works of Steele, Redmond and Yukich (Ann. Appl. Probab. 4, 1057–1073, 1994, Stoch. Process. Appl. 61, 289–304, 1996) have shown that for n i.i.d. sample points {X ₁,…,X _n } from [0,1] ^d , L({X ₁,…,X _n })/n ^(d−p)/d converges a.s. to a finite constant. Here we bound the rate of convergence of EL({X ₁,…,X _n })/n ^(d−p)/d . Y. Koo supported by the BK21 project of the Department of Mathematics, Sungkyunkwan University. S. Lee supported by the BK21 project of the Department of Mathematics, Yonsei University.     

Number of connected components of groups of real points of adjoint groups

We present a unified approach to compute the number of connected components in the group of real points of adjoint almost simple real algebraic groups.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².