不确定隶属度语言Einstein算子及其应用

在不确定隶属度语言变量和Einstein算子的基础上,提出了一种新的算子—不确定隶属度语言Einstein算子,并将其应用到多属性群决策中.首先定义了不确定隶属度语言Einstein算子的概念、相应的运算规则、大小比较方法.之后提出了几种新的不确定隶属度语言Einstein算子,比如:不确定隶属度语言Einstein加权算术平均算子(UMLEWA)、不确定隶属度语言Einstein加权几何平均算子(UMLEWG)、不确定隶属度语言Einstein有序加权算术平均算子(UMLEOWA)、不确定隶属度语言Einstein有序加权几何平均算子(UMLEOWG)、广义不确定隶属度语言Einstein加权算术平均算子(GUMLEWA)、广义不确定隶属度语言Einstein加权几何平均算子(GUMLEWG),以及算子的相应性质(幂等性,有界性,单调性),并证明了性质的正确性.其次在不确定隶属度语言Einstein加权算术平均算子(UMLEWA)和不确定隶属度语言Einstein加权几何平均算子(UMLEWG)基础上,提出了两种不同的方法来处理多属性群决策问题,并给出了具体的群决策步骤.最后,通过实例验证了所提方法的有效性和可行性.     

改进的灰色相似关联度模型在水质评价中的应用

基于灰色系统理论,提出一种改进的灰色相似关联度模型.通过计算评价对象的单因素隶属度矩阵,得到与各标准水质级别在不同评价指标处的灰色相似关联系数,最后根据灰色相似关联系数得到对各标准水质级别的综合隶属度.将此方法应用于延河流域的八个监测断面进行水质综合评价,取得了较好的结果.在此基础上进一步分析和改进了最大隶属度原则,在考虑最大隶属度的同时,综合考虑评价对象对各标准水质级别隶属度的分布,并制定了调整规则.     

区间灰数直觉模糊集及其G-TOPSIS模糊多属性决策方法

提出以区间灰数为隶属度、非隶属度和犹豫度的区间灰数直觉模糊集概念,定义了两个区间灰数直觉模糊集之间的距离.对于以灰直觉模糊数为属性值的模糊多属性决策,依据经典TOPSIS准则,提出了基于区间灰数直觉模糊集的模糊多属性决策方法G-TOPSIS.其包含两种方法:一是将区间灰数白化后,按直觉模糊集的TOPSIS方法进行;一是基于区间灰数直觉模糊距离的TOPSIS方法.示例分析表明了两种方法的有效性与一致性.     

模糊概率神经网络水质评价模型及其应用

鉴于水质类型和分级标准存在模糊性,将模糊数学中的相对隶属度理论和概率神经网络和相结合,构建了模糊概率神经网络水质评价模型(FPNN).阐明了该模型的构建方法,提出了基于指标相对隶属度矩阵插值构建学习样本的方法,并将该模型应用于实际水质评价.通过与综合评判法、属性识别法和BP网络法的比较,验证了该模型操作简便,评价结果客观可靠.     

区间直觉犹豫模糊集的两种相似测度及其在模式识别中的应用

模糊集的相似测度是模糊集理论的重要组成部分之一,有着广泛的应用.首先给出了基于隶属度、非隶属度和犹豫度的区间直觉犹豫模糊集的标准海明距离、标准欧氏距离、广义标准海明距离公式以及它们的加权距离公式.然后提出了基于距离的区间直觉犹豫模糊集相似测度和区间直觉犹豫模糊集的余弦相似度,并给出了公理化证明.两种相似测度均包含了区间直觉犹豫模糊集的隶属度、非隶属度和犹豫度.最后将这两种相似测度应用到基于区间直觉犹豫模糊信息的模式识别中.     

不确定区间隶属度语言变量及其应用

