Approximate minimum-cost multicommodity flows in\tilde O(ɛ −2 KNM) timetime

We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ^?2+logGK) logGM log (G? ^?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ^?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ^?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ^?3) times faster than the algorithm developed in the latter paper.     

Element-selective detection using capillary gas chromatography with atomic emission detection

Capillary GC coupled to an atomic emission detector (AED) provides a powerful new hyphenated technique for the separation and characterization of complex mixtures and compounds. The AED provides simultaneous and truly specific multi-element detection. The specificity of detection reduces the need for the complex sample pretreatment procedures which are necessary to reduce the interference from co-eluted substances which is experienced with detectors such as the FID and the ECD. A range of environmentally significant problems has been studied, including PCB analysis, the characterization of the reaction products of a novel waste treatment process, and the profiling of sulfur-containing species formed by the pyrolysis of various types of coal.     

On a class of least-element complementarity problems

The present paper studies the linear complementarity problem of finding vectorsx andy inR ₊ ⁿ such thatc + Dx + y 0,b – x 0 andx ^T (c + Dx + y) = y ^T (b – x) = 0 whereD is aZ-matrix andb > 0. Complementarity problems of this nature arise, for example, from the minimization of certain quadratic functions subject to upper and lower bounds on the variables. Two least-element characterizations of solutions to the above linear complementarity problem are established first. Next, a new and direct method to solve this class of problems, which depends on the idea of least-element solution is presented. Finally, applications and computational experience with its implementation are discussed.Research partially supported by the National Science Foundation Grant MCS 71-03341 A04 and the Air Force Office of Scientific Research Contract F 44620 14 C 0079.     

基于模糊理论的空间屏蔽滤波信号去噪

基于模糊理论提出了一种空间屏蔽滤波信号去噪方法.对信号进行二进小波变换后,对信号进行空间屏蔽滤波,对于未通过滤波器的系数进行模糊阈值处理实现去噪.通过对含噪HeaviSine和Doppler信号的去噪仿真,表明,该方法对噪音具有良好的抑制作用,能较好地保持信号在间断点处的信息.与传统空间屏蔽滤波相比,该方法对不同种类的含噪信号均具有良好的去噪效果.     

模糊有限自动机两个算子的若干性质

在文[1]定义了模糊有限自动机的bifuzzy seccessor算子和bifuzzy source算子的基础上,着重研究它们之间的基本性质及关系,并得到几个重要的性质定理。     

R0-代数的格蕴涵表示定理

通过对模糊命题演算系统∧*及相应的Lindenbaum代数的研究,给出了R0-代数的格蕴涵表示形式,极大地简化了R0-代数的定义形式,使得R0-代数从定义形式上更加符合逻辑代数的特征,突出了R0-代数和其它逻辑代数的区别与联系,为进一步研究R0-代数及其和其它逻辑代数的关系提供了一个强有力的工具。     

基于T2FCM-FE-HMMs的隐马氏模型参数估计算法

把2型模糊集的思想引入到了基于模糊聚类的离散HMM参数训练中,提出了改进的T 2FCM-FE-HMM s算法。     

具有数据丢失的网络化控制系统的基于观测器的镇定

研究具有数据丢失的网络化控制系统的基于观测器的镇定问题。受控对象是由T-S模糊模型描述的非线性时滞系统。把数据丢失过程建模成独立同分布过程。利用模糊Lyapunov函数方法得到了闭环系统随机稳定的充分条件,其基于观测器的反馈控制器可通过求解一组线性矩阵不等式来设计。一个仿真例子说明方法的有效性。     

偏序集上的滤子极大理想

在偏序集上引入并考察了滤子极大理想的概念,证明了相应的存在性定理。引入并考察了伪极大元和伪既约元的概念,利用图表的形式对连续格中各种类型的既约元和素元之间的关系进行了归纳总结,完善了文献《Continuous Lattices and Domains》(作者:G.Gierz,et al)中的一个图表的相关内容,填补了在分配的连续格情形该图表的一个未知内容,部分地回答了该文献中的一个问题。     

最大相关模糊查询及其应用研究

在文档类模糊查询方面进行了较深入的研究,首次提出并实现了间接相关全衰期和最大相关查询,其原理有别于传统字符串相等比率的模糊查询技术,采用相关性定义及最大相关传递模式,目的在于实现更广泛意义下的模糊查询。在适当定义相关度情形下,不但能够查找出传统模糊查询搜索到的内容,而且可以查找到字面上完全不同但意思相关的条文,最大相关传递模式能够使得词语之间的相关度按一定规则传递,因此更具一般性和实用性。