查询词典 algorithm

A high-performance modular exponentiation coprocessor, SEA, is presented here, and three novel ways are employed. First, a parallel binary modular exponentiation algorithm is used to decrease cycles, and a high radix Montgomery modular multiplication algorithm is modified to the radix based high radix Montgomery modular multiplication algorithm to increase the frequency; second when mapping algorithms to a systolic array, modular square and modular multiplication are alternatively computed to cover up the dependencies between iterations in the RBHRMMM algorithm and the bypass is used to eliminate the dependencies in the PBME algorithm; third, multipliers are split first, and then accumulations are compressed as partial products to decrease carry propagation delay in the critical path.

SEA是一种针对大数模幂的高性能协处理器，其主要采用如下3种加速方法：①采用二进位并行模幂算法和以基数长度为处理字长的高基数Montgomery算法；②将算法映射到脉动阵列处理结构，并交替计算平方和乘以掩盖RBHRMMM算法中的相关，同时应用定向技术消除PBME算法中的相关；③基於"先拆分乘法、后将累加压缩"的思想优化关键路径。

Finally, base on research of genetic algorithm and rough sets, analysis of the existing primary algorithm of attribute reduction based on the traditonal genetic algorithm, an improved algorithm of rough set attribute reduction base on dependability and genetic algorithm is presented in this paper.

最后，对遗传算法和粗糙集理论研究的基础上，通过分析现有的约简算法，提出一种基于依赖度的属性约简改进算法，改进后的算法可以求取属性的一个约简。

By introducing the steepest descent algorithm , conjugate gradient algorithm , Newton algorithm , Rayleigh Quotient Iteration algorithm and variable metric algorithm , the MSBMDA is implemented iteratively.

MSBMDA算法将盲多用户信道估计或多用户信息符号估计的模糊度限制到以±1，±j为元素的对角矩阵内，并消除了用户次序的模糊度。

On global optimal algorithms, a heuristic 0-1 Integer Liner Programming algorithm is achieved, which combines heuristic enumeration method and revised simplex method. Simulation experiments show that the degree and optimization efficiency in our algorithm is obviously improved compared with the MATLAB 7 bintprog function that is a 0-1 integer programming algorithm. Moreover our algorithm isn\'t relevant to the scale changes of Web services composition and candidate service sets, thus it is applicable for the scenes that the scales of Web services composition changed dynamically. But for Web services composition with service alliance, the algorithm is unable because the non-linear global optimal model of the fitness function and QoS constraints can\'t be expressed in linear mode.

在全局优化算法研究上，基于启发式0-1整线性规划算法结合了修正单纯形法和启发式枚举法，仿真实验表明该算法与MATLAB 7的0-1整数规划方法比较，在优化程度及优化效率上得到了显著改进，并且对服务组合和候选服务集合的规模变化没有明显的相关性，因而该算法可用于服务组合规模动态变化的场景，但该算法不能应用于存在服务联盟的非线性全局优化模型。

Fist, comprehensive analysis on the current study on data processing is made, and characters of Newton methods about nonlinear surveying and mapping data processing are discussed, and then new solutions to parameters estimate with multi-sources, multi-types, multi-dimension, multi-precision bynonlinear least square are presented such as PSB algorithm, digital continuation and generalized digital continuation algorithm, cone model method, tensor analysis method, GCMA(mixed algorithm of gradient method and conjugate gradient method), combining algorithm based on Newton method and gradient method and confidence region and so on, and a new fast difference iterative algorithm is proposed towards parameters estimation containing random parameters in nonlinear models, and a new solutions to nonlinear least squares surveying and mapping adjustment by parameters estimation both considering the random and nonrandom parameters is presented after studying on nonlinear data processing in deformation monitoring, and at last primary analysis on error propagation of spatial data is made and approximate error propagation formula and error analysis formula to length and area are proposed.

首先比较全面分析了目前测量数据处理理论的研究现状，讨论了牛顿类方法在处理非线性模型参数估计方面的特点，研究并给出了求解多源、多类型、多维、多精度、非线性最小二乘测量平差参数估计的若干种新方法，这包括PSB算法、数值延拓及其广义数值延拓算法、锥模型法、张量分析法、基于最速下降法和牛顿法的组合算法、基于最速下降

the fast transposition algorithm to sparse matrix expressed by triple list is introduced.this algorithm needs to determine the position in the transposed matrix position of the first element which is not equal to zero in the original matrix each row,it uses two arrays as auxiliary space.in order to reduce the auxiliary space which the algorithm needed,an improvement is made through introducing two simple variables.the improved algorithm saves a half auxiliary space compared to the original algorithm at the same time complexity.

