| 1. | Fixed - order robust control for a engine based on homotopy algorithm 混合灵敏度控制中权阵的选取 |
| 2. | Otherwise , define the weighted of a subgraph h in g is defined by the one with maximum weight among a certain kind of subgraphs is also called heaviest 图g的子图h的权定义为某类子图中权最大的又叫最重的。 |
| 3. | The paper also studied the structure of lms adaptive filter and the theoretical analysis of astringency by deducing the equal square error of the weigh value in the msn linear filtering 在mse线性滤波中权值的均方误差函数的推导的基础上,对lms自适应滤波器的结构和收敛性的理论分析进行了研究。 |
| 4. | To solve this probiem , this thesis prov i des a domain - based vector space mode 1 by bu i 1 di ng a classification model and offer i ng the method to cal culate the documents " weight in the domains 针对此问题,本文提出一种基于领域的向量空间模型,建立了一个领域分类模型,并给出了计算信息在各领域中权值的方法。 |
| 5. | Further more , with the knowledge of the relations between new and old samples , the article put forward the iteration algorithm of the weight in ordered samples " weighted least - square estimation , the model if good at forecasting 其次,在新样品与原样品的关系确知的情况下,该文提出了有序样品的加权估计中权重的一种迭代取法,再进行新预测,效果显著。 |
| 6. | Among these , the context pipelining algorithm in ctx is the most important technique for maximizing the parallelization , which will be explicated deeply for its principle and performance and also the performance comparisons of mtp and ctx are analyzed 而在ixpc编译器的实现中, io平衡的问题并没有作为任务划分算法中权值设置的要素之一。为此本文提出了一个解决方案,即通过打破io操作之间的 |
| 7. | We define the weighted degree of v by the weight of a subgraph h of g is defined by the one with maximum weight among a certain kind of subgraphs is also called heaviest . so a heaviest cycle is a cycle with maximum sum of all edge ' s weights among all cycles of a graph 顶点v的赋权度定义为图g的子图h的权定义为某类子图中权最大的又叫最重的,所以最重回也就赋权用的所有回中权之和最大的回 |
| 8. | Based on the additive weighting model and the expectation and square difference method for priorities , the calculating method for minimum changes of weight is obtained when the ranking position between two alternatives is reversed 在区间数的“期望方差”排序法基础上,基于加权模型,对区间数多属性决策中权重灵敏度进行分析,并给出了当两个方案之间排序位置颠倒时某一指标的权重最小变化量的计算方法。 |
| 9. | Secondly , in order to find the solution to how to derive key words / entries from documents , this paper puts forward a matrix - weighted mining association rule algorithm based on the weighted mining algorithm and the weighted value of vector space model , vsm 针对自动从文档中导出关键词词条之间的关联性问题,本文在深入研究加权挖掘算法和向量空间模型中权值特点的基础上,提出一种矩阵加权关联规则挖掘算法。 |