近似度

With the growing developments of the construction of SS/FH sequence in much wider fields, the well-known complexity measures—the linear complexity, the linear complexity profile and the k-error linear complexity—are widelyused but not sufficient to evaluate the complexities of the sequences available, for instance, the cryptographical sequence and the chaotic sequence families.

针对目前国内外普遍采用的LC、LCP和k-error LC(k-error Linear Complexity)序列复杂度检测理论存在的缺陷，将物理学和信息论中信息熵的概念引入到序列的复杂度检验中，提出了基于近似熵(ApEn：Approximate Entroy)的FH/SS(Frequnecy Hopping/Spread Spectrum)序列复杂度检验理论。

At first, preprocessing with the image pyramid and diffusion-filtering technology; then abstracting the boundary-outline information; carrying on the logarithmic coordinate transformation of the abstracted boundary-outline information to get bar chart of the logarithmic coordinate; calculating the value of Cs to get all the phase match points; calculating the value of the degree of approximation to judge the shape matching.

本发明涉及一种基于Shape Context的人脸形状匹配方法，首先采用图像金字塔及扩散滤波技术进行预处理；再利用Canny边缘检测算法和轮廓提取算法提取边界轮廓信息；对提取的边界信息进行对数极坐标变换，得到对数极坐标直方图；通过计算Cs值，获得所有相匹配点；计算相近似度值，进行形状匹配判断。

If when you try really hard, and your impersonation matches the original by 90%, then when you are relaxed you should still be able to reach 85%.

作为一个英语不是母语的人来说，85%的模仿近似度已经很棒了，这也意味着你将在众多的英语学习者中脱颖而出。

It is related with an artificial problem, called the maximum simple sharing problem.

证明了最大简单共享问题是NP-hard的，给出了一种简单的贪心算法，并证明该贪心算法的近似度为3。

Based on finite element method of flexibility and approximate expression of the structural flexibility matrix changes due to structural damages by first class Tayler approximate expansion of structural physical parameters of the initial flexibility matrix, the new damage identification method was put forward.

在采用柔度阵法进行结构损伤识别研究中，从柔度阵出发，进行结构有限元分析。通过对损伤引起的结构柔度阵的变化在初始柔度阵处关于结构物理参数的一阶泰勒近似，首次提出了一种基于有限元分析的结构损伤识别的柔度阵法。

A calculation method of reliability for slope stability,whose state function is implicit function,was researched.

利用其计算可靠度指标和验算点，然后将安全系数计算近似方程、隐函数计算方程和验算点结合起来，确定新的展开点和抽样点，并进行近似方程再拟合、可靠度指标的循环计算直到收敛。

In this way,after the viscosity or apparent viscosity of virgin crude,corresponding unsheared PPD-beneficiated crude and the sheared PPD-beneficiated crude at a certain temperature are determined,the parameters in the model can be calculated.

按照此方法，只须测定一定温度下空白原油的粘度或表观粘度、未剪切时加剂原油的粘度或表观粘度，及在某一个剪切温度下及某一个粘性流动熵产条件下原油的粘度或表观粘度，即可近似确定该数学模型中的参数，从而预测在不同温度时剪切后的原油在该温度下的粘度或表观粘度。

Comparison of theoretical predictions with corre-sponding computer simulation data uncloses the superiority of the Rogers-Young approxima-tion over Hypemetted chain approximation and rescaled mean spherical approximation forfreezing.

理论预言与相应的计算机模拟数据的比较揭示了Rogers-Young近似比超网链近似与重标度平均球形近似精度高。

Maximum likelihood detector is the optimal detector and has the best performance. The challenge of MLD is the high computational complexity. K-Best decoding algorithm has been proposed to reduce the computational complexity. K-Best decoder algorithm computes Partial Euclidean Distance and only keeps the best K nodes that have the smallest accumulated PEDs. After completing breadth-first tree search, we will have K leaves with the smallest PEDs.

最大相似度侦测法是公认最佳化的演算法，有著最好的侦测效能，但运算复杂度将会随著调变群集和传送天线数目大小而呈指数型增加。K-Best球型解码演算法因而被提出来，得到近似最大相似度侦测法的结果，解决最大相似度侦测法运算复杂度过高的问题。K-Best球型解码演算法在计算完部份欧几里德距离后，需要取最小K个值做为候选点，再往下层去找候选点。

More importantly, we propose a data-dependent parameterization method in which optimal parameterization in the lighting and viewing space that minimizes the modeling error is obtained.

我们使用了多变量的球面迳向基底函数核心当作我们双向贴图函数模型的核心并且使用了资料相关的重新参数化方法得到在光源及视点空间的最佳参数以增进我们双向贴图函数模型的近似度。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。