CDF9／7小波在JPEG2000中的整数变化

通过添加系数缩放值叮,使目前在JPEG2000中广泛采用的CDF9／7小波提升算法完全整数化,不仅保持了现有算法的还原度,而且简化了算法的复杂度,在图像压缩上取得了比较满意的效果。     

基于动态规划的猎雷具识别路径优化算法

路径长度、海流方向给猎雷具航渡、操控带来的时间消耗,是影响目标识别效率的主要因素。单纯运用动态规划算法只能解决猎雷具最短识别路径的问题,而无法顾全猎雷具在操控方面的时间损耗,从而在提升作战效率上得不偿失。本文基于动态规划算法,优化了识别路径的解算模型,并在模型解算前,提出了目标位置的预处理条件,简化了模型的解算步骤;在模型解算后,提出了识别路径的修正方法,完善了模型的解算结果。     

Modeling and analyzing multiple station baggage screening security system performance

In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于多目标优化的液体火箭发动机减损与延寿控制

着重分析了减损与延寿控制律的综合过程,提出其基于多目标优化方法的理论基础。在建立某型液体火箭发动机系统动力学模型、关键部件之涡轮叶片的结构分析模型及其材料损伤模型的基础上,分析了应用非线性规划法求解减损与延寿控制律的过程。对发动机起动过程实施减损与延寿控制,结果表明在系统性能略微损失的情况下,可以较大幅度地减小涡轮叶片的损伤,从而达到延长发动机工作寿命的目的。     

基于整数小波变换的多光谱遥感图像压缩技术

在分析多光谱图像小波变换后系数特点的基础上,提出了一种基于整数小波变换的3维集合分裂嵌入块编码(3D SPECK)压缩方法。该方法将小波变换压缩技术中的零树编码推广到多光谱图像压缩中,采用整数小波变换去除空间冗余,对单波段图像,采用2D SPECK编码,对多波段图像,谱域上构成的小波矢量采用离散余弦变换(DCT)进行变换,对变换后的系数进行3D SPECK编码。实验结果表明,该方法硬件实现简单,编码解码时间快,对内存要求低。     

Crane scheduling with spatial constraints

In this work, we examine port crane scheduling with spatial and separation constraints. Although common to most port operations, these constraints have not been previously studied. We assume that cranes cannot cross, there is a minimum distance between cranes and jobs cannot be done simultaneously. The objective is to find a crane‐to‐job matching which maximizes throughput under these constraints. We provide dynamic programming algorithms, a probabilistic tabu search, and a squeaky wheel optimization heuristic for solution. Experiments show the heuristics perform well compared with optimal solutions obtained by CPLEX for small scale instances where a squeaky wheel optimization with local search approach gives good results within short times. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

分布式流体系结构及其编程模型与资源管理

利用互联网资源提供大数据计算服务面临着资源异构性、动态性与通信长延迟等方面的挑战,现有分布式计算模型仍存在一些不足。运用流计算模型提出分布式流体系结构,包括分布式流编程模型与资源管理等,能够高效支持多种并行执行模式。在10个CPU-GPU异构结点上实现了原型系统,仿真实验验证了7个不同的测试用例。实验结果表明,与本地串行计算相比,分布式流体系结构可以平均提高39倍计算性能,具有较大的应用潜力。     

Scheduling maintenance and semiresumable jobs on a single machine

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We also assume that if a job is not processed to completion before the machine is stopped for maintenance, an additional setup is necessary when the processing is resumed. Our purpose is to schedule the maintenance and jobs to minimize some performance measures. The objective functions that we consider are minimizing the total weighted job completion times and minimizing the maximum lateness. In both cases, maintenance must be performed within a fixed period T, and the time for the maintenance is a decision variable. In this paper, we study two scenarios concerning the planning horizon. First, we show that, when the planning horizon is long in relation to T, the problem with either objective function is NP-complete, and we present pseudopolynomial time dynamic programming algorithms for both objective functions. In the second scenario, the planning horizon is short in relation to T. However, part of the period T may have elapsed before we schedule any jobs in this planning horizon, and the remaining time before the maintenance is shorter than the current planning horizon. Hence we must schedule one maintenance in this planning horizon. We show that the problem of minimizing the total weighted completion times in this scenario is NP-complete, while the shortest processing time (SPT) rule and the earliest due date (EDD) rule are optimal for the total completion time problem and the maximum lateness problem respectively. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 845–863, 1999     

程序进化器

研究用模拟进化方法进行程序设计的途径。构造了以形式文法为遗传表示的程序进化器,提出了这个进化器使用的有关算法。本文用程序进化器解决了人工蚁问题。     

一种结构化的编译型 PROLOG数据库及其管理策略

PROLOG数据库存放着构成PROLOG程序的子句以及表示成子句的全局数据,它的组织与管理是实用PROLOG系统的关键,这一点在提高执行效率的编译型PROLOG系统中尤为如此。本文以YH-SIM——一个扩充了的WAM模型为基础,提出一种新颖的编译型PROLOG数据库结构形式,其中·过程中的子句索引与子句彼此分离; ·子句索引块分成多个专门的子索引块; ·一个子句按两种形式存放,子句代码和子句项(源子句形式)。二者分离且共享同一索引,因此代码库和项库的管理是一体化的。这些结构化的特征,有力地支持PROLOG数据库的操作及管理(子句的插入删除,以及空间分配与回收)。文中还介绍了一种简明有效的管理方法。