球谐函数法解地球扰动引力并行计算方法

随着导弹射程的增加,传统求解地球扰动引力的球谐函数法模型阶数增大,扰动引力的计算速度明显下降。为提高弹道导弹扰动引力的赋值速度,在现有条件下结合球谐函数法计算模型的特点,在并行计算平台上,应用流水线技术和任务交叉分配的方法,建立了球谐函数法的并行计算模型。通过仿真验证,该方法能有效地提高地球扰动引力的计算速度,得到较高的并行加速比和CPU利用率。     

(2015GIS)北斗静止轨道卫星信号盲区快速并行解算方法

北斗系统静止轨道卫星信号盲区解算方法复杂、串行计算耗费时间长,需在并行环境下利用更多的计算资源进行北斗盲区的快速解算。本文在分析北斗盲区解算原理与算法并行特征基础上,提出了基于动态盲区影响域的并行解算方法,并以栅格单元为并行粒度进行任务划分,实现了北斗盲区的高效并行解算。基于全国范围59景数字高程模型数据,利用8进程进行盲区并行解算,耗费时间约为5小时。实验测试结果表明：算法的并行效率随着进程数的增加有所衰减,但稳定在96%以上。基于本文方法实现的程序中间件已集成应用于高性能地理信息平台中,应用效果良好。     

可变速率调制器研究及其FPGA实现

提出了一种变速率调制系统的设计方法。基于现场可编程门阵列(FPGA),在硬件系统中实现了新方法。所设计的系统能够处理(13.5~300)Mbps连续变化的比特速率。通过将整个可变速率范围分成若干小段,分别经过不同倍数的采样滤波,保证了所有符号速率对应的数据能够被调制到数模转换芯片(DAC)处理范围内。给出了系统整体设计结构,分析了硬件实现时的难点,论述了并行采样滤波与并行载波生成等设计方法。硬件实现结果表明,所提出的设计方法能够实现对较宽范围内连续可变速率信号的调制。系统的易扩展性也保证了所设计结构能够处理更宽的变速率范围。     

并联波浪补偿系统的鲁棒控制方法

研究了基于绳牵引并联机构的新型波浪补偿系统的鲁棒控制方法。将环境作用力和不可测参数从动力学方程中分离出来,看作系统干扰,然后根据李亚普诺夫稳定性理论推导了控制律。针对绳索冗余的情况,提出了一种基于交互投影的绳索张力分布算法。当存在张力分布的可行解时,该算法能够得到远离张力限制边缘的"安全"最优解;当不存在可行解时,该算法能够得到满足张力限制条件的最佳近似解。为了提高鲁棒控制的实用性,还研究了负载惯性参数辨识方法。仿真结果表明,以上理论与方法对于波浪补偿系统是非常有效的。     

冗余并联机构的PD控制

采用并联机构的简化树动力学模型 (reducedtreemodel) ,给出了冗余并联结构的动力学方程和基于PD控制策略的控制方法。为了消除冗余并联机构固有的内作用力 ,给出了一种基于静态力平衡的控制方法。最后 ,利用一个 2自由度的冗余平面并联机构作为控制实例 ,实验结果表明了控制方法的正确性     

数据流模型机SDS-l 的实现

文中全面地介绍了数据流模型机SDS-1的特点和实现方法。SDS-1模型机是一种同步和异步相结合、数据流和控制流相结合的数据流模型机,它能开发复合函数级的并行性。该模型机在Intel86/310微机和8个Intel86/12单板机组成的多机系统上实现,达到了80年代初国际先进水平。     

三个并行排序算法的可扩充性分析

可扩充性分析是评价并行算法或并行系统性能的重要工作,特别是在大规模并行处理环境下更是如此。本文利用新近提出的扩张串行分量分析技术,研究了三个并行排序算法的可扩充性,以及这些算法在超立方体结构上的实现的可扩充性。给出了使三种算法都为可扩充的条件,解释了每个算法的适用范围。展示了算法的实质性质,计算了它们的扩张串行分量、扩张效率以及扩张加速比。本文的解析分析结果与其它文献中的实验结果一致。     

The joint signature of coherent systems

We investigate the joint signature of $m$ coherent systems, under the assumption that the components have independent and identically distributed lifetimes. The joint signature, for a particular ordering of failure times, is an $m$‐dimensional matrix depending solely on the composition of the systems and independent of the underlying distribution function of the component lifetimes. The elements of the $m$‐dimensional matrix are formulated based on the joint signatures of numerous series of parallel systems. The number of the joint signatures involved is an exponential function of the number of the minimal cut sets of each original system and may, therefore, be significantly large. We prove that although this number is typically large, a great number of the joint signatures are repeated, or removed by negative signs. We determine the maximum number of different joint signatures based on the number of systems and components. It is independent of the number of the minimal cut sets of each system and is polynomial in the number of components. Moreover, we consider all permutations of failure times and demonstrate that the results for one permutation can be of use for the others. Our theorems are applied to various examples. The main conclusion is that the joint signature can be computed much faster than expected.     

基于主动相位控制的脉冲激光相干合成技术

提出并验证了基于随机并行梯度下降(SPGD)算法的主动相位控制脉冲激光相干合成方案.利用低通滤波器滤除脉冲激光光强变化导致的性能评价函数起伏,提取出相位噪声导致的性能评价函数变化,然后将这个低通滤波后的性能评价函数用于SPGD算法的极值寻优过程,从而实现脉冲激光的锁相.对该方案进行了理论分析和数值模拟,并进行了两路脉冲激光相干合成实验.实验结果表明,当系统从闭环到开环时,系统性能评价函数均值提高到开环的1.6倍,干涉条纹长曝光对比度从0提高到0.43.在该方案中,通过增加合成脉冲激光路数,并在各路脉冲激光中引入多级功率放大器,能够得到更高的合成功率输出.     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012