大数据时代方法理论研究初探

当前对于大数据时代的到来并无太大争议。但是,对于大数据方法理论的研究,仍处于起步阶段。作为重“利”轻“理”的商业领域,主要任务是从大数据价值挖掘中获利。虽然有人从商业创新、思维创新、科技创新和社会透明等角度,阐述了对大数据问题的认识,但并未将认识上升到一般研究的方法理论层面。这就出现了一种矛盾——虽然提出了“大数据时代”,但是并未给这个时代提供普遍意义上的大数据研究方法理论。     

双舰编队协同制导防空作战的动态拦截排序问题

针对双舰编队协同制导作战条件下如何对空袭目标进行排序这一问题,依据作战时间给出了排序算法。首先对平台的作战时间进行分析和求解,将射击周期分成了2段,把静态拦截排序问题转化为了2台处理机的同顺序作业排序问题,然后根据输入信息的改变而不断调整空袭目标的顺序以解决动态拦截排序问题,最后在想定条件下仿真计算,结果表明该算法具有较好的适用性。     

Operations sequencing for a multi‐stage production inventory system

This article studies operations sequencing for a multi‐stage production inventory system with lead times under predictable (deterministic) yield losses and random demand. We consider various cases with either full or partial release of work‐in‐process inventories, for either pre‐operation or post‐operation cost structures, and under either the total discounted or average cost criteria. We derive necessary and sufficient criteria for the optimal sequence of operations in all cases. While the criteria differ in their specific forms, they all lead to the same principal: those operations with (1) lower yields, (2) lower processing costs, (3) longer lead times, and (4) lower inventory holding costs should be placed higher upstream in the system.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 144–154, 2014     

运用速度增益制导实现对目标卫星的拦截

本文对运用速度增益制导实现对目标卫星的拦截方法进行了研究。其特点是在拦截器运动参数初值及目标轨道参数给定的条件下,首先确定考虑地球扁率J_2项影响下的拦截目标的预测命中点,然后采用Lambert方法确定给定碰撞时间下拦截器的需要速度,最后实现对目标的拦截。用该方法可保证向未制导转换时有较高精度的转换条件。     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

天线波束对飞机射频隐身性能的影响分析

射频隐身是新一代军用飞机必须具备的重要能力。从隐身飞机的实际使用环境出发,针对以往只考虑个体对抗特性,采用Schleher截获因子评价飞机射频隐身性能的不足,提出了基于整体对抗特性,采用联合截获概率评估射频隐身性能的新方法,为射频隐身研究提供了新思路。通过对隐身飞机的射频使用环境建模,计算了天线波束的空、地覆盖区大小,结合联合截获概率的定义和计算方法,仿真了不同情况下天线波束宽度对联合截获概率的影响。根据仿真结果,分析了天线波束对飞机射频隐身性能的影响,其结论可为隐身飞机天线设计时的折中考虑提供基础和参考依据。     

舰艇编队对空防御队形优化配置模型

分析了海上机动编队中防空舰的位置配置对舰艇编队拦截目标效果的影响,通过舰艇对来袭目标拦截概率的推导,建立了被掩护舰的生存概率模型,从而提供了一种解算编队防御队形最佳配置的方法。     

末制导段比例导引法的改进

为了消除比例导引法末制导段的各种干扰因素,抑制法向过载的跳动,基于广义卡尔曼滤波多步估计理论,提出了将拦截导弹直接向瞬时遭遇点导引的末制导导引方法,并进行了计算机仿真.仿真结果表明,该方法可以明显消除或减小末制导段比例导引律的各种干扰因素,抑制法向过载的跳动,改善末制导的弹道特性,减小脱靶量,缩短拦截时间.     

基于高斯伪谱法的弹道跟踪制导律

针对拦截临近空间高超声速飞行器的弹道跟踪过程，设计了一种基于高斯伪谱法的跟踪制导律。为了对标称弹道进行精确跟踪，基于线性二次型跟踪问题，应用最优控制理论推导最优解的充要条件，得到带时变增益的线性状态反馈控制量的表达式；基于高斯伪谱法，在离散的勒让德-高斯(LG)点上利用标称弹道数据计算差分矩阵和系数矩阵，求得状态扰动反馈控制律。仿真结果表明，该方法能够快速、有效的消除跟踪误差，满足在线实施要求。     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017