考虑载荷作用次数的多失效模式扭力轴灵敏度分析

机械构件的不同的失效模式之间具有一定的相关性,而且随机载荷作用次数对机械构件的可靠性有一定程度的影响。因此对机械构件进行可靠性灵敏度分析时,需要充分考虑其不同失效模式和载荷作用次数的影响。通过运用顺序统计量理论考虑载荷多次作用以及多种失效模式条件下机械构件可靠性及可靠性灵敏度的变化规律,运用随机摄动理论和四阶矩技术,建立一种考虑载荷作用次数的多失效模式机械构件可靠性灵敏度分析数值方法的应力强度干涉模型。在随机变量前四阶矩已知的情况下,结合灵敏度分析的梯度算法,推导出关于随机变量均值和方差的灵敏度计算公式。以某履带车辆底盘扭力轴为例进行计算,得到其可靠度随载荷作用次数、随机变量均值和方差而改变的可靠性灵敏度变化曲线,为扭力轴的可靠性优化提供一定的理论依据。研究成果可以推广到相关机械可靠性灵敏度设计和结构优化领域,具有非常重要的实用意义。     

基于MGEKF的单站无源定位跟踪算法

单站无源定位跟踪技术具有隐蔽性强、设备简单,系统相对独立等优点,有着广阔的应用前景.为了提高定位精度和收敛速度以满足实时化需求,在现有的基于多普勒变化率的单站无源定位算法的基础上.详细推导了基于MGEKF的定位算法以解决EKF算法的不稳定性,并通过计算机仿真比较了两种算法的性能,结果表明MGEKF定位算法提高了定位精度、收敛速度和稳定度,定位结果能够满足实际需求.     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

保密通信中同相和正交通道失衡对干扰抑制性能的影响

针对同时存在恶意干扰与非法窃听的通信环境,提出一种协作干扰(cooperative jamming, CJ)掩护的保密通信架构,收发信机之间采用跳频技术躲避恶意干扰,并采用协作干扰技术阻塞非法窃听。但该架构的通信带宽较大,会在收发频率振荡器中引起显著的同相和正交(in-phase and quadrature, IQ)通道失衡。鉴于此,对收发IQ通道失衡引起的信号失真进行数学建模,给出接收机处信干噪比的数学表达式,并给出干扰抑制比的闭合表达式。仿真结果表明,收发IQ通道失衡引起的信号失真的功率远大于热噪声功率。随着收发IQ通道失衡加剧,所提架构的信干噪比和干扰抑制比性能均会急剧下降,当幅度和相位失衡分别达到0.95和π/50时,信干噪比和干扰抑制比均损失了47 dB。     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

地炮营通信系统载波监听／碰撞检测仿真分析

给出某地炮营通信系统信息传输的CSMA／CD(Carrier Sense Multiple Acces／Collision Detection)排队论模型,提出了信道争用和碰撞的问题,用单机和网络仿真分析了载波监听条件下通信失效的概率,给出信道争用和碰撞的几个性能指标,并利用软件的方法,提供了减少碰撞的方案     

通气管暴露率检查曲线及使用对策

在建立蓄电池充放电模型的基础上,计算了常规潜艇的通气管暴露率,绘制了暴露率检查曲线,并给出了检查曲线的使用功能.     

速率偏频激光陀螺寻北仪中转台测角周期性误差的影响分析

连续旋转式寻北仪以其突出的性能成为当前寻北仪研究的热点,但关于转台误差对连续旋转寻北算法精度影响的分析很少.针对速率偏频激光陀螺寻北仪,研究了转台测角周期性误差对寻北结果的影响.理论分析表明,测角周期性误差的存在会导致寻北结果偏离真实值,必须对其进行建模和补偿以提高寻北精度.对理论分析结果进行了仿真实验和样机寻北实验验...     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011