1) transfinite exhaustion process
超限穷举法
2) exhaust algorithm
穷举法
1.
In this paper the 2K-H type straight tooth planetary gear retarder is taken as an example and a new exhaust algorithm is adopted in computer,and the layout method of the computer program is supplied.
以2K-H型直齿行星传动的设计为例,采用新的穷举法在计算机上进行设计计算,并给出了计算机程序的编制方法。
2.
Eighteen operation patterns of automatic bus transfer equipments with pentagonal wiring and dual sources are introduced,which is constructed by using decomposition-combina- tion method and proved same as those constructed by using exhaust algorithm.
介绍了五角形接线备用电源自动投入装置的18种运行方式,提出了用“分解组合法”构成五角形接线备用电源自动投入装置的控制策略,并证明了该方法与“穷举法”构成五角形接线备用电源自动投入装置的运行方式相同。
3) Method of Exhaustion
穷举法
1.
A new method of earthquake localization—Method of Exhaustion is introduced in this paper.
介绍了一种全新的地震参数确定方法———“穷举法”。
2.
Moreover,exact results are rapidly obtained through the genetic algorithms,which can be confirmed by the method of exhaustion.
实验结果用穷举法进行了验证和比较,表明该方法具有简单快速准确等特点。
4) exhaustive method
穷举法
1.
For the one-dimension chaotic encryption method,it is successfully deciphered by the phase-space reconstruction theory and exhaustive method with the encryption function,parameter and the original value completely unknown.
针对这种一维混沌加密算法,在加密方程、参数和初始值完全未知的前提下,运用相空间重构法和穷举法对其进行了破译研究并成功将其破译。
2.
Exhaustive method is an analysis method that looks for parameter property according to all obtainable corresponding function values (output values) for various independent variables.
穷举法是根据各个自变量所有可能取值相对应的函数值(输出值)寻找参数特征的一种分析方法。
3.
A new approach for object identification based on the exhaustive method is proposed.
介绍了一种基于穷举法的高光谱遥感图像地物识别方法。
5) Pseudo Exhaust Testing
伪穷举法
6) exhaustive algorithm
穷举算法
1.
This paper first introduces traditional question of remainder: "known remainder of a positive integer to be different positive integer divide, seeking this positive integer", then compares and analyzes exhaustive algorithm and the Chinese remainder theorem (Sunzi theorem) with mathematical analysis algorithm, and with computer programming.
分别采用穷举算法和中国剩余定理(孙子定理)的数学分析算法进行计算机编程求解,对传统余数问题,即对"已知一个正整数被不同的几个正整数除后的余数,求该数"的问题进行了分析,并比较了两种算法的特点。
2.
This paper introduces traditional question of remainder—“known remainder of a positive integer to be different positive integer divide,seeking this positive integer",compares and analyzes exhaustive algorithm and the Chinese remainder theorem(Sunzi theorem)with mathematical analysis algorithm,and computer programming.
本文对“已知一个正整数被不同的几个正整数除后的余数,求该数”的传统余数问题进行分析,分别采用穷举算法和中国剩余定理(孙子定理)的数学分析算法进行计算机编程求解,并分析、比较两种算法的特点。
3.
This paper analyzes the "nine different numerals constitute a equation of multiplication",designs a recursive backtrack algorithm and non-recursive backtrack algorithm,gives the general design for exhaustive algorithm of NP problem,and at the same time,compares the characteristics of two algorithms,and experimental testing.
对"九位不同数字构成乘法等式"的问题进行分析,设计了递归回溯算法和非递归回溯算法,给出NP问题穷举算法设计的一般思路,同时比较两种算法的特点,并进行实验测试。
补充资料：超限归纳法
又称超穷归纳法，数学中用来证明某种类型命题的重要方法，亦称超限归纳证法。设 (Χ，≤)是一个良序集，对任意α∈Χ,Χα={b∈Χ│b<α}称为在Χ中由α所确定的截段。E嶅Χ称为归纳子集,如果对于任何α∈Χ,只要截段Χα嶅E,就有α∈E。超限归纳定理断言：设E为良序集(Χ,≤)的归纳子集,则E＝Χ。因为若α为Χ的最小元素,则由,可得α∈E:如果α┡为Bα={b∈Χ│b>α}的最小元素,那么Χα'={x∈Χ│x<α┡}={α}嶅E,遂有α┡∈E。同理可得α″=(α┡)┡∈E等等。容易看出,Χ的良序性是定理成立的重要依据，倘若把它改为Χ是全序集，则Χ的非空子集可以没有最小元素,命题就不成立了。当Χ为自然数集N时，就得到上述定理的一个常用的特殊情况,称为数学归纳法，表述为：若E嶅N，满足①0∈E；②对于任何n∈N,如果由一切小于n的自然数k∈E,可以推出n∈E，则E=N。其中一切小于 n的自然数k∈E相当于Nn嶅E,而0∈E则是的结果。在引进"类"概念的前提下，超限归纳定理可以叙述为：设C是一个序数类,如果①0∈C；②若α∈C,可得α┡=α+1∈C；③若α为极限序数，并且对一切β<α，β∈C，就必然有α∈C,则C是所有序数的类。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条