查询词典 Np

Graph's isomorphism is one of the basic problems and NP problems in graph theory.

图的同构是图论学科中的基本问题之1，属于图论中多个NP—完全问题之1。

In fact, one of these was among Karp's original 21 NP-complete problems.

事实上，这些是斯卡普原来21 NP完全问题。

R and S type LTSs are proposed.It is proved that the optimal distributed CFAR detection based on the above two LTSs in NP sense is in form of likelihood ratio test.

提出了R类和S类局部检测统计量，证明了基于这两种局部检测统计量的在NP意义上的最优分布式CFAR检测具有似然比检验形式。

A linear map f: M→M is said to preserve idempotence if fP(subscript nP.

若线性映射f： M→M满足fP(下标 nP，则称f是保幂等的线性映射。

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

The stability was good.Conclusion:It is practicable to prepare Cu-PLA-NP lyophilization injection with proper formulas and preparation processes.

在适宜的处方及工艺条件下制备的Cu-PLA-NP冻干针剂是可行的。

Results CTL induced not only by viral infection but also by gene immunization could specifically lyse NP-expressed P815 cells.

结果 杀伤试验结果表明，无论通过病毒感染还是基因免疫获得的CTL效应细胞，均可以特异性杀伤NP基因转染的靶细胞。

Considering the complicity and higher predicted water cut in the polymer flooding model developed by Zhou Zhijun,expanding this model by Maclaurin series,a linear relation was obtained between d(Wp-aNp3)/dNp and Np in Cartesian system.

针对周志军等建立的聚合物驱驱替特征模型较为复杂、应用不方便，且后续水驱阶段预测偏差较大的问题，将该模型用麦克劳林级数展开，推导出d(Wp-aNp3)/dNp与Np在直角坐标系下存在线性关系。

At the same time, the problem of magic square is a typical NP problem, and there are still lots of unresolved puzzle and unfathomed mystery because of the complexity today.

但是，幻方问题是一个典型的 NP 难题，由于问题的复杂性，至今仍有很多未解决的难题和不解之谜。

The maximum clique problem is one of the classic NP-complete problems from combinatorial optimization.

最大团问题是组合优化中的一个经典的NP-Complete问题。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。