目标自动跟踪参数辨识模型的工程化动态辨识

为解决机动目标参数辨识模型工程应用问题,采用扩张状态观测器等先进的非线性滤波算法,从实测的含有观测噪声的目标位置数据的序列中,直接估计出机动目标运动的一阶、二阶、三阶导数,并结合目标运动模型辨识的理论算法,在工程应用上首次实现了机动目标运动模态和运动模型的双重动态辨识,完成了目标模型动态辨识的工程化设计.     

装备精确修理浅析

如何用有限的装备修理力量,在战役全过程中尽可能多地修复战损装备,提高装备参战率,是战役装备修理的任务.提出精确修理以装备动态需求为依据,通过优化装备修理各要素,为战损装备提供"精确"的服务,来实现装备修理的快速高效,并通过建立修理人员效能评估模型,说明精确修理的高效性.     

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

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

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

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

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

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

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

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

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     

The selection allocation problem

The Selection Allocation Problem (SAP) is a single period decision problem which involves selecting profit‐maximizing (or cost‐minimizing) activities from various distinct groups, and determining the volume of those activities. The activities in each group are selected subject to the availability of that group's resource, which is provided by either pooling or blending raw inputs from several potential sources. Imbedded in the decision process is the additional task of determining how much raw input is to be allocated to each group to form the resource for that group. Instances of this problem can be found in many different areas, such as in tool selection for flexible manufacturing systems, facility location, and funding for social services. Our goal in this paper is to identify and exploit special structures in the (SAP) and use those structures to develop an efficient solution procedure. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 707–725, 1999     

栅格地理数据并行格式转换引擎

如今大规模地理数据正在社会各个部门和组织中迅速积累,但是由于部门利益和历史沿袭等原因,大规模地理数据共享仍然极具挑战,相应共享技术需求仍然极其旺盛。作为地理数据共享的基础方式之一,传统单机地理数据格式转换技术,一方面受限于磁盘读写及带宽瓶颈,另一方面面对日趋庞大的数据规模,已很难满足实际应用需求。因此提出一种针对栅格地理数据的并行格式转换引擎,采用高性能计算集群环境支持大规模栅格地理数据转换共享,大幅降低了大规模栅格地理数据转换过程的时间成本。栅格地理数据并行格式转换引擎采用基于公共接口的设计理念,框架灵活、具有良好的扩展性,支持地理数据格式的读写自定义以及新数据格式添加,能够实现接入数据格式间的任意两两转换。为验证引擎框架及其处理效率,在Lustre并行集群环境下以格网数据交换格式(国家地理空间数据交换格式)向常见栅格地理格式的转换为示例进行了测试实验。结果表明,栅格地理数据并行格式转换引擎能够在8个节点Lustre集群中达到7.54的良好并行加速比。     

Dynamic pricing in a trade-in program with replacement and new customers

Trade-in programs have been widely adopted to enhance repeat purchase from replacement customers. Considering that a market consists of replacement and new segments, we study the joint and dynamic decisions on the selling price of new product (hereafter, “selling price”) and the trade-in price involved in the program. By adopting a vertical product differentiation choice model, we investigate two scenarios in this paper. In the base model, the manufacturer has sufficiently large production capacity to fulfill the customer demand. We characterize the structural properties of the joint pricing decisions and compare them with the optimal pricing policy under regular selling. We further propose a semi-dynamic trade-in program, under which the new product is sold at a fixed price and the trade-in price can be adjusted dynamically. Numerical experiments are conducted to evaluate the performance of the dynamic and semi-dynamic trade-in programs. In an extended model, we consider the scenario in which the manufacturer stocks a batch of new products in the beginning of the selling horizon and the inventory cannot be replenished. Following a revenue management framework, we characterize the structural properties with respect to time period and inventory level of new products.