一整数的分解

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规则对当前解进行更新。

Because of the distinct difference in the background color, we use a binary algorithm based on gray mean value and a two-step segmentation method to segment the image. In order to reduce the influence of unlinear change on the image, we divide the shooting score into two parts: integral and floating.

针对靶图像背景颜色对比度大的特点，采用一种基于灰度期望值的图像二值化算法，通过逐步分离的方法，将靶环从背景中分割出来；针对影响靶数精度的主要因素，将靶数分解为整数与小数两部分。

Nyang and Song proposed a digital signature scheme based on quadratic residue problem.

对Shimada公钥密码体制进行推广，提出一种新的密码体制，这种新的公钥密码体制的安全性建立在一般形式的素因子分解问题之上，攻击这种新的密码体制等价于对一般形式的大整数进行素因子分解，并设计一种新的数字签名方案和新的认证加密方案。

In C under the TSA Sanchez Theorem : A sum of the cube can be written a bunch of odd that the sum...

在C下实现的尼科梅切斯定理：任何一个整数的立方都可以写成一串奇数之和即任意一个正整数n的立方分解成个连续的n个奇数之和。

In this paper, we introduce the concepts of the great common P-divisor, least common P-multiple of two distinct nonzero elements x, y in arbitrary unique factorization domain R, and denote them byp, and p respectively.

在本文中，作为通常的整数环Z上的最大公因子和最小公倍数的推广，我们在惟一分解整环R上定义了最大公P-因子和最小公P-倍元，分别记为_P和_P。

They weren't aggressive, but I yelled and threw a rock in their direction to get them off the trail and away from me, just in case.

他们没有侵略性，但我大喊，并在他们的方向扔石头让他们过的线索，远离我，以防万一。

In slot 2 in your bag put wrapping paper, quantity does not matter in this case.

在你的书包里槽2把包装纸、数量无关紧要。