A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Generation and storage dispatch in electricity networks with generator disruptions

We present methods for optimizing generation and storage decisions in an electricity network with multiple unreliable generators, each colocated with one energy storage unit (e.g., battery), and multiple loads under power flow constraints. Our model chooses the amount of energy produced by each generator and the amount of energy stored in each battery in every time period in order to minimize power generation and storage costs when each generator faces stochastic Markovian supply disruptions. This problem cannot be optimized easily using stochastic programming and/or dynamic programming approaches. Therefore, in this study, we present several heuristic methods to find an approximate optimal solution for this system. Each heuristic involves decomposing the network into several single‐generator, single‐battery, multiload systems and solving them optimally using dynamic programming, then obtaining a solution for the original problem by recombining. We discuss the computational performance of the proposed heuristics as well as insights gained from the models. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 493–511, 2015     

在分离式Hopkinson拉杆实验中确定临界实验条件的经验方法

在分离式Hopkinson拉杆实验中,常常需要获得试样在经历一个拉力脉冲拉断情况下的最低应变率,而在分离式Hopkinson拉杆装置中确定对应最低应变率的发射压力需要进行多次尝试性实验。为了更好地解决这一问题,提出一种简单的经验方法,可以通过一次拉断的实验结果计算出一个拉力脉冲拉断试样需要的最小发射压力及相应的应变率,进一步可以预测不同发射压力下的应变率。对4种铝合金试样进行拉伸实验,结果表明,利用提出的经验方法得到的应变率结果与实验结果吻合较好,可以有效地对发射压力和实验应变率进行预估。     

黏弹性基底上阻尼碳纳米管的动力学特性

采用欧拉梁模型建立了有阻尼碳纳米管在黏弹性基底上的动力学问题分析模型。通过引入非局部理论、广义Maxwell黏弹性模型、速度相依的外阻尼模型及黏弹性基底模型推导出碳纳米管动力学分析的欧拉梁振动控制方程。在Kelvin-Voigt黏弹性模型基础上,分别给出无基底和全基底支撑时碳纳米管固有频率的一般解析表达式,并分析讨论全基底时的多种典型情况。然后利用传递函数方法求解出一般边界条件下振动控制方程的封闭解。以某单壁碳纳米管为例,得到不同边界条件下该单壁碳纳米管的前四阶固有频率,并分析了碳纳米管非局部参数、黏弹性参数、基底刚度及长度等影响因素对固有频率和阻尼因子的影响情况。结果表明,文中所建的动力学分析模型及计算方法对解决碳纳米管在黏弹性基底上的动力学问题准确有效。     

气象条件对武器效能动态评估与微分对策的影响分析

针对气象条件对作战双方武器效能的动态影响问题,基于微分对策思想,构建了包含气象影响因子的作战双方武器对抗的兰彻斯特模型,讨论了不同气象条件对双方武器效能的动态影响。结果表明:气象条件对双方武器效能都有损耗,但由于损耗程度不同,整个战局的态势将向损耗程度较小的一方倾斜;武器效能的固有差距是主要的,但一定的战场大气环境条件可以缩小此差距。     

基于不同叶片数目比的烟气涡轮多叶片通道数值模拟

基于定常假设,利用混合平面模型传递级间参数,运用Fluent软件对不同静动叶片数目比下的烟气涡轮多叶片通道流场进行了数值计算,得到了温度、压力、出口速度和马赫数等参数的变化规律,绘制了不同静动叶片数目比下各种参数的体积加权平均XY图,并通过数值分析确定了静动叶片最佳数目比为50∶74,最佳静叶安装角为35°。结果表明:叶片数目增减和静叶安装角的变化对烟气涡轮整体性能的影响须考虑多种因素,并不能以单一参数的变化来决定最佳叶片数目和静叶安装角。该结论可为烟气涡轮现有装备的科学管理和技术改进提供理论依据。     

Optimal control of noncollaborative servers in two‐stage tandem queueing systems

We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

动态WTA问题的混沌人工鱼群算法

针对不同作战平台上多个武器单元对一批目标进行射击时的武器目标分配问题,建立了该问题的数学模型。采用混沌人工鱼群算法对动态条件下的武器目标分配问题进行求解,并设计一个实例进行仿真实验。仿真结果表明,在时间约束条件下该算法较遗传算法更具优越性,验证了混沌人工鱼群算法用于动态武器目标分配的有效性。     

论人的防御火灾意识的更新

通过分析人的素质、行为和能动作用 ,揭示人类防御火灾意识偏低的原因 ,指出人类要实现人与自然协调发展 ,减少火灾的侵袭 ,就必须提高人的素质 ,规范人的行为 ,发挥人的主观能动作用。