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

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

基于人工嗅觉系统的油液渗漏检测方法

机电设备油液渗漏是一种典型的多发性故障,利用人工嗅觉技术对渗漏油液挥发气体进行测试从而进行故障诊断是一种新的无损检测方法。使用人工嗅觉系统对模拟柴油、齿轮油和机油渗漏产生的挥发气体进行检测,结果为三维数据阵列(样本×时间×传感器)。应用二维主成分分析法和三维平铺主成分分析法、平行因子分析方法对三种油液挥发气体样本进行分类,结果表明平行因子分析法由于利用了数据集的三维结构信息,所以分类效果更佳;应用主成分回归方法实现了机油挥发气体样本的定量确定,说明使用人工嗅觉系统实现设定阈值报警是可能的。     

基于单DSP实现并行扩维离散Hartley变换算法的研究

提出了一种将N点的一维离散Hartley变换(简称DHT)分解成N0×N1点的二维DHT(其中N=N0×N1)和一些运算量很小的附加运算的并行扩维DHT算法,此算法通过减少数据相关性的方法突破了DSP高效求解快速离散Hartley变换(简称FHT)时问题规模受片内内存容量限制问题,降低了编程复杂性,并在TMS320C80的单处理单元上进行了该算法实现方法的研究.结果表明,理论分析和试验结果吻合,该算法适合在单DSP上实现.     

冗余并联机构的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.     

I.I.D.并行分布式检测网相同门限假定的合理性条件

并行分布式检测网最优设计是复杂难解的,相同门限假定使Ｉ．Ｉ．Ｄ．网的设计极度简化,并在实际工程中广泛使用。本文研究了相同门限假定的合理性条件,为合理采用习惯性处理方法提供了理论依据。     

The parallel replacement problem with demand and capital budgeting constraints

A generalized parallel replacement problem is considered with both fixed and variable replacement costs, capital budgeting, and demand constraints. The demand constraints specify that a number of assets, which may vary over time, are required each period over a finite horizon. A deterministic, integer programming formulation is presented as replacement decisions must be integer. However, the linear programming relaxation is shown to have integer extreme points if the economies of scale binary variables are fixed. This allows for the efficient computation of large parallel replacement problems as only a limited number of 0–1 variables are required. Examples are presented to provide insight into replacement rules, such as the “no‐splitting‐rule” from previous research, under various demand scenarios. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 40–56, 2000     

Scheduling a maintenance activity on parallel identical machines

We study a problem of scheduling a maintenance activity on parallel identical machines, under the assumption that all the machines must be maintained simultaneously. One example for this setting is a situation where the entire system must be stopped for maintenance because of a required electricity shut‐down. The objective is minimum flow‐time. The problem is shown to be NP‐hard, and moreover impossible to approximate unless P = NP. We introduce a pseudo‐polynomial dynamic programming algorithm, and show how to convert it into a bicriteria FPTAS for this problem. We also present an efficient heuristic and a lower bound. Our numerical tests indicate that the heuristic provides in most cases very close‐to‐optimal schedules. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009