| 1. | Any continuous curve can be closely approximated by a series of small parabolic segments .
任一连续曲线可以借一系列很小的抛物线线段较精密地近似表示。 |
| 2. | Can be represented approximately this way
可以按以下方式近似表示： |
| 3. | Working space of parallel mechanisms and its approximate representation
并联机床的工作空间及其近似表示方法 |
| 4. | The model uses indistinct and overlapping " probability clouds " to approximate the position of an electron
该模型使用模糊和重叠的“概率云”近似表示一个电子的位置。 |
| 5. | Description methods that employ dominant colors use a small number of color ranges to construct an approximate representation of color distribution
使用支配色的描述法用少量的色彩范围构造色彩分布的近似表示。 |
| 6. | But in practical image , edge detection becomes a problem because of the using wavelet to transform the image into approximate express that undertake the filter of the high frequency part by original image
提出一种利用小波把图像分解成近似部分和细节部分，近似部分是原图像对高频部分进行滤波所得的近似表示。 |
| 7. | In this paper , the approximate polygon for irregular shapes , the protruding and concave point of polygon , the direction of polygon , the area of polygon , the single , face to face , frock , combinable packing are talked
对不规则件的多边形近似表示、多边形凸、凹点、多边形方向、多边形面积和多边形单排、对排、双排以及联排的预先处理进行了探讨。 |
| 8. | The results prove that df could simplify the solve process and its shortcoming of restriction in approximately denotation , frequency unitary 1 and inapplicability in more commonly quadratic system are also shown at the same time
结果证明：使用描述函数法能够简化该问题的求解，但也暴露出其存在着近似表示，频率归1以及更一般二阶系统不适用等方面的局限和不足。 |
| 9. | Unknown displacement jumps in the equations are approximated with the products of the fundamental density functions and polynomials , in which the fundamental density functions are expressed with exact solutions of the two - dimensional interface cracks due to axial - symmetries of the problems herein
方程中的未知位移间断近似表示为基本密度函数与多项式之积，其中基本密度函数考虑到问题的对称性用二维界面裂纹精确解表示。 |
| 10. | So , we put forward an optimized exponential algorithm in which the multiplication with itself was substituted mostly by square . through expanding of composition fields , the time consuming of optimal algorithm is , where n is the number of bits of exponential
通过对算法的分析我们可以得出结论，随着复合域的不断增大，域上指数运算所需的时间可近似表示为，式中n为指数以二进制表示时的比特串长度，为域元素进行多项式相乘所需的时间。 |
