实际系统输出的确定

在实际测试中,系统存在有非线性.同时,还有测量噪声及非测量输入引起的系统输出。这些因素都对系统的输出产生影响。把这些因素均假设为系统的非线性,利用理想线性系统和相干函数,推导出了实际系统输出,同时讨论了用这种方法提高载荷识别精度的问题。     

基于NNLI技术的齿轮箱故障诊断

将NNLI技术应用到齿轮箱的故障诊断中,提出了基于NNLI的特征提取方法,并将该方法与神经网络结合起来,进一步提出基于NNLI特征提取的神经网络故障诊断方法,给出了两种不同的网络分类器,通过齿轮箱故障诊断实例验证了该方法的有效性。     

防空导弹武器系统的信息处理与通信延迟建模

对武器系统中的信息处理功能单元及其之间的信道通信从时间延迟的角度进行了建模,以便能更好地仿真整个武器系统的功能,并以某防空武器系统为例,对其各处理功能单元及其通信信道的时间延迟模型进行了描述。     

基于矩阵分析的D-S证据理论的多传感器雷达体制识别

采用不确定推理的矩阵分析方法,建立了用于雷达体制识别的多传感器数据融合的数学模型,提出了一种基于矩阵分析的多传感器信息融合的新算法,结合多传感器多测量周期的雷达体制识别给出了具体的实例.识别结果说明了该算法的有效性.     

虚拟现实系统中的视觉延迟及其克服算法

虚拟现实(VR)技术问世以来,用户在使用基于VR的飞行模拟器时有时出现恶心、头晕等不适感,这种现象已引起人们的关注。研究表明,视觉延迟是引起这种不适感的重要原因之一。分析了VR系统中视觉延迟产生的原因,并基于卡尔曼滤波技术,设计了视觉延迟克服算法。算法首先假定头部运动是一个随机过程,且有较大的随机加速度,活动幅度一般不超过80mm,建立了头部运动的随机数学模型;其次,采用了测量数据预处理技术以提高预测精度。理论分析和仿真检验都表明,该算法与以往的预测算法相比,计算量增加很少,但预测精度得到了明显的提高。进而减缓了图像的抖动和对操作者头部运动的限制,提高了与虚拟场景的适应能力。     

多目标攻击导弹捷联惯导的传递对准

在分析中距复合制导空空导弹捷联惯导传递对准的基础上,提出由机载火控系统根据导弹发射包线计算发出开始捷联惯导传递对准精对准的时刻,导弹惯导提前进行传递精对准的方法。利用此方法可以解决机载武器系统多目标攻击空空导弹传递对准满足连续发射多枚导弹实时性要求的问题。最后,在单目标情况下就开始传递对准时刻包线给出了算例。     

A stochastic model for burn‐in procedures in accelerated environment

Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Transient analysis of Markov models of fault‐tolerant systems with deferred repair using split regenerative randomization

The (standard) randomization method is an attractive alternative for the transient analysis of continuous time Markov models. The main advantages of the method are numerical stability, well‐controlled computation error, and ability to specify the computation error in advance. However, the fact that the method can be computationally very expensive limits its applicability. In this paper, we develop a new method called split regenerative randomization, which, having the same good properties as standard randomization, can be significantly more efficient. The method covers reliability‐like models with a particular but quite general structure and requires the selection of a subset of states and a regenerative state satisfying some conditions. For a class of continuous time Markov models, model class C₂, including typical failure/repair reliability‐like models with exponential failure and repair time distributions and deferred repair, natural selections are available for both the subset of states and the regenerative state and, for those natural selections, theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. Those results can be used to anticipate when the method can be expected to be competitive. We illustrate the application of the method using a large class C₂ model and show that for models in that class the method can indeed be significantly more efficient than previously available randomization‐based methods. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

机翼不对称损伤飞机在大侧滑角下的操稳特性研究

对某小型电动无人机(以下简称SEPUAV)在其左翼破损40%面积矩下的操稳特性进行详细分析。首先在此损伤下典型大侧滑角定常工作点附近进行特殊的小扰动线性化,然后进行特征根和飞行运动模态的分析;其次对此特殊构型SEPUAV进行操稳特性、时频响应特性进行分析。分析结果表明:左翼破损40%面积矩SEPUAV出现特有运动模态并影响全部纵侧向运动状态的响应;部分传递函数出现较多非最小相位零点从而导致初始响应发生反向;部分通道的Bode图中出现多个波峰波谷并有相角提前等现象。分析结果对后续容损飞行控制器的设计起到铺垫的作用。     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015