| 1. | Adaptive ofdm ; minimum average ber ; adaptive algorithm
自适应ofdm最小平均误码率自适应预处理算法 |
| 2. | The adaptive algorithm based on minimum average ber criterion in ofdm system
系统中基于最小平均误码率的自适应预处理算法的研究 |
| 3. | The adaptive algorithm based on minimum average ber criterion in ofdm system
Ofdm系统中基于最小平均误码率的自适应预处理算法的研究 |
| 4. | Researchers say three weeks is the average minimum time required to create a new habit , good or bad
研究者们说，三个星期是养成一种习惯所需的最小平均时间，不管这习惯是好还是坏。 |
| 5. | Unplasticized pvc soil and ventilating pipes of 82 . 4 mm minimum mean outside diameter , and fittings and accessories of 82 . 4 mm and of other sizes - specification
82 . 4mm最小平均外径的未增塑聚氯乙烯粪水污物管和通风管以及82 . 4mm和其他尺寸的配件和附件.规范 |
| 6. | In the context of our model , we propose measuring risk as smallest expected weighted loss . thus , the above - mentioned is transformed into one of risk control problems
在这种模型框架下，给出加权最小平均损失来测度风险的标准，于是问题转化为风险控制问题 |
| 7. | When sintering temperature and sintering time are 625 c and 7min respectively , the densenfied bulk thermoelectric materials with mean grains size of 100nm were prepared
当烧结温度为625 ，烧结时间7min时，得到了最小平均晶粒尺寸为100nm的cosb _ 3密实块体材料。 |
| 8. | The concept of mac ( minimum average complexity ) is proposed first , and the calculation method is given according to the entropy formula
摘要首先提出了“平均复杂度”的概念，然后由信息熵公式给出了最小平均复杂度的计算方法，并以此为准则构造音频数据的矢量量化树。 |
| 9. | According to minimum mean absolute difference criteria ( mad ) , our paper uses three - step search algorithm to get the block vectors in two sequential images . main direction of object motion could be obtained by classifying and the average vector on main direction is the vector of whole object . this thesis starts with an introduction of the motion analysis
根据最小平均绝对差值( mad )准则，利用三步搜索算法，计算出相邻两帧视频图象中各子块的运动矢量，该算法通过对运动矢量场中的运动矢量进行统计、分类，找到物体运动的主要方向，而主运动方向上的平均运动矢量就是物体运动的整体矢量。 |
| 10. | A modified genetic algorithm ( mga ) framework was developed and applied to the flowshop sequencing problems with objective of minimizing mean total flowtime . to improve the general genetic algorithm routine , two operations were introduced into the framework . firstly , the worst points were filtered off in each generation and replaced with the best individuals found in previous generations ; secondly , the most promising individual was selectively cultivating if a certain number of recent generations have not been improved yet . under conditions of flowshop machine , the initial population generation and crossover function can also be improved when the mga framework is implemented . computational experiments with random samples show that the mga is superior to general genetic algorithm in performance and comparable to special - purpose heuristic algorithms . the mga framework can also be easily extended to other optimizations even though it will be implemented differently in detail
提出了一个改进遗传算法的结构，并且应用于带有目标是最小平均总流程时间的流水调度排序中.为了改进一般遗传算法的程序，两个新的操作被引进到这个操作中.这两个操作为： 1 )过滤操作：过滤掉在每一代中的最坏的个体，用前一代中的最好的个体替代它； 2 )培育操作：当在一定代数内算法不改进时，选择一个培育操作用于培育最有希望的个体.通过大量的随机产生的问题的例子的计算机实验显示出，提出的算法的性能明显好于一般遗传算法，并且和此问题的最好的专门意义的启发式算法相匹配.新的mga框架很容易扩展到其它最优化当中，只是实施的详细的步骤有所不同 |
