查询词典 Np

Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.

课程项目包含：有限状态机与正规语言，情境无关语言，Turing机，部分递回函数，Church理论，不可判定性，可简化性与完整性，时间复杂度与NP-完整性，或然率计算，与交互验证系统。译注：Turing machine 一般译作"图灵机"或"图林机"，本课程依据专有名词保留原则，一律译为Turing机。

The Unaccusative Hypothesis claims that unaccusatives are derived by NP-movement from the object position, whereas the subject of unergatives is underived.

非受格性假设宣称非受格性是源自于名词组从受格位置的位移而非主格性则无。

Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.

最大团问题是一个经典的NP难的组合优化问题，很多实际问题都可以抽象为对无向图上最大团问题的求解，所以，对最大团问题的研究无论在理论上还是实际上都有重要意义。

Considering the equation of flow conservation, the problem of efficient monitoring is regarded as the problem of finding out the minimum weak vertex cover set and the minimum weak vertex cover set based on flow partition for a given graph G which are all proved NP-Complete.

考虑网络节点的流守恒特性，网络流量的有效监测问题可抽象为求给定图G的最小弱顶点覆盖集的问题和基于流划分的最小弱顶点覆盖集的问题，这是NP难的问题。

The problem of seeking monitor-nodes for measuring the network traffic is regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard.

摘要网络流量监测点问题可以抽象为图的最小弱顶点覆盖问题，而求解最小弱顶点覆盖问题是一个NP难题。

Quadratic assignment problem is a NP-hard combinatorial optimization problem and has been applied in various fields. There are always many zero elements in the flow matrix or distance matrix of the quadratic assignment problem instances which are abstracted from the practical problems. Much computation time can be saved if we can first reduce the size of the problem by using its zero elements.

二次分配问题(quadratic assignment problem， QAP)是应用于诸多领域的组合优化NP-难题，许多从实际问题中抽象出来的二次分配问题，其流矩阵与距离矩阵中存在大量零元素，如果在该类二次分配问题的求解中，能够充分利用这些零元素的信息，将大大缩减问题的规模，节省大量运算时间。

The features of the NP+ looks a bit like the features of the ZOWIE GEAR mousepad you reviewed a little while ago.

对国民党的功能+看起来很像的功能很多著名齿轮位垫您检阅了前阵子。

Traveling Salesman Problem is a classic NP problem, which is the main standard of measuring the efficiency of approximative algorithms. So the solution of the problem has has very important significance.

Traveling Salesman Problem问题是一个典型NP难题，是衡量近似算法效率的主要标准，因此设计TSP问题的近似算法具有非常重要的意义。

Traveling Salesman Problem is a classic NP problem, which is the main standard of measuring the efficiency of approximative algorithms.

由于它简单易行、鲁棒性强，应用范围极为广泛，并且已在众多领域得到了实际应用，引起了广大学者和工程人员的关注。

The optimum pH for labeling was between 7.5-8.0, and the optimum spiking rate of polyclonal antibody was 12μg/ml. The absorb pad, sample pad, glass fiber of ARIST and nitrocellulose membrane HF24004 of Millipore were chosen as GICA materials. The carbofuran-OVA conjugate 0.97mg/ml and sheep anti-rabbit IgG 0.48 mg/ml was dispensed with Nano-Plotter (NP 1.2) onto the NC membrane to serve as test line and control line, respectively. The colloidal gold-labeled anti-carbofuran antibody was dispensed on the glass fiber with 20μl/unit.

选用ARIST公司的吸水垫、样品垫、玻璃纤维纸和Millipore公司的HF24004硝酸纤维素膜作为试纸条材料，用三维喷点平台分别将0.97mg/ml的克百威-OVA结合物和0.48 mg/ml羊抗兔IgG间隔5mm平行定量喷涂固化于硝酸纤维素膜上作为测试线和质控线，将金标记抗克百威多克隆抗体以20μl/垫定量滴加于玻璃纤维纸上，干燥硝酸纤维素膜和玻璃纤维纸。

Simply indicate where missing data will go, how you think hypothesize

如果你的推测是正确的，你将如何去解释它。拿到你的大纲后，我将把

But, in Internet bar market striking executive force is giant network the foundation of Lai Yicheng result.

但是，在网吧市场惊人的执行力正是巨人网络赖以成功的基础。