分布函数充要条件的另一种证明

对函数F(x)为分布函数的充要条件进行了证明:必要性的证明直接采用概率论中传统的证法;而充分性的证明则从随机变量特征函数φ(t)出发,利用特征函数的充要条件来证明分布函数F(x)的充分条件,从而避开了用实变函数中的测度理论证明充分性的传统证法。为分布函数充分条件的证明提供了一种比较简单和实用的证明方法。     

基于改进遗传算法的空舰导弹火力分配方法

描述了空舰导弹火力分配问题,建立了火力分配优化模型。在此基础上,提出了一种采用十进制部分编码策略与动态调节交叉、变异概率相结合的改进遗传算法,将其用于火力分配优化模型的求解,通过仿真分析与算例比较,证明该算法在运算速度和寻优能力上比标准遗传算法和传统搜索算法强,可为制定空舰导弹作战指挥自动化决策提供参考。     

Technical note: An improved range chart for normal and long‐tailed symmetrical distributions

The distribution of the range of a sample, even in the case of a normal distribution, is not symmetric. Shewhart's control chart for range and other approximations for range from skewed distributions and long‐tailed (leptokurtic) symmetrical distributions assume the distribution of range as symmetric and provide 3 sigma control limits. We provide accurate approximations for the R‐chart control limits for the leptokurtic symmetrical distributions, using a range quantile approximation (RQA) method and illustrate the use of the RQA method with a numerical example. As special cases, we provide constants for the R‐chart for the normal, logistic, and Laplace distributions. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

高技术条件下炮兵作战火力优化模型

由于能给敌军造成大量的毁伤 ,炮兵被誉为“战争之神”。但是 ,由于可得到的炮兵部队数量、弹药和时间所限 ,炮兵不可能对战场所有可得到的目标射击。炮兵必须决定哪些目标可用炮兵射击 ,以及如何射击。考虑到未来战场将充斥着大量目标 ,炮兵要求使用一种自动目标处理系统。将提出一个炮兵优化模型 ,模型的目的是快速对目标价值排序 ,然后以最佳的炮兵兵力、火力分配对选择的目标进行射击。     

被动传感器融合检测系统的优化分布密度

被动传感器由于采用无源探测,而且制造成本低,体积小,在战场环境中将采用并配置大量的被动传感器来检测目标.不论是主动还是被动式传感器,在实际应用中均存在资源优化配置问题.针对被动传感器的具体应用模型,采取了若干合理近似,得到了在"OR"融合检测条件下,基于最大检测概率的被动传感器优化配置密度计算公式.     

充气式返回舱化学非平衡仿真分析

采用空气五组分模型对充气式返回舱的气动特性进行了化学非平衡数值模拟研究,考察了返回舱外形变化对流场温度和压力的分布以及壁面热流密度和压强的影响,分析了流场中组分分布情况。研究结果表明,外形变化在总体上对返回舱流场特性影响较小,会使舱体壁面处的热流密度有所增加;对流场组分分布的研究发现,由于N₂比O₂更难解离,在整个流场中N的摩尔分数远低于O的摩尔分数;在目前的计算条件下,沿轴线和壁面的氮氧比与来流基本保持一致。仿真结果在总体上与实验结果符合较好,验证了仿真模型的可靠性。     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.     

地空导弹群火力优化分配模型

地空导弹群火力优化分配是对多批空中目标分别选择最有效的地空导弹火力单元进行拦截,形成最佳兵力、兵器使用方案,它是地空导弹武器指控系统的一项重要功能。从研究地空导弹群火力优化分配过程出发,建立了地空导弹拦截适宜性检查模型、射击优先度指标计算模型和火力分配方案优化模型,为仿真地空导弹群火力优化分配过程提供了模型依据。     

可靠性强化试验通用夹具研究

针对可靠性强化试验中全轴随机振动试验的通用夹具问题展开研究,首先提出了基于全轴随机振动环境多轴非比例加载、非高斯幅值分布、宽频带等特性的全新夹具设计要求,然后通过理论分析得出了夹具设计的一般原则,最后设计实现了一种可靠性强化试验通用夹具,并对该夹具进行了测试验证.全轴随机振动试验的夹具设计是可靠性强化试验在工程应用中的关键技术,该文的研究可以为可靠性强化试验的推广应用提供广泛借鉴.