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

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

多传感器定位误差对跟踪性能影响的研究

集中讨论了带有传感器定位误差的多传感器跟踪问题中的滤波方法 ,设计了两个基于一个非线性飞机等效机动模型的扩展卡尔曼滤波器 (EKFs) :最优 EKF(OF)和次优 EKF(SF) ,并应用于带有定位误差的多传感器跟踪问题中。 Monte-Garlo模拟结果表明定位误差对飞机的位置估计影响较大 ,但不影响速度或加速度估计 ;同时说明 OF的性能明显优于 SF。     

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     

武器装备作战控制软件管理方法

随着科学技术不断进步 ,微处理器及其作战控制软件已被现代武器装备大量采用 ,作战控制软件发挥的作用越来越大 ,对软件的管理亦更加重要 ,通过对作战控制软件管理方面存在的问题的分析 ,提出了加强武器装备作战控制软件管理的方法     

图像配准参数的自适应求取方法

提出了一种可见光和红外图像的自动配准方法 .针对多数配准过程需人工干预的问题 ,建立二维仿射变换模型 ,以图像边界为特征 ,以目标边界互相关函数最大为原则 ,对二维仿射变换模型自适应搜索求取最佳配准参数 .给出了实际可见光和红外图像配准的实验结果     

一类对固定目标的集群搜寻对策问题及求解

利用集群搜索对策的理论与方法 ,建立了集群对固定目标的一类搜索对策模型 ,给出了集群的ε -最优搜寻策略 ,并考虑了其在搜索过程中的应用     

基于RBAC的分布式数据库系统安全管理技术

分析了分布式数据库系统安全管理的必要性 ,引入了基于角色的访问控制模型 ,结合分布式数据库系统的开发实例 ,阐述了利用Delphi实现基于SQLServer的分布式数据库系统安全管理的技术。     

Lateral stock transshipments in a two‐location inventory system with fixed and joint replenishment costs

We address the problem of inventory management in a two‐location inventory system, in which the transshipments are carried out as means of emergency or alternative supply after demand has been realized. This model differs from previous ones as regards its replenishment costs structure, in which nonnegligible fixed replenishment costs and a joint replenishment cost are considered. The single period planning horizon is analyzed, with the form and several properties of the optimal replenishment and transshipment policies developed, discussed and illustrated. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 525–547, 1999     

点邻域尺度差异描述的点云配准算法

针对传统特征描述符计算复杂度高、配准精度低的问题,提出一种基于不同尺度点邻域特征信息差异的点云配准算法.在特征描述符方面,对关键点选取不同尺度的邻域空间,计算各尺度空间之间的特征值归一化向量差异和法向量夹角,建立点邻域尺度差异描述符,特征描述符计算简单且节省时间.在关键点选取方面,根据曲面形状指数设计了一种寻找关键点的...     

Dynamic pricing and replenishment: Optimality,bounds, and asymptotics

In many applications, managers face the problem of replenishing and selling products during a finite time horizon. We investigate the problem of making dynamic and joint decisions on product replenishment and selling in order to improve profit. We consider a backlog scenario in which penalty cost (resulting from fulfillment delay) and accommodation cost (resulting from shortage at the end of the selling horizon) are incurred. Based on continuous‐time and discrete‐state dynamic programming, we study the optimal joint decisions and characterize their structural properties. We establish an upper bound for the optimal expected profit and develop a fluid policy by resorting to the deterministic version of the problem (ie, the fluid problem). The fluid policy is shown to be asymptotically optimal for the original stochastic problem when the problem size is sufficiently large. The static nature of the fluid policy and its lack of flexibility in matching supply with demand motivate us to develop a “target‐inventory” heuristic, which is shown, numerically, to be a significant improvement over the fluid policy. Scenarios with discrete feasible sets and lost‐sales are also discussed in this article.