基于不确定语言变量和区间模糊数,提出了不确定区间隶属度语言变量的概念,定义了不确定区间隶属度语言变量的运算规则、大小比较方法,给出了不确定区间隶属度语言变量的加权算术平均算子、加权几何平均算子及其相应性质,并将这些算子应用于属性权重确知且属性值以不确定区间隶属度语言变量形式给出的不确定多属性群决策问题中,通过示例验证了基于不确定区间隶属度语言变量信息的多属性群决策方法的有效性和可行性。     

基于结构元理论的模糊数的贴近度

现有的计算贴近度的方法,都是建立在模糊集合的隶属函数基础之上的.在很多情况下,当隶属函数很难解析表达时,这时就很难用这些方法计算贴近度.为此,在结构元理论的基础上,提出并构造了模糊数的贴近度(称之为元贴近度).当隶属函数很难解析表达时,用其他方法无法得到的贴近度,此时,用元贴近度的方法往往可以得到,并且计算非常简捷.最后,通过一个模式识别例子,表明该方法的有效性.     

基于灰色关联分析的模糊支持向量机中隶属度的确定

本文用灰色关联分析来替代模糊隶属度的求解,提出了一种新的有效地刻画样本不确定性的隶属度计算方法,理论上表明它是解决模糊支持向量机方法中一般使用特征空间中样本与类中心之间的距离关系构建隶属度函数的不足的方法之一,在一些特定条件下分类性能要强一些.     

基于贝塞尔曲线理论的备件需求模糊隶属度函数构建模型

用模糊理论描述备件需求是一种科学适用的方法,针对现有模糊变量隶属度函数构建方法的不足, 设计了基于贝塞尔曲线理论的备件需求模糊隶属度函数构建方法,给出了隶属度求解算法,分析了使拟合误差最小的控制点选择方法.同时通过实例验证以及与最小二乘法的对比分析,验证了贝塞尔曲线方法在构建备件需求模糊隶属度函数方面的有效性.此方法无需事先假设隶属度函数的形态,简单易用、使用灵活并且精度较高.     

对偶犹豫模糊集的熵及在多属性决策中的应用

将研究对偶犹豫模糊集的熵理论.对偶犹豫模糊集是由隶属度和非隶属度组成的,每部分都含有几个可能的数值.首先,提出基于隶属度,非隶属度,以及犹豫度三个指标的对偶犹豫模糊值(DHFE)的熵公理化定义和熵公式.在此基础上,提出对偶犹豫模糊集(DHFS)的熵公理化定义和熵公式,从而完善对偶犹豫模糊集的熵理论.最后,利用具体的多属性决策实例说明所提熵公式的实用性和有效性.     

Lower bounds on the cardinality of the maximum matchings of planar graphs

Lower bounds on the cardinality of the maximum matchings of planar graphs, with a constraint on the minimum degree, are established in terms of a linear polynomial of the number of vertices. The bounds depend upon the minimum degree and the connectivity of graphs. Some examples are given which show that all the lower bounds are best possible in the sense that neither the coefficients nor the constant terms can be improved.     

A note on degree-continuous graphs

The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.     

Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem

We develop ideas to enhance the performance of the variable neighborhood search (VNS) by guiding the search in the shaking phase, and by employing the Skewed strategy. For this purpose, Second Order algorithms and Skewed functions expressing structural differences are embedded in an efficient VNS proposed in the literature for the degree constrained minimum spanning tree problem. Given an undirected graph with weights associated with its edges, the degree constrained minimum spanning tree problem consists in finding a minimum spanning tree of the given graph, subject to constraints on node degrees. Computational experiments are conducted on the largest and hardest benchmark instances found in the literature to date. We report results showing that the VNS with the proposed strategies improved the best known solutions for all the hardest benchmark instances. Moreover, these new best solutions significantly reduced the gaps with respect to tight lower bounds reported in the literature.     

拉开档次法稳定性分析及改进

