基于改进灰色关联度的IOWA算子最优组合预测模型

通过引进诱导有序加权平均(IOWA)算子和改进灰色关联度的计算式,提出了新的基于改进灰色关联度的IOWA算子的组合预测模型.方法可以克服传统的组合预测方法赋予不变的加权平均系数和以单一误差指标作为预测精度衡量的缺陷.定义基于改进灰色关联度的IOWA算子的优性组合预测的概念,最后给出实例分析表明了新模型能有效地提高组合预测精度.     

灰色绝对关联度的改进模型

基于刘思峰教授提出的灰色绝对关联度模型,提出了一点改进,给出了新的灰色绝对关联度模型,并讨论了新模型的性质及其算法.一方面保持了原绝对关联度模型的优点,另一方面改正了原模型在某些方面的不足.     

基于改进的T型关联度和AHP的一种新评价模型

首先,对灰色T型关联度进行改进,弥补了其中的不足,通过实例验证,得到了较好的结果,同时展现了改进T型关联度模型的可信度,充分说明其具有广泛的应用价值.其次,将其改进的T型关联度与AHP相结合,构造了一种新的综合评价得分模型,可以反映事物的动态优劣变化,通过具体实例,说明了综合评价得分模型的可行性.     

基于改进灰色斜率关联度的评价研究

提出了一种对灰色斜率关联度的改进模型,并分析了它的性质,改进后的关联度模型能够反映序列的正、负相关关系,具有对称性、唯一性、可比性和无量纲化后的保序性.改进的灰色斜率关联度能够更充分地利用数据所包含的信息,所得关联分析结果较为客观可靠,最后以实例验证了评价方法的有效性与实用性.     

一类新型绝对接近关联度分析模型及应用

定义了一种新的灰色接近关联度模型—绝对接近关联度。研究了现有接近关联度的性质及问题,进而提出了新型绝对接近关联度的定义;研究了绝对接近关联度的计算方法;探讨了绝对接近关联度所具有的若干性质;将绝对接近关联度模型用于基于三角模糊数的多属性决策中,算例说明了方法的应用步骤和可行性。     

国债发行规模影响因素的灰色关联度分析

本文引进了一种新的多因素分析法──灰色关联度分析，对影响国债发行规模的影响因素进行分析，并将灰色关联度分析与传统分析方法──相关和回归分析──进行了比较，并由此得出几点启示．     

基于最大灰色关联度的聚类方法分析

利用多元统计学的最短距离法原理,定义了不同类别之间的关联度,构造了一种基于最大灰色关联度的聚类方法,建立了最大灰色关联度模型,并对模型进行求解,结果表明,新的聚类方法纠正了已有的灰色关联聚类中聚类原则存在的缺陷,从而为聚类提供了更有说服力且易于计算的方法.最后通过实例验证了该方法的客观性和有效性.     

灰色T型关联度的改进与实证

对现有的灰色T型关联度进行分析,并发现其中的优点与不足,通过综合两种模型的优点,从而提出改进的灰色T型关联度模型,改进过后的模型弥补了原来模型的不足.还对关联度的性质进行了讨论,并在最后进行了实证分析,以加强该模型的可信度.序列通过初值化处理后,再进行关联度计算,结果显示改进后的T型关联度具有有效性、可靠性和可行性.     

基于对数灰关联度的加权几何平均组合预测模型的有效性

基于对数灰关联度的加权几何平均组合预测是一种新的非线性组合预测。针对该方法提出新的优性组合预测、预测方法优超、冗余度等概念,给出优性组合预测存在的充分条件,最后证明冗余预测方法的一个判定定理。     

基于灰色关联度的多目标规划解法

分析了几种多目标规划解法的不足之处,在考虑多个目标之间的关联性的基础上,提出了一种新的求解多目标规划的方法.引入了灰色速率关联度来刻画目标函数之间的关联程度,定义了多目标转化为单目标的规则,利用此规则生成了新的目标函数,重新构建了约束条件.使用3种方法对同一多目标规划进行了求解,通过结果分析说明了基于灰色关联度的多目标规划解法的优越性.     

拓扑度的计算及其对超线性方程组的应用

本文利用锥理论给出了新的拓扑度计算方法．作为应用，研究了超线性积分方程组和超线性常微分方程组两点边值问题非平凡解的存在性．     

计算毁伤概率的二项展开优化法

