助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   前缀 的翻译结果: 查询用时:0.043秒
图标索引 在分类学科中查询
所有学科
电信技术
外国语言文字
互联网技术
中国语言文字
计算机软件及计算机应用
教育理论与教育管理
更多类别查询

图标索引 历史查询
 

前缀     
相关语句
  prefix
     Theoretical analysis shows that PP can improve channel estimation performance compared with cyclic prefix/zeros postfix(CP/ZP).
     理论分析表明,相对于另外两种OFDM系统中常用的前/后缀信号-循环前缀/补零后缀(CP/ZP),PP信号可以提高信道估计性能.
短句来源
     A TCAM-Based Two-Dimensional Prefix Packet Classification Algorithm
     基于TCAM的二维前缀报文分类算法
短句来源
     For simple binary search algorithm,our system can reach log_2(2N/B) lookup complexity (where N is prefix number in a routing table and B is an integer bigger than 4).
     使用二分查找算法 ,并行查找系统可以达到log2 (2N/B)的查找复杂度 (N为路由表前缀数目 ,B为大于 4的整数 ) .
短句来源
     The English verbal affixes corresponding to the Chinese ending Hua are the verbal prefix en, and the verbal suffixes -ate, -en, -ify and -ize.
     b 与汉语动词词缀“化”相对应的英语动词词缀有动词前缀en-和动词后缀-ate,-en,-ify和-ize。
短句来源
     Analysis of Short Length Cyclic Prefix Based on OFMD/DMT
     基于OFDM/DMT的短长度循环前缀分析
短句来源
更多       
  prefixes
     Prefixes as pan-, un-, non-, anti-, pro-, counter-, co- and suffixes like -ite, -ian, -ese, -ism, -ist, -esque are usually added to eponyms;
     常用前缀有pan-、un-、non-、anti-、pro-、counter-、co-等; 常用的后缀有-ite、-ian、-ese、-ism、-ist、-esque等。
短句来源
     4. Classification of quantifier prefixes over Diophantine equations;
     4.不定方程前缀量词分类;
短句来源
     A coding is provided, whose source language is synchronous pi-calculus including match operator, fully replicated operator, input and output prefixes while the asynchronous pi-calculus as the target language contains lazy replicated operator, input prefix and output message.
     给出了一个编码,它以同步π演算作为编码的源语言,异步π演算作为对应的目标语言,在同步π演算中保留match算子、全复制算子、并行算子和受限算子以及输入输出前缀,而异步π演算保留lazy复制算子、并行算子、受限算子、输入前缀以及没有后继的输出消息。
短句来源
     The prefixes likeвоз-,пре-,пред-,низ- are rhetorical. The partial meanings of some prefixes endow derivative words with a sense of style.
     前缀воз-,пре-,пред-,низ-具有书面语色彩,其余一些前缀的部分语义赋予派生词新的语体含义。
短句来源
     After consulting many references, especially "Webster's Third New International Dictionary", the author finds more conversion prefixes to change nouns or adjectives into verbs.
     作者查阅了大量文献,特别是“Webster' s Third New International Dictionary”,结果表明有一些前缀加在名词或形容词前,构成动词,从而改变了词根的词性。
短句来源
更多       
  “前缀”译为未确定词的双语例句
     Algorithm based on prefix-range binary-search (BSPR) and its two groups of implementation schemes are given.
     提出了“基于前缀范围二分搜索的路由查找算法(BSPR,Binary-search on Prefix Range)”并给出了两组实现方案。
短句来源
     Algorithm based on binary-search on Trie (BSTrie) integrating the advantages of the algorithms based on prefix-length binary-search and that based on Trie is researched.
     综合基于前缀长度二分搜索的路由查找算法和基于Trie的路由查找算法的优点,提出了“基于Trie二分搜索的路由查找算法(BSTrie,Binary-search on Trie)”。
短句来源
     Via prefix-expansion, QSPE-based TCAM IPv4 routing lookup pipeline, QSPE-based TCAM IPv6 routing lookup pipeline, and QSPE-based TCAM IPv4/IPv6 dual-stack routing lookup pipeline are created.
     将QSPR与前缀扩展技术相结合,实现了QSPE(Quaternary-search on Prefix-expansion)IPv4路由查找流水线,QSPE IPv6路由查找流水线,和BSPE IPv4/IPv6双协议栈路由查找流水线。
短句来源
     Algorithm based on prefix-range quaternary-search is provided.
     提出了“基于前缀范围四分搜索的路由查找算法(QSPR,Quaternary-search on Prefix Range)”,实现了两组硬件路由查找流水线。
