Parallel machine scheduling with job assignment restrictions

In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means that each job can only be processed on a specific subset of the machines. Particular attention is given to the case of processing times restricted to one of two values, 1 and λ, differing by at most 2. A matching based polynomial time ε‐approximation algorithm is developed that has a performance ratio tending to . This algorithm is shown to have the best possible performance, tending to 3/2, for processing times 1 and 2. For the special case of nested processing sets, i.e., when the sets of machines upon which individual jobs may be assigned are non‐overlapping, the behavior of list scheduling algorithms is explored. Finally, for assignment restrictions determined by just one characteristic of the machines, such as disc storage or memory constraint in the case of high performance computing, we contribute an algorithm that provides a 3/2 worst case bound and runs in time linear in the number of jobs. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

美军几种有效提高频谱利用率的技术

文中简要介绍了美军的几种可有效提高频谱利用率的技术,如基于信号传播控制的频谱复用技术:定向天线和组网;利用信号问差异的频谱复用技术:扩展频谱、信号极化和智能天线等。文中对这些技术的特征以及应用于频谱复用时的特点作了简要阐述。     

匹配追踪信号分解法在进气门间隙故障诊断中的应用

介绍了匹配追踪信号分解法在发动机故障诊断中的应用。针对康明斯6BT5.9型发动机进气门振动信号,采用时域表达较为理想的高斯函数作为信号展开的基元函数进行信号分析,并进行了试验验证。     

组合层内和层间小波系数的图像去噪方法

建立了能利用系数层间和层内相互依赖的关系模型,推导了应用最小均方误差原理去除图像中噪声的算法,而且运用隐参变量描述方式,使得小波系数那种反映图像边缘强度特征的空间变属性表现了出来,使算法具有空间自适应能力,实验结果显示该方法比目前存在的一些方法更具优越性。     

基于S变换的跳频信号参数估计

对跳频信号的时频域进行分析和参数估计是识别、跟踪及干扰跳频信号的重要基础。针对接收到的未知任何先验参数的跳频信号,提出了一种基于S变换(S-transform)的跳频信号参数估计算法,通过S变换,能正确估计出跳频信号的跳频周期、跳变时刻及跳频图案。仿真结果表明,与平滑伪Wigner-Ville分布(SPWVD)进行比较,该算法能够在低信噪比条件下,在时频域中有较好的解析能力,提高了跳频信号参数估计的准确性。     

混沌信号在弹载雷达成像中的应用

传统的线性调频信号在雷达成像中存在旁瓣电平过高,参数容易被截获等缺点。为了提高成像雷达的抗干扰性能和分辨能力,将混沌调频信号用于弹载成像雷达系统,建立了SAR工作的空间几何模型,在此基础上分析了回波特性,并对点目标进行了成像仿真,重点对成像性能进行了分析。结果表明,混沌调频信号用于弹载成像雷达系统可获得比较理想的点目标图像,使系统具有强抗干扰性能,有着良好的发展前景。     

单信道时频重叠MPSK信号的调制识别方法

提出一种基于高阶循环累积量的调制识别算法,用于解决单信道两个时频重叠M PSK信号的调制识别问题。对接收到的重叠信号进行预处理,计算其四阶循环累积量,提取分类特征参数,采用最小误差准则算法实现时频重叠双信号的自动分类。理论分析和仿真试验结果均证明了算法的正确性和有效性。     

超重力下燃烧合成Al2O3-ZrO2（4Y）共晶陶瓷的自挤压工艺研究

引入自挤压工艺辅助超重力下燃烧合成制备Al2O3-ZrO2（4Y）共晶复合陶瓷,可有效地消除陶瓷制品的缩孔、缩松组织等缺陷,陶瓷致密性得到明显提高,同时又有效地抑制陶瓷裂纹萌生。XRD分析显示共晶陶瓷由α-Al2O3,t-ZrO2及少量的m-ZrO2三相组成,且随自挤压力增大,陶瓷中可相变的t-ZrO2的体积分数增加。SEM观察发现陶瓷的显微组织中的棒状共晶团随自挤压力的增大而细化,体积分数增加,且分布其上的t-ZrO2纤维直径变小,共晶团组织边缘处的ZrO2枝晶逐渐转变为细小的球晶,共晶团边界组织厚度逐渐减小,从而使陶瓷力学性能得以提升。     

用于目标弱信号处理的三重相关匹配滤波技术

分析了在二重相关匹配滤波技术的基础上实现三重相关匹配滤波的方法。三重相关匹配滤波对于目标的弱信号进行检测和处理 ,具有广泛的实用价值。给出了一个红外搜索目标信号处理的计算机模拟结果 ,并对计算机模拟结果进行了分析 ,证明了三重相关匹配滤波技术相对于二重相关和三重相关检测技术的优越性