组合计数
- 网络Combination Count;combinatorial enumeration;combinatorial counting
-
本文借助其中的一种基本且应用广泛的方法&发生函数方法,对在组合计数理论中具有举足轻重地位的两类组合数:Lucas数和Stirling数进行了进一步地学习和研究。
By use of the basic and widely applicable method of all the above methods-the method of generating function , the Lucas number and the Stirling numbers are studied in this paper , which play an important role in the combinatorial counting theory .
-
不定方程解的δ-组合计数方法及应用
δ - Combinatorial Counting Method Concerning Solutions of Diophantine Equations and Some Applications
-
通过对二面体群、正n面体群等指标计算给出一系列组合计数问题的解答。
This paper give the resolution of a combinatorial calculating problems by ways of calculating the indexes of dihedral group and regular polyhedron group .
-
本文以组合计数法推导滑窗检测器在相关杂波中的PF计算公式。
This paper deduces the formula for the false-alarm probability of the slide window detector in the back-ground of correlative clutter , by means of the method of arrangement and combination .
-
最后应用组合计数的技巧解决了一类RNA二级结构的计算问题。虚拟组合衍生程序系统的研制
In Chapter 4 , a enumeration problem of RNA secondary structure is studied with the method of combinatorial enumeration . Implementation of a virtual combinatorial enumeration system
-
组合计数与Huckel矩阵本征多项式
Combinatorial enumeration and characteristic polynomial for Huckel matrix
-
利用Jordan曲线定理和经典的组合计数方法,得到了轮图在环面上柔性的计算公式,结合轮图的结果以及环面的性质,得到了轮型图(Halin图)在环面上柔性的计算公式。
By using Jordan Curve Theorem and classical combination , we obtain the formulas for computing the flexibility of wheels and wheel-like graphs on the torus .
-
组合计数的群论与计算机方法
Group Theory and Computer Methods for Combinatorial Enumerations
-
在深入分析的基础上,设计了一种基于m序列的组合计数算法,利用该算法进行了仿真计算,并分析了所得结果;
Through further analysis , a m sequence based combinatorial countering algorithm is designed .
-
群指标在组合计数中的应用
The Application of Group Index in Combinatorial Calculating
-
一类组合计数问题
A Class of Combinatorial Counting Problems
-
相关的原理和方法对解决某些组合计数问题有所帮助。
The relevant principle and method are helpful to solve some counting problems in combination problems .
-
限距组合计数的一些结果
Some Results of Bound Combination Counting
-
一道组合计数问题的讨论
Discussion on a Combinatorial Enumeration Problem
-
组合计数中的映射原理及应用
Mapping Principle of Combinational Counting
-
复合型曲线横净距计算研讨环状限距组合计数的一些结果
A Study on the Calculating of Lateral Clear Distance of the Curves with Transitions Some results of circle bound combination
-
提出基于组合计数原理的递归算法,用于多模块变形机器人的非同构构形的计数,并根据构形矩阵的拓扑信息对构形进行评价。
According to combination principle , recursive algorithm is proposed to enumerate and evaluate the non-isomorphic configurations and non-isomorphic symmetry configurations .
-
本文利用组合计数理论、不定方程理论、数列和级数知识,采用构造证明的方法研究了量子计数问题,解决了量子通讯中的十个数学问题。
By the way of combinatorial computation and indefinite equation theory , sequence of number and series knowledge , and using the constructing proof methods , ten mathematics results in quantum communication are solved .
-
研究了有限集论中的一类组合计数问题,利用容斥原理得出了此类问题的计数公式,从而发展了文献[1]的计数理论。
In this paper , we give some counting formulas for a class of problems in combinatorial set theory , and develop the results of [ 1 ] by principle of inclusion and exclusion .
-
用差分法、组合计数法与母函数法给出了一元多项式的部分和分解形式,用一元多项式的部分和分解形式给出了求方幂和问题的三个基本计算公式。
Introducing the differential method , the combinatorics enumeration and generating function obtains the part decomposition form of polynomial of one indeterminate . Three basic formulas are found in power sum problem toward the part decomposition form of polynomial of one indeterminate .
-
对于多个文件,带-c选项的grep返回每个文件的单独计数,每行一个计数,而针对wc的管道则提供所有文件的组合总计数。
With multiple files , grep with the-c option returns a separate count for each file , one on each line , whereas a pipe to wc gives a total count for all files combined .
-
文章根据排列与组合可计数的特点,给出了利用位序法求标准拉丁方的算法。
Noticing that the Latin square has order like permutation and combination , this paper gives algorithm of searching standard Latin square fellowing this order .
-
比方说,在调试怀疑连接顺序不是最优的问题时,针对不同的连接组合收集计数可能会有帮助。
For example , in debugging problems where you suspect the join order is not optimal , it can be useful to gather counts for different join combinations .
-
组合结构的计数产生了许多重要的经典的计数序列,其中Stirling序列是基本的组合序列之一,也是组合数学中最为熟知的基本研究对象之一。
Enumerations of combinatorial structures produce many important classical counting sequences , such as Stirling sequence , a basic counting sequence and a most well-known mathematical object in Combinatorics .
-
关于置换群中某些组合问题的计数公式
On the counting formulae of some combinatorial problems of permutation group
-
文章利用常生成函数来解决不定方程解的计数问题,从而为一些组合问题的计数提供了方便。
In this paper , we solve the question of combination number by virture of generating function , so it offers convenience to some question of combinatorial number .
-
采用miniMACS系统阳性分离纯化脐血CD34+细胞,用BMSC结合不同的细胞因子组合培养14天后计数CFU-Mix集落数。
CD34 + cells were isolated from umbilical cord blood with Mini MACs system and cultivated with BMSC in combination with different cytokines , and on the 14th day , the number of CFU-Mix was counted .
-
文章研究了一些限距组合,利用集合元素的对称性,构造生成函数等计数技巧,提出了有限距组合,倍限距组合及环状限距组合的一系列计数公式。
Using the symmetry of set element and generating function , we obtain counting formulas for the finite bound combination , - multiple bound combination and circle bound combination .
-
文章通过对第二类Stirling数的学习,在对s2(n,k)的组合意义的理解上适当改变一些约束条件而得到了另外一些组合问题的计数公式。
This article is based on second kind of Stirling number study , into the combination significance understanding suitably changed some constraint conditions , but to obtain some other combination questions to count the formula .