短句来源
     Different from those algorithms based on prefix-length or single stage TCAM, the two routing lookup algorithms, BSPR and QSPR are based on prefix-range and implemented by multi-step TCAM pipelining.
     与已有的对前缀长度进行二分搜索和采用单步TCAM的路由查找算法不同,本文提出的BSPR路由查找算法和QSPR路由查找算法对前缀范围分别进行二分搜索和四分搜索,并采用多步TCAM组建路由查找流水线。
短句来源
更多       
查询“前缀”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  prefix
A class of complete binary code systems is presented in which one of the symbols of the alphabet is used in any code combination not more than once, in terms of prefix codes of this class and of the operations of inversion and substitution of codes.
      
The first of them consists of the predicates whose prenex normal form of a special type has the quantifier prefix of the form .
      
Predicates of the second class can have an arbitrary quantifier prefix, but restrictions are imposed on the Skolem deciding functions.
      
In the paper, a class of essentially almost-periodic sequences (i.e., strictly almost-periodic sequences with an arbitrary prefix added at the beginning) is considered.
      
The system can avoid the decrease of spectrum efficiency of conventional MC-CDMA due to inserting cyclic prefix.
      
更多          
  prefixes
Clitic Reduction in the Formation of Modal Prefixes in the Post-Classical Arabic Dialects and Classical Arabic SA-/ SAWFA
      
Examples are discrimination trees, which are like tries where terms are seen as strings and common prefixes are shared, and substitution trees, where terms keep their tree structure and all common contexts can be shared.
      
Is text compression by prefixes and suffixes practical
      
It is shown that the problem of optimal fragment compression is NP-hard even if the fragments are restricted to prefixes and suffixes.
      
This seems to be a simplest fragment compression problem which is NP-hard, since a polynomial algorithm for compressing by prefixes only (or suffixes only) has been found recently.
      
更多          
  aeth
über den Einflu? von Monoaminooxydase-Hemmern (MAOH) auf die Kreislaufwirksamkeit von oral eingenommenem m-Hydroxyphenyl(1)-aeth
      
aeth.) zeigen 72 bis 120 Stunden nach Infektion mit SV 40 einen gesteigerten Einbau von14C-Thymidin im Vergleich zu nicht infizierten Kontrollkulturen.
      
Merengewebekulturen (Cerc, aeth.) wurden nach Infektion mit SV-40 von der 72.
      
aeth.) wurden 24 Stunden lang vor ihrer Infektion mit SV 40 mit14C-Thymidin markiert.
      


For the study of the algebraic structures of the formal languages, in this paper, we have discussed a finite decomposition of the regular languages with respect to regular P(prefix)-languages, involving operations "U", "·","*".We have proved the existence and the uniqueness of this decomposition. With regard to regular S (suffix)-languages, we have obtained a parallel result as well.

为着形式语言代数结构的研究,本文讨论了正则语言关于正则P-(前缀)语言而涉及运算“U”,“·”,“*”的一种有限分解,证明了这一分解的存在性和唯一性。关于正则S-(后缀)语言,我们也有平行的结果。

In this paper the authors give the definition of code sequence cvera alphabet X and the characterization of code sequences:It says,a non-negative sequence{k_i}is a code sequence over X if and only if{k_i} sa-tisfies the following inequality:(?)n=1,2,…,where N=|X|.Using this inequality we obtain the following results:(1)Every code is length-preserving equivalent to to a prefix oode.(2)A code C is a maximal code if the code sequence {ki} of Csatisfies(?)(3)A finite prefix code is a maximal prefix code if and only...

In this paper the authors give the definition of code sequence cvera alphabet X and the characterization of code sequences:It says,a non-negative sequence{k_i}is a code sequence over X if and only if{k_i} sa-tisfies the following inequality:(?)n=1,2,…,where N=|X|.Using this inequality we obtain the following results:(1)Every code is length-preserving equivalent to to a prefix oode.(2)A code C is a maximal code if the code sequence {ki} of Csatisfies(?)(3)A finite prefix code is a maximal prefix code if and only ifthe condition(2)holds.

本文引入了码序列的概念,证明了非负整数序列{k_i}是某字母表 X 上的码序列的充要条件为{k_i}满足(?)其中 N=|x|.由码序列的这个特性,我们得到:(i)任一码都与一前缀码保长等价;(ii)码是极大码的一个充分条件是(?)(iii)上述条件对于有限前缀码为极大前缀码是充分必要的.

This paper is a note on f-disjunctive languages discussed in[1].A non-disjunctive f-disjunctive context-free prefix code is constructed.

本文作为文献[1]中讨论的 f—析取语言的一个注记,构造出—非析取的 f—析取的上下文无关前缀码。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关前缀的内容
在知识搜索中查有关前缀的内容
在数字搜索中查有关前缀的内容
在概念知识元中查有关前缀的内容
在学术趋势中查有关前缀的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社