采用随机模拟仿真的方法分别从增添异常对象和极端样本两个方面对拉开档次法的稳定性进行了分析,给出了相关结论。在此基础上,基于“因子分析”提出了拉开档次法的改进方法,算例部分的分析表明该方法因兼顾了同类数据之间的内部差异,能够削弱“异常值”对原始数据的干扰作用,从而进一步提升了方法的稳定性。最后,指出拉开档次法适用于评价指标数目较少的评价问题,而基于“因子分析”的改进方法则适合于数据数目较多且指标有相关关系的评价问题。     

Contractions and hamiltonian line graphs

Using the contraction method, we find a best possible condition involving the minimum degree for a triangle-free graph to have a spanning eulerian subgraph.     

Subdivisions of graphs: A generalization of paths and cycles

One of the basic results in graph theory is Dirac's theorem, that every graph of order n?3 and minimum degree ?n/2 is Hamiltonian. This may be restated as: if a graph of order n and minimum degree ?n/2 contains a cycle C then it contains a spanning cycle, which is just a spanning subdivision of C. We show that the same conclusion is true if instead of C, we choose any graph H such that every connected component of H is non-trivial and contains at most one cycle. The degree bound can be improved to (n-t)/2 if H has t components that are trees.We attempt a similar generalization of the Corrádi-Hajnal theorem that every graph of order ?3k and minimum degree ?2k contains k disjoint cycles. Again, this may be restated as: every graph of order ?3k and minimum degree ?2k contains a subdivision of kK₃. We show that if H is any graph of order n with k components, each of which is a cycle or a non-trivial tree, then every graph of order ?n and minimum degree ?n-k contains a subdivision of H.     

Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs

For an edge‐colored graph, its minimum color degree is defined as the minimum number of colors appearing on the edges incident to a vertex and its maximum monochromatic degree is defined as the maximum number of edges incident to a vertex with a same color. A cycle is called properly colored if every two of its adjacent edges have distinct colors. In this article, we first give a minimum color degree condition for the existence of properly colored cycles, then obtain the minimum color degree condition for an edge‐colored complete graph to contain properly colored triangles. Afterwards, we characterize the structure of an edge‐colored complete bipartite graph without containing properly colored cycles of length 4 and give the minimum color degree and maximum monochromatic degree conditions for an edge‐colored complete bipartite graph to contain properly colored cycles of length 4, and those passing through a given vertex or edge, respectively.     

属性和专家客观权重未知的多值中智数群决策方法

针对评价信息为多值中智数的多属性决策问题,提出基于最小最大相似度求解属性权重与标准区间求解专家权重的方法.该方法首先根据最小最大模型求解属性权重,将初始评价矩阵集结为综合决策矩阵,其次利用数字分析法求得标准区间,根据各专家与标准区间的相似度确定专家权重,再对综合评价矩阵集结得各方案的综合评价值,对综合评价值排序得最优方...     

Necessary conditions of the isolated zero-points with nonzero degree and choice of initial approximations for the secant method in the n-dimensional case

Necessary conditions of isolated zero-points with nonzero degree (in particular, point of local minimum or maximum either saddlepoint) in R ⁿ which is an extension of the rule that the first derivative of a function changes a sign in every neighborhood of an isolated point of local minimum or maximum in JR1 and connected with this choice of initial approximations for the secant method are given and proved. Most of the statements are given through using the basic topological facts such as degree, the fiberings of a finite dimensional sphere, homotopy, quotient topology, etc.     

正则图的限制性边连通度

将连通图分离成阶至少为二的分支之并的边割称为限制性边割,最小限制性边割的阶称为限制性边连通度. 用λ′(G)表示限制性连通度,则λ′(G)≤ξ(G),其中ξ(G)表示最小边度. 如果上式等号成立,则称G是极大限制性边连通的. 本文证明了当k＞|G|/2时,k正则图G是极大限制性边连通的,其中k≥2, |G|≥4; k的下界在某种程度上是不可改进的.