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     

一种BPSK相参脉冲信号多普勒频率变化率测量方法

BPSK信号广泛应用于新体制雷达中,测量BPSK信号中包含的多普勒频率变化率信息是单站无源定位与跟踪的关键技术.通过对BPSK信号平方消除了相位调制对参数估计的影响,并利用离散傅立叶变换进行脉冲间相参积累,算法具有计算量小、多普勒频率变化率估计精度高的优点.计算机仿真结果表明参数估计的精度能达到单站无源定位与跟踪系统的精度要求.     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

态势估计中的二维模糊空间知识处理

空间推理是态势估计中的一个重要组成部分。针对海战态势估计的要求,建立了模糊确定性下二维空间点、区域,以及几种对态势估计中常用的空间关系的数学模型和用来确定空间关系的计算方法。     

数字式相位差测量方法及精度分析

相位差变化率是最近提出的用于快速无源定位的观测量。该文研究相位差的高精度测量方法 ,提出了一种正交双通道数字式的相位差测量方法。通过对信号频谱的分析 ,计算了测量系统输出的信噪比 ,从而得出了相位差测量的理论精度 ,随后进行仿真分析验证了理论精度。理论分析和仿真实验证明 ,论文提出的方法可以实现高精度的相位差测量     

给定降质约束下一类DCT域图像水印算法的拉伸系数估计

数字水印是数字作品版权保护的重要技术手段。与噪声污染类似,数字水印的嵌入必然会损失原作品的质量。数字图像的质量直接关系其商业价值,在给定降质约束下自适应地调节嵌入深度是符合产业化标准的数字水印关键技术之一。根据DCT交流系数的拉普拉斯分布模型,推导了DCT域典型水印算法中拉伸系数与信噪比和峰值信噪比之间的理论关系。依据该理论关系,得到了在给定降质约束下一类典型图像水印算法的拉伸系数估计方法,实验结果表明该估计方法具有较高的精度。     

一种基于估计熵的自适应模糊滤波器及其在箭遥信号处理中的仿真应用

介绍了一种基于估计熵的自适应模糊滤波器 ,并将其应用于宽带噪声中火箭遥测速变信号的数字滤波。讨论了自适应模糊滤波算法 ,给出了应用实验结果。分析和实验表明 ,这种新型滤波器能根据信号的复杂程度自动调节其参数 ,对宽带噪声中非平稳随机信号有较好的滤波效果     

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

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

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

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