基于效能分析的工程建设投资分配模型研究

分析了基数滚动切块和层次分析-目标规划(AnalyticHierarchyProcessandGoalProgramming)投资分配模型的利弊,探讨了工程建设投资效能的估计方法,研究建立了基于效能分析的投资分配优化模型.该模型经实际算例分析证明,模型的思路清晰,便于理解和操作,具有较好的实用性.     

LFM脉冲雷达距离维快速搜索处理算法

针对脉冲雷达近距离目标遮挡问题,从理论上分析了雷达最小作用距离不受限于脉冲宽度.在此基础上,以Chirp脉冲为例,提出了一种适合远近距离全程目标的快速搜索处理算法.该算法只需发射一种宽脉冲波形,而不必根据距离的变化改变脉宽,从而有效缩短了搜索时间,大大提高了搜索效率.仿真结果表明了理论分析的正确性和算法的有效性.     

拦截高速机动目标的捕获区及微分对策导引律

针对高速机动目标拦截场景,研究末制导段捕获区存在条件及微分对策导引律问题.建立弹目相对运动模型并引入控制动力学模型,采用终端投影方法对相对运动模型进行降阶处理;基于微分对策理论推导一种解析形式捕获区,并具体到直/气复合控制导弹对机动目标的拦截中,该捕获区的存在能够保证对任意机动目标进行准确捕获;重新选取性能指标,将目标...     

实时仿真计算机系统的若干问题

本文比较了实时仿真计算机系统中配备A/D、D/A变换器的两种方案。分析了几种检索算法,并且提出了一种新的全并行检索方法——映象检索。文中论述了仿真计算任务的特点及其并行性的开发。本文在分析了AD-10的缺点之后指出,纯异构型仿真专用多处理机的局限性较大,不能充分开发仿真计算任务的并行性。较好的结构形式应是以同构型多处理机为核心。     

An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems

We consider a two‐echelon inventory system with a manufacturer operating from a warehouse supplying multiple distribution centers (DCs) that satisfy the demand originating from multiple sources. The manufacturer has a finite production capacity and production times are stochastic. Demand from each source follows an independent Poisson process. We assume that the transportation times between the warehouse and DCs may be positive which may require keeping inventory at both the warehouse and DCs. Inventory in both echelons is managed using the base‐stock policy. Each demand source can procure the product from one or more DCs, each incurring a different fulfilment cost. The objective is to determine the optimal base‐stock levels at the warehouse and DCs as well as the assignment of the demand sources to the DCs so that the sum of inventory holding, backlog, and transportation costs is minimized. We obtain a simple equation for finding the optimal base‐stock level at each DC and an upper bound for the optimal base‐stock level at the warehouse. We demonstrate several managerial insights including that the demand from each source is optimally fulfilled entirely from a single distribution center, and as the system's utilization approaches 1, the optimal base‐stock level increases in the transportation time at a rate equal to the demand rate arriving at the DC. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles

Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于非合作博弈的栅栏信息覆盖虚拟节点组合算法

邻近节点通过协作感知和信息融合组成虚拟节点,能够增加信息覆盖栅栏长度.基于非合作博弈模型,设计了一种完全分布式的虚拟节点组合算法DVSF算法.DVSF算法面向栅栏信息覆盖应用,以尽量增加整个网络的信息覆盖栅栏长度为目标,将合适的邻近节点组合成虚拟节点,提升了整个网络的栅栏信息覆盖性能.仿真实验验证了DVSF算法的有效性...     

混合对策无人战机空战决策

在混合对策理论的基础上,将空战过程看作是由一系列离散的状态组成的离散事件动态系统,建立了空战过程的离散状态子模型,利用空战态势指数和战机空战能力指数构造了战术评估函数,以完成对战术动作的筛选工作,并结合3DOF质点模型设计了机动指令生成器,实现对无人机运动状态的控制,并在Matlab环境下对机动实例进行了仿真.     

决策树知识表示的多故障源搜索算法研究

在深入研究产生式规则知识表示的基础上,运用决策树知识表示方法,完成故障诊断专家系统的知识库设计,对传统的单故障源决策树搜索算法进行了改进,解决了相同故障现象的多故障源连续搜索和定位问题,提高了推理机单次故障诊断的定位率和搜索效率,缩短了故障诊断专家系统的诊断时间。