查询词典 hidden line algorithm

There is mutual contradiction between direction estimation of user's signal and power allocation among all users in the beamforming algorithm. A twice game beamforming algorithm based on game theory is proposed to deal with it. Beamforming game algorithm mathematics model is constructed. During the first game, direction of signal and power allocation are mapped the game theory as "player", which are modeled as the problem of maximin function and obtain direction estimation first. Then during the second game, power allocations of different users are described as a multi-user game. Power updated algorithm is designed. The existence and uniqueness of the Nash equilibrium in the twice game beamforming algorithm based on game theory are proved by mathematics derivation.

摘要针对波束成形算法中，用户的信号方向估计值和用户之间的功率分配存在着相互矛盾，本文提出了一种基于博弈论的二次博弈波束成形算法，构建了波束成形博弈算法数学模型，首先在第一次博弈的时候，将波束成形算法中的信号方向和功率分配映射为博弈论数学模型中的"局中人"，将其建模为函数的极大极小值求解问题，先求解出信号方向；然后在第二次博弈的时候，将不同用户的功率分配过程描述为一个多用户的博弈过程，设计了功率分配更新算法，通过数学推导论证了纳什平衡点的存在性和唯一性。

Related algorithm\' s new application and algorithm\' s improvement andproof proposed include:Dijkstra algorithm,Intersect-Bellman-Ford *algorithm,n regular random graph,multi-dimensional scaling,FastmapAlgorithm,QoS algorithm,multi-view Expectation Maximization algorithmbased on Gaussian distribution hybrid model and so on.

具体涉及的算法新型应用或者算法改进涵盖了Dijkstra算法、IBF*(Intersect-Bellman-Ford)*算法、N正则随机图、多维定标算法、FastMap算法、QoS算法和多视图EM聚类算法等。

In this implementation, the evolutionary algorithm is hybridized with the simulated annealing algorithm and the hill climbing heuristic. The main aspects are as follows. The Metropolis criterion of the simulated annealing algorithm is introduced to select the offspring in order to make the algorithm more effective to escape the local optimum. In terms of the hill climbing heuristic, the local normal perturbing mutation operator based probability selecting is developed to enhance the local searching of the algorithm.

其主要工作是将进化算法与模拟退火算法及爬山方法相组合，引入模拟退火算法中Metropolis接受准则选择子代，提高算法跳出局部最优解的能力：借鉴爬山方法思想，构造了基于概率选择的局部正态摄动变异算子，以强化进化算法局部细搜索能力；同时进化算法以多种群方式实现，在降低计算时间的同时提高算法收敛到全局最优解的概率。

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个简单变量提出一种改进算法。该改进算法在时间复杂度保持不变的情况下，空间复杂度比原算法节省一半。

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算法的速度控制系统相比较，具有收敛速度快、不易陷入局部极小的优点。

The shaping method of noncircular part and the tool holder's radial motion characters in noncircular turning process are discussed in detail in the thesis.

论文详细研究了非圆零件的成型方法和加工过程中刀架的径向运动规律。

I have not really liked him,I do not like his this kind of disposition.

我没有真的喜欢他，我不喜欢他的这种性格。