1) ordered lexicographical tree
有序字典序树
1.
According to the two problems above, this thesis presents a new algorithm using an ordered lexicographical tree with difference set nodes.
针对上述两个方面的问题,本论文提出一种新的频繁闭合项集挖掘算法,采用有序字典序树的数据结构和差集结点的形式作为算法的数据结构。
2) the kth minimum spanning tree
字典序最小树
3) lexicographic order
字典序
1.
An algorithm of generating Huffman sequences in lexicographic order;
Huffman序列的一种字典序生成算法
2.
The criteria for using the basicbehavior assumptions to the construction of lexicographic order are investigated.
分析构造合理字典序的基本行为假设条件并讨论其相互关系；研究合理字典序构造中引入基本行为假设的准则；探讨构造合理字典序的基本行为假设的相容性并给出几组相容的基本行为假设。
3.
The uniqueness condition for the construction of a rational lexicographic order is studied.
研究了构造合理字典序的唯一性条件，着重分析了以自反演序为基础的字典序构造中确定合理字典序的理性条件，提出了一组新的构造合理字典序的理性条件——广义单调性条件Ｍ＋＋和Ｈｅｉｎｅｒ－Ｐａｃｋａｒｄ理性条件Ｋ＋，构造了唯一满足这组理性条件的弱序Ｌ，推广了Ｈｅｉｎｅｒ－Ｐａｃｋａｒｄ唯一性定理。
4) lexicographic ordering
字典序
1.
On the basis of analyzing conditions for constructing rational lexicographic ordering, lexicographic ordering ≥ l , satisfying monotonically conditions is defined.
提出了一种有资源约束的R&D项目选择模型的决策方法———字典序法 。
2.
An axiomatic treatment of this topic is carried out by the authors and a lexicographic ordering satisfying Fishburn Monotone Extension based on his self reflexive signed order ( X∪X * , 1) is constructed.
研究了合理字典序的构造问题。
5) lexicographical order
字典序
1.
It is effective for grbner base arranged in the way of lexicographical order to be used in solving problems of polynomia equations, but it takes much time to calculate according to the order.
字典序Ｇｒｂｎｅｒ 基在解多元多项式方程组上应用较有效，但按字典序计算相当费时，而且机器的容量也是关键，介绍的转换方法克服了这些实现时的困难。
6) dictionary order
字典序
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条