Sequential and systematic sampling plans for the Markov‐dependent production process

Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001     

Reliability of a 2‐dimensional k‐within‐consecutive‐r × s‐out‐of‐m × n:F system

A 2‐dimensional rectangular (cylindrical) k‐within‐consecutive‐r × s‐out‐of‐m × n:F system is the rectangular (cylindrical) m × n‐system if the system fails whenever k components in a r × s‐submatrix fail. This paper proposes a recursive algorithm for the reliability of the 2‐dimensional k‐within‐consecutive‐r × s‐out‐m × n:F system, in the rectangular case and the cylindrical case. This algorithm requires min ( O (mk^r(n?s)), O (nk^s(m?r))), and O (mk^rn) computing time in the rectangular case and the cylindrical case, respectively. The proposed algorithm will be demonstrated and some numerical examples will be shown. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 625–637, 2001.     

On optimal aiming to hit a linear target

Typically weapon systems have an inherent systematic error and a random error for each round, centered around its mean point of impact. The systematic error is common to all aimings. Assume such a system for which there is a preassigned amount of ammunition of n rounds to engage a given target simultaneously, and which is capable of administering their fire with individual aiming points (allowing “offsets”). The objective is to determine the best aiming points for the system so as to maximize the probability of hitting the target by at least one of the n rounds. In this paper we focus on the special case where the target is linear (one‐dimensional) and there are no random errors. We prove that as long as the aiming error is symmetrically distributed and possesses one mode at zero, the optimal aiming is independent of the particular error distribution, and we specify the optimal aiming points. Possible extensions are further discussed, as well as civilian applications in manufacturing, radio‐electronics, and detection. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 323–333, 1999     

A heuristic for the two‐machine no‐wait openshop scheduling problem

In this paper the problem of minimizing makespan in a two‐machine openshop is examined. A heuristic algorithm is proposed, and its worst case performance ratio and complexity are analyzed. The average case performance is evaluated using an empirical study. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 129–145, 1999     

对一种混沌加密图像方法的破译研究

介绍了利用混沌映射系统进行保密通信的理论依据。分析了一种利用混沌动力学方程所形成的混沌序列来对图像进行加密的方案,并用程序语言予以实现。针对这种一维混沌加密算法,在加密方程、参数和初始值完全未知的前提下,运用相空间重构法和穷举法对其进行了破译研究并成功将其破译。总结了加密和破译方法的优缺点,提出了一种抗破译能力更强的加密方案。     

基于Chirp变换的快速离散时间尺度变换

提出了一种新的快速离散时间尺度变换算法。给出了离散时间信号尺度变换的构造表达式及其Chirp变换快速实现流程。讨论了Chirp变换实现中的参数选取准则,分析了Chirp变换的信号带宽问题。讨论了算法的运算效率并与其它算法进行了比较。仿真试验证明了本文算法的有效性。     

基于粒子群算法的宽带真延时平面阵列方向图综合

针对大阵元间距平面阵列方向图综合问题,提出基于粒子群算法的宽带真延时平面阵列方向图综合方法。该方法根据真延时条件下阵列方向图主瓣和栅瓣指向的特点,采用宽带真延时抑制阵列方向图的栅瓣;利用粒子群优化算法优化阵列结构,得到具有较高主副瓣比的平面阵列方向图。通过对8×8的矩形平面阵进行仿真,验证了所提方法的有效性,在此基础上,还仿真研究了该方法对栅瓣的抑制性能与信号带宽之间的关系。     

GBAS中抑制电离层异常的改进自适应Hatch滤波算法

针对单频地基增强系统(Ground Based Augmentation System, GBAS)中电离层异常时Hatch滤波器平滑精度降低问题,系统分析了电离层延时对Hatch滤波器平滑精度的影响,提出一种改进自适应Hatch滤波算法。根据卫星信号计算码载偏离度,并利用二阶线性时不变低通滤波器抑制码载偏离度高频信号,以实现电离层异常实时检测;建立平滑后伪距误差均方根与电离层延时变化率、伪距测量噪声标准差以及平滑时间三者之间的函数模型,并由此确定出Hatch滤波器最优平滑时间。利用GBAS原理样机进行验证实验,结果表明:自适应Hatch滤波算法能够根据卫星信号电离层延时变化率确定滤波器最优平滑时间,且当电离层异常时,自适应Hatch滤波器机载位置误差最大由1.15 m减小为0.43 m,从而验证了所提算法的有效性。     

协方差压缩感知逆合成孔径雷达成像技术

为解决低信噪比条件下短观测时间雷达成像问题,提出一种基于回波协方差矩阵处理的压缩感知逆合成孔径雷达成像技术。该方法构建了回波协方差矩阵层面下的压缩感知问题模型,并通过特定的线性变换降低环境噪声对成像结果的影响。在仿真实验中,通过处理短观测时间和低信噪比条件下的模拟回波数据,该方法获得比传统压缩感知方法像质更好、对比度更强的目标成像结果。同时,其成像结果的目标背景比和背景噪声能量两个雷达图像评价指标都优于传统方法,进一步验证了该方法的有效性。     

圆周合成孔径雷达的快速时域成像算法

为实现圆周合成孔径雷达(Circular Synthetic Aperture Radar,CSAR)快速成像,提出一种用于CSAR的快速时域成像算法。该算法通过将CSAR的圆孔径分成若干子孔径,分别对子孔径采用快速因式分解后向投影算法处理,再将各子图像相干插值叠加至同一坐标系下得到成像结果。详细分析算法实现中的坐标转换、误差控制和运算效率等关键问题,并用点目标仿真和实测数据处理结果验证算法的有效性。所研究方法具有成像范围大、计算量小等优点。