convolutions

英 [ˌkɒnvəˈluːʃənz]

美 [ˈkɑnvəˌluʃənz]

n.  错综复杂; 晦涩费解; (尤指其中之一的)盘绕，弯曲
convolution的复数

柯林斯词典

• 盘旋结构;回旋;盘旋
  Convolutionsare curves on an object or design that has a lot of curves.
• N-VAR 错综复杂
  You can useconvolutionsto refer to a situation that is very complicated.
  1. ...the thorny convolutions of love.
     困难重重、百转千回的爱情

双语例句

• The sufficient condition and necessary condition of local closure and local asymptotic for the convolutions of non-identical distributions
  不同分布的卷积的局部封闭性及局部渐近性的充分条件和必要条件
• Compared with the sectioned and graphic convolutions, the method is able not only to express directly the integral functions but to simplify the calculation.
  该法与分段卷积法和图解卷积法相比，不仅可直接表达积分函数，而且又能简化卷积计算。
• The difference equations derived will now contain integrals with respect to time because of the convolutions involved.
  由于包含卷积，所推导的差分方程包括对时间的积分。
• As compared with the FPT algorithm for 2-D cyclic convolutions, the amount of multiplications of the algorithm introduced here decreases by one order of magnitude, and also it relieves the strict restriction of word length about cyclic convolution scale in FNT algorithm of 2-D cyclic convolutions.
  与二维循环卷积的FPT算法相比，乘法量减少了一个数量级，同时实际取消了FNT算法中卷积规模所受到的字长的限制。
• A Class of Summation Formulas Concerning Convolutions of Symmetric Functions
  一类关于对称函数的卷积型求和公式
• Convolutions frequently alternate in direction of rotation and vary in pitch.
  盘旋经常改变回转方向和节距。
• In this paper, we discussed a two-variable cyclic convolution algorithm based on two-variable polynomial multiplication, and compared it with the fast polynomial transform ( FPT) algorithm. As a result, this kind of algorithm is efficient in computation of two-variable cyclic convolutions.
  本文详细讨论一种基于多元多项式乘积的二维循环卷积算法，并与其快速多项式变换（FPT）算法进行了比较，比较结果显示该算法具有明显的优越性。
• Secondly was got it was to generalized the case of multi-variable polynomial, which provided a new method of computing M-D DFTs and M-D convolutions.
  首先给出了二元的情况，然后推广到了一般多元多项式乘积的情况，这为计算多维卷积和多维DFT提供了新的途径。
• On the basis of FPT, in this paper we introduce an iteration algorithm for computing hyper-large scale 2-D cyclic convolutions by combining FPT with FNT.
  本文将FPT和FNT相结合提出了一种计算超大型二维循环卷积的迭代算法，它的基础是应用了FPT。
• I feel the delightful, velvety texture of a flower, and discover its remarkable convolutions; and something of the miracle of Nature is revealed to me.
  我感到了花朵的可爱和茸茸的感觉，发现它层层叠叠地绽开着，大自然的神奇展现在我的面前。