SEA的侦察与监测系统效能分析

侦察与监测系统已成为现代C3I系统的重要组成部分,其效能评估既有C3I系统的一般性又有自身的特殊性。首先在一般系统效能含义上定义了侦察与监测系统的系统效能,比较了几种典型的C3I系统评估方法。在此基础上,将SEA方法应用于分析侦察与监测系统效能,并将情报信息量作为效能度量的指标。最后给出了分析计算过程和仿真结果。     

一座小型建筑空调动态负荷的ANN预测研究

人工神经网络(Artificial Neural Network,简称ANN)是一种崭新非线性建模和预测方法,具有良好的非线性品质和极高的拟合精度。在前人研究的基础上,针对一座小型建筑物建立了其空调动态负荷预测的BP模型。为克服常规BP训练算法的缺陷,提出了一种改进的遗传搜索算法,结果证明是一种高效实用的算法。     

专家系统优化排列准则及时间估计模型研究

军用仿真系统中 ,专家系统作为一个决策软件包 ,满足整个软件系统运行的性能需要 ,因此研究专家系统的推理时间是必要的。专家系统的推理时间与其推理模式、知识库结构等因素有关。针对知识库结构 ,利用时间齐次马尔可夫链为专家系统知识库进行建模 ,并给出了相应的时间估计模型及其排列准则 ,从而可以研究专家系统的实时性。     

弹丸动平衡自动测试方法研究

采用 IBM- PC机为主机 ,对弹丸动不平衡量 (m1 ,m2 )及相位角α进行自动测试并做相应的数据处理。设计了弹丸左、右两标定面的平面分离电路、A/D转换电路等。     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

有约束的Hartley域自适应算法的应用研究

通过对有约束的Hartley域自适应算法、频域自适应算法及时域自适应算法用于自适应降噪系统的计算机仿真研究 ,认为在自适应通信降噪中采用基于Hartley变换的自适应算法较频域自适应算法及时域自适应算法性能更优、降噪效果更好 ,并在高速信号处理器TMS32 0C30上开发实现了该算法 .实验结果表明 ,将Hartley域自适应算法应用于通信降噪系统 ,方法实际可行     

EP/PVB半-互穿聚合物网络的动态力学谱

制备了EP/PVB半 互穿聚合物网络 .动态力学谱结果表明 ,适量的PVB对环氧树脂有较好的增韧作用 ,而环氧树脂对PVB的增硬作用不明显 .     

考虑摩擦时Diesel循环功率效率特性新析

对有摩擦时Diesel循环进行了有限时间热力学分析 .导出功率和压缩比、效率和压缩比的新关系式 ,进而得到功率效率关系 ,并进行了计算和讨论 ,给出一些有益的结论     

An application of yield management for Internet Service Providers

In this paper we study strategies for better utilizing the network capacity of Internet Service Providers (ISPs) when they are faced with stochastic and dynamic arrivals and departures of customers attempting to log‐on or log‐off, respectively. We propose a method in which, depending on the number of modems available, and the arrival and departure rates of different classes of customers, a decision is made whether to accept or reject a log‐on request. The problem is formulated as a continuous time Markov Decision Process for which optimal policies can be readily derived using techniques such as value iteration. This decision maximizes the discounted value to ISPs while improving service levels for higher class customers. The methodology is similar to yield management techniques successfully used in airlines, hotels, etc. However, there are sufficient differences, such as no predefined time horizon or reservations, that make this model interesting to pursue and challenging. This work was completed in collaboration with one of the largest ISPs in Connecticut. The problem is topical, and approaches such as those proposed here are sought by users. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:348–362, 2001     

The dynamic transshipment problem

We investigate the strategy of transshipments in a dynamic deterministic demand environment over a finite planning horizon. This is the first time that transshipments are examined in a dynamic or deterministic setting. We consider a system of two locations which replenish their stock from a single supplier, and where transshipments between the locations are possible. Our model includes fixed (possibly joint) and variable replenishment costs, fixed and variable transshipment costs, as well as holding costs for each location and transshipment costs between locations. The problem is to determine how much to replenish and how much to transship each period; thus this work can be viewed as a synthesis of transshipment problems in a static stochastic setting and multilocation dynamic deterministic lot sizing problems. We provide interesting structural properties of optimal policies which enhance our understanding of the important issues which motivate transshipments and allow us to develop an efficient polynomial time algorithm for obtaining the optimal strategy. By exploring the reasons for using transshipments, we enable practitioners to envision the sources of savings from using this strategy and therefore motivate them to incorporate it into their replenishment strategies. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:386–408, 2001