基于模糊聚类的语音识别

指出模糊聚类方法影响语间识别的正确率 ,提出用基于分解构造的模糊聚类方法设立语音模式的参考向量 ,说明该方法能提高语章识别的正确率。     

B—模糊集合代数和广义互信息公式

基于两种概率的区分，推导出了一个广义Shannon熵公式和一个广义互信息公式。后者和模糊性有关，并且柯用于语言和感觉中的信息度量。为了由原子语句为真的条件概率求出合语句为真的条件概率，提出了一个遵循存尔运算的模糊集合代数。所谓的模糊信息被还原为概率信息。新的理论在经典理论－概率论，集合论及Shannon信息论－的基础上容易理解。     

闭模糊拟阵模糊基的判定

通过讨论闭模糊拟阵的导出拟阵序列和模糊基的结构,找到了判定闭模糊拟阵的模糊基的一个充要条件。根据此充要条件,给出了从导出拟阵序列得到闭模糊拟阵的模糊基的一种算法。     

箱覆盖问题的半定松驰算法

箱覆盖问题是NP困难问题中的经典问题，得到了广泛地研究，九十年代以来，半定松驰策略被用来求解组合优化问题，取得了很好的结果[13]，本文首次给箱覆盖问题的半定松驰算法，算法的理论分析结果表明它适合于求解大规模的箱覆盖问题。     

Fuzzy集的基数

关于Fuzzy集的基数，[1]中曾对有限支集的Fuzzy集以及极苛刻条件下的无限Fuzzy集给出过一种定义。但是，正如本文将要指出的那样，该定义是不合理的。本文将从研究Fuzzy映射入手，给出Fuzzy集基数的一般性定义。基于这一定义，不但得到有关基数的大部分结论，而且有其自身的特殊性。     

因素空间与概念内涵的表示

本文综合应用因素空间、信息系统和重于关系的方法,讨论了概念的内涵表示及其他有关问题。特别是,对在描述概念问题中不同于内涵和外延的第三种方法,即典型示范表示做了进一步的分析。     

Continuous approximation schemes for stochastic programs

One of the main methods for solving stochastic programs is approximation by discretizing the probability distribution. However, discretization may lose differentiability of expectational functionals. The complexity of discrete approximation schemes also increases exponentially as the dimension of the random vector increases. On the other hand, stochastic methods can solve stochastic programs with larger dimensions but their convergence is in the sense of probability one. In this paper, we study the differentiability property of stochastic two-stage programs and discuss continuous approximation methods for stochastic programs. We present several ways to calculate and estimate this derivative. We then design several continuous approximation schemes and study their convergence behavior and implementation. The methods include several types of truncation approximation, lower dimensional approximation and limited basis approximation.His work is supported by Office of Naval Research Grant N0014-86-K-0628 and the National Science Foundation under Grant ECS-8815101 and DDM-9215921.His work is supported by the Australian Research Council.     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

模糊数序列的收敛性

探讨L-R型模糊数序列的S-和问题，定义关于模糊数的模糊小于的概念，在此基础上探讨模糊数的有序性，模糊数的截集函数的连续性，模糊数的格结构以及模糊数序列的收敛性等重要性质。     

模糊值Choquet积分(Ⅱ)--函数关于模糊值模糊测度的Choquet积分

研究一种取值于模糊数集的Choquet积分，该积分的被积函数是单值函数，所用的测度是模糊值模糊测度。给出其定义、性质和收敛定理。