A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

抛物线用作雷达阵地地面有效反射区曲线

讨论了传统的米波雷达地面有效反射区和粗糙地面的选择条件,提出采用抛物线作为地面反射区曲线,并给出曲线公式,各反射点的反射波在主要方向同相叠加增加了探测距离,进一步挖掘了米波雷达的威力潜力;合理选择反射区曲线的长度,可减少近地物反射的杂波,提高低空目标的探测能力。     

电磁场的对称性与左性电磁波

根据对称性原理，在假设磁单极存在条件下，对Maxwell方程的不对称性进行了改进推导，提出与右性电磁波相对称的左性电磁波，讨论左性电磁波出现的必然性、产生方法及其主要特性。     

横向效应增强型弹垂直侵彻薄靶的轴向剩余速度理论分析

为了得到横向效应增强型弹（Penetration with Enhanced Lateral Efficiency projectile, PELE）对金属薄靶垂直侵彻后的弹体轴向剩余速度，运用平面冲击波理论，对PELE的侵彻机理进行分析。参照平头弹体对靶板的侵彻模型，将PELE侵彻过程中的能量损失划分为以下几个部分：外壳体和内芯撞靶区域对应的环形塞块获得的能量、冲击波作用下弹体的内能增量以及剪切耗能等。然后根据能量守恒原理，得到PELE垂直侵彻金属薄靶后的PELE弹体轴向剩余速度的理论模型。为了验证该模型的合理性和准确性，设计相应的试验进行验证。结果表明，不同条件下得到的试验结果和理论模型得到的计算结果均吻合得较好。因此，得到的PELE垂直侵彻薄靶的轴向剩余速度理论模型可为工程应用提供指导和参考。     

基于混沌振子列的微弱舰船轴频电磁场信号频率检测

针对远程探测频率未知的舰船轴频电磁场这一难题,提出了一种基于混沌振子列的微弱信号频率检测方法,通过该方法能有效地将强复杂背景噪声下的微弱轴频电磁场的频率检测出来.然后,讨论了不同阻尼比对系统性能的影响,并通过对比分析得出最优阻尼比.最后,用该方法对舰船轴频电磁场信号进行处理,结果证明了该方法的有效性.     

使用双水压传感器抗风浪干扰原理

提出了在水雷上使用双水压传感器的设想.传统水雷只使用一个水压传感器,提供的信号信息稍嫌不足,给水压引信抗风浪干扰带来了限制.通过使用两个传感器,利用海浪水压场传播时在两个传感器上的时延信息,使用抵消方法压制海浪水压信号.初步分析表明,使用双传感器可以使水压引信抵抗一定的海浪水压信号的干扰.     

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     

分层介质系统声透射问题的传递矩阵方法

分层介质中的声透射问题一直是应用声学中的一个棘手问题 ,因为随着层数增加 ,需要求解的方程数目也成比例地增加 ,要按常规方法得到解析表达式几乎不可能 .该文引入传递矩阵的概念使这一问题变得相当简单 ,而且可以很方便地用于程序化处理 ,对于吸声材料的结构设计具有很大的实用价值 .     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998