ID |
原文 |
译文 |
47226 |
依据估计混合矩阵得出估计性能指标再反馈更新构造函数; |
The estimated performance in-dex was obtained by the estimated mixed matrix, and the constructor was updated by the estimated performance index. |
47227 |
然后将选取合适经验参数的构造函数代入算法,同时自适应调整算法步长和动量因子; |
Then, the constructor was plugged with appropriate experienced parameter into the proposed algorithm and step andmomentum factor was adaptively adjusted. |
47228 |
最终得到估计源信号。 |
Finally, the estimation source signals could be obtained. |
47229 |
仿真表明该方法在平稳和非平稳环境下都可以估计出混合矩阵,能有效分离混合信号且收敛速度快稳态误差小。 |
Simulations showthat the proposed algorithm is effective to estimate the mixed matrix in the stationary and non-stationary environments, andthe proposed algorithm has faster convergence speed and lower steady error as well as separates source signals effectively. |
47230 |
广泛应用于安全关键系统的大规模无线网络需动态更新节点程序,采用无线再编程方式进行程序更新,具有高效性及灵活性。 |
The nodes of large-scale wireless network which widely used in safety-critical systems often update new code,the way of wireless reprogramming is efficiency and flexibility. |
47231 |
研究在节点均匀分布的矿井无线传感器网络环境下,如何选取最优的基站使整个网络再编程代价最小。 |
The problem of selecting the optimal base station whennodes uniformly distributed in mine wireless network environment and all other nodes were reprogrammed efficiency. |
47232 |
首先由网络节点程序更新的接力覆盖过程推导出基站选址模型, |
Firstly, the model of base station selecting was established by covering process of reprogramming. |
47233 |
其次将其转化为求解连通简单图任意节点不循环最长最短通路的最小值问题, |
Then the problem was transformed into solving the minimum of longest non-cyclic path between node and base station in undirected circulantgraph. |
47234 |
最后给出基于动态规划的最优算法,包括最优子结构和重叠子问题。 |
Finally, the optimal algorithm based on dynamic programming which included optimal substructure and overlap-ping subproblems was proposed. |
47235 |
数值结果表明,与其他最优算法相比,该算法在网络复杂度急剧增大时仍保持平稳的时间消耗。 |
Numerical analysis and experimental results show that the time consumption of pro-posed algorithm is more stable than other optimal algorithm when the complexity of network is increased sharply. |