Analysis of decentralized multi‐product pull systems with lost sales

We study a pull‐type, flexible, multi‐product, and multi‐stage production/inventory system with decentralized two‐card kanban control policies. Each stage involves a processor and two buffers with finite target levels. Production stages, arranged in series, can process several product types one at a time. Transportation of semi‐finished parts from one stage to another is performed in fixed lot sizes. The exact analysis is mathematically intractable even for smaller systems. We present a robust approximation algorithm to model two‐card kanban systems with batch transfers under arbitrary complexity. The algorithm uses phase‐type modeling to find effective processing times and busy period analysis to identify delays among product types in resource contention. Our algorithm reduces the effort required for estimating performance measures by a considerable margin and resolves the state–space explosion problem of analytical approaches. Using this analytical tool, we present new findings for a better understanding of some tactical and operational issues. We show that flow of material in small procurement sizes smoothes flow of information within the system, but also necessitates more frequent shipments between stages, raising the risk of late delivery. Balancing the risk of information delays vis‐à‐vis shipment delays is critical for the success of two‐card kanban systems. Although product variety causes time wasted in setup operations, it also facilitates relatively short production cycles enabling processors to switch from one product type to another more rapidly. The latter point is crucial especially in high‐demand environments. Increasing production line size prevents quick response to customer demand, but it may improve system performance if the vendor lead‐time is long or subject to high variation. Finally, variability in transportation and processing times causes the most damage if it arises at stages closer to the customer. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

基于扩展Petri网的动态服务聚合流程描述模型及其BPEL4WS表示方法

针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。     

利用火箭深弹系统拦截鱼雷的技术改进方法探析

多功能、多用途是火箭深弹系统的主要发展方向之一。根据水面舰艇武器装备的实际,仅从拦截潜艇发射的鱼雷角度出发,对舰载火箭深弹系统拦截来袭鱼雷的可行性进行了分析。在此基础上,探讨了利用火箭深弹系统拦截鱼雷的系统选择、深弹战斗部的开发、引信选型、发射管安装及配置、火控系统的改进等关键问题,并提出了一些具体的改进方法。     

低错误平层数列分割移位低密度奇偶校验码构造算法

为降低LDPC(低密度奇偶校验码)码错误平层,提出一种基于环分类搜索的APPS-LDPC(数列分割移位的LDPC)码构造算法。该算法具有码长、码率和列重的任意可设性,同时该类码的Tanner图围长至少为8。循环移位因子可以通过简单的代数表达式描述,从而降低内存需求。仿真结果表明,当误码率达到10-5时,APPS-LDPC码(496,248)相对于PEG-LDPC(渐进边增长LDPC)码获得了约1.9 d B的性能提升;随着信噪比的升高,两条译码性能曲线之间的差距将更大。此外,列重为3的APPS-LDPC码(6144,5376)在信噪比4.6 d B以后并未出现明显的错误平层。该构造算法与PS-LDPC码相比,在误码率达到10-8时大约获得0.25 d B增益;与围长为4和6的PEG构造算法相比,在错误平层区域其译码性能极优;同时相较于此两者,其构造复杂度和耗时也展现出一定优势。通过基于Tanner图的诱捕集分析方法,统计APPS-LDPC码(496,248)中由8环组成的部分小型诱捕集并不存在,从而证明了其错误平层降低的原因。     

OQAM/OFDM系统中基于压缩感知的离散导频信道估计方法

针对多径信道条件下,偏移正交幅度调制的正交频分复用(OQAM/OFDM)系统中采用导频序列方式进行信道估计时导频开销较大的问题,提出一种基于压缩感知的离散导频信道估计方法。该方法利用无线信道的稀疏特性,建立基于压缩感知的OQAM/OFDM系统信道估计模型,对离散导频结构进行了优化设计,使较少的导频符号随机分布在子载波上,在接收端利用信号恢复算法实现信道估计。该方法能够显著减少导频数量,并实现高精度信道估计性能,通过实验仿真对比验证了所提方法在慢时变和快时变的无线信道条件下的有效性。     

坦克直瞄/间瞄射击一体化火控技术

直瞄射击方式是目前坦克采用的主要射击方式。直瞄射击方式受战场通视度及瞄准装置视距的影响,最大射击距离一般在5 km左右。间瞄射击方式不需要直接瞄准目标,不受战场通视度的影响,最大射击距离主要取决于火炮及弹药的性能,一般在10 km以上。未来坦克应具备直瞄射击与间瞄射击一体化能力。通过直瞄/间瞄射击火控技术的对比与分析,提出坦克直瞄/间瞄射击一体化火控方案。一体化火控具有新的技术特色,具有更强的综合作战能力,是未来坦克火控技术发展的一种趋势。     

面向任务的有人机/无人机协同对地攻击概率模型

有人机/无人机协同对地攻击是未来空对地打击的主要作战样式,如何评估其协同作战的效能是军地双方共同面对的重要课题。首先根据完成对地攻击任务的4个环节建立了对地攻击的总概率模型;然后基于桥联模型建立了各个环节的概率模型;最后给出了一架有人机协同两架无人机对地攻击的算例,并对模型反算、协同与非协同对比以及多波次攻击等问题进行了讨论和分析,验证了模型良好可用性和广泛适用性。     

用于减少远程Cache访问延迟的最后一次写访问预测方法

为减少远程Cache访问延迟,提高共享存储系统的性能,提出了一种新的基于程序内在写突发特性的最后一次写访问预测方法,并对一个具体的目录协议进行了改造,以支持该预测方法。通过预测Cache块的最后一次写访问并提前对其进行降级,处理器能直接从主存中读取数据,从而减少了远程Cache访问所需的一个网络跳步数。与当前基于指令的预测方法相比,该方法能极大减少存储开销。基准测试程序的评测结果表明,该方法能获得83.1%的预测准确率,并且能提高8.57%的程序执行性能,同时与基于指令的预测方法相比,该方法能分别减少历史踪迹表69%的存储开销和签名表36%的存储开销。     

基于STK/X的航天器悬停应用仿真技术

针对基于STK/Connect典型模式航天仿真时需要同时启动STK软件的局限,在对STK/X组件技术进行深入研究的基础上,采用基于STK/X的仿真模式,通过STK/X组件提供的接口函数和相关交互命令,将STK引擎集成至航天器悬停应用仿真中,从而实现应用程序对仿真场景的控制与调用,并通过分析处理单元对通过交互所获取的STK场景中仿真数据的处理,对航天器悬停应用仿真效能进行了分析。该集成不仅充分利用了STK强大的轨道仿真能力,还有效提高了仿真程序整体效率。