机械系统可靠性设计若干问题探讨

机械系统的可靠性设计是当前可靠性工程界面临的热点和难点问题之一,从分析机械系统可靠性设计的特点和难点入手,探讨了机械系统可靠性建模、分配、预计等机械系统可靠性设计中急需解决的关键问题。     

突防过程的组网雷达干扰资源优化分配

以组网雷达融合中心检测概率为目标函数,建立针对组网雷达系统的干扰资源优化分配模型.并进一步指出该模型运用于飞行器突防时,其不足之处在于"以点带面",以飞行器突防过程中某一点的融合中心检测概率代替整个突防过程时,该评估方法损失过程中的大量信息.在此基础上充分利用突防过程的信息,提出以"融合中心检测概率加权积分"为目标函数,建立基于突防过程的干扰资源优化分配模型.仿真结果表明具有一定的指导意义.     

基于改进MADM算法的防空兵群阵地优选模型

防空兵群阵地选择是防空兵力部署的一个重要环节,对实施防空作战发挥着重要的影响和作用。分析了影响防空兵群战斗队形配置地域选择的相关因素,确定了配置地域优选的指标体系,并结合多指标评判方法与优化理论,运用改进的MADM算法,建立了防空兵群配置地域方案选择的模型。     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function

We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

不可预见作战下排弹抢修力量编配分析

在资源有限的情况下,综合考虑某一区域不同机场之间的相互关系,从整体的角度合理分配排弹抢修资源,可以大幅提升区域内军队机场阵地的战场排弹抢修能力。本文通过建立数学模型,从整体的角度出发,分析区域内各机场的排弹抢修资源分配问题：首先,针对不可预见作战带来的新挑战,提出了新的机场排弹抢修作业流程,引出排弹抢修力量分配所面临的几个现实问题;其次,为解决提出的问题,建立计算排弹抢修时间的数学模型;最后,利用建立的模型依次对上述问题进行分析,并给出排弹抢修资源编配与力量建设的建议。本研究认为,军事机场排弹抢修力量应根据机场特点,合理分配排弹抢修资源;要以机场排弹抢修力量为主导,以外部支援力量为辅助,提升机场自身排弹抢修能力;可通过建设排弹抢修物资仓库和设置排弹抢修支援小组,提升多机场联动的排弹抢修能力。     

准最优增量搜索效率分析

在对极限搜索圆进行特殊分割的条件下,导出准最优增量搜索和准最优总量搜索发现目标概率的计算公式,并通过对搜索力变化时两种发现概率的比较,得出了准最优增量搜索优于准最优总量搜索的重要结论.     

并行面向对象数据库中的数据放置

针对并行面向对象数据库的特点,结合异步并行查询执行策略,提出了一种基于对象类的混合式数据放置策略,它包括两个部分:混合式数据划分策略和基于对象类的数据分配策略     

伺服机构故障下基于线性规划的运载火箭姿控系统重构控制

发动机伺服机构故障给新一代运载火箭姿控系统的可靠性和安全性带来挑战,亟须开展重构控制策略研究。针对这一问题,提出一种基于线性规划的摆角重构控制分配方法。将伺服机构故障下的摆角分配问题转化为1范数单目标有约束优化问题,进而转化为标准的线性规划模型,采用单纯形法进行求解。仿真结果表明,所提出的线性规划法能够实现伺服机构故障下姿控系统的完全重构,各摆角均未达到饱和值,表明了方法的有效性。     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017