2) Active and passive towed line array
主、被动拖曳线列阵
3) systolic array
脉动阵列
1.
A square-root ellipsoidal state bounding algorithm for parallel computation using systolic arrays is proposed.
提出了一种易于脉动阵列实现的平方根椭球状态定界算法。
2.
In view of the requirements,a new method for real-time adaptive optical wavefront processor based on systolic array is proposed.
针对自适应光学系统对波前处理机高计算量、高实时性的要求,本文提出了一种基于脉动阵列的自适应光学实时波前处理方法。
3.
On the basis of above, a real-time wave-front reconstruction on a control flow systolic array is built.
针对波前复原算法计算量大、算法简单规则的特点,本文研究了波前复原部分的并行算法以及复原矩阵的子孔径行系数簇变换和循环矩阵分解法,同时建立了基于控制流的波前复原脉动阵列。
4) systolic array
心动阵列
1.
In this paper,to accelerate the solving speed of Jacobi matrix,the Gausssian elimination was briefly analyzed,on the basis of which a circuit structure of LU decomposition realized by a two-dimension systolic array was constructed.
为加速矩阵求逆 ,本研究在简要分析Gauss消去法的基础上 ,构造出一种基于二维正方心动阵列的矩阵LU分解的电路结构 。
2.
In order to fasten the calculation speed, a matrix multiplier, which is based on 2-D square systolic array architecture, is introduced in this paper in light of the parallel algorithm of matrix computation.
为了提高运算速度 ,笔者在论述矩阵运算并行算法的基础上 ,提出了基于二维正方形心动阵列结构的矩阵乘法器 ,并研究了二维方阵结构的矩阵乘法器的FPGA硬件实现方法 ,比较了单处理机乘法器和二维方阵结构的矩阵乘法器的运算速度及所需器件资源 ,结果表明采用二维正方形心动阵列实现的矩阵乘法器 ,具有高度并行性和流水线性特点 ,可使阵列中负载均匀 ,延时缩短 ,有利集成度提高 ,是实现消谐模型求解过程中矩阵乘法运算的较好算
3.
A circuit structure with systolic array is introduced in this paper in order to accelerate the speed of matrix inversion,which is quite prone to implement.
为加速矩阵求逆,研究构造出一种非常易于实现的基于心动阵列的矩阵求逆的电路结构。
5) matrix / systolic array
矩阵/心动阵列
6) active queue
主动队列
1.
Research on Active Queue Management Algorithm Based on Intelligent Control;
基于智能控制的主动队列管理算法研究
2.
To alleviate the parameter dependence problem of random early detection (RED) active queue management mechanism, an improved method was proposed through adopting the adaptive thought.
为了解决随机早期检测(randomearlydetection,RED)主动队列管理机制的参数依赖性问题,通过引进自适应的思想提出了一种改进方法。
3.
Furthermore, this paper puts forward active queue model used as an area for resources dynamic trading in active node, designs resources distribution arithmetic and price function of resources, and lets resources to be shared according to user preferences.
在此基础上建立了主动队列模型作为资源协商之地;同时设计了资源分配算法和资源价格凸函数,让用户直接参与资源协商,自主地共享节点资源。
补充资料：主动
①不靠外力促进而自动：主动关心同学。②能够由自己把握：争取主动。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条