基于提升算法的二维DWT高效VLSI实现结构

以CDF9/7小波为例构造了一种二维DWT变换的高效VLSI结构。采用改进的提升算法,减少了关键路径上的延时。把乘法器系数表示为CSD形式,将乘法优化为最少的移位加操作。提出了一种行变换和列变换同时进行的方法和实现结构,并且整个结构采用流水线处理。通过VHDL的行为级仿真,得到的数据和软件仿真的结果相同,证明了该结构的正确性。和其它结构相比,该结构处理速度更快,并且硬件利用率可达100%。     

基于几何解算的飞机三维姿态测量方法

针对单站光测图像,提出一种基于目标形状特征的三维姿态测量方法。在已知飞机外形尺寸、光测设备成像参数以及飞机与光测设备之间距离的情况下,根据飞机参考平面(水平机翼所在平面)与成像平面平行和不平行时成像尺寸的差异,可以估计出飞机参考平面相对于成像平面的位置关系,从而得到飞机相对于摄像坐标系的三维姿态,再通过坐标转换即可得到飞机相对于大地坐标系的三维姿态。该方法充分利用了目标和成像设备的先验知识,避免了复杂的模型匹配过程,具有较好的准确度和实时性,对目标的精确控制和跟踪具有重要意义。     

Dirac方程组的解与R3,1中具有平行平均曲率向量场的类时曲面

在研究R3,1中具有平行平均曲率向量场的类时曲面的局部性质时,研究它的分类以及构造曲面的方法是其中的重要部分。探讨通过Dirac方程组的解或一个可积系统的解来构造R3,1中这类曲面的方法。     

一种面向多核处理器的高效并行PCA-SIFT算法

提出一种面向多核处理器的并行PCA-SIFT算法,采用数据级并行方法实现并行的特征提取和特征点匹配,将计算任务分配到各个DSP核并行处理,充分开发多核处理器的多级并行性.实验结果表明,并行PCA-SIFT算法对各种不同图像形变的图像具有良好的适应性,具有接近串行PCA-SIFT算法的图像匹配能力,平均加速比达3.12.     

数据并行程序设计语言中分布数组的地址计算

本文讨论了在大规模并行计算机上实现数据并行程序设计语言的关键问题──分布数组的地址计算问题。文中详细给出了维分布数组的下标地址计算公式,分布数组的内情向量结构以及分布数组映射函数算法,并对有关编译实现技术进行了探讨。     

中远距协同空战多目标攻击决策

根据先进战斗机的技术特点和中远距协同空战发展方向,提出一种基于先敌发现、先敌发射、先敌摧毁能力的空战态势分析模型。同时,将并行遗传算法与分布估计算法相结合的并行分布遗传算法应用于上述模型,给出了求解多目标攻击决策问题的算法。最后利用具体算例进行仿真验证。结果表明空战态势分析模型能够较为准确地描述中远距多机协同空战,采用的算法具有较好的可行性和实时性,为中远距多机协同空战的多目标攻击决策提供了新的思路和方法。     

JPEG2000遥感图像实时压缩系统中基于并行机制的“零时间”数据搬移策略

为了满足JPEG2000遥感图像实时压缩设备的实时性要求，提出了一种基于并行机制的“零时间”数据搬移策略。通过对EBC算法结构进行拆分，并采用EDMA方式进行数据搬移，使得算法运算与数据搬移过程完全并行，搬移时间等效为零。实验结果表明，采用新的数据搬移策略后，编码效率可以提升到100％，EBC算法实现的总时间可缩短46％以上。该搬移机制已成功应用于JPEG2000星载遥感图像实时压缩系统中，系统的实时性达到了设计要求。     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

On competitive analysis for polling systems

Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling systems with arbitrary arrivals (not restricted to time-varying or in batches) and revealed service time upon a job's arrival. To address that need, our work considers a polling system with generic setting and for the first time provides the worst-case analysis for online scheduling policies in this system. We provide conditions for the existence of constant competitive ratios, and competitive lower bounds for general scheduling policies in polling systems. Our work also bridges the queueing and scheduling communities by proving the competitive ratios for several well-studied policies in the queueing literature, such as cyclic policies with exhaustive, gated or l-limited service disciplines for polling systems.