GPU上高光谱快速ICA降维并行算法

高光谱影像降维快速独立成分分析过程包含大规模矩阵运算和大量迭代计算。通过分析算法热点,设计协方差矩阵计算、白化处理、ICA迭代和IC变换等关键热点的图像处理单元映射方案,提出并实现一种G-Fast ICA并行算法,并基于GPU架构研究算法优化策略。实验结果显示:在处理高光谱影像降维时,CPU/GPU异构系统能获得比CPU更高效的性能,G-Fast ICA算法比串行最高可获得72倍加速比,比16核CPU并行处理快4~6.5倍。     

一种强干扰环境下的相干弱目标DOA估计算法

提出了一种强干扰环境下相干弱信号的DOA估计算法。该算法通过修正的Toeplitz矩阵实现了对相干弱信号的解相干,然后将强干扰信号对应的特征矢量从信号子空间中剔除,最后利用MUSIC算法对弱信号进行DOA估计。所提算法不需要预知强干扰信号方位信息,对非平稳噪声有较好的抑制性能。此外,相对JJM算法,该算法具有更高的估计精度和正确概率,对强干扰信源具有更好的抑制性能。     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

随机规划在无源TDOA定位系统布站中的应用

应用随机机会约束规划理论,研究了指定区域无源定位系统布站优化问题。针对无源定位站点部署研究存在的局限,从误差准则、截获准则和协同准则出发,建立了无源定位系统布站优化的随机机会约束模型。对三站定位问题进行了仿真,利用混合智能算法得到了不同情况下的最优布站策略。     

高速互联线的高频串扰仿真研究

为了研究PCB板上高速互联线之间的串扰,基于传输线分布参数节点导纳方程和快速傅里叶逆变换技术,仿真研究了PCB板布线间的串扰电压响应,分析了分布参数、线长度及端接阻抗对串扰强弱的影响,提出了减少串扰的措施。仿真结果表明：串扰电压值随分布电感的增加而减小,随分布电容的增加变化不明显;串扰电压值随线长增加而减小;串扰电压值随干扰线端接阻抗的增加而减小,随受扰线端接阻抗的增大而增大。     

微结构阵列超精密车床快刀伺服装置及试验研究

各种微结构阵列在LED照明、液晶显示、光学仪器等领域得到了广泛的应用,但其结构细微复杂且形状表面质量要求高,其加工工艺技术研究引起了广泛的关注。本文提出压电陶瓷驱动结合柔性铰链作为刀架的快刀伺服装置,建立快刀伺服系统的机电耦合模型,研究各系统参数对系统性能的影响规律,基于有限元仿真对铰链结构参数进行优化;通过激光位移传感器测试刀具输出位移的线性度;利用研制的快刀系统和超精密车床在红铜材质的圆柱面上进行正弦网格微结构加工,加工结果表明所设计的快刀系统能够准确有效地加工出结构复杂的微结构阵列。     

A novel DOA estimation algorithm using directional antennas in cylindrical conformal arrays

In this paper, a novel direction of arrival (DOA) estimation algorithm using directional antennas in cy-lindrical conformal arrays (CCAs) is proposed. To eliminate the shadow effect, we divide the CCAs into several subarrays to obtain the complete output vector. Considering the anisotropic radiation pattern of a CCA, which cannot be separated from the manifold matrix, an improved interpolation method is investigated to transform the directional subarray into omnidirectional virtual nested arrays without non-orthogonal perturbation on the noise vector. Then, the cross-correlation matrix (CCM) of the sub-arrays is used to generate the consecutive co-arrays without redundant elements and eliminate the noise vector. Finally, the full-rank equivalent covariance matrix is constructed using the output of co-arrays, and the unitary estimation of the signal parameters via rotational invariance techniques (ESPRIT) is performed on the equivalent covariance matrix to estimate the DOAs with low computational complexity. Numerical simulations verify the superior performance of the proposed algorithm, especially under a low signal-to-noise ratio (SNR) environment.     

分布信号源的DOA估计

由于信号模型的偏差,传统的点目标假设下的DOA估计算法对分布信号源的估计误差较大,为此建立了分布信号源的模型,提出适用于分布源信号的DIS-MUSIC算法,并分析了该算法的估计性能。仿真结果表明,所提算法对分布信号源的DOA估计性能远优于MUSIC算法。     

一种非均匀噪声下的DOA估计算法

通用协方差差分算法用来实现对空间非均匀噪声环境下相干信号的波达方向(DOA)估计,该算法可以完全消除空间非均匀噪声,且适用于低信噪比环境,但该算法的DOA估计结果存在伪峰。针对这一问题,提出了一种改进的算法。改进算法通过对通用协方差差分(GCD)算法的信号协方差矩阵进行变换,再用特征分解的方法得到信号的DOA估计值。改进的算法可以完全消除伪峰,理论分析和仿真实验验证了改进算法的有效性。     

Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1

A queueing system characterized by the discrete batch Markovian arrival process (D-BMAP) and a probability of phase type distribution for the service time is one that arises frequently in the area of telecommunications. Under this arrival process and service time distribution we derive the waiting time distribution for three queue disciplines: first in first out (FIFO), last in first out (LIFO), and service in random order (SIRO). We also outline efficient algorithmic procedures for computing the waiting time distributions under each discipline. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 559–576, 1997