基于CFD的磁射流抛光去除机理分析

应用计算流体动力学(CFD)方法分析了一种新型精密抛光技术——磁射流抛光的材料去除机理。磁射流抛光中,含有磨料的磁流变液射流被喷嘴出口附近的局部外加纵向磁场磁化,产生准直的硬化射流束来进行相对远距离的精密抛光。介绍了磁射流抛光的原理和实验装置,分析了磁流变液聚束射流的形成,通过一系列定点抛光实验研究了磁射流抛光工艺的材料去除分布特征,利用计算流体动力学的方法分析了垂直冲击和倾斜冲击情况下,磁流变液射流与工件表面相互作用时径向流场功率密度的分布特征。实验结果和仿真计算结果表明:磁流变液射流在工件表面径向扩展流动产生的径向剪切作用导致了材料去除;CFD方法能模拟抛光区去除率的三维分布,因此可以准确地预测抛光区形状。     

单晶硅反射镜激光能量吸收系数与衬底表面质量的关联

高能激光系统中,单晶硅基底反射镜的能量吸收系数是影响系统性能的关键指标。衬底加工质量对镀膜后元件激光能量吸收系数影响显著。通过测试不同衬底粗糙度、划痕密度的单晶硅反射元件,分析衬底表面典型加工特征(粗糙度、划痕)对激光能量吸收系数的影响规律,认为粗糙度与吸收系数正相关,粗糙度均方根从0.668nm降低至0.345nm会使吸收系数降低28.0%。少量划痕对吸收系数的直接影响并不明显,吸收系数均值变化在3.1%以内。但表面划痕会诱发激光损伤,划痕密度较大时会引起后续能量吸收持续增大,辐照400s后,吸收系数较辐照100s时增大18.3%。     

高超声速乘波飞行器三维流场的并行数值模拟

针对高超声速乘波飞行器三维绕流流场,在基于LINUX+MPI系统的分布式并行计算平台上,并行求解了三维雷诺平均的N-S方程。并行数值方法采用的是有限体积方法(FVM)、OC-TVD差分格式、B-L代数湍流模型及流场分区的并行方法。计算结果表明,所采用的并行数值模拟方法能够求解包含强激波的流场,激波穿越区域边界时无断层、错位等通量不守恒的现象。并行计算效率高,8个处理机计算时的并行加速比达到了6 8。     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

结合流形滤波的矩阵信息几何检测器

针对小样本、非均匀杂波下的信号检测问题,提出一种基于流形滤波的矩阵信息几何检测器,将信号检测问题转化为矩阵流形上的几何问题。将每一个样本的相关性数据建模为一个托普利兹正定矩阵,在此基础上,利用每一个样本数据的邻近矩阵进行加权平滑滤波,去除一部分杂波能量,提升目标与杂波间的区分性。计算了辅助样本数据对应矩阵的几何均值,通过比较待检测样本数据矩阵与几何均值矩阵之间的距离与检测门限的大小,以实现信号检测。实验结果表明,与自适应匹配滤波相比,本文方法在小样本、非均匀杂波下具有明显的性能优势。     

超精密加工机床及其新技术发展

介绍了超精密加工技术、应用背景、发展动向以及超精密加工关键技术的一些最新成果。从超精密加工技术推广应用的角度阐述了其精度目标、模块化、廉价化发展趋势 ,同时就如何发展超精密加工技术全面介绍了目前机床模块化部件、传动系统、检测环节、数控系统和环境控制等领域的最新研究水平和成果。     

超声速扩压器中激波串结构的数值模拟

通过求解由BL湍流模型封闭的二维、轴对称及三维雷诺平均N S方程 ,数值模拟了等截面超声速扩压器中由激波 /附面层干扰诱导的复杂流场 ,比较了二维直管、圆截面直管及三维矩形截面直管中的流场特性、激波串长度及压强恢复程度。在来流马赫数为 3 0的二维直管计算中 ,采用四步Runge Kutta显式方法数值仿真了激波串自激振荡过程 ,并与实验结果作了对比分析     

Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

高超声速横向喷流的三维数值模拟

采用有限体积法,结合半隐的Harten TVD格式和Baldwin Lomax代数湍流模型,求解了三维全N S方程,计算了超声速气流干扰流场,并与实验数据进行了比较,模拟清晰地捕捉到喷流附近复杂波系结构和旋涡结构,并且显示出了弹体表面受到喷流影响的区域,说明横向喷流干扰对弹体影响非常大。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001