整数的

Complexity of matching is reduced by using seeds and transform of integral image.

在算法实施过程中，采用了高置信度的种子点和整数图像变换技术，有效地降低了匹配算法的复杂度。

For example, when intermediate calculations become larger than can be represented by a floating-point or an integer variable the intermediate result will be invalid.

例如，当中间的计算变得大过可以被floationg-point或整数变量所能代表时，中间结果将是无效的。

Invalid data type for this operation. Integer or real type expected.

在给定位置的操作只支持整数和实数类型的操作数。

For columns of data it is common practice to right justify integers, decimal align floating point numbers, and left justify strings.

对于纵列的数据而言，很实用的方式是右对齐整数部分，小数和小数点部分左对齐。

Since the model is a large scale and NP-hard combinational optimization problem in the real navigation environment, a hybrid simulated annealing algorithm is employed to search the suboptimal solution composed of a lockage timetable and a ship scheduling, The search starts by trimming the existing lockage timetable based on heuristic rules; the result is then used to compute the ship scheduling by the depth-first-search algorithm. The obtained solution is finally updated by the Metropolis rule.

本文首先提出了该问题的混合整数非线性规划模型，在实际通航调度环境中，该模型属于强NP-hard复杂度的大规模组合优化问题，因此设计了一种混合模拟退火算法来搜索次优化调度方案，该算法将解分解为闸次时间表和船舶调度计划两部分，在搜索过程中用启发式规则对闸次时间表进行调整，然后用深度优先搜索算法根据闸次时间表求解船舶调度计划，最后根据Metropolis规则对当前解进行更新。

Moreover it is sufficient to keep track of just the numerator by adding once every lunation, an integer constant to a variable that is called the accumulator.

此外，在追踪时每一次调整月的长度只要改变分子，加上一个称为累加器的整数常数即可。

Consider the problem 1|s_, outtree |∑w_jC_j , we use the method of the maximal family tree to sol...

最后把NP-难的问题P_m|s_|∑w_jC_j转化为整数规划模型，并设计了LMP的列生成算法，结合Dantzig-Wolfe分解技术，利用动态规划对其进行求解。

The problem of maximum security route in transportation is discussed in this paper.

讨论了最安全路线运输问题，给出了该问题的混合整数规划模型，并提出了该问题的解法，最后给出了一个实例

The order of fraction mixed operation is the same as the order of whole number mixed operation.

*分数混合运算的顺序与整数混合运算的顺序一样。

A group modulo n on conic curve can be formed, on which we can construct cryptogram similar to RSA.

同时，还可以建立模n的圆锥曲线群，构造等价于大整数分解的密码。

Do you know, i need you to come back

你知道吗，我需要你回来

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

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