递归的

Wang-type fuzzy logic system and its functional approximation ability are researched deeply, A class of Gauss-type fuzzy logic system is presented and studied What it defers from Wang-type fuzzy logic system is its using Gauss fuzzifier The analytical expression of this fuzzy logic system is derived detailed Its universal approximation theorem for nonlinear functions is proved by StoneWeiestrass theorem.

通过对两类模糊系统作为非线性辨识器的仿真研究显示出高斯型模糊逻辑系统在抗数据干扰方面比Wang型模糊系统有优势。对非线性动态系统的辨识问题，借助递归神经网络的研究成果，提出一种基于递归网络结构的自适应模糊逻辑系统和参数学习算法。

This is a square spiral design, its features are: recursive method used to run, using arithmetic progression method to run, using the recursive method and comparison method such as arithmetic functions.

详细说明：这是一个螺旋方阵的设计，它的功能有：用递归法来运行，用等差数列法来运行，用递归法和等差法进行比较等功能。

Any partial results returned may not include all rows on recursion levels beyond the specified maximum recursion level.

所返回的任何部分结果都可能无法包括超过指定最大递归级别的递归级别上的所有行。

Many traditional compiler optimizations fall into this category: copy and constant propagation, redundant expression elimination, dead code elimination, peephole optimizations, function inlining, tail recursion elimination and so forth.

许多种传统的编译器优化方式都可以归结于这两种方法，比如说：copy and constant propagation（用常数取代程序中不变化的变量），冗余表达式消去，死代码消去，Peephole优化，Inline函数，尾部递归消去（展开在程序尾部的递归，减少堆栈消耗

First, the recursive predictive errorlearning algorithm for recurrent neural networks is introduced, and its stability is demonstrated.

摘要针对递归神经网络BP学习算法收敛慢的缺陷，提出一种新的递归神经网络快速并行学习算法。

The non-recursive scan line method is a type of 4 way method, but is more efficient than the recursive method.

非递归扫描线法是4路的方法，但比递归方法效率的类型。"/页"

By extending the incremental singular value decompositionto the kernel space,the kernel formulation of incremental kernel PCA,which possessed much lower computational complexity and was suitable for online model updating,was obtained.

RKPCA算法通过将递归奇异值分解推广到核空间，给出了核形式描述的递归KPCA算法，运算复杂度比KPCA明显降低，保证非线性监控模型能够在线更新。

It has four different versions .which have the properties of symmetry and antisymmetry, namely, DWT- j, j=Ⅰ,Ⅱ,Ⅲ.Ⅳ.

本文首先导出了DWT-Ⅱ的递归特性，由此提出了计算长度-2~m离散W变换-Ⅱ的一种新算法——快速递归算法。

It's important because it allows you to describe recursion in terms of rewrites, rather than computation steps.

它重要是因为它允许你在重写的节点描述递归，这将允许匿名递归函数。

The following script recodes the directory listing script with a manual recursive traversal function (a function that calls itself to repeat its actions).

以下脚本用一个手动递归遍历函数重写了目录列表脚本（递归函数就是它会调用自身做重复的动作）。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。