每个问题的解都能用递归关系表示。
The solution to each of them could be expressed as a recurrence relation.
几何凸集中递归关系的建立是求解问题的关键。
The establishment of a recurrence relation in geometric convex set is the key to solve a problem.
例如，概念模型可能显示从Person到它本身的一个简单的递归关系。
For example, the conceptual model may show a simple recursive relationship from Person to itself.
好，这就是所谓的递归关系，也就是解决问题的相当好的办法，我们可以来看看。
All right, this is what's called a recurrence relation, there are actually cool ways to solve them. We can kind of eyeball it.
利用这些特性，对于求解较为复杂的线性递归关系提供了一种简单的方法。
Making use of these properties provides a simple and convenient solution for some more complex relationship of linear recursion.
给出其支撑树数的一个公式，并得到其渐近性态和常数系数的线性递归关系。
A formula for the number of their spanning trees was given, Furthermore its asymptotic behaviors were considered and the linear recurrence relations with constant coefficients were also obtained.
递归关系不仅在数学中有广泛应用，而且在计算机算法设计与分析中也有广泛应用。
Recursive relations have the extensive applications in mathematics and in designing and analyzing computer algorithms.
本文讨论了滑动DFT的递归关系，提出了新的递归式算法，有效地改善了处理效率。
This paper first discusses the recursion relations of sliding DFT and then gives new recursion algorithm which can improve the Performance effectively.
第二章刻画了一类满足三项递归关系的实零点多项式序列的零点位置和零点重数的关系。
In the second chapter, we characterize the relations between locations and multiplicities of zeros of a sequence of real-rooted polynomials defined by a three-term recurrence relation.
本文对一个定理中递归关系的建立给出了容易理解的详细表述，然后利用生成函数法求其解。
In this paper, the authors describe the establishment of a recurrence relation of a theory in detail and provides the method to solve problems by means of generating functions.
用递归方法对这些递归关系的直接实现会造成解决方案效率低下，因为其中包含了对子问题的多次计算。
The naive implementation of this recurrence relation as a recursive method would have led to an inefficient solution involving multiple computations of subproblems.
将关联与其他对象分开使得对象的描绘更为清晰，减少了递归式问题，而且更加适合于多到多关系。
Separating associations makes the delineation of objects clearer, reduces problems with recursion, and is more adapted to many-to-many relationships.
递归的关系在单个Employee(团队领导)和许多Employee(团队成员)之间进一步建立起一对多的聚合。
A recursive relation establishes a further one-to-many aggregation between a single Employee (the team leader) and many Employees (the team members).
现在您应该能够使用下列语句创建具有分层或双向关系的所有类型的递归查询
You should now be able to create all kinds of recursive queries with either hierarchical or bi-directional relationships using
DB 29支持XML模式的注释，因此除递归模式外，可以将数据分解为关系表。
DB2 9 supports annotation of XML schemas so that the data can be decomposed into relational tables with the restriction on recursive schemas.
这个新的功能提供了以递归方式读取数据关系的另一种方法。
This new support provides a different way to recursively navigate data relationships.
本文论述了母函数与递归数列的关系，并探讨了用母函数求解递归数列的方法。
In this paper, we discuss the relation between master function and recursion, and the approach in solving recursive relation by master function.
借助一阶逻辑演算有条件地把超限递归原理从序数类推广到具有良基关系的类上。
Let's conditionally generalize principle of transfinite recursion from ordinal number class to class with well-founded relation.
本文运用VAR模型协整关系的递归估计方法，对我国房地产金融结构和房地产经济增长的关联性进行了分析。
By using recursive estimation in cointegrated VAR model, we analyze the relationship between real estate financial structure and growth of real estate economy in China.
在此基础上，采用深度优先遍历的递归理论和数据库技术，实现了流域节点间关系的计算机存储。
In these foundations, the recursion theory of depth first traversal, database technology and visual programming technology are employed to computer memory, which is expressed to node relations.
圆满地解决了关系模式全部候选关键字的求解问题，具体地给出了以递归形式的求全部候选关键字的新算法。
The problem to find out all candidate keys of relation schema is solved satisfactorily. And a new recursive algorithm of finding out all candidate keys is given.
该方法是基于最小相位滤波器的复倒谱系数和其群迟延函数以及其系统函数之间的关系，通过一个非线性的递归方程求解分母多项式的系数。
Based on the relationship between the group delay function and the cepstral coefficients, the denominator polynomial coefficients can be determined through a nonlinear recursive difference equation.
该方法是基于最小相位滤波器的复倒谱系数和其群迟延函数以及其系统函数之间的关系，通过一个非线性的递归方程求解分母多项式的系数。
Based on the relationship between the group delay function and the cepstral coefficients, the denominator polynomial coefficients can be determined through a nonlinear recursive difference equation.
应用推荐