定常态不可逆卡诺热机面积特性

对定常态不可逆卡诺热机进行了有限时间热力学分析.定义了功率、效率和面积比系数,并导出三者的关系式,由此对热机最佳功率、效率和面积特性进行了分析和讨论,给出了一些有益的结论.     

空间谱估计在干涉测角中的应用

提出了一种利用空间谱估计对干涉测角系统进行解算的方法,该方法在多重信号分类(M USIC)算法的基础上,对协方差矩阵的估计、特征值分解、谱峰搜索等计算量较大的步骤进行了改进,提高了运算速度.并根据入射角连续的特点,提出了空域跟踪搜索的算法,进一步减小了计算量,同时提高了解模糊的正确率.     

基于编码序列随机移位的MCPC雷达信号设计方法研究

多载频相位编码信号(MCPC)是近年来备受关注的一种新体制宽带雷达信号,其灵活的信号结构使其具备性能均衡、可调的特点,与此同时对参数设计的要求也相应提高.现有设计方法难以在模糊图和包络控制方面同时取得令人满意的性能,且大多只研究了载频数量较少的情况.针对此问题提出了一种编码序列随机移位的MCPC信号,具备理想的图钉状模...     

Using stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival times

We study a stochastic outpatient appointment scheduling problem (SOASP) in which we need to design a schedule and an adaptive rescheduling (i.e., resequencing or declining) policy for a set of patients. Each patient has a known type and associated probability distributions of random service duration and random arrival time. Finding a provably optimal solution to this problem requires solving a multistage stochastic mixed‐integer program (MSMIP) with a schedule optimization problem solved at each stage, determining the optimal rescheduling policy over the various random service durations and arrival times. In recognition that this MSMIP is intractable, we first consider a two‐stage model (TSM) that relaxes the nonanticipativity constraints of MSMIP and so yields a lower bound. Second, we derive a set of valid inequalities to strengthen and improve the solvability of the TSM formulation. Third, we obtain an upper bound for the MSMIP by solving the TSM under the feasible (and easily implementable) appointment order (AO) policy, which requires that patients are served in the order of their scheduled appointments, independent of their actual arrival times. Fourth, we propose a Monte Carlo approach to evaluate the relative gap between the MSMIP upper and lower bounds. Finally, in a series of numerical experiments, we show that these two bounds are very close in a wide range of SOASP instances, demonstrating the near‐optimality of the AO policy. We also identify parameter settings that result in a large gap in between these two bounds. Accordingly, we propose an alternative policy based on neighbor‐swapping. We demonstrate that this alternative policy leads to a much tighter upper bound and significantly shrinks the gap.     

无源雷达GPS卫星信号模糊函数研究

研究了GPS卫星信号作为照射信号的双基无源雷达信号模糊函数性能,论述了雷达系统结构和信号模型,分析了GPS信号的模糊函数特性,给出了计算机仿真。理论分析和仿真结果表明,GPS信号作为无源雷达照射源具有良好的目标分辨力。     

基于小样本数据的作战计划生成方法

针对部队实兵对抗实验数据生成和采集的投入高、难度大的实际,提出基于小样本数据生成作战计划的方法：首先,采用偏最小二乘回归分析法建立作战因素与作战结果间的多元非线性模型;其次,采用改进的遗传算法,在MATLAB平台编程实现了对模型的整数规划求解,并通过实例验证算法的有效性;最后,利用作战因素的重要性排序分析作战计划的调整流程。     

武器系统模糊寿命周期费用模型

武器系统的寿命周期费用建模较多采用参数法,而参数法中最常用的是最小二乘回归.考虑费用统计数据的模糊性,提出用模糊最小二乘回归来建立武器系统模糊寿命周期费用模型,并结合实例对武器系统寿命周期费用进行了分析.结果表明,这种方法能达到令人满意的拟合精度,具有实用价值.     

基于全寿命周期的舰船喷水推进装置综合保障技术研究

针对舰船喷水推进装置的保障需求,介绍了喷水推进装置的基本组成、技术特点,引入环境特征,使用特征因素,研究喷水推进装置从交装到服役期满的全寿命服役周期的综合保障技术,提出针对喷水推进装置在不同状态、不同时期的保障策略,建立喷水推进装置保障能力体系。     

基于模糊动态层次分析法的军车全寿命费用模型

为研究军车最优的效费比,提出了控制军车装备费用增长的有效途径——全寿命费用管理方法,并通过模糊动态层次分析法建立了分析决策模型,将定性与定量的分析有机结合起来研究军车全寿命费用的变化趋势,有利于提高军车装备的可靠性和决策的科学性,具有较好的应用价值。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010