A New Method for Target Recognition

1　Introduction　SinceZadeh[1] establishedfuzzysettheoryin 196 5 ,fuzzysetmakesgreatachievementintheoryandapplica tion[2～ 5] .Becausethereexistintrinsicfuzzinessinpat ternrecognition ,usingfuzzysettopatternrecognitionacquiregreatsuccess.Toexplainthedifferentandrela tionbetweenfuzzysetandprobabilitytheory ,Zadeh[6 ]introducedpossibilitytheoryin 1978.Possibilitytheoryhadbeenusedinfuzzyreason ,fuzzycontrolandexpertsystem[7～ 9] .Applingpossibilitytheoryto patternrecognitionisattemptedbyHalland…     

VOD在有线电视网的实现

从视频点播系统的结构及组成和在有线电视网络中VOD系统的结构模式与应用两个方面，详细地阐述了如何利用有线电视网络实现视频点播，主要从以下3个方面介绍关于视频点播系统VOD技术：①视频点播VOD的技术原理；②视频点播系统的结构及组成；③有线电视视频点播系统的结构模式与应用。     

基于模糊控制原理的多目标决策方法

在模糊控制原理的基础上,对于含有定性变量的多目标决策问题提出了一种新的求解方法:先把目标值与权重进行模糊化,再通过模糊推理和反模糊化过程直接得到各方案的评价值,进而进行多目标决策.具体实例的计算结果表明,该方法具有简单、实用、直观的优点.     

Constructive Sets in Computable Sets

The original interpretation of the constructive set theory CZF in Martin-Loef‘s type theory uses the‘extensional identity types’.It is generally believed that these‘types’do not belong to type theory.In this paper it will be shown that the interpretation goes through without identity types.This paper will also show that the interpretation can be given in an intensional type theory.This reflects the computational nature of the interpretation.This computational aspect is reinforced by an ω-Set moel of CZF.     

关于超立方体网络的容错路径选择

文章给出ｎ－维超立方体网络的容错路径选择算法，该算法具有自适应性，可以防止死锁和活锁现象的发生，应用该算法，可求出一条基于安全优先策略的可行最短路径。     

多目标二次规划非劣解集的理论生成及应用

本文对多目标二次规划问题非劣解集的理论生成进行了探讨,在介绍二次规划单目标问题优化解求法的基础上,提出了在决策平面上互切点,共交点轨迹的概念.由此导出了非劣解集的一般解析式(对切点解问题)和另一类交点解问题时的非劣解集求法,然后介绍了在目标平面非劣解集的解析表达式.使多目标二次规划问题整个非劣解集的推求严格、明确和方便,有理论和实际意义。文中以一个综合利用水库参数的多目标优选作为例子阐述了应用,并求出了最终的最佳协调解.     

用电话网实现远程监控自动化

分析了偏僻高山上通信机房和电气房要进行监控的内容和特点等，探讨 了用经济、可靠的电话交换网实现远程监控自动化的方案和实施办法。该设计根据监控对象 的特点，利用现有的电话网络和程控交换机实现远程监控，不需要专用通信传输通道，不需 要增加硬件和软件，成本低，技术成熟，容易实现。     

On the monotonicity of (LDL) logic programs with set

LDL is one of the recently proposed logical query languages, which incorporate set, for data and knowledge base systems. Since LDL programs can simulate negation, they are not monotonic in general. On the other hand, there are monotonic LDL programs. This paper addresses the natural question of “When are the generally nonmonotonic LDL programs monotonic?” and investigates related topics such as useful applications for monotonicity. We discuss four kinds of monotonicity, and examine two of them in depth. The first of the two, called “ω-monotonicity”, is shown to be undecidable even when limited to single-stratum programs. The second, called “uniform monotonicity”, is shown to implyω-monotonicity. We characterize the uniform monotonicity of a program (i) by a relationship between its Bancilhon-Khoshafian semantics and its LDL semantics, and (ii) with a useful property called subset completion independence. Characterization (ii) implies that uniformly monotonie programs can be evaluated more efficiently by discarding dominated facts. Finally, we provide some necessary and/or sufficient, syntactic conditions for uniform monotonicity. The conditions pinpoint (a) enumerated set terms, (b) negations of membership and inclusion, and (c) sharing of set terms as the main source for nonuniform monotonicity.     

基于Level set方法的医学图像分割

本文引入了一种基于偏微分方程的曲线进化方法—Level set方法,通过与Fast marching方法的结合,可以实现运算速度的大大提高。同时引进了更有效的Kim提出的GMM(Group Marching Method)方法,减少了运算量,并给出了改进方法。最后,把该方法用于仿真图与医学图像分割中,获得了较好的效果。