全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 hamming distance 的翻译结果: 查询用时：0.158秒
 历史查询

 hamming distance hamming距离(52)汉明距离(37)海明距离(27)
 hamming距离
 At the same time,when the numbers of code are 2k-1(kN),its average Hamming distance and variance can reach the lower bound. 同时当码字数为2k-1(kN)时,其平均Hamming距离和方差能达到下界。 短句来源 WEIGHT THEOREM AND HAMMING DISTANCE THEOREMS OF BINARY SEQUENCES 二进制序列的重量定理和Hamming距离定理 短句来源 By using the average Hamming distance and variance,we study q-ary code C with length n and number of codewords M ,by the definitiond(xi,yi) function, and give lower bound of the average Hamming distance and variance for q-ary code C with length n. 通过对q元n长码的平均Hamming距离和方差的研究,通过定义函数d(xi,yi),给出了q元n长码的平均Hamming距离和方差的下界。 短句来源 Hamming distance is used for the control of individual differences. 对基本遗传算法运用Hamming距离控制种群的个体差异; 短句来源 The concept of the degree of similarity between interval-valued intuitionistic fuzzy sets (IVIFSs) is introduced,and some distance measures between IVIFSs are defined based on the Hamming distance,the normalized Hamming distance,the weighted Hamming distance,the Euclidean distance,the normalized Euclidean distance,and the weighted Euclidean distance,etc. 定义了区间直觉模糊集相似度的概念,并且基于Hamming距离、标准化的Hamming距离、加权的Hamming Euclidean距离、Euclidean距离、标准化的Euclidean距离、加权的Euclidean距离等,定义了一些区间直觉模糊集距离测度. 短句来源 更多
 汉明距离
 Hamming Distance and Lee Distance of Linear Negacyclic and Cyclic Codes over Z_(2α) 环Z_（2α）上线性（负）循环码的汉明距离和Lee距离 短句来源 The Minimum Hamming Distance of Negacyclic Codes of Length 2~s over Z_(2~a) Z_(2~a)上2~s长的负循环码的最小汉明距离 短句来源 In 2004,Taher Abualrub, Ali Ghrayeb and Robert H.Oehmke obtained the bound on the Hamming distance and Lee distance of cyclic codes of length 2~s over ring Z_4.In 2005,Hai Q. Taher Abualrub，Ali Ghrayeb和RobertH．Oehmke(2004)得到了环Z_4上2~S长循环码的汉明距离和Lee距离的界。 短句来源 A formula to compute the minimum Hamming distance of negacyclic codes of length 2~S over Z_ 2~a is obtained and so Hai Q. 给出了环Z2a上2S长的负循环码的最小汉明距离的计算公式,完善了HaiQ. 短句来源 Finally,the Hamming distance and Lee distance of cyclic codes of length 2~s over ring Z_4 are studied. 最后研究了环Z_4上2~S长的循环码的汉明距离和Lee距离。 短句来源 更多
 海明距离
 It is proved that shortened cyclic codes with code length n<128 generated by g(x) = 15B93 have Hamming Distance 6 and those codes with shorter code length have less residual probability. 说明了用g(x)=15B93生成的缩短循环码码长在128以内有海明距离6,短码时,不可检测错误概率比较小。 短句来源 Two fuzzy utility functions and a fuzzy preference relation are proposed on the basis of fuzzy maximum set, fuzzy minimum set and Hamming distance. 通过引入模糊极大集和模糊极小集为参照系统并以海明距离为计量工具 ,定义了两个模糊效用函数和一个模糊优先关系作为模糊集的排序指标。 短句来源 This algorithm utilizes the phase characters of Gabor function to encode iris texture. A pattern matching algorithm based on weight Hamming distance was discussed for this kind of iris codes. The result of experiment shows that this encoding method has a good recognition effect and very high speed of operation. 讨论了虹膜识别技术的虹膜特征提取及编码，提出了一种基于Gabor函数集的编码方法，利用Gabor滤波器的相位特征，对虹膜纹理进行编码．同时，针对此编码又提出了基于加权海明距离的识别方法，并阐述了其实际识别效果．实验结果证明，该方法具有良好的编码效果及很高的运算速度，是目前较好的一种虹膜纹理编码方法． 短句来源 Analyzing the approximate repetitions and similarity measurements and based on Hamming Distance,two definitions of pattern-similarity and segment-similarity are proposed as new measurements of similarity,then on the basis of the two definitions,a new concept of approximate repetition,i. e. , the segment-similarity based approximate tandem repeats(SATR) is given. 在对重复片段的相似性衡量进行分析之后,基于海明距离提出了新的相似度衡量标准模式相似度和片段相似度,并在此基础上提出了一个新的相似性重复片段的定义SATR(segment-similarity based approximate tandem repeats). 短句来源 One point of the initial multi-form is replaced with the local minimum gotten by the new ant colony algorithm using the substitution rule based on the minimum hamming distance and the complex method is apt to find the global minimum safety factor. 另外复合形法对于不同的初始复合形也会得到不同的最小安全系数 ,利用本文提出的基于最小海明距离的替换准则将蚁群算法得到的局部最优解替换掉初始复形中的一个顶点 ,则复合形法容易找到全局最优 ,成为一种全局搜索能力很强的优化算法。 短句来源 更多
 hamming距
 If the hamming distance is n,then there are n paths with length n,n(m-2) paths with length n+1 to connect nodes x and y which are also disconnected. 若点对之间的H amm ing距为n,则其中存在n条长度为n,n(m-2)条长度为n+1的内点不交的路. 短句来源 4. In an AM, there may be a number of stored patterns which all have the minimum Hamming distance with input pattern having not been stored, but it can only retrieve one of them. 4．网络中往往存储着不止一个模式与输入模式具有最小Hamming距，但只能回忆出其中一个模式； 短句来源 After processing image including preprocessing, edge detection, curving fitting and iris division, picking up characteristics of iris by Gabor filter, judging iris's outcome by Hamming distance. 图像的识别过程包括预处理，边缘提取、边缘拟合，虹膜分割，然后利用Gabor滤波器对虹膜进行特征提取，借助Hamming距判断虹膜的识别结果。 短句来源 In verification mode, the weighted Hamming distance classifier is finally adopted to perform multi-template matching to identify the unknown feature vector. 在验证模式下,采用加权Hamming距对未知虹膜进行多模板匹配得出识别结果. 短句来源 At last,by calculating the hamming distance between two compared irises we give a judgment. 最后通过计算虹膜间的Hamming距进行匹配,最终实现虹膜识别。 短句来源 更多

我想查看译文中含有：的双语例句

 hamming distance
 We derive asymptotically sharp cardinality bounds in the case of the Hamming distance and show that for small subsets a suitably defined "randomized" Hamming distance allows one to get tighter estimates of the cardinality. If also the first and last words are Hamming distance one apart, the sequence is called a cube dominating cycle. A sequence of binary words of length n is called a cube dominating path, if the Ham-ming distance between two consecutive words is always one, and every binary word of length n is within Hamming distance one from at least one of these words. Recently, the Systematic Distance-4 (SD-4) codes are proposed that allows generating all the optimal Hamming distance-4 binary linear block codes. Since computing the Hamming distance of the inputs in hardware is expensive, only a portion of the inputs are examined. 更多
 点击这里查询相关文摘
 相关查询

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

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社