关于Vague集的模糊熵及其构造

本文分析了Vague集的性质,给出了将Vague集变换为Fuzzy集的转换函数,并讨论了其性质。分析了关于Vague集的模糊熵的直观特性,在此基础上我们给出了Vague集的模糊熵的定义。最后给出了一个关于Vague集的模糊熵的构造方法。     

数字式液压逻辑流量阀的设计

数字工流量阀采用数字控制方式，调节系统流量以达到液压系统调整目的，它本身具有控制响应快、精度高、稳定性好、适应范围大等优点，在行走机械上将会得到广泛地应用。     

可编程控制器在捆扎机自动控制中的应用

介绍了一种用可编程控制器（PLC）实现捆扎机自动控制的设计方案，详细地介绍了设计过程，给出了完整的程序流程图和部分控制程序。     

模糊综合评价技术在住宅综合性能评估中的应用研究

依据《商品住宅性能评定方法和指标体系》正确地对商品住宅地性能进行评价 ,是评定商品住宅质量等级的重要依据。本文主要论述如何运用数学方法分析和处理住宅综合质量评定中大量存在的模糊问题以及如何建立相应的等级评价准则和进行等级评判     

Parallel branch-and-bound search in Parlog

The concurrent logic languages, of which Parlog is one, have been promoted as a new generation of software languages specifically designed for parallel programming. This paper investigates their application to a search problem commonly used as an illustration of artificial intelligence techniques, the 8-puzzle. It notes that programs written in the concurrent logic languages which do not pay attention to the parallelism can fall into two possible traps: either there is little real parallelism in them due to data dependencies, or there is too much parallelism and any practical architecture will be overwhelmed. A solution which controls the parallelism using user-defined priorities is proposed. This solution has the advantage of being architecture-independent.     

The hierarchies of knowledge and the mathematics of discovery

Rather than attempting to characterize a relation of confirmation between evidence and theory, epistemology might better consider which methods of forming conjectures from evidence, or of altering beliefs in the light of evidence, are most reliable for getting to the truth. A logical framework for such a study was constructed in the early 1960s by E. Mark Gold and Hilary Putnam. This essay describes some of the results that have been obtained in that framework and their significance for philosophy of science, artificial intelligence, and for normative epistemology when truth is relative.I am indebted to Kevin Kelly for several years of happy conversation from which the perspective and views of this paper grew, for comments on a draft of the paper, and for constructing some of the illustrations. A fellowship from the John Simon Guggenheim Memorial Foundation provided the liberty to write this paper. It was first presented in the Turing Colloquium, 1990.     

Integrating integer programming and probabilistic deduction graphs for probabilistic reasoning

Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning problem to fit integer programming takes a polynomial time. H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.     

模式识别催化剂生产调优

本文介绍如何将模式识别应用于生产调优,着重讨论了多指标(优化目标)因素的分级,提出了用模糊综合评价度量和依有序聚类最小损失函数准则划类,并相继进行变量与样本筛选、信息压缩、特征提取和模拟仿真获得优区操作条件,实施效果显著。     

XML schema, tree logic and sheaves automata

XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or validate them. This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining document validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS). Then, we define a new class of automata for unranked trees that provides decision procedures for the basic questions about SL: model-checking; satisfiability; entailment. The same class of automata is also used to answer basic questions about WXS, including recursive schemas: decidability of type-checking documents; testing the emptiness of schemas; testing that a schema subsumes another one.This work was partially supported by the French government research grant ACI TRALALA and by IST Global Computing Profundis.     

Fixed point theorems on fuzzy normed linear spaces

In this paper, definitions of strongly fuzzy convergent sequence, l-fuzzy weakly convergent sequence and l-fuzzy weakly compact set are given in a fuzzy normed linear space. The concepts of fuzzy normal structure, fuzzy non-expansive mapping, uniformly convex fuzzy normed linear space are introduced and fixed point theorems for fuzzy non-expansive mappings are proved.