基于视频图像的增强现实光照技术

光照一致性是增强现实技术中一项重要的研究内容。利用摄像机捕获的放置在真实场景中的标定物和镜面小球的视频图像,设计了一个增强现实光照系统模型。模型的实现过程表明,该方法实现相对简单,不需要对场景及模型进行预处理,能够达到虚实对象在动态增强现实场景中光照的实时一致性。     

DSP在舰炮火控系统中的应用

在舰炮火控解算过程中,诸元解算任务要占用较多的CPU时间,往往影响系统实时性。基于DSP数据处理技术的优点,提出一种分布式系统组成结构,并以流程图的形式描述DSP与系统主机之间的系统工作原理。计算结果表明,DSP的应用能较好地解决系统实时性的问题,具有一定的工程应用价值。     

防御矩阵满足乘法交换律的证明

在使用马尔柯夫链分析多层防御系统的防御效用值时,发现防御矩阵是否满足乘法交换律将关系到多层防御系统变换部署后的防御效用值,因此有必要对防御矩阵是否满足乘法交换律进行证明。首先介绍了防御矩阵的概念、物理意义、重要性质及计算方法,分析了防御矩阵满足乘法交换律的重要意义,最后综合运用数学归纳法和随机矩阵性质证明了防御矩阵满足乘法交换律的事实,此结论无论对于多层防御系统的防御效用值研究还是矩阵理论研究都有一定的指导作用。     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

The stochastic joint replenishment problem: A new policy,analysis, and insights

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Requirements planning for modular products

The focus of this paper is on determining the requirements of different component options of a modular end‐product in an uncertain environment. We explicitly model two distinct sources of uncertainty: stochastic end‐product demand and unknown market proportions for the different product options available. Our cost minimizing model focuses on determining the optimal requirements policies for component options that meet a pre‐set service level. We show that simple common‐sense requirements policies are not generally optimal; there is a non‐linear connection between service level and component requirements that is hard to characterize without a detailed analysis. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

RTEMS研究及工程应用

美国开源军用实时操作系统RTEMS(Real-Time Executive for Multiprocessor Systems)的功能性能不逊于VxWorks。基于对其体系结构的分析、开发环境的建立,应用平台的构建,研究了该系统在军用电子装备中应用的可行性,为研究开发国产操作系统提供借鉴。     

Nucleus Plus操作系统的实时性分析与测试

针对操作系统的实时性,以NucleusPlus嵌入式实时操作系统为研究对象,分析其内核的实时机制及上下文切换时间、中断响应时间这两个重要的实时性指标。设计了一个交替等待/获取信号量的方法来测试上下文切换时间,该方法主要是利用信号量的等待和获取来发生上下文切换,经实验验证,比原有的方法所测得的结果更精确,适用范围更广,可为实时应用在选择合适的操作系统方面做参考。     

低空复杂场景红外弱小目标快速精准检测

针对低空复杂场景下红外弱小动目标检测难度大、虚警率高等问题,面向探测系统中高帧频图像实时处理应用需求,提出基于全卷积网络的弱小目标精准检测方法和基于现场可编程逻辑门阵列(field programmable gate array, FPGA)的低时延并行处理方法。采用轻量化全卷积网络对红外图像中弱小目标进行空域检测,对相邻图像帧疑似目标进行时域轨迹关联以进一步降低虚警率。实验结果表明:上述方法相比于五种传统方法在检测率和虚警率性能方面均有显著提升,并在单片FPGA上完成100 Hz图像实时处理,处理时延低于1.8 ms,实现低空复杂场景弱小目标高精度高鲁棒快速实时检测。     

拟带宽 Toeplitz 系统的秩 1 修正算法

本文以带宽Ｔｏｅｐｌｉｔｚ系统的快速并行解法为基础,通过建立秩１的修正格式讨论了拟带宽Ｔｏｅｐｌｉｔｚ系统的一种快速并行算法,其串行运算量为９ｎｈ＋Ｏ（ｈ）．设ｐ为处理机台数,当ｐ≤ｎ时,并行运算量为　;当ｐ＝３ｎ时,运算量为２ｈ￣２ｌｏｇ２ｎ＋Ｏ（１）,其中ｈ表示拟带宽宽度。