Hilbert谱分析和平稳度

提出了本征模式函数IMF成员相应的幅度及频率时间函数的计算方法。由函数的Hilbert谱可获得相关的边缘谱,边缘谱确定了几乎连续的能量分布,从而提供了通过每个频率值测量总能量的方法。根据能量-频率-时间分布,就可以定量确定平稳性,平稳性是物理过程的一个复杂属性,其由平稳度DS和统计平稳度DSS进行度量,同时给出了DS和DSS的计算公式。     

基于半实物仿真的HLA／RTI关键技术研究

分析了基于HLA/RTI的半实物仿真中实践管理、数据收集能力、RTI通用性以及网络传输安全等问题,研究了新的时间管理策略,提出了合理设置lookahead的算法,设计了数据收集的层次框架,并制定了研发RTI的通用原则和安全有效的网络传输方案,为现代半实物系统仿真提供了理论借鉴。     

电子时间引信解除保险距离试验研究

通过测量弹丸炮口速度和引信解除保险时间的方法得出电子时间引信远解距离。在介绍某型电子时间引信实现远距离解除保险的方法和机构工作过程的同时,对远解距离进行理论分析,并对试验引信改装的实现方法作了详细说明。在此基础上,进行了电子时间引信解除保险距离测试试验并对试验结果作了分析。     

Dynamic lot‐sizing model with production time windows

We consider a dynamic lot‐sizing model with production time windows where each of n demands has earliest and latest production due dates and it must be satisfied during the given time window. For the case of nonspeculative cost structure, an O(nlogn) time procedure is developed and it is shown to run in O(n) when demands come in the order of latest production due dates. When the cost structure is somewhat general fixed plus linear that allows speculative motive, an optimal procedure with O(T⁴) is proposed where T is the length of a planning horizon. Finally, for the most general concave production cost structure, an optimal procedure with O(T⁵) is designed. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Exact expected values of variance estimators for simulation

We formulate exact expressions for the expected values of selected estimators of the variance parameter (that is, the sum of covariances at all lags) of a steady‐state simulation output process. Given in terms of the autocovariance function of the process, these expressions are derived for variance estimators based on the simulation analysis methods of nonoverlapping batch means, overlapping batch means, and standardized time series. Comparing estimator performance in a first‐order autoregressive process and the M/M/1 queue‐waiting‐time process, we find that certain standardized time series estimators outperform their competitors as the sample size becomes large. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Pricing bridges to cross a river

We consider a pricing problem in directed, uncapacitated networks. Tariffs must be defined by an operator, the leader, for a subset of m arcs, the tariff arcs. Costs of all other arcs in the network are assumed to be given. There are n clients, the followers, and after the tariffs have been determined, the clients route their demands independent of each other on paths with minimal total cost. The problem is to find tariffs that maximize the operator's revenue. Motivated by applications in telecommunication networks, we consider a restricted version of this problem, assuming that each client utilizes at most one of the operator's tariff arcs. The problem is equivalent to pricing bridges that clients can use in order to cross a river. We prove that this problem is APX‐hard. Moreover, we analyze the effect of uniform pricing, proving that it yields both an m approximation and a (1 + lnD)‐approximation. Here, D is upper bounded by the total demand of all clients. In addition, we consider the problem under the additional restriction that the operator must not reject any of the clients. We prove that this problem does not admit approximation algorithms with any reasonable performance guarantee, unless P = NP, and we prove the existence of an n‐approximation algorithm. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

On the effectiveness of top‐down strategy for forecasting autoregressive demands

We investigate the relative effectiveness of top‐down versus bottom‐up strategies for forecasting the demand of an item that belongs to a product family. The demand for each item in the family is assumed to follow a first‐order univariate autoregressive process. Under the top‐down strategy, the aggregate demand is forecasted by using the historical data of the family demand. The demand forecast for the items is then derived by proportional allocation of the aggregate forecast. Under the bottom‐up strategy, the demand forecast for each item is directly obtained by using the historical demand data of the particular item. In both strategies, the forecasting technique used is exponential smoothing. We analytically evaluate the condition under which one forecasting strategy is preferred over the other when the lag‐1 autocorrelation of the demand time series for all the items is identical. We show that when the lag‐1 autocorrelation is smaller than or equal to 1/3, the maximum difference in the performance of the two forecasting strategies is only 1%. However, if the lag‐1 autocorrelation of the demand for at least one of the items is greater than 1/3, then the bottom‐up strategy consistently outperforms the top‐down strategy, irrespective of the items' proportion in the family and the coefficient of correlation between the item demands. A simulation study reveals that the analytical findings hold even when the lag‐1 autocorrelation of the demand processes is not identical. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

对一种混沌加密图像方法的破译研究

介绍了利用混沌映射系统进行保密通信的理论依据。分析了一种利用混沌动力学方程所形成的混沌序列来对图像进行加密的方案,并用程序语言予以实现。针对这种一维混沌加密算法,在加密方程、参数和初始值完全未知的前提下,运用相空间重构法和穷举法对其进行了破译研究并成功将其破译。总结了加密和破译方法的优缺点,提出了一种抗破译能力更强的加密方案。     

基于Chirp变换的快速离散时间尺度变换

提出了一种新的快速离散时间尺度变换算法。给出了离散时间信号尺度变换的构造表达式及其Chirp变换快速实现流程。讨论了Chirp变换实现中的参数选取准则,分析了Chirp变换的信号带宽问题。讨论了算法的运算效率并与其它算法进行了比较。仿真试验证明了本文算法的有效性。     

双阵被动测距方法仿真

利用有一定间距的两部声纳基阵提供的目标方位和时延差的信息,实现对目标的被动测距。建立了测距物理模型,给出了后置距离滤波算法。通过仿真实验验证了模型的有效性,并通过分析两阵间距及时延差均方误差对测距的影响,表明了由于声场环境及特性的影响,选择适当的阵间距和时延差均方误差在实际测距试验中是非常重要的。