我们利用哈夫曼算法建立一棵哈夫曼树(最优二叉树)，同时将数据出现的频率作为权值赋给哈夫曼树中的结点。
Huffman algorithm we use to establish a Huffman tree (the optimal binary tree), while the frequency of the data as the weights assigned to Huffman tree nodes.
通过比较台面上不同部位上几个关键结点耦合前后平均加速度值的变化，计算出了各个频率下的附加质量，并对附加质量给振动台设计带来的影响进行了研究。
Comparing with the accelerations of two different conditions, additional masses are calculated. At last, the influences carried by additional mass during the designing of vibration table are analyzed.
通过比较台面上不同部位上几个关键结点耦合前后平均加速度值的变化，计算出了各个频率下的附加质量，并对附加质量给振动台设计带来的影响进行了研究。
Comparing with the accelerations of two different conditions, additional masses are calculated. At last, the influences carried by additional mass during the designing of vibration table are analyzed.
应用推荐