查询词典 algorithm

This thesis focuses on studying the matrix equa-tion problem systematically, and proposed an abstract algorithm of solving the matrixequation with constraints, and established a strict convergence theory. Using this algo-rithm, we can solve the sets of matrix equation satisfying some constraint conditions,such as symmetric, antisymmetric, centrosymmetric, centroskew symmetric, re?exive,antire?exive, bisymmetric, symmetric and antipersymmetric, symmetric orthogonalsymmetric, symmetric orthogonal antisymmetric, Hermite generalized Hamilton ma-trix;So we can solve the problem with this algorithm, if the set of constrain matrixcan make a subspace in matrix space, and this algorithm also can solve the optimalapproximation and least squares problem. So this abstract algorithm has universal andimportant practical value.

本篇硕士论文系统地研究了此类问题，并找到了求解约束矩阵问题的抽象算法，并建立严格的收敛性理论，利用这一算法可求解约束条件为对称矩阵、反对称矩阵、中心对称矩阵、中心反对称矩阵、自反矩阵、反自反矩阵，对称正交对称矩阵、对称正交反对称矩阵、双中心矩阵、Hermite广义Hamilton矩阵等；可以说只要约束矩阵集合在矩阵空间中构成子空间，都可以考虑用此算法求解，而且这一算法还能把矩阵方程解及其最佳逼近，最小二乘解及其最佳逼近统一处理，因此本文算法有普适性和重要的实用价值。

Then an in-depth analysis and comparison between anticipated hard handover and two network interfaces soft handover are performed. Based on that, we propose two paths IP soft handover and its algorithm. The entire algorithm includes second capsulation algorithm of train part and decapsulation and data recovery algorithm of railway and control center part.

通过分析和比较预扫描硬切换和双网络接口软切换，本文提出了双路径IP软切换方案并设计了双路径IP软切换算法，整个算法包括车载部分的二次封装算法和轨旁及控制中心部分的解封装和数据还原算法。

Three point registrations and ICP (Iterative Closest Point Algorithm) algorithm are used to register for multi-view data. The angle-and-chord's algorithm is advanced which is based on chordal deviation algorithm for data sampling. The method is proved to be effective and right by some examples.

采用基于参考点的对齐算法和ICP算法实现多视点云的对齐，在弦高差方法的基础上提出一种弦高角度法实现点云数据的精简处理，完成数据精简，实例应用表明所提方法精简效果好，数据的压缩效率高。

The algorithm needn't generate candidate itemsets and scan database, because it employs FP-Tree to store trasanctions in database compressedly and takes full advantage of the characteristic of FP-Tree.Consequently,the complexity of space and time the algorithm used is reduced obviously in the procedure of data mining.In a thorough experimental analysis of our algorithm on real and synthetic data,we isolate the effect of the individual components of the algorithm. Our performance numbers show that MFP-Miner outperforms previous work.

该算法利用频繁模式树来压缩存储数据库中的事务，并充分利用频繁模式树的特点，在挖掘最大频繁项目集的过程中不需要产生候选项目集和扫描数据库，从而减少了算法在挖掘过程中使用的存储空间和计算时间，通过实验结果显示，该算法的性能优于同类算法。

Design random number generators with good independence and good uniformity is the key in reliability parallel simulation. Four algorithms of parallel random number generators are introduced. They are segmented parallel algorithm and leapfrog parallel algorithm of multiplicative congruential generator and generalized feedback shift register generator, parallel algorithm of lagged Fibonacci generator, and parallel algorithm of combined generator.

可靠性并行仿真的关键问题是设计独立性、均匀性良好的并行伪随机数序列，本文给出了基于分段并行算法和跳跃式并行算法的乘同余发生器、GFSR发生器和延迟Fibonacci发生器、组合发生器等的并行算法，组合发生器能够产生周期为2.3×10〓的伪随机数序列，且品质良好。

The entropy-directed algorithm needs manual intervention to construct fault isolation strategy,and it is ofεhigh computation complexity.Theoretical analysis and experimental results illustrate that the entropy indirected algorithm remedies such deficiency. The MFIT of the strategy by this algorithm is about 38% less than that by the entropy- directed algorithm under the assumption of unequal fault rate.

