一种基于扩展控制流图的DA交互结构表示方法

程序控制流图不能表示DA交互发生点处实际执行的SQL语句,因而不能清晰地表示出程序数据库的交互过程。针对该问题提出了用有限状态自动机表示DMLSQL语句,根据自动机的运行过程确定交互语句使用或定义的数据对象,并利用此信息生成表示交互语句的结点,以扩展CFG。实验表明,经过扩展后的ECFG能够直观地表示DA程序中与数据库的交互结构。     

一种基于导航点的航天器相对运动轨迹生成策略

针对圆(近圆)轨道航天器相对运动的固定时间状态转移问题,提出了一种基于导航点的多脉冲优化轨迹生成策略.从相对运动动力学出发,应用最优控制理论给出了基于连续推力的最优转移轨线,将引入的导航点限定在最优转移轨线上得到其位置参数;然后利用导航点位置参数建立了脉冲约束下的基于脉冲的优化轨迹生成模型,采用二次规划算法求解,通过改变导航点位置和脉冲间隔优化轨迹.仿真算例验证了策略的有效性.     

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016     

Optimal staffing in nonstationary service centers with constraints

This paper considers optimal staffing in service centers. We construct models for profit and cost centers using dynamic rate queues. To allow for practical optimal controls, we approximate the queueing process using a Gaussian random variable with equal mean and variance. We then appeal to the Pontryagin's maximum principle to derive a closed form square root staffing (SRS) rule for optimal staffing. Unlike most traditional SRS formulas, the main parameter in our formula is not the probability of delay but rather a cost‐to‐benefit ratio that depends on the shadow price. We show that the delay experienced by customers can be interpreted in terms of this ratio. Throughout the article, we provide theoretical support of our analysis and conduct extensive numerical experiments to reinforce our findings. To this end, various scenarios are considered to evaluate the change in the staffing levels as the cost‐to‐benefit ratio changes. We also assess the change in the service grade and the effects of a service‐level agreement constraint. Our analysis indicates that the variation in the ratio of customer abandonment over service rate particularly influences staffing levels and can lead to drastically different policies between profit and cost service centers. Our main contribution is the introduction of new analysis and managerial insights into the nonstationary optimal staffing of service centers, especially when the objective is to maximize profitability. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 615–630, 2017     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

相控阵雷达LPI搜索方法研究

相控阵雷达可通过合理配置工作参数优化其性能。针对相控阵雷达在搜索目标时易受敌方电子侦察设备威胁的现实,研究了在保持搜索能力的同时,通过合理配置参数降低截获概率的问题。分析了影响相控阵雷达搜索状态LPI(Low Probability of Intercept)性能的主要因素,建立了截获概率模型与搜索能力模型,给出了3种参数调整策略。仿真试验验证了模型的有效性,并比较了3种策略的优劣。     

演化排列优化拉丁超立方设计方法

拉丁超立方设计是最常用的计算机试验设计方法之一,针对现有拉丁超立方设计方法采样一次性且难以兼顾设计的空间均匀性和计算效率的问题,提出了一种演化排列拉丁超立方试验设计方法。通过对小样本设计的演化、排列信息继承和扩充等操作,以较小的计算量实现了样本的扩充与优化。此外,所提方法可以兼顾现有样本和新增采样点之间的关系,实现样本的序列扩充,这在实际近似建模过程中十分方便。通过多组数值试验,验证了本文方法在空间均匀性和计算效率等方面的优越性。     

小口径舰炮对空虚拟校射校正量的最优估计

首先建立了小口径舰炮对空虚拟校射脱靶量的观测方程,分析了脱靶量的统计性质,在此基础上推导出校正量的最优估计量,并用仿真结果验证了结论的正确性。     

India’s emerging space assets and nuclear-weapons capabilities

ABSTRACT

Over the last five decades, India’s nuclear and space programs have gone through several phases, from collaboration to divorce to supportive. An interplay of two factors determined the nature of the relationship. One was the state of India’s nuclear-weapon program. The second was international conditions, especially India’s relationship with the nuclear-nonproliferation regime. In the early decades, because of the rudimentary nature of India’s nuclear and space programs, the relationship was collaborative, since the rocket technology being developed was a necessary adjunct to the nuclear-weapon program. Subsequently, as India’s rocketry capabilities and nuclear-weapon program began to mature and concerns about international sanctions under the non-proliferation regime began to grow, the two programs were separated. The Indian rocketry program was also divided, with the civilian-space and ballistic-missile programs clearly demarcated. After India declared itself a nuclear-weapon state in 1998 and the programs matured, the relationship has become more supportive. As the two programs mature further, this relationship is likely to deepen, as the nuclear-weapon program requires space assets to build a robust and survivable nuclear deterrent force.