Efficient matrix inversion based on VLIW architecture

Matrix inversion is a critical part in communication, signal processing and electromagnetic system. A flexible and scalable very long instruction word （VLIW） processor with clustered architecture is proposed for matrix inversion. A global register file （RF） is used to connect al the clusters. Two nearby clusters share a local register file. The instruction sets are also designed for the VLIW processor. Experimental results show that the proposed VLIW architecture takes only 45 latency to invert a 4 × 4 matrix when running at 150 MHz. The proposed design is roughly five times faster than the DSP solution in processing speed.     

一种低信噪比下点目标检测新算法

针对红外探测系统对远距离目标进行实时临控的应用场合,提出了一种快速点目标检测算法。该算法将原始图像序列分割成多个小段,通过递推使用速度匹配滤波,能快速得到图像序列中目标轨迹的能量,从而提高低信噪比下点目标的检测能力。与其它检测算法相比,新算法具有检测概率高、算法复杂低等特点。对算法的原理和性能进行了详细地分析,通过仿真实验证明了该算法的有效性。     

宽度优先的频繁子图高效挖掘新算法

频繁子图已成为数据挖掘领域研究的热点之一。在经典的Apriori算法的基础上,提出了一种图挖掘的新算法Apriori-Graph。首先给出了一种新的、用于计算图的邻接矩阵规范编码的结点排序策略,大大降低了求图规范编码的复杂度,并可加速子图规范编码序列匹配的速度。其次,对候选子图的生成进行了规范。最后,针对频繁性检验这一瓶颈过程,给出了若干性质,从而较大地降低了候选子图频繁性判断的代价。实验结果表明,Apriori-Graph算法具有较高的挖掘效率。     

向量矩阵迭代自组织XML辅助聚类算法

为了提高海量XML文档集的聚类质量,提出了一种基于向量空间模型的矩阵迭代自组织XML辅助聚类算法。该算法以XML键为基础,把XML文档转化为向量矩阵,通过矩阵迭代自组织学习对XML文档实施取消、分裂与合并等优化措施。为了加速算法的收敛性,在算法中引入辅助策略,虽然不一定达到矩阵向量分类间隔最大化的目标,却在尽可能分类的情况下使得运算时间缩短,其XML键权重调整更有利聚类效果。对比其它向量聚类算法,一系列仿真实验表明所提出算法具有一定的有效性及合理性。     

多层前向神经网络带正则化因子的算法

针对权衰减递推最小二乘算法(trueweightdecayRLS,TWDRLS)每迭代一步计算复杂度和存储要求很大,基于局部线性最小二乘算法(locallinearizedleastsquaresalgorithm,LLLS)与正则化因子,给出了多层前向神经网络带正则化因子的LLLS算法,大大减小了TWDRLS算法每迭代一步计算的复杂度和存储量。实验表明,改进的算法提高了原LLLS算法的鲁棒性和泛化能力,其性能接近TWDRLS算法。     

New UWB imaging algorithm for multiple targets detection

Because the conventional ultra wideband(UWB) radar imaging algorithm cannot meet the demand in the capability of multiple targets detection,a novel UWB radar imaging algorithm based on the near field radiation theory of dipole is presented.On the foundation of researching the principle of a time domain imaging algorithm,the back projection(BP) algorithm is derived and analyzed.Firstly,the far field sampling data are transferred to the near field sampling data by using the near field radiation theory of dipo...     

Nonnegative matrix factorization with Log Gabor wavelets for image representation and classification

1.INTRODUCTION Inpatternanalysisandcomputervision,visualrecog nitionofobjectsisoneofthemostchallengingprob lems.Approachestoovercomesuchproblemshavefo cusedonusingseveralmethodologies.Appearance basedrepresentationandrecognitionisoneofthe mostsuccessfullyusedtoday.Itinvolvespreprocess ingofmultidimensionalsignals,suchasimagesof facesandcharactersorspectrogramsofspeech.In fact,thecoreofthepreprocessingisthesocalleddi mensionalityreduction.Thedimensionalityreductionaimstocompress thehighdi…     

模糊互补判断矩阵排序的一种算法

