The basic structure and the seal principles of the hard packing were presented, and the formula of specific pressure was given.
介绍了硬填料密封的基本结构及密封原理，给出了比压计算式。
Results:Multi-function transfusion ware is more suit-abel to medicine mixing and injecting with hard packing or soft packing and open or close packing.
结果：多功能输液器适用于硬包装、软包装及密闭式、开放式静脉用药的配制与输液。
And the pump integrated vertically, so the hard packing is not easy to deposit, to ensure the long-term use does not affect the precision and the rate of spit.
当胶水含有较硬的填料时，必须采用耐磨泵，而且泵部整体竖直放置，使硬质填料不易沉积，使用维护更加方便，保证长期使用不影响吐出精度及比率。
Outside opens the packing attire, nips one gently, the inside liquor permeating chocolate, Gives people a hard time becomes immediately neat.
打开外面的包装，轻轻咬一口，里面的酒渗入巧克力，顿时整个人都变得清爽。
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP-HARD问题，其求解是很困难的。
In complexity theory, set packing problems is an important NP-hard problem, which is used widely in the fields of scheduling and code optimization.
在复杂性理论中，此问题是一类重要的NP难问题，被广泛应用于调度、代码优化和生物信息学等领域。
As a combinatorial optimization problem, three dimension packing problem with multi-constraints is NP-HARD problem. It is very difficult to obtain an optimal solution.
作为一类组合优化问题，多约束条件下的三维装载问题属于NP - Hard问题，其求解也是相当困难的。
This company, which wants to get their new product sold well in the market, is trying hard to perfect its packing and workmanship.
为了使新产品在市场热销，这个公司正在全力改进工艺和外包装。 羷。
Combine hold the product function, perfect service system of Gao quality and reasonable of price of article, for new the old customer solve various packing hard nut to crack, attain all-inclusive.
并携高质量的产品性能、完善的服务体系及合理的产品价格，为新老客户解决各种包装难题，做到无所不包。
The cushion mechanism of paper-pulp package is analyzed. The FEM modeling and analysis is carried out, using the paper pulp packing for hard disk.
分析了纸浆模塑制品在包装应用中的缓冲机理，并将有限元方法引入到纸浆模塑材料的强度分析中，对硬盘包装用纸浆模塑盒进行了有限元分析。
The path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.
图的路包装问题是一类有着重要应用背景的最优化问题，然而它在计算复杂度上是NP-困难的。
The path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.
图的路包装问题是一类有着重要应用背景的最优化问题，然而它在计算复杂度上是NP-困难的。
应用推荐