实验验证和理论分析表明，该方法弥补了直接熵法构造故障隔离策略时需进行人工干预、计算复杂性高的不足；在不等故障概率的假设条件下，平均故障隔离时间比直接熵法减少约38%。

This paper describes a new algorithm of image enhancement of impulse noise based on PCNN time matrix and rough sets indiscernibility relation. For noisy gray images, the results of computer simulations show that the image noise can be reduced efficiently and the image becomes clear and the target details of the image can be enhanced better by using this algorithm. In addition, the effects of this algorithm are better than usual image enhancement algorithm.

基于粗集理论中的不可分辨关系的等价概念及PCNN赋时矩阵，提出了一种含有脉冲噪声的图像增强算法，计算机仿真结果表明，对被噪声污染的灰度图像，用基于PCNN与粗集理论相结合的图像增强算法处理后，图像噪声得到有效抑制，画面更清晰，图像中目标的细节也得到了很好的增强，其结果优于常规方法。

Hypercube has many advantages, such as smaller diameter, simple routing algorithm, many parallel paths between any two nodes, and fault-tolerance, on the other hand that the Hypercube nodal degree increased logarithmetically to the number of nodes has limited network population. So we propose a constant nodal degree hierarchical topology to remedy the weakness of Hypercube and take advantages of Hypercube most. Given the definition of FCCN we analyse the basic properties including nodal degree , number of links , extensibility and diameter (maximum network communication delay). Also we proposed a simple and self-routing algorithm applied in FCCN. Although the self-routing algorithm is not optimal, but at more than 82% case it can get the shortest path, and the percent is larger and larger increased with network levels. By the self-routing algorithm the internodal distance is calculated to evaluate the network communication delay more clearly. The average internal distance is in order of the cubic root of the network population that is almost same as logarithmetically relation in a few thousands. FCCN is a highly scalable network due to its recursive construction.

首先在比较了基本互连网络的基础上，看到超立体网络的杰出性能，包括网络直径小、寻路算法简单且为自寻路算法、容错能力好等等，但是由于其节点度随网络的规模的增加而按对数关系增长，使得超立体网络的应用规模受到极大限制，所以为了能最大限度利用超立体网络的优点的同时弥补其节点度方面的不足，作者提出了节点度等于常数4的FCCN网络结构，来最多地利用立方体网络的优点；然后在对FCCN网络进行严格的定义后，分析了网络的节点度、链路数、延伸特性、网络的直径（决定网络的最大通讯延迟）等，并提出了适于FCCN网络的简单的自寻路算法，计算自寻路算法可得到最短路径的比例，看到在多于82％以上的情况自寻路算法都是最优的，而且比例随网络层数的增加而增加；应用所提出的自寻路算法计算了可以更加准确反映网络通讯延迟的参数—网络平均节点距离，计算得到此参数与网络大小的立方根成正比，此比例关系在网络的规模在几千节点以内与对数关系的网络几乎一样；FCCN网络是一高度可扩展结构，这是因为FCCN的递归构成方式，使得网络在增加节点时其原有的拓扑结构可以保持不变，不需对网络进行重新设计，为网络的实用扩展提供了条件；理论分析得出FCCN网络是一种高度可扩展高性能网络的结论。

This paper analysised the current problem in traffic path chosen generally, presented the expression and storge structure in computer of traffic data, discussed and researched the traditional algorithm of current optimal path chosen, which contained Dijkstra Algorithm, Floyd Algorithm and A* Algorithm.

论文综合分析了当前道路交通中在路径选择方面存在的问题，介绍了道路交通数据的计算机表示方式与存储结构；讨论研究了当前路径选择的几种经典的算法，分别研究了Dijkstra算法、Floyd算法、A*算法。

The wavelet time-frequency properties of the uncracked rotor and the cracked rotor were discussed by the continuous wavelet time-frequency analysis algorithm. A new algorithm using the wavelet time-frequency analysis algorithm to detect the crack was proposed. The influence of the sampling frequency on the wavelet time-frequency analysis algorithm was analyzed through the numerical simulation research; the valid sampling frequency was presented.

利用连续小波时频分析方法，讨论了裂纹转子与无裂纹转子的小波时频特性，提出了利用小波时频分析方法识别裂纹的新方法；数值仿真研究了采样频率对小波时频分析方法的准确性和有效性的影响，并给出了建议性的采样频率。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。