对模糊一致性判断矩阵转换公式的参数进行了对比分析,给出了模糊互补判断矩阵排序的一个通用公式,并且把它推广到群体决策的情形,该公式不仅充分包含了模糊一致性判断矩阵的优良特性及其判断信息,而且所需计算量小、简洁、合理、有效,在实际应用中将给人们带来很大的方便,最后进行了算例分析。     

New analytical imaging algorithm for general case airborne bistatic SAR

This paper focuses on the general case （GC） airborne bistatic synthetic aperture radar （SAR） data processing, and a new analytical imaging algorithm based on the extended Loffeld＇s bistatic formula （ELBF） is proposed. According to the bistatic SAR geometry, the track decoupling formulas that convert the bistatic geometry to the receiver-referenced geometry in a concise way are derived firstly. Then phase terms of ELBF are decomposed into two independent phase terms as the range phase term and the azimuth phase term in a new way. To get the focusing result, the bistatic deformation （BD） term is compensated in the two-dimensional （2- D） frequency domain, and the space-variances of the range phase term and the azimuth phase term are eliminated by chirp scaling （CS） and chirp z-transform （CZT）, respectively. The effectiveness of the proposed algorithm is verified by the simulation results.     

产品数据管理中任务指派问题的模型和算法

产品数据管理(product data management,PDM)中的任务具有紧前约束、可拆分特性和时间窗.为了使有限的设计资源得到合理利用,建立了产品数据管理中任务指派问题的数学模型,其目标是总项目工期最短,任务拆分次数最少和任务中断时间最短.设计了一种基于贪婪准则的遗传算法对模型进行求解,对遗传算法的染色体编码方案和解码规则,适值函数和遗传算子等进行了详细说明.最后给出了一个应用实例,验证了模型和算法的有效性.     

Degradation algorithm of compressive sensing

The compressive sensing(CS) theory allows people to obtain signal in the frequency much lower than the requested one of sampling theorem.Because the theory is based on the assumption of that the location of sparse values is unknown,it has many constraints in practical applications.In fact,in many cases such as image processing,the location of sparse values is knowable,and CS can degrade to a linear process.In order to take full advantage of the visual information of images,this paper proposes the concept of dimensionality reduction transform matrix and then selects sparse values by constructing an accuracy control matrix,so on this basis,a degradation algorithm is designed that the signal can be obtained by the measurements as many as sparse values and reconstructed through a linear process.In comparison with similar methods,the degradation algorithm is effective in reducing the number of sensors and improving operational efficiency.The algorithm is also used to achieve the CS process with the same amount of data as joint photographic exports group(JPEG) compression and acquires the same display effect.     

分配问题的一种新的迭代算法

针对解决分配问题的匈牙利法运算步骤复杂的问题,提出一种新的迭代算法。该算法通过引入有向检测矩阵,利用Floyd算法进行迭代,求解出可行解即为最优解。与经典的匈牙利法相比,该算法更加简便,易于编制成计算机程序,适合于大规模分配问题的计算。     

阵列天线干扰抑制的一种改进遗传算法

提出了一种阵列天线干扰抑制的改进遗传算法,在射频端基于功率判决直接通过调节权系数进行波束合成,可以有效地抑制与信号方向不同的干扰。该算法引入嫁接遗传算法的基本思想,采用一个交叉矩阵来确定每一代每一个个体的交叉概率,避免了基本遗传算法过早收敛的缺点,提高了收敛性能。计算机仿真实验表明了该算法的有效性和鲁棒性。     

一种新的三对角线性方程组分布式并行算法

根据分而治之的思想提出了一种求解严格对角占优的三对角线性方程组的分布式并行算法(newdis tributedparallelalgorithm,NDPA)。当方程组的系数矩阵满足对角占优时,该算法是数值稳定的。新算法的算法复杂性和最优串行追赶法差不多,算法总通信建立次数为2,仅在相邻处理器间进行通信,且每次通信传送2个数据元素分析了算法的加速比、效率以及算法的可扩展性,给出了基于局域网的MPI异构环境下数值实验结果。数值实验结果表示,该算法是高效的。     

基于蚁群算法的多目标跟踪方法

