短路故障的测试产生方法

在PCB上,两个不相邻的芯片管脚或引线发生短路是实际应用当中最常见的故障。通过分析固定型故障和桥接故障之间的关系,给出桥接故障测试序列产生的系统计算方法。该方法已应用在一个PCB故障测试系统中。     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

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

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

水下航行体惯性类水动力系数的计算方法

为了系统地计算水下航行体全套惯性类水动力系数,提高计算效率和计算精度,通过基于无粘模型的计算方法对水下航行体的运动进行了预报;通过UDF及动网格技术,对匀速运动和匀加速运动的SUBOFF模型进行了分析.设计了单方向速度线性变化的匀加速直线运动和匀加速回转运动,并通过换算和数值拟合处理得到了潜艇所受的惯性力和惯性类水动力系数.该系数与试验误差保证在6％之内,验证了所提方法的可行性及准确性.     

连续求解样本协方差矩阵迹的快速递推算法

为解决当样本数据不断增加时,利用传统方法反复计算样本协方差迹耗时多的缺点,提出了一种快速递推算法。理论分析和仿真试验都表明,算法的时间复杂度比传统的方法降低了一个数量级,从而大大减少了计算时间。     

固-液旋流分离器结构优化模拟研究

采用计算流体力学方法与流体动力学分析软件Fluent,探讨了固-液旋流分离器的溢流口直径、锥角、圆柱段长度和入口直径等主要结构参数对其颗粒溢流率的影响,并在此基础上进行结构参数的优化。结果表明,锥角、圆柱段长度和入口直径过大或过小都不利于旋流分离器的固液分离,均存在一个最佳值。对于主直径为75 mm的单锥双入口固-液旋流分离器,最佳圆柱段长度为87.0 mm,最佳入口直径为16.0 mm,最佳溢流口直径为16.5 mm,最佳锥角为6.0°。     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

原始变量守恒形式控制方程的时间准确性分析

基于压力、速度和温度的原始变量为自变量的守恒形式的控制方程可应用于定常流动问题，但是在求解非定常问题，例如某一典型激波管问题时，激波后温度出现过冲现象，即使通过细化网格、提高空间格式精度或者换用其他通量格式仍不能消除，这表明误差可能来自该方法本身。采用一维Euler方程对该方法进行数值分析。分析结果表明，数值误差来自时间项。通过构造相应的双时间步方程，虚拟时间项采用原始变量，而物理时间项采用守恒变量，并在两个相邻物理时间步内作为定常问题求解，可以收敛到相应的守恒形式，消除上述误差，得到准确的非定常数值解。     

穿甲弹对自行火炮易损性分析与计算

分析了自行火炮在穿甲弹作用下的易损性,建立了自行火炮易损性计算模型,并以某型自行火炮为例,分别计算了该炮在120mm穿甲弹正面命中与侧面命中时的毁伤概率。     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000