极小

Moreover, a minimum iterative function is adopted to deduce optimal MAP regional radius when handoff latency is minimum.

通过采用极小化函数迭代的方法，求出使切换时延达到最小时最优MAP管理区域半径。

An IF peak and a minimum of modulus were observed respectively in the Q-1-εand f2-εcurves.

在Q-1-ε曲线上出现Q-1峰，而在f2-ε曲线上出现与之相对应的模量极小。

This invention relates to MIMO test method in a multi-user MIMO radio communication system including: estimating the channel matrixes of all users at the base station, computing an orthogonal projecting matrix M of the interference matrix of each user and transmitting M to each user periodically, receiving data sent by the base station at the user end and getting the orthogonal projecting matrix M from the received data, transforming the MIMO test of a desired user to the minimum value of a K-element secondary convex function, in which, K expresses the number of sending antennas and getting estimation of the test data by a ball test method.

一种多用户多输入多输出无线通信系统中的MIMO检测方法，包括步骤：在基站估计所有用户的信道矩阵；计算每个用户的干扰用户矩阵的正交投影矩阵M，并将每个用户的正交投影矩阵M定期发送给每个用户；在用户端接收基站发送的数据，并从接收的数据中得到正交投影矩阵M；利用正交投影矩阵M将期望用户的MIMO检测转化为K元二次凸函数的极小值，其中K表示对期望用户而言，发送天线的个数；利用球检测的方法，得到检测数据的估计。

"In calculus, the derivative equals zero or does not exist at a function's minimum point."

在微积分中，在函数的极小值点上导数等于零或者不存在导数。

The result indicates that equilibrium point that is temporary minimum is saddle point.

系统的平衡点即临时极小点为鞍点。

So this equation is also called the principle of minimum potential energy .

因此， 该式又称为极小势能原理。

This paper proposes a learning algorithm of solving the local minimum problem and the un-learnable problem for the Hopfield neural networks.

本文针对Hopfield神经网络所存在的极小值问题及缺乏学习能力的问题，提出了一种学习算法。

Aiming at the difficulties of invalid solution and local minimum problems when traveling salesman problemis studied using Hopfield artificial neural network.

针对Hopfield神经网络在求解旅行商问题时出现的无效解和局部极小值问题，分析和比较两种改进的求解方法，首先从理论上证明算法的有效性，然后对两种算法分别进行计算机仿真，探讨网络收敛于全局有效解的途径。

The way of Arnoldi is based upon the principle of Galerkin, which is closed to the solution of the linear numerical system. Here, we call the solution as Generalized Minimum Residual.

基于Galerkin原理的Arnoldi算法是求解这种线性代数方程组的近似算法，以下称这种方法为广义极小残余算法。

Due to the fact that the method based on local linearization is usually lost in local minimum values and the optimization solution is dependent on the selection of initial solution,the standard genetic algorithm has po...

该算法利用拟网格法初始种群和综合交叉策略，克服了早熟收敛现象，从而提高了遗传寻优的效率。理论模型反演与其它方法比较，结果说明遗传算法具有不依赖初始模型，不容易陷入局部极小，多点多路径概率搜索，以及隐含并行性等优点。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。