通用装备机械液压系统综合检测试验平台的设计与研制

针对目前通用装备保障建设过程中存在的保障设备通用性差、综合功能弱、机动性能差及信息化程度低等问题,提出了"划类分组、综合集成、一体通用"的设计思想,研制了可完成军械、装甲、工程、防化、车辆、陆军船艇等装备机械液压系统技术状况检测与评估、故障诊断、部(元)件修后试验与质量评估、信息管理等功能的综合机动平台。重点阐述了平台各系统的设计思想、硬件组成及软件框架。实际应用表明,该平台具有"广谱"、"广域"和"全时"的能力,其推广使用将为通用装备保障由"基于型号"向"基于能力"的建设转型提供成功示范。     

机动条件下的公共计算平台研究

针对未来战术机动系统的作战要求,利用面向服务技术体制(SOA),结合段集成机制,提出了构建机动系统的轻量级公共计算平台。平台从层次上划分为系统服务层、核心服务层、基础服务层和公共应用服务四个层次,每个层次通过编程接口向上层提供服务,以支持机动系统的动态演化、灵活配置、动态部署与系统间的互操作和信息共享。     

实时仿真系统体系结构设计的一般方法

针对目前文献中关于实时仿真系统的设计方案大多是围绕某个具体的任务而展开,缺乏一般性指导意义的问题,文中从实用的角度,提出了两种流行的实时仿真系统——集中式实时仿真系统和分布式实时仿真系统的总体方案,对方案的硬件结构、软件组成、优缺点、应用范围等进行了详细分析,这两种方案涵盖了目前常用的实时仿真系统的基本体系结构,对实时仿真系统设计人员具有实际参考价值。     

Lipschitz非线性系统状态观测器设计新方法

针对Lipschitz非线性系统状态观测器,提出了一种以极小化条件数为目标准则的新的设计方法。运用梯度下降法和Slyvester方程,计算极小化条件数,优化增益矩阵和最大允许Lipschitz常数,完成观测器设计。通过同其它文献的算例比较,结果发现按文中方法设计的观测器具有迭代次数少、优化结果好的特点。     

预警探测体系作战效能评估框架

首先阐述了预警探测体系及其效能评估的概念,根据预警探测体系及其作战任务的特点,建立了效能评价指标体系,并给出了部分效能指标的评估计算模型,最后提出了预警探测体系作战效能评估的框架和一般过程.     

On the application and extension of system signatures in engineering reliability

Following a review of the basic ideas in structural reliability, including signature‐based representation and preservation theorems for systems whose components have independent and identically distributed (i.i.d.) lifetimes, extensions that apply to the comparison of coherent systems of different sizes, and stochastic mixtures of them, are obtained. It is then shown that these results may be extended to vectors of exchangeable random lifetimes. In particular, for arbitrary systems of sizes m < n with exchangeable component lifetimes, it is shown that the distribution of an m‐component system's lifetime can be written as a mixture of the distributions of k‐out‐of‐n systems. When the system has n components, the vector of coefficients in this mixture representation is precisely the signature of the system defined in Samaniego, IEEE Trans Reliabil R–34 (1985) 69–72. These mixture representations are then used to obtain new stochastic ordering properties for coherent or mixed systems of different sizes. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

微弱正弦信号在有噪声的FN神经元模型中的传输特性研究

长期以来弄清神经系统中的信号是如何传输的一直是广大研究人员努力的目标.针对一种被普遍研究的神经元简化模型--FitzHugh-nagumo(FN)模型,采用二阶随机龙格-库塔算法分析了该模型对加性噪声和微弱正弦信号的响应特性.时域和频域的统计参数表明适当强度的噪声有利于信号的传输,存在随机共振现象,即与噪声强度关联的输出信噪比曲线为倒钟形;另外值得关注的是,与正弦信号频率关联的输出信噪比曲线也为倒钟形,分析可见正弦信号的无量纲频率在区间0.2～0.8时模型的输出信噪比最大,表明该神经元模型有频率敏感性,即更易于检测到该范围内的弱信号.上述结果与生物学的发现是一致的,将有助于进一步揭示周期信号在神经元中的传输方法,建立更加准确的神经元数学模型.     

Factors that affect the optimal amount of central control in complex systems

Whereas much of the previous research in complex systems has focused on emergent properties resulting from self‐organization of the individual agents that make up the system, this article studies one vital role of central organization. In particular, four factors are conjectured to be key in determining the optimal amount of central control. To validate this hypothesis, these factors are represented as controllable parameters in a mathematical model. For different combinations of parameter values, the optimal amount of central control is found, either analytically or by computer simulation. The model is shown to provide results that match well with the level of control found across a broad spectrum of specific complex systems. This model also provides general guidelines as to how combinations of these factors affect the desirable level of control and specific guidelines for selecting and evaluating leaders. These results indicate that all of these factors, though not exhaustive, should be considered carefully when attempting to determine the amount of control that is best for a system. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010