模糊层次分析法(FAHP)

首先通过分析指出层次分析法（ＡＨＰ）存在的总理２，然后给出了较文献「２」条件更弱的模型一致矩阵的定义，并对新定义的模糊一致矩阵的性质，用模糊一致矩阵表示因素两两重要性比较的合理性以及表示因素两两重要性比较的模糊一致矩阵同表示因素重要程度权重之间的关系进行了讨论最后给出了模糊层次分析法５的原理和步骤。  

Factoring wavelet transforms into lifting steps

This article is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is well-known to algebraists (and expressed by the formulaSL(n;R[z, z⁻¹])=E(n;R[z, z⁻¹])); it is also used in linear systems theory in the electrical engineering community. We present here a self-contained derivation, building the decomposition from basic principles such as the Euclidean algorithm, with a focus on applying it to wavelet filtering. This factorization provides an alternative for the lattice factorization, with the advantage that it can also be used in the biorthogonal, i.e., non-unitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a wavelet-like transform that maps integers to integers. Research Tutorial Acknowledgements and Notes. Page 264.  

非线性跟踪─微分器

非线性跟踪一微分器韩京清，王伟（中国科学院系统科学研究所，北京１０００８０）国家自然科学基金资助课题．１９９２年７月２５日收到，１９９３年２月１７日收到修改稿．一、前言在实际工程问题中，常存在由不连续或带随机噪声的量测信号合理地提取连续信号及微分信号...  

亚正定阵理论(Ⅰ)

亚正定阵是正定(实对称)阵概念的一般化.本文(Ⅰ)较详细地研究亚正定阵的各种基本性质,并将 Schur 关于正定阵的 Hadamard 乘积的著名结果以及华罗庚定理推广到亚正定阵,从而得到了更多的有用结论.  

基于模糊一致矩阵的模糊层次分析法的排序

分析基于模糊一致矩阵的模糊层次分析法 (FAHP) ,改正文 [4 ]中存在的两个将会误导决策的错误 ,给出并证明模糊一致矩阵的一些重要性质 ,获得模糊互补判断矩阵下的一个简明排序计算公式 ,完善模糊层次分析法的排序原理。  

粗糙集理论介绍和研究综述

介绍粗糙集理论的基本原理，粗糙集理论中的知识表示以及目前粗糙集理论的研究状况。  

L^∞（G）中的一个闭凸不变集

设G是局部紧群,f是G上的右一致连续函数.本文讨论L(G)中一个闭凸不变集的关系式Co{Lxfx∈G}11@11={φ*fφ∈P＇(G)}11@11(f∈R∪C(G)).由此式易得出RUC(G)上的左不变平均与拓扑左不变平均的等价关系.  

亚正定阵理论(Ⅱ)

本文继续[Ⅰ]的讨论,建立了亚正定阵的行列式理论。给出了许多新的结果:例如广义Minkowski不等式、广义凸性不等式等等,对某些种类的亚正定阵,还将关于任意阵的行列式的Hadamard不等式作了改进。最后,将Open-heim关于正定阵的Hadamavd乘积的著名结果推广到亚正定阵上。  

Fuzzy蕴涵代数

本文讨论一个新的代数系统Fuzzy蕴涵代数,简称FI代数。FI代数是[0,1]值逻辑的蕴涵连接词的代数抽象,我们讨论了两类重要的FI代数—正则FI代数和HFI代数,并指出正则HFI代数与Boole代数的内在联系。  

A new polynomial-time algorithm for linear programming

We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n ^3.5 L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor ofO(n ^2.5). We prove that given a polytopeP and a strictly interior point a εP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property. The ratio of the radius of the smallest sphere with center a′, containingP′ to the radius of the largest sphere with center a′ contained inP′ isO(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial time. This is a substantially revised version of the paper presented at the Symposium on Theory of Computing, Washington D. C., April 1984.