1.Since the stack-tree based join algorithm is a widely used technique due to its excellent join efficiency, the performance of CATI is compared with stack-tree for A-D query and twig query via extensive experiments on a real XML test database.
因为经典的结构连接算法Stack-Tree算法效率较高且使用较广,因此应用基于CATI的结构连接算法和基于Stack-Tree的结构连接算法就A-D查询和Twig查询做了大量实验.
2.With EOT of 2.1nm Si 3N 4/SiO 2(N/O) stack gate dielectrics,0.12μm gate length CMOS devices are fabricated. Good short-channel behavior is observed.
在此基础上 ,采用Si3 N4/SiO2 stack栅介质制备出性能优良的栅长为 0 12 μm的CMOS器件 ,器件很好地抑制了短沟道效应 .
3.The upper bound of a stack; the highest numbered location.
堆栈的上界，即编号最大的存储单元。参阅stack。
4.Compared with Stack Guard and RAD , FPW has more efficent performance, same safety and less memory cost.
与Stack Guard和RAD相比，FPW具有同样程度的安全性、占用更少的内存空间、减少进程意外终止的可能性和更好的运行效果等优点。
5.This paper introduces the research situations on XML querying techniques and discusses deeply the main techniques of XML indexing query, which includes the querying techniques based on path index, such as DataGuide,1-index,A(k)and indexing query based on coding, such as Anc—Desc—B+、XR +XR-Stack arithmetic.
介绍了目前XML数据查询技术的研究现状,对主要的XML索引查询技术作了较深入的探讨,其中包括:基于路径索引的XML查询方法,如DataGuide、1-index、A(k)索引等; 基于编码的XML索引查询方法,如Anc—Desc—B+、XR树+XR-Stack算法等。
6.These could be interpreted as the IO_STACK_LOCATION as his specific job is to do the piping.
因为他的目标被明确的定位管道相关的事情，所以也就可以理解为IO_STACK_LOCATION。
7.Put the STACK segment in the main module.
把堆栈(STACK)段置于主模块中。
8.To create an analogy of the IRP and IO_STACK_LOCATION, perhaps you have three people who do different jobs such as carpentry, plumbing and welding.
如果你想要创建一个类似的IRP和IO_STACK_LOCATION，那么你需要做不同工作的三个人，比如，做木工的，铅工业的以及焊接的（………………这算什么00!）
9.A command which removes a word from the top of the stack.
一种从栈顶移走一个字［项］的命令。参阅pull，push，stack。
10.Ultra-thin Si 3N 4/SiO 2(N/O) stack gate dielectric with EOT of 2.1nm is fabricated successfully,and its characteristics are investigated.
成功制备了EOT(equivalentoxidethickness)为 2 1nm的Si3 N4/SiO2 (N/O)stack栅介质 ,并对其性质进行了研究 .
