查询词典 Np

An input phase voltage is divided into a main range and a transition range in which new P, M, N conditions and PM, NP, MN transition conditions are defined, some null vector is selected and the condition combination sequence of bidirectional power switches are adjusted in each modulation period to realize the safe, reliable and rapid commutation and the stable operation of the matrix converter.

本发明属于矩阵变换器控制技术，为一种用于矩阵变换器的控制方法，通过把输入相电压划分为主区间和过渡区间、在过渡区间定义新的P、M、N状态和PM、NP、MN暂态以及在每个调制周期内选择特定的零矢量并调整双向功率开关状态组合顺序，实现矩阵变换器安全、可靠、快速换流和稳定运行。

It has been proved that most cases of open shop problems are NP-hard.

已经证明，绝大多数的自由作业都是NP困难的。

The Vehicle Routing Problem is a NP complete problem and is also a hot topic in the operational research field.

车辆路径问题属于完全NP问题，也是运筹学中的热点问题。

Simulation and optimization of block manufacturing yard scheduling Block manufacturing yard scheduling is a typical NP problem.

分段制造场地计划是典型的NP问题。

The airway epithelium cell can overproduce a lot of bio-active molecules and contribute to the pathogenesis of NP.

呼吸道上皮细胞可以过度合成，释放多种生物活性分子，参与NP的发病。

In contrast, Ih enlarged the GC region of pacemaking and driving only when IK1 of the NP cell was relatively low.

相反，Ih仅于NP细胞的IK1相对低的时候扩大起搏和驱动的GC区。

In the coupled-cell model, Ist significantly enlarged the gap conductance region where stable BP cell pacemaking and NP cell driving occur, reducing the number of BP cells required for robust pacemaking and driving.

在配对细胞模型，Ist明显扩大出现稳定BP细胞起搏和NP细胞驱动的缝隙电导区域，这就降低了稳定起搏和驱动所需要的BP细胞的数量。

Since vehicle scheduling problem is NP-hard,parallel genetic algorithm is proposed to solve this problem.

由于车辆调度问题属于NP难问题，提出了采用遗传算法对问题进行求解。

This paper proposes a novel processing resources scheduling algorithm oriented advanced Network Processors,called Duplication-base Partial Dynamic Scheduling.It aims to improve the NP performance by combining the strategies of partial dynamic mapping and task duplication.

提出一种新颖的面向高级网络处理器的处理资源调度算法，称为基于复制的部分动态调度算法（Duplication-base Partial Dynamic Scheduling，DPDS），结合部分动态映射及任务复制策略，以改善NP的性能。

This paper studies the distributed partition problem of Web Services composition and proves that it is NP-Hard.

本文证明了将Web服务组合分布式划分到不同节点上，在不同的划分中，求得吞吐量最佳的划分问题是一个NP-Hard问题。

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.

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