一种基于关系模型的模糊数据库系统模型

数据库管理系统的广泛应用，使得数据库的研究也随之快速发展，如何表达模糊数据，如何执行模糊查询越来越成为数据库研究的重要课题之一，提出一个基于关系模型的模糊数据库系统的理论模型，利用模糊集的方法表达模糊数据，模糊查询和模糊关系，最后给出了一个模糊数据库系统实现的例子。     

一个新型的模糊控制器

本文提出一种新型的模糊控制器，它以串级的三维模糊调节器为基础，同时引入了反馈模糊调节器作为并联校正。我们用这种算法，针对几个典型的工业用金属热处理炉的温度控制模型做了仿真实验，得到了很好的控制效果，在阶跃响应中，上升时间短，无超调，稳态精度优于普通二维模糊控制系统。文中给出了这种控制方法的结构和有关的算法。     

模糊关系数据库查询语言FSQL

模糊数据库是模糊信息处理系统的重要组成部分。本文以ＳＱＬ语言为基础，设计了模糊关系数据库查询语言ＦＳＱＬ。ＦＳＱＬ语言采用了模糊值模糊关系数据模型，提供了相应的模糊数据定义与模糊数据操纵功能。为了便于模糊信息的表示和管理，ＦＳＱＬ语言增加了模糊数据类型，如简单标量型、模糊标量型、简单数集、模糊数集等。另外，为了便于模糊查询，扩充了模糊比较库函数及自定义隶属函数。     

处理复杂模糊系统的模糊穴映射方法

在对模糊穴和模糊穴空间等基本概念作一简单介绍之后，本文着重从模糊多变量系统的建模，辨识和控制等方面出发概述了基于模糊穴射的理论和方法，本文的方法有效地处理多变量模糊系统和利用已有的传统方法来解模糊系统问题开辟了一条新的途径，本文建立的方法的有效性已补实际的应用所证明。     

模糊逻辑系统设计分析

模糊逻辑是以模糊理论为基础，允许用语言和了表示操作和控制规律。实际它比数学方法更好，用直观方法代替复杂数学模型。我们提出一简单模糊系统，说明如何将模糊逻辑引入到该系统中。范例概念直接了当，论文目的不在于设计一个交通灯，而在于说明如何设计一个模糊系统。     

模糊线性中回归系数的研究

通过模糊数据分析，发现此数据和概率统计中数据有某些联系，得到模糊数据的线性估计结果，对模糊概率及模糊概率回归系数的研究有一定的帮助和借鉴。     

一种线性化模糊内模自适应控制算法

针对非线性对象，提出一种线性化模糊内模自适应控制算法。该算法以一组模糊规则作为非线性对象内部模型，一条模糊规则表示一个局部线性系统；根据对象输入与输出测量值，利用TSK建模方法在线辨识局部模糊内部模型；同时依据辨识模型设计局部H2最优模糊控制规则，所有规则构成H2最优模糊控制器。仿真实验显示：该算法适用于非线性对象的控制，具有较好的鲁棒性和抗干扰能力。     

基于模糊似然函数的模糊辨识方法

提出一种基于模糊似然函数的模糊辨识方法。该方法利用模糊似然函数对样本数据进行聚类，并使模糊模型的结构辨识和参数辨识能同时完成，从而实现模糊模型的在线辨识。仿真结果证明了该方法的有效性。     

一种新型模糊-粗神经网络及其在元音识别中的应用

为度量模糊粗不确定性信息，引入了模糊粗隶属函数．基于模糊粗糙集理论构建了一种新型的模糊，粗神经网络（FRNN）,该网络融合了模糊信息和粗糙信息的处理能力．对5个元音字母的语音识别进行测试，结果显示FRNN网络不仅训练速度快，而且分类性能优于BP网络、RBF网络和贝叶斯分类器．     

一种基于模式匹配的模糊模型及其神经网络实现(英)

通过模糊模式匹配概念，引入了一种新的模糊模型，并用神经网络方法对该模型进行辨识，以获得更高的精度．仿真实验表明，该模糊模型不仅简单易行，而且比通常的模糊模型有更强的辨识能力，另外，本文还讨论了模型的进一步求精，以及模糊神经网络的一般性问题．     

Coordinating Multiple Agents via Reinforcement Learning

In this paper, we attempt to use reinforcement learning techniques to solve agent coordination problems in task-oriented environments. The Fuzzy Subjective Task Structure model (FSTS) is presented to model the general agent coordination. We show that an agent coordination problem modeled in FSTS is a Decision-Theoretic Planning (DTP) problem, to which reinforcement learning can be applied. Two learning algorithms, coarse-grained and fine-grained, are proposed to address agents coordination behavior at two different levels. The coarse-grained algorithm operates at one level and tackle hard system constraints, and the fine-grained at another level and for soft constraints. We argue that it is important to explicitly model and explore coordination-specific (particularly system constraints) information, which underpins the two algorithms and attributes to the effectiveness of the algorithms. The algorithms are formally proved to converge and experimentally shown to be effective.     

Implementing the ‘Fool's model’ of combinatory logic

This paper studies Fool's models of combinatory logic, and relates them to Hindley's D-completeness problem. A fool's model is a family of sets of formulas, closed under condensed detachment. Alternatively, it is a model ofCL in naive set theory. We examine Resolution; and the P-W problem. A sequel shows T is D-complete; also, its extensions. We close with an implementation FMO of these ideas.     

A Stylometric Analysis of Ya?ar Kemal’s ? nce Memed Tetralogy

We analyze four nce Memed novels of Yaar Kemal using six style markers: most frequent words, syllable counts, word type – or part of speech – information, sentence length in terms of words, word length in text, and word length in vocabulary. For analysis we divide each novel into five thousand word text blocks and count the frequencies of each style marker in these blocks. The style markers showing the best separation are most frequent words and sentence lengths. We use stepwise discriminant analysis to determine the best discriminators of each style marker. We then use these markers in cross validation based discriminant analysis. Further investigation based on multiple analysis of variance (MANOVA) reveals how the attributes of each style marker group distinguish among the volumes.     

When Physical Systems Realize Functions...

After briefly discussing the relevance of the notions computation and implementation for cognitive science, I summarize some of the problems that have been found in their most common interpretations. In particular, I argue that standard notions of computation together with a state-to-state correspondence view of implementation cannot overcome difficulties posed by Putnam's Realization Theorem and that, therefore, a different approach to implementation is required. The notion realization of a function, developed out of physical theories, is then introduced as a replacement for the notional pair computation-implementation. After gradual refinement, taking practical constraints into account, this notion gives rise to the notion digital system which singles out physical systems that could be actually used, and possibly even built.     

Theory and benefits of recursive certificate structures

Processing of a set of multi-level digital certificates, particularly path construction and validation, can be excessively resource consuming, and even impractical in some cases. This article introduces classifications of certificate sets as minimal, surplus, and deficient and explains the new paradigm of a recursive certificate structure designed to provide the equivalent of a minimal set of conventional certificates containing only the necessary and sufficient information to minimize the effort to validate a certificate sequence, with a potential avoidance of duplication of validation previously handled by related Certification Authorities.