提出了一种新的基于蚁群算法的多目标跟踪方法.方法采用蚁群算法实现多目标跟踪中的数据关联,首先将多目标跟踪中的数据关联问题表示为具有约束条件的优化问题.用蚁群算法对该优化问题求解,得到的解即为最优关联.为验证该算法的有效性,在两种状态估计方法EKF(extended Kalman filter)和S1S(sequential importance sampling)的基础上进行了多目标跟踪实验,并且与传统的NN(nearest neighbor)方法进行了比较.在与SIS框架结合时,算法中采样粒子包括状态矢量和关联矢量,状态矢量通过序贯重要性重采样获得,关联矢量通过蚁群算法求得.实验结果表明,将蚁群算法融合进SIS算法进行多目标跟踪是有效的.     

Solving algorithm for TA optimization model based on ACO-SA

An ant colony optimization (ACO)-simulated annealing (SA)-based algorithm is developed for the target assignment problem (TAP) in the air defense (AD) command and control (C2) system of surface to air missile (SAM) tactical unit.The accomplishment process of target assignment (TA) task is analyzed.A firing advantage degree (FAD) concept of fire unit (FU) intercepting targets is put forward and its evaluation model is established by using a linear weighted synthetic method.A TA optimization model is presented and its solving algorithms are designed respectively based on ACO and SA.A hybrid optimization strategy is presented and developed synthesizing the merits of ACO and SA.The simulation examples show that the model and algorithms can meet the solving requirement of TAP in AD combat.     

通信网络可靠性指标的新定义及计算方法

为了从网络的宏观角度更全面地评估通信可靠性能,新定义了一套把网络拓扑连通性与传输容量有机地综合在一起的通信网可靠性指标———归一化容量加权可靠性指标,并从网络设计的主观和客观角度以及兼容传统指标等方面阐述了新定义指标的合理性与全面性。为了利于用新指标分析实际问题,研究出一套新指标的计算方法。从路由寻找到不交化网络状态及其对应容量的计算,所有运算过程都实现了易于程序化分析的代数化计算,并论证了算法每个环节的正确性。通过典型算例详述了新指标的计算方法,并以新指标作为参考扼要地介绍了提高网络可靠性方法。     

一种求解作业车间调度问题的混和遗传算法

作业车间调度问题(JSSP)是组合优化问题中的NP难问题。本文提出了以适用于JSSP问题的二进制编码遗传算法为基础,在算法中增加了两种启发式算子:激活算子和瓶颈修复算子,并相应调整算法结构,形成混和遗传算法解决JSSP问题。激活算子以GT算法为依据,将种群中部分个体转化为活动调度个体,是一种较有独创性的新算子;瓶颈修复算子对所得结果进一步优化。算例运行结果表明与其它算法相比,该算法在全局搜索能力和运行效率上都有突出的表现。     

Heuristic algorithm for RCPSP with the objective of minimizing activities'''' cost

1.INTRODUCTIONPartner selection is an i mportant problemin supplychain management.When we design a constructionsupply chainin which general contractor is the kernelentity,general contractor’s project scheduling will beconstrained by the capacities of the renewable re-sources supplied by the partners such as subcontrac-tor,ready-mix concrete vendor.We should considerhowto get theleast activities’cost of the project withthe constraints of due date and resource capacities ofevery partner re…     

Integration of spatial attractions between and within pixels for sub-pixel mapping

As a promising technique to enhance the spatial resolution of remote sensing imagery,sub-pixel mapping is processed based on the spatial dependence theory with the assumption that the land cover is spatially dependent both within pixels and between them.The spatial attraction is used as a tool to describe the dependence.First,the spatial attractions between pixels,subpixel/pixel spatial attraction model (SPSAM),are described by the modified SPSAM (MSPSAM) that estimates the attractions according to the distribution of sub-pixels within neighboring pixels.Then a mixed spatial attraction model (MSAM) for sub-pixel mapping is proposed that integrates the spatial attractions both within pixels and between them.According to the expression of the MSAM maximumising the spatial attraction,the genetic algorithm is employed to search the optimum solution and generate the sub-pixel mapping results.Experiments show that compared with SPSAM,MSPSAM and pixel swapping algorithm modified by initialization from SPSAM (MPS),MSAM can provide higher accuracy and more rational sub-pixel mapping results.