自适应二阶滑模制导律

传统基于Lyapunov定理所设计的制导律无法保证制导系统的有限时间收敛.基于滑模控制理论,给出了一种二阶滑模有限时间收敛方法,并将该方法与机动目标拦截情形相结合,进行制导律的设计.该制导律首项使得视线转率趋于0,而扩展项可满足视线成型,滑模面的有限时间收敛等特性.针对2种典型的目标机动形式进行了仿真研究,结果表明该滑模制导律可以实现目标的有效拦截,满足上述特性.     

限时图形系统的限时计算和渲染技术

在介绍了限时图形系统概念模型的基础上 ,指出限时渲染也是限时图形系统的一个基本特征 ,并从软、硬件两个方面对当今国内外采用的一些典型的提高实时图形渲染性能的技术和方法进行了明确的分类和阐述 ,提出了根据模型特点选用适当渲染技术的思想     

关于有限时间热力学的最小熵产生最大值原则

本文力图从能表征状态的热力学参数熵的变化中找到有关有限时间热力学新的分析方法,提出了工作参数选择的最小熵产生最大值原则。这个原则揭示了有限时间热力学以时间为基础的“率”与非平衡热力学熵产生间的内在联系。据此,我们便可得到正、反向内可逆卡诺循环的最佳工作参数。为有限时间热力学的普遍应用研究提供了一新的线索。     

STCN的对岸打击时间协同冲突消解研究

为验证航空兵对岸打击中时间协同计划的可行性以及快速地调整时间协同计划,建立了任务间的简单时间约束网络(STCN),并转化成权值矩阵的形式.根据权值矩阵特点,提出了一种检测STCN一致性的权值矩阵法,大大降低了算法复杂度.为加快时间协同计划的调整速度,基于检测结果,提出了一种代价最小的冲突消解方法,避免了消解过程中的重复检测问题,提高了效率,使计划调整更加快捷高效.     

Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time

In this article, we study a queueing system serving multiple classes of customers. Each class has a finite‐calling population. The customers are served according to the preemptive‐resume priority policy. We assume general distributions for the service times. For each priority class, we derive the steady‐state system size distributions at departure/arrival and arbitrary time epochs. We introduce the residual augmented process completion times conditioned on the number of customers in the system to obtain the system time distribution. We then extend the model by assuming that the server is subject to operation‐independent failures upon which a repair process with random duration starts immediately. We also demonstrate how setup times, which may be required before resuming interrupted service or picking up a new customer, can be incorporated in the model. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Timely exposure of a secret project: Which activities to monitor?

A defender wants to detect as quickly as possible whether some attacker is secretly conducting a project that could harm the defender. Security services, for example, need to expose a terrorist plot in time to prevent it. The attacker, in turn, schedules his activities so as to remain undiscovered as long as possible. One pressing question for the defender is: which of the project's activities to focus intelligence efforts on? We model the situation as a zero‐sum game, establish that a late‐start schedule defines a dominant attacker strategy, and describe a dynamic program that yields a Nash equilibrium for the zero‐sum game. Through an innovative use of cooperative game theory, we measure the harm reduction thanks to each activity's intelligence effort, obtain insight into what makes intelligence effort more effective, and show how to identify opportunities for further harm reduction. We use a detailed example of a nuclear weapons development project to demonstrate how a careful trade‐off between time and ease of detection can reduce the harm significantly.     

q∝△(T~(-1))传热时三热源热泵的最优性能普遍关系

本文导出工质与三个热源间的传热系数分别为。α、β和γ,传热规律为q~∝△(T~(-1))时,内可逆三热源热泵的最佳供热系数ψ与供热率Π间的关系:ψ<1时,Π=K_1ψ[T_p(T_H-T_ο)-T_H(T_p-Tο)ψ]/[T_HT_pT_ο(1-△_1ψ)~2];ψ>1时,Π=K_2ψ[T_p(T_H-T_ο)-T_H(T_P-T_ο)ψ]/[T_HT_pT_ο(△_2-ψ)~2];式中,K_1=αγ/(α~(1/2)+γ~(1/2))~2,K_2=βγ/(β~(1/2)+γ~(1/2))~2,△_1=(α/β)~(1/2)(β~(1/2)-r~(1/2)/(α~(1/2)+γ~(1/2)),△_2=(β/α)~(1/2)(α~(1/2)-γ~(1/2))/(β~(1/2)+γ~(1/2))。由此可得许多有用的关系。     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

一种基于周期分区的时间调度算法

针对多功能相控阵雷达任务实时调度问题,提出了一种基于采样周期分区的时间资源调度算法(记为PD)。该算法以各类任务采样周期的最大公约数为分区标准,将各采样周期均分为多个等长区间,再将各类任务平均分配到不同分区中调度执行,可解决调度过程中任务因采样周期不同产生冲突的难题。仿真结果表明,该算法可提高系统任务调度能力,可广泛应用于相控阵雷达任务调度及其他实时任务调度系统。     

提取时间对硝基油漆稀料燃烧产物鉴定的影响

油漆稀料是一种常见的助燃剂,提取时间对其燃烧产物的鉴定会有一定的影响。选取了纯毛织品作为实验载体,以硝基油漆稀料为研究对象,对燃烧残留物及燃烧烟尘进行了系统的GC-MS分析,找出了纯样和加载油漆稀料后燃烧产物主要成分的变化规律,对样品中目标化合物的相对峰面积随燃烧产物提取时间的变化曲线进行了非线性数学分析,初步找出了样品燃烧产物的相对峰面积随硝基油漆稀料燃烧产物提取时间变化的规律,为合理选择物证的提取时间提出了建议。