查询词典 Np

In this paper,the adsorption behavior of quadrivalent,pentravalent and hexavalent neptunium on silica gel in nitric acid solutions was investigated by batch experiment.

本文研究批式实验条件下，硝酸溶液中Np、 Np和Np在硅胶上的吸附行为。

The effects of equilibrium time,acidity of the solution,temperature,concentration of redox reagents on the adsorption of neptunium by silica gel were carried out.

进行了吸附平衡时间、酸度、温度、氧化还原剂浓度等条件对硝酸溶液中Np、Np和Np在硅胶上吸附的影响的实验，与吸附时同酸度条件下的洗脱实验，用浓度为3mol／L的硝酸作为解吸剂的解吸实验。

But this case is a common problem that often meets in samples of reprocessing.In this dissertation, an indirect fluorescence analysis method to analyze trace neptunium is discussed.

本文利用DTPA-Tb与DTPA-Np稳定性的显著差异，DTPA-Tb的络合常数的对数值是22.71，而DTPA-Np的络合常数的对数值为29.8，由Np~(4+)置换出DTPA-Tb中的Tb~(3+)。

Accordingly, in this thesis we propose a novel gridless routing algorithm for solving obstacle detoured multi-terminal net routing problem in physical design of VLSI circuits.

另外，随着VLSI的工艺向超深亚微米的推进，物理设计中的布线问题(无论是非NP问题、NP完全问题和NP困难问题)，由于问题规模的急剧增大，都迫切需要更有效的优化算法解决(来源：AB2875C论文网www.abclunwen.com)方案。

This kind of parallel processing hugely improves the computational speed, and can change some NP problems that cannot be accomplished by classical computers, i.e., the complexity of the problems exponentially increases with the increase of bits, to P problems, i.e., the complexity of the problems polynomially increases with the increase of bits. In 1994 Peter Shor at Bell Laboratory proved that quantum computers could efficiently solve the problem of Large Number Factorization, which was the security footstone of nowaday classical cryptosystems, while none of any classical computers could implement this.

这种并行处理极大地提高了计算速度，可以把一些经典计算中无法计算的NP问题即问题的复杂度随着比特位数的增长而指数上升，变成P问题即问题的复杂度随着比特位数的增长以多项式上升。1994年，Bell实验室的Peter Shor证明量子计算机可以有效解决经典计算机所不能解决的大数因子分解问题，而这恰恰是目前经典密码的安全性基础。

Through the pig serum-induced rat model of liver fibrosis was observed in rat liver tissue morphology Resveratrol Liver tissue of the impact of HA,LN,C-Ⅳ,PⅢNP and the impact of HyP.

通过对猪血清诱导的肝纤维化大鼠模型，观察白藜芦醇大鼠肝组织形态学的影响及肝组织HA、LN、C-Ⅳ、PⅢNP及HyP的影响。

Under the direction of Case Theory,the subject-predicate agreement and constraints on the definiteness of noun phrases in existential sentences are rediscussed in the light of case assignment and LF affix .

以格理论为指导，结合格传递说和 LF词缀说对存在句的一致问题和名词短语的确指问题进行再探讨，解释存在句的主谓一致受制于there和其后的NP，其后的NP大部分情况下是不确指的NP，但有时也有确指的NP。

Timetabling Problem is a Multiobjective Combination Optimization Problem with constraints, and also has been proved NP-Completed.

排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP完全问题。

Among them, ETA belongs to the famous timetabling problem which is a NP complete problem and has been a research puzzle for a long time.

其中考试时间安排属于著名的时间表问题TTP，TTP 问题属于NP完全问题，是研究的一个难题。

The timetabling problem is an NP-hard multiobjective combinatorial optimization problem with constraints.

排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明为一个NP难问题。

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.

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