1) out-stack sequence
出栈序列
1.
Expresses the in-stack and the out-stack sequence with binary tree,gives an algorithm to create a binary tree by pre-O stack sequence,proves that the number of out-stack sequence is C(2n,n)/(n+1)when n elements put in the stack in order,analyzes and studies the three algorithms about solutions of out-stack sequence,and presents an .
利用二叉树给出了入栈和出栈序列的表示;给出了由前置O栈序列构造出二叉树的算法;证明了对于按次序入栈的n个元素,其出栈序列总数为C(2n,n)/(n+1);对三种求解出栈序列算法进行了分析和研究,并提出一种时间复杂度为O(n)判断某一序列是否为出栈序列的算法,它提高了程序的执行效率。
2.
In this article,the method of how to obtain the out-stack sequence of in-stack sequence ｛1,2,3.
利用二叉树与栈序列的关系,给出了当入栈序列为{1,2,3,……n}时如何得到所有可能的出栈序列的方法,并用C++编程实现了这一算法。
3.
By using induction approach,a united formula based on the analysis of three count problems with respect to out-stack sequence、binary tree、binary-find tree is presented in the article.
本文用递归的方法对出栈序列、二叉树、二叉搜索树三种计数问题进行了分析,得到了一个统一的递推关系式,作者分析了这三个问题同解的原因,指出了这三个问题是同构的,对于这三个问题的解,用C++语言编程实现了算法。
2) stack sequence
栈序列
1.
Algorithms of stack sequence based on operator and its implementation;
基于算子的栈序列生成算法与实现
3) sequential search algorithm using stack
堆栈序列译码
1.
In this paper, six restrictions are added to the existing sequential search algorithm using stack of error resilient arithmetic coding, which signi
本文对现有的纠错算术编码的堆栈序列译码算法增加了6个限制条件,从而显著删除了无效译码路径,减少了译码时间和堆栈容量。
4) Bid sequence
出价序列
5) output series
产出序列
1.
First the paper analyzes the growth process of an industry based on logistic function, puts the statement that output series of an industry may or may not belong to logistic function,and it may composed of several sub- logistic- periods even it belongs to a logistic function.
本文首先对产业成长过程作了一些基本描述 ,指出一个产业的产出序列不一定服从逻辑函数 ,如果产出序列服从逻辑函数 ,其也有可能包含有若干个子逻辑序列。
6) out-degree sequence
出度序列
1.
Using matrix theory, we present a sharp upper bound on the spectral radius of digraphs in terms of the out-degree sequence.
利用矩阵理论,给出了用图的出度序列表示的简单有向图的谱半径的可达上界,同时还 刻画了达到上界的极图。
补充资料：栈栈
1.众盛貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条