预处理时间的英文

• pre-conditioning time
• pre-vacuum chamber

• "预处理"英文翻译    pretreatment; anticipation; ...
• "时间"英文翻译    time; hour
• "处理时间" 英文翻译 :    cure time; handling time; ht handle time; proce ing time; process time; processing time
• "虚处理时间" 英文翻译 :    virtual processing time
• "总处理时间" 英文翻译 :    overall treatment time; total processing time; total time of treatment
• "地面处理时间" 英文翻译 :    surface handling time
• "放弃处理时间" 英文翻译 :    abandon date
• "炉内处理时间" 英文翻译 :    furnace time
• "平均处理时间" 英文翻译 :    average handling time
• "事务处理时间" 英文翻译 :    transaction time; transbuoy
• "数据处理时间" 英文翻译 :    data processing time
• "信息处理时间" 英文翻译 :    message-processing time
• "虚拟处理时间" 英文翻译 :    virtual processing time
• "业务处理时间" 英文翻译 :    traffic handling time
• "用户处理时间" 英文翻译 :    user handing time
• "整批处理时间" 英文翻译 :    batch session
• "最短处理时间" 英文翻译 :    shortest processing time
• "存储器处理时间" 英文翻译 :    memory processing time
• "最短总处理时间" 英文翻译 :    mtpt minimal total processing time
• "预处理程序时间" 英文翻译 :    preprocessor time
• "每次操作的最小处理时间" 英文翻译 :    minimum processing time per operation
• "批处理时间共用监视器" 英文翻译 :    btm batch time sharing monitor
• "在反射炉内的处理时间" 英文翻译 :    reverberation time
• "最短处理时间, 系统参数表" 英文翻译 :    spt
• "最短处理时间优先策略" 英文翻译 :    shortest processing time first policy

• Influence of water absorption and pre - wetted method of lightweight aggregate on the workability of concrete
  轻集料的吸水率与预处理时间对混凝土工作性的影响
• Due to the simpleness and compactness of meta - information , the time complexities of meta - information based rough set methods is generally lower than their non - meta - information versions . besides , since the meta - information is reusable and can be maintained in a dynamic way , the rough set method can share the same procedure for data pre - processing ( i . e . ,
  另外，由于元信息可以保存并能动态维护，基于元信息的粗糙集方法可以共用相同的数据预处理过程(即元信息生成与维护) ，从而减少了数据预处理时间，提高了效率。
• The conventional ways has low efficiency , which result in the application of overlap grid in moving - grid problem , which need re - disposes the interpolating connection in every step in time direction , is very difficult considering the computational efficiency . aim at the above problem in application of overlap grid , this paper using an new manner rooting in analysissitus to put forward a “ method of distinguishing points of intersection ” and develop corresponding computational soft , which could realize the automatic and shape - independent pre - disposal process for overlap grid . to deal with the problem of low efficiency for pre - disposal process in moving - grid , this paper bring forward the “ mosaic ” method and adt method which based on the huge memory of modern computer
  对于重叠网格在动网格应用中的计算效率问题,本文通过进一步研究插值信息的高速查询方法,提出不同于传统算法思路,以现代计算机大内存为基础,用计算机物理内存空间换计算时间的” mosaic ”方法以及应用基于二叉树数据结构的adt ( alternatingdigitaltree )方法两类方法,成功的将原处理时间提高了两个数量级? ?即将网格规模在百万量级的重叠网格预处理时间从传统方法的耗时30 60分钟提高到几十秒钟,从而成功解决了这一问题。