摘 要：介绍基于三元组表表示的稀疏矩阵的快速转置算法，此算法在转置前需要先确定原矩阵中各列第一个非零元在转置矩阵中的位置，在此使用2个数组作为辅助空间，为了减少算法所需的辅助空间，通过引入2个简单变量提出一种改进算法。该改进算法在时间复杂度保持不变的情况下，空间复杂度比原算法节省一半。

Polygon Filling Algorithm typical scan line mainly include filling algorithm and contour filling algorithm domain signs for the document vector polygon filling algorithm for the scan line fill algorithm.

详细说明：典型的多边形填充算法主要包括扫描线填充算法和轮廓标志域填充算法，适用于矢量多边形文件的填充算法为扫描线填充算法。

Focusing on some disadvantages in standard BP algorithm, such as low convergence rate, easily falling into local minimum point and weak global search capability, Genetic algorithm is used to optimal the connection weight of BP Algorithm in this paper, and construct a GA-BP algorithm of evolutionary neural network, and the algorithm is applied to the control of BLDCM speed adjusting system.

针对标准BP算法存在全局搜索能力弱和易陷入局部极小点等缺点，本文将遗传算法与BP神经网络相结合，构造了一种新的进化神经网络GA-BP算法，并将该算法应用于无刷直流电机调速系统的控制，仿真结果表明，与传统的PI控制系统相比，该算法得出的电机控制曲线几乎无超调，与基于BP算法的速度控制系统相比较，具有收敛速度快、不易陷入局部极小的优点。

Then, the relation between vibration and sound, the acoustic holography method, the indeterminacy and identifiability of BSS, the BSS algorithm are discussed in detail. Based on above researches, the dissertation is divided in following four sections. The first section investigates the BSS algorithm suitable to acoustic feature separation. The algorithm of the joint approximate diagonalization of eigen-matrices is proposed. The spectra or the time-frequency distributions of source signals are the interesting features in ABD and they are separated from mixing signals by JADE algorithm. Then, the convolutive mixing model is transformed into a high-dimension instantaneous mixing model, and the deconvolution of source signals is achieved by the joint approximate block diagonalization of eigen-matrices. The proposed algorithm has a global minimum, and it is unsensitive to noise interference.

论文首先概述国内外声学诊断研究进展与盲分离研究进展，给出机器噪声声场与盲分离的数学描述，讨论了声振辐射、声全息、盲分离模型、盲分离可解性、盲分离结果不确定性、分离算法等基本问题，在此基础上，论文的研究工作分为以下四个部分：第一部分研究适用于声学特征分离的盲分离算法，提出基于特征提取的联合近似对角化盲分离算法，该算法以频谱特征或时频特征作为分离目标，从混合信号中分离源信号频谱特征或时频特征，最大限度地保留了与声学特征提取有关的频谱特征或时频特征，采用模型变换把卷积混合模型变换为一个高维瞬时混合模型，通过联合近似分块对角化算法实现源信号频谱特征与时频特征的盲反卷积。

As a differential detection is used between the intercarrier, the proposed algorithm overcome the high sensitivity to timing error of conventional algorithm and is robust to multi-path. The effect of sample frequency offset can't be ignored in a continuous OFDM system of a large number of subcarriers. The estimation precision of the conventional algorithm is low and the realization is complex. A joint estimation of sample frequency offset and fine frequency offset based on difference operation is proposed. As averaging use a large number of samples in a maximum likelihood algorithm, the estimation precision is very high. The use of difference operation cancel the effect of carrier frequency offset, and the proposed sampling frequency estimation algorithm is robust to carrier frequency offset.

最后，本文对连续系统中的采样频率和载波频率精同步技术进行较为深入的研究，由于子载波数目大的连续OFDM传输系统中，采样频率偏差不可忽视，以往的采样频率估计方法精度低、实现复杂，因此本文提出了一种基于差分处理的采样频率偏差和精载波频率偏差联合估计算法，利用了最大似然算法进行采样频率偏差的估计，由于采用了差分处理方法，消除了载波频率偏差对采样频率偏差估计的影响，采用的最大似然算法对大量样点进行平均化处理，所以，相对以往算法，提出的联合算法估计精度高，而且采样频率偏差估计对载波频率偏差具有鲁棒性。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。