对着发射击高射武器系统毁伤概率的计算公式提出了一种新算法 ,称为二项展开优化法 .它是在原有的常用算法二项展开法基础上改进得到的 .新算法保留了二项展开法实施容易、计算快的特点 ,又在一定程度上克服了原算法由于计算组合数 Ck N而带来的计算机计算过程中的舍入误差 .最后 ,文章又用实例比较了几种算法在计算毁伤概率值的精度与差异 .     

T型关联度及其计算方法

本文通过对传统的邓氏关联度［３－４］的研究，发现这种度量方法存在一些严重的缺陷。为了克服这些缺陷，本文提出了Ｔ型关联度的概念及其计算方法，并讨论了其特性。     

A Presentation for the Chow Ring of

We give a presentation for the Chow ring of the moduli space of degree 2 stable maps from 2-pointed rational curves to the projective line. Also, integrals of all degree 4 monomials in the hyperplane pullbacks and boundary divisors of this ring are computed using equivariant intersection theory. Finally, the presentation is used to give a new computation of the (previously known) values of the genus zero, degree 2, 2-pointed gravitational correlators of the projective line.     

Three new upper bounds on the chromatic number

This paper introduces three new upper bounds on the chromatic number, without making any assumptions on the graph structure. The first one, ξ, is based on the number of edges and nodes, and is to be applied to any connected component of the graph, whereas ζ and η are based on the degree of the nodes in the graph. The computation complexity of the three-bound computation is assessed. Theoretical and computational comparisons are also made with five well-known bounds from the literature, which demonstrate the superiority of the new upper bounds.     

A Unified Constructive Approach to the Topological Degree in Rn

The paper gives an approach to the topological degree in Rⁿ which takes into account numerical requirements and permits derivation of the known degree computation formulas in a simple way. The new approach subsumes several earlier approaches and represents a general principle of construction of degree computation formulas. The basic idea consists of computing the degree of a continuous function relative to a bounded open subset Ω of Rⁿ by means of an auxiliary function which is defined on a polyhedron approximating Ω and maps into a known fixed convex polyhedron containing the origin of Rⁿ. It is further shown that the topological degree of a continuous function relative to an n-dimensional polyhedron P can be computed alone by means of a subset of the boundary of P .     

A new error correction method for the stationary Navier-Stokes equations based on two local Gauss integrations

A new error correction method for the stationary Navier-Stokes equations based on two local Gauss integrations is presented. Applying the orthogonal projection technique, we introduce two local Gauss integrations as a stabilizing term in the error correction method, and derive a new error correction method. In both the coarse solution computation step and the error computation step, a locally stabilizing term based on two local Gauss integrations is introduced. The stability and convergence of the new error correction algorithm are established. Numerical examples are also presented to verify the theoretical analysis and demonstrate the efficiency of the proposed method.     

一种特殊函数的算法研究

由于有些函数的计算量巨大,因此通过算法的研究减少计算量是计算机发展的一个重要方向.本文通过对一个函数算法的研究,提出一种减少计算量的新算法.     

Global Optimal Control of Perturbed Systems

We propose a new numerical method for the computation of the optimal value function of perturbed control systems and associated globally stabilizing optimal feedback controllers. The method is based on a set-oriented discretization of the state space in combination with a new algorithm for the computation of shortest paths in weighted directed hypergraphs. Using the concept of multivalued game, we prove the convergence of the scheme as the discretization parameter goes to zero.     

Some robust objectives of FCM for data analyzing

There are many data clustering techniques available to extract meaningful information from real world data, but the obtained clustering results of the available techniques, running time for the performance of clustering techniques in clustering real world data are highly important. This work is strongly felt that fuzzy clustering technique is suitable one to find meaningful information and appropriate groups into real world datasets. In fuzzy clustering the objective function controls the groups or clusters and computation parts of clustering. Hence researchers in fuzzy clustering algorithm aim is to minimize the objective function that usually has number of computation parts, like calculation of cluster prototypes, degree of membership for objects, computation part for updating and stopping algorithms. This paper introduces some new effective fuzzy objective functions with effective fuzzy parameters that can help to minimize the running time and to obtain strong meaningful information or clusters into the real world datasets. Further this paper tries to introduce new way for predicting membership, centres by minimizing the proposed new fuzzy objective functions. And experimental results of proposed algorithms are given to illustrate the effectiveness of proposed methods.